insert() [2/4]

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

fl::pair< iterator, bool > fl::SortedHeapMap< Key, Value, Less >::insert ( const value_type & value )

inline

Definition at line 360 of file map.h.

                                                           {
        InsertResult result;
        bool success = data.insert(value, &result);
        iterator it = success ? data.find(value) : data.end();
        return fl::pair<iterator, bool>(it, success);
    }

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

Here is the caller graph for this function: