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
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
|
// -*- 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_tree_.hpp
* Contains an implementation class for splay_tree_.
*/
#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
#ifndef BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
#define BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
#include <ext/pb_assoc/detail/bin_search_tree_/bin_search_tree_.hpp>
#endif // #ifndef BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
#ifndef BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
#define BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
#include <ext/pb_assoc/detail/bin_search_tree_/bin_search_tree_.hpp>
#endif // #ifndef BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
#include <ext/pb_assoc/detail/splay_tree_/node.hpp>
#include <utility>
#include <vector>
#include <assert.h>
namespace pb_assoc
{
namespace detail
{
#ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
#define PB_ASSOC_DBG_ASSERT(X) assert(X)
#define PB_ASSOC_DBG_VERIFY(X) assert(X)
#define PB_ASSOC_DBG_ONLY(X) X
#else // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
#define PB_ASSOC_DBG_ASSERT(X)
#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
#define PB_ASSOC_DBG_ONLY(X) ;
#endif // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
#define PB_ASSOC_CLASS_T_DEC \
template< \
typename Key, \
typename Data, \
class Cmp_Fn, \
class Allocator, \
class Node_Updator>
#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
#define PB_ASSOC_CLASS_NAME \
splay_tree_data_
#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
#define PB_ASSOC_CLASS_NAME \
splay_tree_no_data_
#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
#define PB_ASSOC_BASE_CLASS_NAME \
bin_search_tree_data_
#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
#define PB_ASSOC_BASE_CLASS_NAME \
bin_search_tree_no_data_
#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
#define PB_ASSOC_CLASS_C_DEC \
PB_ASSOC_CLASS_NAME< \
Key, \
Data, \
Cmp_Fn, \
Allocator, \
Node_Updator>
#define PB_ASSOC_TYPES_TRAITS_C_DEC \
types_traits< \
Key, \
Data, \
Allocator>
#define PB_ASSOC_NODE_C_DEC \
splay_tree_node_< \
typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type, \
Allocator>
#define PB_ASSOC_BASE_C_DEC \
PB_ASSOC_BASE_CLASS_NAME< \
Key, \
Data, \
PB_ASSOC_NODE_C_DEC, \
Cmp_Fn, \
Allocator, \
Node_Updator>
template<typename Key,
typename Data,
class Cmp_Fn,
class Allocator,
class Node_Updator>
struct PB_ASSOC_CLASS_NAME : public PB_ASSOC_BASE_C_DEC
{
protected:
typedef typename Allocator::size_type size_type;
typedef
typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_key_reference
const_key_reference;
typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_type data_type;
typedef
typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_reference
data_reference;
typedef
typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_data_reference
const_data_reference;
typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type value_type;
typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::pointer pointer;
typedef
typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_pointer
const_pointer;
typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::reference reference;
typedef
typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_reference
const_reference;
typedef typename PB_ASSOC_BASE_C_DEC::node_pointer node_pointer;
typedef typename PB_ASSOC_BASE_C_DEC::find_iterator find_iterator;
typedef
typename PB_ASSOC_BASE_C_DEC::const_iterator
const_find_iterator;
typedef typename PB_ASSOC_BASE_C_DEC::iterator iterator;
typedef typename PB_ASSOC_BASE_C_DEC::const_iterator const_iterator;
typedef
typename PB_ASSOC_BASE_C_DEC::reverse_iterator
reverse_iterator;
typedef
typename PB_ASSOC_BASE_C_DEC::const_reverse_iterator
const_reverse_iterator;
protected:
PB_ASSOC_CLASS_NAME();
PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn);
PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const Node_Updator& r_node_updator);
PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other);
void
swap(PB_ASSOC_CLASS_C_DEC& r_other);
template<class It>
void
copy_from_range(It first_it, It last_it);
void
initialize();
inline std::pair<find_iterator, bool>
insert(const_reference r_value);
#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
inline data_reference
subscript_imp(const_key_reference r_key);
#endif // #ifdef PB_ASSOC_DATA_TRUE
inline find_iterator
lower_bound(const_key_reference r_key);
inline const_find_iterator
lower_bound(const_key_reference r_key) const;
inline find_iterator
upper_bound(const_key_reference r_key);
inline const_find_iterator
upper_bound(const_key_reference r_key) const;
inline find_iterator
find(const_key_reference r_key);
inline const_find_iterator
find(const_key_reference r_key) const;
inline size_type
erase(const_key_reference r_key);
inline const_iterator
erase(const_iterator it);
#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
inline iterator
erase(iterator it);
#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
inline const_reverse_iterator
erase(const_reverse_iterator it);
#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
inline reverse_iterator
erase(reverse_iterator it);
#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
template<class Pred>
inline size_type
erase_if(Pred pred);
inline node_pointer
leftmost(node_pointer p_nd);
void
join(PB_ASSOC_CLASS_C_DEC& r_other);
void
split(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other);
#ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
virtual void
assert_valid() const;
void
assert_special_imp(const node_pointer p_nd) const;
#endif // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
private:
void
splay(node_pointer p_nd);
inline void
splay_zig_zag_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
inline void
splay_zig_zag_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
inline void
splay_zig_zig_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
inline void
splay_zig_zig_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
inline void
splay_zz_start(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
inline void
splay_zz_end(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
void
erase_node(node_pointer p_nd);
};
#include <ext/pb_assoc/detail/splay_tree_/constructors_destructor_fn_imps.hpp>
#include <ext/pb_assoc/detail/splay_tree_/info_fn_imps.hpp>
#include <ext/pb_assoc/detail/splay_tree_/insert_fn_imps.hpp>
#include <ext/pb_assoc/detail/splay_tree_/splay_fn_imps.hpp>
#include <ext/pb_assoc/detail/splay_tree_/erase_fn_imps.hpp>
#include <ext/pb_assoc/detail/splay_tree_/find_fn_imps.hpp>
#include <ext/pb_assoc/detail/splay_tree_/debug_fn_imps.hpp>
#include <ext/pb_assoc/detail/splay_tree_/split_join_fn_imps.hpp>
#undef PB_ASSOC_CLASS_T_DEC
#undef PB_ASSOC_CLASS_C_DEC
#undef PB_ASSOC_CLASS_NAME
#undef PB_ASSOC_TYPES_TRAITS_C_DEC
#undef PB_ASSOC_BASE_CLASS_NAME
#undef PB_ASSOC_NODE_C_DEC
#undef PB_ASSOC_BASE_C_DEC
#undef PB_ASSOC_DBG_ASSERT
#undef PB_ASSOC_DBG_VERIFY
#undef PB_ASSOC_DBG_ONLY
} // namespace detail
} // namespace pb_assoc
|
