insert() [1/4]

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

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

inline

Definition at line 375 of file map.h.

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