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:
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.
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef CDSLIB_CONTAINER_STRIPED_MAP_BOOST_SLIST_ADAPTER_H
void operator()( list_type& list, iterator itInsert, iterator itWhat )
{
- pair_type newVal( itWhat->first, typename pair_type::mapped_type() );
+ pair_type newVal( itWhat->first, typename pair_type::mapped_type());
itInsert = list.insert_after( itInsert, newVal );
std::swap( itInsert->second, itWhat->second );
}
void operator()( list_type& list, iterator itInsert, iterator itWhat )
{
- list.insert_after( itInsert, std::move( *itWhat ) );
+ list.insert_after( itInsert, std::move( *itWhat ));
}
};
} // namespace striped_set
{
std::pair< iterator, bool > pos = find_prev_item( key );
if ( !pos.second ) {
- pos.first = m_List.insert_after( pos.first, value_type( key_type( key ), mapped_type() ));
+ pos.first = m_List.insert_after( pos.first, value_type( key_type( key ), mapped_type()));
f( *pos.first );
return true;
}
if ( !bAllowInsert )
return std::make_pair( false, false );
- pos.first = m_List.insert_after( pos.first, value_type( key_type( key ), mapped_type() ));
+ pos.first = m_List.insert_after( pos.first, value_type( key_type( key ), mapped_type()));
func( true, *pos.first );
return std::make_pair( true, true );
}
else {
// already exists
- func( false, *(++pos.first) );
+ func( false, *(++pos.first));
return std::make_pair( true, false );
}
}
// key exists
iterator it = pos.first;
- f( *(++it) );
+ f( *(++it));
m_List.erase_after( pos.first );
return true;
// key exists
iterator it = pos.first;
- f( *(++it) );
+ f( *(++it));
m_List.erase_after( pos.first );
return true;