TimeDataCircularVector Class

Initializes a new instance of the TimeDataVectorTS class that is empty and has the default initial time step capacity.

Initializes a new instance of the TimeDataVectorTS class that is empty and has the specified initial time step capacity.

An array representation of the current content of the queue.

Note that this will make a copy of the internal array

Gets or sets the total number of elements the internal data structure can hold without resizing.

Gets the number of elements contained in the FifoQueue{T}.

Gets/sets the element at the specified position in the FifoQueue{T}.

Number of elements.

Number of time steps.

Index in internal _q array of last element in the queue

Adds a time step, with empty data

Adds an object to the end of the FifoQueue{T}, same as Enqueue(T)

Adds a time step, setting the provided value

calling this method is only valid if NumberOfElements equals 1.

Adds an object to the end of the FifoQueue{T}, same as Enqueue(T)

Adds an object to the end of the FifoQueue{T}, dequeuing the first item if queue is full (capacity is met).

Removes all objects from the FifoQueue{T}.

Determines whether the ICollectionT contains a specific value.

Copies the elements of the ICollectionT to an Array, starting at a particular Array index.

Removes and returns the object at the beginning of the FifoQueue{T}.

Adds an object to the end of the FifoQueue{T}.

Determines whether the specified object is equal to the current object.

Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.

Returns an enumerator that iterates through the FifoQueue{T}.

Serves as the default hash function.

Gets the Type of the current instance.

Get value for the speficied time step and element

Get values for all elements for the speficied time step

calling this method is only valid if NumberOfElements is greater than 1.

Index in internal _q array _q of the element with index in queue, handling circular array wrapping.

Determines the index of a specific item in the IListT.

Inserts an item to the IListT at the specified index.

Creates a shallow copy of the current Object.

Returns the object at the beginning of the FifoQueue{T} without removing it.

Put the first element to the end of the queue

Removes the first occurrence of a specific object from the ICollectionT.

Removes the IListT item at the specified index.

Set value at the speficied time step and element

For single valued items, when NumberOfElements equals 1, set elementIndex to zero.

Set values for all elements at the speficied time step

calling this method is only valid if NumberOfElements is greater than 1.

Returns a string that represents the current object.

Number of elements currently in the queue/circular array

Index of first element in circular array _q

Internal array of queue values, used as circular array.

Interplate a value in interval, with fraction, for the specified elementIndex