mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-05-12 07:08:48 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

Remove package wide std.algorithm imports from Phobos

Browse source
This commit is contained in:
Jack Stouffer 2016-09-21 09:35:45 +01:00
parent 66f3456693
commit 67d44e4cdc
20 changed files with 43 additions and 37 deletions
Download patch file Download diff file Expand all files Collapse all files

4
std/algorithm/comparison.d
View file

@ -789,7 +789,7 @@ template equal(alias pred = "a == b")
@safe unittest
{
import std.math : approxEqual;
import std.algorithm : equal;
import std.algorithm.comparison : equal;
int[] a = [ 1, 2, 4, 3 ];
assert(!equal(a, a[1..$]));
@ -815,7 +815,7 @@ range of range (of range...) comparisons.
@safe unittest
{
import std.range : iota, chunks;
import std.algorithm : equal;
import std.algorithm.comparison : equal;
assert(equal!(equal!equal)(
[[[0, 1], [2, 3]], [[4, 5], [6, 7]]],
iota(0, 8).chunks(2).chunks(2)

6
std/algorithm/iteration.d
View file

@ -3328,7 +3328,8 @@ The number of seeds must be correspondingly increased.
*/
@safe unittest
{
import std.algorithm : map, max, min;
import std.algorithm.comparison : max, min;
import std.algorithm.iteration : map;
import std.math : approxEqual;
import std.typecons : tuple;
@ -3347,7 +3348,7 @@ The number of seeds must be correspondingly increased.
@safe unittest
{
import std.algorithm : equal, map, max, min;
import std.algorithm.comparison : equal, max, min;
import std.conv : to;
import std.range : chain;
import std.typecons : tuple;
@ -3406,7 +3407,6 @@ The number of seeds must be correspondingly increased.
@safe unittest
{
import std.algorithm : map;
import std.math : approxEqual;
import std.typecons : tuple;

1
std/algorithm/setops.d
View file

@ -339,7 +339,6 @@ auto cartesianProduct(R1, R2)(R1 range1, R2 range2)
// Issue 13091
pure nothrow @safe @nogc unittest
{
import std.algorithm : cartesianProduct;
int[1] a = [1];
foreach (t; cartesianProduct(a[], a[])) {}
}