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

Cleanup docs

Browse Source
This commit is contained in:
Christian Mazakas
2023-06-08 09:48:24 -07:00
parent af19d99b70
commit 2395db7bb9
2 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
doc/unordered/concurrent.adoc
View File

@ -132,7 +132,7 @@ by using `cvisit` overloads (for instance, `insert_or_cvisit`) and may result
in higher parallelization. Consult the xref:#concurrent_flat_map[reference]
for a complete list of available operations.
== Whole-table Visitation
== Whole-Table Visitation
In the absence of iterators, `boost::concurrent_flat_map` provides `visit_all`
as an alternative way to process all the elements in the map:

4
doc/unordered/intro.adoc
View File

@ -34,7 +34,7 @@ boost::unordered_set +
boost::unordered_map +
boost::unordered_multiset +
boost::unordered_multimap
^| N/A
^|
^.^h|*Open addressing*
^m| boost::unordered_node_set +
@ -85,7 +85,7 @@ namespace boost {
}
----
To store an object in an unordered associative container requires both a
Storing an object in an unordered associative container requires both a
key equality function and a hash function. The default function objects in
the standard containers support a few basic types including integer types,
floating point types, pointer types, and the standard strings. Since