+++ /dev/null
-//$$CDS-header$$
-
-#ifndef __CDS_CONTAINER_BASE_H
-#define __CDS_CONTAINER_BASE_H
-
-#include <cds/intrusive/details/base.h>
-#include <cds/details/allocator.h>
-
-namespace cds {
-
-/// Standard (non-intrusive) containers
-/**
- @ingroup cds_nonintrusive_containers
- This namespace contains implementations of non-intrusive (std-like) lock-free containers.
-*/
-namespace container {
-
- /// Common options for non-intrusive containers
- /** @ingroup cds_nonintrusive_helper
- This namespace contains options for non-intrusive containers that is, in general, the same as for the intrusive containers.
- It imports all definitions from cds::opt and cds::intrusive::opt namespaces
- */
- namespace opt {
- using namespace cds::intrusive::opt;
- } // namespace opt
-
- /// @defgroup cds_nonintrusive_containers Non-intrusive containers
- /** @defgroup cds_nonintrusive_helper Helper structs for non-intrusive containers
- @ingroup cds_nonintrusive_containers
- */
-
- /** @defgroup cds_nonintrusive_stack Stack
- @ingroup cds_nonintrusive_containers
- */
- /** @defgroup cds_nonintrusive_queue Queue
- @ingroup cds_nonintrusive_containers
- */
- /** @defgroup cds_nonintrusive_deque Deque
- @ingroup cds_nonintrusive_containers
- */
- /** @defgroup cds_nonintrusive_priority_queue Priority queue
- @ingroup cds_nonintrusive_containers
- */
- /** @defgroup cds_nonintrusive_map Map
- @ingroup cds_nonintrusive_containers
- */
- /** @defgroup cds_nonintrusive_set Set
- @ingroup cds_nonintrusive_containers
- */
- /** @defgroup cds_nonintrusive_list List
- @ingroup cds_nonintrusive_containers
- */
- /** @defgroup cds_nonintrusive_tree Tree
- @ingroup cds_nonintrusive_containers
- */
-
-} // namespace container
-} // namespace cds
-
-#endif // #ifndef __CDS_CONTAINER_BASE_H
#include <memory>
#include <cds/intrusive/basket_queue.h>
-#include <cds/container/base.h>
+#include <cds/container/details/base.h>
#include <cds/ref.h>
#include <cds/details/trivial_assign.h>
--- /dev/null
+//$$CDS-header$$
+
+#ifndef __CDS_CONTAINER_DETAILS_BASE_H
+#define __CDS_CONTAINER_DETAILS_BASE_H
+
+#include <cds/intrusive/details/base.h>
+#include <cds/details/allocator.h>
+
+namespace cds {
+
+/// Standard (non-intrusive) containers
+/**
+ @ingroup cds_nonintrusive_containers
+ This namespace contains implementations of non-intrusive (std-like) lock-free containers.
+*/
+namespace container {
+
+ /// Common options for non-intrusive containers
+ /** @ingroup cds_nonintrusive_helper
+ This namespace contains options for non-intrusive containers that is, in general, the same as for the intrusive containers.
+ It imports all definitions from cds::opt and cds::intrusive::opt namespaces
+ */
+ namespace opt {
+ using namespace cds::intrusive::opt;
+ } // namespace opt
+
+ /// @defgroup cds_nonintrusive_containers Non-intrusive containers
+ /** @defgroup cds_nonintrusive_helper Helper structs for non-intrusive containers
+ @ingroup cds_nonintrusive_containers
+ */
+
+ /** @defgroup cds_nonintrusive_stack Stack
+ @ingroup cds_nonintrusive_containers
+ */
+ /** @defgroup cds_nonintrusive_queue Queue
+ @ingroup cds_nonintrusive_containers
+ */
+ /** @defgroup cds_nonintrusive_deque Deque
+ @ingroup cds_nonintrusive_containers
+ */
+ /** @defgroup cds_nonintrusive_priority_queue Priority queue
+ @ingroup cds_nonintrusive_containers
+ */
+ /** @defgroup cds_nonintrusive_map Map
+ @ingroup cds_nonintrusive_containers
+ */
+ /** @defgroup cds_nonintrusive_set Set
+ @ingroup cds_nonintrusive_containers
+ */
+ /** @defgroup cds_nonintrusive_list List
+ @ingroup cds_nonintrusive_containers
+ */
+ /** @defgroup cds_nonintrusive_tree Tree
+ @ingroup cds_nonintrusive_containers
+ */
+
+} // namespace container
+} // namespace cds
+
+#endif // #ifndef __CDS_CONTAINER_DETAILS_BASE_H
#define __CDS_CONTAINER_ELLEN_BINTREE_BASE_H
#include <cds/intrusive/details/ellen_bintree_base.h>
-#include <cds/container/base.h>
+#include <cds/container/details/base.h>
#include <cds/opt/compare.h>
#include <cds/details/binary_functor_wrapper.h>
#ifndef __CDS_CONTAINER_LAZY_LIST_BASE_H
#define __CDS_CONTAINER_LAZY_LIST_BASE_H
-#include <cds/container/base.h>
+#include <cds/container/details/base.h>
#include <cds/intrusive/details/lazy_list_base.h>
#include <cds/urcu/options.h>
#ifndef __CDS_CONTAINER_MICHAEL_LIST_BASE_H
#define __CDS_CONTAINER_MICHAEL_LIST_BASE_H
-#include <cds/container/base.h>
+#include <cds/container/details/base.h>
#include <cds/intrusive/details/michael_list_base.h>
#include <cds/urcu/options.h>
#include <memory>
#include <cds/intrusive/moir_queue.h>
#include <cds/intrusive/details/queue_stat.h>
-#include <cds/container/base.h>
+#include <cds/container/details/base.h>
#include <cds/ref.h>
#include <cds/details/trivial_assign.h>
#define __CDS_CONTAINER_MSPRIORITY_QUEUE_H
#include <memory>
-#include <cds/container/base.h>
+#include <cds/container/details/base.h>
#include <cds/intrusive/mspriority_queue.h>
namespace cds { namespace container {
#include <memory>
#include <cds/intrusive/msqueue.h>
-#include <cds/container/base.h>
+#include <cds/container/details/base.h>
#include <cds/ref.h>
#include <cds/details/trivial_assign.h>
#include <memory>
#include <cds/intrusive/optimistic_queue.h>
-#include <cds/container/base.h>
+#include <cds/container/details/base.h>
#include <cds/ref.h>
#include <cds/details/trivial_assign.h>
#define __CDS_CONTAINER_SKIP_LIST_BASE_H
#include <cds/intrusive/details/skip_list_base.h>
-#include <cds/container/base.h>
+#include <cds/container/details/base.h>
namespace cds { namespace container {
#include <memory>
#include <cds/intrusive/treiber_stack.h>
-#include <cds/container/base.h>
+#include <cds/container/details/base.h>
namespace cds { namespace container {
#include <memory>
#include <cds/intrusive/tsigas_cycle_queue.h>
-#include <cds/container/base.h>
+#include <cds/container/details/base.h>
#include <cds/details/trivial_assign.h>
namespace cds { namespace container {
#ifndef __CDS_CONTAINER_VYUKOV_MPMC_CYCLE_QUEUE_H
#define __CDS_CONTAINER_VYUKOV_MPMC_CYCLE_QUEUE_H
-#include <cds/container/base.h>
+#include <cds/container/details/base.h>
#include <cds/opt/buffer.h>
#include <cds/opt/value_cleaner.h>
#include <cds/cxx11_atomic.h>
<ClInclude Include="..\..\..\cds\container\cuckoo_base.h" />\r
<ClInclude Include="..\..\..\cds\container\cuckoo_map.h" />\r
<ClInclude Include="..\..\..\cds\container\cuckoo_set.h" />\r
+ <ClInclude Include="..\..\..\cds\container\details\base.h" />\r
<ClInclude Include="..\..\..\cds\container\details\guarded_ptr_cast.h" />\r
<ClInclude Include="..\..\..\cds\container\details\make_skip_list_map.h" />\r
<ClInclude Include="..\..\..\cds\container\details\make_skip_list_set.h" />\r
<ClInclude Include="..\..\..\cds\intrusive\treiber_stack.h" />\r
<ClInclude Include="..\..\..\cds\intrusive\tsigas_cycle_queue.h" />\r
<ClInclude Include="..\..\..\cds\intrusive\vyukov_mpmc_cycle_queue.h" />\r
- <ClInclude Include="..\..\..\cds\container\base.h" />\r
<ClInclude Include="..\..\..\cds\container\fcdeque.h" />\r
<ClInclude Include="..\..\..\cds\container\fcpriority_queue.h" />\r
<ClInclude Include="..\..\..\cds\container\fcqueue.h" />\r
<ClInclude Include="..\..\..\cds\intrusive\vyukov_mpmc_cycle_queue.h">\r
<Filter>Header Files\cds\intrusive</Filter>\r
</ClInclude>\r
- <ClInclude Include="..\..\..\cds\container\base.h">\r
- <Filter>Header Files\cds\container</Filter>\r
- </ClInclude>\r
<ClInclude Include="..\..\..\cds\container\fcdeque.h">\r
<Filter>Header Files\cds\container</Filter>\r
</ClInclude>\r
<ClInclude Include="..\..\..\cds\intrusive\details\split_list_base.h">\r
<Filter>Header Files\cds\intrusive\details</Filter>\r
</ClInclude>\r
+ <ClInclude Include="..\..\..\cds\container\details\base.h">\r
+ <Filter>Header Files\cds\container\details</Filter>\r
+ </ClInclude>\r
</ItemGroup>\r
</Project>
\ No newline at end of file