View source code
Display the source code in std/algorithm/sorting.d from which this page was generated on
github.
Improve this page
Quickly fork, edit online, and submit a pull request for this page.
Requires a signed-in GitHub account. This works well for small changes.
If you'd like to make larger changes you may want to consider using
local clone.
Page wiki
View or edit the community-maintained wiki page associated with this page.
Function std.algorithm.sorting.isPartitioned
Prototype
bool isPartitioned(alias pred, Range)( Range r ) if (isForwardRange!Range);
Parameters
| Name | Description |
|---|---|
| pred | The predicate that the range should be partitioned by. |
| r | The range to check. |
Returns
true if rpred.
Example
int[] r = [ 1, 3, 5, 7, 8, 2, 4, ]; assert(isPartitioned!"a & 1"(r));