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.

                                         {
        ValueWithId search_key(value_type(key, Value()), 0);
        return iterator(mTree.lower_bound(search_key));
    }

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: