Index

A B C D E F G H I J K L N O P R S T V

A

add(E) - Method in class jsr166x.ArrayDeque: Inserts the specified element to the end of this deque.
add(E) - Method in class jsr166x.ConcurrentLinkedDeque: Inserts the specified element at the tail of this deque.
add(E) - Method in class jsr166x.ConcurrentSkipListSet: Adds the specified element to this set if it is not already present.
add(E) - Method in interface jsr166x.Deque: Inserts the specified element into the queue represented by this deque unless it would violate capacity restrictions.
add(E) - Method in class jsr166x.LinkedBlockingDeque
addAll(Collection<? extends E>) - Method in class jsr166x.ConcurrentLinkedDeque: Appends all of the elements in the specified collection to the end of this deque, in the order that they are returned by the specified collection's iterator.
addFirst(E) - Method in class jsr166x.ArrayDeque: Inserts the specified element to the front this deque.
addFirst(E) - Method in class jsr166x.ConcurrentLinkedDeque: Inserts the specified element at the front of this deque.
addFirst(E) - Method in interface jsr166x.Deque: Inserts the specified element to the front of this deque unless it would violate capacity restrictions.
addFirst(E) - Method in class jsr166x.LinkedBlockingDeque
addLast(E) - Method in class jsr166x.ArrayDeque: Inserts the specified element to the end this deque.
addLast(E) - Method in class jsr166x.ConcurrentLinkedDeque: Inserts the specified element at the end of this deque.
addLast(E) - Method in interface jsr166x.Deque: Inserts the specified element to the end of this deque unless it would violate capacity restrictions.
addLast(E) - Method in class jsr166x.LinkedBlockingDeque
ArrayDeque<E> - Class in jsr166x: Resizable-array implementation of the Deque interface.
ArrayDeque() - Constructor for class jsr166x.ArrayDeque: Constructs an empty array deque with the an initial capacity sufficient to hold 16 elements.
ArrayDeque(int) - Constructor for class jsr166x.ArrayDeque: Constructs an empty array deque with an initial capacity sufficient to hold the specified number of elements.
ArrayDeque(Collection<? extends E>) - Constructor for class jsr166x.ArrayDeque: Constructs a deque containing the elements of the specified collection, in the order they are returned by the collection's iterator.

B

BlockingDeque<E> - Interface in jsr166x: A Deque that additionally supports operations that wait for the deque to become non-empty when retrieving an element, and wait for space to become available in the deque when storing an element.

C

