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
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
|
///////////////////////////////////////////////////////////////////////////////
//
// Pug Improved XML Parser - Version 0.4
// --------------------------------------------------------
// Copyright (C) 2006-2009, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)
// This work is based on the pugxml parser, which is:
// Copyright (C) 2003, by Kristen Wegner (kristen@tima.net)
// Released into the Public Domain. Use at your own risk.
// See pugxml.xml for further information, history, etc.
// Contributions by Neville Franks (readonly@getsoft.com).
//
///////////////////////////////////////////////////////////////////////////////
#ifndef HEADER_PUGIXML_HPP
#define HEADER_PUGIXML_HPP
#include "pugiconfig.hpp"
#ifndef PUGIXML_NO_STL
# include <string>
# include <istream>
# include <exception>
#endif
// No XPath without STL
#ifdef PUGIXML_NO_STL
# ifndef PUGIXML_NO_XPATH
# define PUGIXML_NO_XPATH
# endif
#endif
#include <stddef.h>
#include <string.h>
/// The PugiXML Parser namespace.
namespace pugi
{
/// Tree node classification.
enum xml_node_type
{
node_null, ///< Undifferentiated entity
node_document, ///< A document tree's absolute root.
node_element, ///< E.g. '<...>'
node_pcdata, ///< E.g. '>...<'
node_cdata, ///< E.g. '<![CDATA[...]]>'
node_comment, ///< E.g. '<!--...-->'
node_pi ///< E.g. '<?...?>'
};
// Parsing options
/**
* Memory block size, used for fast allocator. Memory for DOM tree is allocated in blocks of
* memory_block_size + 4.
* This value affects size of xml_memory class.
*/
const size_t memory_block_size = 32768;
/**
* Minimal parsing mode. Equivalent to turning all other flags off. This set of flags means
* that pugixml does not add pi/cdata sections or comments to DOM tree and does not perform
* any conversions for input data, meaning fastest parsing.
*/
const unsigned int parse_minimal = 0x0000;
/**
* This flag determines if processing instructions (nodes with type node_pi; such nodes have the
* form of <? target content ?> or <? target ?> in XML) are to be put in DOM tree. If this flag is off,
* they are not put in the tree, but are still parsed and checked for correctness.
*
* The corresponding node in DOM tree will have type node_pi, name "target" and value "content",
* if any.
*
* Note that <?xml ...?> (document declaration) is not considered to be a PI.
*
* This flag is off by default.
*/
const unsigned int parse_pi = 0x0001;
/**
* This flag determines if comments (nodes with type node_comment; such nodes have the form of
* <!-- content --> in XML) are to be put in DOM tree. If this flag is off, they are not put in
* the tree, but are still parsed and checked for correctness.
*
* The corresponding node in DOM tree will have type node_comment, empty name and value "content".
*
* This flag is off by default.
*/
const unsigned int parse_comments = 0x0002;
/**
* This flag determines if CDATA sections (nodes with type node_cdata; such nodes have the form
* of <![CDATA[[content]]> in XML) are to be put in DOM tree. If this flag is off, they are not
* put in the tree, but are still parsed and checked for correctness.
*
* The corresponding node in DOM tree will have type node_cdata, empty name and value "content".
*
* This flag is on by default.
*/
const unsigned int parse_cdata = 0x0004;
/**
* This flag determines if nodes with PCDATA (regular text) that consist only of whitespace
* characters are to be put in DOM tree. Often whitespace-only data is not significant for the
* application, and the cost of allocating and storing such nodes (both memory and speed-wise)
* can be significant. For example, after parsing XML string "<node> <a/> </node>", <node> element
* will have 3 children when parse_ws_pcdata is set (child with type node_pcdata and value=" ",
* child with type node_element and name "a", and another child with type node_pcdata and
* value=" "), and only 1 child when parse_ws_pcdata is not set.
*
* This flag is off by default.
*/
const unsigned int parse_ws_pcdata = 0x0008;
/**
* This flag determines if character and entity references are to be expanded during the parsing
* process. Character references are &#...; or &#x...; (... is Unicode numeric representation of
* character in either decimal (&#...;) or hexadecimal (&#x...;) form), entity references are &...;
* Note that as pugixml does not handle DTD, the only allowed entities are predefined ones -
* &lt;, &gt;, &amp;, &apos; and &quot;. If character/entity reference can not be expanded, it is
* leaved as is, so you can do additional processing later.
* Reference expansion is performed in attribute values and PCDATA content.
*
* This flag is on by default.
*/
const unsigned int parse_escapes = 0x0010;
/**
* This flag determines if EOL handling (that is, replacing sequences 0x0d 0x0a by a single 0x0a
* character, and replacing all standalone 0x0d characters by 0x0a) is to be performed on input
* data (that is, comments contents, PCDATA/CDATA contents and attribute values).
*
* This flag is on by default.
*/
const unsigned int parse_eol = 0x0020;
/**
* This flag determines if attribute value normalization should be performed for all attributes,
* assuming that their type is not CDATA. This means, that:
* 1. Whitespace characters (new line, tab and space) are replaced with space (' ')
* 2. Afterwards sequences of spaces are replaced with a single space
* 3. Leading/trailing whitespace characters are trimmed
*
* This flag is off by default.
*/
const unsigned int parse_wnorm_attribute = 0x0040;
/**
* This flag determines if attribute value normalization should be performed for all attributes,
* assuming that their type is CDATA. This means, that whitespace characters (new line, tab and
* space) are replaced with space (' '). Note, that the actions performed while this flag is on
* are also performed if parse_wnorm_attribute is on, so this flag has no effect if
* parse_wnorm_attribute flag is set.
*
* This flag is on by default.
*/
const unsigned int parse_wconv_attribute = 0x0080;
/**
* This is the default set of flags. It includes parsing CDATA sections (comments/PIs are not
* parsed), performing character and entity reference expansion, replacing whitespace characters
* with spaces in attribute values and performing EOL handling. Note, that PCDATA sections
* consisting only of whitespace characters are not parsed (by default) for performance reasons.
*/
const unsigned int parse_default = parse_cdata | parse_escapes | parse_wconv_attribute | parse_eol;
// Formatting flags
/**
* Indent the nodes that are written to output stream with as many indentation strings as deep
* the node is in DOM tree.
*
* This flag is on by default.
*/
const unsigned int format_indent = 0x01;
/**
* This flag determines if UTF-8 BOM is to be written to output stream.
*
* This flag is off by default.
*/
const unsigned int format_write_bom_utf8 = 0x02;
/**
* If this flag is on, no indentation is performed and no line breaks are written to output file.
* This means that the data is written to output stream as is.
*
* This flag is off by default.
*/
const unsigned int format_raw = 0x04;
/**
* This is the default set of formatting flags. It includes indenting nodes depending on their
* depth in DOM tree.
*/
const unsigned int format_default = format_indent;
// Forward declarations
struct xml_attribute_struct;
struct xml_node_struct;
class xml_allocator;
class xml_node_iterator;
class xml_attribute_iterator;
class xml_tree_walker;
class xml_node;
#ifndef PUGIXML_NO_XPATH
class xpath_node;
class xpath_node_set;
class xpath_ast_node;
class xpath_allocator;
/**
* A class that holds compiled XPath query and allows to evaluate query result
*/
class xpath_query
{
private:
// Noncopyable semantics
xpath_query(const xpath_query&);
xpath_query& operator=(const xpath_query&);
xpath_allocator* m_alloc;
xpath_ast_node* m_root;
void compile(const char* query);
public:
/**
* Ctor from string with XPath expression.
* Throws xpath_exception on compilation error, std::bad_alloc on out of memory error.
*
* \param query - string with XPath expression
*/
explicit xpath_query(const char* query);
/**
* Dtor
*/
~xpath_query();
/**
* Evaluate expression as boolean value for the context node \a n.
* If expression does not directly evaluate to boolean, the expression result is converted
* as through boolean() XPath function call.
* Throws std::bad_alloc on out of memory error.
*
* \param n - context node
* \return evaluation result
*/
bool evaluate_boolean(const xml_node& n);
/**
* Evaluate expression as double value for the context node \a n.
* If expression does not directly evaluate to double, the expression result is converted
* as through number() XPath function call.
* Throws std::bad_alloc on out of memory error.
*
* \param n - context node
* \return evaluation result
*/
double evaluate_number(const xml_node& n);
/**
* Evaluate expression as string value for the context node \a n.
* If expression does not directly evaluate to string, the expression result is converted
* as through string() XPath function call.
* Throws std::bad_alloc on out of memory error.
*
* \param n - context node
* \return evaluation result
*/
std::string evaluate_string(const xml_node& n);
/**
* Evaluate expression as node set for the context node \a n.
* If expression does not directly evaluate to node set, function returns empty node set.
* Throws std::bad_alloc on out of memory error.
*
* \param n - context node
* \return evaluation result
*/
xpath_node_set evaluate_node_set(const xml_node& n);
};
#endif
/**
* Abstract writer class
* \see xml_node::print
*/
class xml_writer
{
public:
/**
* Virtual dtor
*/
virtual ~xml_writer() {}
/**
* Write memory chunk into stream/file/whatever
*
* \param data - data pointer
* \param size - data size
*/
virtual void write(const void* data, size_t size) = 0;
};
/** xml_writer implementation for FILE*
* \see xml_writer
*/
class xml_writer_file: public xml_writer
{
public:
/**
* Construct writer instance
*
* \param file - this is FILE* object, void* is used to avoid header dependencies on stdio
*/
xml_writer_file(void* file);
virtual void write(const void* data, size_t size);
private:
void* file;
};
#ifndef PUGIXML_NO_STL
/** xml_writer implementation for streams
* \see xml_writer
*/
class xml_writer_stream: public xml_writer
{
public:
/**
* Construct writer instance
*
* \param stream - output stream object
*/
xml_writer_stream(std::ostream& stream);
virtual void write(const void* data, size_t size);
private:
std::ostream* stream;
};
#endif
/**
* A light-weight wrapper for manipulating attributes in DOM tree.
* Note: xml_attribute does not allocate any memory for the attribute it wraps; it only wraps a
* pointer to existing attribute.
*/
class xml_attribute
{
friend class xml_attribute_iterator;
friend class xml_node;
private:
xml_attribute_struct* _attr;
/// \internal Safe bool type
#ifdef __MWERKS__
typedef bool (xml_attribute::*unspecified_bool_type)() const;
#else
typedef xml_attribute_struct* xml_attribute::*unspecified_bool_type;
#endif
/// \internal Initializing ctor
explicit xml_attribute(xml_attribute_struct* attr);
public:
/**
* Default ctor. Constructs an empty attribute.
*/
xml_attribute();
public:
/**
* Safe bool conversion.
* Allows xml_node to be used in a context where boolean variable is expected, such as 'if (node)'.
*/
operator unspecified_bool_type() const;
// Borland C++ workaround
bool operator!() const;
/**
* Compare wrapped pointer to the attribute to the pointer that is wrapped by \a r.
*
* \param r - value to compare to
* \return comparison result
*/
bool operator==(const xml_attribute& r) const;
/**
* Compare wrapped pointer to the attribute to the pointer that is wrapped by \a r.
*
* \param r - value to compare to
* \return comparison result
*/
bool operator!=(const xml_attribute& r) const;
/**
* Compare wrapped pointer to the attribute to the pointer that is wrapped by \a r.
*
* \param r - value to compare to
* \return comparison result
*/
bool operator<(const xml_attribute& r) const;
/**
* Compare wrapped pointer to the attribute to the pointer that is wrapped by \a r.
*
* \param r - value to compare to
* \return comparison result
*/
bool operator>(const xml_attribute& r) const;
/**
* Compare wrapped pointer to the attribute to the pointer that is wrapped by \a r.
*
* \param r - value to compare to
* \return comparison result
*/
bool operator<=(const xml_attribute& r) const;
/**
* Compare wrapped pointer to the attribute to the pointer that is wrapped by \a r.
*
* \param r - value to compare to
* \return comparison result
*/
bool operator>=(const xml_attribute& r) const;
public:
/**
* Get next attribute in attribute list of node that contains the attribute.
*
* \return next attribute, if any; empty attribute otherwise
*/
xml_attribute next_attribute() const;
/**
* Get previous attribute in attribute list of node that contains the attribute.
*
* \return previous attribute, if any; empty attribute otherwise
*/
xml_attribute previous_attribute() const;
/**
* Cast attribute value as int.
*
* \return attribute value as int, or 0 if conversion did not succeed or attribute is empty
*/
int as_int() const;
/**
* Cast attribute value as double.
*
* \return attribute value as double, or 0.0 if conversion did not succeed or attribute is empty
*/
double as_double() const;
/**
* Cast attribute value as float.
*
* \return attribute value as float, or 0.0f if conversion did not succeed or attribute is empty
*/
float as_float() const;
/**
* Cast attribute value as bool. Returns true for attributes with values that start with '1',
* 't', 'T', 'y', 'Y', returns false for other attributes.
*
* \return attribute value as bool, or false if conversion did not succeed or attribute is empty
*/
bool as_bool() const;
/// \internal Document order or 0 if not set
unsigned int document_order() const;
public:
/**
* Set attribute value to \a rhs.
*
* \param rhs - new attribute value
* \return self
*/
xml_attribute& operator=(const char* rhs);
/**
* Set attribute value to \a rhs.
*
* \param rhs - new attribute value
* \return self
*/
xml_attribute& operator=(int rhs);
/**
* Set attribute value to \a rhs.
*
* \param rhs - new attribute value
* \return self
*/
xml_attribute& operator=(double rhs);
/**
* Set attribute value to either 'true' or 'false' (depends on whether \a rhs is true or false).
*
* \param rhs - new attribute value
* \return self
*/
xml_attribute& operator=(bool rhs);
/**
* Set attribute name to \a rhs.
*
* \param rhs - new attribute name
* \return success flag (call fails if attribute is empty or there is not enough memory)
*/
bool set_name(const char* rhs);
/**
* Set attribute value to \a rhs.
*
* \param rhs - new attribute value
* \return success flag (call fails if attribute is empty or there is not enough memory)
*/
bool set_value(const char* rhs);
public:
/**
* Check if attribute is empty.
*
* \return true if attribute is empty, false otherwise
*/
bool empty() const;
public:
/**
* Get attribute name.
*
* \return attribute name, or "" if attribute is empty
*/
const char* name() const;
/**
* Get attribute value.
*
* \return attribute value, or "" if attribute is empty
*/
const char* value() const;
};
#ifdef __BORLANDC__
// Borland C++ workaround
bool operator&&(const xml_attribute& lhs, bool rhs);
bool operator||(const xml_attribute& lhs, bool rhs);
#endif
/**
* A light-weight wrapper for manipulating nodes in DOM tree.
* Note: xml_node does not allocate any memory for the node it wraps; it only wraps a pointer to
* existing node.
*/
class xml_node
{
friend class xml_node_iterator;
protected:
xml_node_struct* _root;
/// \internal Safe bool type
#ifdef __MWERKS__
typedef bool (xml_node::*unspecified_bool_type)() const;
#else
typedef xml_node_struct* xml_node::*unspecified_bool_type;
#endif
/// \internal Initializing ctor
explicit xml_node(xml_node_struct* p);
/// \internal Precompute document order (valid only for document node)
void precompute_document_order_impl();
/// \internal Get allocator
xml_allocator& get_allocator() const;
public:
/**
* Default ctor. Constructs an empty node.
*/
xml_node();
public:
/**
* Safe bool conversion.
* Allows xml_node to be used in a context where boolean variable is expected, such as 'if (node)'.
*/
operator unspecified_bool_type() const;
// Borland C++ workaround
bool operator!() const;
/**
* Compare wrapped pointer to the attribute to the pointer that is wrapped by \a r.
*
* \param r - value to compare to
* \return comparison result
*/
bool operator==(const xml_node& r) const;
/**
* Compare wrapped pointer to the attribute to the pointer that is wrapped by \a r.
*
* \param r - value to compare to
* \return comparison result
*/
bool operator!=(const xml_node& r) const;
/**
* Compare wrapped pointer to the attribute to the pointer that is wrapped by \a r.
*
* \param r - value to compare to
* \return comparison result
*/
bool operator<(const xml_node& r) const;
/**
* Compare wrapped pointer to the attribute to the pointer that is wrapped by \a r.
*
* \param r - value to compare to
* \return comparison result
*/
bool operator>(const xml_node& r) const;
/**
* Compare wrapped pointer to the attribute to the pointer that is wrapped by \a r.
*
* \param r - value to compare to
* \return comparison result
*/
bool operator<=(const xml_node& r) const;
/**
* Compare wrapped pointer to the attribute to the pointer that is wrapped by \a r.
*
* \param r - value to compare to
* \return comparison result
*/
bool operator>=(const xml_node& r) const;
public:
/**
* Node iterator type (for child nodes).
* \see xml_node_iterator
*/
typedef xml_node_iterator iterator;
/**
* Node iterator type (for child nodes).
* \see xml_attribute_iterator
*/
typedef xml_attribute_iterator attribute_iterator;
/**
* Access the begin iterator for this node's collection of child nodes.
*
* \return iterator that points to the first child node, or past-the-end iterator if node is empty or has no children
*/
iterator begin() const;
/**
* Access the end iterator for this node's collection of child nodes.
*
* \return past-the-end iterator for child list
*/
iterator end() const;
/**
* Access the begin iterator for this node's collection of attributes.
*
* \return iterator that points to the first attribute, or past-the-end iterator if node is empty or has no attributes
*/
attribute_iterator attributes_begin() const;
/**
* Access the end iterator for this node's collection of attributes.
*
* \return past-the-end iterator for attribute list
*/
attribute_iterator attributes_end() const;
public:
/**
* Check if node is empty.
*
* \return true if node is empty, false otherwise
*/
bool empty() const;
public:
/**
* Get node type
*
* \return node type; node_null for empty nodes
*/
xml_node_type type() const;
/**
* Get node name (element name for element nodes, PI target for PI)
*
* \return node name, if any; "" otherwise
*/
const char* name() const;
/**
* Get node value (comment/PI/PCDATA/CDATA contents, depending on node type)
*
* \return node value, if any; "" otherwise
*/
const char* value() const;
/**
* Get child with the specified name
*
* \param name - child name
* \return child with the specified name, if any; empty node otherwise
*/
xml_node child(const char* name) const;
/**
* Get child with the name that matches specified pattern
*
* \param name - child name pattern
* \return child with the name that matches pattern, if any; empty node otherwise
*/
xml_node child_w(const char* name) const;
/**
* Get attribute with the specified name
*
* \param name - attribute name
* \return attribute with the specified name, if any; empty attribute otherwise
*/
xml_attribute attribute(const char* name) const;
/**
* Get attribute with the name that matches specified pattern
*
* \param name - attribute name pattern
* \return attribute with the name that matches pattern, if any; empty attribute otherwise
*/
xml_attribute attribute_w(const char* name) const;
/**
* Get first of following sibling nodes with the specified name
*
* \param name - sibling name
* \return node with the specified name, if any; empty node otherwise
*/
xml_node next_sibling(const char* name) const;
/**
* Get first of the following sibling nodes with the name that matches specified pattern
*
* \param name - sibling name pattern
* \return node with the name that matches pattern, if any; empty node otherwise
*/
xml_node next_sibling_w(const char* name) const;
/**
* Get following sibling
*
* \return following sibling node, if any; empty node otherwise
*/
xml_node next_sibling() const;
/**
* Get first of preceding sibling nodes with the specified name
*
* \param name - sibling name
* \return node with the specified name, if any; empty node otherwise
*/
xml_node previous_sibling(const char* name) const;
/**
* Get first of the preceding sibling nodes with the name that matches specified pattern
*
* \param name - sibling name pattern
* \return node with the name that matches pattern, if any; empty node otherwise
*/
xml_node previous_sibling_w(const char* name) const;
/**
* Get preceding sibling
*
* \return preceding sibling node, if any; empty node otherwise
*/
xml_node previous_sibling() const;
/**
* Get parent node
*
* \return parent node if any; empty node otherwise
*/
xml_node parent() const;
/**
* Get root of DOM tree this node belongs to.
*
* \return tree root
*/
xml_node root() const;
/**
* Get child value of current node; that is, value of the first child node of type PCDATA/CDATA
*
* \return child value of current node, if any; "" otherwise
*/
const char* child_value() const;
/**
* Get child value of child with specified name. \see child_value
* node.child_value(name) is equivalent to node.child(name).child_value()
*
* \param name - child name
* \return child value of specified child node, if any; "" otherwise
*/
const char* child_value(const char* name) const;
/**
* Get child value of child with name that matches the specified pattern. \see child_value
* node.child_value_w(name) is equivalent to node.child_w(name).child_value()
*
* \param name - child name pattern
* \return child value of specified child node, if any; "" otherwise
*/
const char* child_value_w(const char* name) const;
public:
/**
* Set node name to \a rhs (for PI/element nodes). \see name
*
* \param rhs - new node name
* \return success flag (call fails if node is of the wrong type or there is not enough memory)
*/
bool set_name(const char* rhs);
/**
* Set node value to \a rhs (for PI/PCDATA/CDATA/comment nodes). \see value
*
* \param rhs - new node value
* \return success flag (call fails if node is of the wrong type or there is not enough memory)
*/
bool set_value(const char* rhs);
/**
* Add attribute with specified name (for element nodes)
*
* \param name - attribute name
* \return added attribute, or empty attribute if there was an error (wrong node type)
*/
xml_attribute append_attribute(const char* name);
/**
* Insert attribute with specified name after \a attr (for element nodes)
*
* \param name - attribute name
* \param attr - attribute to insert a new one after
* \return inserted attribute, or empty attribute if there was an error (wrong node type, or attr does not belong to node)
*/
xml_attribute insert_attribute_after(const char* name, const xml_attribute& attr);
/**
* Insert attribute with specified name before \a attr (for element nodes)
*
* \param name - attribute name
* \param attr - attribute to insert a new one before
* \return inserted attribute, or empty attribute if there was an error (wrong node type, or attr does not belong to node)
*/
xml_attribute insert_attribute_before(const char* name, const xml_attribute& attr);
/**
* Add child node with specified type (for element nodes)
*
* \param type - node type
* \return added node, or empty node if there was an error (wrong node type)
*/
xml_node append_child(xml_node_type type = node_element);
/**
* Insert child node with specified type after \a node (for element nodes)
*
* \param type - node type
* \param node - node to insert a new one after
* \return inserted node, or empty node if there was an error (wrong node type, or \a node is not a child of this node)
*/
xml_node insert_child_after(xml_node_type type, const xml_node& node);
/**
* Insert child node with specified type before \a node (for element nodes)
*
* \param type - node type
* \param node - node to insert a new one before
* \return inserted node, or empty node if there was an error (wrong node type, or \a node is not a child of this node)
*/
xml_node insert_child_before(xml_node_type type, const xml_node& node);
/**
* Remove specified attribute
*
* \param a - attribute to be removed
*/
void remove_attribute(const xml_attribute& a);
/**
* Remove attribute with the specified name, if any
*
* \param name - attribute name
*/
void remove_attribute(const char* name);
/**
* Remove specified child
*
* \param n - child node to be removed
*/
void remove_child(const xml_node& n);
/**
* Remove child with the specified name, if any
*
* \param name - child name
*/
void remove_child(const char* name);
public:
/**
* Get first attribute
*
* \return first attribute, if any; empty attribute otherwise
*/
xml_attribute first_attribute() const;
/**
* Get last attribute
*
* \return last attribute, if any; empty attribute otherwise
*/
xml_attribute last_attribute() const;
/**
* Get all elements from subtree with given name
*
* \param name - node name
* \param it - output iterator (for example, std::back_insert_iterator (result of std::back_inserter))
*/
template <typename OutputIterator> void all_elements_by_name(const char* name, OutputIterator it) const;
/**
* Get all elements from subtree with name that matches given pattern
*
* \param name - node name pattern
* \param it - output iterator (for example, std::back_insert_iterator (result of std::back_inserter))
*/
template <typename OutputIterator> void all_elements_by_name_w(const char* name, OutputIterator it) const;
/**
* Get first child
*
* \return first child, if any; empty node otherwise
*/
xml_node first_child() const;
/**
* Get last child
*
* \return last child, if any; empty node otherwise
*/
xml_node last_child() const;
/**
* Find attribute using predicate
*
* \param pred - predicate, that takes xml_attribute and returns bool
* \return first attribute for which predicate returned true, or empty attribute
*/
template <typename Predicate> xml_attribute find_attribute(Predicate pred) const;
/**
* Find child node using predicate
*
* \param pred - predicate, that takes xml_node and returns bool
* \return first child node for which predicate returned true, or empty node
*/
template <typename Predicate> xml_node find_child(Predicate pred) const;
/**
* Find node from subtree using predicate
*
* \param pred - predicate, that takes xml_node and returns bool
* \return first node from subtree for which predicate returned true, or empty node
*/
template <typename Predicate> xml_node find_node(Predicate pred) const;
#ifndef PUGIXML_NO_STL
/**
* Get the absolute node path from root as a text string.
*
* \param delimiter - delimiter character to insert between element names
* \return path string (e.g. '/bookstore/book/author').
*/
std::string path(char delimiter = '/') const;
#endif
/**
* Search for a node by path.
* \param path - path string; e.g. './foo/bar' (relative to node), '/foo/bar' (relative
* to root), '../foo/bar'.
* \param delimiter - delimiter character to use while tokenizing path
* \return matching node, if any; empty node otherwise
*/
xml_node first_element_by_path(const char* path, char delimiter = '/') const;
/**
* Recursively traverse subtree with xml_tree_walker
* \see xml_tree_walker::begin
* \see xml_tree_walker::for_each
* \see xml_tree_walker::end
*
* \param walker - tree walker to traverse subtree with
* \return traversal result
*/
bool traverse(xml_tree_walker& walker);
#ifndef PUGIXML_NO_XPATH
/**
* Select single node by evaluating XPath query
*
* \param query - query string
* \return first node from the resulting node set by document order, or empty node if none found
*/
xpath_node select_single_node(const char* query) const;
/**
* Select single node by evaluating XPath query
*
* \param query - compiled query
* \return first node from the resulting node set by document order, or empty node if none found
*/
xpath_node select_single_node(xpath_query& query) const;
/**
* Select node set by evaluating XPath query
*
* \param query - query string
* \return resulting node set
*/
xpath_node_set select_nodes(const char* query) const;
/**
* Select node set by evaluating XPath query
*
* \param query - compiled query
* \return resulting node set
*/
xpath_node_set select_nodes(xpath_query& query) const;
#endif
/// \internal Document order or 0 if not set
unsigned int document_order() const;
/**
* Print subtree to writer
*
* \param writer - writer object
* \param indent - indentation string
* \param flags - formatting flags
* \param depth - starting depth (used for indentation)
*/
void print(xml_writer& writer, const char* indent = "\t", unsigned int flags = format_default, unsigned int depth = 0);
};
#ifdef __BORLANDC__
// Borland C++ workaround
bool operator&&(const xml_node& lhs, bool rhs);
bool operator||(const xml_node& lhs, bool rhs);
#endif
/**
* Child node iterator.
* It's a bidirectional iterator with value type 'xml_node'.
*/
class xml_node_iterator
#ifndef PUGIXML_NO_STL
: public std::iterator<std::bidirectional_iterator_tag, xml_node>
#endif
{
friend class xml_node;
private:
xml_node _prev;
xml_node _wrap;
/// \internal Initializing ctor
explicit xml_node_iterator(xml_node_struct* ref);
public:
/**
* Default ctor
*/
xml_node_iterator();
/**
* Initializing ctor
*
* \param node - node that iterator will point at
*/
xml_node_iterator(const xml_node& node);
/**
* Initializing ctor (for past-the-end)
*
* \param ref - should be 0
* \param prev - previous node
*/
xml_node_iterator(xml_node_struct* ref, xml_node_struct* prev);
/**
* Check if this iterator is equal to \a rhs
*
* \param rhs - other iterator
* \return comparison result
*/
bool operator==(const xml_node_iterator& rhs) const;
/**
* Check if this iterator is not equal to \a rhs
*
* \param rhs - other iterator
* \return comparison result
*/
bool operator!=(const xml_node_iterator& rhs) const;
/**
* Dereferencing operator
*
* \return reference to the node iterator points at
*/
xml_node& operator*();
/**
* Member access operator
*
* \return poitner to the node iterator points at
*/
xml_node* operator->();
/**
* Pre-increment operator
*
* \return self
*/
const xml_node_iterator& operator++();
/**
* Post-increment operator
*
* \return old value
*/
xml_node_iterator operator++(int);
/**
* Pre-decrement operator
*
* \return self
*/
const xml_node_iterator& operator--();
/**
* Post-decrement operator
*
* \return old value
*/
xml_node_iterator operator--(int);
};
/**
* Attribute iterator.
* It's a bidirectional iterator with value type 'xml_attribute'.
*/
class xml_attribute_iterator
#ifndef PUGIXML_NO_STL
: public std::iterator<std::bidirectional_iterator_tag, xml_attribute>
#endif
{
friend class xml_node;
private:
xml_attribute _prev;
xml_attribute _wrap;
/// \internal Initializing ctor
explicit xml_attribute_iterator(xml_attribute_struct* ref);
public:
/**
* Default ctor
*/
xml_attribute_iterator();
/**
* Initializing ctor
*
* \param node - node that iterator will point at
*/
xml_attribute_iterator(const xml_attribute& node);
/**
* Initializing ctor (for past-the-end)
*
* \param ref - should be 0
* \param prev - previous node
*/
xml_attribute_iterator(xml_attribute_struct* ref, xml_attribute_struct* prev);
/**
* Check if this iterator is equal to \a rhs
*
* \param rhs - other iterator
* \return comparison result
*/
bool operator==(const xml_attribute_iterator& rhs) const;
/**
* Check if this iterator is not equal to \a rhs
*
* \param rhs - other iterator
* \return comparison result
*/
bool operator!=(const xml_attribute_iterator& rhs) const;
/**
* Dereferencing operator
*
* \return reference to the node iterator points at
*/
xml_attribute& operator*();
/**
* Member access operator
*
* \return poitner to the node iterator points at
*/
xml_attribute* operator->();
/**
* Pre-increment operator
*
* \return self
*/
const xml_attribute_iterator& operator++();
/**
* Post-increment operator
*
* \return old value
*/
xml_attribute_iterator operator++(int);
/**
* Pre-decrement operator
*
* \return self
*/
const xml_attribute_iterator& operator--();
/**
* Post-decrement operator
*
* \return old value
*/
xml_attribute_iterator operator--(int);
};
/**
* Abstract tree walker class
* \see xml_node::traverse
*/
class xml_tree_walker
{
friend class xml_node;
private:
int _depth;
protected:
/**
* Get node depth
*
* \return node depth
*/
int depth() const;
public:
/**
* Default ctor
*/
xml_tree_walker();
/**
* Virtual dtor
*/
virtual ~xml_tree_walker();
public:
/**
* Callback that is called when traversal of node begins.
*
* \return returning false will abort the traversal
*/
virtual bool begin(xml_node&);
/**
* Callback that is called for each node traversed
*
* \return returning false will abort the traversal
*/
virtual bool for_each(xml_node&) = 0;
/**
* Callback that is called when traversal of node ends.
*
* \return returning false will abort the traversal
*/
virtual bool end(xml_node&);
};
/// \internal Memory block
struct xml_memory_block
{
xml_memory_block();
xml_memory_block* next;
size_t size;
char data[memory_block_size];
};
/**
* Struct used to distinguish parsing with ownership transfer from parsing without it.
* \see xml_document::parse
*/
struct transfer_ownership_tag {};
/**
* Document class (DOM tree root).
* This class has noncopyable semantics (private copy ctor/assignment operator).
*/
class xml_document: public xml_node
{
private:
char* _buffer;
xml_memory_block _memory;
xml_document(const xml_document&);
const xml_document& operator=(const xml_document&);
void create();
void destroy();
public:
/**
* Default ctor, makes empty document
*/
xml_document();
/**
* Dtor
*/
~xml_document();
public:
#ifndef PUGIXML_NO_STL
/**
* Load document from stream.
*
* \param stream - stream with xml data
* \param options - parsing options
* \return success flag
*/
bool load(std::istream& stream, unsigned int options = parse_default);
#endif
/**
* Load document from string.
*
* \param contents - input string
* \param options - parsing options
* \return success flag
*/
bool load(const char* contents, unsigned int options = parse_default);
/**
* Load document from file
*
* \param name - file name
* \param options - parsing options
* \return success flag
*/
bool load_file(const char* name, unsigned int options = parse_default);
/**
* Parse the given XML string in-situ.
* The string is modified; you should ensure that string data will persist throughout the
* document's lifetime. Although, document does not gain ownership over the string, so you
* should free the memory occupied by it manually.
*
* \param xmlstr - readwrite string with xml data
* \param options - parsing options
* \return success flag
*/
bool parse(char* xmlstr, unsigned int options = parse_default);
/**
* Parse the given XML string in-situ (gains ownership).
* The string is modified; document gains ownership over the string, so you don't have to worry
* about it's lifetime.
* Call example: doc.parse(transfer_ownership_tag(), string, options);
*
* \param xmlstr - readwrite string with xml data
* \param options - parsing options
* \return success flag
*/
bool parse(const transfer_ownership_tag&, char* xmlstr, unsigned int options = parse_default);
/**
* Save XML to writer
*
* \param writer - writer object
* \param indent - indentation string
* \param flags - formatting flags
*/
void save(xml_writer& writer, const char* indent = "\t", unsigned int flags = format_default);
/**
* Save XML to file
*
* \param name - file name
* \param indent - indentation string
* \param flags - formatting flags
* \return success flag
*/
bool save_file(const char* name, const char* indent = "\t", unsigned int flags = format_default);
/**
* Compute document order for the whole tree
* Sometimes this makes evaluation of XPath queries faster.
*/
void precompute_document_order();
};
#ifndef PUGIXML_NO_XPATH
/**
* XPath exception class.
*/
class xpath_exception: public std::exception
{
private:
const char* m_message;
public:
/**
* Construct exception from static error string
*
* \param message - error string
*/
explicit xpath_exception(const char* message);
/**
* Return error message
*
* \return error message
*/
virtual const char* what() const throw();
};
/**
* XPath node class.
*
* XPath defines node to be either xml_node or xml_attribute in pugixml terminology, so xpath_node
* is either xml_node or xml_attribute.
*/
class xpath_node
{
private:
xml_node m_node;
xml_attribute m_attribute;
/// \internal Safe bool type
typedef xml_node xpath_node::*unspecified_bool_type;
public:
/**
* Construct empty XPath node
*/
xpath_node();
/**
* Construct XPath node from XML node
*
* \param node - XML node
*/
xpath_node(const xml_node& node);
/**
* Construct XPath node from XML attribute
*
* \param attribute - XML attribute
* \param parent - attribute's parent node
*/
xpath_node(const xml_attribute& attribute, const xml_node& parent);
/**
* Get XML node, if any
*
* \return contained XML node, empty node otherwise
*/
xml_node node() const;
/**
* Get XML attribute, if any
*
* \return contained XML attribute, if any, empty attribute otherwise
*/
xml_attribute attribute() const;
/**
* Get parent of contained XML attribute, if any
*
* \return parent of contained XML attribute, if any, empty node otherwise
*/
xml_node parent() const;
/**
* Safe bool conversion.
* Allows xpath_node to be used in a context where boolean variable is expected, such as 'if (node)'.
*/
operator unspecified_bool_type() const;
/**
* Compares two XPath nodes
*
* \param n - XPath node to compare to
* \return comparison result
*/
bool operator==(const xpath_node& n) const;
/**
* Compares two XPath nodes
*
* \param n - XPath node to compare to
* \return comparison result
*/
bool operator!=(const xpath_node& n) const;
};
/**
* Not necessarily ordered constant collection of XPath nodes
*/
class xpath_node_set
{
friend class xpath_ast_node;
public:
/// Collection type
enum type_t
{
type_unsorted, ///< Not ordered
type_sorted, ///< Sorted by document order (ascending)
type_sorted_reverse ///< Sorted by document order (descending)
};
/// Constant iterator type
typedef const xpath_node* const_iterator;
private:
type_t m_type;
xpath_node m_storage;
xpath_node* m_begin;
xpath_node* m_end;
xpath_node* m_eos;
bool m_using_storage;
typedef xpath_node* iterator;
iterator mut_begin();
iterator mut_end();
void push_back(const xpath_node& n);
template <typename Iterator> void append(Iterator begin, Iterator end);
void truncate(iterator it);
void remove_duplicates();
public:
/**
* Default ctor
* Constructs empty set
*/
xpath_node_set();
/**
* Dtor
*/
~xpath_node_set();
/**
* Copy ctor
*
* \param ns - set to copy
*/
xpath_node_set(const xpath_node_set& ns);
/**
* Assignment operator
*
* \param ns - set to assign
* \return self
*/
xpath_node_set& operator=(const xpath_node_set& ns);
/**
* Get collection type
*
* \return collection type
*/
type_t type() const;
/**
* Get collection size
*
* \return collection size
*/
size_t size() const;
/**
* Get begin constant iterator for collection
*
* \return begin constant iterator
*/
const_iterator begin() const;
/**
* Get end iterator for collection
*
* \return end iterator
*/
const_iterator end() const;
/**
* Sort the collection in ascending/descending order by document order
*
* \param reverse - whether to sort in ascending (false) or descending (true) order
*/
void sort(bool reverse = false);
/**
* Get first node in the collection by document order
*
* \return first node by document order
*/
xpath_node first() const;
/**
* Return true if collection is empty
*
* \return true if collection is empty, false otherwise
*/
bool empty() const;
};
#endif
#ifndef PUGIXML_NO_STL
/**
* Convert utf16 to utf8
*
* \param str - input UTF16 string
* \return output UTF8 string
*/
std::string as_utf8(const wchar_t* str);
/**
* Convert utf8 to utf16
*
* \param str - input UTF8 string
* \return output UTF16 string
*/
std::wstring as_utf16(const char* str);
#endif
}
// Inline implementation
namespace pugi
{
namespace impl
{
int strcmpwild(const char*, const char*);
}
template <typename OutputIterator> void xml_node::all_elements_by_name(const char* name, OutputIterator it) const
{
if (empty()) return;
for (xml_node node = first_child(); node; node = node.next_sibling())
{
if (node.type() == node_element)
{
if (!strcmp(name, node.name()))
{
*it = node;
++it;
}
if (node.first_child()) node.all_elements_by_name(name, it);
}
}
}
template <typename OutputIterator> void xml_node::all_elements_by_name_w(const char* name, OutputIterator it) const
{
if (empty()) return;
for (xml_node node = first_child(); node; node = node.next_sibling())
{
if (node.type() == node_element)
{
if (!impl::strcmpwild(name, node.name()))
{
*it = node;
++it;
}
if (node.first_child()) node.all_elements_by_name_w(name, it);
}
}
}
template <typename Predicate> inline xml_attribute xml_node::find_attribute(Predicate pred) const
{
if (!empty())
for (xml_attribute attrib = first_attribute(); attrib; attrib = attrib.next_attribute())
if (pred(attrib))
return attrib;
return xml_attribute();
}
template <typename Predicate> inline xml_node xml_node::find_child(Predicate pred) const
{
if (!empty())
for (xml_node node = first_child(); node; node = node.next_sibling())
if (pred(node))
return node;
return xml_node();
}
template <typename Predicate> inline xml_node xml_node::find_node(Predicate pred) const
{
if (!empty())
for (xml_node node = first_child(); node; node = node.next_sibling())
{
if (pred(node))
return node;
if (node.first_child())
{
xml_node found = node.find_node(pred);
if (found) return found;
}
}
return xml_node();
}
}
#endif
|