feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity

documented proxy erase(iterator)

Browse Source
This commit is contained in:
joaquintides
2023-06-19 08:21:13 -07:00
committed by Christian Mazakas
parent 2f7bba0c21
commit 2b6cfe4f3c
6 changed files with 51 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files
doc/unordered/compliance.adoc
+3 -1
View File
@@ -135,7 +135,9 @@ The main differences with C++ unordered associative containers are:
* In general:
** `begin()` is not constant-time.
** `erase(iterator)` returns `void` instead of an iterator to the following element.
** `erase(iterator)` does not return an iterator to the following element, but
a proxy object that converts to that iterator if requested; this avoids
a potentially costly iterator increment operation when not needed.
** There is no API for bucket handling (except `bucket_count`).
** The maximum load factor of the container is managed internally and can't be set by the user. The maximum load,
exposed through the public function `max_load`, may decrease on erasure under high-load conditions.