Java util linkedlist listitr

Field Summary
private int	expectedModCount
private LinkedList.Entry	lastReturned
private LinkedList.Entry	next
private int	nextIndex

Constructor Summary
(package private)	LinkedList.ListItr (int index)

Method Summary
void	add (Object o)
(package private) void	checkForComodification ()
boolean	hasNext ()
boolean	hasPrevious ()
Object	next ()
int	nextIndex ()
Object	previous ()
int	previousIndex ()
void	remove ()
void	set (Object o)

Methods inherited from class java.lang.Object

, clone, equals, finalize, getClass, hashCode, notify, notifyAll, registerNatives, toString, wait, wait, wait

lastReturned

nextIndex

expectedModCount

private int expectedModCount

LinkedList.ListItr

LinkedList.ListItr(int index)

hasNext

hasPrevious

public boolean hasPrevious()

nextIndex

previousIndex

remove

set

add

checkForComodification

final void checkForComodification()

Источник

Java util linkedlist listitr

Doubly-linked list implementation of the List and Deque interfaces. Implements all optional list operations, and permits all elements (including null ). All of the operations perform as could be expected for a doubly-linked list. Operations that index into the list will traverse the list from the beginning or the end, whichever is closer to the specified index. Note that this implementation is not synchronized. If multiple threads access a linked list concurrently, and at least one of the threads modifies the list structurally, it must be synchronized externally. (A structural modification is any operation that adds or deletes one or more elements; merely setting the value of an element is not a structural modification.) This is typically accomplished by synchronizing on some object that naturally encapsulates the list. If no such object exists, the list should be «wrapped» using the Collections.synchronizedList method. This is best done at creation time, to prevent accidental unsynchronized access to the list:

List list = Collections.synchronizedList(new LinkedList(. ));

The iterators returned by this class’s iterator and listIterator methods are fail-fast: if the list is structurally modified at any time after the iterator is created, in any way except through the Iterator’s own remove or add methods, the iterator will throw a ConcurrentModificationException . Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future. Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw ConcurrentModificationException on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs. This class is a member of the Java Collections Framework.

Field Summary

Fields inherited from class java.util.AbstractList

Constructor Summary

Constructs a list containing the elements of the specified collection, in the order they are returned by the collection’s iterator.

Method Summary

Appends all of the elements in the specified collection to the end of this list, in the order that they are returned by the specified collection’s iterator.

Inserts all of the elements in the specified collection into this list, starting at the specified position.

Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element.

Returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element.

Returns a list-iterator of the elements in this list (in proper sequence), starting at the specified position in the list.

Retrieves, but does not remove, the first element of this list, or returns null if this list is empty.

Retrieves, but does not remove, the last element of this list, or returns null if this list is empty.

Removes the first occurrence of the specified element in this list (when traversing the list from head to tail).

Removes the last occurrence of the specified element in this list (when traversing the list from head to tail).

Returns an array containing all of the elements in this list in proper sequence (from first to last element).

Returns an array containing all of the elements in this list in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array.

Источник

Class LinkedList

Doubly-linked list implementation of the List and Deque interfaces. Implements all optional list operations, and permits all elements (including null ).

All of the operations perform as could be expected for a doubly-linked list. Operations that index into the list will traverse the list from the beginning or the end, whichever is closer to the specified index.

Note that this implementation is not synchronized. If multiple threads access a linked list concurrently, and at least one of the threads modifies the list structurally, it must be synchronized externally. (A structural modification is any operation that adds or deletes one or more elements; merely setting the value of an element is not a structural modification.) This is typically accomplished by synchronizing on some object that naturally encapsulates the list. If no such object exists, the list should be «wrapped» using the Collections.synchronizedList method. This is best done at creation time, to prevent accidental unsynchronized access to the list:

List list = Collections.synchronizedList(new LinkedList(. ));

Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw ConcurrentModificationException on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs.

This class is a member of the Java Collections Framework.

