public void DequeueShouldReturnHeadNode()
{
LinkedListQueue target = new LinkedListQueue();
Node firstNode = new Node();
target.Enqueue(firstNode);
Node expected = firstNode;
Node actual = target.Dequeue();
Assert.AreEqual(expected, actual);
}
public void EnqueueShouldAddPreviousTailToNewTailsNextNode()
{
LinkedListQueue target = new LinkedListQueue();
Node nodeOne = new Node();
Node nodeTwo = new Node();
target.Enqueue(nodeOne);
target.Enqueue(nodeTwo);
Node expected = nodeOne;
Node actual = nodeTwo.GetNextNode();
Assert.AreEqual(expected, actual);
}
public void DequeueShouldCreateNewHeadNode()
{
LinkedListQueue target = new LinkedListQueue();
Node firstNode = new Node();
Node secondNode = new Node(firstNode);
Node thirdNode = new Node(secondNode);
target.Enqueue(firstNode);
target.Enqueue(secondNode);
target.Enqueue(thirdNode);
target.Dequeue();
Node expected = secondNode;
Node actual = target.Head();
Assert.AreEqual(expected, actual);
}
public void FindShouldReturnDesiredNode()
{
LinkedListQueue target = new LinkedListQueue();
Node firstNode = new Node("First");
Node secondNode = new Node("Second");
Node thirdNode = new Node("Third");
Node fourthNode = new Node("Fourth");
target.Enqueue(firstNode);
target.Enqueue(secondNode);
target.Enqueue(thirdNode);
target.Enqueue(fourthNode);
Node actual = target.Find("Second");
Node expected = secondNode;
Assert.AreEqual(expected, actual);
}
public void EnqueueShouldTakeANode()
{
LinkedListQueue target = new LinkedListQueue();
Node newNode = new Node();
target.Enqueue(newNode);
}
public void TailShouldReturnLastNodeInQueue()
{
LinkedListQueue target = new LinkedListQueue();
Node newNode = new Node();
target.Enqueue(newNode);
Node expected = newNode;
Node actual = target.Tail();
Assert.AreEqual(expected, actual);
}
public void LinkedListQueueConstructorTest()
{
LinkedListQueue target = new LinkedListQueue();
}
