boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-30 03:17:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

typos

Browse Source
This commit is contained in:
joaquintides
2023-09-16 09:47:10 +02:00
parent d5d6a18298
commit 9e38e3c578
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/unordered/concurrent.adoc
View File

@ -44,7 +44,7 @@ logical cores in the CPU).
== Visitation-based API == Visitation-based API
The first thing a new user of `boost::concurrent_flat_set` or `boost::concurrent_flat_map` The first thing a new user of `boost::concurrent_flat_set` or `boost::concurrent_flat_map`
will notice is that these classes _do not provide iterators_ (which makes then technically will notice is that these classes _do not provide iterators_ (which makes them technically
not https://en.cppreference.com/w/cpp/named_req/Container[Containers^] not https://en.cppreference.com/w/cpp/named_req/Container[Containers^]
in the C++ standard sense). The reason for this is that iterators are inherently in the C++ standard sense). The reason for this is that iterators are inherently
thread-unsafe. Consider this hypothetical code: thread-unsafe. Consider this hypothetical code:
@ -112,7 +112,7 @@ if (found) {
} }
---- ----
Visitation is prominent in the API provided by `boost::concurrent_flat_ser` and `boost::concurrent_flat_map`, and Visitation is prominent in the API provided by `boost::concurrent_flat_set` and `boost::concurrent_flat_map`, and
many classical operations have visitation-enabled variations: many classical operations have visitation-enabled variations:
[source,c++] [source,c++]