[About]
Version=1.0
Author=Nic
Mail=support@hiasm.com

[Type]
Class=Element
Interfaces=Queue_T
Info=Represents a first-in, first-out collection of objects.

[Property]
Name=Sets the name of component|2|
Type=Sets the type of items|20|(empty)|Type
Constructor=Sets the Constructor of the Queue class|14|0|Constructor,Constructor2,Constructor3

[Methods]
*doClear=Removes all objects from the Queue <T>. ARG()|1|0
*doConstructor=Initializes a new instance of the Queue <T> class that is empty and has the default initial capacity. ARG()|1|0
*doConstructor2=Initializes a new instance of the Queue <T> class that contains elements copied from the specified collection and has sufficient capacity to accommodate the number of elements copied. ARG(IEnumerable<T> collection)|1|0
*doConstructor3=Initializes a new instance of the Queue <T> class that is empty and has the specified initial capacity. ARG(int capacity)|1|0
*doContains=Determines whether an element is in the Queue <T>. ARG(T item)|1|0
*doCopyTo=Copies the Queue <T> elements to an existing one-dimensional Array, starting at the specified array index. ARG(T[] array, int arrayIndex)|1|0
doEnqueue=Adds an object to the end of the Queue <T>. ARG(T item)|1|0
doDequeue=Removes and returns the object at the beginning of the Queue <T>. ARG()|1|0
*doTrimExcess=Sets the capacity to the actual number of elements in the Queue <T>, if that number is less than 90 percent of current capacity. ARG()|1|0
*onContains=Occurs after invoke the method doContains and returns the result ARG(bool)|2|104
onDequeue=Occurs after ejecting the object at the beginning of the Queue <T>. ARG(Object)|2|0
*onEmpty=Occurs if the Queue <T> is empty with doDequeue method. ARG(string)|2|2
*Count=Returns the number of elements contained in the Queue <T>. ARG(int)|3|1
*Dequeue=Removes and returns the object at the beginning of the Queue <T>. ARG(T)|3|0
*GetEnumerator=Returns an enumerator that iterates through the Queue <T>. ARG(Enumerator)|3|0
Peek=Returns the object at the beginning of the Queue <T> without removing it. ARG(T)|3|0
*ToArray=Copies the Queue <T> elements to a new array. ARG(T[])|3|13
Queue=Returns the Queue object. ARG(Queue)|3|0
*array=The one-dimensional Array that is the destination of the elements copied from Queue <T>. The Array must have zero-based indexing.  ARG(T[])|4|13
*arrayIndex=The zero-based index in array at which copying begins.  ARG(int)|4|1
*capacity=The initial number of elements that the Queue <T> can contain.  ARG(int)|4|1
*collection=The collection whose elements are copied to the new Queue <T>.  ARG(IEnumerable<T>)|4|0
item=The object to locate in the Queue <T>. The value can be null for reference types.  ARG(T)|4|0