Add a value to the vector.
Add a value to the vector.
Add a series of values to the vector.
Clear the vector
Returns a (shallow) clone of this vector
Iterate from the most recent to the oldest vector entries
Iterate from the most recent to the oldest vector entries
Index vector entries, as though it were an array
Assign vector entries as though it were an array.
Remove and return the most recent addition to the vector.
Index vector entries, where a zero index represents the oldest vector entry.
Return depth of the vector
Return the vector as an array of values, where the first array entry represents the oldest value.
Return remaining unused slots
A vector of the given value-type V, with maximum depth Size. Note that this does no memory allocation of its own when Size != 0, and does heap allocation when Size == 0. Thus you can have a fixed-size low-overhead instance, or a heap oriented instance.