Источник

Java util linkedlist listitr

All Implemented Interfaces: Iterator, ListIterator Enclosing class: LinkedList private class LinkedList.ListItr extends Object implements ListIterator

Field Summary
private int	expectedModCount
private LinkedList.Entry	lastReturned
private LinkedList.Entry	next
private int	nextIndex

Constructor Summary
(package private)	LinkedList.ListItr (int index)

Method Summary
void	add (Object o) Inserts the specified element into the list (optional operation).
(package private) void	checkForComodification ()
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.
Object	next () Returns the next element in the list.
int	nextIndex () Returns the index of the element that would be returned by a subsequent call to `next`.
Object	previous () Returns the previous element in the list.
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 (Object o) Replaces the last element returned by `next` or `previous` with the specified element (optional operation).

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

lastReturned

nextIndex

expectedModCount

private int expectedModCount

LinkedList.ListItr

LinkedList.ListItr(int index)

hasNext

Description copied from interface: ListIterator Returns true if this list iterator has more elements when traversing the list in the forward direction. (In other words, returns true if next would return an element rather than throwing an exception.)

Specified by: hasNext in interface ListIterator Returns: true if the list iterator has more elements when traversing the list in the forward direction.

Description copied from interface: ListIterator Returns the next element in the list. This method may be called repeatedly to iterate through the list, or intermixed with calls to previous to go back and forth. (Note that alternating calls to next and previous will return the same element repeatedly.)

Specified by: next in interface ListIterator Returns: the next element in the list.

hasPrevious

public boolean hasPrevious()

Description copied from interface: ListIterator Returns true if this list iterator has more elements when traversing the list in the reverse direction. (In other words, returns true if previous would return an element rather than throwing an exception.)

Specified by: hasPrevious in interface ListIterator Returns: true if the list iterator has more elements when traversing the list in the reverse direction.

Description copied from interface: ListIterator Returns the previous element in the list. This method may be called repeatedly to iterate through the list backwards, or intermixed with calls to next to go back and forth. (Note that alternating calls to next and previous will return the same element repeatedly.)

Specified by: previous in interface ListIterator Returns: the previous element in the list.

nextIndex

Description copied from interface: ListIterator Returns the index of the element that would be returned by a subsequent call to next. (Returns list size if the list iterator is at the end of the list.)

Specified by: nextIndex in interface ListIterator Returns: the index of the element that would be returned by a subsequent call to next, or list size if list iterator is at end of list.

previousIndex

Description copied from interface: ListIterator Returns the index of the element that would be returned by a subsequent call to previous. (Returns -1 if the list iterator is at the beginning of the list.)

Specified by: previousIndex in interface ListIterator Returns: the index of the element that would be returned by a subsequent call to previous, or -1 if list iterator is at beginning of list.

remove

Description copied from interface: ListIterator Removes from the list the last element that was returned by next or previous (optional operation). This call can only be made once per call to next or previous. It can be made only if ListIterator.add has not been called after the last call to next or previous.

Specified by: remove in interface ListIterator

set

Description copied from interface: ListIterator Replaces the last element returned by next or previous with the specified element (optional operation). This call can be made only if neither ListIterator.remove nor ListIterator.add have been called after the last call to next or previous.

Specified by: set in interface ListIterator Parameters: o — the element with which to replace the last element returned by next or previous.

add

Description copied from interface: ListIterator Inserts the specified element into the list (optional operation). The element is inserted immediately before the next element that would be returned by next, if any, and after the next element that would be returned by previous, if any. (If the list contains no elements, the new element becomes the sole element on the list.) The new element is inserted before the implicit cursor: a subsequent call to next would be unaffected, and a subsequent call to previous would return the new element. (This call increases by one the value that would be returned by a call to nextIndex or previousIndex.)

Specified by: add in interface ListIterator Parameters: o — the element to insert.

checkForComodification

final void checkForComodification()

Источник