add find(Q const&, Func), find_with(Q const&, Pred, Func) to all sets

[libcds.git] / cds / intrusive / michael_list_rcu.h

diff --git a/cds/intrusive/michael_list_rcu.h b/cds/intrusive/michael_list_rcu.h
index 5e19b02f13cd0726d340c1bc588763249105c601..263a2b9d504d7609db4bd881751dd530491cbc72 100644 (file)
--- a/cds/intrusive/michael_list_rcu.h
+++ b/cds/intrusive/michael_list_rcu.h
@@ -565,6 +565,13 @@ namespace cds { namespace intrusive {
         {
             return find_at( const_cast<atomic_node_ptr&>(m_pHead), key, key_comparator(), f );
         }
+        //@cond
+        template <typename Q, typename Func>
+        bool find( Q const& key, Func f ) const
+        {
+            return find_at( const_cast<atomic_node_ptr&>(m_pHead), key, key_comparator(), f );
+        }
+        //@endcond
 
         /// Finds \p key using \p pred predicate for searching
         /**
@@ -578,6 +585,13 @@ namespace cds { namespace intrusive {
         {
             return find_at( const_cast<atomic_node_ptr&>( m_pHead ), key, cds::opt::details::make_comparator_from_less<Less>(), f );
         }
+        //@cond
+        template <typename Q, typename Less, typename Func>
+        bool find_with( Q const& key, Less pred, Func f ) const
+        {
+            return find_at( const_cast<atomic_node_ptr&>(m_pHead), key, cds::opt::details::make_comparator_from_less<Less>(), f );
+        }
+        //@endcond
 
         /// Finds \p key
         /** \anchor cds_intrusive_MichaelList_rcu_find_val