algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/DataStructures/SelfOrginizingList/TransposeSelfOrginizingListTests.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
using AlgorithmsAndDataStructures.DataStructures.SelfOrganizingList;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.DataStructures.SelfOrginizingList;

public class TransposeSelfOrginizingListTests
{
    [Fact]
    public void RecentAccessedNodeIsMovedToHead()
    {
        var sut = new TransposeSelfOrginizingList<int>();

        for (var i = 0; i < 3; i++) sut.Add(i);

        sut.Get(1);

        Assert.Equal(1, sut.Head.Value);
    }

    [Fact]
    public void LastAccessNodesAreMovedTop()
    {
        var sut = new TransposeSelfOrginizingList<int>();

        for (var i = 0; i < 3; i++) sut.Add(i);

        for (var i = 0; i < 3; i++) sut.Get(i);

        var current = sut.Head;

        for (var i = 1; i < 3; i++)
        {
            Assert.Equal(i, current.Value);
            current = current.Next;
        }

        Assert.Equal(0, current.Value);
    }

    [Fact]
    public void TopAccessedNodeIsAtTheHead()
    {
        var sut = new TransposeSelfOrginizingList<int>();

        for (var i = 0; i < 6; i++) sut.Add(i);

        sut.Get(2);
        sut.Get(3);
        sut.Get(3);
        sut.Get(3);
        sut.Get(2);

        Assert.Equal(3, sut.Head.Value);
        Assert.Equal(2, sut.Head.Next.Value);
    }
}