update()

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

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

inline

Definition at line 270 of file map.h.

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