-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathLinkedListQueueTests.cs
More file actions
70 lines (63 loc) · 1.84 KB
/
LinkedListQueueTests.cs
File metadata and controls
70 lines (63 loc) · 1.84 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
using System;
using AlgorithmsAndDataStructures.DataStructures.Queue;
using Xunit;
namespace AlgorithmsAndDataStructures.Tests.DataStructures.Queue;
public class LinkedListQueueTests
{
[Fact]
public void PopFromEmptyQueueThrowsAnException()
{
var sut = new LinkedListQueue<int>();
Assert.Throws<ArgumentException>(() => sut.Dequeue());
}
[Fact]
public void QueueStackCorrectlyReportsItsEmptiness()
{
var sut = new LinkedListQueue<int>();
Assert.True(sut.IsEmpty);
}
[Fact]
public void QueueStackWorksInFifoOrder()
{
var sut = new LinkedListQueue<int>();
for (var i = 0; i < 100; i++) sut.Enqueue(i);
for (var i = 0; i < 100; i++) Assert.Equal(i, sut.Dequeue());
}
[Fact]
public void QueueIsEnptyWhenAllElementsAreRemoved()
{
var sut = new LinkedListQueue<int>();
sut.Enqueue(1);
sut.Enqueue(2);
Assert.Equal(1, sut.Dequeue());
Assert.Equal(2, sut.Dequeue());
Assert.True(sut.IsEmpty);
}
[Fact]
public void CircularQueueRemovesOldElementsToEnqueueNewOnes1()
{
var sut = new LinkedListQueue<int>();
sut.Enqueue(1);
sut.Enqueue(2);
Assert.Equal(1, sut.Dequeue());
Assert.Equal(2, sut.Dequeue());
sut.Enqueue(4);
Assert.Equal(4, sut.Dequeue());
Assert.True(sut.IsEmpty);
}
[Fact]
public void QueueWorksInFifoOrderWhenIntermittentEnqueuesAccure()
{
var sut = new LinkedListQueue<int>();
sut.Enqueue(1);
sut.Enqueue(2);
sut.Enqueue(3);
Assert.Equal(1, sut.Dequeue());
sut.Enqueue(4);
sut.Enqueue(5);
Assert.Equal(2, sut.Dequeue());
Assert.Equal(3, sut.Dequeue());
Assert.Equal(4, sut.Dequeue());
Assert.Equal(5, sut.Dequeue());
}
}