ceiling(E) - Method in class jsr166x.ConcurrentSkipListSet: Returns an element greater than or equal to the given element, or null if there is no such element.
ceiling(E) - Method in interface jsr166x.NavigableSet: Returns an element greater than or equal to the given element, or null if there is no such element.
ceilingEntry(K) - Method in class jsr166x.ConcurrentSkipListMap: Returns a key-value mapping associated with the least key greater than or equal to the given key, or null if there is no such entry.
ceilingEntry(K) - Method in interface jsr166x.NavigableMap: Returns a key-value mapping associated with the least key greater than or equal to the given key, or null if there is no such entry.
ceilingKey(K) - Method in class jsr166x.ConcurrentSkipListMap: Returns least key greater than or equal to the given key, or null if there is no such key.
ceilingKey(K) - Method in interface jsr166x.NavigableMap: Returns least key greater than or equal to the given key, or null if there is no such key.
clear() - Method in class jsr166x.ArrayDeque: Removes all of the elements from this deque.
clear() - Method in class jsr166x.ConcurrentLinkedDeque: Removes all of the elements from this deque.
clear() - Method in class jsr166x.ConcurrentSkipListMap: Removes all mappings from this map.
clear() - Method in class jsr166x.ConcurrentSkipListSet: Removes all of the elements from this set.
clear() - Method in class jsr166x.LinkedBlockingDeque: Atomically removes all of the elements from this deque.
clone() - Method in class jsr166x.ArrayDeque: Returns a copy of this deque.
clone() - Method in class jsr166x.ConcurrentSkipListMap: Returns a shallow copy of this Map instance.
clone() - Method in class jsr166x.ConcurrentSkipListSet: Returns a shallow copy of this set.
comparator() - Method in class jsr166x.ConcurrentSkipListMap: Returns the comparator used to order this map, or null if this map uses its keys' natural order.
comparator() - Method in class jsr166x.ConcurrentSkipListSet: Returns the comparator used to order this set, or null if this set uses its elements natural ordering.
ConcurrentLinkedDeque<E> - Class in jsr166x: A concurrent linked-list implementation of a Deque (double-ended queue).
ConcurrentLinkedDeque() - Constructor for class jsr166x.ConcurrentLinkedDeque: Constructs an empty deque.
ConcurrentLinkedDeque(Collection<? extends E>) - Constructor for class jsr166x.ConcurrentLinkedDeque: Constructs a deque initially containing the elements of the given collection, added in traversal order of the collection's iterator.
ConcurrentNavigableMap<K,V> - Interface in jsr166x: A ConcurrentMap supporting NavigableMap operations.
ConcurrentSkipListMap<K,V> - Class in jsr166x: A scalable ConcurrentNavigableMap implementation.
ConcurrentSkipListMap() - Constructor for class jsr166x.ConcurrentSkipListMap: Constructs a new empty map, sorted according to the keys' natural order.
ConcurrentSkipListMap(Comparator<? super K>) - Constructor for class jsr166x.ConcurrentSkipListMap: Constructs a new empty map, sorted according to the given comparator.
ConcurrentSkipListMap(Map<? extends K, ? extends V>) - Constructor for class jsr166x.ConcurrentSkipListMap: Constructs a new map containing the same mappings as the given map, sorted according to the keys' natural order.
ConcurrentSkipListMap(SortedMap<K, ? extends V>) - Constructor for class jsr166x.ConcurrentSkipListMap: Constructs a new map containing the same mappings as the given SortedMap, sorted according to the same ordering.
ConcurrentSkipListSet<E> - Class in jsr166x: A scalable concurrent NavigableSet implementation based on a ConcurrentSkipListMap.
ConcurrentSkipListSet() - Constructor for class jsr166x.ConcurrentSkipListSet: Constructs a new, empty set, sorted according to the elements' natural order.
ConcurrentSkipListSet(Comparator<? super E>) - Constructor for class jsr166x.ConcurrentSkipListSet: Constructs a new, empty set, sorted according to the specified comparator.
ConcurrentSkipListSet(Collection<? extends E>) - Constructor for class jsr166x.ConcurrentSkipListSet: Constructs a new set containing the elements in the specified collection, sorted according to the elements' natural order.
ConcurrentSkipListSet(SortedSet<E>) - Constructor for class jsr166x.ConcurrentSkipListSet: Constructs a new set containing the same elements as the specified sorted set, sorted according to the same ordering.
contains(Object) - Method in class jsr166x.ArrayDeque: Returns true if this deque contains the specified element.
contains(Object) - Method in class jsr166x.ConcurrentLinkedDeque: Returns true if this deque contains at least one element e such that o.equals(e).
contains(Object) - Method in class jsr166x.ConcurrentSkipListSet: Returns true if this set contains the specified element.
contains(Object) - Method in class jsr166x.LinkedBlockingDeque
containsKey(Object) - Method in class jsr166x.ConcurrentSkipListMap: Returns true if this map contains a mapping for the specified key.
containsValue(Object) - Method in class jsr166x.ConcurrentSkipListMap: Returns true if this map maps one or more keys to the specified value.

D

