1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
// vim: syntax=cpp
/*
* Copyright (C) 2007-2010 Xagasoft, All rights reserved.
*
* This file is part of the libbu++ library and is released under the
* terms of the license contained in the file LICENSE.
*/
#include "bu/string.h"
#include "bu/hash.h"
#include <stdio.h>
typedef Bu::Hash<Bu::String, int> StrIntHash;
typedef Bu::Hash<Bu::String, Bu::String> StrStrHash;
typedef Bu::Hash<int, Bu::String> IntStrHash;
suite Hash
{
test probe1
{
StrIntHash h;
char buf[20];
for(int i=1;i<10000;i++)
{
sprintf(buf,"%d",i);
Bu::String sTmp(buf);
h[sTmp] = i;
unitTest( h.has(sTmp) );
}
}
test insert1
{
StrIntHash h;
h["Hi"] = 42;
unitTest( h["Hi"] == 42 );
}
test insert2
{
StrStrHash h;
h["Hi"] = "Yo";
h["Bye"] = "Later";
unitTest( h["Hi"].getValue() == "Yo" );
StrStrHash h2(h);
unitTest( h2["Hi"].getValue() == "Yo" );
unitTest( h2["Bye"].getValue() == "Later" );
StrStrHash h3;
h3 = h;
unitTest( h3["Hi"].getValue() == "Yo" );
unitTest( h3["Bye"].getValue() == "Later" );
}
test insert3
{
IntStrHash h;
for( unsigned int i=1; i<50; i++ )
{
h[i] = "testing";
unitTest( h.getSize() == i );
}
}
test erase1
{
StrIntHash h;
h.insert("Number 1", 1 );
h.insert("Number 2", 2 );
h.insert("Number 3", 3 );
h.erase("Number 2");
h.get("Number 3");
try {
h.get("Number 2");
unitFailed("h.get(\"Number 2\") should have thrown an exception.");
} catch( Bu::HashException &e ) { }
/* printf("\n");
for( StrIntHash::iterator i = h.begin(); i != h.end(); i++ )
{
printf(" - \"%s\" = %d\n", i.getKey().getStr(), i.getValue() );
} */
}
test copy
{
StrIntHash h;
h.insert("hello", 55 );
h.insert("goodbye", -1812 );
StrIntHash h2 = h;
unitTest( h2.isCoreShared( h ) );
StrIntHash h3 = h.clone();
unitTest( !h3.isCoreShared( h ) );
}
}
|
