| | Resizable-array implementation of the IDeque interface. Array deques have no capacity restrictions; they grow as necessary to support usage. They are not thread-safe; in the absence of external synchronization, they do not support concurrent access by multiple threads. This class is likely to be faster than Stack<T> when used as a stack, and faster than LinkedList<T> when used as a queue.
|