Deque继承Queue后扩展的方法
void | addFirst(E e) |
void | addLast(E e) |
Iterator<E> | descendingIterator() |
E | getFirst() |
E | getLast() |
boolean | offerFirst(E e) |
boolean | offerLast(E e) |
E | peekFirst() |
E | peekLast() |
E | pollFirst() |
E | pollLast() |
E | pop() |
void | push(E e) |
E | removeFirst() |
boolean | removeFirstOccurrence(Object o) |
E | removeLast() |
boolean | removeLastOccurrence(Object o) |
第一个元素(头部) | 最后一个元素(尾部) | |||
抛出异常 | 特殊值 | 抛出异常 | 特殊值 | |
插入 | addFirst(e) | offerFirst(e) | addLast(e) | offerLast(e) |
移除 | removeFirst() | pollFirst() | removeLast() | pollLast() |
检查 | getFirst() | peekFirst() | getLast() | peekLast() |