public void PeekNull()
{
PseudoQueue pQ = new PseudoQueue();
Queue trueQ = new Queue();
Assert.Equal(trueQ.Peek(), pQ.Peek());
}
public void TestPeekQueue()
{
PseudoQueue <string> queue = new PseudoQueue <string>();
queue.Enqueue("Test");
Assert.Equal("Test", queue.Peek().Data);
Assert.NotNull(queue.Front.Top);
}
public void CanEnqueueTest()
{
PseudoQueue <int> pseudo1 = new PseudoQueue <int>();
pseudo1.Enqueue(5);
Assert.Equal(5, pseudo1.Peek());
}
public void ThowsErrorPseudoQueueIsEmpty()
{
PseudoQueue <int> que = new PseudoQueue <int>();
Exception e = Assert.Throws <System.Exception>(() => que.Peek());
string expected = "The stack is empty.";
Assert.Equal(expected, e.Message);
}
public void EnQsNull()
{
PseudoQueue pQ = new PseudoQueue();
Queue trueQ = new Queue();
trueQ.Enqueue(new Node(1));
pQ.Enqueue(new Node(1));
Assert.Equal(trueQ.Peek().Value, pQ.Peek().Value);
}
public void PeekEmptyPseudoQueueThrowsTest()
{
PseudoQueue <object> pseudoQueue = new PseudoQueue <object>();
Assert.Throws <ArgumentException>(() =>
{
pseudoQueue.Peek();
});
}
public void PseudoEnqueueMultipleValuesTest()
{
PseudoQueue <int> pseudo1 = new PseudoQueue <int>();
pseudo1.Enqueue(3);
pseudo1.Enqueue(5);
pseudo1.Enqueue(8);
Assert.Equal(3, pseudo1.Peek());
}
public void Peek_return_Front()
{
PseudoQueue <int> q = new PseudoQueue <int>();
q.EnQueue(20);
q.EnQueue(15);
q.EnQueue(10);
q.EnQueue(5);
Assert.Equal(5, q.Peek());
}
public void PeeksFirstIn()
{
PseudoQueue pQ = new PseudoQueue();
Stack stack = new Stack();
stack.Push(new Node(1));
stack.Push(new Node(2));
pQ.In = stack;
Assert.Equal(1, pQ.Peek().Value);
}
public void Peek_throws_EmptyEx_on_empty()
{
PseudoQueue <int> q = new PseudoQueue <int>();
Exception ex = Assert.Throws <EmptyStackException>(() =>
{
q.Peek();
});
Assert.Equal("Stack is empty", ex.Message);
}
public void EnQsFIFO(int[] testVals)
{
PseudoQueue pQ = new PseudoQueue();
Queue trueQ = new Queue();
foreach (int val in testVals)
{
pQ.Enqueue(new Node(val));
trueQ.Enqueue(new Node(val));
}
Assert.Equal(trueQ.Peek().Value, pQ.Peek().Value);
}
public void CanEnqueueWhenPseudoQueueIsEmpty()
{
// arrange
PseudoQueue <int> que = new PseudoQueue <int>();
// act
que.Enqueue(5);
int expected = 5;
// assert
Assert.Equal(expected, que.Peek());
}
public void CanEnqueueOnToEmptyStack()
{
// arrange
PseudoQueue <string> myStack = new PseudoQueue <string>();
myStack.Enqueue("Dog");
// act
string returnedValue = myStack.Peek();
// assert
Assert.Equal("Dog", returnedValue);
}
public void CanEnqueueWithMethod()
{
// arrange
PseudoQueue <int> que = new PseudoQueue <int>();
// act
que.Enqueue(5);
que.Enqueue(10);
que.Enqueue(15);
int expected = 15;
// assert
Assert.Equal(expected, que.Peek());
}
public void PeeksLikeQueue()
{
PseudoQueue pQ = new PseudoQueue();
Queue trueQ = new Queue();
Stack stack = new Stack();
stack.Push(new Node(1));
stack.Push(new Node(2));
pQ.In = stack;
trueQ.Enqueue(new Node(1));
trueQ.Enqueue(new Node(2));
Assert.Equal(trueQ.Peek().Value, pQ.Peek().Value);
}
public void CanEnqueueIntoPseudoQueue()
{
// arrange
PseudoQueue <string> myStack = new PseudoQueue <string>();
myStack.Enqueue("Dog");
myStack.Enqueue("Cat");
myStack.Enqueue("Mouse");
myStack.Enqueue("Bear");
// act
string returnedValue = myStack.Peek();
// assert
Assert.Equal("Dog", returnedValue);
}
public void EnqsInCorrectOrder(int[] testVals)
{
PseudoQueue pQ = new PseudoQueue();
foreach (int val in testVals)
{
pQ.Enqueue(new Node(val));
}
int[] pQVals = new int[testVals.Length];
int i = 0;
while (pQ.Peek() != null)
{
pQVals[i] = pQ.Dequeue().Value;
i++;
}
Assert.Equal(testVals, pQVals);
}
public void TestPeekQueueNull()
{
PseudoQueue <string> queue = new PseudoQueue <string>();
Assert.Null(queue.Peek());
}