Queue program in c#.net

Adds an object to the end of the Queue. Returns an enumerator that iterates through the Queue. Gets the Type of the current instance. Creates a shallow copy of the current Object. Returns the object at the beginning of the Queue without removing it. Returns a new Queue that wraps the original queue, and is thread safe. Copies the Queue elements to a new array. Sets the capacity to the actual number of elements in the Queue.

Casts the elements of an IEnumerable to the specified type. Filters the elements of an IEnumerable based on a specified type. Converts an IEnumerable to an IQueryable. Public static Shared in Visual Basic members of this type are thread safe. Any instance members are not guaranteed to be thread safe. To guarantee the thread safety of the Queue , all operations must be done through the wrapper returned by the Synchronized Queue method.

Enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which causes the enumerator to throw an exception.

To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads. Skip to main content. This browser is no longer supported. Download Microsoft Edge More info. Viewed 3k times. Improve this question. Have you looked at the Queue class yet? It's a good idea to say what you've already tried.

Add a comment. Active Oldest Votes. Improve this answer. Hadi Eskandari Hadi Eskandari 24k 7 7 gold badges 49 49 silver badges 64 64 bronze badges. But how much faster would Queue actually be? What if we only have a hundred items? Is there actually any noticeable difference? Not too complicated. We simply insert X amount of items, and then dequeue until we are done. The below image helps to visualize the queue data structures. Let us assume that we have a queue data structure with an integer as the data type.

We can implement this data structure using many different ways, In this tutorial, we are using a singly linked list. If you are not familiar with the linked list data structure you can check our linked list tutorial. We will also have a constructor to initialize these properties to null. We have created a simple method to create a linked list node for us with data property set to the value that we pass in to this function.

In the next section of this article, we will discuss the individual operations of the queue in detail. Inserting the data to a queue is commonly known as enqueue operations.

Here the data will be added from the rear side of the queue from the above example. Below is the code which does this operation. Removing the data from the queue is known as dequeue operation. We will be doing a dequeue operation from the front of the queue. Here we will be checking if the queue is empty or not. Peek Operation is just similar to what we have seen in our stack data structure tutorial.

We will check if the queue is empty or not accordingly we will return the peek element. Below is the code for IsEmpty, which checks if the queue has any elements or not. As we have seen the main methods of queue such as Enqueue, Dequeue, etc.