ArryList -- LinkedList -- Vector 类图

Node

+ item:E+ next:Node<E>+ prev:Node<E>

ArrayList

- DEFAULT_CAPACITY:int = 10- EMPTY_ELEMENTDATA:Object[] ={}- DEFAULTCAPACITY_EMPTY_ELEMENTDATA：Object[] ={}+ elementData : Object[] - size int- MAX_ARRAY_SIZE:int = Integer.MAX_VALUE - 8

<<interface>>Set

span style=\"font-size: inherit;\

Vector

# elementData:Object[]# elementCount:int# capacityIncrement:int- MAX_ARRAY_SIZE :int=  Integer.MAX_VALUE - 8

<<Class>>HashSet

AbstractList

# AbstractList()- rangeCheck(index:int)- rangeCheckForAdd(index:int)- outOfBoundsMsg(intdex:int)- checkForComodification()

<<interface>>Collection<E>

+ siez() : int+ isEmoty() : boolean+ contains (Object): boolean+ toArray(T[] a) : <T> T[]+ add(E e):boolean+ remover(Object o) :boolean+ containsAll(Collection<?>):boolean+ addAll(Collection<? extends E> c)：boolean+ removeAll(Collection<?> e): boolean+ removeIf(Predicate<? super E> filter)+ retainAll(Collection<?> c):boolean+ clear()

<<Abstract Class>>AbstractSet

<<interface>>RandomAccess

ListItr

-  lastReturned:Node<E>- next:Node<E>- nextIndex:int- expectedModCount:int = modCount

+ ListItr(intdex:int)+ checkForComodidication()

<<abstract>>AbstractSequentialList

# AbstractSequentialList()

AbstractCollection

<<interface>>Deque

+ addFirst(E)+ addLast(E)+ offerFirst(E)+ offerLast(E)+ removeFirst()+ removeLast()+ pollFirst()+ pollLast()+ getFirst()+ peekFirst()+ peekLast()+removeFirstOccurrence(Object):boolean+removeLastOccurrence(Object):boolean+ pop()+ descendingIterator(): Iterator;

<<interface>>Queue

+ offer(E):boolean+ remove(): E+ poll(): E+ element(): E+ peek(): E

<<interface>>List

<<Class>>EnumSet

< <interface>>Iterable

+ forEach(Consumer<? super T>)+ iterator():return Iterable+ spliterator(): Soliterator

LinkedList

+ size:int = 0+ first:Node<E>+last:Node<E>

+linkBefore(e:Node<E>)- unlinkFirst(e:Node<E>)- unlinkLast(e:Node<E>)+unlink(e:Node<E>)-isElementIndex(index:int):boolean-isPositionIndex(index:int)-outOfBoundsMsg(index:int)-checkElementIndex(index:int)-checkPositionIndex(index:int)+node(index):Node<E>- writeObject(s:ObjectOutputStream)- readObject(s:ObjectInputStream)

<<Class>>TreeSet