RBTree.lowerBoundRange

Get a range from the container with all elements that are < e according to the less comparator

Complexity: O(log(n))

struct RBTree(T, alias less = "a < b", bool allowDuplicates = true, ALLOC = ThreadMem, bool NOGC_ = false)
lowerBoundRange
if (
is(typeof(binaryFun!less(T.init, T.init)))
)

Meta