According to JAVA SE 8
Data Structures
import java.util.*;
List
Modifier and Type | Method and Description |
---|---|
boolean |
add(E e)
Appends the specified element to the end of this list (optional operation). |
void |
add(int index, E element)
Inserts the specified element at the specified position in this list (optional operation). |
boolean |
addAll(Collection<? extends E> c)
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 (optional operation). |
boolean |
addAll(int index, Collection<? extends E> c)
Inserts all of the elements in the specified collection into this list at the specified position (optional operation). |
void |
clear()
Removes all of the elements from this list (optional operation). |
boolean |
contains(Object o)
Returns true if this list contains the specified element. |
boolean |
containsAll(Collection<?> c)
Returns true if this list contains all of the elements of the specified collection. |
boolean |
equals(Object o)
Compares the specified object with this list for equality. |
E |
get(int index)
Returns the element at the specified position in this list. |
int |
hashCode()
Returns the hash code value for this list. |
int |
indexOf(Object o)
Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element. |
boolean |
isEmpty()
Returns true if this list contains no elements. |
Iterator<E> |
iterator()
Returns an iterator over the elements in this list in proper sequence. |
int |
lastIndexOf(Object o)
Returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element. |
ListIterator<E> |
listIterator()
Returns a list iterator over the elements in this list (in proper sequence). |
ListIterator<E> |
listIterator(int index)
Returns a list iterator over the elements in this list (in proper sequence), starting at the specified position in the list. |
E |
remove(int index)
Removes the element at the specified position in this list (optional operation). |
boolean |
remove(Object o)
Removes the first occurrence of the specified element from this list, if it is present (optional operation). |
boolean |
removeAll(Collection<?> c)
Removes from this list all of its elements that are contained in the specified collection (optional operation). |
default void |
replaceAll(UnaryOperator<E> operator)
Replaces each element of this list with the result of applying the operator to that element. |
boolean |
retainAll(Collection<?> c)
Retains only the elements in this list that are contained in the specified collection (optional operation). |
E |
set(int index, E element)
Replaces the element at the specified position in this list with the specified element (optional operation). |
int |
size()
Returns the number of elements in this list. |
default void |
sort(Comparator<? super E> c)
Sorts this list according to the order induced by the specified |
default Spliterator<E> |
spliterator()
Creates a |
List<E> |
subList(int fromIndex, int toIndex)
Returns a view of the portion of this list between the specified fromIndex, inclusive, and toIndex, exclusive. |
Object[] |
toArray()
Returns an array containing all of the elements in this list in proper sequence (from first to last element). |
<T> T[] |
toArray(T[] a)
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. |
ArrayList
List<E> list = new ArrayList<E>();
void |
ensureCapacity(int minCapacity)
Increases the capacity of this ArrayList instance, if necessary, to ensure that it can hold at least the number of elements specified by the minimum capacity argument. |
void |
forEach(Consumer<? super E> action)
Performs the given action for each element of the |
boolean |
removeIf(Predicate<? super E> filter)
Removes all of the elements of this collection that satisfy the given predicate. |
protected void |
removeRange(int fromIndex, int toIndex)
Removes from this list all of the elements whose index is between |
void |
trimToSize()
Trims the capacity of this ArrayList instance to be the list’s current size. |
LinkedList
List<E> list = new LinkedList<E>();
void |
addFirst(E e)
Inserts the specified element at the beginning of this list. |
void |
addLast(E e)
Appends the specified element to the end of this list. |
Iterator<E> |
descendingIterator()
Returns an iterator over the elements in this deque in reverse sequential order. |
E |
element()
Retrieves, but does not remove, the head (first element) of this list. |
E |
getFirst()
Returns the first element in this list. |
E |
getLast()
Returns the last element in this list. |
boolean |
offer(E e)
Adds the specified element as the tail (last element) of this list. |
boolean |
offerFirst(E e)
Inserts the specified element at the front of this list. |
boolean |
offerLast(E e)
Inserts the specified element at the end of this list. |
E |
peek()
Retrieves, but does not remove, the head (first element) of this list. |
E |
peekFirst()
Retrieves, but does not remove, the first element of this list, or returns |
E |
peekLast()
Retrieves, but does not remove, the last element of this list, or returns |
E |
poll()
Retrieves and removes the head (first element) of this list. |
E |
pollFirst()
Retrieves and removes the first element of this list, or returns |
E |
pollLast()
Retrieves and removes the last element of this list, or returns |
E |
pop()
Pops an element from the stack represented by this list. |
void |
push(E e)
Pushes an element onto the stack represented by this list. |
E |
removeFirst()
Removes and returns the first element from this list. |
boolean |
removeFirstOccurrence(Object o)
Removes the first occurrence of the specified element in this list (when traversing the list from head to tail). |
E |
removeLast()
Removes and returns the last element from this list. |
boolean |
removeLastOccurrence(Object o)
Removes the last occurrence of the specified element in this list (when traversing the list from head to tail). |
Stack
List<E> list = new Stack<E>();
boolean |
empty()
Tests if this stack is empty. |
E |
peek()
Looks at the object at the top of this stack without removing it from the stack. |
E |
pop()
Removes the object at the top of this stack and returns that object as the value of this function. |
E |
push(E item)
Pushes an item onto the top of this stack. |
int |
search(Object o)
Returns the 1-based position where an object is on this stack. |
Vector
List<E> list = new Vector<E>();