Phase 3

In this step, you will provide iteration for IntList objects by implementing the following member function(s) of the IntList class,

• begin()
• end()

and implement the following member function(s) of the IntList::Iter class,

• operator*() (the indirection operator)
• operator++() (the increment operator)
• operator==(…) (the equal-to operator)

These operations are described in the

• IntList Specifications

which also describes the encoding for iterators with a useful diagram. You should have the spec open in another window or tab so you can easily consult it as you work, but for your convenience, the diagram is also reproduced here:

Steps

1. Plan

The encoding for IntList::Iter is already determined; it is a class that stores a pointer to a Node (in current_). What remains is for you to figure out

1. What *iter does to return the integer stored inside the node.
2. In the diagram above, the iterator is set to the second node in the list. How can we get to the integer 24 that it contains?
3. What ++iter will do to move on to the next node.
4. In the diagram above, would need update current_ from its present value, h78, now point to the next node in list, which is h56. How do we get that value?
5. How iter1 == iter2 will determine whether the two iterators are set to the exact same list node.

Also, in the IntList class, the begin() and end() member functions need to make Iter objects and return them. You'll need to figure out

1. What myList.begin() should return.
2. In the diagram above, it returns an Iter with current_ set to h42. How would we do that?
3. What myList.end() should return.
4. Note that if you've correctly figured out ++, you just need to think about what will actually happen if you have an iterator set to the last node in the list (h56 in our diagram) and then call ++ on that iterator. Whatever value the iterator is then set to is the past-the-end value.

Note that the Iter class has two constructors, both of which have been provided. They are

• A public default constructor to create an iterator that isn't set at any node in any list.
• A private (explicit) parameterized constructor that takes a Node* and constructs an iterator object, initializing current_ to be the provided Node* parameter.
• This constructor may be called by IntList member functions (e.g., begin() and end()) because IntList is marked as being a friend of IntList::Iter.

Don't Overcomplicate Things!

Although you might have to think and look at the diagram above to figure out what needs to be done, once you've figured it out, it should be very straightforward. If you've done things correctly, there should be no need for loops, or even conditional code. Oftentimes, students wonder “Is this it?? That's all?”

Also note that when there is no difference at all in implementation between the const and non-const versions of begin() and end(). You'll write the code for the non-const version, and then just paste the exact same code into the const version and it'll work.

Add and Upload Your Image File

For this phase, add your plan as Phase_3.jpg to the intlist/Planning folder in your assignment repository (git add; git commit; git push). Make sure the file was added successfully by viewing it on the GitHub website.

2. Write Tests

Next, you need to write some tests.

The user-visible functionality of a list iterator is independent of the specific encoding and implementation choices we've made for our IntList::Iter class. So in some sense, none of the planning you've done above directly factors into testing, as the only question is “does it work properly as an iterator”.

So, here are some things that should be true of any iterator on any kind of container:

• begin() is equal to end() if and only if the container is empty.
• If you insert some numbers into the container, you should be able to iterate over the container and read back those same numbers.

Maybe you can come up with another couple of ideas.

But you can also think about how someone else might have misunderstood or overcomplicated things when doing the planning stage, and how that issue might show up in an incorrect implementation.

3. Implement

Use your plan to write the iterator. If your plan is correct, it isn't much code to write.

4. Test & Debug

Test your iterator and debug as needed.

return *this;

(When logged in, completion status appears here.)