From 4fbf7b03cabf9890c90ae1e0962a80e24bab63cb Mon Sep 17 00:00:00 2001 From: khizmax Date: Thu, 7 Apr 2016 15:46:43 +0300 Subject: [PATCH] Docfix --- cds/intrusive/ellen_bintree_rcu.h | 10 ++++++---- cds/intrusive/impl/ellen_bintree.h | 6 ++++-- 2 files changed, 10 insertions(+), 6 deletions(-) diff --git a/cds/intrusive/ellen_bintree_rcu.h b/cds/intrusive/ellen_bintree_rcu.h index bbe14fe2..569ebf79 100644 --- a/cds/intrusive/ellen_bintree_rcu.h +++ b/cds/intrusive/ellen_bintree_rcu.h @@ -349,8 +349,8 @@ namespace cds { namespace intrusive { // Foo struct is derived from two ellen_bintree::node class // with different tags struct Foo - : public cds::intrusive::ellen_bintree::node< gpb_rcu, cds::opt::tag< string_tag > > - , public cds::intrusive::ellen_bintree::node< gpb_rcu >, cds::opt::tag< int_tag > + : public cds::intrusive::ellen_bintree::node< gpb_rcu, cds::opt::tag< string_tag >> + , public cds::intrusive::ellen_bintree::node< gpb_rcu, cds::opt::tag< int_tag >> { std::string m_strKey ; // string key int m_nKey ; // int key @@ -917,7 +917,8 @@ namespace cds { namespace intrusive { unlinks it from the tree, and returns \p true. If the item with key equal to \p key is not found the function return \p false. - Note the hash functor should accept a parameter of type \p Q that can be not the same as \p value_type. + Note the \pTraits::less and/or \p Traits::compare predicate should accept a parameter of type \p Q + that can be not the same as \p value_type. RCU \p synchronize method can be called. RCU should not be locked. */ @@ -969,7 +970,8 @@ namespace cds { namespace intrusive { If the item with key equal to \p key is not found the function return \p false. - Note the hash functor should accept a parameter of type \p Q that can be not the same as \p value_type. + Note the \pTraits::less and/or \p Traits::compare predicate should accept a parameter of type \p Q + that can be not the same as \p value_type. RCU \p synchronize method can be called. RCU should not be locked. */ diff --git a/cds/intrusive/impl/ellen_bintree.h b/cds/intrusive/impl/ellen_bintree.h index 1d90bd56..714bc12b 100644 --- a/cds/intrusive/impl/ellen_bintree.h +++ b/cds/intrusive/impl/ellen_bintree.h @@ -499,7 +499,8 @@ namespace cds { namespace intrusive { unlinks it from the tree, and returns \p true. If the item with key equal to \p key is not found the function return \p false. - Note the hash functor should accept a parameter of type \p Q that can be not the same as \p value_type. + Note the \pTraits::less and/or \p Traits::compare predicate should accept a parameter of type \p Q + that can be not the same as \p value_type. */ template bool erase( const Q& key ) @@ -549,7 +550,8 @@ namespace cds { namespace intrusive { If the item with key equal to \p key is not found the function return \p false. - Note the hash functor should accept a parameter of type \p Q that can be not the same as \p value_type. + Note the \pTraits::less and/or \p Traits::compare predicate should accept a parameter of type \p Q + that can be not the same as \p value_type. */ template bool erase( Q const& key, Func f ) -- 2.34.1