* Erase has an amortized O(1) runtime complexity, but even if it removes the * key immediately, it doesn't do the same for the associated value T. * * T will only be removed when the ratio between the size of the map and * the size of the map + the number of deleted values still stored is low * enough. * * To force the deletion you can call shrink_to_fit. */
| 303 | * To force the deletion you can call shrink_to_fit. |
| 304 | */ |
| 305 | iterator erase(const_iterator pos) { return m_ht.erase(pos); } |
| 306 | |
| 307 | /** |
| 308 | * @copydoc erase(const_iterator pos) |