sourcehook/test/testlist.cpp
author Pavol Marko <pavolmarko@gmail.com>
Mon Oct 03 17:20:22 2005 +0000 (2005-10-03)
changeset 117 e322da4af2d2
parent 111 aec58c99dafc
child 119 8b8ccac34850
permissions -rw-r--r--
CHANGES!
sh_memory.h: Added ModuleInMemory; first checks /proc/self/maps OR /proc/curproc/map; if not available tries DS's sigsegv trapping method
sh_tinyhash: Added simple erase function(s)
test/Makefile: New makefile
Changed internal interface: sourcehook.hxx now doesn't need to know about implementation details like vectors etc.
pavolmarko@111
     1
#include <string>
pavolmarko@111
     2
#include "sh_list.h"
pavolmarko@111
     3
#include "sh_tinyhash.h"
pavolmarko@111
     4
pavolmarko@111
     5
// TEST LIST
pavolmarko@111
     6
// Tests sh_list, sh_tinyhash, sh_vector
pavolmarko@111
     7
pavolmarko@111
     8
// :TODO: vector test
pavolmarko@111
     9
pavolmarko@111
    10
#define CHECK_COND(c, err) if (!(c)) { error = err; return false; }
pavolmarko@111
    11
pavolmarko@111
    12
namespace
pavolmarko@111
    13
{
pavolmarko@111
    14
	struct Hmm
pavolmarko@111
    15
	{
pavolmarko@111
    16
		Hmm *m_This;
pavolmarko@111
    17
		int m_Int;
pavolmarko@111
    18
		Hmm(const Hmm &other) : m_This(this), m_Int(other.m_Int)
pavolmarko@111
    19
		{
pavolmarko@111
    20
		}
pavolmarko@111
    21
		Hmm(int i) : m_This(this), m_Int(i)
pavolmarko@111
    22
		{
pavolmarko@111
    23
		}
pavolmarko@111
    24
		Hmm() : m_This(this), m_Int(0)
pavolmarko@111
    25
		{
pavolmarko@111
    26
		}
pavolmarko@111
    27
		void operator = (const Hmm &other)
pavolmarko@111
    28
		{
pavolmarko@111
    29
			m_Int = other.m_Int;
pavolmarko@111
    30
		}
pavolmarko@111
    31
		operator int () const
pavolmarko@111
    32
		{
pavolmarko@111
    33
			return m_Int;
pavolmarko@111
    34
		}
pavolmarko@111
    35
	};
pavolmarko@117
    36
pavolmarko@111
    37
	#define LIST_THIS_CHECK(lst, err) \
pavolmarko@111
    38
		for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter) \
pavolmarko@111
    39
			CHECK_COND(&(*iter) == iter->m_This, err);
pavolmarko@117
    40
pavolmarko@111
    41
	bool DoTestList(std::string &error)
pavolmarko@111
    42
	{
pavolmarko@111
    43
		typedef SourceHook::List<Hmm> ListType;
pavolmarko@111
    44
		ListType lst;
pavolmarko@117
    45
pavolmarko@111
    46
		CHECK_COND(lst.empty(), "Part1");
pavolmarko@117
    47
pavolmarko@111
    48
		for (int i = 1; i <= 100; ++i)
pavolmarko@111
    49
			lst.push_back(i);
pavolmarko@117
    50
pavolmarko@111
    51
		LIST_THIS_CHECK(lst, "PartA1");
pavolmarko@117
    52
pavolmarko@111
    53
		CHECK_COND(!lst.empty(), "Part2");
pavolmarko@117
    54
pavolmarko@111
    55
		lst.clear();
pavolmarko@117
    56
pavolmarko@111
    57
		CHECK_COND(lst.empty(), "Part3");
pavolmarko@117
    58
pavolmarko@111
    59
		for (int i = 1; i <= 100; ++i)
pavolmarko@111
    60
			lst.push_back(i);
pavolmarko@117
    61
pavolmarko@111
    62
		CHECK_COND(lst.back() == 100, "Part4");
pavolmarko@111
    63
		LIST_THIS_CHECK(lst, "PartA2");
pavolmarko@117
    64
pavolmarko@111
    65
		int ver = 1;
pavolmarko@111
    66
		for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
pavolmarko@111
    67
			CHECK_COND(*iter == ver++, "Part5");
pavolmarko@117
    68
pavolmarko@111
    69
		CHECK_COND(ver == 101, "Part 6");
pavolmarko@117
    70
pavolmarko@111
    71
		ListType::iterator iter50 = lst.find(50);
pavolmarko@111
    72
		CHECK_COND(*iter50 == 50, "Part7");
pavolmarko@117
    73
pavolmarko@111
    74
		iter50 = lst.erase(iter50);
pavolmarko@111
    75
		CHECK_COND(*iter50 == 51, "Part8");
pavolmarko@111
    76
		CHECK_COND(*--iter50 == 49, "Part8.2");
pavolmarko@117
    77
pavolmarko@111
    78
		lst.remove(80);
pavolmarko@117
    79
pavolmarko@111
    80
		ver = 1;
pavolmarko@111
    81
		for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
pavolmarko@111
    82
		{
pavolmarko@111
    83
			CHECK_COND(*iter == ver++, "Part9");
pavolmarko@111
    84
			if (ver == 50 || ver == 80)
pavolmarko@111
    85
				++ver;
pavolmarko@111
    86
		}
pavolmarko@111
    87
		CHECK_COND(ver == 101, "Part10");
pavolmarko@111
    88
		LIST_THIS_CHECK(lst, "PartA3");
pavolmarko@117
    89
pavolmarko@111
    90
		ListType lst2;
pavolmarko@111
    91
		lst = lst2;
pavolmarko@111
    92
		CHECK_COND(lst.empty(), "Part11");
pavolmarko@117
    93
pavolmarko@111
    94
		for (int i = 1; i <= 100; ++i)
pavolmarko@111
    95
			lst.push_back(i);
pavolmarko@111
    96
		lst2 = lst;
pavolmarko@111
    97
		CHECK_COND(lst2.size() == 100, "Part11.2");
pavolmarko@117
    98
pavolmarko@111
    99
		LIST_THIS_CHECK(lst, "PartA4");
pavolmarko@111
   100
		LIST_THIS_CHECK(lst2, "PartA5");
pavolmarko@117
   101
pavolmarko@111
   102
		ver = 1;
pavolmarko@111
   103
		for (ListType::iterator iter = lst2.begin(); iter != lst2.end(); ++iter)
pavolmarko@111
   104
			CHECK_COND(*iter == ver++, "Part12");
pavolmarko@117
   105
pavolmarko@111
   106
		lst.clear();
pavolmarko@111
   107
		for (int i = 401; i <= 500; ++i)
pavolmarko@111
   108
			lst.push_back(i);
pavolmarko@111
   109
		lst = lst2;
pavolmarko@111
   110
		CHECK_COND(lst2.size() == 100, "Part13");
pavolmarko@117
   111
pavolmarko@111
   112
		ver = 1;
pavolmarko@111
   113
		for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
pavolmarko@111
   114
			CHECK_COND(*iter == ver++, "Part14");
pavolmarko@111
   115
pavolmarko@111
   116
		LIST_THIS_CHECK(lst, "PartA6");
pavolmarko@111
   117
		LIST_THIS_CHECK(lst2, "PartA7");
pavolmarko@117
   118
pavolmarko@111
   119
		return true;
pavolmarko@111
   120
	}
