RedBlackTree.upperBound

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

Complexity: O(log(n))

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

Meta