java容器接口学习

接口操作：

• 加一个，加全部
• 删一个，删全部
• 判空，大小
• 迭代器
• 返回数组*2
• 判等
• 有参或无参

二级接口：

• Queue接口：
  boolean add(E e); //不为空，加入尾部并返回true ，否则抛出异常
  boolean offer(E e); //不为空， 加入尾部并返回true，否则返回false
  E remove(); //不为空，删除头部并返回true ，否则抛出异常 exception
  E poll(); //不为空， 删除头部并返回true，否则返回null
  E element();
  E peek(); //不为空，返回头部并返回true

• List接口：
  int size();
  boolean isEmpty();
  boolean contains(Object o);
  Iterator iterator();
  Object[] toArray();
  T[] toArray(T[] a);
  boolean add(E e);
  boolean remove(Object o);
  boolean containsAll(Collection<?> c);
  boolean addAll(Collection<? extends E> c);
  boolean addAll(int index, Collection<? extends E> c);
  boolean removeAll(Collection<?> c);
  default void sort(Comparator<? super E> c) {
  Object[] a = this.toArray();
  Arrays.sort(a, (Comparator) c);
  ListIterator i = this.listIterator();
  for (Object e : a) {
  i.next();
  i.set((E) e);
  }
  }
  void clear();
  boolean equals(Object o);
  int hashCode();
  E get(int index);
  E set(int index, E element);
  void add(int index, E element);
  E remove(int index);
  int indexOf(Object o);
  int lastIndexOf(Object o);
  ListIterator listIterator();
  ListIterator listIterator(int index);
  List subList(int fromIndex, int toIndex);

• Set接口：

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

三级接口

Dequeue:
void addFirst(E e);
void addLast(E e);
boolean offerFirst(E e);
boolean offerLast(E e);
E removeFirst();
E removeLast();
E pollFirst();
E pollLast();
E getFirst();
E getLast();
E peekFirst();
E peekLast();
boolean add(E e);
boolean offer(E e);
E remove();
E poll();
E element();
E peek();
boolean addAll(Collection<? extends E> c);
void push(E e);
E pop();
boolean remove(Object o);
boolean contains(Object o);
int size();
Iterator iterator();
Iterator descendingIterator();

顶端接口-Collection：

int size();
boolean isEmpty();
boolean contains(Object o);
Iterator iterator();
Object[] toArray();
default T[] toArray(IntFunction<T[]> generator) {
return toArray(generator.apply(0));
}
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) {
Objects.requireNonNull(filter);
boolean removed = false;
final Iterator each = iterator();
while (each.hasNext()) {
if (filter.test(each.next())) {
each.remove();
removed = true;
}
}
return removed;
}
boolean equals(Object o);
int hashCode();