Queue.GetEnumerator Method in C# (original) (raw)
Last Updated : 04 Feb, 2019
This method returns an enumerator that iterates through the Queue. And it comes under the System.Collections namespace.Syntax:
public virtual System.Collections.IEnumerator GetEnumerator ();
Below programs illustrate the use of above-discussed method:Example 1:
csharp `
// C# code to illustrate the // Queue.GetEnumerator Method using System; using System.Collections;
class GFG {
// Driver code
public static void Main()
{
// Creating an Queue
Queue myq = new Queue();
// Adding elements to Queue
myq.Enqueue("A");
myq.Enqueue("B");
myq.Enqueue("C");
myq.Enqueue("D");
myq.Enqueue("E");
myq.Enqueue("F");
// To get an Enumerator
// for the Queue
IEnumerator enumerator = myq.GetEnumerator();
// If MoveNext passes the end of the
// collection, the enumerator is positioned
// after the last element in the Queue
// and MoveNext returns false.
while (enumerator.MoveNext())
{
Console.WriteLine(enumerator.Current);
}
}
}
`
Example 2:
csharp `
// C# code to illustrate the // Queue.GetEnumerator Method using System; using System.Collections;
class GFG {
// Driver code
public static void Main()
{
// Creating an Queue
Queue myq = new Queue();
// Adding elements to Queue
myq.Enqueue(78);
myq.Enqueue(84);
myq.Enqueue(44);
myq.Enqueue(77);
myq.Enqueue(99);
// To get an Enumerator
// for the Queue
IEnumerator enumerator = myq.GetEnumerator();
// If MoveNext passes the end of the
// collection, the enumerator is positioned
// after the last element in the Queue
// and MoveNext returns false.
while (enumerator.MoveNext()) {
Console.WriteLine(enumerator.Current);
}
}
}
`
Note:
- The _foreach _statement of the C# language hides the complexity of the enumerators. Therefore, using foreach is recommended, instead of directly manipulating the enumerator.
- Enumerators can be used to read the data in the collection, but they cannot be used to modify the underlying collection.
- Current returns the same object until either MoveNext or Reset is called. MoveNext sets Current to the next element.
- An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and its behavior is undefined.
- This method is an O(1) operation.
Reference:
Similar Reads
- C# Queue Class In C#, the Queue class is the part of the System.Collections.Generic namespace and represent a first-in-first-out (FIFO) collection of objects. When we add an item to the list, it is called enqueue, and when we remove an item, it is called dequeue.Enqueue adds an element to the end of the Q 5 min read
- How to create a Queue in C# Queue() Constructor is used to initializes a new instance of the Queue class which will be empty, and will have the default initial capacity, and uses the default growth factor. Queue represents a first-in, first out collection of object. It is used when you need first-in, first-out access of items. 2 min read
- Queue.Count Property in C# This property is used to get the number of elements contained in the Queue. Retrieving the value of this property is an O(1) operation and it comes under the System.Collections namespace. Syntax: public virtual int Count { get; } Property Value: This property returns the number of elements contained 2 min read
- Queue.IsSynchronized Property in C# This property is used get a value which indicates whether access to the Queue is synchronized (thread safe) or not. Syntax: public virtual bool IsSynchronized { get; } Property Value: This property returns true if access to the Queue is synchronized(thread safe) otherwise, false. The default is fals 2 min read
- How to get Synchronize access to the Queue in C# Queue.SyncRoot Property is used to get an object which can be used to synchronize access to the Queue. Queue represents a first-in, first out collection of object. It is used when you need first-in, first-out access of items. When you add an item in the list, it is called enqueue, and when you remov 2 min read
- Queue.Clear Method in C# This method is used to remove the objects from the Queue. This method is an O(n) operation, where n is the total count of elements. And this method comes under System.Collections namespace. Syntax: public void Clear (); Below given are some examples to understand the implementation in a better way: 2 min read
- Queue.Clone() Method in C# This method is used to create a shallow copy of the Queue. It just creates a copy of the Queue. The copy will have a reference to a clone of the internal elements but not a reference to the original elements. Syntax: public virtual object Clone (); Return Value: The method returns an Object which is 2 min read
- Queue.Contains() Method in C# This method is used to check whether an element is in the Queue. This method performs a linear search, therefore, this method is an O(n) operation, where n is Count. And this method comes under the System.Collections namespace. Syntax: public virtual bool Contains(object obj); Here, obj is the Objec 2 min read
- Queue.CopyTo() Method in C# This method is used to copy the Queue elements to an existing one-dimensional Array, starting at the specified array index. The elements are copied to the Array in the same order in which the enumerator iterates through the Queue and this method is an O(n) operation, where n is Count. This method co 4 min read
- Queue.Dequeue Method in C# The Dequeue() method is used to returns the object at the beginning of the Queue. This method is similar to the Peek() Method. The only difference between Dequeue and Peek method is that Peek() method will not modify the Queue but Dequeue will modify. This method is an O(1) operation and comes under 2 min read