-
Notifications
You must be signed in to change notification settings - Fork 416
/
ShuffleTest.cs
103 lines (85 loc) · 2.9 KB
/
ShuffleTest.cs
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
#region License and Terms
// MoreLINQ - Extensions to LINQ to Objects
// Copyright (c) 2018 Leandro F. Vieira (leandromoh). All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#endregion
namespace MoreLinq.Test
{
using System;
using NUnit.Framework;
[TestFixture]
public class ShuffleTest
{
static readonly Random Seed = new(12345);
[Test]
public void ShuffleIsLazy()
{
_ = new BreakingSequence<int>().Shuffle();
}
[Test]
public void Shuffle()
{
var source = Enumerable.Range(1, 100);
var result = source.Shuffle();
Assert.That(result.OrderBy(x => x), Is.EqualTo(source));
}
[Test]
public void ShuffleWithEmptySequence()
{
var source = Enumerable.Empty<int>();
var result = source.Shuffle();
Assert.That(result, Is.Empty);
}
[Test]
public void ShuffleIsIdempotent()
{
var sequence = Enumerable.Range(1, 100).ToArray();
var sequenceClone = sequence.ToArray();
// force complete enumeration of random subsets
sequence.Shuffle().Consume();
// verify the original sequence is untouched
Assert.That(sequence, Is.EqualTo(sequenceClone));
}
[Test]
public void ShuffleSeedIsLazy()
{
_ = new BreakingSequence<int>().Shuffle(Seed);
}
[Test]
public void ShuffleSeed()
{
var source = Enumerable.Range(1, 100);
var result = source.Shuffle(Seed);
Assert.That(result, Is.Not.EqualTo(source));
Assert.That(result.OrderBy(x => x), Is.EqualTo(source));
}
[Test]
public void ShuffleSeedWithEmptySequence()
{
var source = Enumerable.Empty<int>();
var result = source.Shuffle(Seed);
Assert.That(result, Is.Empty);
}
[Test]
public void ShuffleSeedIsIdempotent()
{
var sequence = Enumerable.Range(1, 100).ToArray();
var sequenceClone = sequence.ToArray();
// force complete enumeration of random subsets
sequence.Shuffle(Seed).Consume();
// verify the original sequence is untouched
Assert.That(sequence, Is.EqualTo(sequenceClone));
}
}
}