blob: 0e102921872d8e596f21c72568697eb7d9265a22 (
plain)
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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* 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.
*
************************************************************************/
#ifndef INCLUDED_SHARABLE_NODE_HXX
#define INCLUDED_SHARABLE_NODE_HXX
#include "rtl/ustring.hxx"
#include "flags.hxx"
#include "anydata.hxx"
namespace configmgr
{
//-----------------------------------------------------------------------------
namespace node { struct Attributes; }
//-----------------------------------------------------------------------------
namespace sharable
{
struct TreeFragment;
union Node;
//-----------------------------------------------------------------------------
struct NodeInfo
{
rtl_uString * name;
sal_uInt16 parent; // always counts backwards
sal_uInt8 flags;
sal_uInt8 type; // contains discriminator for union
rtl::OUString getName() const;
node::Attributes getNodeInfoAttributes() const;
bool isDefault() const;
bool isLocalized() const;
void markAsDefault(bool bDefault = true);
};
//-----------------------------------------------------------------------------
struct GroupNode
{
NodeInfo info;
sal_uInt16 numDescendants; // = number of descendants
bool hasDefaultsAvailable() const;
Node * getFirstChild() const;
Node * getNextChild(Node * child) const;
Node * getChild(rtl::OUString const & name) const;
static inline GroupNode * from(Node * node);
};
//-----------------------------------------------------------------------------
struct SetNode
{
NodeInfo info;
sal_uInt8 * elementType; // points to template [MM:SetNode *?]
TreeFragment * elements; // points to first element (TreeFragmentHeader)
rtl::OUString getElementTemplateName() const;
rtl::OUString getElementTemplateModule() const;
TreeFragment * getFirstElement() const;
TreeFragment * getNextElement(TreeFragment * _pElement) const;
TreeFragment * getElement(rtl::OUString const & name) const;
void addElement(TreeFragment * newElement);
TreeFragment * removeElement(rtl::OUString const & name);
static inline SetNode * from(Node * node);
// low-level helper for template data abstraction
static
sal_uInt8 * allocTemplateData(const rtl::OUString &rName,
const rtl::OUString &rModule);
static
sal_uInt8 * copyTemplateData(sal_uInt8 * _aTemplateData);
static
void releaseTemplateData(sal_uInt8 * _aTemplateData);
};
//-----------------------------------------------------------------------------
struct ValueNode
{
NodeInfo info;
AnyData value;
AnyData defaultValue;
bool isNull() const;
bool hasUsableDefault() const;
com::sun::star::uno::Any getValue() const;
com::sun::star::uno::Type getValueType() const;
com::sun::star::uno::Any getUserValue() const;
com::sun::star::uno::Any getDefaultValue() const;
void setValue(com::sun::star::uno::Any const & newValue);
void setToDefault();
void changeDefault(com::sun::star::uno::Any const & newDefault);
static inline ValueNode * from(Node * node);
private:
void releaseValue();
sal_uInt8 adaptType(com::sun::star::uno::Any const & newValue);
};
//-----------------------------------------------------------------------------
// TODO: optimized representation of localized values (now as set; mapping locale->element-name)
// TODO (?): better representation of sets of values
//-----------------------------------------------------------------------------
union Node
{
NodeInfo info;
GroupNode group;
SetNode set;
ValueNode value;
// info access
bool isNamed(rtl::OUString const & _aName) const;
rtl::OUString getName() const;
node::Attributes getAttributes() const;
bool isDefault() const;
// type checks
bool isGroup() const { return typeIs (data::Type::nodetype_group); }
bool isSet() const { return typeIs (data::Type::nodetype_set); }
bool isValue() const { return typeIs (data::Type::nodetype_value); }
// checked access
inline GroupNode * groupData();
inline GroupNode const * groupData() const;
inline SetNode * setData();
inline SetNode const * setData() const;
inline ValueNode * valueData();
inline ValueNode const * valueData() const;
// navigation
bool isFragmentRoot() const;
#if OSL_DEBUG_LEVEL > 0
Node * getParentNode();
Node const * getParentNode() const;
#endif
TreeFragment * getTreeFragment();
TreeFragment const * getTreeFragment() const;
Node * getSubnode(rtl::OUString const & name);
private:
bool typeIs(data::Type::Type eType) const
{ return (info.type & data::Type::mask_nodetype) == eType; }
};
//-----------------------------------------------------------------------------
inline GroupNode * GroupNode::from(Node * node)
{ return node == 0 ? 0 : node->groupData(); }
inline SetNode * SetNode::from(Node * node)
{ return node == 0 ? 0 : node->setData(); }
inline ValueNode * ValueNode::from(Node * node)
{ return node == 0 ? 0 : node->valueData(); }
inline GroupNode * Node::groupData()
{ return isGroup() ? &this->group : NULL; }
inline GroupNode const * Node::groupData() const
{ return isGroup() ? &this->group : NULL; }
inline SetNode * Node::setData()
{ return isSet() ? &this->set : NULL; }
inline SetNode const * Node::setData() const
{ return isSet() ? &this->set : NULL; }
inline ValueNode * Node::valueData()
{ return isValue() ? &this->value : NULL; }
inline ValueNode const * Node::valueData() const
{ return isValue() ? &this->value : NULL; }
inline Node * node(ValueNode * pNode)
{ return reinterpret_cast<Node*>(pNode); }
inline Node * node(GroupNode * pNode)
{ return reinterpret_cast<Node*>(pNode); }
inline Node * node(SetNode * pNode)
{ return reinterpret_cast<Node*>(pNode); }
inline Node const * node(ValueNode const* pNode)
{ return reinterpret_cast<Node const*>(pNode); }
inline Node const * node(GroupNode const* pNode)
{ return reinterpret_cast<Node const*>(pNode); }
inline Node const * node(SetNode const* pNode)
{ return reinterpret_cast<Node const*>(pNode); }
//-----------------------------------------------------------------------------
inline Node & node(ValueNode & pNode)
{ return reinterpret_cast<Node&>(pNode); }
inline Node & node(GroupNode & pNode)
{ return reinterpret_cast<Node&>(pNode); }
inline Node & node(SetNode & pNode)
{ return reinterpret_cast<Node&>(pNode); }
inline Node const & node(ValueNode const& pNode)
{ return reinterpret_cast<Node const&>(pNode); }
inline Node const & node(GroupNode const& pNode)
{ return reinterpret_cast<Node const&>(pNode); }
inline Node const & node(SetNode const& pNode)
{ return reinterpret_cast<Node const&>(pNode); }
//-----------------------------------------------------------------------------
}
//-----------------------------------------------------------------------------
}
#endif // INCLUDED_SHARABLE_NODE_HXX
|
