find() [1/2]

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

iterator fl::SortedHeapMap< Key, Value, Less >::find ( const Key & key )

inline

Definition at line 328 of file map.h.

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

Referenced by fl::SortedHeapMap< uint32_t, FramePtr, Less >::at(), fl::SortedHeapMap< uint32_t, FramePtr, Less >::get(), fl::SortedHeapMap< uint32_t, FramePtr, Less >::operator[](), and fl::SortedHeapMap< uint32_t, FramePtr, Less >::update().

Here is the caller graph for this function: