boolean |
Vector.add(E object) |
boolean |
TreeSet.add(E object) |
boolean |
PriorityQueue.add(E o) |
boolean |
LinkedList.add(E object) |
boolean |
HashSet.add(E object) |
boolean |
ArrayList.add(E object) |
boolean |
ArrayDeque.add(E e) |
boolean |
AbstractQueue.add(E o) |
boolean |
AbstractList.add(E object) |
void |
Vector.add(int location,
E object) |
void |
LinkedList.add(int location,
E object) |
void |
ArrayList.add(int location,
E object) |
void |
AbstractSequentialList.add(int location,
E object) |
boolean |
Vector.addAll(Collection<? extends E> collection) |
boolean |
TreeSet.addAll(Collection<? extends E> collection) |
boolean |
LinkedList.addAll(Collection<? extends E> collection) |
boolean |
ArrayList.addAll(Collection<? extends E> collection) |
boolean |
AbstractQueue.addAll(Collection<? extends E> c) |
boolean |
Vector.addAll(int location,
Collection<? extends E> collection) |
boolean |
LinkedList.addAll(int location,
Collection<? extends E> collection) |
boolean |
ArrayList.addAll(int location,
Collection<? extends E> collection) |
boolean |
AbstractSequentialList.addAll(int location,
Collection<? extends E> collection) |
void |
Vector.clear() |
void |
TreeSet.clear() |
void |
TreeMap.clear() |
void |
PriorityQueue.clear() |
void |
LinkedList.clear() |
void |
LinkedHashMap.clear() |
void |
IdentityHashMap.clear() |
void |
HashSet.clear() |
void |
HashMap.clear() |
void |
ArrayList.clear() |
void |
ArrayDeque.clear() |
void |
AbstractQueue.clear() |
void |
AbstractList.clear() |
boolean |
Vector.contains(Object object) |
boolean |
TreeSet.contains(Object object) |
boolean |
PriorityQueue.contains(Object object) |
boolean |
LinkedList.contains(Object object) |
boolean |
HashSet.contains(Object object) |
boolean |
ArrayList.contains(Object object) |
boolean |
ArrayDeque.contains(Object obj) |
boolean |
Vector.containsAll(Collection<?> collection) |
boolean |
TreeMap.containsKey(Object key) |
boolean |
IdentityHashMap.containsKey(Object key) |
boolean |
HashMap.containsKey(Object key) |
boolean |
TreeMap.containsValue(Object value) |
boolean |
LinkedHashMap.containsValue(Object value) |
boolean |
IdentityHashMap.containsValue(Object value) |
boolean |
HashMap.containsValue(Object value) |
Enumeration<V> |
Hashtable.elements() |
Set<Map.Entry<K,V>> |
TreeMap.entrySet() |
Set<Map.Entry<K,V>> |
LinkedHashMap.entrySet() |
Set<Map.Entry<K,V>> |
IdentityHashMap.entrySet() |
Set<Map.Entry<K,V>> |
HashMap.entrySet() |
boolean |
Vector.equals(Object object) |
boolean |
IdentityHashMap.equals(Object object) |
boolean |
Hashtable.equals(Object object) |
boolean |
BitSet.equals(Object obj) |
boolean |
AbstractSet.equals(Object object) |
boolean |
AbstractMap.equals(Object object) |
boolean |
AbstractMap.SimpleImmutableEntry.equals(Object object) |
boolean |
AbstractMap.SimpleEntry.equals(Object object) |
boolean |
AbstractList.equals(Object object) |
E |
Vector.get(int location) |
E |
LinkedList.get(int location) |
E |
ArrayList.get(int location) |
E |
AbstractSequentialList.get(int location) |
V |
TreeMap.get(Object key) |
V |
LinkedHashMap.get(Object key) |
V |
IdentityHashMap.get(Object key) |
V |
Hashtable.get(Object key) |
V |
HashMap.get(Object key) |
int |
Vector.hashCode() |
int |
Hashtable.hashCode() |
int |
BitSet.hashCode() |
int |
AbstractSet.hashCode() |
int |
AbstractMap.hashCode() |
int |
AbstractMap.SimpleImmutableEntry.hashCode() |
int |
AbstractMap.SimpleEntry.hashCode() |
int |
AbstractList.hashCode() |
int |
Vector.indexOf(Object object) |
int |
LinkedList.indexOf(Object object) |
int |
ArrayList.indexOf(Object object) |
boolean |
Vector.isEmpty() |
boolean |
TreeSet.isEmpty() |
boolean |
IdentityHashMap.isEmpty() |
boolean |
Hashtable.isEmpty() |
boolean |
HashSet.isEmpty() |
boolean |
HashMap.isEmpty() |
boolean |
ArrayList.isEmpty() |
boolean |
ArrayDeque.isEmpty() |
Iterator<E> |
TreeSet.iterator() |
Iterator<E> |
PriorityQueue.iterator() |
Iterator<E> |
HashSet.iterator() |
Iterator<E> |
ArrayDeque.iterator() |
Iterator<E> |
AbstractSequentialList.iterator() |
Iterator<E> |
AbstractList.iterator() |
Enumeration<K> |
Hashtable.keys() |
Set<K> |
TreeMap.keySet() |
Set<K> |
LinkedHashMap.keySet() |
Set<K> |
IdentityHashMap.keySet() |
Set<K> |
HashMap.keySet() |
int |
Vector.lastIndexOf(Object object) |
int |
LinkedList.lastIndexOf(Object object) |
int |
ArrayList.lastIndexOf(Object object) |
ListIterator<E> |
LinkedList.listIterator(int location) |
abstract ListIterator<E> |
AbstractSequentialList.listIterator(int location) |
V |
TreeMap.put(K key,
V value) |
V |
LinkedHashMap.put(K key,
V value) |
V |
IdentityHashMap.put(K key,
V value) |
V |
Hashtable.put(K key,
V value) |
V |
HashMap.put(K key,
V value) |
void |
TreeMap.putAll(Map<? extends K,? extends V> map) |
void |
IdentityHashMap.putAll(Map<? extends K,? extends V> map) |
void |
HashMap.putAll(Map<? extends K,? extends V> map) |
E |
Vector.remove(int location) |
E |
LinkedList.remove(int location) |
E |
ArrayList.remove(int location) |
E |
AbstractSequentialList.remove(int location) |
boolean |
Vector.remove(Object object) |
boolean |
TreeSet.remove(Object object) |
V |
TreeMap.remove(Object key) |
boolean |
PriorityQueue.remove(Object o) |
boolean |
LinkedList.remove(Object object) |
V |
LinkedHashMap.remove(Object key) |
V |
IdentityHashMap.remove(Object key) |
V |
Hashtable.remove(Object key) |
boolean |
HashSet.remove(Object object) |
V |
HashMap.remove(Object key) |
boolean |
ArrayList.remove(Object object) |
boolean |
ArrayDeque.remove(Object obj) |
boolean |
Vector.removeAll(Collection<?> collection) |
boolean |
AbstractSet.removeAll(Collection<?> collection) |
protected void |
Vector.removeRange(int start,
int end) |
protected void |
ArrayList.removeRange(int start,
int end) |
boolean |
Vector.retainAll(Collection<?> collection) |
E |
Vector.set(int location,
E object) |
E |
LinkedList.set(int location,
E object) |
E |
ArrayList.set(int location,
E object) |
E |
AbstractSequentialList.set(int location,
E object) |
int |
Vector.size() |
int |
TreeSet.size() |
int |
TreeMap.size() |
int |
PriorityQueue.size() |
int |
LinkedList.size() |
int |
IdentityHashMap.size() |
int |
Hashtable.size() |
int |
HashSet.size() |
int |
HashMap.size() |
int |
ArrayList.size() |
int |
ArrayDeque.size() |
List<E> |
Vector.subList(int start,
int end) |
Object[] |
Vector.toArray() |
Object[] |
PriorityQueue.toArray() |
Object[] |
LinkedList.toArray() |
Object[] |
ArrayList.toArray() |
Object[] |
AbstractList.toArray() |
Object[] |
AbstractCollection.toArray() |
<T> T[] |
Vector.toArray(T[] contents) |
<T> T[] |
PriorityQueue.toArray(T[] array) |
<T> T[] |
LinkedList.toArray(T[] contents) |
<T> T[] |
ArrayList.toArray(T[] contents) |
<T> T[] |
AbstractList.toArray(T[] contents) |
<T> T[] |
AbstractCollection.toArray(T[] contents) |
String |
Vector.toString() |
String |
Hashtable.toString() |
String |
BitSet.toString() |
String |
AbstractMap.toString() |
String |
AbstractMap.SimpleImmutableEntry.toString() |
String |
AbstractMap.SimpleEntry.toString() |
String |
AbstractCollection.toString() |
Collection<V> |
TreeMap.values() |
Collection<V> |
LinkedHashMap.values() |
Collection<V> |
IdentityHashMap.values() |
Collection<V> |
HashMap.values() |