why there is no add method in Iterator interface

Question

In Iterator Sun added the remove method to remove the last accessed element of the collection. Why there is no add method to add a new element to the collection? Wh

Answer 1

Okay, here we go:

The answer is clearly stated in the design faq:

Why don't you provide an Iterator.add method?

The semantics are unclear, given that the contract for Iterator makes no guarantees about the order of iteration. Note, however, that ListIterator does provide an add operation, as it does guarantee the order of the iteration.

http://docs.oracle.com/javase/1.4.2/docs/guide/collections/designfaq.html#10

Answer 2

Because ListIterator maintains the insertion order and so you can get to a point where you want to add. Iterator doesn't care about order and so what if it adds the object in past values while iterating than that would be a disaster. That's the reason iterator is only given remove() method because you have a particular object and place from where to remove.

Answer 3

I cannot think of any theoretical reason why add() could not have been included in Iterator. Just as the Iterator can allow for elements being removed from the collection through itself, it could be designed to handle elements being added in the same way.

But I will say that in all my years of programming in Java -- over 15! -- I have never wanted an Iterator.add() method. So I suspect it's simply not all that useful.

Answer 4

The sole purpose of an Iterator is to enumerate through a collection. All collections contain the add() method to serve your purpose. There would be no point in adding to an Iterator because the collection may or may not be ordered (in the case of a HashSet).

EDIT: While working on another problem, I came up with another reason that Iterator lacks an add() method. Looking under the hood of ArrayList (line 111), and HashMap (line 149), we see that the implementation is just a few methods surrounding an array of objects. Now we consider how arrays are treated in memory.

This is an array of 5 elements. However, there are six indices. The letter "a" in this array is listed as element 0 because in order to read it, left to right like a computer does, you have to start at index 0. Now, if we are iterating through this array (yes, collection, but it boils down to an array), we will start at index 0 and continue to index 1. At this point in the Iterator, we want to call add("f");. At this point, let's compare the implications of add() and remove(). remove() would leave a space in the array, which is easy to jump over, because we can immediately recognize that it isn't a member. On the other hand, add() would put a new element in which wasn't there before. This will affect the length of the array that we're iterating through. What happens when we get to that last element? Can we even guarantee that it is there (that is, that the array hasn't exceeded the maximum size)?

All in all, the arguments one way or another both have valid points, but the bottom line is that the behavior of an add() method is not well defined in all cases. Sun had to make a choice where to limit functionality, and they chose not to include this method.

Answer 5

Iterator have a pointer to the next element only. where as ListIterator have pointers to the previous element also(remember, it can traverse backwards).

Answer 6

If you are working on a list you could use ListIterator which provides both add and remove operations.