| author | Scott Ehlert <ds@alliedmods.net> |
| Tue Sep 16 04:41:32 2008 -0500 (2008-09-16) | |
| changeset 533 | 591b88a78e35 |
| parent 204 | e6cfa97ef258 |
| permissions | -rw-r--r-- |
| pavolmarko@111 | 1 |
#include <string> |
| pavolmarko@111 | 2 |
#include "sh_list.h" |
| pavolmarko@129 | 3 |
#include "sh_stack.h" |
| pavolmarko@111 | 4 |
#include "sh_tinyhash.h" |
| pavolmarko@204 | 5 |
#include "sh_vector.h" |
| pavolmarko@128 | 6 |
#include "testevents.h" |
| pavolmarko@111 | 7 |
|
| pavolmarko@111 | 8 |
// TEST LIST |
| pavolmarko@111 | 9 |
// Tests sh_list, sh_tinyhash, sh_vector |
| pavolmarko@111 | 10 |
|
| pavolmarko@163 | 11 |
// :TODO: vector test, list insert test |
| pavolmarko@111 | 12 |
|
| pavolmarko@111 | 13 |
namespace |
| pavolmarko@111 | 14 |
{ |
| pavolmarko@111 | 15 |
struct Hmm |
| pavolmarko@111 | 16 |
{ |
| pavolmarko@111 | 17 |
Hmm *m_This; |
| pavolmarko@111 | 18 |
int m_Int; |
| pavolmarko@119 | 19 |
Hmm(const Hmm &other) : m_Int(other.m_Int) |
| pavolmarko@111 | 20 |
{ |
| pavolmarko@119 | 21 |
m_This = this; |
| pavolmarko@111 | 22 |
} |
| pavolmarko@119 | 23 |
Hmm(int i) : m_Int(i) |
| pavolmarko@111 | 24 |
{ |
| pavolmarko@119 | 25 |
m_This = this; |
| pavolmarko@111 | 26 |
} |
| pavolmarko@119 | 27 |
Hmm() : m_Int(0) |
| pavolmarko@111 | 28 |
{ |
| pavolmarko@119 | 29 |
m_This = this; |
| pavolmarko@111 | 30 |
} |
| pavolmarko@111 | 31 |
void operator = (const Hmm &other) |
| pavolmarko@111 | 32 |
{ |
| pavolmarko@111 | 33 |
m_Int = other.m_Int; |
| pavolmarko@111 | 34 |
} |
| pavolmarko@111 | 35 |
operator int () const |
| pavolmarko@111 | 36 |
{ |
| pavolmarko@111 | 37 |
return m_Int; |
| pavolmarko@111 | 38 |
} |
| pavolmarko@111 | 39 |
}; |
| pavolmarko@117 | 40 |
|
| pavolmarko@111 | 41 |
#define LIST_THIS_CHECK(lst, err) \ |
| pavolmarko@111 | 42 |
for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter) \ |
| pavolmarko@111 | 43 |
CHECK_COND(&(*iter) == iter->m_This, err); |
| pavolmarko@117 | 44 |
|
| pavolmarko@111 | 45 |
bool DoTestList(std::string &error) |
| pavolmarko@111 | 46 |
{ |
| pavolmarko@111 | 47 |
typedef SourceHook::List<Hmm> ListType; |
| pavolmarko@111 | 48 |
ListType lst; |
| pavolmarko@117 | 49 |
|
| pavolmarko@111 | 50 |
CHECK_COND(lst.empty(), "Part1"); |
| pavolmarko@117 | 51 |
|
| pavolmarko@111 | 52 |
for (int i = 1; i <= 100; ++i) |
| pavolmarko@111 | 53 |
lst.push_back(i); |
| pavolmarko@117 | 54 |
|
| pavolmarko@111 | 55 |
LIST_THIS_CHECK(lst, "PartA1"); |
| pavolmarko@117 | 56 |
|
| pavolmarko@111 | 57 |
CHECK_COND(!lst.empty(), "Part2"); |
| pavolmarko@117 | 58 |
|
| pavolmarko@111 | 59 |
lst.clear(); |
| pavolmarko@117 | 60 |
|
| pavolmarko@111 | 61 |
CHECK_COND(lst.empty(), "Part3"); |
| pavolmarko@117 | 62 |
|
| pavolmarko@111 | 63 |
for (int i = 1; i <= 100; ++i) |
| pavolmarko@111 | 64 |
lst.push_back(i); |
| pavolmarko@117 | 65 |
|
| pavolmarko@111 | 66 |
CHECK_COND(lst.back() == 100, "Part4"); |
| pavolmarko@111 | 67 |
LIST_THIS_CHECK(lst, "PartA2"); |
| pavolmarko@117 | 68 |
|
| pavolmarko@111 | 69 |
int ver = 1; |
| pavolmarko@111 | 70 |
for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter) |
| pavolmarko@111 | 71 |
CHECK_COND(*iter == ver++, "Part5"); |
| pavolmarko@117 | 72 |
|
| pavolmarko@111 | 73 |
CHECK_COND(ver == 101, "Part 6"); |
| pavolmarko@117 | 74 |
|
| pavolmarko@111 | 75 |
ListType::iterator iter50 = lst.find(50); |
| pavolmarko@111 | 76 |
CHECK_COND(*iter50 == 50, "Part7"); |
| pavolmarko@117 | 77 |
|
| pavolmarko@111 | 78 |
iter50 = lst.erase(iter50); |
| pavolmarko@111 | 79 |
CHECK_COND(*iter50 == 51, "Part8"); |
| pavolmarko@111 | 80 |
CHECK_COND(*--iter50 == 49, "Part8.2"); |
| pavolmarko@117 | 81 |
|
| pavolmarko@111 | 82 |
lst.remove(80); |
| pavolmarko@117 | 83 |
|
| pavolmarko@111 | 84 |
ver = 1; |
| pavolmarko@111 | 85 |
for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter) |
| pavolmarko@111 | 86 |
{ |
| pavolmarko@111 | 87 |
CHECK_COND(*iter == ver++, "Part9"); |
| pavolmarko@111 | 88 |
if (ver == 50 || ver == 80) |
| pavolmarko@111 | 89 |
++ver; |
| pavolmarko@111 | 90 |
} |
| pavolmarko@111 | 91 |
CHECK_COND(ver == 101, "Part10"); |
| pavolmarko@111 | 92 |
LIST_THIS_CHECK(lst, "PartA3"); |
| pavolmarko@117 | 93 |
|
| pavolmarko@111 | 94 |
ListType lst2; |
| pavolmarko@111 | 95 |
lst = lst2; |
| pavolmarko@111 | 96 |
CHECK_COND(lst.empty(), "Part11"); |
| pavolmarko@117 | 97 |
|
| pavolmarko@111 | 98 |
for (int i = 1; i <= 100; ++i) |
| pavolmarko@111 | 99 |
lst.push_back(i); |
| pavolmarko@111 | 100 |
lst2 = lst; |
| pavolmarko@111 | 101 |
CHECK_COND(lst2.size() == 100, "Part11.2"); |
| pavolmarko@117 | 102 |
|
| pavolmarko@111 | 103 |
LIST_THIS_CHECK(lst, "PartA4"); |
| pavolmarko@111 | 104 |
LIST_THIS_CHECK(lst2, "PartA5"); |
| pavolmarko@117 | 105 |
|
| pavolmarko@111 | 106 |
ver = 1; |
| pavolmarko@111 | 107 |
for (ListType::iterator iter = lst2.begin(); iter != lst2.end(); ++iter) |
| pavolmarko@111 | 108 |
CHECK_COND(*iter == ver++, "Part12"); |
| pavolmarko@117 | 109 |
|
| pavolmarko@111 | 110 |
lst.clear(); |
| pavolmarko@111 | 111 |
for (int i = 401; i <= 500; ++i) |
| pavolmarko@111 | 112 |
lst.push_back(i); |
| pavolmarko@111 | 113 |
lst = lst2; |
| pavolmarko@111 | 114 |
CHECK_COND(lst2.size() == 100, "Part13"); |
| pavolmarko@117 | 115 |
|
| pavolmarko@111 | 116 |
ver = 1; |
| pavolmarko@111 | 117 |
for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter) |
| pavolmarko@111 | 118 |
CHECK_COND(*iter == ver++, "Part14"); |
| pavolmarko@111 | 119 |
|
| pavolmarko@111 | 120 |
LIST_THIS_CHECK(lst, "PartA6"); |
| pavolmarko@111 | 121 |
LIST_THIS_CHECK(lst2, "PartA7"); |
| pavolmarko@117 | 122 |
|
| pavolmarko@111 | 123 |
return true; |
| pavolmarko@111 | 124 |
} |
| pavolmarko@117 | 125 |
|
| pavolmarko@111 | 126 |
bool DoTestTinyHash(std::string &error) |
| pavolmarko@111 | 127 |
{ |
| pavolmarko@111 | 128 |
const int mymax = 5000; |
| pavolmarko@117 | 129 |
|
| pavolmarko@111 | 130 |
typedef SourceHook::THash<int, int> HashType; |
| pavolmarko@111 | 131 |
HashType hash; |
| pavolmarko@117 | 132 |
|
| pavolmarko@111 | 133 |
for (int i = 1; i <= mymax; ++i) |
| pavolmarko@111 | 134 |
hash[i] = i + 5000; |
| pavolmarko@117 | 135 |
|
| pavolmarko@111 | 136 |
for (int i = 1; i <= mymax; ++i) |
| pavolmarko@111 | 137 |
CHECK_COND(hash[i] == i + 5000, "Part1"); |
| pavolmarko@117 | 138 |
|
| pavolmarko@111 | 139 |
// Find |
| pavolmarko@111 | 140 |
int ver = 1; |
| pavolmarko@119 | 141 |
HashType::iterator iter; |
| pavolmarko@119 | 142 |
for (iter = hash.begin(); iter != hash.end(); ++iter) |
| pavolmarko@111 | 143 |
CHECK_COND(iter->key == ver && iter->val == (ver++) + 5000, "Part2"); |
| pavolmarko@117 | 144 |
|
| pavolmarko@111 | 145 |
CHECK_COND(ver == mymax+1, "Part2.1"); |
| pavolmarko@117 | 146 |
|
| pavolmarko@119 | 147 |
iter = hash.find(300); |
| pavolmarko@111 | 148 |
CHECK_COND(iter != hash.end() && iter->val == 300+5000, "Part3.1"); |
| pavolmarko@111 | 149 |
iter = hash.find(mymax+200); |
| pavolmarko@111 | 150 |
CHECK_COND(iter == hash.end(), "Part3.2"); |
| pavolmarko@117 | 151 |
|
| pavolmarko@111 | 152 |
HashType hash2; |
| pavolmarko@111 | 153 |
for (int i = 1; i <= mymax; ++i) |
| pavolmarko@111 | 154 |
hash2[i] = i + 5000; |
| pavolmarko@117 | 155 |
|
| pavolmarko@117 | 156 |
hash2.erase(mymax - 100); |
| pavolmarko@117 | 157 |
CHECK_COND(hash2.find(mymax - 101) != hash2.end(), "Part 4.1"); |
| pavolmarko@117 | 158 |
CHECK_COND(hash2.find(mymax - 99) != hash2.end(), "Part 4.2"); |
| pavolmarko@117 | 159 |
CHECK_COND(hash2.find(mymax - 100) == hash2.end(), "Part 4.3"); |
| pavolmarko@117 | 160 |
hash2.erase(mymax - 99); |
| pavolmarko@117 | 161 |
CHECK_COND(hash2.find(mymax - 101) != hash2.end(), "Part 4.4"); |
| pavolmarko@117 | 162 |
CHECK_COND(hash2.find(mymax - 99) == hash2.end(), "Part 4.5"); |
| pavolmarko@117 | 163 |
CHECK_COND(hash2.find(mymax - 100) == hash2.end(), "Part 4.6"); |
| pavolmarko@117 | 164 |
|
| pavolmarko@111 | 165 |
return true; |
| pavolmarko@111 | 166 |
} |
| pavolmarko@129 | 167 |
|
| pavolmarko@129 | 168 |
bool DoTestStack(std::string &error) |
| pavolmarko@129 | 169 |
{ |
| pavolmarko@129 | 170 |
typedef SourceHook::CStack<int> IntStack; |
| pavolmarko@129 | 171 |
IntStack stk; |
| pavolmarko@129 | 172 |
int i; |
| pavolmarko@129 | 173 |
|
| pavolmarko@129 | 174 |
CHECK_COND(stk.size() == 0 && stk.empty(), "A0"); |
| pavolmarko@129 | 175 |
|
| pavolmarko@129 | 176 |
for (i = 0; i < 5000; ++i) |
| pavolmarko@129 | 177 |
stk.push(i); |
| pavolmarko@129 | 178 |
|
| pavolmarko@129 | 179 |
CHECK_COND(stk.front() == 4999, "1"); |
| pavolmarko@129 | 180 |
CHECK_COND(stk.size() == 5000 && !stk.empty(), "A1"); |
| pavolmarko@129 | 181 |
|
| pavolmarko@129 | 182 |
IntStack::iterator iter; |
| pavolmarko@129 | 183 |
i = 0; |
| pavolmarko@129 | 184 |
for (iter = stk.begin(); iter != stk.end(); ++iter, ++i) |
| pavolmarko@129 | 185 |
CHECK_COND(*iter == i, "2"); |
| pavolmarko@129 | 186 |
|
| pavolmarko@129 | 187 |
i = 0; |
| pavolmarko@129 | 188 |
for (iter = stk.begin(); iter != stk.end(); iter++, ++i) |
| pavolmarko@129 | 189 |
CHECK_COND(*iter == i, "3"); |
| pavolmarko@129 | 190 |
|
| pavolmarko@129 | 191 |
--iter; |
| pavolmarko@129 | 192 |
iter--; |
| pavolmarko@129 | 193 |
*iter = 'g'+'a'+'b'+'e'+'n'; |
| pavolmarko@129 | 194 |
stk.pop(); |
| pavolmarko@129 | 195 |
|
| pavolmarko@129 | 196 |
CHECK_COND(stk.size() == 4999 && !stk.empty(), "A2"); |
| pavolmarko@129 | 197 |
CHECK_COND(stk.front() == 'g'+'a'+'b'+'e'+'n', "4"); |
| pavolmarko@129 | 198 |
|
| pavolmarko@129 | 199 |
IntStack stk2(stk); |
| pavolmarko@129 | 200 |
CHECK_COND(stk2.size() == 4999 && !stk2.empty(), "A3"); |
| pavolmarko@129 | 201 |
|
| pavolmarko@129 | 202 |
IntStack::iterator iter2 = stk2.begin(); |
| pavolmarko@129 | 203 |
for (iter = stk.begin(); iter != stk.end(); ++iter, iter2++) |
| pavolmarko@129 | 204 |
CHECK_COND(*iter == *iter2, "5"); |
| pavolmarko@129 | 205 |
|
| pavolmarko@129 | 206 |
while (!stk2.empty()) |
| pavolmarko@129 | 207 |
stk2.pop(); |
| pavolmarko@129 | 208 |
CHECK_COND(stk2.size() == 0 && stk2.empty(), "A4"); |
| pavolmarko@129 | 209 |
stk = stk2; |
| pavolmarko@129 | 210 |
CHECK_COND(stk.size() == 0 && stk.empty(), "A5"); |
| pavolmarko@129 | 211 |
|
| pavolmarko@129 | 212 |
return true; |
| pavolmarko@129 | 213 |
} |
| pavolmarko@204 | 214 |
|
| pavolmarko@204 | 215 |
bool DoTestVec(std::string &error) |
| pavolmarko@204 | 216 |
{ |
| pavolmarko@204 | 217 |
typedef SourceHook::CVector<int> IntVector; |
| pavolmarko@204 | 218 |
IntVector vec1; |
| pavolmarko@204 | 219 |
IntVector::iterator iter; |
| pavolmarko@204 | 220 |
int i; |
| pavolmarko@204 | 221 |
|
| pavolmarko@204 | 222 |
CHECK_COND(vec1.size() == 0 && vec1.empty(), "V1"); |
| pavolmarko@204 | 223 |
for (i = 0; i < 500; ++i) |
| pavolmarko@204 | 224 |
vec1.push_back(i); |
| pavolmarko@204 | 225 |
|
| pavolmarko@204 | 226 |
CHECK_COND(vec1.size() == 500 && !vec1.empty(), "V2"); |
| pavolmarko@204 | 227 |
|
| pavolmarko@204 | 228 |
for (i = 0; i < 500; ++i) |
| pavolmarko@204 | 229 |
CHECK_COND(vec1[i] == i, "V3"); |
| pavolmarko@204 | 230 |
|
| pavolmarko@204 | 231 |
for (i = 0, iter = vec1.begin(); iter != vec1.end(); ++iter, ++i) |
| pavolmarko@204 | 232 |
CHECK_COND(*iter == i, "V4"); |
| pavolmarko@204 | 233 |
|
| pavolmarko@204 | 234 |
vec1.resize(1000); |
| pavolmarko@204 | 235 |
for (i = 0; i < 500; ++i) |
| pavolmarko@204 | 236 |
CHECK_COND(vec1[i] == i, "V5.1"); |
| pavolmarko@204 | 237 |
for (i = 500; i < 1000; ++i) |
| pavolmarko@204 | 238 |
CHECK_COND(vec1[i] == 0, "V5.2"); |
| pavolmarko@204 | 239 |
|
| pavolmarko@204 | 240 |
vec1.resize(200); |
| pavolmarko@204 | 241 |
for (i = 0; i < 200; ++i) |
| pavolmarko@204 | 242 |
CHECK_COND(vec1[i] == i, "V6"); |
| pavolmarko@204 | 243 |
|
| pavolmarko@204 | 244 |
vec1.resize(500, 0x12345678); |
| pavolmarko@204 | 245 |
for (i = 0; i < 200; ++i) |
| pavolmarko@204 | 246 |
CHECK_COND(vec1[i] == i, "V7.1"); |
| pavolmarko@204 | 247 |
for (i = 200; i < 500; ++i) |
| pavolmarko@204 | 248 |
CHECK_COND(vec1[i] == 0x12345678, "V7.2"); |
| pavolmarko@204 | 249 |
|
| pavolmarko@204 | 250 |
IntVector vec2(vec1); |
| pavolmarko@204 | 251 |
CHECK_COND(vec2.size() == vec1.size() && vec2.empty() == vec1.empty(), "V8.0"); |
| pavolmarko@204 | 252 |
for (i = 0; i < 200; ++i) |
| pavolmarko@204 | 253 |
CHECK_COND(vec2[i] == i, "V8.1"); |
| pavolmarko@204 | 254 |
for (i = 200; i < 500; ++i) |
| pavolmarko@204 | 255 |
CHECK_COND(vec2[i] == 0x12345678, "V8.2"); |
| pavolmarko@204 | 256 |
|
| pavolmarko@204 | 257 |
|
| pavolmarko@204 | 258 |
vec1.clear(); |
| pavolmarko@204 | 259 |
CHECK_COND(vec1.size() == 0 && vec1.empty() && vec1.begin() == vec1.end(), "V9"); |
| pavolmarko@204 | 260 |
vec2 = vec1; |
| pavolmarko@204 | 261 |
CHECK_COND(vec2.size() == 0 && vec2.empty() && vec2.begin() == vec2.end(), "V9"); |
| pavolmarko@204 | 262 |
|
| pavolmarko@204 | 263 |
return true; |
| pavolmarko@204 | 264 |
} |
| pavolmarko@111 | 265 |
} |
| pavolmarko@111 | 266 |
|
| pavolmarko@111 | 267 |
bool TestList(std::string &error) |
| pavolmarko@111 | 268 |
{ |
| pavolmarko@111 | 269 |
if (!DoTestList(error)) |
| pavolmarko@111 | 270 |
return false; |
| pavolmarko@117 | 271 |
|
| pavolmarko@111 | 272 |
if (!DoTestTinyHash(error)) |
| pavolmarko@111 | 273 |
return false; |
| pavolmarko@117 | 274 |
|
| pavolmarko@129 | 275 |
if (!DoTestStack(error)) |
| pavolmarko@129 | 276 |
return false; |
| pavolmarko@117 | 277 |
|
| pavolmarko@204 | 278 |
if (!DoTestVec(error)) |
| pavolmarko@204 | 279 |
return false; |
| pavolmarko@204 | 280 |
|
| pavolmarko@111 | 281 |
return true; |
| pavolmarko@111 | 282 |
} |