Removed redundant spaces

[libcds.git] / cds / container / striped_set / std_vector.h

diff --git a/cds/container/striped_set/std_vector.h b/cds/container/striped_set/std_vector.h
index 35a886ec66e17fe506657b78966111eac421a90f..1656088c283336335f8d9d7bde0351548cea24a0 100644 (file)
--- a/cds/container/striped_set/std_vector.h
+++ b/cds/container/striped_set/std_vector.h
@@ -153,7 +153,7 @@ namespace cds { namespace intrusive { namespace striped_set {
             template <typename Q, typename Func>
             bool insert( const Q& val, Func f )
             {
-                iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate() );
+                iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate());
                 if ( it == m_Vector.end() || key_comparator()( val, *it ) != 0 ) {
                     value_type newItem( val );
                     it = m_Vector.insert( it, newItem );
@@ -173,9 +173,9 @@ namespace cds { namespace intrusive { namespace striped_set {
 #else
                 value_type val( std::forward<Args>(args)... );
 #endif
-                iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate() );
+                iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate());
                 if ( it == m_Vector.end() || key_comparator()( val, *it ) != 0 ) {
-                    it = m_Vector.emplace( it, std::move( val ) );
+                    it = m_Vector.emplace( it, std::move( val ));
                     return true;
                 }
                 return false;
@@ -184,7 +184,7 @@ namespace cds { namespace intrusive { namespace striped_set {
             template <typename Q, typename Func>
             std::pair<bool, bool> update( const Q& val, Func func, bool bAllowInsert )
             {
-                iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate() );
+                iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate());
                 if ( it == m_Vector.end() || key_comparator()( val, *it ) != 0 ) {
                     // insert new
                     if ( !bAllowInsert )
@@ -205,7 +205,7 @@ namespace cds { namespace intrusive { namespace striped_set {
             template <typename Q, typename Func>
             bool erase( const Q& key, Func f )
             {
-                iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), key, find_predicate() );
+                iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), key, find_predicate());
                 if ( it == m_Vector.end() || key_comparator()( key, *it ) != 0 )
                     return false;
 
@@ -219,7 +219,7 @@ namespace cds { namespace intrusive { namespace striped_set {
             bool erase( const Q& key, Less pred, Func f )
             {
                 iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), key, pred );
-                if ( it == m_Vector.end() || pred( key, *it ) || pred( *it, key ) )
+                if ( it == m_Vector.end() || pred( key, *it ) || pred( *it, key ))
                     return false;
 
                 // key exists
@@ -231,7 +231,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_Vector.begin(), m_Vector.end(), val, find_predicate() );
+                iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate());
                 if ( it == m_Vector.end() || key_comparator()( val, *it ) != 0 )
                     return false;
 
@@ -244,7 +244,7 @@ namespace cds { namespace intrusive { namespace striped_set {
             bool find( Q& val, Less pred, Func f )
             {
                 iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, pred );
-                if ( it == m_Vector.end() || pred( val, *it ) || pred( *it, val ) )
+                if ( it == m_Vector.end() || pred( val, *it ) || pred( *it, val ))
                     return false;
 
                 // key exists
@@ -265,7 +265,7 @@ namespace cds { namespace intrusive { namespace striped_set {
 
             void move_item( adapted_container& /*from*/, iterator itWhat )
             {
-                iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), *itWhat, find_predicate() );
+                iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), *itWhat, find_predicate());
                 assert( it == m_Vector.end() || key_comparator()( *itWhat, *it ) != 0 );
 
                 copy_item()( m_Vector, it, itWhat );