boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-08-02 12:54:29 +02:00
Code Issues Packages Projects Releases Wiki Activity

editorial

Browse Source
This commit is contained in:
joaquintides
2023-05-15 10:20:45 +02:00
parent f48fc70f4b
commit 9260bff8f8
2 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
include/boost/unordered/detail/foa/core.hpp
View File

@@ -111,7 +111,7 @@ static constexpr std::size_t default_bucket_count=0;
/* foa::table_core is the common base of foa::table and foa::concurrent_table, /* foa::table_core is the common base of foa::table and foa::concurrent_table,
* which in their turn serve as the foundational core of * which in their turn serve as the foundational core of
* boost::unordered_flat_[map|set] and boost::concurrent_flat_map, * boost::unordered_(flat|node)_(map|set) and boost::concurrent_flat_map,
* respectively. Its main internal design aspects are: * respectively. Its main internal design aspects are:
* *
* - Element slots are logically split into groups of size N=15. The number * - Element slots are logically split into groups of size N=15. The number

4
include/boost/unordered/detail/foa/table.hpp
View File

@@ -194,7 +194,7 @@ private:
/* foa::table interface departs in a number of ways from that of C++ unordered /* foa::table interface departs in a number of ways from that of C++ unordered
* associative containers because it's not for end-user consumption * associative containers because it's not for end-user consumption
* (boost::unordered_[flat|node]_[map|set] wrappers complete it as * (boost::unordered_(flat|node)_(map|set) wrappers complete it as
* appropriate). * appropriate).
* *
* The table supports two main modes of operation: flat and node-based. In the * The table supports two main modes of operation: flat and node-based. In the
@@ -215,7 +215,7 @@ private:
* *
* try_emplace, erase and find support heterogeneous lookup by default, * try_emplace, erase and find support heterogeneous lookup by default,
* that is, without checking for any ::is_transparent typedefs --the * that is, without checking for any ::is_transparent typedefs --the
* checking is done by boost::unordered_[flat|node]_[map|set]. * checking is done by boost::unordered_(flat|node)_(map|set).
*/ */
template <typename TypePolicy,typename Hash,typename Pred,typename Allocator> template <typename TypePolicy,typename Hash,typename Pred,typename Allocator>