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)
  2. ConstRange upperBound(Elem e)
  3. ImmutableRange upperBound(Elem e)
    class RedBlackTree(T, alias less = "a < b", bool allowDuplicates = false)
    immutable
    ImmutableRange
    upperBound
    if (
    is(typeof(
    (
    ref const T a
    )
    => binaryFun!less(a, a)
    ))
    )

Meta