update() [2/2]

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

void fl::SortedHeapMap< Key, Value, Less >::update ( const Key & key, Value && value )

inline

Definition at line 491 of file map.h.

                                               {
        if (!insert(key, fl::move(value))) {
            iterator it = find(key);
            it->second = fl::move(value);
        }
    }