erase() [2/3]

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

iterator fl::SortedHeapMap< Key, Value, Less >::erase ( const_iterator pos )

inline

Definition at line 393 of file map.h.

                                       {
        Key key = pos->first;
        data.erase(*pos);
        return upper_bound(key);
    }