OrderedIndex.lowerBound

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

Complexity: O(log(n))

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

Meta

Source

See Implementation

util multi_index OrderedIndex aliases

functions

properties

structs

OrderedRangeT

templates

IsMyRange

variables

_end