pavolmarko@117
   121
pavolmarko@111
   122
	bool DoTestTinyHash(std::string &error)
pavolmarko@111
   123
	{
pavolmarko@111
   124
		const int mymax = 5000;
pavolmarko@117
   125
pavolmarko@111
   126
		typedef SourceHook::THash<int, int> HashType;
pavolmarko@111
   127
		HashType hash;
pavolmarko@117
   128
pavolmarko@111
   129
		for (int i = 1; i <= mymax; ++i)
pavolmarko@111
   130
			hash[i] = i + 5000;
pavolmarko@117
   131
pavolmarko@111
   132
		for (int i = 1; i <= mymax; ++i)
pavolmarko@111
   133
			CHECK_COND(hash[i] == i + 5000, "Part1");
pavolmarko@117
   134
pavolmarko@111
   135
		// Find
pavolmarko@111
   136
		int ver = 1;
pavolmarko@111
   137
		for (HashType::iterator iter = hash.begin(); iter != hash.end(); ++iter)
pavolmarko@111
   138
			CHECK_COND(iter->key == ver && iter->val == (ver++) + 5000, "Part2");
pavolmarko@117
   139
pavolmarko@111
   140
		CHECK_COND(ver == mymax+1, "Part2.1");
pavolmarko@117
   141
pavolmarko@111
   142
		HashType::iterator iter = hash.find(300);
pavolmarko@111
   143
		CHECK_COND(iter != hash.end() && iter->val == 300+5000, "Part3.1");
pavolmarko@111
   144
		iter = hash.find(mymax+200);
pavolmarko@111
   145
		CHECK_COND(iter == hash.end(), "Part3.2");
pavolmarko@117
   146
pavolmarko@111
   147
		HashType hash2;
pavolmarko@111
   148
		for (int i = 1; i <= mymax; ++i)
pavolmarko@111
   149
			hash2[i] = i + 5000;
pavolmarko@117
   150
pavolmarko@117
   151
		hash2.erase(mymax - 100);
pavolmarko@117
   152
		CHECK_COND(hash2.find(mymax - 101) != hash2.end(), "Part 4.1");
pavolmarko@117
   153
		CHECK_COND(hash2.find(mymax - 99) != hash2.end(), "Part 4.2");
pavolmarko@117
   154
		CHECK_COND(hash2.find(mymax - 100) == hash2.end(), "Part 4.3");
pavolmarko@117
   155
		hash2.erase(mymax - 99);
pavolmarko@117
   156
		CHECK_COND(hash2.find(mymax - 101) != hash2.end(), "Part 4.4");
pavolmarko@117
   157
		CHECK_COND(hash2.find(mymax - 99) == hash2.end(), "Part 4.5");
pavolmarko@117
   158
		CHECK_COND(hash2.find(mymax - 100) == hash2.end(), "Part 4.6");
pavolmarko@117
   159
pavolmarko@111
   160
		return true;
pavolmarko@111
   161
	}
pavolmarko@111
   162
}
pavolmarko@111
   163
pavolmarko@111
   164
bool TestList(std::string &error)
pavolmarko@111
   165
{
pavolmarko@111
   166
	if (!DoTestList(error))
pavolmarko@111
   167
		return false;
pavolmarko@117
   168
pavolmarko@111
   169
	if (!DoTestTinyHash(error))
pavolmarko@111
   170
		return false;
pavolmarko@117
   171
pavolmarko@117
   172
pavolmarko@111
   173
	return true;
pavolmarko@111
   174
}