View source code
Display the source code in std/range/package.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.range.assumeSorted
Assumes r
is sorted by predicate pred
and returns the
corresponding SortedRange!(pred, R)
having r
as support.
To check for sorted-ness at
cost Ο(n
), use isSorted
.
auto auto assumeSorted(alias pred, R)
(
R r
)
if (isInputRange!(Unqual!R));
Example
import std .algorithm .comparison : equal;
int[] a = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];
auto p = assumeSorted(a);
assert(equal(p .lowerBound(4), [0, 1, 2, 3]));
assert(equal(p .lowerBound(5), [0, 1, 2, 3, 4]));
assert(equal(p .lowerBound(6), [0, 1, 2, 3, 4, 5]));
assert(equal(p .lowerBound(6.9), [0, 1, 2, 3, 4, 5, 6]));
Authors
Andrei Alexandrescu, David Simcha, Jonathan M Davis, and Jack Stouffer. Credit for some of the ideas in building this module goes to Leonardo Maffi.
License
Copyright © 1999-2022 by the D Language Foundation | Page generated by ddox.