// key exists
iterator it = pos.first;
value_type& val = *(++it);
- cds::unref( f )( val );
+ f( val );
m_List.erase_after( pos.first );
return &val;
std::pair< iterator, bool > pos = find_prev_item( val );
if ( !pos.second ) {
m_List.insert_after( pos.first, val );
- cds::unref( f )( val );
+ f( val );
return true;
}
if ( !pos.second ) {
// insert new
m_List.insert_after( pos.first, val );
- cds::unref( f )( true, val, val );
+ f( true, val, val );
return std::make_pair( true, true );
}
else {
// already exists
- cds::unref( f )( false, *(++pos.first), val );
+ f( false, *(++pos.first), val );
return std::make_pair( true, false );
}
}
return false;
// key exists
- cds::unref( f )( *(++pos.first), key );
+ f( *(++pos.first), key );
return true;
}
return false;
// key exists
- cds::unref( f )( *(++pos.first), key );
+ f( *(++pos.first), key );
return true;
}