find() [2/2]

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

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

inline

Definition at line 301 of file multi_set.h.

                                              {
        ValueWithId search_key(key, 0);
        auto it = mTree.lower_bound(search_key);
        if (it != mTree.end() && it->value == key) {
            return const_iterator(it);
        }
        return end();
    }