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
|
/* -*- 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 .
*/
#ifndef ARY_NAMETREENODE_HXX
#define ARY_NAMETREENODE_HXX
// KORR_DEPRECATED_3.0
// Replace by ::ary::symtree::Node.
// USED SERVICES
#include <cosv/tpl/tpltools.hxx>
#include <sci_impl.hxx>
// HACK because of SunPro 5.2 compiler bug with templates:
#include <ary/idl/i_module.hxx>
namespace ary
{
/** Implementation of a node in a namespace-tree.
*/
template<class ITEM_ID>
class NameTreeNode
{
public:
typedef NameTreeNode self;
typedef ITEM_ID item_id;
typedef StringVector::const_iterator name_iterator;
typedef std::map<String, item_id> Map_LocalNames;
// LIFECYCLE
NameTreeNode();
NameTreeNode(
const String & i_sName,
const self & i_rParent,
ITEM_ID i_nParentId );
virtual ~NameTreeNode();
// OPERATIONS
void Add_Name(
const String & i_sName,
item_id i_nId );
// INQUIRY
const String & Name() const { return Depth() > 0 ? aCompleteNameChain.back() : String::Null_(); }
item_id Parent() const { return nParent; }
intt Depth() const { return aCompleteNameChain.size(); }
bool IsEquivalent(
const NameTreeNode &
i_rNode ) const;
name_iterator NameChain_Begin() const { return aCompleteNameChain.begin(); }
name_iterator NameChain_End() const { return aCompleteNameChain.end(); }
item_id Search_Name(
const String & i_sName ) const;
void Get_Names(
Dyn_StdConstIterator<ITEM_ID> &
o_rResult ) const;
const Map_LocalNames &
LocalNames() const { return aLocalNames; }
private:
// Locals
Map_LocalNames & LocalNames() { return aLocalNames; }
// DATA
Map_LocalNames aLocalNames;
StringVector aCompleteNameChain;
item_id nParent;
};
// IMPLEMENTATION
template<class ITEM_ID>
NameTreeNode<ITEM_ID>::NameTreeNode()
: aLocalNames(),
aCompleteNameChain(),
nParent(0)
{
}
template<class ITEM_ID>
NameTreeNode<ITEM_ID>::NameTreeNode( const String & i_sName,
const self & i_rParent,
ITEM_ID i_nParentId )
: aLocalNames(),
aCompleteNameChain(),
nParent(i_nParentId)
{
aCompleteNameChain.reserve(i_rParent.Depth()+1);
for ( name_iterator it = i_rParent.NameChain_Begin();
it != i_rParent.NameChain_End();
++it )
{
aCompleteNameChain.push_back(*it);
}
aCompleteNameChain.push_back(i_sName);
}
template<class ITEM_ID>
NameTreeNode<ITEM_ID>::~NameTreeNode()
{
}
template<class ITEM_ID>
inline void
NameTreeNode<ITEM_ID>::Add_Name( const String & i_sName,
item_id i_nId )
{
LocalNames().insert( typename Map_LocalNames::value_type(i_sName, i_nId) );
}
template<class ITEM_ID>
inline bool
NameTreeNode<ITEM_ID>::IsEquivalent( const NameTreeNode & i_rNode ) const
{
return aCompleteNameChain == i_rNode.aCompleteNameChain;
}
template<class ITEM_ID>
inline ITEM_ID
NameTreeNode<ITEM_ID>::Search_Name( const String & i_sName ) const
{
return csv::value_from_map(LocalNames(),i_sName, ITEM_ID(0));
}
template<class ITEM_ID>
inline void
NameTreeNode<ITEM_ID>::Get_Names( Dyn_StdConstIterator<ITEM_ID> & o_rResult ) const
{
o_rResult = new SCI_DataInMap<String,item_id>(LocalNames());
}
// HACK because of SunPro 5.2 compiler bug with templates:
// ary::idl::Module has to be "FIND_NODE::node_type"
// must be solved later somehow.
template <class FIND_NODE>
typename FIND_NODE::id_type
Search_SubTree( const ary::idl::Module & i_rStart,
const FIND_NODE & i_rNodeFinder )
{
const ary::idl::Module *
ret = &i_rStart;
for ( StringVector::const_iterator it = i_rNodeFinder.Begin();
it != i_rNodeFinder.End() AND ret != 0;
++it )
{
ret = i_rNodeFinder(ret->Search_Name(*it));
}
typename FIND_NODE::id_type nret(0);
return ret != 0
? ret->Search_Name(i_rNodeFinder.Name2Search())
: nret;
}
template <class FIND_NODE>
typename FIND_NODE::id_type
Search_SubTree_UpTillRoot( const ary::idl::Module & i_rStart,
const FIND_NODE & i_rNodeFinder )
{
typename FIND_NODE::id_type
ret(0);
for ( const ary::idl::Module * start = &i_rStart;
start != 0 AND NOT ret.IsValid();
start = i_rNodeFinder(start->Owner()) )
{
ret = Search_SubTree( *start,
i_rNodeFinder );
}
return ret;
}
// END Hack for SunPro 5.2 compiler bug.
} // namespace ary
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|