Newer
Older
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
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
/*
* tree.hpp
*
* Created on: Jul 2, 2016
* Author: Jan Travnicek
*/
#ifndef __TREE_HPP_
#define __TREE_HPP_
namespace std {
template < class Data >
class BaseNode {
Data * parent;
template < class D, class CD, class C >
friend class NularyNode;
template < class D, class CD, class C >
friend class UnaryNode;
template < class D, class CD, class C >
friend class BinaryNode;
template < class D, class CD, class C >
friend class TernaryNode;
template < class D, int I, class CD, class C >
friend class AnyaryNode;
template < class D, class CD, class C >
friend class FixedaryNode;
template < class D, class CD, class C >
friend class VararyNode;
Data * operator ->( ) {
return static_cast < Data * > ( this );
}
const Data * operator ->( ) const {
return static_cast < Data * > ( this );
}
public:
BaseNode ( ) : parent ( nullptr ) {
}
virtual ~BaseNode ( ) noexcept {
}
BaseNode ( const BaseNode & ) : parent ( nullptr ) {
}
BaseNode ( BaseNode && ) noexcept : parent ( nullptr ) {
}
BaseNode & operator =( const BaseNode & ) {
return * this;
}
BaseNode & operator =( BaseNode && ) noexcept {
return * this;
}
Data * getParent ( ) {
return parent;
}
const Data * getParent ( ) const {
return parent;
}
};
template < class Data, class ConstData = Data, class Cast = Data >
class NularyNode {
public:
NularyNode ( ) {
}
};
template < class Data, class ConstData = Data, class Cast = Data >
class UnaryNode {
Data child;
public:
UnaryNode ( Data c ) : child ( std::move ( c ) ) {
child->parent = static_cast < Cast * > ( this );
}
virtual ~UnaryNode ( ) noexcept {
}
UnaryNode ( const UnaryNode & other ) : UnaryNode ( other.child ) {
}
UnaryNode ( UnaryNode && other ) noexcept : UnaryNode ( std::move ( other.child ) ) {
}
UnaryNode & operator =( const UnaryNode & other ) {
return * this = UnaryNode ( other );
}
UnaryNode & operator =( UnaryNode && other ) noexcept {
std::swap ( this->child, other.child );
child->parent = static_cast < Cast * > ( this );
return * this;
}
Data & getChild ( ) {
return child;
}
const ConstData & getChild ( ) const {
return child;
}
void setChild ( Data c ) {
child = std::move ( c );
child->parent = static_cast < Cast * > ( this );
}
};
template < class Data, class ConstData = Data, class Cast = Data >
class BinaryNode {
Data left;
Data right;
public:
BinaryNode ( Data l, Data r ) : left ( std::move ( l ) ), right ( std::move ( r ) ) {
left->parent = static_cast < Cast * > ( this );
right->parent = static_cast < Cast * > ( this );
}
virtual ~BinaryNode ( ) noexcept {
}
BinaryNode ( const BinaryNode & other ) : BinaryNode ( other.left, other.right ) {
}
BinaryNode ( BinaryNode && other ) noexcept : BinaryNode ( std::move ( other.left ), std::move ( other.right ) ) {
}
BinaryNode & operator =( const BinaryNode & other ) {
return * this = BinaryNode ( other );
}
BinaryNode & operator =( BinaryNode && other ) noexcept {
std::swap ( this->left, other.left );
std::swap ( this->right, other.right );
left->parent = static_cast < Cast * > ( this );
right->parent = static_cast < Cast * > ( this );
return * this;
}
Data & getLeft ( ) {
return left;
}
const ConstData & getLeft ( ) const {
return left;
}
void setLeft ( Data l ) {
left = std::move ( l );
left->parent = static_cast < Cast * > ( this );
}
Data & getRight ( ) {
return right;
}
const ConstData & getRight ( ) const {
return right;
}
void setRight ( Data r ) {
right = std::move ( r );
right->parent = static_cast < Cast * > ( this );
}
};
template < class Data, class ConstData = Data, class Cast = Data >
class TernaryNode {
Data first;
Data second;
Data third;
public:
TernaryNode ( Data f, Data s, Data t ) : first ( std::move ( f ) ), second ( std::move ( s ) ), third ( std::move ( t ) ) {
first->parent = static_cast < Cast * > ( this );
second->parent = static_cast < Cast * > ( this );
third->parent = static_cast < Cast * > ( this );
}
virtual ~TernaryNode ( ) noexcept {
}
TernaryNode ( const TernaryNode & other ) : TernaryNode ( other.first, other.second, other.third ) {
}
TernaryNode ( TernaryNode && other ) noexcept : TernaryNode ( std::move ( other.first ), std::move ( other.second ), std::move ( other.third ) ) {
}
TernaryNode & operator =( const TernaryNode & other ) {
return * this = TernaryNode ( other );
}
TernaryNode & operator =( TernaryNode && other ) noexcept {
std::swap ( this->first, other.first );
std::swap ( this->second, other.second );
std::swap ( this->third, other.third );
first->parent = static_cast < Cast * > ( this );
second->parent = static_cast < Cast * > ( this );
third->parent = static_cast < Cast * > ( this );
return * this;
}
Data & getFirst ( ) {
return first;
}
const ConstData & getFirst ( ) const {
return first;
}
void setFirst ( Data f ) {
first = std::move ( f );
first->parent = static_cast < Cast * > ( this );
}
Data & getSecond ( ) {
return second;
}
const ConstData & getSecond ( ) const {
return second;
}
void setSecond ( Data s ) {
second = std::move ( s );
second->parent = static_cast < Cast * > ( this );
}
Data & getThird ( ) {
return third;
}
const ConstData & getThird ( ) const {
return third;
}
void setThird ( Data t ) {
third = std::move ( t );
third->parent = static_cast < Cast * > ( this );
}
};
template < class Data, int arity, class ConstData = Data, class Cast = Data >
class AnyaryNode {
typename TupleBuilder < Data, arity >::type children;
template < std::size_t ... Indices >
void setParent ( std::index_sequence < Indices ... > ) {
( void ) std::initializer_list < Data * > { std::get < Indices > ( children )->parent = static_cast < Cast * > ( this ) ... };
}
public:
AnyaryNode ( typename TupleBuilder < Data, arity >::type children ) : children ( std::move ( children ) ) {
setParent ( std::make_index_sequence < arity > ( ) );
}
virtual ~AnyaryNode ( ) noexcept {
}
AnyaryNode ( const AnyaryNode & other ) : AnyaryNode ( other.children ) {
}
AnyaryNode ( AnyaryNode && other ) noexcept : AnyaryNode ( std::move ( other.children ) ) {
}
AnyaryNode & operator =( const AnyaryNode & other ) {
return * this = AnyaryNode ( other );
}
AnyaryNode & operator =( AnyaryNode && other ) noexcept {
std::swap ( this->children, other.children );
setParent ( std::make_index_sequence < arity > ( ) );
return * this;
}
const typename TupleBuilder < Data, arity >::type & getChildren ( ) {
return children;
}
const typename TupleBuilder < ConstData, arity >::type & getChildren ( ) const {
return reinterpret_cast < const typename TupleBuilder < ConstData, arity >::type & > ( children );
}
void setChildren ( typename TupleBuilder < Data, arity >::type children ) {
children = std::move ( children );
setParent ( std::make_index_sequence < arity > ( ) );
}
template < int N >
void setChildren ( Data d ) {
std::get < N > ( children ) = std::move ( d );
std::get < N > ( children )->parent = static_cast < Cast * > ( this );
}
};
template < class Data, class ConstData = Data, class Cast = Data >
class FixedaryNode {
std::vector < Data > children;
public:
FixedaryNode ( std::vector < Data > c ) : children ( std::move ( c ) ) {
for ( Data & child : children )
child->parent = static_cast < Cast * > ( this );
}
virtual ~FixedaryNode ( ) noexcept {
}
FixedaryNode ( const FixedaryNode & other ) : FixedaryNode ( other.children ) {
}
FixedaryNode ( FixedaryNode && other ) noexcept : FixedaryNode ( std::move ( other.children ) ) {
}
FixedaryNode & operator =( const FixedaryNode & other ) {
return * this = FixedaryNode ( other );
}
FixedaryNode & operator =( FixedaryNode && other ) noexcept {
std::swap ( this->children, other.children );
children->parent = static_cast < Cast * > ( this );
return * this;
}
const std::vector < Data > & getChildren ( ) {
return children;
}
const std::vector < ConstData > & getChildren ( ) const {
return reinterpret_cast < const std::vector < ConstData > & > ( children );
}
void setChildren ( std::vector < Data > c ) {
if ( c.size ( ) != children.size ( ) )
throw "Arity != size";
children = std::move ( c );
for ( Data & child : children )
child->parent = static_cast < Cast * > ( this );
}
void setChild ( Data d, int index ) {
if ( children.size ( ) >= index )
throw "Index out of bounds";
children[index] = std::move ( d );
children[index]->parent = static_cast < Cast * > ( this );
}
};
template < class Data, class ConstData = Data, class Cast = Data >
class VararyNode {
std::vector < Data > children;
public:
VararyNode ( std::vector < Data > c ) : children ( std::move ( c ) ) {
for ( Data & child : children )
child->parent = static_cast < Cast * > ( this );
}
virtual ~VararyNode ( ) noexcept {
}
VararyNode ( const VararyNode & other ) : VararyNode ( other.children ) {
}
VararyNode ( VararyNode && other ) noexcept : VararyNode ( std::move ( other.children ) ) {
}
VararyNode & operator =( const VararyNode & other ) {
return * this = VararyNode ( other );
}
VararyNode & operator =( VararyNode && other ) noexcept {
std::swap ( this->children, other.children );
children->parent = static_cast < Cast * > ( this );
return * this;
}
const std::vector < Data > & getChildren ( ) {
return children;
}
const std::vector < ConstData > & getChildren ( ) const {
return reinterpret_cast < const std::vector < ConstData > & > ( children );
}
void setChildren ( std::vector < Data > c ) {
children = std::move ( c );
for ( Data & child : children )
child->parent = static_cast < Cast * > ( this );
}
void setChild ( Data d, int index ) {
children[index] = std::move ( d );
children[index]->parent = static_cast < Cast * > ( this );
}
void pushBackChild ( Data d ) {
children.push_back ( std::move ( d ) );
children[children.size ( ) - 1]->parent = static_cast < Cast * > ( this );
}
};
template < class Data, class ConstData, class Cast >
class Tree {
public:
static void setChild ( const UnaryNode < Data, ConstData, Cast > & node, Data child ) {
const_cast < UnaryNode < Data, ConstData, Cast > & > ( node ).setChild ( std::move ( child ) );
}
static void setLeft ( const BinaryNode < Data, ConstData, Cast > & node, Data child ) {
const_cast < BinaryNode < Data, ConstData, Cast > & > ( node ).setLeft ( std::move ( child ) );
}
static void setRight ( const BinaryNode < Data, ConstData, Cast > & node, Data child ) {
const_cast < BinaryNode < Data, ConstData, Cast > & > ( node ).setRight ( std::move ( child ) );
}
static void setFirst ( const TernaryNode < Data, ConstData, Cast > & node, Data child ) {
const_cast < TernaryNode < Data, ConstData, Cast > & > ( node ).setFirst ( std::move ( child ) );
}
static void setSecond ( const TernaryNode < Data, ConstData, Cast > & node, Data child ) {
const_cast < TernaryNode < Data, ConstData, Cast > & > ( node ).setSecond ( std::move ( child ) );
}
static void setThird ( const TernaryNode < Data, ConstData, Cast > & node, Data child ) {
const_cast < TernaryNode < Data, ConstData, Cast > & > ( node ).setThird ( std::move ( child ) );
}
template < int arity >
static void setChildren ( const AnyaryNode < Data, arity, ConstData, Cast > & node, typename TupleBuilder < Data, arity >::type children ) {
const_cast < AnyaryNode < Data, arity, ConstData, Cast > & > ( node ).setChildren ( std::move ( children ) );
}
template < class N, int arity >
static void setChild ( const AnyaryNode < Data, arity, ConstData, Cast > & node, Data child ) {
const_cast < AnyaryNode < Data, arity, ConstData, Cast > & > ( node ).template setChild < N > ( std::move ( child ) );
}
static void setChildren ( const FixedaryNode < Data, ConstData, Cast > & node, std::vector < Data > child ) {
const_cast < FixedaryNode < Data, ConstData, Cast > & > ( node ).setChildren ( std::move ( child ) );
}
static void setChild ( const FixedaryNode < Data, ConstData, Cast > & node, Data child, int index ) {
const_cast < FixedaryNode < Data, ConstData, Cast > & > ( node ).setChild ( std::move ( child ), index );
}
static void setChildren ( const VararyNode < Data, ConstData, Cast > & node, std::vector < Data > children ) {
const_cast < VararyNode < Data, ConstData, Cast > & > ( node ).setChildren ( std::move ( children ) );
}
static void setChild ( const VararyNode < Data, ConstData, Cast > & node, Data child, int index ) {
const_cast < VararyNode < Data, ConstData, Cast > & > ( node ).setChild ( std::move ( child ), index );
}
static void pushBackChild ( const VararyNode < Data, ConstData, Cast > & node, Data child ) {
const_cast < VararyNode < Data, ConstData, Cast > & > ( node ).pushBackChild ( std::move ( child ) );
}
};
} /* namespace std */
#endif /* __TREE_HPP_ */