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
|
/*
This file is part of the SC Library.
The SC Library provides support for parallel scientific applications.
Copyright (C) 2010 The University of Texas System
Additional copyright (C) 2011 individual authors
The SC Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The SC Library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the SC Library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#include <sc_containers.h>
/* #define THEBIGTEST */
static int
compar (const void *p1, const void *p2)
{
int i1 = *(int *) p1;
int i2 = *(int *) p2;
return i1 - i2;
}
int
main (int argc, char **argv)
{
int i, i1, i2, i3, i3last, i4, i4last, temp, count;
size_t s, swaps1, swaps2, swaps3, total1, total2, total3;
ssize_t searched;
int *pi;
sc_array_t *a1, *a2, *a3, *a4;
int mpiret;
double start, elapsed_pqueue, elapsed_qsort;
mpiret = sc_MPI_Init (&argc, &argv);
SC_CHECK_MPI (mpiret);
sc_init (sc_MPI_COMM_WORLD, 1, 1, NULL, SC_LP_DEFAULT);
a1 = sc_array_new (sizeof (int));
a2 = sc_array_new (sizeof (int));
a3 = sc_array_new (sizeof (int));
a4 = sc_array_new (sizeof (int));
#ifdef THEBIGTEST
count = 325323;
#else
count = 3251;
#endif
SC_INFOF ("Test pqueue with count %d\n", count);
start = -sc_MPI_Wtime ();
swaps1 = swaps2 = swaps3 = 0;
total1 = total2 = total3 = 0;
for (i = 0; i < count; ++i) {
*(int *) sc_array_push (a1) = i;
s = sc_array_pqueue_add (a1, &temp, compar);
swaps1 += ((s > 0) ? 1 : 0);
total1 += s;
*(int *) sc_array_push (a2) = count - i - 1;
s = sc_array_pqueue_add (a2, &temp, compar);
swaps2 += ((s > 0) ? 1 : 0);
total2 += s;
*(int *) sc_array_push (a3) = (15 * i) % 172;
s = sc_array_pqueue_add (a3, &temp, compar);
swaps3 += ((s > 0) ? 1 : 0);
total3 += s;
}
SC_CHECK_ABORT (swaps1 == 0 && total1 == 0, "pqueue_add");
SC_VERBOSEF (" Swaps %lld %lld %lld Total %lld %lld %lld\n",
(long long) swaps1, (long long) swaps2, (long long) swaps3,
(long long) total1, (long long) total2, (long long) total3);
temp = 52;
searched = sc_array_bsearch (a1, &temp, compar);
SC_CHECK_ABORT (searched != -1, "array_bsearch_index");
pi = (int *) sc_array_index_ssize_t (a1, searched);
SC_CHECK_ABORT (*pi == temp, "array_bsearch");
i3last = -1;
swaps1 = swaps2 = swaps3 = 0;
total1 = total2 = total3 = 0;
for (i = 0; i < count; ++i) {
s = sc_array_pqueue_pop (a1, &i1, compar);
swaps1 += ((s > 0) ? 1 : 0);
total1 += s;
s = sc_array_pqueue_pop (a2, &i2, compar);
swaps2 += ((s > 0) ? 1 : 0);
total2 += s;
s = sc_array_pqueue_pop (a3, &i3, compar);
swaps3 += ((s > 0) ? 1 : 0);
total3 += s;
SC_CHECK_ABORT (i == i1 && i == i2, "pqueue_pop");
SC_CHECK_ABORT (i3 >= i3last, "pqueue_pop");
i3last = i3;
}
SC_VERBOSEF (" Swaps %lld %lld %lld Total %lld %lld %lld\n",
(long long) swaps1, (long long) swaps2, (long long) swaps3,
(long long) total1, (long long) total2, (long long) total3);
elapsed_pqueue = start + sc_MPI_Wtime ();
sc_array_destroy (a1);
sc_array_destroy (a2);
sc_array_destroy (a3);
SC_INFOF ("Test array sort with count %d\n", count);
start = -sc_MPI_Wtime ();
/* the resize is done to be comparable with the above procedure */
for (i = 0; i < count; ++i) {
*(int *) sc_array_push (a4) = (15 * i) % 172;
}
sc_array_sort (a4, compar);
i4last = -1;
for (i = 0; i < count; ++i) {
i4 = *(int *) sc_array_index_int (a4, i);
SC_CHECK_ABORT (i4 >= i4last, "array_sort");
i4last = i4;
}
sc_array_resize (a4, 0);
elapsed_qsort = start + sc_MPI_Wtime ();
SC_STATISTICSF ("Test timings pqueue %g qsort %g\n",
elapsed_pqueue, 3. * elapsed_qsort);
sc_array_destroy (a4);
sc_finalize ();
mpiret = sc_MPI_Finalize ();
SC_CHECK_MPI (mpiret);
return 0;
}
|
