|
CQueue<T>
CQueue<T> is a generic class that implements the ICollection<T> interface.
Description
The CQueue<T> class is a dynamic collection of T type data, which is organized as a queue that operates on the FIFO (first in, first out) principle.
Declaration
template<typename T>
|
Header
#include <Generic\Queue.mqh> |
Inheritance Hierarchy CQueue |
Class Methods
Method |
Description |
---|---|
Adds an element to a queue |
|
Adds an element to a queue |
|
Returns the number of elements in the queue |
|
Determines whether the queue contains an element with the specified value |
|
Sets the capacity of a queue to the actual number of elements, and thus frees up unused memory |
|
Copies all elements of a queue to the specified array starting at the specified index |
|
Removes all elements from a queue |
|
Removes the first occurrence of the specified element from the queue |
|
Returns the starting element and removes it from the queue |
|
Returns the starting element without removing it from the queue |