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
|
/****************************************************************************
* Copyright (C) from 2009 to Present EPAM Systems.
*
* This file is part of Indigo toolkit.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
***************************************************************************/
#ifndef __tree_h__
#define __tree_h__
#include "non_copyable.h"
#include "obj_array.h"
namespace indigo
{
class Tree : public NonCopyable
{
public:
explicit Tree(int label)
{
this->label = label;
}
Tree() : Tree(-1)
{
}
void insert(int label, int parent)
{
Tree* present = _find(parent);
if (present != nullptr)
{
present->_insert(label);
}
else
{
_insert(parent)._insert(label);
}
}
void insert(int label)
{
insert(label, -1);
}
ObjArray<Tree>& children()
{
return _children;
}
inline const ObjArray<Tree>& children() const
{
return _children;
}
int label;
inline Tree* find(int label)
{
return _find(label);
}
protected:
Tree& _insert(int label)
{
return _children.push(label);
}
Tree* _find(int label)
{
if (this->label == label)
{
return this;
}
for (auto i = 0; i < _children.size(); i++)
{
Tree& child = _children[i];
if (child.label == label)
{
return &child;
}
Tree* deeper = child._find(label);
if (deeper != nullptr)
{
return deeper;
}
}
return nullptr;
}
ObjArray<Tree> _children;
};
} // namespace indigo
#endif
|