Deque<E> - Interface in jsr166x: A linear collection that supports element insertion and removal at both ends.
descendingEntrySet() - Method in class jsr166x.ConcurrentSkipListMap: Returns a collection view of the mappings contained in this map, in descending order.
descendingEntrySet() - Method in interface jsr166x.NavigableMap: Returns a set view of the mappings contained in this map, in descending key order.
descendingIterator() - Method in class jsr166x.ConcurrentLinkedDeque: Not yet implemented.
descendingIterator() - Method in class jsr166x.ConcurrentSkipListSet: Returns an iterator over the elements in this set.
descendingIterator() - Method in interface jsr166x.NavigableSet: Returns an iterator over the elements in this collection, in descending order.
descendingKeySet() - Method in class jsr166x.ConcurrentSkipListMap: Returns a set view of the keys contained in this map in descending order.
descendingKeySet() - Method in interface jsr166x.NavigableMap: Returns a set view of the keys contained in this map, in descending key order.
drainTo(Collection<? super E>) - Method in class jsr166x.LinkedBlockingDeque
drainTo(Collection<? super E>, int) - Method in class jsr166x.LinkedBlockingDeque

E

element() - Method in class jsr166x.ArrayDeque: Retrieves, but does not remove, the head of the queue represented by this deque.
element() - Method in class jsr166x.ConcurrentLinkedDeque
element() - Method in interface jsr166x.Deque: Retrieves, but does not remove, the head of the queue represented by this deque.
element() - Method in class jsr166x.LinkedBlockingDeque
entrySet() - Method in class jsr166x.ConcurrentSkipListMap: Returns a collection view of the mappings contained in this map.
equals(Object) - Method in class jsr166x.ConcurrentSkipListMap: Compares the specified object with this map for equality.
equals(Object) - Method in class jsr166x.ConcurrentSkipListSet: Compares the specified object with this set for equality.

F

first() - Method in class jsr166x.ConcurrentSkipListSet: Returns the first (lowest) element currently in this set.
firstEntry() - Method in class jsr166x.ConcurrentSkipListMap: Returns a key-value mapping associated with the least key in this map, or null if the map is empty.
firstEntry() - Method in interface jsr166x.NavigableMap: Returns a key-value mapping associated with the least key in this map, or null if the map is empty.
firstKey() - Method in class jsr166x.ConcurrentSkipListMap: Returns the first (lowest) key currently in this map.
floor(E) - Method in class jsr166x.ConcurrentSkipListSet: Returns an element less than or equal to the given element, or null if there is no such element.
floor(E) - Method in interface jsr166x.NavigableSet: Returns an element less than or equal to the given element, or null if there is no such element.
floorEntry(K) - Method in class jsr166x.ConcurrentSkipListMap: Returns a key-value mapping associated with the greatest key less than or equal to the given key, or null if there is no such entry.
floorEntry(K) - Method in interface jsr166x.NavigableMap: Returns a key-value mapping associated with the greatest key less than or equal to the given key, or null if there is no such entry.
floorKey(K) - Method in class jsr166x.ConcurrentSkipListMap: Returns the greatest key less than or equal to the given key, or null if there is no such key.
floorKey(K) - Method in interface jsr166x.NavigableMap: Returns the greatest key less than or equal to the given key, or null if there is no such key.

G

get(Object) - Method in class jsr166x.ConcurrentSkipListMap: Returns the value to which this map maps the specified key.
getFirst() - Method in class jsr166x.ArrayDeque: Retrieves, but does not remove, the first element of this deque.
getFirst() - Method in class jsr166x.ConcurrentLinkedDeque
getFirst() - Method in interface jsr166x.Deque: Retrieves, but does not remove, the first element of this deque.
getFirst() - Method in class jsr166x.LinkedBlockingDeque
getLast() - Method in class jsr166x.ArrayDeque: Retrieves, but does not remove, the last element of this deque.
getLast() - Method in class jsr166x.ConcurrentLinkedDeque
getLast() - Method in interface jsr166x.Deque: Retrieves, but does not remove, the last element of this deque.
getLast() - Method in class jsr166x.LinkedBlockingDeque

H

