insert()

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

bool fl::SortedHeapMap< Key, Value, Less >::insert ( const Key & key, const Value & value, InsertResult * result = nullptr )

inline

Definition at line 265 of file map.h.

                                                {
        return data.insert(Pair(key, value), result);
    }

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

Here is the caller graph for this function: