size_t nUpdateModified = 0;
size_t nEnsFuncCreated = 0;
size_t nEnsFuncModified = 0;
- size_t nTestFunctorRef = 0;
+ size_t nInsFuncCalled = 0;
for ( CppUnitMini::ThreadPool::iterator it = pool.begin(); it != pool.end(); ++it ) {
InserterThread * pThread = dynamic_cast<InserterThread *>( *it );
if ( pThread ) {
nInsertSuccess += pThread->m_nInsertSuccess;
nInsertFailed += pThread->m_nInsertFailed;
- nTestFunctorRef += pThread->m_nTestFunctorRef;
+ nInsFuncCalled += pThread->m_nTestFunctorRef;
}
else {
DeleterThread * p = dynamic_cast<DeleterThread *>( *it );
CPPUNIT_CHECK_EX( nUpdateCreated == nEnsFuncCreated, "Update created=" << nUpdateCreated << " functor=" << nEnsFuncCreated );
CPPUNIT_CHECK_EX( nUpdateModified == nEnsFuncModified, "Update modified=" << nUpdateModified << " functor=" << nEnsFuncModified );
- // nTestFunctorRef is call count of insert functor
- CPPUNIT_CHECK_EX( nTestFunctorRef == nInsertSuccess, "nInsertSuccess=" << nInsertSuccess << " functor nTestFunctorRef=" << nTestFunctorRef );
+ // nInsFuncCalled is call count of insert functor
+ CPPUNIT_CHECK_EX( nInsFuncCalled == nInsertSuccess, "nInsertSuccess=" << nInsertSuccess << " functor nInsFuncCalled=" << nInsFuncCalled );
check_before_cleanup( testMap );
struct BronsonAVLTreeMap_less_pool_lazy: public BronsonAVLTreeMap_less
{
typedef cds::sync::pool_monitor<BronsonAVLTreeMap_lazy_pool> sync_monitor;
- static CDS_CONSTEXPR bool const relaxed_insert = true;
+ static CDS_CONSTEXPR bool const relaxed_insert = false; // relaxed insert can lead to test assert triggering
};
typedef BronsonAVLTreeMap< rcu_gpi, Key, Value, BronsonAVLTreeMap_less_pool_lazy > BronsonAVLTreeMap_rcu_gpi_less_pool_lazy;
typedef BronsonAVLTreeMap< rcu_gpb, Key, Value, BronsonAVLTreeMap_less_pool_lazy > BronsonAVLTreeMap_rcu_gpb_less_pool_lazy;
{
typedef cc::bronson_avltree::stat<> stat;
typedef cds::sync::pool_monitor<BronsonAVLTreeMap_lazy_pool, cds::opt::none, true > sync_monitor;
- static CDS_CONSTEXPR bool const relaxed_insert = true;
+ static CDS_CONSTEXPR bool const relaxed_insert = false; // relaxed insert can lead to test assert triggering
};
typedef BronsonAVLTreeMap< rcu_gpi, Key, Value, BronsonAVLTreeMap_less_pool_lazy_stat > BronsonAVLTreeMap_rcu_gpi_less_pool_lazy_stat;
typedef BronsonAVLTreeMap< rcu_gpb, Key, Value, BronsonAVLTreeMap_less_pool_lazy_stat > BronsonAVLTreeMap_rcu_gpb_less_pool_lazy_stat;
struct BronsonAVLTreeMap_less_pool_bounded: public BronsonAVLTreeMap_less
{
typedef cds::sync::pool_monitor<BronsonAVLTreeMap_bounded_pool> sync_monitor;
- static CDS_CONSTEXPR bool const relaxed_insert = true;
+ static CDS_CONSTEXPR bool const relaxed_insert = false; // relaxed insert can lead to test assert triggering
};
typedef BronsonAVLTreeMap< rcu_gpi, Key, Value, BronsonAVLTreeMap_less_pool_bounded > BronsonAVLTreeMap_rcu_gpi_less_pool_bounded;
typedef BronsonAVLTreeMap< rcu_gpb, Key, Value, BronsonAVLTreeMap_less_pool_bounded > BronsonAVLTreeMap_rcu_gpb_less_pool_bounded;
{
typedef cc::bronson_avltree::stat<> stat;
typedef cds::sync::pool_monitor<BronsonAVLTreeMap_bounded_pool, cds::opt::none, true > sync_monitor;
- static CDS_CONSTEXPR bool const relaxed_insert = true;
+ static CDS_CONSTEXPR bool const relaxed_insert = false; // relaxed insert can lead to test assert triggering
};
typedef BronsonAVLTreeMap< rcu_gpi, Key, Value, BronsonAVLTreeMap_less_pool_bounded_stat > BronsonAVLTreeMap_rcu_gpi_less_pool_bounded_stat;
typedef BronsonAVLTreeMap< rcu_gpb, Key, Value, BronsonAVLTreeMap_less_pool_bounded_stat > BronsonAVLTreeMap_rcu_gpb_less_pool_bounded_stat;