headMap(K) - Method in interface jsr166x.ConcurrentNavigableMap: Returns a view of the portion of this map whose keys are strictly less than toKey.
headMap(K) - Method in class jsr166x.ConcurrentSkipListMap: Returns a view of the portion of this map whose keys are strictly less than toKey.
headMap(K) - Method in interface jsr166x.NavigableMap: Returns a view of the portion of this map whose keys are strictly less than toKey.
headSet(E) - Method in class jsr166x.ConcurrentSkipListSet: Returns a view of the portion of this set whose elements are strictly less than toElement.
headSet(E) - Method in interface jsr166x.NavigableSet: Returns a view of the portion of this set whose elements are strictly less than toElement.
higher(E) - Method in class jsr166x.ConcurrentSkipListSet: Returns an element strictly greater than the given element, or null if there is no such element.
higher(E) - Method in interface jsr166x.NavigableSet: Returns an element strictly greater than the given element, or null if there is no such element.
higherEntry(K) - Method in class jsr166x.ConcurrentSkipListMap: Returns a key-value mapping associated with the least key strictly greater than the given key, or null if there is no such entry.
higherEntry(K) - Method in interface jsr166x.NavigableMap: Returns a key-value mapping associated with the least key strictly greater than the given key, or null if there is no such entry.
higherKey(K) - Method in class jsr166x.ConcurrentSkipListMap: Returns the least key strictly greater than the given key, or null if there is no such key.
higherKey(K) - Method in interface jsr166x.NavigableMap: Returns the least key strictly greater than the given key, or null if there is no such key.

I

isEmpty() - Method in class jsr166x.ArrayDeque: Returns true if this collection contains no elements.
isEmpty() - Method in class jsr166x.ConcurrentLinkedDeque: Returns true if this collection contains no elements.
isEmpty() - Method in class jsr166x.ConcurrentSkipListMap: Returns true if this map contains no key-value mappings.
isEmpty() - Method in class jsr166x.ConcurrentSkipListSet: Returns true if this set contains no elements.
iterator() - Method in class jsr166x.ArrayDeque: Returns an iterator over the elements in this deque.
iterator() - Method in class jsr166x.ConcurrentLinkedDeque: Returns an iterator over the elements in this deque in proper sequence.
iterator() - Method in class jsr166x.ConcurrentSkipListSet: Returns an iterator over the elements in this set.
iterator() - Method in interface jsr166x.Deque: Returns an iterator over the elements in this deque.
iterator() - Method in class jsr166x.LinkedBlockingDeque: Returns an iterator over the elements in this deque in proper sequence.

J

jsr166x - package jsr166x: jsr166x overview

K

keySet() - Method in class jsr166x.ConcurrentSkipListMap: Returns a set view of the keys contained in this map.

L

last() - Method in class jsr166x.ConcurrentSkipListSet: Returns the last (highest) element currently in this set.
lastEntry() - Method in class jsr166x.ConcurrentSkipListMap: Returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
lastEntry() - Method in interface jsr166x.NavigableMap: Returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
lastKey() - Method in class jsr166x.ConcurrentSkipListMap: Returns the last (highest) key currently in this map.
LinkedBlockingDeque<E> - Class in jsr166x: An optionally-bounded blocking deque based on linked nodes.
LinkedBlockingDeque() - Constructor for class jsr166x.LinkedBlockingDeque: Creates a LinkedBlockingDeque with a capacity of Integer.MAX_VALUE.
LinkedBlockingDeque(int) - Constructor for class jsr166x.LinkedBlockingDeque: Creates a LinkedBlockingDeque with the given (fixed) capacity.
LinkedBlockingDeque(Collection<? extends E>) - Constructor for class jsr166x.LinkedBlockingDeque: Creates a LinkedBlockingDeque with a capacity of Integer.MAX_VALUE, initially containing the elements of the given collection, added in traversal order of the collection's iterator.
lower(E) - Method in class jsr166x.ConcurrentSkipListSet: Returns an element strictly less than the given element, or null if there is no such element.
lower(E) - Method in interface jsr166x.NavigableSet: Returns an element strictly less than the given element, or null if there is no such element.
lowerEntry(K) - Method in class jsr166x.ConcurrentSkipListMap: Returns a key-value mapping associated with the greatest key strictly less than the given key, or null if there is no such entry.
lowerEntry(K) - Method in interface jsr166x.NavigableMap: Returns a key-value mapping associated with the greatest key strictly less than the given key, or null if there is no such entry.
lowerKey(K) - Method in class jsr166x.ConcurrentSkipListMap: Returns the greatest key strictly less than the given key, or null if there is no such key.
lowerKey(K) - Method in interface jsr166x.NavigableMap: Returns the greatest key strictly less than the given key, or null if there is no such key.

