Java集合框架

TreeNode

DescendingIterator

NaturalOrder

KeySpliterator

EntrySpliterator

HashMap

+ operation1(params):returnType- operation2(params)- operation3()

<<Map>>

<AbstractSet>

<<List>>

ArrayList

public void trimToSize()public void ensureCapacity(int minCapacity)

<<Collection>>

+int size()+boolean isEmpty()+boolean contains(Object o)+Object[] toArray()+<T> T[] toArray(T[] a)+boolean add(E e)+boolean remove(Object o)+boolean containsAll(Collection<?> c)+boolean addAll(Collection<? extends E> c)+boolean removeAll(Collection<?> c)+default boolean removeIf(Predicate<? super E> filter)+boolean retainAll(Collection<?> c)+void clear()+boolean equals(Object o)+int hashCode()+default Stream<E> stream()+default Stream<E> parallelStream()

Itr

EntrySet

Entry

EntryIterator

KeyIterator

<<Iterator>>

boolean hasNext()E next()default void remove()default void forEachRemaining(Consumer<? super E> action) 

<HashIterator>

ValueSpliterator

KeySet

<<Entry>>

DeqSpliterator

<<Spliterator>>

boolean tryAdvance(Consumer<? super T> action)default void forEachRemaining(Consumer<? super T> action)Spliterator<T> trySplit()long estimateSize()default long getExactSizeIfKnown()int characteristics()default boolean hasCharacteristics(int characteristics)default Comparator<? super T> getComparator()

ValueIterator

<<Iterable>>

Iterator<T> iterator()default void forEach(Consumer<? super T> action)default Spliterator<T> spliterator()

<AbstractMap>

<<Queue>>

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

<AbstractQueue>

<<Comparator>>

Vector

<AbstractSequentialList>

<<NavigableMap>>

RandomAccessSubList

Node

<AbstractList>

ListItr

TreeMap

HashMapSpliterator

<<Deque>>

void addFirst(E e)void addLast(E e)boolean offerFirst(E e)boolean offerLast(E e)boolean offerLast(E e)E removeLast()E pollFirst()E pollLast()E getFirst()E getLast()E peekFirst()E peekLast()boolean removeFirstOccurrence(Object o)boolean removeLastOccurrence(Object o)void push(E e)E pop()Iterator<E> descendingIterator()

<<ListIterator>>

boolean hasPrevious()E previous()int nextIndex()int previousIndex()void set(E e)void add(E e)

SubList

<AbstractCollection>

ArrayDeque

LegacyMergeSort

<<SortedMap>>

Values

ArrayListSpliterator

<<RandomAccess>>

DeqIterator

<<Set>>

Arrays

public static <T> List<T> asList(T... a)public static void sortpublic static int[] copyOfpublic static void fillpublic static Spliterator.OfLong spliteratorpublic static DoubleStream stream(double[] array)