FastLED 3.9.15
Loading...
Searching...
No Matches

◆ lower_bound() [1/2]

template<typename Key, typename Value, typename Compare = less<Key>, typename Allocator = allocator<fl::pair<Key, Value>>>
iterator fl::MultiMapTree< Key, Value, Compare, Allocator >::lower_bound ( const Key & key)
inline

Definition at line 437 of file multi_map.h.

437 {
439 return iterator(mTree.lower_bound(search_key));
440 }
fl::pair< Key, Value > value_type
Definition multi_map.h:25
TreeType mTree
Definition multi_map.h:75
IteratorWrapper iterator
Definition multi_map.h:255

Referenced by fl::MultiMapTree< Key, T, Compare, fl::allocator_slab< char > >::equal_range(), and fl::MultiMapTree< Key, T, Compare, fl::allocator_slab< char > >::equal_range().

+ Here is the caller graph for this function: