Removed unused vars

diff --git a/cds/container/cuckoo_set.h b/cds/container/cuckoo_set.h
index b94f6bfb4c23a2d08e7ffa5a9f23cb7829b9adad..e7e50d4bf80b93201d568ee3ec9e8a802488eefe 100644 (file)
--- a/cds/container/cuckoo_set.h
+++ b/cds/container/cuckoo_set.h
@@ -603,6 +603,7 @@ namespace cds { namespace container {
         template <typename Q, typename Predicate>
         bool erase_with( Q const& key, Predicate pred )
         {
+            CDS_UNUSED( pred );
             node_type * pNode = base_class::erase_with( key, typename maker::template predicate_wrapper<Predicate, bool>() );
             if ( pNode ) {
                 free_node( pNode );
@@ -649,6 +650,7 @@ namespace cds { namespace container {
         template <typename Q, typename Predicate, typename Func>
         bool erase_with( Q const& key, Predicate pred, Func f )
         {
+            CDS_UNUSED( pred );
             node_type * pNode = base_class::erase_with( key, typename maker::template predicate_wrapper<Predicate, bool>() );
             if ( pNode ) {
                 f( pNode->m_val );
@@ -696,6 +698,7 @@ namespace cds { namespace container {
         template <typename Q, typename Predicate, typename Func>
         bool find_with( Q& val, Predicate pred, Func f )
         {
+            CDS_UNUSED( pred );
             return base_class::find_with( val, typename maker::template predicate_wrapper<Predicate, bool>(),
                 [&f](node_type& item, Q& v) { f( item.m_val, v );});
         }
@@ -736,6 +739,7 @@ namespace cds { namespace container {
         template <typename Q, typename Predicate, typename Func>
         bool find_with( Q const& val, Predicate pred, Func f )
         {
+            CDS_UNUSED( pred );
             return base_class::find_with( val, typename maker::template predicate_wrapper<Predicate, bool>(),
                 [&f](node_type& item, Q const& v) { f( item.m_val, v );});
         }
@@ -766,6 +770,7 @@ namespace cds { namespace container {
         template <typename Q, typename Predicate>
         bool find_with( Q const& val, Predicate pred )
         {
+            CDS_UNUSED( pred );
             return base_class::find_with( val, typename maker::template predicate_wrapper<Predicate, bool>(), [](node_type&, Q const&) {});
         }
 

diff --git a/cds/intrusive/ellen_bintree_rcu.h b/cds/intrusive/ellen_bintree_rcu.h
index cdaa96ea593cea4f3cddfb79c545295a54bf51e3..c0cc2ff37faf6ca7e0d136ec162546ab1b4ef54c 100644 (file)
--- a/cds/intrusive/ellen_bintree_rcu.h
+++ b/cds/intrusive/ellen_bintree_rcu.h
@@ -1305,7 +1305,7 @@ namespace cds { namespace intrusive {
             return false;
         }
 
-        void help( update_ptr pUpdate, retired_list& rl )
+        void help( update_ptr /*pUpdate*/, retired_list& /*rl*/ )
         {
             /*
             switch ( pUpdate.bits() ) {
@@ -1642,7 +1642,7 @@ namespace cds { namespace intrusive {
         }
 
         template <typename Q, typename Less>
-        value_type * extract_with_( Q const& val, Less pred )
+        value_type * extract_with_( Q const& val, Less /*pred*/ )
         {
             CDS_UNUSED( pred );
             typedef ellen_bintree::details::compare<
@@ -1849,7 +1849,7 @@ namespace cds { namespace intrusive {
         }
 
         template <typename Q, typename Less, typename Func>
-        bool find_with_( Q& val, Less pred, Func f ) const
+        bool find_with_( Q& val, Less /*pred*/, Func f ) const
         {
             CDS_UNUSED( pred );
             typedef ellen_bintree::details::compare<

diff --git a/cds/intrusive/impl/ellen_bintree.h b/cds/intrusive/impl/ellen_bintree.h
index dbcafc1170e143c3357481cc3756b9181c38b359..37ec5bf57658898d5809cb0ad4e7d1b03e303806 100644 (file)
--- a/cds/intrusive/impl/ellen_bintree.h
+++ b/cds/intrusive/impl/ellen_bintree.h
@@ -1337,7 +1337,7 @@ namespace cds { namespace intrusive {
         }
 
         template <typename Q, typename Less>
-        bool extract_with_( typename guarded_ptr::native_guard& guard, Q const& key, Less pred )
+        bool extract_with_( typename guarded_ptr::native_guard& guard, Q const& key, Less /*pred*/ )
         {
             CDS_UNUSED( pred );
             typedef ellen_bintree::details::compare<
@@ -1469,7 +1469,7 @@ namespace cds { namespace intrusive {
         }
 
         template <typename Q, typename Less, typename Func>
-        bool find_with_( Q& val, Less pred, Func f ) const
+        bool find_with_( Q& val, Less /*pred*/, Func f ) const
         {
             CDS_UNUSED( pred );
             typedef ellen_bintree::details::compare<

diff --git a/tests/unit/set2/std_hash_set.h b/tests/unit/set2/std_hash_set.h
index dcc6c42262ab816ba5ca3f24afd62dd445022b27..2089bb05795b184cf7813d8c971a40dfe7a55033 100644 (file)
--- a/tests/unit/set2/std_hash_set.h
+++ b/tests/unit/set2/std_hash_set.h
@@ -31,7 +31,7 @@ namespace set2 {
     public:
         typedef typename base_class::value_type value_type;
 
-        StdHashSet( size_t nSetSize, size_t nLoadFactor )
+        StdHashSet( size_t /*nSetSize*/, size_t /*nLoadFactor*/ )
         {}
 
         template <typename Key>

diff --git a/tests/unit/set2/std_set.h b/tests/unit/set2/std_set.h
index 096b121f9eeb5c042e5c6f0454d0e4e0e12d670c..09f8fc0ff8d9615d40617f9edf2dce780410ff29 100644 (file)
--- a/tests/unit/set2/std_set.h
+++ b/tests/unit/set2/std_set.h
@@ -18,7 +18,7 @@ namespace set2 {
     public:
         typedef typename base_class::key_type value_type;
 
-        StdSet( size_t nMapSize, size_t nLoadFactor )
+        StdSet( size_t /*nMapSize*/, size_t /*nLoadFactor*/ )
         {}
 
         template <typename Key>