java.util
Class LinkedHashMap.LinkedHashIterator
java.lang.Object
java.util.LinkedHashMap.LinkedHashIterator
- All Implemented Interfaces:
- Iterator
- Direct Known Subclasses:
- LinkedHashMap.EntryIterator, LinkedHashMap.KeyIterator, LinkedHashMap.ValueIterator
- Enclosing class:
- LinkedHashMap
- private abstract class LinkedHashMap.LinkedHashIterator
- extends Object
- implements Iterator
Method Summary |
boolean |
hasNext()
Returns true if the iteration has more elements. |
(package private) LinkedHashMap.Entry |
nextEntry()
|
void |
remove()
Removes from the underlying collection the last element returned by the
iterator (optional operation). |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
nextEntry
LinkedHashMap.Entry nextEntry
lastReturned
LinkedHashMap.Entry lastReturned
expectedModCount
int expectedModCount
- The modCount value that the iterator believes that the backing
List should have. If this expectation is violated, the iterator
has detected concurrent modification.
LinkedHashMap.LinkedHashIterator
private LinkedHashMap.LinkedHashIterator()
hasNext
public boolean hasNext()
- Description copied from interface:
Iterator
- Returns true if the iteration has more elements. (In other
words, returns true if next would return an element
rather than throwing an exception.)
- Specified by:
hasNext
in interface Iterator
- Returns:
- true if the iterator has more elements.
remove
public void remove()
- Description copied from interface:
Iterator
- Removes from the underlying collection the last element returned by the
iterator (optional operation). This method can be called only once per
call to next. The behavior of an iterator is unspecified if
the underlying collection is modified while the iteration is in
progress in any way other than by calling this method.
- Specified by:
remove
in interface Iterator
nextEntry
LinkedHashMap.Entry nextEntry()