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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you 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 .
*/
#include <precomp.h>
#include <toolkit/out_node.hxx>
// NOT FULLY DEFINED SERVICES
#include <algorithm>
namespace output
{
namespace
{
struct Less_NodePtr
{
bool operator()(
Node * p1,
Node * p2 ) const
{ return p1->Name() < p2->Name(); }
};
struct Less_NodePtr C_Less_NodePtr;
Node C_aNullNode(Node::null_object);
} // namepace anonymous
//********************** Node ***************************//
Node::Node()
: sName(),
pParent(0),
aChildren(),
nDepth(0),
nNameRoomId(0)
{
}
Node::Node( E_NullObject )
: sName(),
pParent(0),
aChildren(),
nDepth(-1),
nNameRoomId(0)
{
}
Node::Node(
const String & i_name,
Node & i_parent
) :
sName(i_name),
pParent(&i_parent),
aChildren(),
nDepth(i_parent.Depth()+1),
nNameRoomId(0)
{
}
Node::~Node()
{
for ( NodeList::iterator it = aChildren.begin();
it != aChildren.end();
++it )
{
delete *it;
}
}
Node& Node::Provide_Child( const String & i_name )
{
Node* ret = find_Child(i_name);
if (ret != 0)
return *ret;
return add_Child(i_name);
}
void Node::Get_Path(
StreamStr& o_result,
intt i_maxDepth
) const
{
// Intentionally 'i_maxDepth != 0', so max_Depth == -1 sets no limit:
if (i_maxDepth != 0)
{
if (pParent != 0)
pParent->Get_Path(o_result, i_maxDepth-1);
o_result << sName << '/';
}
}
void Node::Get_Chain(
StringVector & o_result,
intt i_maxDepth
) const
{
if (i_maxDepth != 0)
{
// This is called also for the toplevel Node,
// but there happens nothing:
if (pParent != 0)
{
pParent->Get_Chain(o_result, i_maxDepth-1);
o_result.push_back(sName);
}
}
}
Node* Node::find_Child( const String & i_name )
{
Node aSearch;
aSearch.sName = i_name;
NodeList::const_iterator
ret = std::lower_bound( aChildren.begin(),
aChildren.end(),
&aSearch,
C_Less_NodePtr );
if ( ret != aChildren.end() ? (*ret)->Name() == i_name : false )
return *ret;
return 0;
}
Node& Node::add_Child( const String & i_name )
{
DYN Node* pNew = new Node(i_name,*this);
aChildren.insert( std::lower_bound( aChildren.begin(),
aChildren.end(),
pNew,
C_Less_NodePtr ),
pNew );
return *pNew;
}
Node& Node::provide_Child(
StringVector::const_iterator i_next,
StringVector::const_iterator i_end
)
{
if (i_next == i_end)
return *this;
return Provide_Child(*i_next).provide_Child(i_next+1,i_end);
}
Node& Node::Null_()
{
return C_aNullNode;
}
} // namespace output
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
