Javatpoint Logo
Javatpoint Logo

Queue.Contains() Method in C#

The Queue. contains() function in C# determines the existence of a certain element inside a Queue collection. It produces a Boolean result (true/false) indicating if the element is present in the Queue. This method compares elements using the element type's predefined equivalence comparer. It returns true if the Queue includes the specified element; otherwise, it returns false value. It helps in the efficient verification of an item's existence within the Queue without affecting its arrangement or content.

Queues in C# are a first-in, first-out (FIFO) data structure in which components are added at the end and discarded at the beginning. The Contains() function is a useful tool for determining whether an element is already present in the Queue before executing other actions.


It has the following syntax:

public virtual bool Contains(object ob);

Here, ob refers to the object to be located in the queue, which value might be null.

Return Value:

If the element exists within the Queue, the method returns True; otherwise, it returns False.

Example 1:

Let us take a C# program to implement the Queue.contains() method.



Example 2:

Let us take a C# program to implement the Queue.contains() method.



Advantages of Queue.Contains() Method in C#

There are several advantages of the Queue.Contains() method in C#. Some main advantages of this method are as follows:

  1. Presence Verification: It efficiently determines if a certain element exists in the Queue without changing its structure or contents. It is especially important when we need to know if an item is present before continuing with other tasks.
  2. Simple Implementation: The Contains() method is simple and easy to use. It encapsulates the fundamental logic of searching for an element in the Queue, allowing developers to concentrate on application logic instead of implementation specifics.
  3. Generic Support: When utilizing generic Queues (Queue<T>), the Contains() function works perfectly with strongly typed components, ensuring type safety and preventing runtime issues caused by incorrect type handling.
  4. Ease of integration: It works well with conditional statements and processes for making decisions. It makes logical examinations for branching in code execution easier by delivering a Boolean result based on whether or not an element is detected.
  5. Flexible Equality Comparison: The function uses the default equality comparer for the element type, allowing developers to compare items using customized equality criteria if the Equals() method is correctly configured for custom types.
  6. Time Complexity: Although it takes O(n) time to iterate through each element in the Queue, it is often efficient when dealing with small to moderate-sized Queues. For bigger Queues or more frequent queries, try improving the search process or using alternate data structures designed for quicker lookups.

Youtube For Videos Join Our Youtube Channel: Join Now


Help Others, Please Share

facebook twitter pinterest

Learn Latest Tutorials


Trending Technologies

B.Tech / MCA