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
|
/*
This file is part of p4est.
p4est is a C library to manage a collection (a forest) of multiple
connected adaptive quadtrees or octrees in parallel.
Copyright (C) 2010 The University of Texas System
Additional copyright (C) 2011 individual authors
Written by Carsten Burstedde, Lucas C. Wilcox, and Tobin Isaac
p4est is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
p4est is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with p4est; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include <p4est_bits.h>
static unsigned
int_hash_fn (const void *v, const void *u)
{
return (unsigned) (unsigned long) v;
}
static int
int_equal_fn (const void *v1, const void *v2, const void *u)
{
return (long) v1 == (long) v2;
}
static void
check_hash_array (void)
{
sc_hash_array_t *ha;
ha = sc_hash_array_new (sizeof (int), NULL, NULL, NULL);
sc_hash_array_destroy (ha);
}
int
main (int argc, char **argv)
{
int i, k, inserted;
int i1, i2, i3;
void **vv1, **vv2, **vv3;
void *v1, *v2;
p4est_quadrant_t q1, q2, q3;
p4est_quadrant_t *f1, *f2, *f3;
sc_hash_t *ihash;
sc_hash_t *qhash;
for (k = 0; k < 3; ++k) {
ihash = sc_hash_new (int_hash_fn, int_equal_fn, NULL, NULL);
inserted = 0;
for (i = 0; i < 347; ++i) {
inserted +=
sc_hash_insert_unique (ihash, (void *) ((long) i % 91), NULL);
}
P4EST_VERBOSEF ("Integers inserted %d total %llu\n",
inserted, (unsigned long long) ihash->elem_count);
SC_CHECK_ABORT (inserted == (int) ihash->elem_count, "Integer hash");
sc_hash_destroy (ihash);
}
qhash = sc_hash_new (p4est_quadrant_hash_fn, p4est_quadrant_equal_fn,
NULL, NULL);
p4est_quadrant_set_morton (&q1, 3, 15);
p4est_quadrant_set_morton (&q2, 3, 18);
p4est_quadrant_set_morton (&q3, 3, 18);
q1.p.piggy1.owner_rank = 0;
q2.p.piggy1.owner_rank = 5;
q3.p.piggy1.owner_rank = 0;
f1 = f2 = f3 = NULL;
/* *INDENT-OFF* HORRIBLE indent bug */
i1 = sc_hash_insert_unique (qhash, &q1, &vv1);
f1 = (p4est_quadrant_t *) *vv1;
i2 = sc_hash_insert_unique (qhash, &q2, &vv2);
f2 = (p4est_quadrant_t *) *vv2;
i3 = sc_hash_insert_unique (qhash, &q3, &vv3);
f3 = (p4est_quadrant_t *) *vv3;
/* *INDENT-ON* */
P4EST_VERBOSEF ("Quadrants inserted %d %d %d total %llu\n",
i1, i2, i3, (unsigned long long) qhash->elem_count);
SC_CHECK_ABORT (i1 + i2 + i3 == (int) qhash->elem_count, "Quadrant hash");
SC_CHECK_ABORT (f3 == &q2 && f3->p.piggy1.owner_rank == 5, "Insert return");
f1 = f2 = f3 = NULL;
p4est_quadrant_set_morton (&q1, 3, 19);
i1 = sc_hash_lookup (qhash, &q1, NULL);
i2 = sc_hash_lookup (qhash, &q2, NULL);
i3 = sc_hash_lookup (qhash, &q3, &vv3);
/* *INDENT-OFF* HORRIBLE indent bug */
f3 = (p4est_quadrant_t *) *vv3;
/* *INDENT-ON* */
P4EST_VERBOSEF ("Quadrants lookup %d %d %d total %llu\n",
i1, i2, i3, (unsigned long long) qhash->elem_count);
SC_CHECK_ABORT (i1 == 0 && i2 == 1 && i3 == 1, "Quadrant lookup");
SC_CHECK_ABORT (f3 == &q2 && f3->p.piggy1.owner_rank == 5, "Lookup return");
f1 = f2 = f3 = NULL;
i1 = sc_hash_remove (qhash, &q1, &v1);
f1 = (p4est_quadrant_t *) v1;
i2 = sc_hash_remove (qhash, &q2, &v2);
f2 = (p4est_quadrant_t *) v2;
i3 = sc_hash_remove (qhash, &q3, NULL);
SC_CHECK_ABORT (i1 == 0 && i2 == 1 && i3 == 0, "Quadrant remove");
SC_CHECK_ABORT (f2 == &q2 && f2->p.piggy1.owner_rank == 5, "Remove return");
f2 = f1;
sc_hash_destroy (qhash);
check_hash_array ();
sc_finalize ();
return 0;
}
|
