Queue Class


The .NET API Reference documentation has a new home. Visit the .NET API Browser on docs.microsoft.com to see the new experience.

Represents a first-in, first-out collection of objects.

Namespace:   System.Collections
Assembly:  mscorlib (in mscorlib.dll)


public ref class Queue : ICollection, IEnumerable, ICloneable


Initializes a new instance of the Queue class that is empty, has the default initial capacity, and uses the default growth factor.


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.


Initializes a new instance of the Queue class that is empty, has the specified initial capacity, and uses the default growth factor.

System_CAPS_pubmethodQueue(Int32, Single)

Initializes a new instance of the Queue class that is empty, has the specified initial capacity, and uses the specified growth factor.


Gets the number of elements contained in the Queue.


Gets a value indicating whether access to the Queue is synchronized (thread safe).


Gets an object that can be used to synchronize access to the Queue.


Removes all objects from the Queue.


Creates a shallow copy of the Queue.


Determines whether an element is in the Queue.

System_CAPS_pubmethodCopyTo(Array^, Int32)

Copies the Queue elements to an existing one-dimensional Array, starting at the specified array index.


Removes and returns the object at the beginning of the Queue.


Adds an object to the end of the Queue.


Determines whether the specified object is equal to the current object.(Inherited from Object.)


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


Returns an enumerator that iterates through the Queue.


Serves as the default hash function. (Inherited from Object.)


Gets the Type of the current instance.(Inherited from Object.)


Creates a shallow copy of the current Object.(Inherited from Object.)


Returns the object at the beginning of the Queue without removing it.


Returns a new Queue that wraps the original queue, and is thread safe.


Copies the Queue elements to a new array.


Returns a string that represents the current object.(Inherited from Object.)


Sets the capacity to the actual number of elements in the Queue.


Overloaded. Enables parallelization of a query.(Defined by ParallelEnumerable.)


Overloaded. Converts an IEnumerable to an IQueryable.(Defined by Queryable.)


Casts the elements of an IEnumerable to the specified type.(Defined by Enumerable.)


Filters the elements of an IEnumerable based on a specified type.(Defined by Enumerable.)

This class implements a queue as a circular array. Objects stored in a Queue are inserted at one end and removed from the other.

Queues and stacks are useful when you need temporary storage for information; that is, when you might want to discard an element after retrieving its value. Use Queue if you need to access the information in the same order that it is stored in the collection. Use Stack if you need to access the information in reverse order. Use ConcurrentQueue<T> or ConcurrentStack<T> if you need to access the collection from multiple threads concurrently.

Three main operations can be performed on a Queue and its elements:

  • Enqueue adds an element to the end of the Queue.

  • Dequeue removes the oldest element from the start of the Queue.

  • Peek returns the oldest element that is at the start of the Queue but does not remove it from the Queue.

The capacity of a Queue is the number of elements the Queue can hold. As elements are added to a Queue, the capacity is automatically increased as required through reallocation. The capacity can be decreased by calling TrimToSize.

The growth factor is the number by which the current capacity is multiplied when a greater capacity is required. The growth factor is determined when the Queue is constructed. The default growth factor is 2.0. The capacity of the Queue will always increase by at least a minimum of four, regardless of the growth factor. For example, a Queue with a growth factor of 1.0 will always increase in capacity by four when a greater capacity is required.

Queue accepts null as a valid value and allows duplicate elements.

For the generic version of this collection, see System.Collections.Generic::Queue<T>

The following example shows how to create and add values to a Queue and how to print out its values.

using namespace System;
using namespace System::Collections;
void PrintValues( IEnumerable^ myCollection );
int main()

   // Creates and initializes a new Queue.
   Queue^ myQ = gcnew Queue;
   myQ->Enqueue( "Hello" );
   myQ->Enqueue( "World" );
   myQ->Enqueue( "!" );

   // Displays the properties and values of the Queue.
   Console::WriteLine( "myQ" );
   Console::WriteLine( "\tCount:    {0}", myQ->Count );
   Console::Write( "\tValues:" );
   PrintValues( myQ );

void PrintValues( IEnumerable^ myCollection )
   IEnumerator^ myEnum = myCollection->GetEnumerator();
   while ( myEnum->MoveNext() )
      Object^ obj = safe_cast<Object^>(myEnum->Current);
      Console::Write( "    {0}", obj );


 This code produces the following output.

     Count:    3
     Values:    Hello    World    !

Universal Windows Platform
Available since 10
.NET Framework
Available since 1.1

Public static (Shared in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe.

To guarantee the thread safety of the Queue, all operations must be done through the wrapper returned by the Synchronized method.

Enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which causes the enumerator to throw an exception. To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads.

Return to top