是否有一种“计算”快速的方法来获取迭代器的数量?
int i = 0;
for ( ; some_iterator.hasNext() ; ++i ) some_iterator.next();
...似乎浪费了CPU周期。
to provide an implementation-independent method for access, in which the user does not need to know whether the underlying implementation is some form of array or of linked list, and allows the user go through the collection without explicit indexing.
penguin.ewu.edu/~trolfe/LinkedSort/Iterator.html