N

NavigableMap<K,V> - Interface in jsr166x: A SortedMap extended with navigation methods returning the closest matches for given search targets.
NavigableSet<E> - Interface in jsr166x: A SortedSet extended with navigation methods reporting closest matches for given search targets.

O

offer(E) - Method in class jsr166x.ArrayDeque: Inserts the specified element to the end of this deque.
offer(E, long, TimeUnit) - Method in interface jsr166x.BlockingDeque: Inserts the specified element as the lest element of this deque, if possible.
offer(E) - Method in class jsr166x.ConcurrentLinkedDeque: Inserts the specified element at the tail of this queue.
offer(E) - Method in interface jsr166x.Deque: Inserts the specified element into the queue represented by this deque unless it would violate capacity restrictions.
offer(E) - Method in class jsr166x.LinkedBlockingDeque
offer(E, long, TimeUnit) - Method in class jsr166x.LinkedBlockingDeque
offerFirst(E) - Method in class jsr166x.ArrayDeque: Inserts the specified element to the front this deque.
offerFirst(E, long, TimeUnit) - Method in interface jsr166x.BlockingDeque: Inserts the specified element as the first element of this deque, waiting if necessary up to the specified wait time for space to become available.
offerFirst(E) - Method in class jsr166x.ConcurrentLinkedDeque: Inserts the specified element at the front of this deque.
offerFirst(E) - Method in interface jsr166x.Deque: Inserts the specified element to the front this deque unless it would violate capacity restrictions.
offerFirst(E) - Method in class jsr166x.LinkedBlockingDeque
offerFirst(E, long, TimeUnit) - Method in class jsr166x.LinkedBlockingDeque
offerLast(E) - Method in class jsr166x.ArrayDeque: Inserts the specified element to the end this deque.
offerLast(E, long, TimeUnit) - Method in interface jsr166x.BlockingDeque: Inserts the specified element as the last element of this deque, waiting if necessary up to the specified wait time for space to become available.
offerLast(E) - Method in class jsr166x.ConcurrentLinkedDeque: Inserts the specified element at the end of this deque.
offerLast(E) - Method in interface jsr166x.Deque: Inserts the specified element to the end of this deque unless it would violate capacity restrictions.
offerLast(E) - Method in class jsr166x.LinkedBlockingDeque
offerLast(E, long, TimeUnit) - Method in class jsr166x.LinkedBlockingDeque

P

