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

typos/editorial

Browse Source
This commit is contained in:
joaquintides
2023-05-14 11:13:48 +02:00
parent 48f703132e
commit f48fc70f4b
3 changed files with 5 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
doc/unordered/buckets.adoc
View File

@ -361,3 +361,6 @@ to be started over if some other thread interferes in the process by
performing a succesful insertion beginning at the same group. In performing a succesful insertion beginning at the same group. In
practice, the start-over frequency is extremely small, measured in the range practice, the start-over frequency is extremely small, measured in the range
of parts per million for some of our benchmarks. of parts per million for some of our benchmarks.
For more information on implementation rationale, read the
xref:#rationale_concurrent_hashmap[corresponding section].

2
doc/unordered/compliance.adoc
View File

@ -188,7 +188,7 @@ is served by:
template<class F> size_t visit_all(F f); template<class F> size_t visit_all(F f);
---- ----
of which there are parallelized version in C++17 compilers with parallel of which there are parallelized versions in C++17 compilers with parallel
algorithm support. In general, the interface of `boost::concurrent_flat_map` algorithm support. In general, the interface of `boost::concurrent_flat_map`
is derived from that of `boost::unordered_flat_map` by a fairly straightforward is derived from that of `boost::unordered_flat_map` by a fairly straightforward
process of replacing iterators with visitation where applicable. If process of replacing iterators with visitation where applicable. If

2
doc/unordered/rationale.adoc
View File

@ -132,7 +132,7 @@ lookup that are lock-free up to the last step of actual element comparison.
of all elements between `boost::concurrent_flat_map` and `boost::unordered_flat_map`. of all elements between `boost::concurrent_flat_map` and `boost::unordered_flat_map`.
(This feature has not been implemented yet.) (This feature has not been implemented yet.)
=== Hash function and platform interopersability === Hash function and platform interoperability
`boost::concurrent_flat_map` makes the same decisions and provides the same guarantees `boost::concurrent_flat_map` makes the same decisions and provides the same guarantees
as Boost.Unordered open-addressing containers with regards to as Boost.Unordered open-addressing containers with regards to