has()

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

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

inline

Definition at line 294 of file map.h.

{ return data.has(Pair(key)); }

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

Here is the caller graph for this function: