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

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

[Property]
Name=Sets the name of component|2|
Constructor=Sets the Constructor of the Queue class|14|0|Constructor,Constructor2,Constructor3,Constructor4

[Methods]
*doClear=Removes all objects from the Queue. ARG()|1|0
*doConstructor=Initializes a new instance of the Queue class that is empty, has the default initial capacity, and uses the default growth factor. ARG()|1|0
*doConstructor2=Initializes a new instance of the Queue class that contains elements copied from the specified collection, has the same initial capacity as the number of elements copied, and uses the default growth factor. ARG(ICollection col)|1|0
*doConstructor3=Initializes a new instance of the Queue class that is empty, has the specified initial capacity, and uses the default growth factor. ARG(int capacity)|1|0
*doConstructor4=Initializes a new instance of the Queue class that is empty, has the specified initial capacity, and uses the specified growth factor. ARG(int capacity, float growFactor)|1|0
*doContains=Determines whether an element is in the Queue. ARG(Object obj)|1|0
*doCopyTo=Copies the Queue elements to an existing one-dimensional Array, starting at the specified array index. ARG(Array array, int index)|1|0
doEnqueue=Adds an object to the end of the Queue. ARG(Object obj)|1|0
doDequeue=Removes and returns the object at the beginning of the Queue. ARG()|1|0
*doSynchronized=Returns a Queue wrapper that is synchronized . ARG(Queue queue)|1|0
*doTrimToSize=Sets the capacity to the actual number of elements in the Queue. 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 ARG(Object)|2|0
*onEmpty=Occurs if the Queue is empty with doDequeue method. ARG(string)|2|2
*onSynchronized=Occurs after invoke the method doSynchronized and returns the result ARG(Queue)|2|0
*Clone=Creates a shallow copy of the Queue. ARG(Object)|3|0
*Count=Returns the number of elements contained in the Queue. ARG(int)|3|1
*Dequeue=Removes and returns the object at the beginning of the Queue. ARG(Object)|3|0
*GetEnumerator=Returns an enumerator that iterates through the Queue. ARG(IEnumerator)|3|0
*IsSynchronized=Returns a value indicating whether access to the Queue is synchronized . ARG(bool)|3|104
Peek=Returns the object at the beginning of the Queue without removing it. ARG(Object)|3|0
*SyncRoot=Returns an object that can be used to synchronize access to the Queue. ARG(Object)|3|0
*ToArray=Copies the Queue elements to a new array. ARG(Object[])|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. The Array must have zero-based indexing.  ARG(Array)|4|0
*capacity=The initial number of elements that the Queue can contain.  ARG(int)|4|1
*col=The ICollection to copy elements from.  ARG(ICollection)|4|0
*growFactor=The factor by which the capacity of the Queue is expanded.  ARG(float)|4|107
*index=The zero-based index in array at which copying begins.  ARG(int)|4|1
obj=The Object to locate in the Queue. The value can be null.  ARG(Object)|4|0
*queue=The Queue to synchronize.  ARG(Queue)|4|0