MoveableSortedRange.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. See also STL's lower_bound.

struct MoveableSortedRange(Range, alias pred = "a < b")
lowerBound
(
SearchPolicy sp = SearchPolicy.binarySearch
V
)
()
if (
isTwoWayCompatible!(predFun, ElementType!Range, V) &&
hasSlicing!Range
)
if (
isInputRange!Range
)

Meta