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
184
185
186
187
|
/* -*-Mode: c++;-*-
Various vector related code.
@section license License
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements. See the NOTICE file
distributed with this work for additional information
regarding copyright ownership. The ASF licenses this file
to you under the Apache License, Version 2.0 (the
"License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
/* UnionFind after Tarjan */
#include <stdint.h>
#include <stdio.h>
#include "ts/ink_assert.h"
#include "ts/Vec.h"
static void
test_append()
{
static const char value[] = "this is a string";
unsigned int len = (int)sizeof(value) - 1;
Vec<char> str;
str.append(value, 0);
ink_assert(str.length() == 0);
str.append(value, len);
ink_assert(memcmp(&str[0], value, len) == 0);
ink_assert(str.length() == len);
str.clear();
ink_assert(str.length() == 0);
for (unsigned i = 0; i < 1000; ++i) {
str.append(value, len);
ink_assert(memcmp(&str[i * len], value, len) == 0);
}
ink_assert(str.length() == 1000 * len);
}
static void
test_basic()
{
Vec<void *> v, vv, vvv;
int tt = 99 * 50, t = 0;
for (size_t i = 0; i < 100; i++)
v.add((void *)(intptr_t)i);
for (size_t i = 0; i < 100; i++)
t += (int)(intptr_t)v.v[i];
ink_assert(t == tt);
t = 0;
for (size_t i = 1; i < 100; i++)
vv.set_add((void *)(intptr_t)i);
for (size_t i = 1; i < 100; i++)
vvv.set_add((void *)(intptr_t)i);
for (size_t i = 1; i < 100; i++)
vvv.set_add((void *)(intptr_t)(i * 1000));
vv.set_union(vvv);
for (size_t i = 0; i < vv.n; i++)
if (vv.v[i])
t += (int)(intptr_t)vv.v[i];
ink_assert(t == tt + 1000 * tt);
v.clear();
v.reserve(1000);
t = 0;
for (size_t i = 0; i < 1000; i++)
v.add((void *)(intptr_t)i);
for (size_t i = 0; i < 1000; i++)
t += (int)(intptr_t)v.v[i];
ink_assert(t == 999 * 500);
printf("%zu %zu\n", v.n, v.i);
Intervals in;
in.insert(1);
ink_assert(in.n == 2);
in.insert(2);
ink_assert(in.n == 2);
in.insert(6);
ink_assert(in.n == 4);
in.insert(7);
ink_assert(in.n == 4);
in.insert(9);
ink_assert(in.n == 6);
in.insert(4);
ink_assert(in.n == 8);
in.insert(5);
ink_assert(in.n == 6);
in.insert(3);
ink_assert(in.n == 4);
in.insert(8);
ink_assert(in.n == 2);
UnionFind uf;
uf.size(4);
uf.unify(0, 1);
uf.unify(2, 3);
ink_assert(uf.find(2) == uf.find(3));
ink_assert(uf.find(0) == uf.find(1));
ink_assert(uf.find(0) != uf.find(3));
ink_assert(uf.find(1) != uf.find(3));
ink_assert(uf.find(1) != uf.find(2));
ink_assert(uf.find(0) != uf.find(2));
uf.unify(1, 2);
ink_assert(uf.find(0) == uf.find(3));
ink_assert(uf.find(1) == uf.find(3));
}
static bool
compare(void *a, void *b)
{
return a < b;
}
static void
test_sort()
{
Vec<void *> v;
for (long i = 1; i <= 1000; ++i)
v.add(reinterpret_cast<void *>(static_cast<intptr_t>(((i * 149) % 1000) + 1)));
v.qsort(&compare);
for (int i = 0; i < 1000; ++i)
ink_assert(reinterpret_cast<void *>(static_cast<intptr_t>(i + 1)) == v[i]);
v.clear();
for (long i = 1; i <= 1000000; ++i) {
v.add(reinterpret_cast<void *>(static_cast<intptr_t>(((i * 51511) % 1000000) + 1)));
}
v.qsort(&compare);
for (long i = 0; i < 1000000; ++i) {
ink_assert(reinterpret_cast<void *>(static_cast<intptr_t>(i + 1)) == v[i]);
}
v.clear();
for (long i = 1; i <= 1000000; ++i) {
// This should be every number 1..500000 twice.
v.add(reinterpret_cast<void *>(static_cast<intptr_t>(((i * 199999) % 500000) + 1)));
}
v.qsort(&compare);
for (long i = 0; i < 1000000; ++i) {
ink_assert(reinterpret_cast<void *>(static_cast<intptr_t>((i / 2) + 1)) == v[i]);
}
// Very long array, already sorted. This is what broke before.
v.clear();
for (long i = 1; i <= 10000000; ++i)
v.add(reinterpret_cast<void *>(static_cast<intptr_t>(i)));
v.qsort(&compare);
for (long i = 0; i < 10000000; ++i)
ink_assert(reinterpret_cast<void *>(static_cast<intptr_t>(i + 1)) == v[i]);
// very long, reverse sorted.
v.clear();
for (long i = 10000000; i >= 1; --i)
v.add(reinterpret_cast<void *>(static_cast<intptr_t>(i)));
v.qsort(&compare);
for (long i = 0; i < 10000000; ++i)
ink_assert(reinterpret_cast<void *>(static_cast<intptr_t>(i + 1)) == v[i]);
}
int
main(int /* argc ATS_UNUSED */, char ** /* argv ATS_UNUSED */)
{
test_append();
test_basic();
test_sort();
printf("test_Vec PASSED\n");
}
|
