首页 > 代码库 > ListIterator
ListIterator
public interface ListIterator<E> extends Iterator<E>
An iterator for lists that allows the programmer to traverse the list in either direction, modify the list during iteration, and obtain the iterator‘s current position in the list. A
ListIterator
has no current element; its cursor position always lies between the element that would be returned by a call to previous()
and the element that would be returned by a call to next()
. An iterator for a list of length n
has n+1
possible cursor positions, as illustrated by the carets (^
) below:
Element(0) Element(1) Element(2) ... Element(n-1) cursor positions: ^ ^ ^ ^ ^Note that the
remove()
and set(Object)
methods are not defined in terms of the cursor position; they are defined to operate on the last element returned by a call to next()
or previous()
.void |
add(E e)
Inserts the specified element into the list (optional operation).
|
boolean |
hasNext()
Returns
true if this list iterator has more elements when traversing the list in the forward direction. |
boolean |
hasPrevious()
Returns
true if this list iterator has more elements when traversing the list in the reverse direction. |
E |
next()
Returns the next element in the list and advances the cursor position.
|
int |
nextIndex()
Returns the index of the element that would be returned by a subsequent call to
next() . |
E |
previous()
Returns the previous element in the list and moves the cursor position backwards.
|
int |
previousIndex()
Returns the index of the element that would be returned by a subsequent call to
previous() . |
void |
remove()
Removes from the list the last element that was returned by
next() or previous() (optional operation). |
void |
set(E e) |
ListIterator
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。