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
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
|
// -*- C++ -*-
// Copyright (C) 2005 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 2, or (at your option)
// any later version.
// This 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 General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING. If not, write to the Free
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
// USA.
// As a special exception, you may use this file as part of a free software
// library without restriction. Specifically, if other files instantiate
// templates or use macros or inline functions from this file, or you compile
// this file and link it with other files to produce an executable, this
// file does not by itself cause the resulting executable to be covered by
// the GNU General Public License. This exception does not however
// invalidate any other reasons why the executable file might be covered by
// the GNU General Public License.
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
// Permission to use, copy, modify, sell, and distribute this software
// is hereby granted without fee, provided that the above copyright
// notice appears in all copies, and that both that copyright notice and
// this permission notice appear in supporting documentation. None of
// the above authors, nor IBM Haifa Research Laboratories, make any
// representation about the suitability of this software for any
// purpose. It is provided "as is" without express or implied warranty.
/**
* @file splay_fn_imps.hpp
* Contains an implementation class for splay_tree_.
*/
PB_ASSOC_CLASS_T_DEC
void
PB_ASSOC_CLASS_C_DEC::
splay(node_pointer p_nd)
{
while (p_nd->m_p_parent != PB_ASSOC_BASE_C_DEC::m_p_head)
{
PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_node_consistent(p_nd);)
if (p_nd->m_p_parent->m_p_parent ==
PB_ASSOC_BASE_C_DEC::m_p_head)
{
PB_ASSOC_BASE_C_DEC::rotate_parent(p_nd);
PB_ASSOC_DBG_ASSERT(p_nd ==
PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent);
}
else
{
const node_pointer p_parent = p_nd->m_p_parent;
const node_pointer p_grandparent = p_parent->m_p_parent;
#ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
const size_type total =
PB_ASSOC_BASE_C_DEC::recursive_count(p_grandparent);
PB_ASSOC_DBG_ASSERT(total >= 3);
#endif // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
if (p_parent->m_p_left == p_nd&&
p_grandparent->m_p_right == p_parent)
splay_zig_zag_left(p_nd, p_parent, p_grandparent);
else if (p_parent->m_p_right == p_nd&&
p_grandparent->m_p_left == p_parent)
splay_zig_zag_right(p_nd, p_parent, p_grandparent);
else if (p_parent->m_p_left == p_nd&&
p_grandparent->m_p_left == p_parent)
splay_zig_zig_left(p_nd, p_parent, p_grandparent);
else
splay_zig_zig_right(p_nd, p_parent, p_grandparent);
PB_ASSOC_DBG_ASSERT(total ==
PB_ASSOC_BASE_C_DEC::recursive_count(p_nd));
}
PB_ASSOC_DBG_ONLY(assert_node_consistent(p_nd);)
}
}
PB_ASSOC_CLASS_T_DEC
inline void
PB_ASSOC_CLASS_C_DEC::
splay_zig_zag_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
{
PB_ASSOC_DBG_ASSERT(p_parent == p_nd->m_p_parent);
PB_ASSOC_DBG_ASSERT(p_grandparent == p_parent->m_p_parent);
PB_ASSOC_DBG_ONLY(assert_node_consistent(p_grandparent);)
PB_ASSOC_DBG_ASSERT(p_parent->m_p_left == p_nd&&
p_grandparent->m_p_right == p_parent);
splay_zz_start(p_nd, p_parent, p_grandparent);
node_pointer p_b = p_nd->m_p_right;
node_pointer p_c = p_nd->m_p_left;
p_nd->m_p_right = p_parent;
p_parent->m_p_parent = p_nd;
p_nd->m_p_left = p_grandparent;
p_grandparent->m_p_parent = p_nd;
p_parent->m_p_left = p_b;
if (p_b != NULL)
p_b->m_p_parent = p_parent;
p_grandparent->m_p_right = p_c;
if (p_c != NULL)
p_c->m_p_parent = p_grandparent;
splay_zz_end(p_nd, p_parent, p_grandparent);
}
PB_ASSOC_CLASS_T_DEC
inline void
PB_ASSOC_CLASS_C_DEC::
splay_zig_zag_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
{
PB_ASSOC_DBG_ASSERT(p_parent == p_nd->m_p_parent);
PB_ASSOC_DBG_ASSERT(p_grandparent == p_parent->m_p_parent);
PB_ASSOC_DBG_ONLY(assert_node_consistent(p_grandparent);)
PB_ASSOC_DBG_ASSERT(p_parent->m_p_right == p_nd&&
p_grandparent->m_p_left == p_parent);
splay_zz_start(p_nd, p_parent, p_grandparent);
node_pointer p_b = p_nd->m_p_left;
node_pointer p_c = p_nd->m_p_right;
p_nd->m_p_left = p_parent;
p_parent->m_p_parent = p_nd;
p_nd->m_p_right = p_grandparent;
p_grandparent->m_p_parent = p_nd;
p_parent->m_p_right = p_b;
if (p_b != NULL)
p_b->m_p_parent = p_parent;
p_grandparent->m_p_left = p_c;
if (p_c != NULL)
p_c->m_p_parent = p_grandparent;
splay_zz_end(p_nd, p_parent, p_grandparent);
}
PB_ASSOC_CLASS_T_DEC
inline void
PB_ASSOC_CLASS_C_DEC::
splay_zig_zig_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
{
PB_ASSOC_DBG_ASSERT(p_parent == p_nd->m_p_parent);
PB_ASSOC_DBG_ASSERT(p_grandparent == p_parent->m_p_parent);
PB_ASSOC_DBG_ONLY(assert_node_consistent(p_grandparent);)
PB_ASSOC_DBG_ASSERT(p_parent->m_p_left == p_nd&&
p_nd->m_p_parent->m_p_parent->m_p_left == p_nd->m_p_parent);
splay_zz_start(p_nd, p_parent, p_grandparent);
node_pointer p_b = p_nd->m_p_right;
node_pointer p_c = p_parent->m_p_right;
p_nd->m_p_right = p_parent;
p_parent->m_p_parent = p_nd;
p_parent->m_p_right = p_grandparent;
p_grandparent->m_p_parent = p_parent;
p_parent->m_p_left = p_b;
if (p_b != NULL)
p_b->m_p_parent = p_parent;
p_grandparent->m_p_left = p_c;
if (p_c != NULL)
p_c->m_p_parent = p_grandparent;
splay_zz_end(p_nd, p_parent, p_grandparent);
}
PB_ASSOC_CLASS_T_DEC
inline void
PB_ASSOC_CLASS_C_DEC::
splay_zig_zig_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
{
PB_ASSOC_DBG_ASSERT(p_parent == p_nd->m_p_parent);
PB_ASSOC_DBG_ASSERT(p_grandparent == p_parent->m_p_parent);
PB_ASSOC_DBG_ONLY(assert_node_consistent(p_grandparent);)
PB_ASSOC_DBG_ASSERT(p_parent->m_p_right == p_nd&&
p_nd->m_p_parent->m_p_parent->m_p_right == p_nd->m_p_parent);
splay_zz_start(p_nd, p_parent, p_grandparent);
node_pointer p_b = p_nd->m_p_left;
node_pointer p_c = p_parent->m_p_left;
p_nd->m_p_left = p_parent;
p_parent->m_p_parent = p_nd;
p_parent->m_p_left = p_grandparent;
p_grandparent->m_p_parent = p_parent;
p_parent->m_p_right = p_b;
if (p_b != NULL)
p_b->m_p_parent = p_parent;
p_grandparent->m_p_right = p_c;
if (p_c != NULL)
p_c->m_p_parent = p_grandparent;
PB_ASSOC_BASE_C_DEC::update_to_top(
p_grandparent, (Node_Updator* )this);
splay_zz_end(p_nd, p_parent, p_grandparent);
}
PB_ASSOC_CLASS_T_DEC
inline void
PB_ASSOC_CLASS_C_DEC::
splay_zz_start(node_pointer p_nd,
#ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
node_pointer p_parent,
#else // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
node_pointer /*p_parent*/,
#endif // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
node_pointer p_grandparent)
{
PB_ASSOC_DBG_ASSERT(p_nd != NULL);
PB_ASSOC_DBG_ASSERT(p_parent != NULL);
PB_ASSOC_DBG_ASSERT(p_grandparent != NULL);
const bool grandparent_head =
p_grandparent->m_p_parent == PB_ASSOC_BASE_C_DEC::m_p_head;
if (grandparent_head)
{
PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent =
PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent;
p_nd->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
return;
}
node_pointer p_greatgrandparent = p_grandparent->m_p_parent;
p_nd->m_p_parent = p_greatgrandparent;
if (p_grandparent == p_greatgrandparent->m_p_left)
p_greatgrandparent->m_p_left = p_nd;
else
p_greatgrandparent->m_p_right = p_nd;
}
PB_ASSOC_CLASS_T_DEC
inline void
PB_ASSOC_CLASS_C_DEC::
splay_zz_end(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
{
if (p_nd->m_p_parent == PB_ASSOC_BASE_C_DEC::m_p_head)
PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_nd;
apply_update(p_grandparent, (Node_Updator* )this);
apply_update(p_parent, (Node_Updator* )this);
apply_update(p_nd, (Node_Updator* )this);
PB_ASSOC_DBG_ONLY(assert_node_consistent(p_nd);)
}
|
