Wintellect.PowerCollections Namespace
Algorithms Class
Bag(T) Class
BigList(T) Class
BinaryPredicate(T) Delegate
CollectionBase(T) Class
Deque(T) Class
Deque(T) Members
Deque(T) Constructor
Deque(T) Methods
Add Method
AddManyToBack Method
AddManyToFront Method
AddToBack Method
AddToFront Method
Clear Method
Clone Method
CloneContents Method
CopyTo Method
GetAtBack Method
GetAtFront Method
GetEnumerator Method
Insert Method
InsertRange Method
RemoveAt Method
RemoveFromBack Method
RemoveFromFront Method
RemoveRange Method
TrimToSize Method
Deque(T) Properties
DictionaryBase(TKey, TValue) Class
ListBase(T) Class
MultiDictionary(TKey, TValue) Class
MultiDictionaryBase(TKey, TValue) Class
OrderedBag(T) Class
OrderedBag(T).View Class
OrderedDictionary(TKey, TValue) Class
OrderedDictionary(TKey, TValue).View Class
OrderedMultiDictionary(TKey, TValue) Class
OrderedMultiDictionary(TKey, TValue).View Class
OrderedSet(T) Class
OrderedSet(T).View Class
Pair(TFirst, TSecond) Structure
ReadOnlyCollectionBase(T) Class
ReadOnlyDictionaryBase(TKey, TValue) Class
ReadOnlyListBase(T) Class
ReadOnlyMultiDictionaryBase(TKey, TValue) Class
Set(T) Class
Triple(TFirst, TSecond, TThird) Structure
GhostDoc Pro Sample Help File

Deque<(Of <(<'T>)>)>..::..AddToFront Method

Adds an item to the front of the Deque. The indices of all existing items in the Deque are increased by 1. This method is equivalent to Insert(0, item) but is a little more efficient.

Namespace:  Wintellect.PowerCollections
Assembly:  PowerCollections (in PowerCollections.dll)

Syntax

public void AddToFront(
	T item
)
Public Sub AddToFront ( _
	item As T _
)
public:
void AddToFront(
	T item
)

Parameters

item
Type: T
The item to add.

Remarks

Adding an item to the front of the Deque takes a small constant amount of time, regardless of how many items are in the Deque.

See Also

Deque<(Of <(<'T>)>)> Class
Wintellect.PowerCollections Namespace