/*
This file is a part of libcds - Concurrent Data Structures library
- (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
Source code repo: http://github.com/khizmax/libcds/
Download: http://sourceforge.net/projects/libcds/files/
struct swap_item {
void operator()( std::list<T>& list, std::list<T>::iterator itInsert, std::list<T>::iterator itWhat )
{
- std::swap( *list.insert( itInsert, T() ), *itWhat );
+ std::swap( *list.insert( itInsert, T()), *itWhat );
}
} \endcode
struct move_item {
void operator()( std::list<T>& list, std::list<T>::iterator itInsert, std::list<T>::iterator itWhat )
{
- list.insert( itInsert, std::move( *itWhat ) );
+ list.insert( itInsert, std::move( *itWhat ));
}
} \endcode
</td>
struct swap_item {
void operator()( bc::slist<T>& list, bc::slist<T>::iterator itInsert, bc::slist<T>::iterator itWhat )
{
- std::swap( *list.insert_after( itInsert, T() ), *itWhat );
+ std::swap( *list.insert_after( itInsert, T()), *itWhat );
}
} \endcode
struct move_item {
void operator()( bc::slist<T>& list, bc::slist<T>::iterator itInsert, bc::slist<T>::iterator itWhat )
{
- list.insert_after( itInsert, std::move( *itWhat ) );
+ list.insert_after( itInsert, std::move( *itWhat ));
}
} \endcode
</td>
,resizing_policy&& resizingPolicy ///< Resizing policy
)
- : base_class( nCapacity, std::forward<resizing_policy>(resizingPolicy) )
+ : base_class( nCapacity, std::forward<resizing_policy>(resizingPolicy))
{}
/// Destructor destroys internal data