Skip navigation links
A B C D E F G H I J K L M N O P Q R S T U V 

A

AbstractQueue<E> - Class in java.util
This class provides skeletal implementations of some Queue operations.
AbstractQueue() - Constructor for class java.util.AbstractQueue
Constructor for use by subclasses.
AbstractSequentialList<E> - Class in java.util
This class provides a skeletal implementation of the List interface to minimize the effort required to implement this interface backed by a "sequential access" data store (such as a linked list).
AbstractSequentialList() - Constructor for class java.util.AbstractSequentialList
Sole constructor.
add(E) - Method in class java.util.AbstractQueue
Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning true upon success and throwing an IllegalStateException if no space is currently available.
add(int, E) - Method in class java.util.AbstractSequentialList
Inserts the specified element at the specified position in this list (optional operation).
add(E) - Method in class java.util.ArrayDeque
Inserts the specified element at the end of this deque.
add(E) - Method in interface java.util.Deque
Inserts the specified element into the queue represented by this deque (in other words, at the tail of this deque) if it is possible to do so immediately without violating capacity restrictions, returning true upon success and throwing an IllegalStateException if no space is currently available.
add(E) - Method in class java.util.HashSet
Adds the specified element to this set if it is not already present.
add(E) - Method in class java.util.LinkedList
Appends the specified element to the end of this list.
add(int, E) - Method in class java.util.LinkedList
Inserts the specified element at the specified position in this list.
add(E) - Method in interface java.util.Queue
Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning true upon success and throwing an IllegalStateException if no space is currently available.
add(E) - Method in class java.util.TreeSet
Adds the specified element to this set if it is not already present.
addAll(Collection<? extends E>) - Method in class java.util.AbstractQueue
Adds all of the elements in the specified collection to this queue.
addAll(int, Collection<? extends E>) - Method in class java.util.AbstractSequentialList
Inserts all of the elements in the specified collection into this list at the specified position (optional operation).
addAll(Collection<? super T>, T...) - Static method in class java.util.Collections
Adds all of the specified elements to the specified collection.
addAll(Collection<? extends E>) - Method in class java.util.LinkedList
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.
addAll(int, Collection<? extends E>) - Method in class java.util.LinkedList
Inserts all of the elements in the specified collection into this list, starting at the specified position.
addAll(Collection<? extends E>) - Method in class java.util.TreeSet
Adds all of the elements in the specified collection to this set.
addFirst(E) - Method in class java.util.ArrayDeque
Inserts the specified element at the front of this deque.
addFirst(E) - Method in interface java.util.Deque
Inserts the specified element at the front of this deque if it is possible to do so immediately without violating capacity restrictions.
addFirst(E) - Method in class java.util.LinkedList
Inserts the specified element at the beginning of this list.
addLast(E) - Method in class java.util.ArrayDeque
Inserts the specified element at the end of this deque.
addLast(E) - Method in interface java.util.Deque
Inserts the specified element at the end of this deque if it is possible to do so immediately without violating capacity restrictions.
addLast(E) - Method in class java.util.LinkedList
Appends the specified element to the end of this list.
ArrayDeque<E> - Class in java.util
Resizable-array implementation of the Deque interface.
ArrayDeque() - Constructor for class java.util.ArrayDeque
Constructs an empty array deque with an initial capacity sufficient to hold 16 elements.
ArrayDeque(int) - Constructor for class java.util.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 java.util.ArrayDeque
Constructs a deque containing the elements of the specified collection, in the order they are returned by the collection's iterator.
Arrays - Class in java.util
This class contains various methods for manipulating arrays (such as sorting and searching).
asLifoQueue(Deque<T>) - Static method in class java.util.Collections
Returns a view of a Deque as a Last-in-first-out (Lifo) Queue.
asList(T...) - Static method in class java.util.Arrays
Returns a fixed-size list backed by the specified array.
A B C D E F G H I J K L M N O P Q R S T U V 
Skip navigation links