OrderedIndex.lowerBound

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

Complexity: O(log(n))

mixin template OrderedIndex(size_t N, bool allowDuplicates, alias KeyFromValue, alias Compare, ThisContainer)
lowerBound
(
U
)
(
U k
)
if (
isImplicitlyConvertible!(U, KeyType)
)

Meta