peek() - Method in class jsr166x.ArrayDeque: Retrieves, but does not remove, the head of the queue represented by this deque, returning null if this deque is empty.
peek() - Method in class jsr166x.ConcurrentLinkedDeque
peek() - Method in interface jsr166x.Deque: Retrieves, but does not remove, the head of the queue represented by this deque, returning null if this deque is empty.
peek() - Method in class jsr166x.LinkedBlockingDeque
peekFirst() - Method in class jsr166x.ArrayDeque: Retrieves, but does not remove, the first element of this deque, returning null if this deque is empty.
peekFirst() - Method in class jsr166x.ConcurrentLinkedDeque
peekFirst() - Method in interface jsr166x.Deque: Retrieves, but does not remove, the first element of this deque, returning null if this deque is empty.
peekFirst() - Method in class jsr166x.LinkedBlockingDeque
peekLast() - Method in class jsr166x.ArrayDeque: Retrieves, but does not remove, the last element of this deque, returning null if this deque is empty.
peekLast() - Method in class jsr166x.ConcurrentLinkedDeque
peekLast() - Method in interface jsr166x.Deque: Retrieves, but does not remove, the last element of this deque, returning null if this deque is empty.
peekLast() - Method in class jsr166x.LinkedBlockingDeque
poll() - Method in class jsr166x.ArrayDeque: Retrieves and removes the head of the queue represented by this deque, or null if this deque is empty.
poll(long, TimeUnit) - Method in interface jsr166x.BlockingDeque: Retrieves and removes the first element of this deque, waiting if necessary up to the specified wait time if no elements are present on this deque.
poll() - Method in class jsr166x.ConcurrentLinkedDeque
poll() - Method in interface jsr166x.Deque: Retrieves and removes the head of the queue represented by this deque, or null if this deque is empty.
poll() - Method in class jsr166x.LinkedBlockingDeque
poll(long, TimeUnit) - Method in class jsr166x.LinkedBlockingDeque
pollFirst() - Method in class jsr166x.ArrayDeque: Retrieves and removes the first element of this deque, or null if this deque is empty.
pollFirst(long, TimeUnit) - Method in interface jsr166x.BlockingDeque: Retrieves and removes the first element of this deque, waiting if necessary up to the specified wait time if no elements are present on this deque.
pollFirst() - Method in class jsr166x.ConcurrentLinkedDeque
pollFirst() - Method in class jsr166x.ConcurrentSkipListSet: Retrieves and removes the first (lowest) element.
pollFirst() - Method in interface jsr166x.Deque: Retrieves and removes the first element of this deque, or null if this deque is empty.
pollFirst() - Method in class jsr166x.LinkedBlockingDeque
pollFirst(long, TimeUnit) - Method in class jsr166x.LinkedBlockingDeque
pollFirst() - Method in interface jsr166x.NavigableSet: Retrieves and removes the first (lowest) element.
pollFirstEntry() - Method in class jsr166x.ConcurrentSkipListMap: Removes and returns a key-value mapping associated with the least key in this map, or null if the map is empty.
pollFirstEntry() - Method in interface jsr166x.NavigableMap: Removes and returns a key-value mapping associated with the least key in this map, or null if the map is empty.
pollLast() - Method in class jsr166x.ArrayDeque: Retrieves and removes the last element of this deque, or null if this deque is empty.
pollLast(long, TimeUnit) - Method in interface jsr166x.BlockingDeque: Retrieves and removes the last element of this deque, waiting if necessary up to the specified wait time if no elements are present on this deque.
pollLast() - Method in class jsr166x.ConcurrentLinkedDeque
pollLast() - Method in class jsr166x.ConcurrentSkipListSet: Retrieves and removes the last (highest) element.
pollLast() - Method in interface jsr166x.Deque: Retrieves and removes the last element of this deque, or null if this deque is empty.
pollLast() - Method in class jsr166x.LinkedBlockingDeque
pollLast(long, TimeUnit) - Method in class jsr166x.LinkedBlockingDeque
pollLast() - Method in interface jsr166x.NavigableSet: Retrieves and removes the last (highest) element.
pollLastEntry() - Method in class jsr166x.ConcurrentSkipListMap: Removes and returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
pollLastEntry() - Method in interface jsr166x.NavigableMap: Removes and returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
pop() - Method in class jsr166x.ArrayDeque: Pops an element from the stack represented by this deque.
pop() - Method in class jsr166x.ConcurrentLinkedDeque
pop() - Method in interface jsr166x.Deque: Pops an element from the stack represented by this deque.
pop() - Method in class jsr166x.LinkedBlockingDeque
push(E) - Method in class jsr166x.ArrayDeque: Pushes an element onto the stack represented by this deque.
push(E) - Method in class jsr166x.ConcurrentLinkedDeque
push(E) - Method in interface jsr166x.Deque: Pushes an element onto the stack represented by this deque.
push(E) - Method in class jsr166x.LinkedBlockingDeque
put(E) - Method in interface jsr166x.BlockingDeque: Adds the specified element as the last element of this deque, waiting if necessary for space to become available.
put(K, V) - Method in class jsr166x.ConcurrentSkipListMap: Associates the specified value with the specified key in this map.
put(E) - Method in class jsr166x.LinkedBlockingDeque
putFirst(E) - Method in interface jsr166x.BlockingDeque: Adds the specified element as the first element of this deque, waiting if necessary for space to become available.
putFirst(E) - Method in class jsr166x.LinkedBlockingDeque
putIfAbsent(K, V) - Method in class jsr166x.ConcurrentSkipListMap: If the specified key is not already associated with a value, associate it with the given value.
putLast(E) - Method in interface jsr166x.BlockingDeque: Adds the specified element as the last element of this deque, waiting if necessary for space to become available.
putLast(E) - Method in class jsr166x.LinkedBlockingDeque

