Removed redundant spaces

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

diff --git a/cds/container/striped_set/adapter.h b/cds/container/striped_set/adapter.h
index dd2c13081baeda3ee52f848a94b98972f396e2ee..26faff5b75214dd8891399dea76c610bf8a5fcb9 100644 (file)
--- a/cds/container/striped_set/adapter.h
+++ b/cds/container/striped_set/adapter.h
@@ -260,7 +260,7 @@ namespace cds { namespace container {
 
                     void operator()( set_type& set, iterator itWhat )
                     {
-                        set.insert( std::move( *itWhat ) );
+                        set.insert( std::move( *itWhat ));
                     }
                 };
             };
@@ -306,9 +306,9 @@ namespace cds { namespace container {
                 template <typename Q, typename Func>
                 bool insert( const Q& val, Func f )
                 {
-                    std::pair<iterator, bool> res = m_Set.insert( value_type(val) );
+                    std::pair<iterator, bool> res = m_Set.insert( value_type(val));
                     if ( res.second )
-                        f( const_cast<value_type&>(*res.first) );
+                        f( const_cast<value_type&>(*res.first));
                     return res.second;
                 }
 
@@ -323,13 +323,13 @@ namespace cds { namespace container {
                 std::pair<bool, bool> update( const Q& val, Func func, bool bAllowInsert )
                 {
                     if ( bAllowInsert ) {
-                        std::pair<iterator, bool> res = m_Set.insert( value_type(val) );
+                        std::pair<iterator, bool> res = m_Set.insert( value_type(val));
                         func( res.second, const_cast<value_type&>(*res.first), val );
                         return std::make_pair( true, res.second );
                     }
                     else {
                         auto it = m_Set.find( value_type( val ));
-                        if ( it == m_Set.end() )
+                        if ( it == m_Set.end())
                             return std::make_pair( false, false );
                         func( false, const_cast<value_type&>(*it), val );
                         return std::make_pair( true, false );
@@ -339,10 +339,10 @@ namespace cds { namespace container {
                 template <typename Q, typename Func>
                 bool erase( const Q& key, Func f )
                 {
-                    const_iterator it = m_Set.find( value_type(key) );
-                    if ( it == m_Set.end() )
+                    const_iterator it = m_Set.find( value_type(key));
+                    if ( it == m_Set.end())
                         return false;
-                    f( const_cast<value_type&>(*it) );
+                    f( const_cast<value_type&>(*it));
                     m_Set.erase( it );
                     return true;
                 }
@@ -350,8 +350,8 @@ namespace cds { namespace container {
                 template <typename Q, typename Func>
                 bool find( Q& val, Func f )
                 {
-                    iterator it = m_Set.find( value_type(val) );
-                    if ( it == m_Set.end() )
+                    iterator it = m_Set.find( value_type(val));
+                    if ( it == m_Set.end())
                         return false;
                     f( const_cast<value_type&>(*it), val );
                     return true;
@@ -369,7 +369,7 @@ namespace cds { namespace container {
 
                 void move_item( adapted_container& /*from*/, iterator itWhat )
                 {
-                    assert( m_Set.find( *itWhat ) == m_Set.end() );
+                    assert( m_Set.find( *itWhat ) == m_Set.end());
                     copy_item()( m_Set, itWhat );
                 }
 
@@ -399,7 +399,7 @@ namespace cds { namespace container {
 
                     void operator()( map_type& map, iterator itWhat )
                     {
-                        std::pair< iterator, bool > ret = map.insert( pair_type( itWhat->first, typename pair_type::second_type() ));
+                        std::pair< iterator, bool > ret = map.insert( pair_type( itWhat->first, typename pair_type::second_type()));
                         assert( ret.second )    ;   // successful insertion
                         std::swap( ret.first->second, itWhat->second );
                     }
@@ -412,7 +412,7 @@ namespace cds { namespace container {
 
                     void operator()( map_type& map, iterator itWhat  )
                     {
-                        map.insert( std::move( *itWhat ) );
+                        map.insert( std::move( *itWhat ));
                     }
                 };
             };
@@ -452,7 +452,7 @@ namespace cds { namespace container {
                 template <typename Q, typename Func>
                 bool insert( const Q& key, Func f )
                 {
-                    std::pair<iterator, bool> res = m_Map.insert( value_type( key_type( key ), mapped_type() ) );
+                    std::pair<iterator, bool> res = m_Map.insert( value_type( key_type( key ), mapped_type()) );
                     if ( res.second )
                         f( *res.first );
                     return res.second;
@@ -469,13 +469,13 @@ namespace cds { namespace container {
                 std::pair<bool, bool> update( const Q& key, Func func, bool bAllowInsert )
                 {
                     if ( bAllowInsert ) {
-                        std::pair<iterator, bool> res = m_Map.insert( value_type( key_type( key ), mapped_type() ));
+                        std::pair<iterator, bool> res = m_Map.insert( value_type( key_type( key ), mapped_type()));
                         func( res.second, *res.first );
                         return std::make_pair( true, res.second );
                     }
                     else {
                         auto it = m_Map.find( key_type( key ));
-                        if ( it == end() )
+                        if ( it == end())
                             return std::make_pair( false, false );
                         func( false, *it );
                         return std::make_pair( true, false );
@@ -486,7 +486,7 @@ namespace cds { namespace container {
                 bool erase( const Q& key, Func f )
                 {
                     iterator it = m_Map.find( key_type( key ));
-                    if ( it == m_Map.end() )
+                    if ( it == m_Map.end())
                         return false;
                     f( *it );
                     m_Map.erase( it );
@@ -497,7 +497,7 @@ namespace cds { namespace container {
                 bool find( Q& val, Func f )
                 {
                     iterator it = m_Map.find( key_type( val ));
-                    if ( it == m_Map.end() )
+                    if ( it == m_Map.end())
                         return false;
                     f( *it, val );
                     return true;
@@ -515,7 +515,7 @@ namespace cds { namespace container {
 
                 void move_item( adapted_container& /*from*/, iterator itWhat )
                 {
-                    assert( m_Map.find( itWhat->first ) == m_Map.end() );
+                    assert( m_Map.find( itWhat->first ) == m_Map.end());
                     copy_item()( m_Map, itWhat );
                 }