OrderedIndex.lowerBound

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

Complexity: O(log(n))

  1. auto lowerBound(U k)
    mixintemplate OrderedIndex(size_t N, bool allowDuplicates, alias KeyFromValue, alias Compare, ThisContainer)
    lowerBound
    (
    U
    )
    (
    U k
    )
    if (
    isImplicitlyConvertible!(U, KeyType)
    )
  2. auto lowerBound(U k)
  3. auto lowerBound(CompatibleKey k)
  4. auto lowerBound(CompatibleKey k)

Meta