Index[SYMBOL] [A] [B] [C] [D] [E] [F] [G] [H] [I] [J] [K] [L] [M] [N] [O] [P] [Q] [R] [S] [T] [U] [V] [W] last SortedSet 2nd Last In First Out 2nd lastEntry NavigableMap lastIndexOf List lastIndexOfSubList Collections 2nd lastKey SortedMap Lea, Doug Least Recently Used vs FIFO legacy class 2nd 3rd 4th client 2nd 3rd code 2nd 3rd 4th 5th 6th 7th 8th 9th 10th 11th interface library 2nd 3rd 4th 5th method object signature legacy collections legacy data type library 2nd 3rd 4th 5th 6th generic reflection lightweight process linear (time) linear probing linked list 2nd 3rd 4th 5th 6th LinkedBlockingDeque constructors performance weakly consistent iterators LinkedBlockingQueue 2nd 3rd 4th 5th 6th constructors performance weakly consistent iterators LinkedHashMap 2nd 3rd access-ordered constructors fail-fast iterators insertion-ordered 2nd iteration orders performance put putAll removeEldestEntry 2nd LinkedHashSet 2nd 3rd 4th 5th constructors fail-first iterators not thread-safe performance unsychronized LinkedList 2nd 3rd 4th 5th 6th constructors fail-fast iterators thread safety List 2nd 3rd 4th 5th 6th 7th 8th 9th 10th 11th 12th 13th 14th 15th 16th 17th 18th 19th 20th 21st 22nd 23rd 24th 25th 26th 27th add 2nd addAll contains containsAll get 2nd implementations of indexOf lastIndexOf LinkedList implementation operations performance 2nd remove set 2nd subList list 2nd adding elements changing contents 2nd changing elements iterator linked lteration positional access range-view 2nd search singly-linked traversing traversing in reverse usual ordering ListIterator 2nd add hasNext hasPrevious 2nd listIterator next nextIndex 2nd previous previousIndex remove set listIterator AbstractSequentialList ListIterator Lock unlock lock 2nd 3rd lock striping lock-free deletion lock-free insertion locking client-side 2nd 3rd locks logarithmic (time) loop loop condition lower NavigableSet lowerEntry NavigableMap lteration lists |