Split up set2 unit test to reduce compiling time and memory
[libcds.git] / cds / intrusive / details / split_list_base.h
index 744ee9349a0d700c86fb3feb3c700550bf626ca3..cef83734e697fa87d5b4094ec671eb41d288fcc9 100644 (file)
@@ -1,10 +1,10 @@
 //$$CDS-header$$
 
-#ifndef __CDS_INTRUSIVE_DETAILS_SPLIT_LIST_BASE_H
-#define __CDS_INTRUSIVE_DETAILS_SPLIT_LIST_BASE_H
+#ifndef CDSLIB_INTRUSIVE_DETAILS_SPLIT_LIST_BASE_H
+#define CDSLIB_INTRUSIVE_DETAILS_SPLIT_LIST_BASE_H
 
 #include <cds/intrusive/details/base.h>
-#include <cds/cxx11_atomic.h>
+#include <cds/algo/atomic.h>
 #include <cds/details/allocator.h>
 #include <cds/algo/int_algo.h>
 #include <cds/algo/bitop.h>
@@ -15,6 +15,10 @@ namespace cds { namespace intrusive {
     /** @ingroup cds_intrusive_helper
     */
     namespace split_list {
+        //@cond
+        struct implementation_tag;
+        //@endcond
+
         /// Split-ordered list node
         /**
             Template parameter:
@@ -871,7 +875,7 @@ namespace cds { namespace intrusive {
         }
         //@endcond
 
-    }   // namespace split_list
+    } // namespace split_list
 
     //@cond
     // Forward declaration
@@ -881,4 +885,4 @@ namespace cds { namespace intrusive {
 
 }}  // namespace cds::intrusive
 
-#endif // #ifndef __CDS_INTRUSIVE_DETAILS_SPLIT_LIST_BASE_H
+#endif // #ifndef CDSLIB_INTRUSIVE_DETAILS_SPLIT_LIST_BASE_H