libretro/scummvm
1
0
Fork 0
mirror of https://github.com/libretro/scummvm.git synced 2025-01-18 07:53:12 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Add (failing) hashmap test case for collision handling

Browse Source 
svn-id: r41400
This commit is contained in:
Willem Jan Palenstijn 2009-06-09 15:26:09 +00:00
parent ac46c98fb8
commit fcc0b69c07
1 changed files with 43 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

43
test/common/hashmap.h
View File

@ -108,5 +108,48 @@ class HashMapTestSuite : public CxxTest::TestSuite
TS_ASSERT_EQUALS(container2[323], 32);
}
void test_collision() {
// NB: The usefulness of this example depends strongly on the
// specific hashmap implementation.
// It is constructed to insert multiple colliding elements.
Common::HashMap<int, int> h;
h[5] = 1;
h[32+5] = 1;
h[64+5] = 1;
h[128+5] = 1;
TS_ASSERT(h.contains(5));
TS_ASSERT(h.contains(32+5));
TS_ASSERT(h.contains(64+5));
TS_ASSERT(h.contains(128+5));
h.erase(32+5);
TS_ASSERT(h.contains(5));
TS_ASSERT(h.contains(64+5));
TS_ASSERT(h.contains(128+5));
h.erase(5);
TS_ASSERT(h.contains(64+5));
TS_ASSERT(h.contains(128+5));
h[32+5] = 1;
TS_ASSERT(h.contains(32+5));
TS_ASSERT(h.contains(64+5));
TS_ASSERT(h.contains(128+5));
h[5] = 1;
TS_ASSERT(h.contains(5));
TS_ASSERT(h.contains(32+5));
TS_ASSERT(h.contains(64+5));
TS_ASSERT(h.contains(128+5));
h.erase(5);
TS_ASSERT(h.contains(32+5));
TS_ASSERT(h.contains(64+5));
TS_ASSERT(h.contains(128+5));
h.erase(64+5);
TS_ASSERT(h.contains(32+5));
TS_ASSERT(h.contains(128+5));
h.erase(128+5);
TS_ASSERT(h.contains(32+5));
h.erase(32+5);
TS_ASSERT(h.empty());
}
// TODO: Add test cases for iterators, find, ...
};