RedBlackTree.lowerBound

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

Complexity: O(log(n))

  1. Range lowerBound(Elem e)
  2. ConstRange lowerBound(Elem e)
  3. ImmutableRange lowerBound(Elem e)
    class RedBlackTree(T, alias less = "a < b", bool allowDuplicates = false)
    immutable
    ImmutableRange
    lowerBound
    if (
    is(typeof(binaryFun!less(T.init, T.init)))
    )

Meta