find() [1/2]

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

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

inline

Definition at line 416 of file map.h.

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

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

Here is the caller graph for this function: