find() [2/2]

template<typename Key, typename Value, typename Equal = fl::SmallMapEqualTo<Key>>

iterator fl::unordered_map_small< Key, Value, Equal >::find ( const Key & key )

inline

Definition at line 270 of file unordered_map_small.h.

                                               {
        size_type idx = find_index(key);
        return idx != npos() ? iterator(this, idx) : end();
    }

References end(), find_index(), fl::FL_NO_EXCEPT, and npos().

Here is the call graph for this function: