MoveableSortedRange.equalRange

Returns the subrange containing all elements e for which both pred(e, value) and pred(value, e) evaluate to false (e.g., if pred is "less than", returns the portion of the range with elements equal to value). Uses a classic binary search with interval halving until it finds a value that satisfies the condition, then uses SearchPolicy.gallopBackwards to find the left boundary and SearchPolicy.gallop to find the right boundary. These policies are justified by the fact that the two boundaries are likely to be near the first found value (i.e., equal ranges are relatively small). Completes the entire search in O(log(n)) time. See also STL's equal_range.

struct MoveableSortedRange(Range, alias pred = "a < b")
equalRange
(
V
)
()
if (
isTwoWayCompatible!(predFun, ElementType!Range, V) &&
isRandomAccessRange!Range
)
if (
isInputRange!Range
)

Meta