OSS/tanya
1
0
Fork 0
Code Issues 1 Pull Requests Releases Activity

Replace rotate with bringToFront

Browse Source
This commit is contained in:
Eugen Wissner
2021-06-04 09:37:50 +02:00
parent c15a8993ec
commit 0155039071
4 changed files with 6 additions and 90 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
tests/tanya/algorithm/tests/mutation.d
View File

@ -95,38 +95,3 @@ import tanya.test.stub;
NonCopyable[] nonCopyable;
initializeAll(nonCopyable);
}
@nogc nothrow pure @safe unittest
{
import std.algorithm.comparison : equal;
const int[5] expected = [1, 2, 3, 4, 5];
int[5] actual = [4, 5, 1, 2, 3];
rotate(actual[0 .. 2], actual[2 .. $]);
assert(equal(actual[], expected[]));
}
// Doesn't cause an infinite loop if back is shorter than the front
@nogc nothrow pure @safe unittest
{
import std.algorithm.comparison : equal;
const int[5] expected = [1, 2, 3, 4, 5];
int[5] actual = [3, 4, 5, 1, 2];
rotate(actual[0 .. 3], actual[3 .. $]);
assert(equal(actual[], expected[]));
}
// Doesn't call .front on an empty front
@nogc nothrow pure @safe unittest
{
import std.algorithm.comparison : equal;
const int[2] expected = [2, 8];
int[2] actual = expected;
rotate(actual[0 .. 0], actual[]);
assert(equal(actual[], expected[]));
}