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.

struct SortedRange(Range, alias pred = "a < b", SortedRangeOptions opt = SortedRangeOptions.assumeSorted)

auto

lowerBound

(

SearchPolicy sp = SearchPolicy.binarySearch

)

(

V value

)

if (

isTwoWayCompatible!(predFun, ElementType!Range, V) &&

hasSlicing!Range

)

if (

isInputRange!Range &&

!isInstanceOf!(SortedRange, Range)

)

Examples

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 ]));

SortedRange.lowerBound

Examples

Meta

Source