Queue<T>.Count Propiedad

Definición

Obtiene el número de elementos incluidos en Queue<T>.Gets the number of elements contained in the Queue<T>.

public:
 property int Count { int get(); };
public int Count { get; }
member this.Count : int
Public ReadOnly Property Count As Integer

Valor de propiedad

Número de elementos contenidos en Queue<T>.The number of elements contained in the Queue<T>.

Implementaciones

Ejemplos

En el ejemplo de código siguiente se muestran varias propiedades y Queue<T> métodos de la clase genérica Count , incluida la propiedad.The following code example demonstrates several properties and methods of the Queue<T> generic class, including the Count property.

En el ejemplo de código se crea una cola de cadenas con la capacidad Enqueue predeterminada y se usa el método para poner en cola cinco cadenas.The code example creates a queue of strings with default capacity and uses the Enqueue method to queue five strings. Los elementos de la cola se enumeran, lo que no cambia el estado de la cola.The elements of the queue are enumerated, which does not change the state of the queue. El Dequeue método se usa para quitar la cola de la primera cadena.The Dequeue method is used to dequeue the first string. El Peek método se utiliza para examinar el siguiente elemento de la cola y, a continuación, Dequeue se usa el método para quitar de la cola.The Peek method is used to look at the next item in the queue, and then the Dequeue method is used to dequeue it.

El ToArray método se utiliza para crear una matriz y copiar los elementos de la cola en ella; a continuación, la matriz Queue<T> se pasa al IEnumerable<T>constructor que toma, y crea una copia de la cola.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. Se muestran los elementos de la copia.The elements of the copy are displayed.

Se crea una matriz dos veces el tamaño de la cola y se CopyTo usa el método para copiar los elementos de la matriz a partir de la parte central de la matriz.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. El Queue<T> constructor se utiliza de nuevo para crear una segunda copia de la cola que contiene tres elementos nulos al principio.The Queue<T> constructor is used again to create a second copy of the queue containing three null elements at the beginning.

El Contains método se usa para mostrar que la cadena "cuatro" se encuentra en la primera copia de la cola, después de Clear la cual el método borra la copia Count y la propiedad muestra que la cola está vacía.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 Main()
    {
        Queue<string> numbers = new Queue<string>();
        numbers.Enqueue("one");
        numbers.Enqueue("two");
        numbers.Enqueue("three");
        numbers.Enqueue("four");
        numbers.Enqueue("five");

        // A queue can be enumerated without disturbing its contents.
        foreach( string number in numbers )
        {
            Console.WriteLine(number);
        }

        Console.WriteLine("\nDequeuing '{0}'", numbers.Dequeue());
        Console.WriteLine("Peek at next item to dequeue: {0}", 
            numbers.Peek());
        Console.WriteLine("Dequeuing '{0}'", numbers.Dequeue());

        // 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());

        Console.WriteLine("\nContents of the first copy:");
        foreach( string number in queueCopy )
        {
            Console.WriteLine(number);
        }
        
        // 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);

        Console.WriteLine("\nContents of the second copy, with duplicates and nulls:");
        foreach( string number in queueCopy2 )
        {
            Console.WriteLine(number);
        }

        Console.WriteLine("\nqueueCopy.Contains(\"four\") = {0}", 
            queueCopy.Contains("four"));

        Console.WriteLine("\nqueueCopy.Clear()");
        queueCopy.Clear();
        Console.WriteLine("\nqueueCopy.Count = {0}", queueCopy.Count);
    }
}

/* This code example produces the following output:

one
two
three
four
five

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

Contents of the copy:
three
four
five

Contents of the second copy, with duplicates and nulls:



three
four
five

queueCopy.Contains("four") = True

queueCopy.Clear()

queueCopy.Count = 0
 */
Imports System.Collections.Generic

Module Example

    Sub Main

        Dim numbers As New Queue(Of String)
        numbers.Enqueue("one")
        numbers.Enqueue("two")
        numbers.Enqueue("three")
        numbers.Enqueue("four")
        numbers.Enqueue("five")

        ' A queue can be enumerated without disturbing its contents.
        For Each number As String In numbers
            Console.WriteLine(number)
        Next

        Console.WriteLine(vbLf & "Dequeuing '{0}'", numbers.Dequeue())
        Console.WriteLine("Peek at next item to dequeue: {0}", _
            numbers.Peek())    
        Console.WriteLine("Dequeuing '{0}'", numbers.Dequeue())

        ' Create a copy of the queue, using the ToArray method and the
        ' constructor that accepts an IEnumerable(Of T).
        Dim queueCopy As New Queue(Of String)(numbers.ToArray())

        Console.WriteLine(vbLf & "Contents of the first copy:")
        For Each number As String In queueCopy
            Console.WriteLine(number)
        Next
        
        ' Create an array twice the size of the queue, compensating
        ' for the fact that Visual Basic allocates an extra array 
        ' element. Copy the elements of the queue, starting at the
        ' middle of the array. 
        Dim array2((numbers.Count * 2) - 1) As String
        numbers.CopyTo(array2, numbers.Count)
        
        ' Create a second queue, using the constructor that accepts an
        ' IEnumerable(Of T).
        Dim queueCopy2 As New Queue(Of String)(array2)

        Console.WriteLine(vbLf & _
            "Contents of the second copy, with duplicates and nulls:")
        For Each number As String In queueCopy2
            Console.WriteLine(number)
        Next

        Console.WriteLine(vbLf & "queueCopy.Contains(""four"") = {0}", _
            queueCopy.Contains("four"))

        Console.WriteLine(vbLf & "queueCopy.Clear()")
        queueCopy.Clear()
        Console.WriteLine(vbLf & "queueCopy.Count = {0}", _
            queueCopy.Count)
    End Sub
End Module

' This code example produces the following output:
'
'one
'two
'three
'four
'five
'
'Dequeuing 'one'
'Peek at next item to dequeue: two
'
'Dequeuing 'two'
'
'Contents of the copy:
'three
'four
'five
'
'Contents of the second copy, with duplicates and nulls:
'
'
'
'three
'four
'five
'
'queueCopy.Contains("four") = True
'
'queueCopy.Clear()
'
'queueCopy.Count = 0

Comentarios

La capacidad de Queue<T> es el número de elementos Queue<T> que puede almacenar.The capacity of a Queue<T> is the number of elements that the Queue<T> can store. Countes el número de elementos que están realmente en Queue<T>.Count is the number of elements that are actually in the Queue<T>.

La capacidad siempre es mayor o igual que Count.The capacity is always greater than or equal to Count. Si Count supera la capacidad al agregar elementos, se aumenta la capacidad reasignando automáticamente la matriz interna antes de copiar los elementos antiguos y agregando los nuevos elementos.If Count exceeds the capacity while adding elements, the capacity is increased by automatically reallocating the internal array before copying the old elements and adding the new elements.

La recuperación del valor de esta propiedad es una operación O(1).Retrieving the value of this property is an O(1) operation.

Se aplica a