insert() [3/4]

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

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

inline

Definition at line 380 of file map.h.

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