4 #include "sh_tinyhash.h"
5 #include "testevents.h"
8 // Tests sh_list, sh_tinyhash, sh_vector
19 Hmm(const Hmm &other) : m_Int(other.m_Int)
31 void operator = (const Hmm &other)
41 #define LIST_THIS_CHECK(lst, err) \
42 for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter) \
43 CHECK_COND(&(*iter) == iter->m_This, err);
45 bool DoTestList(std::string &error)
47 typedef SourceHook::List<Hmm> ListType;
50 CHECK_COND(lst.empty(), "Part1");
52 for (int i = 1; i <= 100; ++i)
55 LIST_THIS_CHECK(lst, "PartA1");
57 CHECK_COND(!lst.empty(), "Part2");
61 CHECK_COND(lst.empty(), "Part3");
63 for (int i = 1; i <= 100; ++i)
66 CHECK_COND(lst.back() == 100, "Part4");
67 LIST_THIS_CHECK(lst, "PartA2");
70 for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
71 CHECK_COND(*iter == ver++, "Part5");
73 CHECK_COND(ver == 101, "Part 6");
75 ListType::iterator iter50 = lst.find(50);
76 CHECK_COND(*iter50 == 50, "Part7");
78 iter50 = lst.erase(iter50);
79 CHECK_COND(*iter50 == 51, "Part8");
80 CHECK_COND(*--iter50 == 49, "Part8.2");
85 for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
87 CHECK_COND(*iter == ver++, "Part9");
88 if (ver == 50 || ver == 80)
91 CHECK_COND(ver == 101, "Part10");
92 LIST_THIS_CHECK(lst, "PartA3");
96 CHECK_COND(lst.empty(), "Part11");
98 for (int i = 1; i <= 100; ++i)
101 CHECK_COND(lst2.size() == 100, "Part11.2");
103 LIST_THIS_CHECK(lst, "PartA4");
104 LIST_THIS_CHECK(lst2, "PartA5");
107 for (ListType::iterator iter = lst2.begin(); iter != lst2.end(); ++iter)
108 CHECK_COND(*iter == ver++, "Part12");
111 for (int i = 401; i <= 500; ++i)
114 CHECK_COND(lst2.size() == 100, "Part13");
117 for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
118 CHECK_COND(*iter == ver++, "Part14");
120 LIST_THIS_CHECK(lst, "PartA6");
121 LIST_THIS_CHECK(lst2, "PartA7");
126 bool DoTestTinyHash(std::string &error)
128 const int mymax = 5000;
130 typedef SourceHook::THash<int, int> HashType;
133 for (int i = 1; i <= mymax; ++i)
136 for (int i = 1; i <= mymax; ++i)
137 CHECK_COND(hash[i] == i + 5000, "Part1");
141 HashType::iterator iter;
142 for (iter = hash.begin(); iter != hash.end(); ++iter)
143 CHECK_COND(iter->key == ver && iter->val == (ver++) + 5000, "Part2");
145 CHECK_COND(ver == mymax+1, "Part2.1");
147 iter = hash.find(300);
148 CHECK_COND(iter != hash.end() && iter->val == 300+5000, "Part3.1");
149 iter = hash.find(mymax+200);
150 CHECK_COND(iter == hash.end(), "Part3.2");
153 for (int i = 1; i <= mymax; ++i)
156 hash2.erase(mymax - 100);
157 CHECK_COND(hash2.find(mymax - 101) != hash2.end(), "Part 4.1");
158 CHECK_COND(hash2.find(mymax - 99) != hash2.end(), "Part 4.2");
159 CHECK_COND(hash2.find(mymax - 100) == hash2.end(), "Part 4.3");
160 hash2.erase(mymax - 99);
161 CHECK_COND(hash2.find(mymax - 101) != hash2.end(), "Part 4.4");
162 CHECK_COND(hash2.find(mymax - 99) == hash2.end(), "Part 4.5");
163 CHECK_COND(hash2.find(mymax - 100) == hash2.end(), "Part 4.6");
168 bool DoTestStack(std::string &error)
170 typedef SourceHook::CStack<int> IntStack;
174 CHECK_COND(stk.size() == 0 && stk.empty(), "A0");
176 for (i = 0; i < 5000; ++i)
179 CHECK_COND(stk.front() == 4999, "1");
180 CHECK_COND(stk.size() == 5000 && !stk.empty(), "A1");
182 IntStack::iterator iter;
184 for (iter = stk.begin(); iter != stk.end(); ++iter, ++i)
185 CHECK_COND(*iter == i, "2");
188 for (iter = stk.begin(); iter != stk.end(); iter++, ++i)
189 CHECK_COND(*iter == i, "3");
193 *iter = 'g'+'a'+'b'+'e'+'n';
196 CHECK_COND(stk.size() == 4999 && !stk.empty(), "A2");
197 CHECK_COND(stk.front() == 'g'+'a'+'b'+'e'+'n', "4");
200 CHECK_COND(stk2.size() == 4999 && !stk2.empty(), "A3");
202 IntStack::iterator iter2 = stk2.begin();
203 for (iter = stk.begin(); iter != stk.end(); ++iter, iter2++)
204 CHECK_COND(*iter == *iter2, "5");
206 while (!stk2.empty())
208 CHECK_COND(stk2.size() == 0 && stk2.empty(), "A4");
210 CHECK_COND(stk.size() == 0 && stk.empty(), "A5");
216 bool TestList(std::string &error)
218 if (!DoTestList(error))
221 if (!DoTestTinyHash(error))
224 if (!DoTestStack(error))