find() [1/2]

template<typename Key, typename Hash = Hash<Key>, typename KeyEqual = EqualTo<Key>>

iterator fl::unordered_set< Key, Hash, KeyEqual >::find ( const Key & key )

inline

Definition at line 105 of file unordered_set.h.

                                  {
        auto map_it = data.find(key);
        return iterator(map_it);
    }

References data.

Referenced by erase().

Here is the caller graph for this function: