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

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

Queue test

   
/*
Learning C# 
by Jesse Liberty

Publisher: O'Reilly 
ISBN: 0596003765
*/
 using System;
 using System.Collections;

 namespace QueueDemo
 {
    public class TesterQueueDemo
    {
       public void Run()
       {
           Queue intQueue = new Queue();

           // populate the array
           for (int i = 0;i<5;i++)
           {
               intQueue.Enqueue(i*5);
           }

           // Display the Queue.
           Console.Write( "intQueue values:\t" );
           DisplayValues( intQueue );

           // Remove an element from the Queue.
           Console.WriteLine(
               "\n(Dequeue)\t{0}", intQueue.Dequeue() );

           // Display the Queue.
           Console.Write( "intQueue values:\t" );
           DisplayValues( intQueue );

           // Remove another element from the queue.
           Console.WriteLine(
               "\n(Dequeue)\t{0}", intQueue.Dequeue() );

           // Display the Queue.
           Console.Write( "intQueue values:\t" );
           DisplayValues( intQueue );

           // View the first element in the
           // Queue but do not remove.
           Console.WriteLine(
               "\n(Peek)   \t{0}", intQueue.Peek() );

           // Display the Queue.
           Console.Write( "intQueue values:\t" );
           DisplayValues( intQueue );
       }
        public static void DisplayValues( IEnumerable myCollection )
        {
            IEnumerator myEnumerator =
                myCollection.GetEnumerator();
            while ( myEnumerator.MoveNext() )
                Console.Write( "{0} ",myEnumerator.Current );
            Console.WriteLine();
        }

       [STAThread]
       static void Main()
       {
          TesterQueueDemo t = new TesterQueueDemo();
          t.Run();
       }
    }
 }

           
         
    
    
  

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.	Add exception handling to the queue classes
7.	Demonstrate the Queue class
8.	Priority Queue
9.	Queue(T) Class represents a first-in, first-out collection of objects.
10.	Priority Queue (2)
11.	Dequeue
12.	Implements a non-locking queue
13.	Task queue
14.	Cyclic Queue
15.	Syncronized Queue