|
| 1 | +using BitFaster.Caching.Lfu; |
| 2 | +using FluentAssertions; |
| 3 | +using Xunit; |
| 4 | + |
| 5 | +namespace BitFaster.Caching.UnitTests.Lfu |
| 6 | +{ |
| 7 | + public class LfuNodeListTests |
| 8 | + { |
| 9 | + [Fact] |
| 10 | + public void WhenPreviousNullLastReturnsNull() |
| 11 | + { |
| 12 | + var list = new LfuNodeList<int, int>(); |
| 13 | + |
| 14 | + list.Last.Should().BeNull(); |
| 15 | + } |
| 16 | + |
| 17 | + [Fact] |
| 18 | + public void WhenPreviousExistsLastReturnsPrevious() |
| 19 | + { |
| 20 | + var list = new LfuNodeList<int, int>(); |
| 21 | + var node1 = new LfuNode<int, int>(1, 1); |
| 22 | + var node2 = new LfuNode<int, int>(2, 2); |
| 23 | + |
| 24 | + list.AddLast(node1); |
| 25 | + list.AddLast(node2); |
| 26 | + |
| 27 | + list.Last.Should().BeSameAs(node2); |
| 28 | + } |
| 29 | + |
| 30 | + [Fact] |
| 31 | + public void WhenPreviousExistsNodePreviousReturnsPrevious() |
| 32 | + { |
| 33 | + var list = new LfuNodeList<int, int>(); |
| 34 | + var node1 = new LfuNode<int, int>(1, 1); |
| 35 | + var node2 = new LfuNode<int, int>(2, 2); |
| 36 | + |
| 37 | + list.AddLast(node1); |
| 38 | + list.AddLast(node2); |
| 39 | + |
| 40 | + node2.Previous.Should().BeSameAs(node1); |
| 41 | + } |
| 42 | + |
| 43 | + [Fact] |
| 44 | + public void WhenHeadNodePreviousReturnsNull() |
| 45 | + { |
| 46 | + var list = new LfuNodeList<int, int>(); |
| 47 | + var node1 = new LfuNode<int, int>(1, 1); |
| 48 | + var node2 = new LfuNode<int, int>(2, 2); |
| 49 | + |
| 50 | + list.AddLast(node1); |
| 51 | + list.AddLast(node2); |
| 52 | + |
| 53 | + node1.Previous.Should().BeNull(); |
| 54 | + } |
| 55 | + } |
| 56 | +} |
0 commit comments