get()

template<typename Key, typename Value, typename Less = fl::less<Key>>

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

inline

Definition at line 499 of file map.h.

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