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
204
205
206
207
208
209
210
211
212
213
|
/*
* Copyright 2002 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.
*/
#ifdef AAPL_NAMESPACE
namespace Aapl {
#endif
#if defined( AVLTREE_MEL )
# define BASE_EL(name) BaseEl::name
# define BASEKEY(name) name
# define AVL_CLASSDEF class Element, class Key, \
class BaseEl, class Compare = CmpOrd<Key>
# define AVL_TEMPDEF class Element, class Key, \
class BaseEl, class Compare
# define AVL_TEMPUSE Element, Key, BaseEl, Compare
# if defined( WALKABLE )
# define AvlTreeVer AvliMelVer
# define AvlTree AvliMel
# define BASELIST DListMel< Element, BaseEl >
# else
# define AvlTreeVer AvlMelVer
# define AvlTree AvlMel
# endif
#elif defined( AVLTREE_MELKEY )
# define BASE_EL(name) BaseEl::name
# define BASEKEY(name) BaseKey::name
# define AVL_CLASSDEF class Element, class Key, class BaseEl, \
class BaseKey, class Compare = CmpOrd<Key>
# define AVL_TEMPDEF class Element, class Key, class BaseEl, \
class BaseKey, class Compare
# define AVL_TEMPUSE Element, Key, BaseEl, BaseKey, Compare
# if defined( WALKABLE )
# define AvlTreeVer AvliMelKeyVer
# define AvlTree AvliMelKey
# define BASELIST DListMel< Element, BaseEl >
# else
# define AvlTreeVer AvlMelKeyVer
# define AvlTree AvlMelKey
# endif
#elif defined( AVLTREE_SINGULAR )
# define BASE_EL(name) name
# define BASEKEY(name) name
# define AVL_CLASSDEF class Element, class Key, class Compare = CmpOrd<Key>
# define AVL_TEMPDEF class Element, class Key, class Compare
# define AVL_TEMPUSE Element, Key, Compare
# if defined( WALKABLE )
# define AvlTreeVer AvliTreeVer
# define AvlTree AvliTree
# define BASELIST DListMel< Element, AvliTreeEl<Element> >
# else
# define AvlTreeVer AvlTreeVer
# define AvlTree AvlTree
# endif
#elif defined( AVLTREE_MAP )
# define BASE_EL(name) name
# define BASEKEY(name) name
# define AVL_CLASSDEF class Key, class Value, class Compare = CmpOrd<Key>
# define AVL_TEMPDEF class Key, class Value, class Compare
# define AVL_TEMPUSE Key, Value, Compare
# if defined( WALKABLE )
# define AvlTreeVer AvliMapVer
# define AvlTree AvliMap
# define Element AvliMapEl<Key,Value>
# define BASELIST DList< AvliMapEl<Key,Value> >
# else
# define AvlTreeVer AvlMapVer
# define AvlTree AvlMap
# define Element AvlMapEl<Key,Value>
# endif
#elif defined( AVLTREE_SET )
# define BASE_EL(name) name
# define BASEKEY(name) name
# define AVL_CLASSDEF class Key, class Compare = CmpOrd<Key>
# define AVL_TEMPDEF class Key, class Compare
# define AVL_TEMPUSE Key, Compare
# if defined( WALKABLE )
# define AvlTreeVer AvliSetVer
# define AvlTree AvliSet
# define Element AvliSetEl<Key>
# define BASELIST DList< AvliSetEl<Key> >
# else
# define AvlTreeVer AvlSetVer
# define AvlTree AvlSet
# define Element AvlSetEl<Key>
# endif
#else
# error "tree type not specified: this is not a user header"
#endif
/* AvlTree with verification routines. */
template < AVL_CLASSDEF > class AvlTreeVer
: public AvlTree<AVL_TEMPUSE>
{
public:
typedef AvlTree<AVL_TEMPUSE> BaseTree;
#ifdef WALKABLE
typedef BASELIST BaseList;
#else
typedef AvlTree<AVL_TEMPUSE> BaseList;
#endif
/* For debugging/testing. Verify the tree properties. */
void verifyIntegrity() const;
/* For debugging/testing. Verify the tree properties. */
void verifyIntegrity(Element *element, Element *parent) const;
};
/* For debugging/testing. Verify the tree properties. */
template <AVL_TEMPDEF> void AvlTreeVer<AVL_TEMPUSE>::
verifyIntegrity() const
{
Element *cur, *last;
/* Verify the properties of the element. */
verifyIntegrity(BaseTree::root, 0);
/* Make sure the element are connected in proper order. */
#ifdef WALKABLE
assert( BaseList::listLen == BaseTree::treeSize );
/* Walk the list of element, assert the ordering. */
if ( BaseTree::treeSize > 0 ) {
Element *prev = BaseList::head, *cur = BaseList::head->BASE_EL(next);
while ( cur != 0 ) {
assert( this->compare( prev->BASEKEY(getKey()),
cur->BASEKEY(getKey()) ) < 0 );
/* If there is no parent, then the element should be the root. */
if ( cur->BASE_EL(parent) == 0 )
assert( BaseTree::root == cur );
prev = cur;
cur = cur->BASE_EL(next);
}
}
#endif
/* Verify that the head is indeed the head. */
last = 0, cur = BaseList::head;
while ( cur != 0 ) {
assert( cur->BASE_EL(left) == last );
last = cur;
cur = cur->BASE_EL(parent);
}
/* Verify that the tail is indeed the tail. */
last = 0, cur = BaseList::tail;
while ( cur != 0 ) {
assert( cur->BASE_EL(right) == last );
last = cur;
cur = cur->BASE_EL(parent);
}
}
/* Verify the balance property of the avl tree Verify binary tree propery as
* well as parent/child pointers are correct. */
template <AVL_TEMPDEF> void AvlTreeVer<AVL_TEMPUSE>::
verifyIntegrity(Element *element, Element *parent) const
{
int lheight, rheight, balanceProp;
if ( element == 0 )
return;
lheight = element->BASE_EL(left) ?
element->BASE_EL(left)->BASE_EL(height) : 0;
rheight = element->BASE_EL(right) ?
element->BASE_EL(right)->BASE_EL(height) : 0;
balanceProp = lheight - rheight;
assert( -1 <= balanceProp && balanceProp <= 1 );
assert( element->BASE_EL(parent) == parent);
if ( element->BASE_EL(left) ) {
assert( this->compare( element->BASEKEY(getKey()),
element->BASE_EL(left)->BASEKEY(getKey()) ) > 0 );
}
if ( element->BASE_EL(right) ) {
assert( this->compare( element->BASEKEY(getKey()),
element->BASE_EL(right)->BASEKEY(getKey()) ) < 0 );
}
verifyIntegrity(element->BASE_EL(left), element);
verifyIntegrity(element->BASE_EL(right), element);
return;
}
/* namespace Aapl */
#ifdef AAPL_NAMESPACE
}
#endif
|
