mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-04-29 14:40:30 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

Move SortOutput to std.algorithm.sorting.

Browse source
This commit is contained in:
H. S. Teoh 2015-02-16 10:58:31 -08:00
parent a43e8d22cd
commit 873f448ef3
3 changed files with 11 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

10
std/algorithm/package.d
View file

@ -183,13 +183,3 @@ public import std.algorithm.setops;
public import std.algorithm.searching; public import std.algorithm.searching;
public import std.algorithm.sorting; public import std.algorithm.sorting;
/**
Specifies whether the output of certain algorithm is desired in sorted
format.
*/
enum SortOutput
{
no, /// Don't sort output
yes, /// Sort output
}

2
std/algorithm/setops.d
View file

@ -595,7 +595,7 @@ void largestPartialIntersection
sorted); sorted);
} }
import std.algorithm : SortOutput; // FIXME import std.algorithm.sorting : SortOutput; // FIXME
// largestPartialIntersectionWeighted // largestPartialIntersectionWeighted
/** /**

11
std/algorithm/sorting.d
View file

@ -61,7 +61,6 @@ T2=$(TR $(TDNW $(LREF $1)) $(TD $+))
*/ */
module std.algorithm.sorting; module std.algorithm.sorting;
import std.algorithm : SortOutput; // FIXME
import std.algorithm.mutation : SwapStrategy; import std.algorithm.mutation : SwapStrategy;
import std.functional; // : unaryFun, binaryFun; import std.functional; // : unaryFun, binaryFun;
import std.range.primitives; import std.range.primitives;
@ -69,6 +68,16 @@ import std.range.primitives;
import std.range; // : SortedRange; import std.range; // : SortedRange;
import std.traits; import std.traits;
/**
Specifies whether the output of certain algorithm is desired in sorted
format.
*/
enum SortOutput
{
no, /// Don't sort output
yes, /// Sort output
}
// completeSort // completeSort
/** /**
Sorts the random-access range $(D chain(lhs, rhs)) according to Sorts the random-access range $(D chain(lhs, rhs)) according to