From 9260bff8f8fc5077f625820b6d35030b3252f1f1 Mon Sep 17 00:00:00 2001 From: joaquintides Date: Mon, 15 May 2023 10:20:45 +0200 Subject: [PATCH] editorial --- include/boost/unordered/detail/foa/core.hpp | 2 +- include/boost/unordered/detail/foa/table.hpp | 4 ++-- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/include/boost/unordered/detail/foa/core.hpp b/include/boost/unordered/detail/foa/core.hpp index 295f580f..2e58403e 100644 --- a/include/boost/unordered/detail/foa/core.hpp +++ b/include/boost/unordered/detail/foa/core.hpp @@ -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, * 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: * * - Element slots are logically split into groups of size N=15. The number diff --git a/include/boost/unordered/detail/foa/table.hpp b/include/boost/unordered/detail/foa/table.hpp index 554e762a..4bb66fd5 100644 --- a/include/boost/unordered/detail/foa/table.hpp +++ b/include/boost/unordered/detail/foa/table.hpp @@ -194,7 +194,7 @@ private: /* foa::table interface departs in a number of ways from that of C++ unordered * 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). * * 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, * 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