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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
|
/*
* TRHash.m vi:ts=4:sw=4:expandtab:
* TRHash Unit Tests
*
* Author: Landon Fuller <landonf@threerings.net>
*
* Copyright (c) 2006 Three Rings Design, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of Landon Fuller nor the names of any contributors
* may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
#import <config.h>
#endif
#import "PXTestCase.h"
#import "TRHash.h"
@interface TRHashTests : PXTestCase @end
@implementation TRHashTests
- (void) testInitWithCapacity {
TRHash *hash = [[TRHash alloc] initWithCapacity: 42];
[hash release];
}
- (void) testIsFull {
TRHash *hash = [[TRHash alloc] initWithCapacity: 0];
fail_unless([hash isFull]);
[hash release];
}
- (void) test_setObjectForKey {
TRHash *hash = [[TRHash alloc] initWithCapacity: 1];
TRString *string = [[TRString alloc] initWithCString: "Hello, World"];
size_t refCount = [string retainCount];
[hash setObject: string forKey: string];
/* Verify that the object has been retained twice:
* - Once as the value
* - Once as the key
*/
fail_unless([string retainCount] == refCount + 2);
/* Release our hash table */
[hash release];
/* Verify that the object has been released */
fail_unless([string retainCount] == refCount);
[string release];
}
/*
* Verifies that replacing a key correctly releases key and associated value
*/
- (void) test_setObjectForKey_replacement {
TRHash *hash = [[TRHash alloc] initWithCapacity: 1];
TRString *key = [[TRString alloc] initWithCString: "Key"];
TRString *value1 = [[TRString alloc] initWithCString: "Hello, World"];
TRString *value2 = [[TRString alloc] initWithCString: "Goodbye, World"];
size_t refCount = [key retainCount];
/* Insert value1 */
[hash setObject: value1 forKey: key];
fail_unless([key retainCount] == refCount + 1);
/* Replace the node */
[hash setObject: value2 forKey: key];
fail_unless([key retainCount] == refCount + 1);
fail_unless([value1 retainCount] == refCount);
[hash release];
/* Verify that the objects have been released */
fail_unless([key retainCount] == refCount);
fail_unless([value1 retainCount] == refCount);
fail_unless([value2 retainCount] == refCount);
[key release];
[value1 release];
[value2 release];
}
- (void) test_removeObjectForKey {
TRHash *hash = [[TRHash alloc] initWithCapacity: 1];
TRString *key = [[TRString alloc] initWithCString: "Key"];
TRString *value = [[TRString alloc] initWithCString: "Value"];
PXUInteger refCount = [key retainCount];
/* Insert */
[hash setObject: value forKey: key];
/* Remove */
[hash removeObjectForKey: key];
/* Validate refCounts */
fail_unless([key retainCount] == refCount);
fail_unless([value retainCount] == refCount);
/* Clean up */
[key release];
[value release];
[hash release];
}
- (void) test_valueForKey {
TRHash *hash = [[TRHash alloc] initWithCapacity: 1];
TRString *key = [[TRString alloc] initWithCString: "Key"];
TRString *value = [[TRString alloc] initWithCString: "Value"];
/* Insert */
[hash setObject: value forKey: key];
/* Get value */
fail_unless([hash valueForKey: key] == value);
/* Clean up */
[hash release];
[key release];
[value release];
}
- (void) test_keyEnumerator {
TRHash *hash = [[TRHash alloc] initWithCapacity: HASHCOUNT_T_MAX];
TRString *key = [[TRString alloc] initWithCString: "Key"];
TRString *value = [[TRString alloc] initWithCString: "Value"];
TREnumerator *iter;
id obj;
/* Insert */
[hash setObject: value forKey: key];
[hash setObject: key forKey: value];
/* Grab an enumerator */
iter = [hash keyEnumerator];
obj = [iter nextObject];
fail_unless(obj == value || obj == key);
obj = [iter nextObject];
fail_unless(obj == value || obj == key);
/* Clean up */
[hash release];
[key release];
[value release];
}
@end
|
