Dequeue : Queue « Collections Data Structure « C# / C Sharp

1. C# / C Sharp
2. Collections Data Structure
3. Queue

Dequeue

        

using System.Collections.Generic;

internal static class Utilities
{
    internal static bool TryDequeue<T>(this Queue<T> queue, out T result) where T : class
    {
        lock (queue)
        {
            if (queue.Count == 0)
            {
                result = null;
                return false;
            }
            result = queue.Dequeue();
        }
        return true;
    }
}

   
    
    
    
    
    
    
    
  

Related examples in the same category

1.	Put elements into a queue
2.	Put user-defined objects to Queue collection
3.	Implements the queue data type using an array
4.	A queue class for characters
5.	illustrates the use of a Queue
6.	Queue test
7.	Add exception handling to the queue classes
8.	Demonstrate the Queue class
9.	Priority Queue
10.	Queue(T) Class represents a first-in, first-out collection of objects.
11.	Priority Queue (2)
12.	Implements a non-locking queue
13.	Task queue
14.	Cyclic Queue
15.	Syncronized Queue