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
188
189
190
191
192
193
194
195
196
197
|
/*
* list_check.c
*
* Unit test for the reflection list module
*
* (c) 2011 Thomas White <taw@physics.org>
*
* Part of CrystFEL - crystallography with a FEL
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <stdlib.h>
#include <stdio.h>
#include "../src/reflist.h"
struct refltemp {
signed int h;
signed int k;
signed int l;
int del;
int dup;
};
#define RANDOM_INDEX (128*random()/RAND_MAX - 256*random()/RAND_MAX)
static int test_lists(int num_items)
{
struct refltemp *check;
RefList *list;
int i;
signed int h, k, l;
check = malloc(num_items * sizeof(struct refltemp));
list = reflist_new();
printf("Testing with %i\n", num_items);
h = RANDOM_INDEX;
k = RANDOM_INDEX;
l = RANDOM_INDEX;
for ( i=0; i<num_items; i++ ) {
int j;
int duplicate = 0;
if ( random() > RAND_MAX/2 ) {
h = RANDOM_INDEX;
k = RANDOM_INDEX;
l = RANDOM_INDEX;
} /* else use the same as last time */
/* Count the number of times this reflection appeared before */
for ( j=0; j<i; j++ ) {
if ( (check[j].h == h)
&& (check[j].k == k)
&& (check[j].l == l) ) {
duplicate++;
}
}
/* Update all copies with this number */
for ( j=0; j<i; j++ ) {
if ( (check[j].h == h)
&& (check[j].k == k)
&& (check[j].l == l) ) {
check[j].dup = duplicate;
}
}
add_refl(list, h, k, l);
check[i].h = h;
check[i].k = k;
check[i].l = l;
check[i].del = 0;
check[i].dup = duplicate;
}
/* Check that all the reflections can be found,
* and delete the first few. */
for ( i=0; i<num_items; i++ ) {
signed int h, k, l;
Reflection *refl;
h = check[i].h;
k = check[i].k;
l = check[i].l;
refl = find_refl(list, h, k, l);
if ( refl == NULL ) {
fprintf(stderr, "Couldn't find %3i %3i %3i\n", h, k, l);
return 1;
}
/* Delete some reflections */
if ( i<num_items/2 ) {
int j;
delete_refl(refl);
check[i].del = 1;
/* Update all counts */
for ( j=0; j<i; j++ ) {
if ( (check[j].h == h)
&& (check[j].k == k)
&& (check[j].l == l) ) {
check[j].dup--;
}
}
}
}
/* Check that the deleted reflections can no longer be found, unless
* duplicated. If duplicated, remove all the remaining copies. */
for ( i=0; i<num_items/2; i++ ) {
signed int h, k, l;
Reflection *refl;
h = check[i].h;
k = check[i].k;
l = check[i].l;
refl = find_refl(list, h, k, l);
if ( refl != NULL ) {
/* Whoops, found it. Was it a duplicate? */
if ( check[i].dup == 0 ) {
fprintf(stderr, "Found %3i %i %3i after"
" deletion.\n", h, k, l);
return 1;
} else {
int j;
Reflection *c;
for ( j=0; j<check[i].dup; j++ ) {
Reflection *r2;
r2 = find_refl(list, h, k, l);
if ( r2 == NULL ) {
fprintf(stderr, "Found too few"
" duplicates for"
" %3i %3i %3i\n",
h, k, l);
return 1;
}
delete_refl(r2);
}
c = find_refl(list, h, k, l);
if ( c != NULL ) {
fprintf(stderr, "Found too many "
"duplicates for %3i %3i %3i\n",
h, k, l);
return 1;
}
}
}
}
reflist_free(list);
free(check);
return 0;
}
int main(int argc, char *argv[])
{
int i;
printf("Running list test...");
fflush(stdout);
for ( i=0; i<100; i++ ) {
if ( test_lists(4096*random()/RAND_MAX) ) return 1;
}
printf("\r");
return 0;
}
|
