Dungeon Architect
17.0.0
|
Typical LIFO generic queue container that stores data inside of a fixed-size internal buffer (array). More...
Public Member Functions | |
BufferedQueue (int size) | |
Initializes a new instance of the BufferedQueue<T> class. More... | |
BufferedQueue (ICollection< T > items) | |
Initializes a new instance of the BufferedQueue<T> class as a copy of an ICollection<T> of the same type. More... | |
bool | Enqueue (T item) |
Adds a new element to the front of the queue. More... | |
T | Dequeue () |
Removes bottom element from queue and returns it (and updates "first" index) More... | |
T | Peek () |
Returns last element in the queue More... | |
void | Clear () |
Resets queue pointer back to default, essentially clearing the queue. More... | |
bool | Contains (T item) |
Returns whether the queue contains a given item. More... | |
void | CopyTo (T[] array, int arrayIndex) |
Copies the contents of the BufferedQueue<T> to an array. More... | |
IEnumerator< T > | GetEnumerator () |
Gets the BufferedQueue's enumerator. More... | |
Properties | |
int? | Count [get] |
Gets the number of elements in the queue. More... | |
T | this[int index] [get] |
Gets the value at specified index (valid ranges are from 0 to size-1) More... | |
Typical LIFO generic queue container that stores data inside of a fixed-size internal buffer (array).
T | Type of element that given BufferedQueue object stores. |
Definition at line 16 of file BufferedQueue.cs.
SharpNav.Collections.Generic.BufferedQueue< T >.BufferedQueue | ( | int | size | ) |
Initializes a new instance of the BufferedQueue<T> class.
size | The maximum number of items that will be stored. |
Definition at line 27 of file BufferedQueue.cs.
SharpNav.Collections.Generic.BufferedQueue< T >.BufferedQueue | ( | ICollection< T > | items | ) |
Initializes a new instance of the BufferedQueue<T> class as a copy of an ICollection<T> of the same type.
items | The collection to copy from. |
Definition at line 38 of file BufferedQueue.cs.
void SharpNav.Collections.Generic.BufferedQueue< T >.Clear | ( | ) |
Resets queue pointer back to default, essentially clearing the queue.
Definition at line 128 of file BufferedQueue.cs.
bool SharpNav.Collections.Generic.BufferedQueue< T >.Contains | ( | T | item | ) |
Returns whether the queue contains a given item.
item | Item to search for |
Definition at line 138 of file BufferedQueue.cs.
void SharpNav.Collections.Generic.BufferedQueue< T >.CopyTo | ( | T[] | array, |
int | arrayIndex | ||
) |
Copies the contents of the BufferedQueue<T> to an array.
array | The array to copy to. |
arrayIndex | The index within the array to start copying to. |
Definition at line 152 of file BufferedQueue.cs.
T SharpNav.Collections.Generic.BufferedQueue< T >.Dequeue | ( | ) |
Removes bottom element from queue and returns it (and updates "first" index)
Definition at line 107 of file BufferedQueue.cs.
bool SharpNav.Collections.Generic.BufferedQueue< T >.Enqueue | ( | T | item | ) |
Adds a new element to the front of the queue.
item | The element to be added to the queue |
Definition at line 93 of file BufferedQueue.cs.
IEnumerator<T> SharpNav.Collections.Generic.BufferedQueue< T >.GetEnumerator | ( | ) |
Gets the BufferedQueue's enumerator.
Definition at line 161 of file BufferedQueue.cs.
T SharpNav.Collections.Generic.BufferedQueue< T >.Peek | ( | ) |
Returns last element in the queue
Definition at line 118 of file BufferedQueue.cs.
|
get |
Gets the number of elements in the queue.
Definition at line 56 of file BufferedQueue.cs.
|
get |
Gets the value at specified index (valid ranges are from 0 to size-1)
index | Index value |
Definition at line 80 of file BufferedQueue.cs.