life

Теги
#diary, #html, #css, #js, #c, #linux, #git, #LoNG, #arduino, #javaE, #DDT, #careerkhpi, #jobfair, #activecitizens, #kharkiv_eco_city, #life_others

Collection. Иерархия

Iterable

hasNext()
next()
remove()

Collection

add (E e)
clear()
contains(Object o)
equals(Object o)
hashCode()
isEmpty()
iterator()
remove(Object o)
size()
addAll(
Collection<? extends E> c)
containsAll(
Collection<?> c)
removeAll(
Collection<?> c)
retainAll(
Collection<?> c)
toArray()
toArray(T[] a)

Queue

add(E e)
element()
offer(E e)
peek()
poll()
remove()

List

get(int index)
set(int index, E element)
indexOf(Object o)
lastIndexOf(Object o)
listIterator()
listIterator(int index)
remove(int index)
subList(int fromIndex, int toIndex)
addAll(
int index, Collection<? extends E> c)

Set

Deque

addFirst(E e)
addLast(E e)
contains(Object o)
getFirst()
getLast()
offerFirst()
offerLast()
peekFirst()
peekLast()
pollFirst()
pollLast()
pop()
push()
remove(Object o)
removeFirst()
removeLast()
removeFirstOccurence(Object o)
size()
iterator()
descendingIterator()

SortedSet

first()
last()
comparator()
headSet(E tolElement)
subSet(E fromElement, E tolElement)
tailSet(E fromElement)

PriorityQueue

add(E e)
clear()
contains(Object o)
offer(E e)
peek()
poll()
remove(Object o)
size()
iterator()
comparator()
toArray()
toArray(T[] a)

AbstractCollection

add (E e)
clear()
contains(Object o)
isEmpty()
iterator()
remove(Object o)
size()
addAll(
Collection<? extends E> c)
containsAll(
Collection<?> c)
removeAll(
Collection<?> c)
retainAll(
Collection<?> c)
toArray()
toArray(T[] a)
toString()

AbstractList

add(E e)
add(int index, E element)
get(int index)
set(int index, E element)
clear()
equals()
hashCode()
indexOf(Object o)
lastIndexOf(Object o)
iterator()
listIterator()
listIterator(int index)
remove(int index)
removeRange(
int fromIndex, int toIndex)
subList(
int fromIndex, int toIndex)
addAll(
int index, Collection<? extends E> c)

AbstractSet

equals(Object o)
hashCode()
removeAll(Collection<?> c)

AbstractSequentialList

add(int index, E element)
set(int index, E element)
get(int index)
iterator()
listIterator()
remove(int index)
addAll(
int index, Collection<? extends E> c)

ArrayList

add(E e)
add(int index, E element)
get(int index)
contains(Object o)
set(int index, E element)
size()
trimToSize()
clear()
clone()
equals()
hashCode()
isEmpty()
indexOf(Object o)
lastIndexOf(Object o)
ensureCapacity(int minCapacity)
iterator()
listIterator()
listIterator(int index)
remove(int index)
remove(object o)
removeRange(
int fromIndex, int toIndex)
removeAll(
Collection<?> c)
subList(
int fromIndex, int toIndex)
addAll(
Collection<? extends E> c)
addAll(
int index, Collection<? extends E> c)
toArray()
toArray(T[] a)

Vector

add(E e)
add(int index, E element)
addElement(E obj)
insertElement(E obj, int index)
elementAt(int index)
firstElement()
lastElement()
contains(Object o)
set(int index, E element)
setElementAt(E obj, int index)
get(int index)
size()
setSize(int newSize)
trimToSize()
clear()
clone()
equals(Object o)
hashCode()
isEmpty()
indexOf(Object o)
indexOf(Object o, int index)
lastIndexOf(Object o)
capacity()
ensureCapacity(int minCapacity)
iterator()
listIterator()
listIterator(int index)
remove(int index)
remove(object o)
removeRange(
int fromIndex, int toIndex)
removeAllElements()
removeElementAt(int index)
removeAll(
Collection<?> c)
retainAll(
Collection<?> c)
containsAll(
Collection<?> c)
subList(
int fromIndex, int toIndex)
addAll(
Collection<? extends E> c)
addAll(
int index, Collection<? extends E> c)
copyInto(Object[] anArray)
elements()
toArray()
toArray(T[] a)

HashSet

add(E e)
contains(Object o)
size()
clear()
clone()
isEmpty()
iterator()
remove(object o)

TreeSet

add(E e)
contains(Object o)
first()
floor()
higher()
last()
lower(E e)
pollFirst()
pollLast()
ceiling()
size()
clear()
clone()
comparator()
isEmpty()
iterator()
descendingIterator()
remove(object o)
addAll(
Collection<? extends E> c)
subSet(
E fromElement, E toElement)
subSet(
E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)
headSet(
E toElement)
headSet(
E toElement, boolean toInclusive)
tailSet(
E fromElement)
tailSet(
E fromElement, boolean toInclusive)
descendingSet()

LinkedList

Stack

LinkedHashset

Map clear() containsKey(Object key) containsValue(Object value) equals(Object o) get(Object key) hashCode() isEmpty() size() put(K key, V value) remove(Object key) putAll( Map<? extends K, ? extends V> m) keySet() values() entrySet()

		SortedMap firstKey() lastKey() comparator() headMap(K toKey) subMap(K fromKey, K toKey) tailMap(K fromKey)

		NavigableMap

AbstractMap clear() containsKey(Object key) containsValue(Object value) equals(Object o) get(Object key) hashCode() isEmpty() size() put(K key, V value) remove(Object key) putAll( Map<? extends K, ? extends V> m) keySet() values() entrySet()



HashMap clear() clone() containsKey(Object key) containsValue(Object value) get(Object key) isEmpty() size() put(K key, V value) remove(Object key) putAll( Map<? extends K, ? extends V> m) keySet() values() entrySet()	TreeMap isEmpty() size() clear() clone() comparator() containsKey(Object key) containsValue(Object value) get(Object key) ceilingKey(K key) floorKey(K key) firstKey(K key) lastKey(K key) higherKey(K key) lowerKey(K key) put(K key, V value) remove(Object key) putAll( Map<? extends K, ? extends V> m) keySet() navigableKeySet() descendingKeySet() descendingMap() headMap( K toKey, boolean inclusive) tailMap( K toKey, boolean inclusive) subMap( K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) subMap(K fromKey) values() entrySet() ceilingEntry(K key) floorEntry(K key) firstEntry(K key) lastEntry(K key) higherEntry(K key) lowerEntry(K key) pollFirstEntry() pollLastEntry()

LinkedHashMap

Теги: #java