using System;

// using Microsoft.VisualStudio.TestTools.UnitTesting;

using System.Diagnostics;

using System.Linq;

​

namespace UnitTestProject1

{

​

    public class TheStack

    {

        private String[] stackArray;

        private int stackSize;

        private int topOfStack = -1;

​

        public TheStack(int size)

        {

            stackSize = size;

            stackArray = new String[size];

            stackArray = Enumerable.Repeat<string>("-1", size).ToArray();  // in java Arrays.fill(stackArray, "-1");

        }

​

        public void DisplayStack() {

​

        }

​

        public String Peek()

        {

            Console.WriteLine("PEEK : top of stack is " + stackArray[topOfStack]);

            return stackArray[topOfStack];

        }

​

        public void Push(string input)

        {

            if (topOfStack + 1 < stackSize)

            {

                topOfStack++;

                stackArray[topOfStack] = input;

            }

            else

                throw new StackOverflowException("stack full");

        }

​

        public void PushMany(string[] input)

        {

​

        }

​

        public string Pop()

        {

            if (topOfStack >= 0)

            {

                stackArray[topOfStack] = "-1";

                return stackArray[topOfStack--];

            }

            else

                throw new StackOverflowException("stack empty");

        }

​

        public void PopMany(int size)

        {

​

        }

​

        public void PopAll()

        {

​

        }

​

    }

​

    public class TheQueue

    {

        private string[] queueArray;

        private int queueSize;

        private int front, rear, numberOfItems = 0;

​

        public TheQueue(int size)

        {

            queueSize = size;

            queueArray = new String[size];

            queueArray = Enumerable.Repeat<string>("-1", size).ToArray();  // in java Arrays.fill(stackArray, "-1");

        }

​

        public void DisplayQueue()

        {

​

        }

​

        public String Peek()

        {

            Console.WriteLine("PEEK : the first element is " + queueArray[front]);

            return queueArray[front];

        }

​

        public void Insert(string input)

        {

            if (numberOfItems + 1 <= queueSize)

            {

                queueArray[rear] = input;

                rear++;

                numberOfItems++;

            }

            throw new Exception("Queue is full");

        }

​

        public void PriorityInsert(string input)

        {

            int i;

            if (numberOfItems == 0)

                Insert(input);

            else

            {

                for (i = numberOfItems - 1; i >= 0; i--)

                    if (string.Compare(input, queueArray[i]) > 0)

                        queueArray[i + 1] = queueArray[i];

                    else

                        break;

​

                queueArray[i + 1] = input;

                rear++;

                numberOfItems++;

            }

​

        }

​

        public void InsertMany(string[] input)

        {

​

        }

​

        public void Remove()

        {

            if (numberOfItems > 0)

            {

                queueArray[front] = "-1";

                front++;

                numberOfItems--;

            }

            else

                throw new Exception("Queue is empty");

        }

​

        public void RemoveMany(int size)

        {

​

        }

​

        public void RemoveAll()

        {

​

        }

​

    }

​

​

​

//  [TestClass]

    public class TestStack

    {

//      [TestMethod]

        public void TestStackFunctions()

        {

        }

        public void Main()

        {

            var test = new TestStack();

            test.TestStackFunctions();

        }

    }

}

​