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
172
173
174
175
176
177
178
179
180
181
182
183
|
/*
* TRArray.m
* TRArray 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
#include <config.h>
#endif
#include <check.h>
#include <src/TRArray.h>
#include <src/LFString.h>
START_TEST (test_addObject) {
TRArray *array = [[TRArray alloc] init];
LFString *string1 = [[LFString alloc] initWithCString: "String 1"];
LFString *string2 = [[LFString alloc] initWithCString: "String 2"];
LFString *string3 = [[LFString alloc] initWithCString: "String 3"];
/* Add 3 items to the array */
[array addObject: string1];
fail_unless([array lastObject] == string1);
fail_unless([string1 refCount] == 2);
[array addObject: string2];
fail_unless([array lastObject] == string2);
fail_unless([string2 refCount] == 2);
[array addObject: string3];
fail_unless([array lastObject] == string3);
fail_unless([string3 refCount] == 2);
/* Clean up the array */
[array release];
/* Verify that the array released all objects */
fail_unless([string1 refCount] == 1);
fail_unless([string2 refCount] == 1);
fail_unless([string3 refCount] == 1);
/* Clean up our remaining objects */
[string1 release];
[string2 release];
[string3 release];
}
END_TEST
START_TEST (test_removeObject) {
TRArray *array = [[TRArray alloc] init];
LFString *string1 = [[LFString alloc] initWithCString: "String 1"];
LFString *string2 = [[LFString alloc] initWithCString: "String 2"];
/* Fill our array */
[array addObject: string1];
[array addObject: string2];
/* Pop an object off the stack */
fail_unless([array lastObject] == string2);
[array removeObject];
fail_unless([array lastObject] == string1);
[array removeObject];
fail_unless([array lastObject] == nil);
[array release];
[string1 release];
[string2 release];
}
END_TEST
START_TEST (test_containsObject) {
TRArray *array = [[TRArray alloc] init];
LFString *string1 = [[LFString alloc] initWithCString: "String 1"];
/* Fill our array */
[array addObject: string1];
/* Look for our object */
fail_unless([array containsObject: string1]);
/* And a known bad one ... */
fail_if([array containsObject: array]);
[array release];
[string1 release];
}
END_TEST
START_TEST(test_count) {
TRArray *array = [[TRArray alloc] init];
LFString *string1 = [[LFString alloc] initWithCString: "String 1"];
/* Fill our array */
[array addObject: string1];
/* Check the count */
fail_unless([array count] == 1);
[array release];
[string1 release];
}
END_TEST
START_TEST(test_objectEnumerator) {
TRArray *array = [[TRArray alloc] init];
LFString *string1 = [[LFString alloc] initWithCString: "String 1"];
LFString *string2 = [[LFString alloc] initWithCString: "String 2"];
TREnumerator *iter;
id obj;
/* Insert */
[array addObject: string1];
[array addObject: string2];
/* Grab an enumerator */
iter = [array objectEnumerator];
obj = [iter nextObject];
fail_unless(obj == string2);
obj = [iter nextObject];
fail_unless(obj == string1);
[iter release];
/* Grab a reverse enumerator */
iter = [array objectReverseEnumerator];
obj = [iter nextObject];
fail_unless(obj == string1);
obj = [iter nextObject];
fail_unless(obj == string2);
[iter release];
/* Clean up */
[array release];
[string1 release];
[string2 release];
}
END_TEST
Suite *TRArray_suite(void) {
Suite *s = suite_create("TRArray");
TCase *tc_array = tcase_create("Array");
suite_add_tcase(s, tc_array);
tcase_add_test(tc_array, test_addObject);
tcase_add_test(tc_array, test_removeObject);
tcase_add_test(tc_array, test_containsObject);
tcase_add_test(tc_array, test_objectEnumerator);
tcase_add_test(tc_array, test_count);
return s;
}
|
