Removed redundant spaces

[libcds.git] / cds / container / striped_map / std_list.h

diff --git a/cds/container/striped_map/std_list.h b/cds/container/striped_map/std_list.h
index 2d658e0f1505fd604debd1f9b48005904869e63c..10e6a06463b84f3efe9298ed47263aff4bbbca28 100644 (file)
--- a/cds/container/striped_map/std_list.h
+++ b/cds/container/striped_map/std_list.h
@@ -70,7 +70,7 @@ namespace cds { namespace container {
 
             void operator()( list_type& list, iterator itInsert, iterator itWhat )
             {
-                pair_type newVal( itWhat->first, typename pair_type::second_type() );
+                pair_type newVal( itWhat->first, typename pair_type::second_type());
                 itInsert = list.insert( itInsert, newVal );
                 std::swap( itInsert->second, itWhat->second );
             }
@@ -86,7 +86,7 @@ namespace cds { namespace container {
 
             void operator()( list_type& list, iterator itInsert, iterator itWhat )
             {
-                list.insert( itInsert, std::move( *itWhat ) );
+                list.insert( itInsert, std::move( *itWhat ));
             }
         };
     } // namespace striped_set
@@ -175,9 +175,9 @@ namespace cds { namespace intrusive { namespace striped_set {
             template <typename Q, typename Func>
             bool insert( const Q& key, Func f )
             {
-                iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate() );
+                iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate());
                 if ( it == m_List.end() || key_comparator()( key, it->first ) != 0 ) {
-                    it = m_List.insert( it, value_type( key_type( key ), mapped_type()) );
+                    it = m_List.insert( it, value_type( key_type( key ), mapped_type()));
                     f( *it );
 
 #           if !defined(CDS_STD_LIST_SIZE_CXX11_CONFORM)
@@ -194,7 +194,7 @@ namespace cds { namespace intrusive { namespace striped_set {
             bool emplace( K&& key, Args&&... args )
             {
                 value_type val( key_type( std::forward<K>( key )), mapped_type( std::forward<Args>( args )... ));
-                iterator it = std::lower_bound( m_List.begin(), m_List.end(), val.first, find_predicate() );
+                iterator it = std::lower_bound( m_List.begin(), m_List.end(), val.first, find_predicate());
                 if ( it == m_List.end() || key_comparator()( val.first, it->first ) != 0 ) {
                     it = m_List.emplace( it, std::move( val ));
 
@@ -209,13 +209,13 @@ namespace cds { namespace intrusive { namespace striped_set {
             template <typename Q, typename Func>
             std::pair<bool, bool> update( const Q& key, Func func, bool bAllowInsert )
             {
-                iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate() );
+                iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate());
                 if ( it == m_List.end() || key_comparator()( key, it->first ) != 0 ) {
                     // insert new
                     if ( !bAllowInsert )
                         return std::make_pair( false, false );
 
-                    it = m_List.insert( it, value_type( key_type( key ), mapped_type() ));
+                    it = m_List.insert( it, value_type( key_type( key ), mapped_type()));
                     func( true, *it );
 #           if !defined(CDS_STD_LIST_SIZE_CXX11_CONFORM)
                     ++m_nSize;
@@ -232,7 +232,7 @@ namespace cds { namespace intrusive { namespace striped_set {
             template <typename Q, typename Func>
             bool erase( Q const& key, Func f )
             {
-                iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate() );
+                iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate());
                 if ( it == m_List.end() || key_comparator()( key, it->first ) != 0 )
                     return false;
 
@@ -250,7 +250,7 @@ namespace cds { namespace intrusive { namespace striped_set {
             bool erase( Q const& key, Less pred, Func f )
             {
                 iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, pred );
-                if ( it == m_List.end() || pred( key, it->first ) || pred( it->first, key ) )
+                if ( it == m_List.end() || pred( key, it->first ) || pred( it->first, key ))
                     return false;
 
                 // key exists
@@ -266,7 +266,7 @@ namespace cds { namespace intrusive { namespace striped_set {
             template <typename Q, typename Func>
             bool find( Q& val, Func f )
             {
-                iterator it = std::lower_bound( m_List.begin(), m_List.end(), val, find_predicate() );
+                iterator it = std::lower_bound( m_List.begin(), m_List.end(), val, find_predicate());
                 if ( it == m_List.end() || key_comparator()( val, it->first ) != 0 )
                     return false;
 
@@ -279,7 +279,7 @@ namespace cds { namespace intrusive { namespace striped_set {
             bool find( Q& val, Less pred, Func f )
             {
                 iterator it = std::lower_bound( m_List.begin(), m_List.end(), val, pred );
-                if ( it == m_List.end() || pred( val, it->first ) || pred( it->first, val ) )
+                if ( it == m_List.end() || pred( val, it->first ) || pred( it->first, val ))
                     return false;
 
                 // key exists
@@ -299,7 +299,7 @@ namespace cds { namespace intrusive { namespace striped_set {
 
             void move_item( adapted_container& /*from*/, iterator itWhat )
             {
-                iterator it = std::lower_bound( m_List.begin(), m_List.end(), *itWhat, find_predicate() );
+                iterator it = std::lower_bound( m_List.begin(), m_List.end(), *itWhat, find_predicate());
                 assert( it == m_List.end() || key_comparator()( itWhat->first, it->first ) != 0 );
 
                 copy_item()( m_List, it, itWhat );