SortedRange.trisect

Returns a tuple r such that r[0] is the same as the result of lowerBound(value), r[1] is the same as the result of equalRange(value), and r[2] is the same as the result of upperBound(value). The call is faster than computing all three separately. Uses a search schedule similar to equalRange. Completes the entire search in O(log(n)) time.

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

auto

trisect

(

)

(

V value

)

if (

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

isRandomAccessRange!Range

hasLength!Range

)

if (

isInputRange!Range &&

!isInstanceOf!(SortedRange, Range)

)

Examples

import std.algorithm.comparison : equal;
auto a = [ 1, 2, 3, 3, 3, 4, 4, 5, 6 ];
auto r = assumeSorted(a).trisect(3);
assert(equal(r[0], [ 1, 2 ]));
assert(equal(r[1], [ 3, 3, 3 ]));
assert(equal(r[2], [ 4, 4, 5, 6 ]));

SortedRange.trisect

Examples

Meta

Source