has()

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

bool fl::SortedHeapMap< Key, Value, Less >::has ( const Key & key ) const

inline

Definition at line 428 of file map.h.

                                   { 
        return data.has(value_type(key, Value())); 
    }

Referenced by fl::SortedHeapMap< fl::u32, FramePtr, Less >::contains().

Here is the caller graph for this function: