#ifndef __CDS_CONTAINER_STRIPED_SET_STD_LIST_ADAPTER_H
#define __CDS_CONTAINER_STRIPED_SET_STD_LIST_ADAPTER_H
-#include <cds/container/striped_set/adapter.h>
-#include <cds/ref.h>
+#include <functional> // ref
#include <list>
#include <algorithm> // std::lower_bound
+#include <cds/container/striped_set/adapter.h>
//@cond
namespace cds { namespace container {
if ( it == m_List.end() || key_comparator()( val, *it ) != 0 ) {
value_type newItem( val );
it = m_List.insert( it, newItem );
- cds::unref( f )( *it );
+ f( *it );
# ifdef __GLIBCXX__
++m_nSize;
// insert new
value_type newItem( val );
it = m_List.insert( it, newItem );
- cds::unref( func )( true, *it, val );
+ func( true, *it, val );
# ifdef __GLIBCXX__
++m_nSize;
# endif
}
else {
// already exists
- cds::unref( func )( false, *it, val );
+ func( false, *it, val );
return std::make_pair( true, false );
}
}
return false;
// key exists
- cds::unref( f )( *it );
+ f( *it );
m_List.erase( it );
# ifdef __GLIBCXX__
--m_nSize;
return false;
// key exists
- cds::unref( f )( *it );
+ f( *it );
m_List.erase( it );
# ifdef __GLIBCXX__
--m_nSize;
return false;
// key exists
- cds::unref( f )( *it, val );
+ f( *it, val );
return true;
}
return false;
// key exists
- cds::unref( f )( *it, val );
+ f( *it, val );
return true;
}