Geek asks and answers

Vector and ArrayDeque Classes

What is the difference between the Vector and ArrayDeque classes? I read about the ArrayDeque class yesterday, while I used the Vector class before.

+3
source share
2 answers

The basics:

Vectorimplements java.util.Listthat defines containers that allow access to index-based items. It also implements interface RandomAccess, which tells the user that the base view allows fast (usually O(1)) access to elements.

ArrayDequeimplements java.util.Dequethat defines a container that supports the rapid addition and removal of elements from the beginning and end of the container.

The main differences:

  • Vector , List.add(int index, E element) List.addAll(int index, Collection<? extends E> c).

  • Vector remove.

  • Vector set setElementAt ( Vector , O(1)).

  • add Vector - . - (O(n)).

  • ArrayDeque (O(1)) / , .

  • ArrayDeque . remove, removeFirst removeLast .

  • ArrayDeque , (peek, poll, add, addFirst) (offer, push, pop, peekLast, addLast) , (, Double-Ended Queue).

  • ArrayDeque deque.

  • Vector ListIterator, , , , . ArrayDeque .

  • Vector - , , / . ArrayDeque , . , ArrayList Vector.

+9

:

  • Vector List, ArrayDeque Queue. , : Vector - , *Queue ( /), , poll, offer ..;
  • ( ), ArrayDeque ;
  • JDK 1.0, ArrayDeque 1.6.
+4

More articles:


All Articles