DequeTEnqueueTail Method |
Namespace: DigitalRune.Collections
If Count already equals the capacity, the capacity of the DequeT is increased by automatically reallocating the internal array, and the existing elements are copied to the new array before the new element is added.
If Count is less than the capacity of the internal array, this method is an O(1) operation. If the internal array needs to be reallocated to accommodate the new element, this method becomes an O(n) operation, where n is Count.