Removes unnecessary sequential map fill up routine for parallel map test cases

[libcds.git] / cds / container / details / split_list_base.h

diff --git a/cds/container/details/split_list_base.h b/cds/container/details/split_list_base.h
index f37a32980b559763b0a87138dd9b84769fac262b..852b158b492c127ca8eb78d6956615c278b00124 100644 (file)
--- a/cds/container/details/split_list_base.h
+++ b/cds/container/details/split_list_base.h
@@ -53,6 +53,10 @@ namespace cds { namespace container {
         template <bool Value>
         using dynamic_bucket_table = cds::intrusive::split_list::dynamic_bucket_table<Value>;
 
+        /// @copydoc cds::intrusive::split_list::bit_reversal
+        template <typename Type>
+        using bit_reversal = cds::intrusive::split_list::bit_reversal<Type>;
+
         using cds::intrusive::split_list::static_bucket_table;
         using cds::intrusive::split_list::expandable_bucket_table;
 
@@ -110,7 +114,7 @@ namespace cds { namespace container {
         //@endcond
 
 
-        /// SplitListSet traits
+        /// \p SplitListSet traits
         struct traits: public intrusive::split_list::traits
         {
             // Ordered list implementation