Note that toArray(new Object) is identical in function to
#Poll java queue code
The following code can be used to dump the list into a newly Suppose x is a list known to contain only strings. Under certain circumstances, be used to save allocation costs. Precise control over the runtime type of the output array, and may, Like the toArray() method, this method acts as bridge betweenĪrray-based and collection-based APIs. The caller knows that the list does not contain any null elements.) (This is useful in determining the length of the list only if Immediately following the end of the list is set to null. The array has more elements than the list), the element in the array If the list fits in the specified array with room to spare (i.e., Otherwise, a newĪrray is allocated with the runtime type of the specified array and In the specified array, it is returned therein. The returned array is that of the specified array. Proper sequence (from first to last element) the runtime type of Returns an array containing all of the elements in this list in descendingIterator public Iterator descendingIterator().( index size()) See Also: List.listIterator(int) Sequence), starting at the specified position in the list Throws: IndexOutOfBoundsException - if the index is out of range List-iterator (by a call to next) Returns: a ListIterator of the elements in this list (in proper Specified by: listIterator in interface List Specified by: listIterator in class AbstractSequentialList Parameters: index - index of the first element to be returned from the Than risking arbitrary, non-deterministic behavior at an undetermined Thus, in the face ofĬoncurrent modification, the iterator fails quickly and cleanly, rather Through the list-iterator's own remove or addĬoncurrentModificationException. Modified at any time after the Iterator is created, in any way except The list-iterator is fail-fast: if the list is structurally Obeys the general contract of List.listIterator(int). Sequence), starting at the specified position in the list. Returns a list-iterator of the elements in this list (in proper Therefore, it would be wrong to write a program that depended on thisĮxception for its correctness: the fail-fast behavior of iterators Throw ConcurrentModificationException on a best-effort basis. Presence of unsynchronized concurrent modification. Note that the fail-fast behavior of an iterator cannot be guaranteedĪs it is, generally speaking, impossible to make any hard guarantees in the Risking arbitrary, non-deterministic behavior at an undetermined
Modification, the iterator fails quickly and cleanly, rather than Structurally modified at any time after the iterator is created, inĪny way except through the Iterator's own remove orĪdd methods, the iterator will throw a ConcurrentModificationException. ListIterator methods are fail-fast: if the list is The iterators returned by this class's iterator and List list = Collections.synchronizedList(new LinkedList(.)) This is best done at creation time, to prevent accidental If no such object exists, the list should be "wrapped" using the
That adds or deletes one or more elements merely setting the value ofĪn element is not a structural modification.) This is typicallyĪccomplished by synchronizing on some object that naturally (A structural modification is any operation One of the threads modifies the list structurally, it must be If multiple threads access a linked list concurrently, and at least Note that this implementation is not synchronized. The beginning or the end, whichever is closer to the specified index. Operations that index into the list will traverse the list from Implements all optional list operations, and permits allĪll of the operations perform as could be expected for a doubly-linked Doubly-linked list implementation of the List and Deque
0 kommentar(er)
