find() [1/2]

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

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

inline

Definition at line 49 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.

Here is the call graph for this function: