find() [1/2]

template<typename Key, typename Less = fl::less<Key>>

iterator fl::flat_set< Key, Less >::find ( const Key & key )

inline

Definition at line 94 of file flat_set.h.

                                  {
        auto it = lower_bound(key);
        if (it != end() && !mLess(key, *it) && !mLess(*it, key)) {
            return it;
        }
        return end();
    }

References end(), lower_bound(), and mLess.

Referenced by contains(), count(), erase(), insert(), and insert().

Here is the call graph for this function:

Here is the caller graph for this function: