Deque

Implements: IEnumerable<T>

Represents a double ended queue for which insertion and retrieval of elements close to either of the ends is very efficient.

Constructors

Deque() Initializes a new instance of Deque that is empty and has the default initial capacity.

Deque(int capacity) Initializes a new instance of Deque that is empty and has the specified initial capacity.

Deque(IEnumerable<T> collection) Initializes a new instance of Deque that contains every element from the input collection and has enough capacity to accomodate the number of elements copied.

Properties

int Count Gets the number of elements contained in the Deque.

int Capacity Gets the maximum number of elements the internal data structure can hold without resizing.

T Back Returns the first element at the rear of the Deque without removing it. Complexity: O(1)

T Front Returns the first element at the front of the Deque without removing it. Complexity: O(1)

T this[int index] Gets or sets the element at the specified position of the Deque. Complexity: O(1)

Methods

void PushBack(T item) Inserts a new element to the rear of the Deque. Complexity: O(1)

void PushFront(T item) Inserts a new element to the front of the Deque. Complexity: O(1)

T PopBack() Removes the element at the rear of the Deque and returns its value. Complexity: O(1)

T PopFront() Removes the element at the front of the Deque and returns its value. Complexity: O(1)

void Clear() Removes all elements from the Deque. Complexity: O(1)

bool Contains(T item) Determines whether the Deque contains a specific element. Complexity: O(N)

void CopyTo(T[] array, int arrayIndex) Copies the elements of the Deque to an Array, starting at a particular Array index. Complexity: O(N)

bool Remove(T item) Removes the first occurrence of a specific element from the Deque. Complexity: O(N)

int IndexOf(T item) Searches for the specified element and returns the zero-based index of the first occurrence within the entire Deque. Complexity: O(N)

void Insert(int index, T item) Inserts an element into the Deque at the specified index. Complexity: O(N)

void RemoveAt(int index) Removes the element at the specified index of the Deque. Complexity: O(N)