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
198
199
200
201
202
203
|
/*
* Copyright 2001-2003 Adrian Thurston <thurston@colm.net>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include <time.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <iostream>
#include "avlmel.h"
#define AVLTREE_MEL
#include "avlverify.h"
#undef AVLTREE_MEL
#include "util.h"
/* Having the action change perion larger than the number of initial entries
* means that it will take longer to get to all the cases, but all the
* cases will be more thoroughly tested. The tree will be more likely to
* empty out completely and fill up with all of the entries. */
#define INITIAL_ENTRIES 64831
#define ACTION_CHANGE_PERIOD 120233
#define VERIFY_PERIOD 1119
#define COPY_PERIOD 1351
#define INCREMENT_VARIATION 10
#define STATS_PERIOD 211
#define OUTBUFSIZE 100
#define TAB_WIDTH 10
using namespace std;
struct TreeEl;
struct BaseEl1 : public AvlTreeEl< TreeEl > { };
struct BaseEl2 : public AvlTreeEl< TreeEl > { };
struct TreeEl :
public BaseEl1,
public BaseEl2
{
TreeEl() : inTree1(false), inTree2(false) { }
TreeEl(const int key) : key(key), inTree1(false), inTree2(false) { }
const int &getKey() { return key; }
int key;
bool inTree1;
bool inTree2;
};
template class AvlMel< TreeEl, int, BaseEl1 >;
template class AvlMel< TreeEl, int, BaseEl2 >;
template class AvlMelVer< TreeEl, int, BaseEl1 >;
template class AvlMelVer< TreeEl, int, BaseEl2 >;
int increment = 0;
int curIndex = 0;
int action = 1;
int curRound = 0;
/* Replace the current stats line with new stats. For two trees. */
void printStats( int treeSize1, int treeSize2 )
{
/* Print stats. */
static char buf[OUTBUFSIZE] = { 0 };
char tmpBuf[OUTBUFSIZE];
if ( curRound % STATS_PERIOD == 0 ) {
memset( buf, '\b', strlen(buf) );
cout << buf;
sprintf( tmpBuf, "%i\t%i\t%s\t%s\t%i\t%i\t%i\t", curRound, increment,
action&0x1 ? "yes" : "no", action&0x2 ? "yes" : "no",
curIndex, treeSize1, treeSize2 );
expandTab( buf, tmpBuf );
cout << buf;
cout.flush();
}
}
/* Find a new curIndex to use. If the increment is 0 then get
* a random curIndex. Otherwise use the increment. */
void newIndex()
{
if ( increment == 0 )
curIndex = random() % INITIAL_ENTRIES;
else
curIndex = (curIndex + increment) % INITIAL_ENTRIES;
}
/* Print the header to the stats. For two trees*/
void printHeader()
{
char buf[OUTBUFSIZE];
expandTab( buf, "round\tinc\tins\trem\tindex\tels1\tels2" );
cout << buf << endl;
}
int main( int argc, char **argv )
{
processArgs( argc, argv );
srandom( time(0) );
/* Make the tree and element. */
AvlMelVer< TreeEl, int, BaseEl1 > tree1;
AvlMelVer< TreeEl, int, BaseEl2 > tree2;
TreeEl *allElements = new TreeEl[INITIAL_ENTRIES];
for ( int element = 0; element < INITIAL_ENTRIES; element++ )
allElements[element].key = element;
printHeader();
for ( curRound = 0; true; curRound++ ) {
/* Do we change our action? */
if ( curRound % ACTION_CHANGE_PERIOD == 0 ) {
increment = random() % 2;
if ( increment > 0 )
increment = random() % INCREMENT_VARIATION;
action = (random()%3) + 1;
}
/* Dump stats. */
printStats( tree1.treeSize, tree2.treeSize );
/* Insert one to tree1? */
if ( action&0x1 ) {
newIndex();
/* Insert from the pool of existing element. */
if ( ! allElements[curIndex].inTree1 ) {
tree1.insert( allElements+curIndex );
allElements[curIndex].inTree1 = true;
}
}
/* Insert one to tree2? */
if ( action&0x1 ) {
newIndex();
/* Insert from the pool of existing element. */
if ( ! allElements[curIndex].inTree2 ) {
tree2.insert( allElements+curIndex );
allElements[curIndex].inTree2 = true;
}
}
/* Delete one from tree1? */
if ( action&0x2 ) {
newIndex();
/* Delete from the pool of existing entries. */
if ( allElements[curIndex].inTree1 ) {
tree1.detach( allElements+curIndex );
allElements[curIndex].inTree1 = false;
}
}
/* Delete one from tree2? */
if ( action&0x2 ) {
newIndex();
/* Delete from the pool of existing entries. */
if ( allElements[curIndex].inTree2 ) {
tree2.detach( allElements+curIndex );
allElements[curIndex].inTree2 = false;
}
}
/* Verify? */
if ( curRound % VERIFY_PERIOD == 0 ) {
tree1.verifyIntegrity();
tree2.verifyIntegrity();
}
/* Test the deep copy? */
if ( curRound % COPY_PERIOD == 0 ) {
AvlMelVer< TreeEl, int, BaseEl1 > copy1( tree1 );
AvlMelVer< TreeEl, int, BaseEl2 > copy2( tree2 );
copy1.verifyIntegrity();
copy2.verifyIntegrity();
copy1.empty();
copy2.empty();
}
}
return 0;
}
|
