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

Use selective top-level module imports in std.algorithm

Browse source
This commit is contained in:
Sebastian Wilzbach 2019-05-23 09:47:27 +02:00
parent 24209a6cb7
commit 12c5e1ee91
6 changed files with 26 additions and 24 deletions
Download patch file Download diff file Expand all files Collapse all files

6
std/algorithm/comparison.d
View file

@ -58,13 +58,11 @@ T2=$(TR $(TDNW $(LREF $1)) $(TD $+))
*/
module std.algorithm.comparison;
// FIXME
import std.functional; // : unaryFun, binaryFun;
import std.functional : unaryFun, binaryFun;
import std.range.primitives;
import std.traits;
// FIXME
import std.meta : allSatisfy;
import std.typecons; // : tuple, Tuple, Flag, Yes;
import std.typecons : tuple, Tuple, Flag, Yes;
import std.internal.attributes : betterC;

3
std/algorithm/iteration.d
View file

@ -70,8 +70,7 @@ T2=$(TR $(TDNW $(LREF $1)) $(TD $+))
*/
module std.algorithm.iteration;
// FIXME
import std.functional; // : unaryFun, binaryFun;
import std.functional : unaryFun, binaryFun;
import std.range.primitives;
import std.traits;
import std.typecons : Flag;

3
std/algorithm/mutation.d
View file

@ -81,8 +81,7 @@ import std.range.primitives;
import std.traits : isArray, isAssignable, isBlitAssignable, isNarrowString,
Unqual, isSomeChar, isMutable;
import std.meta : allSatisfy;
// FIXME
import std.typecons; // : tuple, Tuple;
import std.typecons : tuple, Tuple;
// bringToFront
/**

7
std/algorithm/searching.d
View file

@ -102,12 +102,10 @@ T2=$(TR $(TDNW $(LREF $1)) $(TD $+))
*/
module std.algorithm.searching;
// FIXME
import std.functional; // : unaryFun, binaryFun;
import std.functional : unaryFun, binaryFun;
import std.range.primitives;
import std.traits;
// FIXME
import std.typecons; // : Tuple, Flag, Yes, No;
import std.typecons : Tuple, Flag, Yes, No, tuple;
/++
Checks if $(I _all) of the elements verify `pred`.
@ -1278,6 +1276,7 @@ private enum bool hasConstEmptyMember(T) = is(typeof(((const T* a) => (*a).empty
// see: https://github.com/dlang/phobos/pull/6136
private template RebindableOrUnqual(T)
{
import std.typecons : Rebindable;
static if (is(T == class) || is(T == interface) || isDynamicArray!T || isAssociativeArray!T)
alias RebindableOrUnqual = Rebindable!T;
else

8
std/algorithm/setops.d
View file

@ -49,13 +49,11 @@ module std.algorithm.setops;
import std.range.primitives;
// FIXME
import std.functional; // : unaryFun, binaryFun;
import std.functional : unaryFun, binaryFun;
import std.traits;
// FIXME
import std.meta; // : AliasSeq, staticMap, allSatisfy, anySatisfy;
import std.meta : AliasSeq, staticMap, allSatisfy, anySatisfy;
import std.algorithm.sorting; // : Merge;
import std.algorithm.sorting : Merge;
import std.typecons : No;
// cartesianProduct

23
std/algorithm/sorting.d
View file

@ -78,12 +78,11 @@ T2=$(TR $(TDNW $(LREF $1)) $(TD $+))
module std.algorithm.sorting;
import std.algorithm.mutation : SwapStrategy;
import std.functional; // : unaryFun, binaryFun;
import std.functional : unaryFun, binaryFun;
import std.range.primitives;
import std.typecons : Flag;
// FIXME
import std.meta; // : allSatisfy;
import std.range; // : SortedRange;
import std.typecons : Flag, No, Yes;
import std.meta : allSatisfy;
import std.range : SortedRange;
import std.traits;
/**
@ -751,8 +750,10 @@ if (isRandomAccessRange!Range && hasLength!Range && hasSlicing!Range && hasAssig
assert(a == [ 42, 42 ]);
import std.algorithm.iteration : map;
import std.array : array;
import std.format : format;
import std.random;
import std.random : Random, uniform, Xorshift;
import std.range : iota;
auto s = 123_456_789;
auto g = Xorshift(s);
a = iota(0, uniform(1, 1000, g))
@ -1063,6 +1064,7 @@ if (isRandomAccessRange!Range && !isInfinite!Range &&
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range : iota;
ubyte[256] index = void;
iota(256).makeIndex(index[]);
@ -1791,6 +1793,7 @@ private void sort5(alias lt, Range)(Range r)
{
import std.algorithm.iteration : permutations;
import std.algorithm.mutation : copy;
import std.range : iota;
int[5] buf;
foreach (per; iota(5).permutations)
@ -1931,7 +1934,10 @@ if (((ss == SwapStrategy.unstable && (hasSwappableElements!Range ||
@safe unittest
{
// Simple regression benchmark
import std.algorithm.iteration, std.algorithm.mutation, std.random;
import std.algorithm.iteration, std.algorithm.mutation;
import std.array : array;
import std.random : Random, uniform;
import std.range : iota;
Random rng;
int[] a = iota(20148).map!(_ => uniform(-1000, 1000, rng)).array;
static uint comps;
@ -3148,6 +3154,7 @@ if (isRandomAccessRange!(Range) && hasLength!Range &&
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range : zip;
import std.typecons : tuple;
auto a = [10, 30, 20];
auto b = ["c", "b", "a"];
@ -3456,7 +3463,9 @@ done:
assert(expandPartition!((a, b) => a < b)(a, 4, 5, 6) == 9);
import std.algorithm.iteration : map;
import std.array : array;
import std.random : uniform;
import std.range : iota;
auto size = uniform(1, 1000);
a = iota(0, size).map!(_ => uniform(0, 1000)).array;
if (a.length == 0) return;