algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/DataStructures/Stack/LinkedListStackTests.cs at master · arst/algorithms-and-data-structures · GitHub

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
using System;
using AlgorithmsAndDataStructures.DataStructures.Stack;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.DataStructures.Stack;

public class LinkedListStackTests
{
    [Fact]
    public void PopFromEmptyStackThrowsAnException()
    {
        var sut = new LinkedListStack<int>();
        Assert.Throws<ArgumentException>(() => sut.Pop());
    }

    [Fact]
    public void LinkedListStackCorrectlyReportsItsEmptiness()
    {
        var sut = new LinkedListStack<int>();
        Assert.True(sut.IsEmpty);
    }

    [Fact]
    public void LinkedListStackWorksInLifoOrder()
    {
        var sut = new LinkedListStack<int>();
        sut.Push(1);
        sut.Push(2);
        Assert.Equal(2, sut.Pop());
    }

    [Fact]
    public void LinkedListStackIsEnptyWhenAllElementsAreRemoved()
    {
        var sut = new LinkedListStack<int>();
        sut.Push(1);
        sut.Push(2);
        Assert.Equal(2, sut.Pop());
        Assert.Equal(1, sut.Pop());
        Assert.True(sut.IsEmpty);
    }

    [Fact]
    public void LinkedListStackIncreasesCapacityOnDemand()
    {
        var sut = new LinkedListStack<int>();
        sut.Push(1);
        sut.Push(2);
        Assert.Equal(2, sut.Pop());
        Assert.Equal(1, sut.Pop());
        Assert.True(sut.IsEmpty);
    }
}