-//$$CDS-header$$
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ Source code repo: http://github.com/khizmax/libcds/
+ Download: http://sourceforge.net/projects/libcds/files/
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this
+ list of conditions and the following disclaimer.
+
+ * Redistributions in binary form must reproduce the above copyright notice,
+ this list of conditions and the following disclaimer in the documentation
+ and/or other materials provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
#ifndef CDSLIB_CONTAINER_STRIPED_MAP_STD_HASH_MAP_ADAPTER_H
#define CDSLIB_CONTAINER_STRIPED_MAP_STD_HASH_MAP_ADAPTER_H
void operator()( map_type& map, iterator itWhat )
{
- pair_type pair( itWhat->first, typename pair_type::second_type() );
+ pair_type pair( itWhat->first, typename pair_type::second_type());
std::pair<iterator, bool> res = map.insert( pair );
assert( res.second );
std::swap( res.first->second, itWhat->second );
void operator()( map_type& map, iterator itWhat )
{
- map.insert( std::move( *itWhat ) );
+ map.insert( std::move( *itWhat ));
}
};
} // namespace striped_set
template <typename Q, typename Func>
bool insert( const Q& key, Func f )
{
- std::pair<iterator, bool> res = m_Map.insert( value_type( key, mapped_type() ));
+ std::pair<iterator, bool> res = m_Map.insert( value_type( key_type( key ), mapped_type()));
if ( res.second )
- f( const_cast<value_type&>(*res.first) );
+ f( const_cast<value_type&>(*res.first));
return res.second;
}
template <typename Q, typename... Args>
bool emplace( Q&& key, Args&&... args )
{
- std::pair<iterator, bool> res = m_Map.emplace( std::forward<Q>(key), std::move( mapped_type(std::forward<Args>(args)...)) );
+ std::pair<iterator, bool> res = m_Map.emplace( key_type( std::forward<Q>( key )), mapped_type( std::forward<Args>( args )...));
return res.second;
}
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, mapped_type() ) );
+ std::pair<iterator, bool> res = m_Map.insert( value_type( key_type( key ), mapped_type()) );
func( res.second, const_cast<value_type&>(*res.first));
return std::make_pair( true, res.second );
}
else {
- auto it = m_Map.find(key_type( key ));
- if ( it == end() )
+ auto it = m_Map.find( key_type( key ));
+ if ( it == end())
return std::make_pair( false, false );
func( false, *it );
return std::make_pair( true, false );
template <typename Q, typename Func>
bool erase( const Q& key, Func f )
{
- iterator it = m_Map.find( key_type(key) );
- if ( it == m_Map.end() )
+ iterator it = m_Map.find( key_type( key ));
+ if ( it == m_Map.end())
return false;
- f( const_cast<value_type&>(*it) );
+ f( const_cast<value_type&>(*it));
m_Map.erase( it );
return true;
}
template <typename Q, typename Func>
- bool find( Q& val, Func f )
+ bool find( Q& key, Func f )
{
- iterator it = m_Map.find( key_type(val) );
- if ( it == m_Map.end() )
+ iterator it = m_Map.find( key_type( key ));
+ if ( it == m_Map.end())
return false;
- f( const_cast<value_type&>(*it), val );
+ f( const_cast<value_type&>(*it), key );
return true;
}
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 );
}