-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathQueueStackTests.cs
More file actions
68 lines (61 loc) · 1.67 KB
/
QueueStackTests.cs
File metadata and controls
68 lines (61 loc) · 1.67 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
using System;
using AlgorithmsAndDataStructures.DataStructures.Stack;
using Xunit;
namespace AlgorithmsAndDataStructures.Tests.DataStructures.Stack;
public class QueueStackTests
{
[Fact]
public void PopFromEmptyStackThrowsAnException()
{
var sut = new QueueStack<int>();
Assert.Throws<ArgumentException>(() => sut.Pop());
}
[Fact]
public void QueueStackCorrectlyReportsItsEmptiness()
{
var sut = new QueueStack<int>();
Assert.True(sut.IsEmpty);
}
[Fact]
public void QueueStackWorksInLifoOrder()
{
var sut = new QueueStack<int>();
for (var i = 0; i < 100; i++) sut.Push(i);
for (var i = 99; i >= 0; i--) Assert.Equal(i, sut.Pop());
}
[Fact]
public void QueueStackIsEnptyWhenAllElementsAreRemoved()
{
var sut = new QueueStack<int>();
sut.Push(1);
sut.Push(2);
Assert.Equal(2, sut.Pop());
Assert.Equal(1, sut.Pop());
Assert.True(sut.IsEmpty);
}
[Fact]
public void QueueStackIncreasesCapacityOnDemand()
{
var sut = new QueueStack<int>();
sut.Push(1);
sut.Push(2);
Assert.Equal(2, sut.Pop());
Assert.Equal(1, sut.Pop());
Assert.True(sut.IsEmpty);
}
[Fact]
public void QueueStackWorksInLifoOrderWhenIntermittentPushesAccures()
{
var sut = new QueueStack<int>();
sut.Push(1);
sut.Push(2);
sut.Push(3);
Assert.Equal(3, sut.Pop());
sut.Push(4);
sut.Push(5);
Assert.Equal(5, sut.Pop());
Assert.Equal(4, sut.Pop());
Assert.Equal(2, sut.Pop());
Assert.Equal(1, sut.Pop());
}
}