lower_bound() [2/2]

template<typename Key, typename Compare = less<Key>, typename Allocator = allocator<Key>>

const_iterator fl::MultiSetTree< Key, Compare, Allocator >::lower_bound ( const Key & key ) const

inline

Definition at line 332 of file multi_set.h.

                                                     {
        ValueWithId search_key(key, 0);
        return const_iterator(mTree.lower_bound(search_key));
    }