Ejemplo n.º 1
0
        public int DequeueMethod_EnqueueElementFromQueue(int[] array, int count)
        {
            Queue.Queue <int> queue = new Queue.Queue <int>(array);
            while (count-- > 1)
            {
                queue.Dequeue();
            }

            return(queue.Dequeue());
        }
Ejemplo n.º 2
0
        static void Main(string[] args)
        {
            Queue.Queue <int> a = new Queue.Queue <int>(5, 3, 8, 2);
            a.Enqueue(1);
            a.Enqueue(2);
            a.Enqueue(3);
            a.Enqueue(4);
            a.Enqueue(5);
            a.Enqueue(6);
            a.Dequeue();
            Console.WriteLine("Contains  {0}\t Count  {1}\nMoveNext  {2}\t Current  {3}",
                              a.Contains(2), a.Count(), a.MoveNext(3), a.Current);
            a.Show();
            a.DeqeueAt(a.Current);
            a.Show();


            Queue.Queue <int> b = new Queue.Queue <int>(5, 3, 8, 2);
            b.Enqueue(1);
            b.Enqueue(2);
            b.Enqueue(3);
            b.Enqueue(4);
            b.Enqueue(5);
            b.Enqueue(6);

            Console.WriteLine(Equals(a, b));
            Console.WriteLine(a.Equals(b));
            Console.WriteLine(a.GetHashCode());
            Console.WriteLine(b.GetHashCode());
            Console.ReadKey();
        }
Ejemplo n.º 3
0
        public void Peek(IEnumerable <string> collection, string expected)
        {
            Queue.Queue <string> queue = new Queue.Queue <string>(collection);
            var result = queue.Dequeue();

            Assert.AreEqual(expected, result);
        }
Ejemplo n.º 4
0
        public IEnumerator <T> GetEnumerator()
        {
            Queue.Queue <TreeNode <T> > q = new Queue.Queue <TreeNode <T> >();

            if (Count > 0)
            {
                q.Enqueue(Root);
            }

            while (q.Count != 0)
            {
                var node = q.Dequeue();

                yield return(node.Data);

                if (!IsEdgeSentinel(node.Left))
                {
                    q.Enqueue(node.Left);
                }

                if (!IsEdgeSentinel(node.Right))
                {
                    q.Enqueue(node.Right);
                }
            }
        }
Ejemplo n.º 5
0
        public int EnqueueMethod_EnqueueElementFromToQueueAndGetLast(int[] array)
        {
            Queue.Queue <int> queue = new Queue.Queue <int>();
            foreach (var element in array)
            {
                queue.Enqueue(element);
            }

            int count = array.Length;

            while (count-- > 1)
            {
                queue.Dequeue();
            }

            return(queue.Dequeue());
        }
Ejemplo n.º 6
0
 public void TakeCollectionTest_ValidResult(int[] expected)
 {
     Queue.Queue <int> actual = new Queue.Queue <int>(expected);
     for (int i = 0; i < expected.Length; i++)
     {
         Assert.AreEqual(expected[i], actual.Dequeue());
     }
 }
 public void Process(string path)
 {
     Console.WriteLine("Queue: " + queue.Count);
     while (queue.Count > 0)
     {
         try
         {
             var r = new Request(queue.Dequeue(), path);
             Console.WriteLine("  " + r.LocalUrl);
         }
         catch (Exception e)
         {
             Console.WriteLine("Error: " + e.Message);
         }
     }
 }