find() [2/2]

template<typename Key, typename Value, fl::size N>

iterator fl::unsorted_map_fixed< Key, Value, N >::find ( const Key & key )

inline

Definition at line 40 of file map.h.

                                               {
        for (auto it = begin(); it != end(); ++it) {
            if (it->first == key) {
                return it;
            }
        }
        return end();
    }

References begin(), end(), and fl::FL_NO_EXCEPT.

Referenced by erase(), get(), get(), has(), insert(), insert(), next(), operator[](), operator[](), prev(), update(), and update().

Here is the call graph for this function:

Here is the caller graph for this function: