Enhanced C#
Language of your choice: library documentation
|
Represents a Deque that supports negative indexes. In this kind of Deque, pushing and popping elements does not affect the indexes of the other elements in the collection. More...
Represents a Deque that supports negative indexes. In this kind of Deque, pushing and popping elements does not affect the indexes of the other elements in the collection.
T |
Additional Inherited Members | |
![]() | |
new T | this[int index] [get, set] |
Gets or sets an element of the array-like collection. More... | |
![]() | |
int | Min [get] |
Returns the minimum valid index in the collection. More... | |
int | Max [get] |
Returns the maximum valid index in the collection. More... | |
T | this[int index] [get] |
Gets the item at the specified index. More... | |
![]() | |
T | First [get, set] |
Gets the first item in the deque. More... | |
T | Last [get, set] |
![]() | |
bool | IsEmpty [get] |
![]() | |
int | Count [get] |
Gets the number of items in the collection. More... | |
![]() | |
bool | TrySet (int index, T value) |
![]() | |
T | TryGet (int index, out bool fail) |
Gets the item at the specified index, and does not throw an exception on failure. More... | |
IRange< T > | Slice (int start, int count=int.MaxValue) |
Returns a sub-range of this list. More... | |
![]() | |
void | PushFirst (T item) |
void | PushLast (T item) |
Maybe< T > | TryPopFirst () |
Maybe< T > | TryPeekFirst () |
Maybe< T > | TryPopLast () |
Maybe< T > | TryPeekLast () |