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
|
/*====================================================================*
- Copyright (C) 2001 Leptonica. All rights reserved.
- This software is distributed in the hope that it will be
- useful, but with NO WARRANTY OF ANY KIND.
- No author or distributor accepts responsibility to anyone for the
- consequences of using this software, or for whether it serves any
- particular purpose or works at all, unless he or she says so in
- writing. Everyone is granted permission to copy, modify and
- redistribute this source code, for commercial or non-commercial
- purposes, with the following restrictions: (1) the origin of this
- source code must not be misrepresented; (2) modified versions must
- be plainly marked as such; and (3) this notice may not be removed
- or altered from any source or modified source distribution.
*====================================================================*/
/*
* heaptest.c
*
*/
#include <stdio.h>
#include <stdlib.h>
#include "allheaders.h"
struct HeapElement {
l_float32 distance;
l_int32 x;
l_int32 y;
};
typedef struct HeapElement HEAPEL;
static const l_int32 NELEM = 50;
main(int argc,
char **argv)
{
l_int32 i;
l_float32 frand, fval;
HEAPEL *item;
NUMA *na;
PHEAP *ph;
static char mainName[] = "heaptest";
if (argc != 1)
exit(ERROR_INT(" Syntax: heaptest", mainName, 1));
/* make a numa of random numbers */
na = numaCreate(5);
for (i = 0; i < NELEM; i++) {
frand = (l_float32)rand() / (l_float32)RAND_MAX;
numaAddNumber(na, frand);
}
/* make an array of HEAPELs with the same numbers */
ph = pheapCreate(5, L_SORT_INCREASING);
for (i = 0; i < NELEM; i++) {
numaGetFValue(na, i, &fval);
item = (HEAPEL *)CALLOC(1, sizeof(HEAPEL));
item->distance = fval;
pheapAdd(ph, item);
}
pheapPrint(stderr, ph);
/* switch the direction and resort into a heap */
ph->direction = L_SORT_DECREASING;
pheapSort(ph);
pheapPrint(stderr, ph);
/* resort for strict order */
pheapSortStrictOrder(ph);
pheapPrint(stderr, ph);
/* switch the direction again and resort into a heap */
ph->direction = L_SORT_INCREASING;
pheapSort(ph);
pheapPrint(stderr, ph);
/* remove the elements, one at a time */
for (i = 0; pheapGetCount(ph) > 0; i++) {
item = (HEAPEL *)pheapRemove(ph);
fprintf(stderr, "item %d: %f\n", i, item->distance);
FREE(item);
}
pheapDestroy(&ph, 1);
numaDestroy(&na);
return 0;
}
|
