algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/DataStructures/Queue/ArrayQueueTests.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
54
55
56
57
using System;
using AlgorithmsAndDataStructures.DataStructures.Queue;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.DataStructures.Queue;

public class ArrayQueueTests
{
    [Fact]
    public void PopFromEmptyQueueThrowsAnException()
    {
        var sut = new ArrayQueue<int>();
        Assert.Throws<ArgumentException>(() => sut.Dequeue());
    }

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

    [Fact]
    public void QueueStackWorksInFifoOrder()
    {
        var sut = new ArrayQueue<int>(100);
        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 ArrayQueue<int>();
        sut.Enqueue(1);
        sut.Enqueue(2);
        Assert.Equal(1, sut.Dequeue());
        Assert.Equal(2, sut.Dequeue());
        Assert.True(sut.IsEmpty);
    }

    [Fact]
    public void QueueWorksInFifoOrderWhenIntermittentEnqueuesAccure()
    {
        var sut = new ArrayQueue<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());
    }
}