Skip to content
Navigation Menu
{{ message }}
forked from korczis/tinyxpath
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnode_set.cpp
More file actions
407 lines (364 loc) · 12.4 KB
/
Copy pathnode_set.cpp
File metadata and controls
407 lines (364 loc) · 12.4 KB
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
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
/*
www.sourceforge.net/projects/tinyxpath
Copyright (c) 2002-2004 Yves Berquin (yvesb@users.sourceforge.net)
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any
damages arising from the use of this software.
Permission is granted to anyone to use this software for any
purpose, including commercial applications, and to alter it and
redistribute it freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must
not claim that you wrote the original software. If you use this
software in a product, an acknowledgment in the product documentation
would be appreciated but is not required.
2. Altered source versions must be plainly marked as such, and
must not be misrepresented as being the original software.
3. This notice may not be removed or altered from any source
distribution.
*/
#include "node_set.h"
namespace TinyXPath
{
/// Copy constructor
node_set::node_set (const node_set & ns2)
{
* this = ns2;
}
/// Assignation operator. Allows one to write expressions like ns_1 = ns_2;
node_set & node_set::operator = (const node_set & ns2)
{
u_nb_node = ns2 . u_nb_node;
if (u_nb_node)
{
vpp_node_set = new const void * [u_nb_node];
memcpy (vpp_node_set, ns2 . vpp_node_set, u_nb_node * sizeof (void *));
op_attrib = new bool [u_nb_node];
memcpy (op_attrib, ns2 . op_attrib, u_nb_node * sizeof (bool));
}
else
{
vpp_node_set = NULL;
op_attrib = NULL;
}
return * this;
}
/// Copy all element children of a node to the node_set
void node_set::v_copy_node_children (
const TiXmlNode * XNp_root) ///< The father of the nodes to be copied
{
v_copy_node_children (XNp_root, NULL);
}
/// Copy all element children of a node to the node_set, if their name matches a given name
void node_set::v_copy_node_children (
const TiXmlNode * XNp_root, ///< The father of the nodes to be copied
const char * cp_lookup) ///< Lookup name (or NULL)
{
const TiXmlNode * XNp_child;
XNp_child = XNp_root -> FirstChildElement ();
while (XNp_child)
{
if ((! cp_lookup) || ! strcmp (XNp_child -> Value (), cp_lookup))
v_add_node_in_set (XNp_child);
XNp_child = XNp_child -> NextSiblingElement ();
}
}
/// Copy all nodes in the tree to the node_set
void node_set::v_copy_selected_node_recursive (
const TiXmlNode * XNp_root) ///< The node to be copied
{
v_copy_selected_node_recursive (XNp_root, NULL);
}
/// Copy all nodes in the tree to the node_set, knowing that we are copying the root
void node_set::v_copy_selected_node_recursive_root_only (
const TiXmlNode * XNp_root, const TiXmlNode * XNp_base)
{
v_add_node_in_set (XNp_root);
v_copy_selected_node_recursive (XNp_base, NULL);
}
/// Copy all nodes in the tree to the node_set
void node_set::v_copy_selected_node_recursive (
const TiXmlNode * XNp_root, ///< The node to be copied
const char * cp_lookup) ///< Lookup name (or NULL)
{
const TiXmlAttribute * XAp_attrib;
const TiXmlNode * XNp_child;
if ((! cp_lookup) || ! strcmp (XNp_root -> Value (), cp_lookup))
v_add_node_in_set (XNp_root);
if (XNp_root -> Type () == TiXmlNode::ELEMENT)
{
XAp_attrib = XNp_root -> ToElement () -> FirstAttribute ();
while (XAp_attrib)
{
v_add_attrib_in_set (XAp_attrib);
XAp_attrib = XAp_attrib -> Next ();
}
}
XNp_child = XNp_root -> FirstChild ();
while (XNp_child)
{
v_copy_selected_node_recursive (XNp_child, cp_lookup);
XNp_child = XNp_child -> NextSiblingElement ();
}
}
/// Copy all nodes in the tree to the node_set, excluding attributes
void node_set::v_copy_selected_node_recursive_no_attrib (
const TiXmlNode * XNp_root, ///< Node whole children are to be copied
const char * cp_lookup) ///< Lookup name or NULL
{
const TiXmlElement * XEp_child;
XEp_child = XNp_root -> FirstChildElement ();
while (XEp_child)
{
if ((! cp_lookup) || ! strcmp (XEp_child -> Value (), cp_lookup))
v_add_node_in_set (XEp_child);
v_copy_selected_node_recursive_no_attrib (XEp_child, cp_lookup);
XEp_child = XEp_child -> NextSiblingElement ();
}
}
/// Return the string value aka concatenation of all text items
TIXML_STRING node_set::S_get_string_value () const
{
TIXML_STRING S_res;
const TiXmlNode * XNp_node;
unsigned u_node;
S_res = "";
for (u_node = 0; u_node < u_nb_node; u_node++)
{
if (! op_attrib [u_node])
{
XNp_node = (const TiXmlNode *) vpp_node_set [u_node];
if (XNp_node -> Type () == TiXmlNode::TEXT)
S_res += XNp_node -> Value ();
}
}
return S_res;
}
/// Checks if a node exist in the node set
bool node_set::o_exist_in_set (
const TiXmlBase * XBp_member) ///< Check if a base exist in the node set
{
unsigned u_node;
for (u_node = 0; u_node < u_nb_node; u_node++)
if (vpp_node_set [u_node] == XBp_member)
return true;
return false;
}
/// Adds a new node in the node set
void node_set::v_add_base_in_set (
const TiXmlBase * XBp_member, ///< Base to add (node or attribute)
bool o_attrib) ///< true if the base is an attribute, false if it's a node
{
const void ** vpp_new_list;
bool * op_new_list;
if (o_exist_in_set (XBp_member))
return;
/*
printf ("add ");
if (o_attrib)
printf ("attrib %s='%s'", ((TiXmlAttribute *) XBp_member)->Name(),((TiXmlAttribute *) XBp_member)->Value());
else
{
TiXmlNode * XNp_node;
XNp_node = (TiXmlNode *) XBp_member;
switch (XNp_node->Type())
{
case TiXmlNode::TEXT :
printf ("text (%s)", XNp_node->ToText()->Value ());
break;
case TiXmlNode::DOCUMENT :
printf ("document");
break;
case TiXmlNode::ELEMENT :
printf ("element <%s>", XNp_node->ToElement()->Value ());
break;
case TiXmlNode::COMMENT :
printf ("comment <%s>", XNp_node->ToComment()->Value ());
break;
}
}
printf ("\n");
*/
vpp_new_list = new const void * [u_nb_node + 1];
op_new_list = new bool [u_nb_node + 1];
if (u_nb_node)
{
memcpy (vpp_new_list, vpp_node_set, u_nb_node * sizeof (void *));
delete [] vpp_node_set;
memcpy (op_new_list, op_attrib, u_nb_node * sizeof (bool));
delete [] op_attrib;
}
vpp_new_list [u_nb_node] = (const void *) XBp_member;
vpp_node_set = vpp_new_list;
op_new_list [u_nb_node] = o_attrib;
op_attrib = op_new_list;
u_nb_node++;
}
/// Populate the node set with all following nodes.
/// \n Exerpt : \n
/// the following axis contains all nodes in the same document as the context
/// node that are after the context node in document order, excluding any
/// descendants and excluding attribute nodes and namespace nodes
void node_set::v_add_all_foll_node (
const TiXmlNode * XNp_node, ///< base node
const TIXML_STRING & S_name) ///< lookup name (or "*")
{
const TiXmlNode * XNp_ptr;
const char * cp_lookup;
if (S_name == "*")
cp_lookup = NULL;
else
cp_lookup = S_name . c_str ();
XNp_ptr = XNp_node -> NextSiblingElement ();
while (XNp_ptr)
{
v_add_node_in_set_if_name_or_star (XNp_ptr, S_name);
v_copy_node_children (XNp_ptr, cp_lookup);
XNp_ptr = XNp_ptr -> NextSiblingElement ();
}
XNp_ptr = XNp_node -> Parent ();
if (XNp_ptr && XNp_ptr -> Type () == TiXmlNode::ELEMENT)
v_add_all_foll_node (XNp_ptr, S_name);
}
/// Populate the node set with all preceding nodes.
/// \n Exerpt : \n
/// the preceding axis contains all nodes in the same document as the context
/// node that are before the context node in document order, excluding any
/// ancestors and excluding attribute nodes and namespace nodes
void node_set::v_add_all_prec_node (
const TiXmlNode * XNp_node, ///< base node
const TIXML_STRING & S_name) ///< lookup name (or "*")
{
const TiXmlNode * XNp_ptr;
const char * cp_lookup;
if (S_name == "*")
cp_lookup = NULL;
else
cp_lookup = S_name . c_str ();
XNp_ptr = XNp_node -> PreviousSibling ();
while (XNp_ptr)
{
if (XNp_ptr -> Type () == TiXmlNode::ELEMENT)
{
v_add_node_in_set_if_name_or_star (XNp_ptr, S_name);
v_copy_node_children (XNp_ptr, cp_lookup);
}
XNp_ptr = XNp_ptr -> PreviousSibling ();
}
}
/// Internal utility class for the node set sorting
class ptr_2_and_flag
{
public :
const void * vp_node;
const TiXmlNode * XNp_root;
bool o_flag;
} ;
enum {e_not_found, e_lower, e_higher, e_same};
/// Find which node is first in tree, in document order (recursive calls)
static int i_compare_node_in_tree (const TiXmlNode * XNp_root, const TiXmlBase * XBp_1, const TiXmlBase * XBp_2)
{
const TiXmlNode * XNp_child;
const TiXmlAttribute * XAp_attrib;
int i_res;
if (! XNp_root || ! XBp_1 || ! XBp_2)
return e_not_found;
if (XNp_root == XBp_1)
if (XNp_root == XBp_2)
return e_same;
else
return e_lower;
else
if (XNp_root == XBp_2)
return e_higher;
if (XNp_root -> ToElement ())
{
// We have an element in the tree, let's see if one of the argument is an attribute of this element
XAp_attrib = XNp_root -> ToElement () -> FirstAttribute ();
while (XAp_attrib)
{
if (XAp_attrib == XBp_1)
if (XAp_attrib == XBp_2)
return e_same;
else
return e_lower;
else
if (XAp_attrib == XBp_2)
return e_higher;
XAp_attrib = XAp_attrib -> Next ();
}
}
XNp_child = XNp_root -> FirstChild ();
while (XNp_child)
{
i_res = i_compare_node_in_tree (XNp_child, XBp_1, XBp_2);
if (i_res != e_not_found)
return i_res;
XNp_child = XNp_child -> NextSibling ();
}
return e_not_found;
}
/// Internal utility function for node set sorting
static int i_compare_ptr_2_and_flag (
const void * vp_1, ///< Ptr to first element to compare
const void * vp_2) ///< Ptr to second element to compare
{
const ptr_2_and_flag * p2afp_1, * p2afp_2;
int i_res;
p2afp_1 = (const ptr_2_and_flag *) vp_1;
p2afp_2 = (const ptr_2_and_flag *) vp_2;
i_res = i_compare_node_in_tree (p2afp_1 -> XNp_root, (const TiXmlBase *) p2afp_1 -> vp_node, (const TiXmlBase *) p2afp_1 -> vp_node);
switch (i_res)
{
case e_lower :
return -1;
case e_higher :
return 1;
}
return 0;
}
/// Sort the node set according to the document order.
/// \n We do sort these nodes on the fly, comparing parents and orders for each
void node_set::v_document_sort (const TiXmlNode * XNp_root)
{
ptr_2_and_flag * p2afp_list;
unsigned u_node;
if (u_nb_node < 2)
return;
p2afp_list = new ptr_2_and_flag [u_nb_node];
for (u_node = 0; u_node < u_nb_node; u_node++)
{
p2afp_list [u_node] . vp_node = vpp_node_set [u_node];
p2afp_list [u_node] . o_flag = op_attrib [u_node];
p2afp_list [u_node] . XNp_root = XNp_root;
}
qsort (p2afp_list, u_nb_node, sizeof (ptr_2_and_flag), i_compare_ptr_2_and_flag);
for (u_node = 0; u_node < u_nb_node; u_node++)
{
vpp_node_set [u_node] = p2afp_list [u_node] . vp_node;
op_attrib [u_node] = p2afp_list [u_node] . o_flag;
}
delete [] p2afp_list;
}
/// Debug function to print the content of a node set to stdout
void node_set::v_dump ()
{
unsigned u_node;
const TiXmlAttribute * XAp_att;
const TiXmlNode * XNp_node;
printf ("-- start node set (%d items) --\n", u_nb_node);
for (u_node = 0; u_node < u_nb_node; u_node++)
{
if (op_attrib [u_node])
{
XAp_att = XAp_get_attribute_in_set (u_node);
printf (" [%d] : Attribute : %s=%s\n", u_node, XAp_att -> Name (), XAp_att -> Value ());
}
else
{
XNp_node = XNp_get_node_in_set (u_node);
printf (" [%d] : Node : %s\n", u_node, XNp_node -> Value ());
}
}
printf ("-- end node set --\n");
}
}
You can’t perform that action at this time.