mirror of
https://github.com/dlang/phobos.git
synced 2025-04-29 14:40:30 +03:00
Move SortOutput to std.algorithm.sorting.
This commit is contained in:
parent
a43e8d22cd
commit
873f448ef3
3 changed files with 11 additions and 12 deletions
|
@ -183,13 +183,3 @@ public import std.algorithm.setops;
|
|||
public import std.algorithm.searching;
|
||||
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
|
||||
}
|
||||
|
||||
|
|
|
@ -595,7 +595,7 @@ void largestPartialIntersection
|
|||
sorted);
|
||||
}
|
||||
|
||||
import std.algorithm : SortOutput; // FIXME
|
||||
import std.algorithm.sorting : SortOutput; // FIXME
|
||||
|
||||
// largestPartialIntersectionWeighted
|
||||
/**
|
||||
|
|
|
@ -61,7 +61,6 @@ T2=$(TR $(TDNW $(LREF $1)) $(TD $+))
|
|||
*/
|
||||
module std.algorithm.sorting;
|
||||
|
||||
import std.algorithm : SortOutput; // FIXME
|
||||
import std.algorithm.mutation : SwapStrategy;
|
||||
import std.functional; // : unaryFun, binaryFun;
|
||||
import std.range.primitives;
|
||||
|
@ -69,6 +68,16 @@ import std.range.primitives;
|
|||
import std.range; // : SortedRange;
|
||||
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
|
||||
/**
|
||||
Sorts the random-access range $(D chain(lhs, rhs)) according to
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue