stylistic

.github/workflows/ci.yml

@@ -17,6 +17,7 @@ on:
       - bugfix/**
       - fix/**
       - pr/**
+      - feature/cfoa-size-padding
 
 concurrency:
   group: ${{format('{0}:{1}', github.repository, github.ref)}}

doc/unordered/concurrent.adoc

@@ -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:

doc/unordered/intro.adoc

@@ -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 {
 }
 ----
 
-Storing an object in an unordered associative container requires both a
+To store 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

include/boost/unordered/detail/foa/concurrent_table.hpp

@@ -30,7 +30,6 @@
 #include <type_traits>
 #include <tuple>
 #include <utility>
-#include "oneapi/tbb/spin_rw_mutex.h"
 
 #if !defined(BOOST_UNORDERED_DISABLE_PARALLEL_ALGORITHMS)
 #if defined(BOOST_UNORDERED_ENABLE_PARALLEL_ALGORITHMS)|| \
@@ -212,7 +211,7 @@ struct atomic_integral
 
 struct group_access
 {    
-  using mutex_type=tbb::spin_rw_mutex;
+  using mutex_type=rw_spinlock;
   using shared_lock_guard=shared_lock<mutex_type>;
   using exclusive_lock_guard=lock_guard<mutex_type>;
   using insert_counter_type=std::atomic<boost::uint32_t>;

include/boost/unordered/detail/foa/core.hpp

@@ -1293,7 +1293,7 @@ public:
     hash_base{empty_init,std::move(x.h())},
     pred_base{empty_init,std::move(x.pred())},
     allocator_base{empty_init,std::move(x.al())},
-    arrays(x.arrays),size_ctrl(x.size_ctrl)
+    arrays(x.arrays),size_ctrl{x.size_ctrl}
   {
     x.arrays=x.new_arrays(0);
     x.size_ctrl.ml=x.initial_max_load();