CppUnitMini::ThreadPool pool( *this );
pool.add( new work_thread( pool, testMap ), c_nThreadCount );
pool.run( c_nDuration );
- CPPUNIT_MSG( " Duration=" << pool.avgDuration() );
+ //CPPUNIT_MSG( " Duration=" << pool.avgDuration() );
size_t nInsertSuccess = 0;
size_t nInsertFailed = 0;
size_t nFindFailed = 0;
for ( CppUnitMini::ThreadPool::iterator it = pool.begin(); it != pool.end(); ++it ) {
work_thread * pThread = static_cast<work_thread *>( *it );
- assert( pThread != NULL );
+ assert( pThread != nullptr );
nInsertSuccess += pThread->m_nInsertSuccess;
nInsertFailed += pThread->m_nInsertFailed;
nDeleteSuccess += pThread->m_nDeleteSuccess;
nFindFailed += pThread->m_nFindFailed;
}
+ size_t nTotalOps = nInsertSuccess + nInsertFailed + nDeleteSuccess + nDeleteFailed + nFindSuccess + nFindFailed;
+
CPPUNIT_MSG( " Totals (success/failed): \n\t"
<< " Insert=" << nInsertSuccess << '/' << nInsertFailed << "\n\t"
<< " Delete=" << nDeleteSuccess << '/' << nDeleteFailed << "\n\t"
<< " Find=" << nFindSuccess << '/' << nFindFailed << "\n\t"
<< " Speed=" << (nFindSuccess + nFindFailed) / c_nDuration << " find/sec\n\t"
<< " " << (nInsertSuccess + nDeleteSuccess) / c_nDuration << " modify/sec\n\t"
+ << " Total ops=" << nTotalOps << "\n\t"
+ << " speed=" << nTotalOps / c_nDuration << " ops/sec\n\t"
<< " Map size=" << testMap.size()
);
nFindFailed += pThread->m_nFindFailed;
}
+ size_t nTotalOps = nInsertSuccess + nInsertFailed + nDeleteSuccess + nDeleteFailed + nFindSuccess + nFindFailed;
+
CPPUNIT_MSG( " Totals (success/failed): \n\t"
<< " Insert=" << nInsertSuccess << '/' << nInsertFailed << "\n\t"
<< " Delete=" << nDeleteSuccess << '/' << nDeleteFailed << "\n\t"
<< " Find=" << nFindSuccess << '/' << nFindFailed << "\n\t"
<< " Speed=" << (nFindSuccess + nFindFailed) / c_nDuration << " find/sec\n\t"
<< " " << (nInsertSuccess + nDeleteSuccess) / c_nDuration << " modify/sec\n\t"
+ << " Total ops=" << nTotalOps << "\n\t"
+ << " speed=" << nTotalOps / c_nDuration << " ops/sec\n\t"
<< " Set size=" << testSet.size()
);