C# (CSharp) QWS Examples

Example #1

        public void CanEnqueueDequeueAndEnqueue()
        {
            Stack Stack1 = new Stack(null);
            Stack Stack2 = new Stack(null);

            Node node1 = new Node("node1");
            Node node2 = new Node("node2");
            Node node3 = new Node("node3");
            Node node4 = new Node("node4");
            Node node5 = new Node("node5");
            Node node6 = new Node("node6");
            Node node7 = new Node("node7");

            QWS Queue = new QWS(Stack1, Stack2);

            Queue.Enqueue(node1);
            Queue.Enqueue(node2);
            Queue.Enqueue(node3);
            Queue.Enqueue(node4);
            Queue.Enqueue(node5);

            Queue.Dequeue();

            Queue.Enqueue(node6);
            Queue.Enqueue(node7);

            Assert.Equal("node2", Queue.Dequeue().Value);
        }

Example #2

File: Program.cs Project: riedmank/Data-Structures-and-Algorithms

        public static void Main(string[] args)
        {
            Stack Stack1 = new Stack(null);
            Stack Stack2 = new Stack(null);

            Node node1 = new Node("node1");
            Node node2 = new Node("node2");
            Node node3 = new Node("node3");
            Node node4 = new Node("node4");
            Node node5 = new Node("node5");
            Node node6 = new Node("node6");
            Node node7 = new Node("node7");

            QWS Queue = new QWS(Stack1, Stack2);

            Queue.Enqueue(node1);
            Queue.Enqueue(node2);
            Queue.Enqueue(node3);
            Queue.Enqueue(node4);
            Queue.Enqueue(node5);

            Console.WriteLine("Dequeue Top Node");

            Console.WriteLine(Queue.Dequeue().Value);

            Console.WriteLine("=========================");

            Queue.Enqueue(node6);
            Queue.Enqueue(node7);

            Console.WriteLine("Dequeue Top Node after adding nodes");

            Console.WriteLine(Queue.Dequeue().Value);
        }

Example #3

        public void CanDequeueFromEmptyQueue()
        {
            Stack Stack1 = new Stack(null);
            Stack Stack2 = new Stack(null);

            QWS Queue = new QWS(Stack1, Stack2);

            Assert.Null(Queue.Dequeue());
        }

Example #4

        public void CanEnqueueAndDequeueOneNode()
        {
            Stack Stack1 = new Stack(null);
            Stack Stack2 = new Stack(null);

            Node node1 = new Node("node1");

            QWS Queue = new QWS(Stack1, Stack2);

            Queue.Enqueue(node1);

            Assert.Equal(node1.Value, Queue.Dequeue().Value);
        }

Example #5

        public void NodeAddedIsNotFirstOut()
        {
            Stack Stack1 = new Stack(null);
            Stack Stack2 = new Stack(null);

            Node node1 = new Node("node1");
            Node node2 = new Node("node2");
            Node node3 = new Node("node3");
            Node node4 = new Node("node4");
            Node node5 = new Node("node5");

            QWS Queue = new QWS(Stack1, Stack2);

            Queue.Enqueue(node1);
            Queue.Enqueue(node2);
            Queue.Enqueue(node3);
            Queue.Enqueue(node4);
            Queue.Enqueue(node5);

            Assert.NotEqual(node5.Value, Queue.Dequeue().Value);
        }

Example #6

        public void CanRemoveFirstNodeAddedToQueue()
        {
            Stack Stack1 = new Stack(null);
            Stack Stack2 = new Stack(null);

            Node node1 = new Node("node1");
            Node node2 = new Node("node2");
            Node node3 = new Node("node3");
            Node node4 = new Node("node4");
            Node node5 = new Node("node5");

            QWS Queue = new QWS(Stack1, Stack2);

            Queue.Enqueue(node1);
            Queue.Enqueue(node2);
            Queue.Enqueue(node3);
            Queue.Enqueue(node4);
            Queue.Enqueue(node5);

            Assert.Equal(node1.Value, Queue.Dequeue().Value);
        }

Example #7

        public void CanDequeueTwoNodesInARow()
        {
            Stack Stack1 = new Stack(null);
            Stack Stack2 = new Stack(null);

            Node node1 = new Node("node1");
            Node node2 = new Node("node2");
            Node node3 = new Node("node3");
            Node node4 = new Node("node4");
            Node node5 = new Node("node5");

            QWS Queue = new QWS(Stack1, Stack2);

            Queue.Enqueue(node1);
            Queue.Enqueue(node2);
            Queue.Enqueue(node3);
            Queue.Enqueue(node4);
            Queue.Enqueue(node5);

            Queue.Dequeue();

            Assert.Equal(node2.Value, Queue.Dequeue().Value);
        }