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.SortedRange.lowerBound
This function uses a search with policy sp
to find the
largest left subrange on which pred(x, value)
is true
for
all x
(e.g., if pred
is "less than", returns the portion of
the range with elements strictly smaller than value
). The search
schedule and its complexity are documented in
SearchPolicy
.
auto auto lowerBound(SearchPolicy sp = SearchPolicy .binarySearch, V)
(
V value
)
if (isTwoWayCompatible!(predFun, ElementType!Range, V) && hasSlicing!Range);
Example
import std .algorithm .comparison : equal;
auto a = assumeSorted([ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ]);
auto p = a .lowerBound(4);
assert(equal(p, [ 0, 1, 2, 3 ]));
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.