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
- 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.
public virtual bool Contains(object obj);
Return Value: The function returns True if the element exists in the Queue and returns False if the element doesn’t exist in the Queue.
Below given are some examples to understand the implementation in a better way:
- C# | Check if a Stack contains an element
- C# | How to check whether a List contains a specified element
- C# | Check if an element is in the Collection<T>
- C# | Check if a HashSet contains the specified element
- C# | Check whether an element is contained in the ArrayList
- C# | Check if the SortedSet contains a specific element
- C# | Check if every List element matches the predicate conditions
- How to create a Queue in C#
- C# | Queue Class
- C# Queue with Examples
- Queue.Contains() Method in C#
- Getting an object at the beginning of the Queue in C#
- Getting enumerator that iterates through the Queue in C#
- Queue.Equals() Method in C#
- Queue.Clone() Method in C#
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.