Map& rMap = m_Map;
size_t pass_count = Map_InsDelFind::s_nPassCount;
+ size_t nInsertedNum = 0;
+ size_t nUninsertedNum = 0;
for (size_t count = 0; count < pass_count; count++) {
bool shouldUpdate = true;
for (size_t i = 0; i < s_nMapSize; ++i) {
size_t n = i;
// Insert
if (i % s_nInsertPercentage == 1) {
+ nInsertedNum++;
if (!shouldUpdate) {
if (rMap.insert(n, n))
++m_nInsertSuccess;
++m_nInsertFailed;
shouldUpdate = false;
}
+ } else {
+ nUninsertedNum++;
}
// Find
if (rMap.contains(n))
}
}
}
+ EXPECT_EQ(nInsertedNum, m_nFindSuccess);
+ EXPECT_EQ(nUninsertedNum, m_nFindFailed);
+ EXPECT_EQ(m_nDeleteSuccess, nInsertedNum);
+ EXPECT_EQ(m_nDeleteFailed, 0);
}
};