C# | Convert Queue To array (original) (raw)
Last Updated : 01 Feb, 2019
**Queue **represents a first-in, first out collection of object. It is used when you need a first-in, first-out access of items. When you add an item in the list, it is called enqueue, and when you remove an item, it is called deque. Queue.ToArray Method is used to copy the Queue elements to a new array.Properties:
- 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 by reallocating the internal array.
- Queue accepts null as a valid value for reference types and allows duplicate elements.
Syntax :
public virtual object[] ToArray();
Below given are some examples to understand the implementation in a better way:Example 1:
CSHARP `
// C# code to Convert Queue to array using System; using System.Collections.Generic;
class GFG {
// Driver code
public static void Main()
{
// Creating a Queue of strings
Queue<string> myQueue = new Queue<string>();
// Inserting the elements into the Queue
myQueue.Enqueue("Geeks");
myQueue.Enqueue("Geeks Classes");
myQueue.Enqueue("Noida");
myQueue.Enqueue("Data Structures");
myQueue.Enqueue("GeeksforGeeks");
// Converting the Queue into array
String[] arr = myQueue.ToArray();
// Displaying the elements in array
foreach(string str in arr)
{
Console.WriteLine(str);
}
}
}
`
Output:
Geeks Geeks Classes Noida Data Structures GeeksforGeeks
Example 2:
CSHARP `
// C# code to Convert Queue to array using System; using System.Collections.Generic;
class GFG {
// Driver code
public static void Main()
{
// Creating a Queue of Integers
Queue<int> myQueue = new Queue<int>();
// Inserting the elements into the Queue
myQueue.Enqueue(2);
myQueue.Enqueue(3);
myQueue.Enqueue(4);
myQueue.Enqueue(5);
myQueue.Enqueue(6);
// Converting the Queue into array
int[] arr = myQueue.ToArray();
// Displaying the elements in array
foreach(int i in arr)
{
Console.WriteLine(i);
}
}
}
`
Reference:
Similar Reads
- Copying the Queue elements to 1-D Array in C# Queue.CopyTo(T[], Int32) 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, whe 4 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
- C# | Copy the Stack to an Array Stack.CopyTo(T[], Int32) Method is used to copy the Stack to an existing 1-D Array which starts from the specified array index. Properties: The capacity of a Stackis the number of elements the Stack can hold. As elements are added to a Stack , the capacit 2 min read
- STD::array in C++ The array is a collection of homogeneous objects and this array container is defined for constant size arrays or (static size). This container wraps around fixed-size arrays and the information of its size are not lost when declared to a pointer. In order to utilize arrays, we need to include the ar 5 min read
- Queue.ToArray Method in C# This method is used to copy the Queue elements to a new array. The Queue is not modified and the order of the elements in the new array is the same as the order of the elements from the beginning of the Queue to its end. This method is an O(n) operation and comes under Syntax: public virtual object[ 2 min read
- Pointer to an Array | Array Pointer A pointer to an array is a pointer that points to the whole array instead of the first element of the array. It considers the whole array as a single unit instead of it being a collection of given elements.Example:C #include<stdio.h> int main() { int arr[5] = { 1, 2, 3, 4, 5 }; int *ptr = arr; 5 min read
- priority_queue::top() in C++ STL Priority queues are a type of container adaptors, specifically designed such that the first element of the queue is either the greatest or the smallest of all elements in the queue. In general, elements are arranged according to some priority. However in C++ STL, the top element is the greatest elem 3 min read
- queue::front() and queue::back() in C++ STL Queue are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back (end) and are deleted from the front. queue::front() This function is used to reference the first or the oldest element of the queue container. This function can 3 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
- array::at() in C++ STL Array classes are generally more efficient, light-weight and reliable than C-style arrays. The introduction of array class from C++11 has offered a better alternative for C-style arrays. array::at() This function is used to return the reference to the element present at the position given as the par 2 min read