From 1e1276cf9a6031f345f7a9c5441d0c5056e83b01 Mon Sep 17 00:00:00 2001 From: khizmax Date: Fri, 2 Jan 2015 18:31:10 +0300 Subject: [PATCH] Fix doc bugs --- cds/intrusive/ellen_bintree_rcu.h | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/cds/intrusive/ellen_bintree_rcu.h b/cds/intrusive/ellen_bintree_rcu.h index e1120c1a..2d59d3dd 100644 --- a/cds/intrusive/ellen_bintree_rcu.h +++ b/cds/intrusive/ellen_bintree_rcu.h @@ -62,7 +62,7 @@ namespace cds { namespace intrusive { Instead of helping, when a thread encounters a concurrent operation it just spins waiting for the operation done. Such solution allows greatly simplify the implementation of tree. - Template arguments : + Template arguments: - \p RCU - one of \ref cds_urcu_gc "RCU type" - \p Key - key type, a subset of \p T - \p T - type to be stored in tree's leaf nodes. The type must be based on \p ellen_bintree::node @@ -473,7 +473,7 @@ namespace cds { namespace intrusive { # endif typedef typename traits::item_counter item_counter; ///< Item counting policy used - typedef typename traits::memory_model memory_model; ///< Memory ordering. See cds::opt::memory_model option + typedef typename traits::memory_model memory_model; ///< Memory ordering. See \p cds::opt::memory_model option typedef typename traits::stat stat; ///< internal statistics type typedef typename traits::rcu_check_deadlock rcu_check_deadlock; ///< Deadlock checking policy typedef typename traits::key_extractor key_extractor; ///< key extracting functor @@ -852,8 +852,8 @@ namespace cds { namespace intrusive { The function searches the item \p val in the tree and unlink it from the tree if it is found and is equal to \p val. - Difference between \ref erase and \p unlink functions: \p erase finds a key - and deletes the item found. \p unlink finds an item by key and deletes it + Difference between \p erase() and \p %unlink() functions: \p %erase() finds a key + and deletes the item found. \p %unlink() finds an item by key and deletes it only if \p val is an item of the tree, i.e. the pointer to item found is equal to &val . -- 2.34.1