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 841d34aa67cfb7a150b9ad7383ce3252871e0e2a..852b158b492c127ca8eb78d6956615c278b00124 100644 (file)
--- a/cds/container/details/split_list_base.h
+++ b/cds/container/details/split_list_base.h
@@ -1,11 +1,11 @@
 /*
     This file is a part of libcds - Concurrent Data Structures library
 
-    (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+    (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
 
     Source code repo: http://github.com/khizmax/libcds/
     Download: http://sourceforge.net/projects/libcds/files/
-    
+
     Redistribution and use in source and binary forms, with or without
     modification, are permitted provided that the following conditions are met:
 
@@ -49,10 +49,14 @@ namespace cds { namespace container {
         /// Disabled internal statistics, see \p cds::intrusive::split_list::empty_stat
         typedef cds::intrusive::split_list::empty_stat empty_stat;
 
-        /// Selector of bucket table implementation =- typedef for \p intrusive::split_list::dynamic_bucket_table
+        /// Selector of bucket table implementation = typedef for \p intrusive::split_list::dynamic_bucket_table
         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
@@ -119,6 +123,7 @@ namespace cds { namespace container {
                 Supported types are:
                 - \p michael_list_tag - for \p MichaelList
                 - \p lazy_list_tag - for \p LazyList
+                - \p iterable_list_tag - for \p IterableList
             */
             typedef michael_list_tag    ordered_list;
 
@@ -127,6 +132,7 @@ namespace cds { namespace container {
                 Specifyes traits for selected ordered list type, default type:
                 - for \p michael_list_tag: \p container::michael_list::traits.
                 - for \p lazy_list_tag: \p container::lazy_list::traits.
+                - for \p iterable_list_tag: \p container::iterable_list::traits.
 
                 If this type is \p opt::none, the ordered list traits is combined with default
                 ordered list traits and split-list traits.