View source code
Display the source code in std/algorithm/sorting.d from which this
page was generated on github.
Report a bug
If you spot a problem with this page, click here to create a
Bugzilla issue.
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.
Function std.algorithm.sorting.isPartitioned
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 r is partitioned according to predicate pred.
Example
int[] r = [ 1, 3, 5, 7, 8, 2, 4, ];
assert(isPartitioned!"a & 1"(r));
Authors
License
Copyright © 1999-2024 by the D Language Foundation | Page generated by ddox.