R

remainingCapacity() - Method in class jsr166x.LinkedBlockingDeque: Returns the number of elements that this deque can ideally (in the absence of memory or resource constraints) accept without blocking.
remove() - Method in class jsr166x.ArrayDeque: Retrieves and removes the head of the queue represented by this deque.
remove(Object) - Method in class jsr166x.ArrayDeque: Removes a single instance of the specified element from this deque.
remove() - Method in class jsr166x.ConcurrentLinkedDeque
remove(Object) - Method in class jsr166x.ConcurrentLinkedDeque: Removes the first element e such that o.equals(e), if such an element exists in this deque.
remove(Object) - Method in class jsr166x.ConcurrentSkipListMap: Removes the mapping for this key from this Map if present.
remove(Object, Object) - Method in class jsr166x.ConcurrentSkipListMap: Removes entry for key only if currently mapped to given value.
remove(Object) - Method in class jsr166x.ConcurrentSkipListSet: Removes the specified element from this set if it is present.
remove() - Method in interface jsr166x.Deque: Retrieves and removes the head of the queue represented by this deque.
remove() - Method in class jsr166x.LinkedBlockingDeque
remove(Object) - Method in class jsr166x.LinkedBlockingDeque
removeAll(Collection<?>) - Method in class jsr166x.ConcurrentSkipListSet: Removes from this set all of its elements that are contained in the specified collection.
removeFirst() - Method in class jsr166x.ArrayDeque: Retrieves and removes the first element of this deque.
removeFirst() - Method in class jsr166x.ConcurrentLinkedDeque
removeFirst() - Method in interface jsr166x.Deque: Removes and returns the first element of this deque.
removeFirst() - Method in class jsr166x.LinkedBlockingDeque
removeFirstOccurrence(Object) - Method in class jsr166x.ArrayDeque: Removes the first occurrence of the specified element in this deque (when traversing the deque from head to tail).
removeFirstOccurrence(Object) - Method in class jsr166x.ConcurrentLinkedDeque: Removes the first element e such that o.equals(e), if such an element exists in this deque.
removeFirstOccurrence(Object) - Method in interface jsr166x.Deque: Removes the first occurrence of the specified element in this deque.
removeFirstOccurrence(Object) - Method in class jsr166x.LinkedBlockingDeque
removeLast() - Method in class jsr166x.ArrayDeque: Retrieves and removes the last element of this deque.
removeLast() - Method in class jsr166x.ConcurrentLinkedDeque
removeLast() - Method in interface jsr166x.Deque: Retrieves and removes the last element of this deque.
removeLast() - Method in class jsr166x.LinkedBlockingDeque
removeLastOccurrence(Object) - Method in class jsr166x.ArrayDeque: Removes the last occurrence of the specified element in this deque (when traversing the deque from head to tail).
removeLastOccurrence(Object) - Method in class jsr166x.ConcurrentLinkedDeque: Removes the last element e such that o.equals(e), if such an element exists in this deque.
removeLastOccurrence(Object) - Method in interface jsr166x.Deque: Removes the last occurrence of the specified element in this deque.
removeLastOccurrence(Object) - Method in class jsr166x.LinkedBlockingDeque
replace(K, V, V) - Method in class jsr166x.ConcurrentSkipListMap: Replaces entry for key only if currently mapped to given value.
replace(K, V) - Method in class jsr166x.ConcurrentSkipListMap: Replaces entry for key only if currently mapped to some value.

