get() [2/2]

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

bool fl::unsorted_map_fixed< Key, Value, N >::get ( const Key & key, Value * value ) const

inline

Definition at line 102 of file map.h.

                                                              {
        const_iterator it = find(key);
        if (it != end()) {
            *value = it->second;
            return true;
        }
        return false;
    }

References end(), find(), fl::FL_NO_EXCEPT, and fl::type_rank< T >::value.

Here is the call graph for this function: