| org.apache.commons.collections.primitives.LongListIterator
All known Subclasses: org.apache.commons.collections.primitives.decorators.ProxyLongListIterator, org.apache.commons.collections.primitives.adapters.ListIteratorLongListIterator,
| Method Summary | |
| void | add(long element)
Inserts the specified element into my underlying collection
(optional operation).
The element is inserted immediately before the next element
that would have been returned by
LongListIterator.next , if any,
and immediately after the next element that would have been
returned by
LongListIterator.previous , if any.
The new element is inserted immediately before the implied
cursor. | | boolean | hasNext()
Returns true iff I have more elements
when traversed in the forward direction. | | boolean | hasPrevious()
Returns true iff I have more elements
when traversed in the reverse direction. | | long | next()
Returns the next element in me when traversed in the
forward direction. | | int | nextIndex()
Returns the index of the element that would be returned
by a subsequent call to
LongListIterator.next , or the number
of elements in my iteration if I have no next element. | | long | previous()
Returns the next element in me when traversed in the
reverse direction. | | int | previousIndex()
Returns the index of the element that would be returned
by a subsequent call to
LongListIterator.previous , or
-1 if I have no previous element. | | void | remove()
Removes from my underlying collection the last
element returned by
LongListIterator.next or
LongListIterator.previous (optional operation). | | void | set(long element)
Replaces in my underlying collection the last
element returned by
LongListIterator.next or
LongListIterator.previous with the specified value (optional operation). |
| hasNext | | boolean hasNext()(Code) | | Returns true iff I have more elements
when traversed in the forward direction.
(In other words, returns true iff
a call to
LongListIterator.next will return an element
rather than throwing an exception.
true iff I have more elements when traversed in the forward direction |
| hasPrevious | | boolean hasPrevious()(Code) | | Returns true iff I have more elements
when traversed in the reverse direction.
(In other words, returns true iff
a call to
LongListIterator.previous will return an element
rather than throwing an exception.
true iff I have more elements when traversed in the reverse direction |
| next | | long next()(Code) | | Returns the next element in me when traversed in the
forward direction.
the next element in me
throws:
NoSuchElementException - if there is no next element |
| nextIndex | | int nextIndex()(Code) | | Returns the index of the element that would be returned
by a subsequent call to
LongListIterator.next , or the number
of elements in my iteration if I have no next element.
the index of the next element in me |
| previous | | long previous()(Code) | | Returns the next element in me when traversed in the
reverse direction.
the previous element in me
throws:
NoSuchElementException - if there is no previous element |
| previousIndex | | int previousIndex()(Code) | | Returns the index of the element that would be returned
by a subsequent call to
LongListIterator.previous , or
-1 if I have no previous element.
the index of the previous element in me |
|
|