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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: hi_ary.cxx,v $
* $Revision: 1.7 $
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#include <precomp.h>
#include "hi_ary.hxx"
// NOT FULLY DEFINED SERVICES
#include <cosv/ploc_dir.hxx>
#include <ary/idl/i_gate.hxx>
#include <ary/idl/i_module.hxx>
#include <ary/idl/i_ce.hxx>
#include <ary/idl/i_type.hxx>
#include <ary/idl/ip_ce.hxx>
#include <ary/idl/ip_type.hxx>
inline const ary::idl::Gate &
AryAccess::gate() const
{ return rGate; }
inline const ary::idl::CePilot &
AryAccess::ces() const
{ return rGate.Ces(); }
inline const ary::idl::TypePilot &
AryAccess::types() const
{ return rGate.Types(); }
inline const ary::idl::Module *
AryAccess::find_SubModule( const ary::idl::Module & i_parent,
const String & i_name ) const
{
ary::idl::Ce_id
nModule = i_parent.Search_Name(i_name);
return ces().Search_Module(nModule);
}
bool
AryAccess::nextName( const char * & io_TextPtr,
String & o_name ) const
{
if ( strncmp(io_TextPtr,"::", 2) == 0 )
io_TextPtr += 2;
const char * pEnd = strchr(io_TextPtr,':');
size_t nLen = pEnd == 0
? strlen(io_TextPtr)
: pEnd - io_TextPtr;
o_name.assign(io_TextPtr, nLen);
io_TextPtr += nLen;
return nLen > 0;
}
AryAccess::AryAccess( const ary::idl::Gate & i_rGate )
: rGate(i_rGate)
{
}
const ary::idl::Module &
AryAccess::GlobalNamespace() const
{
return ces().GlobalNamespace();
}
const ary::idl::Module &
AryAccess::Find_Module( ary::idl::Ce_id i_ce ) const
{
return ces().Find_Module(i_ce);
}
const ary::idl::CodeEntity &
AryAccess::Find_Ce( ary::idl::Ce_id i_ce ) const
{
return ces().Find_Ce(i_ce);
}
const ary::idl::Type &
AryAccess::Find_Type( ary::idl::Type_id i_type ) const
{
return types().Find_Type(i_type);
}
ary::idl::Ce_id
AryAccess::CeFromType( ary::idl::Type_id i_type ) const
{
return types().Search_CeRelatedTo(i_type);
}
bool
AryAccess::IsBuiltInOrRelated( const ary::idl::Type & i_type ) const
{
return types().IsBuiltInOrRelated(i_type);
}
bool
AryAccess::Search_Ce( StringVector & o_module,
String & o_mainEntity,
String & o_memberEntity,
const char * i_sText,
const ary::idl::Module & i_referingScope ) const
{
o_module.erase(o_module.begin(),o_module.end());
o_mainEntity = String::Null_();
o_memberEntity = String::Null_();
const ary::idl::Module * pModule = 0;
if ( strncmp(i_sText, "::", 2) == 0
OR strncmp(i_sText, "com::sun::star", 14) == 0 )
pModule = &GlobalNamespace();
else
{
pModule = &i_referingScope;
ces().Get_Text(o_module, o_mainEntity, o_memberEntity, *pModule);
}
const char * pNext = i_sText;
String sNextName;
// Find Module:
while ( nextName(pNext, sNextName) )
{
const ary::idl::Module *
pSub = find_SubModule(*pModule, sNextName);
if (pSub != 0)
{
pModule = pSub;
o_module.push_back(sNextName);
}
else
break;
}
// Find main CodeEntity:
if ( sNextName.length() == 0 )
return true;
const ary::idl::Ce_id
nCe = pModule->Search_Name(sNextName);
if (NOT nCe.IsValid())
return false;
o_mainEntity = sNextName;
// Find member:
if ( *pNext == 0 )
return true;
nextName(pNext, o_memberEntity);
if (strchr(o_memberEntity,':') != 0)
return false; // This must not happen in IDL
#if 0
// The following code avoids false links, but is rather expensive
// in runtime time consumation.
const ary::idl::CodeEntity *
pCe = Find_Ce(nCe);
if (pCe == 0)
return false;
if ( NOT ary::idl::ifc_ce::attr::Search_Member(*pCe,o_memberEntity) )
return false;
#endif
return true;
}
bool
AryAccess::Search_CesModule( StringVector & o_module,
const String & i_scope,
const String & i_ce,
const ary::idl::Module & i_referingScope ) const
{
o_module.erase(o_module.begin(),o_module.end());
const ary::idl::Module *
pModule = 0;
if ( strncmp(i_scope, "::", 2) == 0
OR strncmp(i_scope, "com::sun::star", 14) == 0 )
pModule = &GlobalNamespace();
else
{
pModule = &i_referingScope;
static String Dummy1;
static String Dummy2;
ces().Get_Text(o_module, Dummy1, Dummy2, *pModule);
}
const char * pNext = i_scope;
String sNextName;
// Find Module:
while ( nextName(pNext, sNextName) )
{
const ary::idl::Module *
pSub = find_SubModule(*pModule, sNextName);
if (pSub != 0)
{
pModule = pSub;
o_module.push_back(sNextName);
}
else
return false;
} // end while
return pModule->Search_Name(i_ce).IsValid();
}
const ary::idl::Module *
AryAccess::Search_Module( const StringVector & i_nameChain ) const
{
const ary::idl::Module * ret =
&GlobalNamespace();
for ( StringVector::const_iterator it = i_nameChain.begin();
it != i_nameChain.end();
++it )
{
ret = find_SubModule(*ret, *it);
if (ret == 0)
break;
} // end for
return ret;
}
void
AryAccess::Get_CeText( StringVector & o_module,
String & o_ce,
String & o_member,
const ary::idl::CodeEntity & i_ce ) const
{
ces().Get_Text(o_module, o_ce, o_member, i_ce);
}
void
AryAccess::Get_TypeText( StringVector & o_module,
String & o_sCe,
ary::idl::Ce_id & o_nCe,
int & o_sequenceCount,
const ary::idl::Type & i_type ) const
{
i_type.Get_Text(o_module, o_sCe, o_nCe, o_sequenceCount, gate());
}
void
AryAccess::Get_IndexData( std::vector<ary::idl::Ce_id> & o_data,
ary::idl::alphabetical_index::E_Letter i_letter ) const
{
rGate.Ces().Get_AlphabeticalIndex(o_data, i_letter);
}
const ary::idl::CePilot &
AryAccess::Ces() const
{
return rGate.Ces();
}
|
