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
|
/*-
* Copyright 1997, 1998-2003 John-Mark Gurney.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include "fib.h"
#define TESTCASE 1
#define COUNT 100000
#define DIF 1000
#define MAXEXT 10
#define VERBOSE 1
int cmp(void *, void *);
int
cmp(void *x, void *y)
{
int a, b;
a = (int)x;
b = (int)y;
if (a < b)
return -1;
if (a == b)
return 0;
return 1;
}
int
main(void)
{
#if !TESTCASE
struct fibheap_el *w;
#else
int e, j, k;
#endif
struct fibheap *a;
int i, x;
a = fh_makeheap();
fh_setcmp(a, cmp);
srandom(time(NULL));
#if TESTCASE
#if VERBOSE
printf("inserting: ");
#endif
e = 0;
for (i = 0; i < COUNT; i++) {
#if VERBOSE
if (i)
printf(", ");
#endif
fh_insert(a, (void *)(x = random()/10));
#if VERBOSE
printf("%d", x);
#endif
if (i - e > DIF) {
k = random() % MAXEXT;
for (j = 0; j < k; j++, e++)
printf("throwing: %d\n", (int)fh_extractmin(a));
}
}
#if VERBOSE
printf("\nremaining: %d\n", COUNT - e);
printf("extracting: ");
#endif
for (i = 0; i < COUNT - e; i++) {
#if VERBOSE
if (i)
printf(", ");
printf("%d", (int)fh_extractmin(a));
#else
fh_extractmin(a);
#endif
}
#if VERBOSE
printf("\n");
#endif
if ((int)fh_extractmin(a) == 0)
printf("heap empty!\n");
else {
printf("heap not empty! ERROR!\n");
exit(1);
}
#else
w = fh_insert(a, (void *)6);
printf("adding: %d\n", 6);
fh_insert(a, (void *)9);
printf("adding: %d\n", 9);
fh_insert(a, (void *)1);
printf("adding: %d\n", 1);
for(i = 0; i < 5; i++) {
x = random()/10000;
printf("adding: %d\n", x);
fh_insert(a, (void *)x);
}
fh_insert(a, (void *)4);
printf("adding: %d\n", 4);
fh_insert(a, (void *)8);
printf("adding: %d\n", 8);
printf("first: %d\n", (int)fh_extractmin(a));
printf("deleting: %d\n", (int)fh_delete(a, w));
printf("first: %d\n", (int)fh_extractmin(a));
printf("first: %d\n", (int)fh_extractmin(a));
printf("first: %d\n", (int)fh_extractmin(a));
printf("first: %d\n", (int)fh_extractmin(a));
printf("first: %d\n", (int)fh_extractmin(a));
for(i = 0; i < 5; i++) {
x = random()/10000;
printf("adding: %d\n", x);
fh_insert(a, (void *)x);
}
printf("first: %d\n", (int)fh_extractmin(a));
printf("first: %d\n", (int)fh_extractmin(a));
printf("first: %d\n", (int)fh_extractmin(a));
printf("first: %d\n", (int)fh_extractmin(a));
printf("first: %d\n", (int)fh_extractmin(a));
#endif
fh_deleteheap(a);
return 0;
}
|
