1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/sourcehook/test/testlist.cpp Tue Sep 18 20:03:47 2007 +0000
1.3 @@ -0,0 +1,282 @@
1.4 +#include <string>
1.5 +#include "sh_list.h"
1.6 +#include "sh_stack.h"
1.7 +#include "sh_tinyhash.h"
1.8 +#include "sh_vector.h"
1.9 +#include "testevents.h"
1.10 +
1.11 +// TEST LIST
1.12 +// Tests sh_list, sh_tinyhash, sh_vector
1.13 +
1.14 +// :TODO: vector test, list insert test
1.15 +
1.16 +namespace
1.17 +{
1.18 + struct Hmm
1.19 + {
1.20 + Hmm *m_This;
1.21 + int m_Int;
1.22 + Hmm(const Hmm &other) : m_Int(other.m_Int)
1.23 + {
1.24 + m_This = this;
1.25 + }
1.26 + Hmm(int i) : m_Int(i)
1.27 + {
1.28 + m_This = this;
1.29 + }
1.30 + Hmm() : m_Int(0)
1.31 + {
1.32 + m_This = this;
1.33 + }
1.34 + void operator = (const Hmm &other)
1.35 + {
1.36 + m_Int = other.m_Int;
1.37 + }
1.38 + operator int () const
1.39 + {
1.40 + return m_Int;
1.41 + }
1.42 + };
1.43 +
1.44 + #define LIST_THIS_CHECK(lst, err) \
1.45 + for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter) \
1.46 + CHECK_COND(&(*iter) == iter->m_This, err);
1.47 +
1.48 + bool DoTestList(std::string &error)
1.49 + {
1.50 + typedef SourceHook::List<Hmm> ListType;
1.51 + ListType lst;
1.52 +
1.53 + CHECK_COND(lst.empty(), "Part1");
1.54 +
1.55 + for (int i = 1; i <= 100; ++i)
1.56 + lst.push_back(i);
1.57 +
1.58 + LIST_THIS_CHECK(lst, "PartA1");
1.59 +
1.60 + CHECK_COND(!lst.empty(), "Part2");
1.61 +
1.62 + lst.clear();
1.63 +
1.64 + CHECK_COND(lst.empty(), "Part3");
1.65 +
1.66 + for (int i = 1; i <= 100; ++i)
1.67 + lst.push_back(i);
1.68 +
1.69 + CHECK_COND(lst.back() == 100, "Part4");
1.70 + LIST_THIS_CHECK(lst, "PartA2");
1.71 +
1.72 + int ver = 1;
1.73 + for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
1.74 + CHECK_COND(*iter == ver++, "Part5");
1.75 +
1.76 + CHECK_COND(ver == 101, "Part 6");
1.77 +
1.78 + ListType::iterator iter50 = lst.find(50);
1.79 + CHECK_COND(*iter50 == 50, "Part7");
1.80 +
1.81 + iter50 = lst.erase(iter50);
1.82 + CHECK_COND(*iter50 == 51, "Part8");
1.83 + CHECK_COND(*--iter50 == 49, "Part8.2");
1.84 +
1.85 + lst.remove(80);
1.86 +
1.87 + ver = 1;
1.88 + for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
1.89 + {
1.90 + CHECK_COND(*iter == ver++, "Part9");
1.91 + if (ver == 50 || ver == 80)
1.92 + ++ver;
1.93 + }
1.94 + CHECK_COND(ver == 101, "Part10");
1.95 + LIST_THIS_CHECK(lst, "PartA3");
1.96 +
1.97 + ListType lst2;
1.98 + lst = lst2;
1.99 + CHECK_COND(lst.empty(), "Part11");
1.100 +
1.101 + for (int i = 1; i <= 100; ++i)
1.102 + lst.push_back(i);
1.103 + lst2 = lst;
1.104 + CHECK_COND(lst2.size() == 100, "Part11.2");
1.105 +
1.106 + LIST_THIS_CHECK(lst, "PartA4");
1.107 + LIST_THIS_CHECK(lst2, "PartA5");
1.108 +
1.109 + ver = 1;
1.110 + for (ListType::iterator iter = lst2.begin(); iter != lst2.end(); ++iter)
1.111 + CHECK_COND(*iter == ver++, "Part12");
1.112 +
1.113 + lst.clear();
1.114 + for (int i = 401; i <= 500; ++i)
1.115 + lst.push_back(i);
1.116 + lst = lst2;
1.117 + CHECK_COND(lst2.size() == 100, "Part13");
1.118 +
1.119 + ver = 1;
1.120 + for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
1.121 + CHECK_COND(*iter == ver++, "Part14");
1.122 +
1.123 + LIST_THIS_CHECK(lst, "PartA6");
1.124 + LIST_THIS_CHECK(lst2, "PartA7");
1.125 +
1.126 + return true;
1.127 + }
1.128 +
1.129 + bool DoTestTinyHash(std::string &error)
1.130 + {
1.131 + const int mymax = 5000;
1.132 +
1.133 + typedef SourceHook::THash<int, int> HashType;
1.134 + HashType hash;
1.135 +
1.136 + for (int i = 1; i <= mymax; ++i)
1.137 + hash[i] = i + 5000;
1.138 +
1.139 + for (int i = 1; i <= mymax; ++i)
1.140 + CHECK_COND(hash[i] == i + 5000, "Part1");
1.141 +
1.142 + // Find
1.143 + int ver = 1;
1.144 + HashType::iterator iter;
1.145 + for (iter = hash.begin(); iter != hash.end(); ++iter)
1.146 + CHECK_COND(iter->key == ver && iter->val == (ver++) + 5000, "Part2");
1.147 +
1.148 + CHECK_COND(ver == mymax+1, "Part2.1");
1.149 +
1.150 + iter = hash.find(300);
1.151 + CHECK_COND(iter != hash.end() && iter->val == 300+5000, "Part3.1");
1.152 + iter = hash.find(mymax+200);
1.153 + CHECK_COND(iter == hash.end(), "Part3.2");
1.154 +
1.155 + HashType hash2;
1.156 + for (int i = 1; i <= mymax; ++i)
1.157 + hash2[i] = i + 5000;
1.158 +
1.159 + hash2.erase(mymax - 100);
1.160 + CHECK_COND(hash2.find(mymax - 101) != hash2.end(), "Part 4.1");
1.161 + CHECK_COND(hash2.find(mymax - 99) != hash2.end(), "Part 4.2");
1.162 + CHECK_COND(hash2.find(mymax - 100) == hash2.end(), "Part 4.3");
1.163 + hash2.erase(mymax - 99);
1.164 + CHECK_COND(hash2.find(mymax - 101) != hash2.end(), "Part 4.4");
1.165 + CHECK_COND(hash2.find(mymax - 99) == hash2.end(), "Part 4.5");
1.166 + CHECK_COND(hash2.find(mymax - 100) == hash2.end(), "Part 4.6");
1.167 +
1.168 + return true;
1.169 + }
1.170 +
1.171 + bool DoTestStack(std::string &error)
1.172 + {
1.173 + typedef SourceHook::CStack<int> IntStack;
1.174 + IntStack stk;
1.175 + int i;
1.176 +
1.177 + CHECK_COND(stk.size() == 0 && stk.empty(), "A0");
1.178 +
1.179 + for (i = 0; i < 5000; ++i)
1.180 + stk.push(i);
1.181 +
1.182 + CHECK_COND(stk.front() == 4999, "1");
1.183 + CHECK_COND(stk.size() == 5000 && !stk.empty(), "A1");
1.184 +
1.185 + IntStack::iterator iter;
1.186 + i = 0;
1.187 + for (iter = stk.begin(); iter != stk.end(); ++iter, ++i)
1.188 + CHECK_COND(*iter == i, "2");
1.189 +
1.190 + i = 0;
1.191 + for (iter = stk.begin(); iter != stk.end(); iter++, ++i)
1.192 + CHECK_COND(*iter == i, "3");
1.193 +
1.194 + --iter;
1.195 + iter--;
1.196 + *iter = 'g'+'a'+'b'+'e'+'n';
1.197 + stk.pop();
1.198 +
1.199 + CHECK_COND(stk.size() == 4999 && !stk.empty(), "A2");
1.200 + CHECK_COND(stk.front() == 'g'+'a'+'b'+'e'+'n', "4");
1.201 +
1.202 + IntStack stk2(stk);
1.203 + CHECK_COND(stk2.size() == 4999 && !stk2.empty(), "A3");
1.204 +
1.205 + IntStack::iterator iter2 = stk2.begin();
1.206 + for (iter = stk.begin(); iter != stk.end(); ++iter, iter2++)
1.207 + CHECK_COND(*iter == *iter2, "5");
1.208 +
1.209 + while (!stk2.empty())
1.210 + stk2.pop();
1.211 + CHECK_COND(stk2.size() == 0 && stk2.empty(), "A4");
1.212 + stk = stk2;
1.213 + CHECK_COND(stk.size() == 0 && stk.empty(), "A5");
1.214 +
1.215 + return true;
1.216 + }
1.217 +
1.218 + bool DoTestVec(std::string &error)
1.219 + {
1.220 + typedef SourceHook::CVector<int> IntVector;
1.221 + IntVector vec1;
1.222 + IntVector::iterator iter;
1.223 + int i;
1.224 +
1.225 + CHECK_COND(vec1.size() == 0 && vec1.empty(), "V1");
1.226 + for (i = 0; i < 500; ++i)
1.227 + vec1.push_back(i);
1.228 +
1.229 + CHECK_COND(vec1.size() == 500 && !vec1.empty(), "V2");
1.230 +
1.231 + for (i = 0; i < 500; ++i)
1.232 + CHECK_COND(vec1[i] == i, "V3");
1.233 +
1.234 + for (i = 0, iter = vec1.begin(); iter != vec1.end(); ++iter, ++i)
1.235 + CHECK_COND(*iter == i, "V4");
1.236 +
1.237 + vec1.resize(1000);
1.238 + for (i = 0; i < 500; ++i)
1.239 + CHECK_COND(vec1[i] == i, "V5.1");
1.240 + for (i = 500; i < 1000; ++i)
1.241 + CHECK_COND(vec1[i] == 0, "V5.2");
1.242 +
1.243 + vec1.resize(200);
1.244 + for (i = 0; i < 200; ++i)
1.245 + CHECK_COND(vec1[i] == i, "V6");
1.246 +
1.247 + vec1.resize(500, 0x12345678);
1.248 + for (i = 0; i < 200; ++i)
1.249 + CHECK_COND(vec1[i] == i, "V7.1");
1.250 + for (i = 200; i < 500; ++i)
1.251 + CHECK_COND(vec1[i] == 0x12345678, "V7.2");
1.252 +
1.253 + IntVector vec2(vec1);
1.254 + CHECK_COND(vec2.size() == vec1.size() && vec2.empty() == vec1.empty(), "V8.0");
1.255 + for (i = 0; i < 200; ++i)
1.256 + CHECK_COND(vec2[i] == i, "V8.1");
1.257 + for (i = 200; i < 500; ++i)
1.258 + CHECK_COND(vec2[i] == 0x12345678, "V8.2");
1.259 +
1.260 +
1.261 + vec1.clear();
1.262 + CHECK_COND(vec1.size() == 0 && vec1.empty() && vec1.begin() == vec1.end(), "V9");
1.263 + vec2 = vec1;
1.264 + CHECK_COND(vec2.size() == 0 && vec2.empty() && vec2.begin() == vec2.end(), "V9");
1.265 +
1.266 + return true;
1.267 + }
1.268 +}
1.269 +
1.270 +bool TestList(std::string &error)
1.271 +{
1.272 + if (!DoTestList(error))
1.273 + return false;
1.274 +
1.275 + if (!DoTestTinyHash(error))
1.276 + return false;
1.277 +
1.278 + if (!DoTestStack(error))
1.279 + return false;
1.280 +
1.281 + if (!DoTestVec(error))
1.282 + return false;
1.283 +
1.284 + return true;
1.285 +}