Queue<T>.Dequeue Method

Removes and returns the object at the beginning of the Queue<T>.

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

public T Dequeue()

Return Value

Type: T
The object that is removed from the beginning of the Queue<T>.


The Queue<T> is empty.

This method is similar to the Peek method, but Peek does not modify the Queue<T>.

If type T is a reference type, null can be added to the Queue<T> as a value.

This method is an O(1) operation.

The following code example demonstrates several methods of the Queue<T> generic class, including the Dequeue method.

The code example creates a queue of strings with default capacity and uses the Enqueue method to queue five strings. The elements of the queue are enumerated, which does not change the state of the queue. The Dequeue method is used to dequeue the first string. The Peek method is used to look at the next item in the queue, and then the Dequeue method is used to dequeue it.

The ToArray method is used to create an array and copy the queue elements to it, then the array is passed to the Queue<T> constructor that takes IEnumerable<T>, creating a copy of the queue. The elements of the copy are displayed.

An array twice the size of the queue is created, and the CopyTo method is used to copy the array elements beginning at the middle of the array. The Queue<T> constructor is used again to create a second copy of the queue containing three null elements at the beginning.

The Contains method is used to show that the string "four" is in the first copy of the queue, after which the Clear method clears the copy and the Count property shows that the queue is empty.

using System;
using System.Collections.Generic;

class Example
   public static void Demo(System.Windows.Controls.TextBlock outputBlock)
      Queue<string> numbers = new Queue<string>();

      // A queue can be enumerated without disturbing its contents.
      foreach (string number in numbers)
         outputBlock.Text += number + "\n";

      outputBlock.Text += String.Format("\nDequeuing '{0}'", numbers.Dequeue()) + "\n";
      outputBlock.Text += String.Format("Peek at next item to dequeue: {0}",
          numbers.Peek()) + "\n";
      outputBlock.Text += String.Format("Dequeuing '{0}'", numbers.Dequeue()) + "\n";

      // Create a copy of the queue, using the ToArray method and the
      // constructor that accepts an IEnumerable<T>.
      Queue<string> queueCopy = new Queue<string>(numbers.ToArray());

      outputBlock.Text += "\nContents of the first copy:" + "\n";
      foreach (string number in queueCopy)
         outputBlock.Text += number + "\n";

      // Create an array twice the size of the queue and copy the
      // elements of the queue, starting at the middle of the 
      // array. 
      string[] array2 = new string[numbers.Count * 2];
      numbers.CopyTo(array2, numbers.Count);

      // Create a second queue, using the constructor that accepts an
      // IEnumerable(Of T).
      Queue<string> queueCopy2 = new Queue<string>(array2);

      outputBlock.Text += String.Format("\nContents of the second copy, with duplicates and nulls:") + "\n";
      foreach (string number in queueCopy2)
         outputBlock.Text += number + "\n";

      outputBlock.Text += String.Format("\nqueueCopy.Contains(\"four\") = {0}",
          queueCopy.Contains("four")) + "\n";

      outputBlock.Text += "\nqueueCopy.Clear()" + "\n";
      outputBlock.Text += String.Format("\nqueueCopy.Count = {0}", queueCopy.Count) + "\n";

/* This code example produces the following output:


Dequeuing 'one'
Peek at next item to dequeue: two
Dequeuing 'two'

Contents of the copy:

Contents of the second copy, with duplicates and nulls:


queueCopy.Contains("four") = True


queueCopy.Count = 0


Supported in: 5, 4, 3

Silverlight for Windows Phone

Supported in: Windows Phone OS 7.1, Windows Phone OS 7.0

XNA Framework

Supported in: Xbox 360, Windows Phone OS 7.0

For a list of the operating systems and browsers that are supported by Silverlight, see Supported Operating Systems and Browsers.

Community Additions