sourcehook/test/testlist.cpp
changeset 111 aec58c99dafc
child 117 e322da4af2d2
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/sourcehook/test/testlist.cpp	Fri Sep 23 20:14:10 2005 +0000
     1.3 @@ -0,0 +1,165 @@
     1.4 +#include <string>
     1.5 +#include "sh_list.h"
     1.6 +#include "sh_tinyhash.h"
     1.7 +
     1.8 +// TEST LIST
     1.9 +// Tests sh_list, sh_tinyhash, sh_vector
    1.10 +
    1.11 +// :TODO: vector test
    1.12 +
    1.13 +#define CHECK_COND(c, err) if (!(c)) { error = err; return false; }
    1.14 +
    1.15 +namespace
    1.16 +{
    1.17 +	struct Hmm
    1.18 +	{
    1.19 +		Hmm *m_This;
    1.20 +		int m_Int;
    1.21 +		Hmm(const Hmm &other) : m_This(this), m_Int(other.m_Int)
    1.22 +		{
    1.23 +		}
    1.24 +		Hmm(int i) : m_This(this), m_Int(i)
    1.25 +		{
    1.26 +		}
    1.27 +		Hmm() : m_This(this), m_Int(0)
    1.28 +		{
    1.29 +		}
    1.30 +		void operator = (const Hmm &other)
    1.31 +		{
    1.32 +			m_Int = other.m_Int;
    1.33 +		}
    1.34 +		operator int () const
    1.35 +		{
    1.36 +			return m_Int;
    1.37 +		}
    1.38 +	};
    1.39 +	
    1.40 +	#define LIST_THIS_CHECK(lst, err) \
    1.41 +		for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter) \
    1.42 +			CHECK_COND(&(*iter) == iter->m_This, err);
    1.43 +	
    1.44 +	bool DoTestList(std::string &error)
    1.45 +	{
    1.46 +		typedef SourceHook::List<Hmm> ListType;
    1.47 +		ListType lst;
    1.48 +	
    1.49 +		CHECK_COND(lst.empty(), "Part1");
    1.50 +		
    1.51 +		for (int i = 1; i <= 100; ++i)
    1.52 +			lst.push_back(i);
    1.53 +			
    1.54 +		LIST_THIS_CHECK(lst, "PartA1");
    1.55 +		
    1.56 +		CHECK_COND(!lst.empty(), "Part2");
    1.57 +		
    1.58 +		lst.clear();
    1.59 +		
    1.60 +		CHECK_COND(lst.empty(), "Part3");
    1.61 +		
    1.62 +		for (int i = 1; i <= 100; ++i)
    1.63 +			lst.push_back(i);
    1.64 +		
    1.65 +		CHECK_COND(lst.back() == 100, "Part4");
    1.66 +		LIST_THIS_CHECK(lst, "PartA2");
    1.67 +		
    1.68 +		int ver = 1;
    1.69 +		for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
    1.70 +			CHECK_COND(*iter == ver++, "Part5");
    1.71 +		
    1.72 +		CHECK_COND(ver == 101, "Part 6");
    1.73 +		
    1.74 +		ListType::iterator iter50 = lst.find(50);
    1.75 +		CHECK_COND(*iter50 == 50, "Part7");
    1.76 +		
    1.77 +		iter50 = lst.erase(iter50);
    1.78 +		CHECK_COND(*iter50 == 51, "Part8");
    1.79 +		CHECK_COND(*--iter50 == 49, "Part8.2");
    1.80 +		
    1.81 +		lst.remove(80);
    1.82 +		
    1.83 +		ver = 1;
    1.84 +		for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
    1.85 +		{
    1.86 +			CHECK_COND(*iter == ver++, "Part9");
    1.87 +			if (ver == 50 || ver == 80)
    1.88 +				++ver;
    1.89 +		}
    1.90 +		CHECK_COND(ver == 101, "Part10");
    1.91 +		LIST_THIS_CHECK(lst, "PartA3");
    1.92 +		
    1.93 +		ListType lst2;
    1.94 +		lst = lst2;
    1.95 +		CHECK_COND(lst.empty(), "Part11");
    1.96 +		
    1.97 +		for (int i = 1; i <= 100; ++i)
    1.98 +			lst.push_back(i);
    1.99 +		lst2 = lst;
   1.100 +		CHECK_COND(lst2.size() == 100, "Part11.2");
   1.101 +		
   1.102 +		LIST_THIS_CHECK(lst, "PartA4");
   1.103 +		LIST_THIS_CHECK(lst2, "PartA5");
   1.104 +		
   1.105 +		ver = 1;
   1.106 +		for (ListType::iterator iter = lst2.begin(); iter != lst2.end(); ++iter)
   1.107 +			CHECK_COND(*iter == ver++, "Part12");
   1.108 +		
   1.109 +		lst.clear();
   1.110 +		for (int i = 401; i <= 500; ++i)
   1.111 +			lst.push_back(i);
   1.112 +		lst = lst2;
   1.113 +		CHECK_COND(lst2.size() == 100, "Part13");
   1.114 +		
   1.115 +		ver = 1;
   1.116 +		for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
   1.117 +			CHECK_COND(*iter == ver++, "Part14");
   1.118 +
   1.119 +		LIST_THIS_CHECK(lst, "PartA6");
   1.120 +		LIST_THIS_CHECK(lst2, "PartA7");
   1.121 +				
   1.122 +		return true;
   1.123 +	}
   1.124 +	
   1.125 +	bool DoTestTinyHash(std::string &error)
   1.126 +	{
   1.127 +		const int mymax = 5000;
   1.128 +		
   1.129 +		typedef SourceHook::THash<int, int> HashType;
   1.130 +		HashType hash;
   1.131 +		
   1.132 +		for (int i = 1; i <= mymax; ++i)
   1.133 +			hash[i] = i + 5000;
   1.134 +		
   1.135 +		for (int i = 1; i <= mymax; ++i)
   1.136 +			CHECK_COND(hash[i] == i + 5000, "Part1");
   1.137 +		
   1.138 +		// Find
   1.139 +		int ver = 1;
   1.140 +		for (HashType::iterator iter = hash.begin(); iter != hash.end(); ++iter)
   1.141 +			CHECK_COND(iter->key == ver && iter->val == (ver++) + 5000, "Part2");
   1.142 +		
   1.143 +		CHECK_COND(ver == mymax+1, "Part2.1");
   1.144 +		
   1.145 +		HashType::iterator iter = hash.find(300);
   1.146 +		CHECK_COND(iter != hash.end() && iter->val == 300+5000, "Part3.1");
   1.147 +		iter = hash.find(mymax+200);
   1.148 +		CHECK_COND(iter == hash.end(), "Part3.2");
   1.149 +		
   1.150 +		HashType hash2;
   1.151 +		for (int i = 1; i <= mymax; ++i)
   1.152 +			hash2[i] = i + 5000;
   1.153 +		
   1.154 +		return true;
   1.155 +	}
   1.156 +}
   1.157 +
   1.158 +bool TestList(std::string &error)
   1.159 +{
   1.160 +	if (!DoTestList(error))
   1.161 +		return false;
   1.162 +	
   1.163 +	if (!DoTestTinyHash(error))
   1.164 +		return false;
   1.165 +	
   1.166 +	
   1.167 +	return true;
   1.168 +}