From b02f6221827f125230f3c32950b4b2ecf9f55081 Mon Sep 17 00:00:00 2001 From: khizmax Date: Thu, 2 Jul 2015 20:55:55 +0300 Subject: [PATCH] Docfix --- cds/container/impl/lazy_list.h | 2 +- cds/container/michael_set.h | 4 ++-- cds/intrusive/basket_queue.h | 6 ++++++ cds/intrusive/optimistic_queue.h | 6 ++++++ 4 files changed, 15 insertions(+), 3 deletions(-) diff --git a/cds/container/impl/lazy_list.h b/cds/container/impl/lazy_list.h index 6cfafc29..1e13589e 100644 --- a/cds/container/impl/lazy_list.h +++ b/cds/container/impl/lazy_list.h @@ -10,7 +10,7 @@ namespace cds { namespace container { /// Lazy ordered list /** @ingroup cds_nonintrusive_list - \anchor cds_nonintrusive_LazyList_gc + @anchor cds_nonintrusive_LazyList_gc Usually, ordered single-linked list is used as a building block for the hash table implementation. The complexity of searching is O(N). diff --git a/cds/container/michael_set.h b/cds/container/michael_set.h index ce639de7..5bf3d4a9 100644 --- a/cds/container/michael_set.h +++ b/cds/container/michael_set.h @@ -356,7 +356,7 @@ namespace cds { namespace container { The user-defined functor is called only if the inserting is success. @warning For \ref cds_nonintrusive_MichaelList_gc "MichaelList" as the bucket see \ref cds_intrusive_item_creating "insert item troubleshooting". - \ref cds_nonintrusive_LazyList_gc "LazyList" provides exclusive access to inserted item and does not require any node-level + @ref cds_nonintrusive_LazyList_gc "LazyList" provides exclusive access to inserted item and does not require any node-level synchronization. */ template @@ -393,7 +393,7 @@ namespace cds { namespace container { already is in the set. @warning For \ref cds_nonintrusive_MichaelList_gc "MichaelList" as the bucket see \ref cds_intrusive_item_creating "insert item troubleshooting". - \ref cds_nonintrusive_LazyList_gc "LazyList" provides exclusive access to inserted item and does not require any node-level + @ref cds_nonintrusive_LazyList_gc "LazyList" provides exclusive access to inserted item and does not require any node-level synchronization. */ template diff --git a/cds/intrusive/basket_queue.h b/cds/intrusive/basket_queue.h index f30fb8a8..496e582b 100644 --- a/cds/intrusive/basket_queue.h +++ b/cds/intrusive/basket_queue.h @@ -439,11 +439,17 @@ namespace cds { namespace intrusive { //@endcond atomic_marked_ptr m_pHead ; ///< Queue's head pointer (aligned) + //@cond typename opt::details::apply_padding< atomic_marked_ptr, traits::padding >::padding_type pad1_; + //@endcond atomic_marked_ptr m_pTail ; ///< Queue's tail pointer (aligned) + //@cond typename opt::details::apply_padding< atomic_marked_ptr, traits::padding >::padding_type pad2_; + //@endcond node_type m_Dummy ; ///< dummy node + //@cond typename opt::details::apply_padding< node_type, traits::padding >::padding_type pad3_; + //@endcond item_counter m_ItemCounter ; ///< Item counter stat m_Stat ; ///< Internal statistics //@cond diff --git a/cds/intrusive/optimistic_queue.h b/cds/intrusive/optimistic_queue.h index 5277c4c0..50d0641c 100644 --- a/cds/intrusive/optimistic_queue.h +++ b/cds/intrusive/optimistic_queue.h @@ -428,11 +428,17 @@ namespace cds { namespace intrusive { //@endcond atomic_node_ptr m_pTail; ///< Pointer to tail node + //@cond typename opt::details::apply_padding< atomic_node_ptr, traits::padding >::padding_type pad1_; + //@endcond atomic_node_ptr m_pHead; ///< Pointer to head node + //@cond typename opt::details::apply_padding< atomic_node_ptr, traits::padding >::padding_type pad2_; + //@endcond node_type m_Dummy ; ///< dummy node + //@cond typename opt::details::apply_padding< atomic_node_ptr, traits::padding >::padding_type pad3_; + //@endcond item_counter m_ItemCounter ; ///< Item counter stat m_Stat ; ///< Internal statistics -- 2.34.1