S

size() - Method in class jsr166x.ArrayDeque: Returns the number of elements in this deque.
size() - Method in class jsr166x.ConcurrentLinkedDeque: Returns the number of elements in this deque.
size() - Method in class jsr166x.ConcurrentSkipListMap: Returns the number of elements in this map.
size() - Method in class jsr166x.ConcurrentSkipListSet: Returns the number of elements in this set.
size() - Method in class jsr166x.LinkedBlockingDeque: Returns the number of elements in this deque.
subMap(K, K) - Method in interface jsr166x.ConcurrentNavigableMap: Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
subMap(K, K) - Method in class jsr166x.ConcurrentSkipListMap: Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
subMap(K, K) - Method in interface jsr166x.NavigableMap: Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
subSet(E, E) - Method in class jsr166x.ConcurrentSkipListSet: Returns a view of the portion of this set whose elements range from fromElement, inclusive, to toElement, exclusive.
subSet(E, E) - Method in interface jsr166x.NavigableSet: Returns a view of the portion of this set whose elements range from fromElement, inclusive, to toElement, exclusive.

T

tailMap(K) - Method in interface jsr166x.ConcurrentNavigableMap: Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
tailMap(K) - Method in class jsr166x.ConcurrentSkipListMap: Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
tailMap(K) - Method in interface jsr166x.NavigableMap: Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
tailSet(E) - Method in class jsr166x.ConcurrentSkipListSet: Returns a view of the portion of this set whose elements are greater than or equal to fromElement.
tailSet(E) - Method in interface jsr166x.NavigableSet: Returns a view of the portion of this set whose elements are greater than or equal to fromElement.
take() - Method in interface jsr166x.BlockingDeque: Retrieves and removes the first element of this deque, waiting if no elements are present on this deque.
take() - Method in class jsr166x.LinkedBlockingDeque
takeFirst() - Method in interface jsr166x.BlockingDeque: Retrieves and removes the first element of this deque, waiting if no elements are present on this deque.
takeFirst() - Method in class jsr166x.LinkedBlockingDeque
takeLast() - Method in interface jsr166x.BlockingDeque: Retrieves and removes the last element of this deque, waiting if no elements are present on this deque.
takeLast() - Method in class jsr166x.LinkedBlockingDeque
toArray() - Method in class jsr166x.ArrayDeque: Returns an array containing all of the elements in this list in the correct order.
toArray(T[]) - Method in class jsr166x.ArrayDeque: Returns an array containing all of the elements in this deque in the correct order; the runtime type of the returned array is that of the specified array.
toArray() - Method in class jsr166x.ConcurrentLinkedDeque: Returns an array containing all of the elements in this deque, in proper sequence (from first to last element).
toArray(T[]) - Method in class jsr166x.ConcurrentLinkedDeque: Returns an array containing all of the elements in this deque, in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array.
toArray() - Method in class jsr166x.LinkedBlockingDeque
toArray(T[]) - Method in class jsr166x.LinkedBlockingDeque
toString() - Method in class jsr166x.LinkedBlockingDeque

V

values() - Method in class jsr166x.ConcurrentSkipListMap: Returns a collection view of the values contained in this map.

A B C D E F G H I J K L N O P R S T V