Packman Build Service PMBS

Changes of Revision 74

lightspark.spec Changed

lightspark.tar.xz/CMakeLists.txt Changed

lightspark.tar.xz/ChangeLog Changed

lightspark.tar.xz/README Changed

lightspark.tar.xz/src/3rdparty Added

lightspark.tar.xz/src/3rdparty/pugixml Added

lightspark.tar.xz/src/3rdparty/pugixml/.travis.yml Added

lightspark.tar.xz/src/3rdparty/pugixml/README.md Added

@@ -0,0 +1,44 @@
+pugixml [![Build Status](https://travis-ci.org/zeux/pugixml.svg?branch=master)](https://travis-ci.org/zeux/pugixml) [![Build status](https://ci.appveyor.com/api/projects/status/9hdks1doqvq8pwe7/branch/master?svg=true)](https://ci.appveyor.com/project/zeux/pugixml)
+=======
+
+pugixml is a C++ XML processing library, which consists of a DOM-like interface with rich traversal/modification
+capabilities, an extremely fast XML parser which constructs the DOM tree from an XML file/buffer, and an XPath 1.0
+implementation for complex data-driven tree queries. Full Unicode support is also available, with Unicode interface
+variants and conversions between different Unicode encodings (which happen automatically during parsing/saving).
+
+pugixml is used by a lot of projects, both open-source and proprietary, for performance and easy-to-use interface.
+
+## Documentation
+
+Documentation for the current release of pugixml is available on-line as two separate documents:
+
+* [Quick-start guide](http://pugixml.org/docs/quickstart.html), that aims to provide enough information to start using the library;
+* [Complete reference manual](http://pugixml.org/docs/manual.html), that describes all features of the library in detail.
+
+You’re advised to start with the quick-start guide; however, many important library features are either not described in it at all or only mentioned briefly; if you require more information you should read the complete manual.
+
+## License
+This library is available to anybody free of charge, under the terms of MIT License:
+
+Copyright (c) 2006-2015 Arseny Kapoulkine
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.

lightspark.tar.xz/src/3rdparty/pugixml/appveyor.yml Added

lightspark.tar.xz/src/3rdparty/pugixml/contrib Added

lightspark.tar.xz/src/3rdparty/pugixml/contrib/foreach.hpp Added

@@ -0,0 +1,63 @@
+/*
+ * Boost.Foreach support for pugixml classes.
+ * This file is provided to the public domain.
+ * Written by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)
+ */
+
+#ifndef HEADER_PUGIXML_FOREACH_HPP
+#define HEADER_PUGIXML_FOREACH_HPP
+
+#include <boost/range/iterator.hpp>
+
+#include "pugixml.hpp"
+
+/*
+ * These types add support for BOOST_FOREACH macro to xml_node and xml_document classes (child iteration only).
+ * Example usage:
+ * BOOST_FOREACH(xml_node n, doc) {}
+ */
+
+namespace boost
+{
+	template<> struct range_mutable_iterator<pugi::xml_node>
+	{
+		typedef pugi::xml_node::iterator type;
+	};
+
+	template<> struct range_const_iterator<pugi::xml_node>
+	{
+		typedef pugi::xml_node::iterator type;
+	};
+
+	template<> struct range_mutable_iterator<pugi::xml_document>
+	{
+		typedef pugi::xml_document::iterator type;
+	};
+
+	template<> struct range_const_iterator<pugi::xml_document>
+	{
+		typedef pugi::xml_document::iterator type;
+	};
+}
+
+/*
+ * These types add support for BOOST_FOREACH macro to xml_node and xml_document classes (child/attribute iteration).
+ * Example usage:
+ * BOOST_FOREACH(xml_node n, children(doc)) {}
+ * BOOST_FOREACH(xml_node n, attributes(doc)) {}
+ */
+
+namespace pugi
+{
+	inline xml_object_range<xml_node_iterator> children(const pugi::xml_node& node)
+	{
+		return node.children();
+	}
+
+	inline xml_object_range<xml_attribute_iterator> attributes(const pugi::xml_node& node)
+	{
+		return node.attributes();
+	}
+}
+
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/docs Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/config.adoc Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/images Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/images/dom_tree.png Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/images/vs2005_link1.png Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/images/vs2005_link2.png Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/images/vs2005_pch1.png Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/images/vs2005_pch2.png Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/images/vs2005_pch3.png Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/images/vs2005_pch4.png Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/images/vs2010_link1.png Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/images/vs2010_link2.png Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/manual.adoc Added

@@ -0,0 +1,2932 @@
+= pugixml {version} manual
+include::config.adoc[]
+:numbered:
+
+[[overview]]
+== Overview
+
+[[overview.introduction]]
+=== Introduction
+
+http://pugixml.org/[pugixml] is a light-weight C{plus}{plus} XML processing library. It consists of a DOM-like interface with rich traversal/modification capabilities, an extremely fast XML parser which constructs the DOM tree from an XML file/buffer, and an <<xpath,XPath 1.0 implementation>> for complex data-driven tree queries. Full Unicode support is also available, with <<dom.unicode,two Unicode interface variants>> and conversions between different Unicode encodings (which happen automatically during parsing/saving). The library is <<install.portability,extremely portable>> and easy to integrate and use. pugixml is developed and maintained since 2006 and has many users. All code is distributed under the <<overview.license,MIT license>>, making it completely free to use in both open-source and proprietary applications.
+
+pugixml enables very fast, convenient and memory-efficient XML document processing. However, since pugixml has a DOM parser, it can't process XML documents that do not fit in memory; also the parser is a non-validating one, so if you need DTD or XML Schema validation, the library is not for you.
+
+This is the complete manual for pugixml, which describes all features of the library in detail. If you want to start writing code as quickly as possible, you are advised to link:quickstart.html[read the quick start guide first].
+
+NOTE: No documentation is perfect; neither is this one. If you find errors or omissions, please don’t hesitate to https://github.com/zeux/pugixml/issues/new[submit an issue or open a pull request] with a fix.
+
+[[overview.feedback]]
+=== Feedback
+
+If you believe you've found a bug in pugixml (bugs include compilation problems (errors/warnings), crashes, performance degradation and incorrect behavior), please file an issue via https://github.com/zeux/pugixml/issues/new[issue submission form]. Be sure to include the relevant information so that the bug can be reproduced: the version of pugixml, compiler version and target architecture, the code that uses pugixml and exhibits the bug, etc.
+
+Feature requests can be reported the same way as bugs, so if you're missing some functionality in pugixml or if the API is rough in some places and you can suggest an improvement, https://github.com/zeux/pugixml/issues/new[file an issue]. However please note that there are many factors when considering API changes (compatibility with previous versions, API redundancy, etc.), so generally features that can be implemented via a small function without pugixml modification are not accepted. However, all rules have exceptions.
+
+If you have a contribution to pugixml, such as build script for some build system/IDE, or a well-designed set of helper functions, or a binding to some language other than C{plus}{plus}, please https://github.com/zeux/pugixml/issues/new[file an issue or open a pull request]. Your contribution has to be distributed under the terms of a license that's compatible with pugixml license; i.e. GPL/LGPL licensed code is not accepted.
+
+If filing an issue is not possible due to privacy or other concerns, you can contact pugixml author by e-mail directly: arseny.kapoulkine@gmail.com.
+
+[[overview.thanks]]
+=== Acknowledgments
+
+pugixml could not be developed without the help from many people; some of them are listed in this section. If you've played a part in pugixml development and you can not find yourself on this list, I'm truly sorry; please <<email,send me an e-mail>> so I can fix this.
+
+Thanks to *Kristen Wegner* for pugxml parser, which was used as a basis for pugixml.
+
+Thanks to *Neville Franks* for contributions to pugxml parser.
+
+Thanks to *Artyom Palvelev* for suggesting a lazy gap contraction approach.
+
+Thanks to *Vyacheslav Egorov* for documentation proofreading.
+
+[[overview.license]]
+=== License
+
+The pugixml library is distributed under the MIT license:
+
+....
+Copyright (c) 2006-2015 Arseny Kapoulkine
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
+....
+
+This means that you can freely use pugixml in your applications, both open-source and proprietary. If you use pugixml in a product, it is sufficient to add an acknowledgment like this to the product distribution:
+ 
+....
+This software is based on pugixml library (http://pugixml.org).
+pugixml is Copyright (C) 2006-2015 Arseny Kapoulkine.
+....
+
+[[install]]
+== Installation
+
+[[install.getting]]
+=== Getting pugixml
+
+pugixml is distributed in source form. You can either download a source distribution or clone the Git repository.
+
+[[install.getting.source]]
+==== Source distributions
+
+You can download the latest source distribution as an archive:
+
+https://github.com/zeux/pugixml/releases/download/v{version}/pugixml-{version}.zip[pugixml-{version}.zip] (Windows line endings)
+/
+https://github.com/zeux/pugixml/releases/download/v{version}/pugixml-{version}.tar.gz[pugixml-{version}.tar.gz] (Unix line endings)
+
+The distribution contains library source, documentation (the manual you're reading now and the quick start guide) and some code examples. After downloading the distribution, install pugixml by extracting all files from the compressed archive.
+
+If you need an older version, you can download it from the https://github.com/zeux/pugixml/releases[version archive].
+
+[[install.getting.git]]
+==== Git repository
+
+The Git repository is located at https://github.com/zeux/pugixml/. There is a Git tag "v\{version\}" for each version; also there is the "latest" tag, which always points to the latest stable release.
+
+For example, to checkout the current version, you can use this command:
+
+[source,bash,subs="attributes"]
+----
+git clone https://github.com/zeux/pugixml
+cd pugixml
+git checkout v{version}
+----
+
+The repository contains library source, documentation, code examples and full unit test suite.
+
+Use `latest` tag if you want to automatically get new versions. Use other tags if you want to switch to new versions only explicitly. Also please note that the master branch contains the work-in-progress version of the code; while this means that you can get new features and bug fixes from master without waiting for a new release, this also means that occasionally the code can be broken in some configurations.
+
+[[install.getting.subversion]]
+==== Subversion repository
+
+You can access the Git repository via Subversion using https://github.com/zeux/pugixml URL. For example, to checkout the current version, you can use this command:
+
+[source,bash,subs="attributes"]
+----
+svn checkout https://github.com/zeux/pugixml/tags/v{version} pugixml
+----
+
+[[install.building]]
+=== Building pugixml
+
+pugixml is distributed in source form without any pre-built binaries; you have to build them yourself.
+ 
+The complete pugixml source consists of three files - one source file, `pugixml.cpp`, and two header files, `pugixml.hpp` and `pugiconfig.hpp`. `pugixml.hpp` is the primary header which you need to include in order to use pugixml classes/functions; `pugiconfig.hpp` is a supplementary configuration file (see <<install.building.config>>). The rest of this guide assumes that `pugixml.hpp` is either in the current directory or in one of include directories of your projects, so that `#include "pugixml.hpp"` can find the header; however you can also use relative path (i.e. `#include "../libs/pugixml/src/pugixml.hpp"`) or include directory-relative path (i.e. `#include <xml/thirdparty/pugixml/src/pugixml.hpp>`).
+ 
+[[install.building.embed]]
+==== Building pugixml as a part of another static library/executable
+
+The easiest way to build pugixml is to compile the source file, `pugixml.cpp`, along with the existing library/executable. This process depends on the method of building your application; for example, if you're using Microsoft Visual Studio footnote:[All trademarks used are properties of their respective owners.], Apple Xcode, Code::Blocks or any other IDE, just add `pugixml.cpp` to one of your projects.
+
+If you're using Microsoft Visual Studio and the project has precompiled headers turned on, you'll see the following error messages:
+
+----
+pugixml.cpp(3477) : fatal error C1010: unexpected end of file while looking for precompiled header. Did you forget to add '#include "stdafx.h"' to your source?
+----
+
+The correct way to resolve this is to disable precompiled headers for `pugixml.cpp`; you have to set "Create/Use Precompiled Header" option (Properties dialog -> C/C{plus}{plus} -> Precompiled Headers -> Create/Use Precompiled Header) to "Not Using Precompiled Headers". You'll have to do it for all project configurations/platforms (you can select Configuration "All Configurations" and Platform "All Platforms" before editing the option):
+
+[cols="4*a",frame=none]
+|===
+| image::vs2005_pch1.png[link="images/vs2005_pch1.png"]
+| image::vs2005_pch2.png[link="images/vs2005_pch2.png"]
+| image::vs2005_pch3.png[link="images/vs2005_pch3.png"]
+| image::vs2005_pch4.png[link="images/vs2005_pch4.png"]
+|===
+ 
+[[install.building.static]]
+==== Building pugixml as a standalone static library
+ 
+It's possible to compile pugixml as a standalone static library. This process depends on the method of building your application; pugixml distribution comes with project files for several popular IDEs/build systems. There are project files for Apple XCode, Code::Blocks, Codelite, Microsoft Visual Studio 2005, 2008, 2010+, and configuration scripts for CMake and premake4. You're welcome to submit project files/build scripts for other software; see <<overview.feedback>>. 
+
+There are two projects for each version of Microsoft Visual Studio: one for dynamically linked CRT, which has a name like `pugixml_vs2008.vcproj`, and another one for statically linked CRT, which has a name like `pugixml_vs2008_static.vcproj`. You should select the version that matches the CRT used in your application; the default option for new projects created by Microsoft Visual Studio is dynamically linked CRT, so unless you changed the defaults, you should use the version with dynamic CRT (i.e. `pugixml_vs2008.vcproj` for Microsoft Visual Studio 2008).
+
+In addition to adding pugixml project to your workspace, you'll have to make sure that your application links with pugixml library. If you're using Microsoft Visual Studio 2005/2008, you can add a dependency from your application project to pugixml one. If you're using Microsoft Visual Studio 2010+, you'll have to add a reference to your application project instead. For other IDEs/systems, consult the relevant documentation.
+
+[cols="4*a",frame=none,options=header]
+|===
+2+| Microsoft Visual Studio 2005/2008
+2+| Microsoft Visual Studio 2010+
+| image::vs2005_link1.png[link="images/vs2005_link1.png"]
+| image::vs2005_link2.png[link="images/vs2005_link2.png"]
+| image::vs2010_link1.png[link="images/vs2010_link1.png"]
+| image::vs2010_link2.png[link="images/vs2010_link2.png"]
+|===
+
+[[install.building.shared]]
+==== Building pugixml as a standalone shared library
+ 
+It's possible to compile pugixml as a standalone shared library. The process is usually similar to the static library approach; however, no preconfigured projects/scripts are included into pugixml distribution, so you'll have to do it yourself. Generally, if you're using GCC-based toolchain, the process does not differ from building any other library as DLL (adding -shared to compilation flags should suffice); if you're using MSVC-based toolchain, you'll have to explicitly mark exported symbols with a declspec attribute. You can do it by defining <<PUGIXML_API,PUGIXML_API>> macro, i.e. via `pugiconfig.hpp`:
+
+[source]
+----
+#ifdef _DLL
+ #define PUGIXML_API __declspec(dllexport)
+#else
+ #define PUGIXML_API __declspec(dllimport)
+#endif
+----
+
+CAUTION: If you're using STL-related functions, you should use the shared runtime library to ensure that a single heap is used for STL allocations in your application and in pugixml; in MSVC, this means selecting the 'Multithreaded DLL' or 'Multithreaded Debug DLL' to 'Runtime library' property (`/MD` or `/MDd` linker switch). You should also make sure that your runtime library choice is consistent between different projects.
+
+[[install.building.header]]
+==== Using pugixml in header-only mode
+
+[[PUGIXML_HEADER_ONLY]]
+It's possible to use pugixml in header-only mode. This means that all source code for pugixml will be included in every translation unit that includes `pugixml.hpp`. This is how most of Boost and STL libraries work.
+
+Note that there are advantages and drawbacks of this approach. Header mode may improve tree traversal/modification performance (because many simple functions will be inlined), if your compiler toolchain does not support link-time optimization, or if you have it turned off (with link-time optimization the performance should be similar to non-header mode). However, since compiler now has to compile pugixml source once for each translation unit that includes it, compilation times may increase noticeably. If you want to use pugixml in header mode but do not need XPath support, you can consider disabling it by using <<PUGIXML_NO_XPATH,PUGIXML_NO_XPATH>> define to improve compilation time.
+
+To enable header-only mode, you have to define `PUGIXML_HEADER_ONLY`. You can either do it in `pugiconfig.hpp`, or provide them via compiler command-line.
+
+Note that it is safe to compile `pugixml.cpp` if `PUGIXML_HEADER_ONLY` is defined - so if you want to i.e. use header-only mode only in Release configuration, you
+can include pugixml.cpp in your project (see <<install.building.embed>>), and conditionally enable header-only mode in `pugiconfig.hpp` like this:
+
+[source]
+----
+#ifndef _DEBUG
+ #define PUGIXML_HEADER_ONLY
+#endif
+----
+
+[[install.building.config]]
+==== Additional configuration options
+
+pugixml uses several defines to control the compilation process. There are two ways to define them: either put the needed definitions to `pugiconfig.hpp` (it has some examples that are commented out) or provide them via compiler command-line. Consistency is important: the definitions should match in all source files that include `pugixml.hpp` (including pugixml sources) throughout the application. Adding defines to `pugiconfig.hpp` lets you guarantee this, unless your macro definition is wrapped in preprocessor `#if`/`#ifdef` directive and this directive is not consistent. `pugiconfig.hpp` will never contain anything but comments, which means that when upgrading to a new version, you can safely leave your modified version intact.
+
+[[PUGIXML_WCHAR_MODE]]`PUGIXML_WCHAR_MODE` define toggles between UTF-8 style interface (the in-memory text encoding is assumed to be UTF-8, most functions use `char` as character type) and UTF-16/32 style interface (the in-memory text encoding is assumed to be UTF-16/32, depending on `wchar_t` size, most functions use `wchar_t` as character type). See <<dom.unicode>> for more details.
+
+[[PUGIXML_NO_XPATH]]`PUGIXML_NO_XPATH` define disables XPath. Both XPath interfaces and XPath implementation are excluded from compilation. This option is provided in case you do not need XPath functionality and need to save code space.
+
+[[PUGIXML_NO_STL]]`PUGIXML_NO_STL` define disables use of STL in pugixml. The functions that operate on STL types are no longer present (i.e. load/save via iostream) if this macro is defined. This option is provided in case your target platform does not have a standard-compliant STL implementation.
+
+[[PUGIXML_NO_EXCEPTIONS]]`PUGIXML_NO_EXCEPTIONS` define disables use of exceptions in pugixml. This option is provided in case your target platform does not have exception handling capabilities.
+
+[[PUGIXML_API]]`PUGIXML_API`, [[PUGIXML_CLASS]]`PUGIXML_CLASS` and [[PUGIXML_FUNCTION]]`PUGIXML_FUNCTION` defines let you specify custom attributes (i.e. declspec or calling conventions) for pugixml classes and non-member functions. In absence of `PUGIXML_CLASS` or `PUGIXML_FUNCTION` definitions, `PUGIXML_API` definition is used instead. For example, to specify fixed calling convention, you can define `PUGIXML_FUNCTION` to i.e. `__fastcall`. Another example is DLL import/export attributes in MSVC (see <<install.building.shared>>).
+
+NOTE: In that example `PUGIXML_API` is inconsistent between several source files; this is an exception to the consistency rule.
+
+[[PUGIXML_MEMORY_PAGE_SIZE]]`PUGIXML_MEMORY_PAGE_SIZE`, [[PUGIXML_MEMORY_OUTPUT_STACK]]`PUGIXML_MEMORY_OUTPUT_STACK` and [[PUGIXML_MEMORY_XPATH_PAGE_SIZE]]`PUGIXML_MEMORY_XPATH_PAGE_SIZE` can be used to customize certain important sizes to optimize memory usage for the application-specific patterns. For details see <<dom.memory.tuning>>.
+
+[[PUGIXML_HAS_LONG_LONG]]`PUGIXML_HAS_LONG_LONG` define enables support for `long long` type in pugixml. This define is automatically enabled if your platform is known to have `long long` support (i.e. has C{plus}{plus}11 support or uses a reasonably modern version of a known compiler); if pugixml does not recognize that your platform supports `long long` but in fact it does, you can enable the define manually.
+ 
+[[install.portability]]
+=== Portability
+
+pugixml is written in standard-compliant C{plus}{plus} with some compiler-specific workarounds where appropriate. pugixml is compatible with the C{plus}{plus}11 standard, but does not require C{plus}{plus}11 support. Each version is tested with a unit test suite (with code coverage about 99%) on the following platforms:
+
+* Microsoft Windows:
+** Borland C{plus}{plus} Compiler 5.82
+** Digital Mars C{plus}{plus} Compiler 8.51
+** Intel C{plus}{plus} Compiler 8.0, 9.0 x86/x64, 10.0 x86/x64, 11.0 x86/x64
+** Metrowerks CodeWarrior 8.0
+** Microsoft Visual C{plus}{plus} 6.0, 7.0 (2002), 7.1 (2003), 8.0 (2005) x86/x64, 9.0 (2008) x86/x64, 10.0 (2010) x86/x64, 11.0 (2011) x86/x64/ARM, 12.0 (2013) x86/x64/ARM and some CLR versions
+** MinGW (GCC) 3.4, 4.4, 4.5, 4.6 x64
+
+* Linux (GCC 4.4.3 x86/x64, GCC 4.8.1 x64, Clang 3.2 x64)
+* FreeBSD (GCC 4.2.1 x86/x64)
+* Apple MacOSX (GCC 4.0.1 x86/x64/PowerPC, Clang 3.5 x64)
+* Sun Solaris (sunCC x86/x64)
+* Microsoft Xbox 360
+* Nintendo Wii (Metrowerks CodeWarrior 4.1)
+* Sony Playstation Portable (GCC 3.4.2)
+* Sony Playstation 3 (GCC 4.1.1, SNC 310.1)
+* Various portable platforms (Android NDK, BlackBerry NDK, Samsung bada, Windows CE)
+
+[[dom]]
+== Document object model
+
+pugixml stores XML data in DOM-like way: the entire XML document (both document structure and element data) is stored in memory as a tree. The tree can be loaded from a character stream (file, string, C{plus}{plus} I/O stream), then traversed with the special API or XPath expressions. The whole tree is mutable: both node structure and node/attribute data can be changed at any time. Finally, the result of document transformations can be saved to a character stream (file, C{plus}{plus} I/O stream or custom transport).
+
+[[dom.tree]]
+=== Tree structure
+
+The XML document is represented with a tree data structure. The root of the tree is the document itself, which corresponds to C{plus}{plus} type <<xml_document,xml_document>>. Document has one or more child nodes, which correspond to C{plus}{plus} type <<xml_node,xml_node>>. Nodes have different types; depending on a type, a node can have a collection of child nodes, a collection of attributes, which correspond to C{plus}{plus} type <<xml_attribute,xml_attribute>>, and some additional data (i.e. name).
+
+[[xml_node_type]]
+The tree nodes can be of one of the following types (which together form the enumeration `xml_node_type`):
+
+* Document node ([[node_document]]`node_document`) - this is the root of the tree, which consists of several child nodes. This node corresponds to <<xml_document,xml_document>> class; note that <<xml_document,xml_document>> is a sub-class of <<xml_node,xml_node>>, so the entire node interface is also available. However, document node is special in several ways, which are covered below. There can be only one document node in the tree; document node does not have any XML representation.
+
+* Element/tag node ([[node_element]]`node_element`) - this is the most common type of node, which represents XML elements. Element nodes have a name, a collection of attributes and a collection of child nodes (both of which may be empty). The attribute is a simple name/value pair. The example XML representation of element nodes is as follows:
++
+----
+<node attr="value"><child/></node>
+----
++
+There are two element nodes here: one has name `"node"`, single attribute `"attr"` and single child `"child"`, another has name `"child"` and does not have any attributes or child nodes.
+
+* Plain character data nodes ([[node_pcdata]]`node_pcdata`) represent plain text in XML. PCDATA nodes have a value, but do not have a name or children/attributes. Note that *plain character data is not a part of the element node but instead has its own node*; an element node can have several child PCDATA nodes. The example XML representation of text nodes is as follows:
++
+----
+<node> text1 <child/> text2 </node>
+----
++
+Here `"node"` element has three children, two of which are PCDATA nodes with values `" text1 "` and `" text2 "`.
+
+* Character data nodes ([[node_cdata]]`node_cdata`) represent text in XML that is quoted in a special way. CDATA nodes do not differ from PCDATA nodes except in XML representation - the above text example looks like this with CDATA:
++
+----
+<node> <![CDATA[[text1]]> <child/> <![CDATA[[text2]]> </node>
+----
++
+CDATA nodes make it easy to include non-escaped `<`, `&` and `>` characters in plain text. CDATA value can not contain the character sequence `]]>`, since it is used to determine the end of node contents.
+
+* Comment nodes ([[node_comment]]`node_comment`) represent comments in XML. Comment nodes have a value, but do not have a name or children/attributes. The example XML representation of a comment node is as follows:
++
+----
+
+----
++
+Here the comment node has value `"comment text"`. By default comment nodes are treated as non-essential part of XML markup and are not loaded during XML parsing. You can override this behavior with <<parse_comments,parse_comments>> flag.
+
+* Processing instruction node ([[node_pi]]`node_pi`) represent processing instructions (PI) in XML. PI nodes have a name and an optional value, but do not have children/attributes. The example XML representation of a PI node is as follows:
++
+----
+<?name value?>
+----
++
+Here the name (also called PI target) is `"name"`, and the value is `"value"`. By default PI nodes are treated as non-essential part of XML markup and are not loaded during XML parsing. You can override this behavior with <<parse_pi,parse_pi>> flag.
+
+* Declaration node ([[node_declaration]]`node_declaration`) represents document declarations in XML. Declaration nodes have a name (`"xml"`) and an optional collection of attributes, but do not have value or children. There can be only one declaration node in a document; moreover, it should be the topmost node (its parent should be the document). The example XML representation of a declaration node is as follows:
++
+----
+<?xml version="1.0"?>
+----
++
+Here the node has name `"xml"` and a single attribute with name `"version"` and value `"1.0"`. By default declaration nodes are treated as non-essential part of XML markup and are not loaded during XML parsing. You can override this behavior with <<parse_declaration,parse_declaration>> flag. Also, by default a dummy declaration is output when XML document is saved unless there is already a declaration in the document; you can disable this with <<format_no_declaration,format_no_declaration>> flag.
+
+* Document type declaration node ([[node_doctype]]`node_doctype`) represents document type declarations in XML. Document type declaration nodes have a value, which corresponds to the entire document type contents; no additional nodes are created for inner elements like `<!ENTITY>`. There can be only one document type declaration node in a document; moreover, it should be the topmost node (its parent should be the document). The example XML representation of a document type declaration node is as follows:
++
+----
+<!DOCTYPE greeting [ <!ELEMENT greeting (#PCDATA)> ]>
+----
++
+Here the node has value `"greeting [ <!ELEMENT greeting (#PCDATA)> ]"`. By default document type declaration nodes are treated as non-essential part of XML markup and are not loaded during XML parsing. You can override this behavior with <<parse_doctype,parse_doctype>> flag.
+
+Finally, here is a complete example of XML document and the corresponding tree representation (link:samples/tree.xml[]):
+
+[cols="2*a",frame=none]
+|===
+|
+[source,xml]
+----
+<?xml version="1.0"?>
+<mesh name="mesh_root">
+ 
+ some text
+ <![CDATA[someothertext]]>
+ some more text
+ <node attr1="value1" attr2="value2" />
+ <node attr1="value2">
+ <innernode/>
+ </node>
+</mesh>
+<?include somedata?>
+----
+|
+image::dom_tree.png[link="images/dom_tree.png"]
+|===
+
+[[dom.cpp]]
+=== C{plus}{plus} interface
+
+NOTE: All pugixml classes and functions are located in the `pugi` namespace; you have to either use explicit name qualification (i.e. `pugi::xml_node`), or to gain access to relevant symbols via `using` directive (i.e. `using pugi::xml_node;` or `using namespace pugi;`). The namespace will be omitted from all declarations in this documentation hereafter; all code examples will use fully qualified names.
+
+Despite the fact that there are several node types, there are only three C{plus}{plus} classes representing the tree (`xml_document`, `xml_node`, `xml_attribute`); some operations on `xml_node` are only valid for certain node types. The classes are described below.
+
+[[xml_document]][[xml_document::document_element]]
+`xml_document` is the owner of the entire document structure; it is a non-copyable class. The interface of `xml_document` consists of loading functions (see <<loading>>), saving functions (see <<saving>>) and the entire interface of `xml_node`, which allows for document inspection and/or modification. Note that while `xml_document` is a sub-class of `xml_node`, `xml_node` is not a polymorphic type; the inheritance is present only to simplify usage. Alternatively you can use the `document_element` function to get the element node that's the immediate child of the document.
+
+[[xml_document::ctor]][[xml_document::dtor]][[xml_document::reset]]
+Default constructor of `xml_document` initializes the document to the tree with only a root node (document node). You can then populate it with data using either tree modification functions or loading functions; all loading functions destroy the previous tree with all occupied memory, which puts existing node/attribute handles for this document to invalid state. If you want to destroy the previous tree, you can use the `xml_document::reset` function; it destroys the tree and replaces it with either an empty one or a copy of the specified document. Destructor of `xml_document` also destroys the tree, thus the lifetime of the document object should exceed the lifetimes of any node/attribute handles that point to the tree.
+
+CAUTION: While technically node/attribute handles can be alive when the tree they're referring to is destroyed, calling any member function for these handles results in undefined behavior. Thus it is recommended to make sure that the document is destroyed only after all references to its nodes/attributes are destroyed.
+
+[[xml_node]][[xml_node::type]]
+`xml_node` is the handle to document node; it can point to any node in the document, including the document node itself. There is a common interface for nodes of all types; the actual <<xml_node_type,node type>> can be queried via the `xml_node::type()` method. Note that `xml_node` is only a handle to the actual node, not the node itself - you can have several `xml_node` handles pointing to the same underlying object. Destroying `xml_node` handle does not destroy the node and does not remove it from the tree. The size of `xml_node` is equal to that of a pointer, so it is nothing more than a lightweight wrapper around a pointer; you can safely pass or return `xml_node` objects by value without additional overhead.
+
+[[node_null]]
+There is a special value of `xml_node` type, known as null node or empty node (such nodes have type `node_null`). It does not correspond to any node in any document, and thus resembles null pointer. However, all operations are defined on empty nodes; generally the operations don't do anything and return empty nodes/attributes or empty strings as their result (see documentation for specific functions for more detailed information). This is useful for chaining calls; i.e. you can get the grandparent of a node like so: `node.parent().parent()`; if a node is a null node or it does not have a parent, the first `parent()` call returns null node; the second `parent()` call then also returns null node, which makes error handling easier.
+
+[[xml_attribute]]
+`xml_attribute` is the handle to an XML attribute; it has the same semantics as `xml_node`, i.e. there can be several `xml_attribute` handles pointing to the same underlying object and there is a special null attribute value, which propagates to function results.
+
+[[xml_attribute::ctor]][[xml_node::ctor]]
+Both `xml_node` and `xml_attribute` have the default constructor which initializes them to null objects.
+
+[[xml_attribute::comparison]][[xml_node::comparison]]
+`xml_node` and `xml_attribute` try to behave like pointers, that is, they can be compared with other objects of the same type, making it possible to use them as keys in associative containers. All handles to the same underlying object are equal, and any two handles to different underlying objects are not equal. Null handles only compare as equal to themselves. The result of relational comparison can not be reliably determined from the order of nodes in file or in any other way. Do not use relational comparison operators except for search optimization (i.e. associative container keys).
+
+[[xml_attribute::hash_value]][[xml_node::hash_value]]
+If you want to use `xml_node` or `xml_attribute` objects as keys in hash-based associative containers, you can use the `hash_value` member functions. They return the hash values that are guaranteed to be the same for all handles to the same underlying object. The hash value for null handles is 0. Note that hash value does not depend on the content of the node, only on the location of the underlying structure in memory - this means that loading the same document twice will likely produce different hash values, and copying the node will not preserve the hash.
+
+[[xml_attribute::unspecified_bool_type]][[xml_node::unspecified_bool_type]][[xml_attribute::empty]][[xml_node::empty]]
+Finally handles can be implicitly cast to boolean-like objects, so that you can test if the node/attribute is empty with the following code: `if (node) { ... }` or `if (!node) { ... } else { ... }`. Alternatively you can check if a given `xml_node`/`xml_attribute` handle is null by calling the following methods:
+
+[source]
+----
+bool xml_attribute::empty() const;
+bool xml_node::empty() const;
+----
+
+Nodes and attributes do not exist without a document tree, so you can't create them without adding them to some document. Once underlying node/attribute objects are destroyed, the handles to those objects become invalid. While this means that destruction of the entire tree invalidates all node/attribute handles, it also means that destroying a subtree (by calling <<xml_node::remove_child,xml_node::remove_child>>) or removing an attribute invalidates the corresponding handles. There is no way to check handle validity; you have to ensure correctness through external mechanisms.
+
+[[dom.unicode]]
+=== Unicode interface
+
+There are two choices of interface and internal representation when configuring pugixml: you can either choose the UTF-8 (also called char) interface or UTF-16/32 (also called wchar_t) one. The choice is controlled via <<PUGIXML_WCHAR_MODE,PUGIXML_WCHAR_MODE>> define; you can set it via `pugiconfig.hpp` or via preprocessor options, as discussed in <<install.building.config>>. If this define is set, the wchar_t interface is used; otherwise (by default) the char interface is used. The exact wide character encoding is assumed to be either UTF-16 or UTF-32 and is determined based on the size of `wchar_t` type.
+
+NOTE: If the size of `wchar_t` is 2, pugixml assumes UTF-16 encoding instead of UCS-2, which means that some characters are represented as two code points.
+
+All tree functions that work with strings work with either C-style null terminated strings or STL strings of the selected character type. For example, node name accessors look like this in char mode:
+
+[source]
+----
+const char* xml_node::name() const;
+bool xml_node::set_name(const char* value);
+----
+
+and like this in wchar_t mode:
+
+[source]
+----
+const wchar_t* xml_node::name() const;
+bool xml_node::set_name(const wchar_t* value);
+----
+
+[[char_t]][[string_t]]
+There is a special type, `pugi::char_t`, that is defined as the character type and depends on the library configuration; it will be also used in the documentation hereafter. There is also a type `pugi::string_t`, which is defined as the STL string of the character type; it corresponds to `std::string` in char mode and to `std::wstring` in wchar_t mode.
+
+In addition to the interface, the internal implementation changes to store XML data as `pugi::char_t`; this means that these two modes have different memory usage characteristics. The conversion to `pugi::char_t` upon document loading and from `pugi::char_t` upon document saving happen automatically, which also carries minor performance penalty. The general advice however is to select the character mode based on usage scenario, i.e. if UTF-8 is inconvenient to process and most of your XML data is non-ASCII, wchar_t mode is probably a better choice.
+
+[[as_utf8]][[as_wide]]
+There are cases when you'll have to convert string data between UTF-8 and wchar_t encodings; the following helper functions are provided for such purposes:
+
+[source]
+----
+std::string as_utf8(const wchar_t* str);
+std::wstring as_wide(const char* str);
+----
+
+Both functions accept a null-terminated string as an argument `str`, and return the converted string. `as_utf8` performs conversion from UTF-16/32 to UTF-8; `as_wide` performs conversion from UTF-8 to UTF-16/32. Invalid UTF sequences are silently discarded upon conversion. `str` has to be a valid string; passing null pointer results in undefined behavior. There are also two overloads with the same semantics which accept a string as an argument:
+
+[source]
+----
+std::string as_utf8(const std::wstring& str);
+std::wstring as_wide(const std::string& str);
+----
+
+[NOTE]
+====
+Most examples in this documentation assume char interface and therefore will not compile with <<PUGIXML_WCHAR_MODE,PUGIXML_WCHAR_MODE>>. This is done to simplify the documentation; usually the only changes you'll have to make is to pass `wchar_t` string literals, i.e. instead of
+
+`xml_node node = doc.child("bookstore").find_child_by_attribute("book", "id", "12345");`
+
+you'll have to use
+
+`xml_node node = doc.child(L"bookstore").find_child_by_attribute(L"book", L"id", L"12345");`
+====
+ 
+[[dom.thread]]
+=== Thread-safety guarantees
+
+Almost all functions in pugixml have the following thread-safety guarantees:
+
+* it is safe to call free (non-member) functions from multiple threads
+* it is safe to perform concurrent read-only accesses to the same tree (all constant member functions do not modify the tree)
+* it is safe to perform concurrent read/write accesses, if there is only one read or write access to the single tree at a time
+
+Concurrent modification and traversing of a single tree requires synchronization, for example via reader-writer lock. Modification includes altering document structure and altering individual node/attribute data, i.e. changing names/values.
+
+The only exception is <<set_memory_management_functions,set_memory_management_functions>>; it modifies global variables and as such is not thread-safe. Its usage policy has more restrictions, see <<dom.memory.custom>>.
+
+[[dom.exception]]
+=== Exception guarantees
+
+With the exception of XPath, pugixml itself does not throw any exceptions. Additionally, most pugixml functions have a no-throw exception guarantee.
+
+This is not applicable to functions that operate on STL strings or IOstreams; such functions have either strong guarantee (functions that operate on strings) or basic guarantee (functions that operate on streams). Also functions that call user-defined callbacks (i.e. <<xml_node::traverse,xml_node::traverse>> or <<xml_node::find_node,xml_node::find_node>>) do not provide any exception guarantees beyond the ones provided by the callback.
+
+If exception handling is not disabled with <<PUGIXML_NO_EXCEPTIONS,PUGIXML_NO_EXCEPTIONS>> define, XPath functions may throw <<xpath_exception,xpath_exception>> on parsing errors; also, XPath functions may throw `std::bad_alloc` in low memory conditions. Still, XPath functions provide strong exception guarantee.
+
+[[dom.memory]]
+=== Memory management
+
+pugixml requests the memory needed for document storage in big chunks, and allocates document data inside those chunks. This section discusses replacing functions used for chunk allocation and internal memory management implementation.
+
+[[dom.memory.custom]]
+==== Custom memory allocation/deallocation functions
+
+[[allocation_function]][[deallocation_function]]
+All memory for tree structure, tree data and XPath objects is allocated via globally specified functions, which default to malloc/free. You can set your own allocation functions with set_memory_management function. The function interfaces are the same as that of malloc/free:
+
+[source]
+----
+typedef void* (*allocation_function)(size_t size);
+typedef void (*deallocation_function)(void* ptr);
+----
+
+[[set_memory_management_functions]][[get_memory_allocation_function]][[get_memory_deallocation_function]]
+You can use the following accessor functions to change or get current memory management functions:
+
+[source]
+----
+void set_memory_management_functions(allocation_function allocate, deallocation_function deallocate);
+allocation_function get_memory_allocation_function();
+deallocation_function get_memory_deallocation_function();
+----
+
+Allocation function is called with the size (in bytes) as an argument and should return a pointer to a memory block with alignment that is suitable for storage of primitive types (usually a maximum of `void*` and `double` types alignment is sufficient) and size that is greater than or equal to the requested one. If the allocation fails, the function has to either return null pointer or to throw an exception.
+
+Deallocation function is called with the pointer that was returned by some call to allocation function; it is never called with a null pointer. If memory management functions are not thread-safe, library thread safety is not guaranteed.
+
+This is a simple example of custom memory management (link:samples/custom_memory_management.cpp[]):
+
+[source,indent=0]
+----
+include::samples/custom_memory_management.cpp[tags=decl] 
+----
+[source,indent=0]
+----
+include::samples/custom_memory_management.cpp[tags=call] 
+----
+
+When setting new memory management functions, care must be taken to make sure that there are no live pugixml objects. Otherwise when the objects are destroyed, the new deallocation function will be called with the memory obtained by the old allocation function, resulting in undefined behavior.
+
+[[dom.memory.tuning]]
+==== Memory consumption tuning
+
+There are several important buffering optimizations in pugixml that rely on predefined constants. These constants have default values that were tuned for common usage patterns; for some applications, changing these constants might improve memory consumption or increase performance. Changing these constants is not recommended unless their default values result in visible problems.
+
+These constants can be tuned via configuration defines, as discussed in <<install.building.config>>; it is recommended to set them in `pugiconfig.hpp`.
+
+* `PUGIXML_MEMORY_PAGE_SIZE` controls the page size for document memory allocation. Memory for node/attribute objects is allocated in pages of the specified size. The default size is 32 Kb; for some applications the size is too large (i.e. embedded systems with little heap space or applications that keep lots of XML documents in memory). A minimum size of 1 Kb is recommended.
+
+* `PUGIXML_MEMORY_OUTPUT_STACK` controls the cumulative stack space required to output the node. Any output operation (i.e. saving a subtree to file) uses an internal buffering scheme for performance reasons. The default size is 10 Kb; if you're using node output from threads with little stack space, decreasing this value can prevent stack overflows. A minimum size of 1 Kb is recommended.
+
+* `PUGIXML_MEMORY_XPATH_PAGE_SIZE` controls the page size for XPath memory allocation. Memory for XPath query objects as well as internal memory for XPath evaluation is allocated in pages of the specified size. The default size is 4 Kb; if you have a lot of resident XPath query objects, you might need to decrease the size to improve memory consumption. A minimum size of 256 bytes is recommended.
+
+[[dom.memory.internals]]
+==== Document memory management internals
+
+Constructing a document object using the default constructor does not result in any allocations; document node is stored inside the <<xml_document,xml_document>> object.
+
+When the document is loaded from file/buffer, unless an inplace loading function is used (see <<loading.memory>>), a complete copy of character stream is made; all names/values of nodes and attributes are allocated in this buffer. This buffer is allocated via a single large allocation and is only freed when document memory is reclaimed (i.e. if the <<xml_document,xml_document>> object is destroyed or if another document is loaded in the same object). Also when loading from file or stream, an additional large allocation may be performed if encoding conversion is required; a temporary buffer is allocated, and it is freed before load function returns.
+
+All additional memory, such as memory for document structure (node/attribute objects) and memory for node/attribute names/values is allocated in pages on the order of 32 Kb; actual objects are allocated inside the pages using a memory management scheme optimized for fast allocation/deallocation of many small objects. Because of the scheme specifics, the pages are only destroyed if all objects inside them are destroyed; also, generally destroying an object does not mean that subsequent object creation will reuse the same memory. This means that it is possible to devise a usage scheme which will lead to higher memory usage than expected; one example is adding a lot of nodes, and them removing all even numbered ones; not a single page is reclaimed in the process. However this is an example specifically crafted to produce unsatisfying behavior; in all practical usage scenarios the memory consumption is less than that of a general-purpose allocator because allocation meta-data is very small in size.
+
+[[loading]]
+== Loading document
+
+pugixml provides several functions for loading XML data from various places - files, C{plus}{plus} iostreams, memory buffers. All functions use an extremely fast non-validating parser. This parser is not fully W3C conformant - it can load any valid XML document, but does not perform some well-formedness checks. While considerable effort is made to reject invalid XML documents, some validation is not performed for performance reasons. Also some XML transformations (i.e. EOL handling or attribute value normalization) can impact parsing speed and thus can be disabled. However for vast majority of XML documents there is no performance difference between different parsing options. Parsing options also control whether certain XML nodes are parsed; see <<loading.options>> for more information.
+
+XML data is always converted to internal character format (see <<dom.unicode>>) before parsing. pugixml supports all popular Unicode encodings (UTF-8, UTF-16 (big and little endian), UTF-32 (big and little endian); UCS-2 is naturally supported since it's a strict subset of UTF-16) and handles all encoding conversions automatically. Unless explicit encoding is specified, loading functions perform automatic encoding detection based on first few characters of XML data, so in almost all cases you do not have to specify document encoding. Encoding conversion is described in more detail in <<loading.encoding>>.
+
+[[loading.file]]
+=== Loading document from file
+
+[[xml_document::load_file]][[xml_document::load_file_wide]]
+The most common source of XML data is files; pugixml provides dedicated functions for loading an XML document from file:
+
+[source]
+----
+xml_parse_result xml_document::load_file(const char* path, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+xml_parse_result xml_document::load_file(const wchar_t* path, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+----
+ 
+These functions accept the file path as its first argument, and also two optional arguments, which specify parsing options (see <<loading.options>>) and input data encoding (see <<loading.encoding>>). The path has the target operating system format, so it can be a relative or absolute one, it should have the delimiters of the target system, it should have the exact case if the target file system is case-sensitive, etc.
+
+File path is passed to the system file opening function as is in case of the first function (which accepts `const char* path`); the second function either uses a special file opening function if it is provided by the runtime library or converts the path to UTF-8 and uses the system file opening function.
+
+`load_file` destroys the existing document tree and then tries to load the new tree from the specified file. The result of the operation is returned in an <<xml_parse_result,xml_parse_result>> object; this object contains the operation status and the related information (i.e. last successfully parsed position in the input file, if parsing fails). See <<loading.errors>> for error handling details.
+
+This is an example of loading XML document from file (link:samples/load_file.cpp[]):
+
+[source,indent=0]
+----
+include::samples/load_file.cpp[tags=code] 
+----
+
+[[loading.memory]]
+=== Loading document from memory
+
+[[xml_document::load_buffer]][[xml_document::load_buffer_inplace]][[xml_document::load_buffer_inplace_own]]
+Sometimes XML data should be loaded from some other source than a file, i.e. HTTP URL; also you may want to load XML data from file using non-standard functions, i.e. to use your virtual file system facilities or to load XML from GZip-compressed files. All these scenarios require loading document from memory. First you should prepare a contiguous memory block with all XML data; then you have to invoke one of buffer loading functions. These functions will handle the necessary encoding conversions, if any, and then will parse the data into the corresponding XML tree. There are several buffer loading functions, which differ in the behavior and thus in performance/memory usage:
+
+[source]
+----
+xml_parse_result xml_document::load_buffer(const void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+xml_parse_result xml_document::load_buffer_inplace(void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+xml_parse_result xml_document::load_buffer_inplace_own(void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+----
+
+All functions accept the buffer which is represented by a pointer to XML data, `contents`, and data size in bytes. Also there are two optional arguments, which specify parsing options (see <<loading.options>>) and input data encoding (see <<loading.encoding>>). The buffer does not have to be zero-terminated.
+
+`load_buffer` function works with immutable buffer - it does not ever modify the buffer. Because of this restriction it has to create a private buffer and copy XML data to it before parsing (applying encoding conversions if necessary). This copy operation carries a performance penalty, so inplace functions are provided - `load_buffer_inplace` and `load_buffer_inplace_own` store the document data in the buffer, modifying it in the process. In order for the document to stay valid, you have to make sure that the buffer's lifetime exceeds that of the tree if you're using inplace functions. In addition to that, `load_buffer_inplace` does not assume ownership of the buffer, so you'll have to destroy it yourself; `load_buffer_inplace_own` assumes ownership of the buffer and destroys it once it is not needed. This means that if you're using `load_buffer_inplace_own`, you have to allocate memory with pugixml allocation function (you can get it via <<get_memory_allocation_function,get_memory_allocation_function>>).
+
+The best way from the performance/memory point of view is to load document using `load_buffer_inplace_own`; this function has maximum control of the buffer with XML data so it is able to avoid redundant copies and reduce peak memory usage while parsing. This is the recommended function if you have to load the document from memory and performance is critical.
+
+[[xml_document::load_string]]
+There is also a simple helper function for cases when you want to load the XML document from null-terminated character string:
+
+[source]
+----
+xml_parse_result xml_document::load_string(const char_t* contents, unsigned int options = parse_default);
+----
+
+It is equivalent to calling `load_buffer` with `size` being either `strlen(contents)` or `wcslen(contents) * sizeof(wchar_t)`, depending on the character type. This function assumes native encoding for input data, so it does not do any encoding conversion. In general, this function is fine for loading small documents from string literals, but has more overhead and less functionality than the buffer loading functions.
+
+This is an example of loading XML document from memory using different functions (link:samples/load_memory.cpp[]):
+
+[source,indent=0]
+----
+include::samples/load_memory.cpp[tags=decl] 
+----
+[source,indent=0]
+----
+include::samples/load_memory.cpp[tags=load_buffer] 
+----
+[source,indent=0]
+----
+include::samples/load_memory.cpp[tags=load_buffer_inplace_begin] 
+
+include::samples/load_memory.cpp[tags=load_buffer_inplace_end] 
+----
+[source,indent=0]
+----
+include::samples/load_memory.cpp[tags=load_buffer_inplace_own] 
+----
+[source,indent=0]
+----
+include::samples/load_memory.cpp[tags=load_string] 
+----
+
+[[loading.stream]]
+=== Loading document from C{plus}{plus} IOstreams
+
+[[xml_document::load_stream]]
+To enhance interoperability, pugixml provides functions for loading document from any object which implements C{plus}{plus} `std::istream` interface. This allows you to load documents from any standard C{plus}{plus} stream (i.e. file stream) or any third-party compliant implementation (i.e. Boost Iostreams). There are two functions, one works with narrow character streams, another handles wide character ones:
+
+[source]
+----
+xml_parse_result xml_document::load(std::istream& stream, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+xml_parse_result xml_document::load(std::wistream& stream, unsigned int options = parse_default);
+----
+
+`load` with `std::istream` argument loads the document from stream from the current read position to the end, treating the stream contents as a byte stream of the specified encoding (with encoding autodetection as necessary). Thus calling `xml_document::load` on an opened `std::ifstream` object is equivalent to calling `xml_document::load_file`.
+
+`load` with `std::wstream` argument treats the stream contents as a wide character stream (encoding is always <<encoding_wchar,encoding_wchar>>). Because of this, using `load` with wide character streams requires careful (usually platform-specific) stream setup (i.e. using the `imbue` function). Generally use of wide streams is discouraged, however it provides you the ability to load documents from non-Unicode encodings, i.e. you can load Shift-JIS encoded data if you set the correct locale.
+
+This is a simple example of loading XML document from file using streams (link:samples/load_stream.cpp[]); read the sample code for more complex examples involving wide streams and locales:
+
+[source,indent=0]
+----
+include::samples/load_stream.cpp[tags=code] 
+----
+
+[[loading.errors]]
+=== Handling parsing errors
+
+[[xml_parse_result]]
+All document loading functions return the parsing result via `xml_parse_result` object. It contains parsing status, the offset of last successfully parsed character from the beginning of the source stream, and the encoding of the source stream:
+
+[source]
+----
+struct xml_parse_result
+{
+ xml_parse_status status;
+ ptrdiff_t offset;
+ xml_encoding encoding;
+
+ operator bool() const;
+ const char* description() const;
+};
+----
+
+[[xml_parse_status]][[xml_parse_result::status]]
+Parsing status is represented as the `xml_parse_status` enumeration and can be one of the following:
+
+* [[status_ok]]`status_ok` means that no error was encountered during parsing; the source stream represents the valid XML document which was fully parsed and converted to a tree.
+
+* [[status_file_not_found]]`status_file_not_found` is only returned by `load_file` function and means that file could not be opened.
+* [[status_io_error]]`status_io_error` is returned by `load_file` function and by `load` functions with `std::istream`/`std::wstream` arguments; it means that some I/O error has occurred during reading the file/stream.
+* [[status_out_of_memory]]`status_out_of_memory` means that there was not enough memory during some allocation; any allocation failure during parsing results in this error.
+* [[status_internal_error]]`status_internal_error` means that something went horribly wrong; currently this error does not occur
+
+* [[status_unrecognized_tag]]`status_unrecognized_tag` means that parsing stopped due to a tag with either an empty name or a name which starts with incorrect character, such as `#`.
+* [[status_bad_pi]]`status_bad_pi` means that parsing stopped due to incorrect document declaration/processing instruction
+* [[status_bad_comment]]`status_bad_comment`, [[status_bad_cdata]]`status_bad_cdata`, [[status_bad_doctype]]`status_bad_doctype` and [[status_bad_pcdata]]`status_bad_pcdata` mean that parsing stopped due to the invalid construct of the respective type
+* [[status_bad_start_element]]`status_bad_start_element` means that parsing stopped because starting tag either had no closing `>` symbol or contained some incorrect symbol
+* [[status_bad_attribute]]`status_bad_attribute` means that parsing stopped because there was an incorrect attribute, such as an attribute without value or with value that is not quoted (note that `<node attr=1>` is incorrect in XML)
+* [[status_bad_end_element]]`status_bad_end_element` means that parsing stopped because ending tag had incorrect syntax (i.e. extra non-whitespace symbols between tag name and `>`)
+* [[status_end_element_mismatch]]`status_end_element_mismatch` means that parsing stopped because the closing tag did not match the opening one (i.e. `<node></nedo>`) or because some tag was not closed at all
+* [[status_no_document_element]]`status_no_document_element` means that no element nodes were discovered during parsing; this usually indicates an empty or invalid document
+
+[[xml_parse_result::description]]
+`description()` member function can be used to convert parsing status to a string; the returned message is always in English, so you'll have to write your own function if you need a localized string. However please note that the exact messages returned by `description()` function may change from version to version, so any complex status handling should be based on `status` value. Note that `description()` returns a `char` string even in `PUGIXML_WCHAR_MODE`; you'll have to call <<as_wide,as_wide>> to get the `wchar_t` string.
+
+If parsing failed because the source data was not a valid XML, the resulting tree is not destroyed - despite the fact that load function returns error, you can use the part of the tree that was successfully parsed. Obviously, the last element may have an unexpected name/value; for example, if the attribute value does not end with the necessary quotation mark, like in `<node attr="value>some data</node>` example, the value of attribute `attr` will contain the string `value>some data</node>`.
+
+[[xml_parse_result::offset]]
+In addition to the status code, parsing result has an `offset` member, which contains the offset of last successfully parsed character if parsing failed because of an error in source data; otherwise `offset` is 0. For parsing efficiency reasons, pugixml does not track the current line during parsing; this offset is in units of <<char_t,pugi::char_t>> (bytes for character mode, wide characters for wide character mode). Many text editors support 'Go To Position' feature - you can use it to locate the exact error position. Alternatively, if you're loading the document from memory, you can display the error chunk along with the error description (see the example code below).
+
+CAUTION: Offset is calculated in the XML buffer in native encoding; if encoding conversion is performed during parsing, offset can not be used to reliably track the error position.
+
+[[xml_parse_result::encoding]]
+Parsing result also has an `encoding` member, which can be used to check that the source data encoding was correctly guessed. It is equal to the exact encoding used during parsing (i.e. with the exact endianness); see <<loading.encoding>> for more information.
+
+[[xml_parse_result::bool]]
+Parsing result object can be implicitly converted to `bool`; if you do not want to handle parsing errors thoroughly, you can just check the return value of load functions as if it was a `bool`: `if (doc.load_file("file.xml")) { ... } else { ... }`.
+
+This is an example of handling loading errors (link:samples/load_error_handling.cpp[]):
+
+[source,indent=0]
+----
+include::samples/load_error_handling.cpp[tags=code] 
+----
+
+[[loading.options]]
+=== Parsing options
+
+All document loading functions accept the optional parameter `options`. This is a bitmask that customizes the parsing process: you can select the node types that are parsed and various transformations that are performed with the XML text. Disabling certain transformations can improve parsing performance for some documents; however, the code for all transformations is very well optimized, and thus the majority of documents won't get any performance benefit. As a rule of thumb, only modify parsing flags if you want to get some nodes in the document that are excluded by default (i.e. declaration or comment nodes).
+
+NOTE: You should use the usual bitwise arithmetics to manipulate the bitmask: to enable a flag, use `mask | flag`; to disable a flag, use `mask & ~flag`.
+
+These flags control the resulting tree contents:
+
+* [[parse_declaration]]`parse_declaration` determines if XML document declaration (node with type <<node_declaration,node_declaration>>) is to be put in DOM tree. If this flag is off, it is not put in the tree, but is still parsed and checked for correctness. This flag is *off* by default.
+
+* [[parse_doctype]]`parse_doctype` determines if XML document type declaration (node with type <<node_doctype,node_doctype>>) is to be put in DOM tree. If this flag is off, it is not put in the tree, but is still parsed and checked for correctness. This flag is *off* by default.
+
+* [[parse_pi]]`parse_pi` determines if processing instructions (nodes with type <<node_pi,node_pi>>) 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. Note that `<?xml ...?>` (document declaration) is not considered to be a PI. This flag is *off* by default.
+
+* [[parse_comments]]`parse_comments` determines if comments (nodes with type <<node_comment,node_comment>>) 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. This flag is *off* by default.
+
+* [[parse_cdata]]`parse_cdata` determines if CDATA sections (nodes with type <<node_cdata,node_cdata>>) 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. This flag is *on* by default.
+
+* [[parse_trim_pcdata]]`parse_trim_pcdata` determines if leading and trailing whitespace characters are to be removed from PCDATA nodes. While for some applications leading/trailing whitespace is significant, often the application only cares about the non-whitespace contents so it's easier to trim whitespace from text during parsing. This flag is *off* by default.
+
+* [[parse_ws_pcdata]]`parse_ws_pcdata` determines if PCDATA nodes (nodes with type <<node_pcdata,node_pcdata>>) 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 three children when `parse_ws_pcdata` is set (child with type <<node_pcdata,node_pcdata>> and value `" "`, child with type <<node_element,node_element>> and name `"a"`, and another child with type <<node_pcdata,node_pcdata>> and value `" "`), and only one child when `parse_ws_pcdata` is not set. This flag is *off* by default.
+
+* [[parse_ws_pcdata_single]]`parse_ws_pcdata_single` determines if whitespace-only PCDATA nodes that have no sibling nodes are to be put in DOM tree. In some cases application needs to parse the whitespace-only contents of nodes, i.e. `<node> </node>`, but is not interested in whitespace markup elsewhere. It is possible to use <<parse_ws_pcdata,parse_ws_pcdata>> flag in this case, but it results in excessive allocations and complicates document processing; this flag can be used to avoid that. As an example, after parsing XML string `<node> <a> </a> </node>` with `parse_ws_pcdata_single` flag set, `<node>` element will have one child `<a>`, and `<a>` element will have one child with type <<node_pcdata,node_pcdata>> and value `" "`. This flag has no effect if <<parse_ws_pcdata,parse_ws_pcdata>> is enabled. This flag is *off* by default.
+
+* [[parse_fragment]]`parse_fragment` determines if document should be treated as a fragment of a valid XML. Parsing document as a fragment leads to top-level PCDATA content (i.e. text that is not located inside a node) to be added to a tree, and additionally treats documents without element nodes as valid. This flag is *off* by default.
+
+CAUTION: Using in-place parsing (<<xml_document::load_buffer_inplace,load_buffer_inplace>>) with `parse_fragment` flag may result in the loss of the last character of the buffer if it is a part of PCDATA. Since PCDATA values are null-terminated strings, the only way to resolve this is to provide a null-terminated buffer as an input to `load_buffer_inplace` - i.e. `doc.load_buffer_inplace("test\0", 5, pugi::parse_default | pugi::parse_fragment)`.
+
+These flags control the transformation of tree element contents:
+
+* [[parse_escapes]]`parse_escapes` determines if character and entity references are to be expanded during the parsing process. Character references have the form `&#...;` or `&#x...;` (`...` is Unicode numeric representation of character in either decimal (`&#...;`) or hexadecimal (`&#x...;`) form), entity references are `&amp;lt;`, `&amp;gt;`, `&amp;amp;`, `&amp;apos;` and `&amp;quot;` (note that as pugixml does not handle DTD, the only allowed entities are predefined ones). If character/entity reference can not be expanded, it is left as is, so you can do additional processing later. Reference expansion is performed on attribute values and PCDATA content. This flag is *on* by default.
+
+* [[parse_eol]]`parse_eol` determines if EOL handling (that is, replacing sequences `\r\n` by a single `\n` character, and replacing all standalone `\r` characters by `\n`) is to be performed on input data (that is, comment contents, PCDATA/CDATA contents and attribute values). This flag is *on* by default.
+
+* [[parse_wconv_attribute]]`parse_wconv_attribute` determines if attribute value normalization should be performed for all attributes. This means, that whitespace characters (new line, tab and space) are replaced with space (`' '`). New line characters are always treated as if <<parse_eol,parse_eol>> is set, i.e. `\r\n` is converted to a single space. This flag is *on* by default.
+
+* [[parse_wnorm_attribute]]`parse_wnorm_attribute` determines if extended attribute value normalization should be performed for all attributes. This means, that after attribute values are normalized as if <<parse_wconv_attribute,parse_wconv_attribute>> was set, leading and trailing space characters are removed, and all sequences of space characters are replaced by a single space character. <<parse_wconv_attribute,parse_wconv_attribute>> has no effect if this flag is on. This flag is *off* by default.
+
+NOTE: `parse_wconv_attribute` option performs transformations that are required by W3C specification for attributes that are declared as CDATA; <<parse_wnorm_attribute,parse_wnorm_attribute>> performs transformations required for NMTOKENS attributes. In the absence of document type declaration all attributes should behave as if they are declared as CDATA, thus <<parse_wconv_attribute,parse_wconv_attribute>> is the default option.
+
+Additionally there are three predefined option masks:
+
+* [[parse_minimal]]`parse_minimal` has all options turned off. This option mask means that pugixml does not add declaration nodes, document type declaration nodes, PI nodes, CDATA sections and comments to the resulting tree and does not perform any conversion for input data, so theoretically it is the fastest mode. However, as mentioned above, in practice <<parse_default,parse_default>> is usually equally fast.
+
+* [[parse_default]]`parse_default` is the default set of flags, i.e. it has all options set to their default values. 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.
+
+* [[parse_full]]`parse_full` is the set of flags which adds nodes of all types to the resulting tree and performs default conversions for input data. It includes parsing CDATA sections, comments, PI nodes, document declaration node and document type declaration node, 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 in this mode.
+
+This is an example of using different parsing options (link:samples/load_options.cpp[]):
+
+[source,indent=0]
+----
+include::samples/load_options.cpp[tags=code] 
+----
+
+[[loading.encoding]]
+=== Encodings
+
+[[xml_encoding]]
+pugixml supports all popular Unicode encodings (UTF-8, UTF-16 (big and little endian), UTF-32 (big and little endian); UCS-2 is naturally supported since it's a strict subset of UTF-16) and handles all encoding conversions. Most loading functions accept the optional parameter `encoding`. This is a value of enumeration type `xml_encoding`, that can have the following values:
+
+* [[encoding_auto]]`encoding_auto` means that pugixml will try to guess the encoding based on source XML data. The algorithm is a modified version of the one presented in http://www.w3.org/TR/REC-xml/#sec-guessing-no-ext-info[Appendix F.1 of XML recommendation]; it tries to match the first few bytes of input data with the following patterns in strict order:
+** If first four bytes match UTF-32 BOM (Byte Order Mark), encoding is assumed to be UTF-32 with the endianness equal to that of BOM;
+** If first two bytes match UTF-16 BOM, encoding is assumed to be UTF-16 with the endianness equal to that of BOM;
+** If first three bytes match UTF-8 BOM, encoding is assumed to be UTF-8;
+** If first four bytes match UTF-32 representation of `<`, encoding is assumed to be UTF-32 with the corresponding endianness;
+** If first four bytes match UTF-16 representation of `<?`, encoding is assumed to be UTF-16 with the corresponding endianness;
+** If first two bytes match UTF-16 representation of `<`, encoding is assumed to be UTF-16 with the corresponding endianness (this guess may yield incorrect result, but it's better than UTF-8);
+** Otherwise encoding is assumed to be UTF-8.
+
+* [[encoding_utf8]]`encoding_utf8` corresponds to UTF-8 encoding as defined in the Unicode standard; UTF-8 sequences with length equal to 5 or 6 are not standard and are rejected.
+* [[encoding_utf16_le]]`encoding_utf16_le` corresponds to little-endian UTF-16 encoding as defined in the Unicode standard; surrogate pairs are supported.
+* [[encoding_utf16_be]]`encoding_utf16_be` corresponds to big-endian UTF-16 encoding as defined in the Unicode standard; surrogate pairs are supported.
+* [[encoding_utf16]]`encoding_utf16` corresponds to UTF-16 encoding as defined in the Unicode standard; the endianness is assumed to be that of the target platform.
+* [[encoding_utf32_le]]`encoding_utf32_le` corresponds to little-endian UTF-32 encoding as defined in the Unicode standard.
+* [[encoding_utf32_be]]`encoding_utf32_be` corresponds to big-endian UTF-32 encoding as defined in the Unicode standard.
+* [[encoding_utf32]]`encoding_utf32` corresponds to UTF-32 encoding as defined in the Unicode standard; the endianness is assumed to be that of the target platform.
+* [[encoding_wchar]]`encoding_wchar` corresponds to the encoding of `wchar_t` type; it has the same meaning as either `encoding_utf16` or `encoding_utf32`, depending on `wchar_t` size.
+* [[encoding_latin1]]`encoding_latin1` corresponds to ISO-8859-1 encoding (also known as Latin-1).
+
+The algorithm used for `encoding_auto` correctly detects any supported Unicode encoding for all well-formed XML documents (since they start with document declaration) and for all other XML documents that start with `<`; if your XML document does not start with `<` and has encoding that is different from UTF-8, use the specific encoding.
+
+NOTE: The current behavior for Unicode conversion is to skip all invalid UTF sequences during conversion. This behavior should not be relied upon; moreover, in case no encoding conversion is performed, the invalid sequences are not removed, so you'll get them as is in node/attribute contents.
+
+[[loading.w3c]]
+=== Conformance to W3C specification
+
+pugixml is not fully W3C conformant - it can load any valid XML document, but does not perform some well-formedness checks. While considerable effort is made to reject invalid XML documents, some validation is not performed because of performance reasons.
+
+There is only one non-conformant behavior when dealing with valid XML documents: pugixml does not use information supplied in document type declaration for parsing. This means that entities declared in DOCTYPE are not expanded, and all attribute/PCDATA values are always processed in a uniform way that depends only on parsing options.
+
+As for rejecting invalid XML documents, there are a number of incompatibilities with W3C specification, including:
+
+* Multiple attributes of the same node can have equal names.
+* All non-ASCII characters are treated in the same way as symbols of English alphabet, so some invalid tag names are not rejected.
+* Attribute values which contain `<` are not rejected.
+* Invalid entity/character references are not rejected and are instead left as is.
+* Comment values can contain `--`.
+* XML data is not required to begin with document declaration; additionally, document declaration can appear after comments and other nodes.
+* Invalid document type declarations are silently ignored in some cases.
+
+[[access]]
+== Accessing document data
+
+pugixml features an extensive interface for getting various types of data from the document and for traversing the document. This section provides documentation for all such functions that do not modify the tree except for XPath-related functions; see <<xpath>> for XPath reference. As discussed in <<dom.cpp>>, there are two types of handles to tree data - <<xml_node,xml_node>> and <<xml_attribute,xml_attribute>>. The handles have special null (empty) values which propagate through various functions and thus are useful for writing more concise code; see <<node_null,this description>> for details. The documentation in this section will explicitly state the results of all function in case of null inputs.
+
+[import samples/traverse_base.cpp]
+
+[[access.basic]]
+=== Basic traversal functions
+
+[[xml_node::parent]][[xml_node::first_child]][[xml_node::last_child]][[xml_node::next_sibling]][[xml_node::previous_sibling]][[xml_node::first_attribute]][[xml_node::last_attribute]][[xml_attribute::next_attribute]][[xml_attribute::previous_attribute]]
+The internal representation of the document is a tree, where each node has a list of child nodes (the order of children corresponds to their order in the XML representation), and additionally element nodes have a list of attributes, which is also ordered. Several functions are provided in order to let you get from one node in the tree to the other. These functions roughly correspond to the internal representation, and thus are usually building blocks for other methods of traversing (i.e. XPath traversals are based on these functions).
+ 
+[source]
+----
+xml_node xml_node::parent() const;
+xml_node xml_node::first_child() const;
+xml_node xml_node::last_child() const;
+xml_node xml_node::next_sibling() const;
+xml_node xml_node::previous_sibling() const;
+
+xml_attribute xml_node::first_attribute() const;
+xml_attribute xml_node::last_attribute() const;
+xml_attribute xml_attribute::next_attribute() const;
+xml_attribute xml_attribute::previous_attribute() const;
+----
+
+`parent` function returns the node's parent; all non-null nodes except the document have non-null parent. `first_child` and `last_child` return the first and last child of the node, respectively; note that only document nodes and element nodes can have non-empty child node list. If node has no children, both functions return null nodes. `next_sibling` and `previous_sibling` return the node that's immediately to the right/left of this node in the children list, respectively - for example, in `<a/><c/>`, calling `next_sibling` for a handle that points to `` results in a handle pointing to `<c/>`, and calling `previous_sibling` results in handle pointing to `<a/>`. If node does not have next/previous sibling (this happens if it is the last/first node in the list, respectively), the functions return null nodes. `first_attribute`, `last_attribute`, `next_attribute` and `previous_attribute` functions behave similarly to the corresponding child node functions and allow to iterate through attribute list in the same way.
+
+NOTE: Because of memory consumption reasons, attributes do not have a link to their parent nodes. Thus there is no `xml_attribute::parent()` function.
+
+Calling any of the functions above on the null handle results in a null handle - i.e. `node.first_child().next_sibling()` returns the second child of `node`, and null handle if `node` is null, has no children at all or if it has only one child node.
+
+With these functions, you can iterate through all child nodes and display all attributes like this (link:samples/traverse_base.cpp[]):
+
+[source,indent=0]
+----
+include::samples/traverse_base.cpp[tags=basic] 
+----
+
+[[access.nodedata]]
+=== Getting node data
+
+[[xml_node::name]][[xml_node::value]]
+Apart from structural information (parent, child nodes, attributes), nodes can have name and value, both of which are strings. Depending on node type, name or value may be absent. <<node_document,node_document>> nodes do not have a name or value, <<node_element,node_element>> and <<node_declaration,node_declaration>> nodes always have a name but never have a value, <<node_pcdata,node_pcdata>>, <<node_cdata,node_cdata>>, <<node_comment,node_comment>> and <<node_doctype,node_doctype>> nodes never have a name but always have a value (it may be empty though), <<node_pi,node_pi>> nodes always have a name and a value (again, value may be empty). In order to get node's name or value, you can use the following functions:
+
+[source]
+----
+const char_t* xml_node::name() const;
+const char_t* xml_node::value() const;
+----
+
+In case node does not have a name or value or if the node handle is null, both functions return empty strings - they never return null pointers.
+
+[[xml_node::child_value]]
+It is common to store data as text contents of some node - i.e. `<node><description>This is a node</description></node>`. In this case, `<description>` node does not have a value, but instead has a child of type <<node_pcdata,node_pcdata>> with value `"This is a node"`. pugixml provides several helper functions to parse such data:
+
+[source]
+----
+const char_t* xml_node::child_value() const;
+const char_t* xml_node::child_value(const char_t* name) const;
+xml_text xml_node::text() const;
+----
+
+`child_value()` returns the value of the first child with type <<node_pcdata,node_pcdata>> or <<node_cdata,node_cdata>>; `child_value(name)` is a simple wrapper for `child(name).child_value()`. For the above example, calling `node.child_value("description")` and `description.child_value()` will both produce string `"This is a node"`. If there is no child with relevant type, or if the handle is null, `child_value` functions return empty string.
+
+`text()` returns a special object that can be used for working with PCDATA contents in more complex cases than just retrieving the value; it is described in <<access.text>> sections.
+
+There is an example of using some of these functions <<code_traverse_base_data,at the end of the next section>>.
+
+[[access.attrdata]]
+=== Getting attribute data
+
+[[xml_attribute::name]][[xml_attribute::value]]
+All attributes have name and value, both of which are strings (value may be empty). There are two corresponding accessors, like for `xml_node`:
+
+[source]
+----
+const char_t* xml_attribute::name() const;
+const char_t* xml_attribute::value() const;
+----
+
+In case the attribute handle is null, both functions return empty strings - they never return null pointers.
+
+[[xml_attribute::as_string]]
+If you need a non-empty string if the attribute handle is null (for example, you need to get the option value from XML attribute, but if it is not specified, you need it to default to `"sorted"` instead of `""`), you can use `as_string` accessor:
+
+[source]
+----
+const char_t* xml_attribute::as_string(const char_t* def = "") const;
+----
+
+It returns `def` argument if the attribute handle is null. If you do not specify the argument, the function is equivalent to `value()`.
+
+[[xml_attribute::as_int]][[xml_attribute::as_uint]][[xml_attribute::as_double]][[xml_attribute::as_float]][[xml_attribute::as_bool]][[xml_attribute::as_llong]][[xml_attribute::as_ullong]]
+In many cases attribute values have types that are not strings - i.e. an attribute may always contain values that should be treated as integers, despite the fact that they are represented as strings in XML. pugixml provides several accessors that convert attribute value to some other type:
+ 
+[source]
+----
+int xml_attribute::as_int(int def = 0) const;
+unsigned int xml_attribute::as_uint(unsigned int def = 0) const;
+double xml_attribute::as_double(double def = 0) const;
+float xml_attribute::as_float(float def = 0) const;
+bool xml_attribute::as_bool(bool def = false) const;
+long long xml_attribute::as_llong(long long def = 0) const;
+unsigned long long xml_attribute::as_ullong(unsigned long long def = 0) const;
+----
+
+`as_int`, `as_uint`, `as_llong`, `as_ullong`, `as_double` and `as_float` convert attribute values to numbers. If attribute handle is null or attribute value is empty, `def` argument is returned (which is 0 by default). Otherwise, all leading whitespace characters are truncated, and the remaining string is parsed as an integer number in either decimal or hexadecimal form (applicable to `as_int`, `as_uint`, `as_llong` and `as_ullong`; hexadecimal format is used if the number has `0x` or `0X` prefix) or as a floating point number in either decimal or scientific form (`as_double` or `as_float`). Any extra characters are silently discarded, i.e. `as_int` will return `1` for string `"1abc"`.
+
+In case the input string contains a number that is out of the target numeric range, the result is undefined.
+
+CAUTION: Number conversion functions depend on current C locale as set with `setlocale`, so may return unexpected results if the locale is different from `"C"`.
+
+`as_bool` converts attribute value to boolean as follows: if attribute handle is null, `def` argument is returned (which is `false` by default). If attribute value is empty, `false` is returned. Otherwise, `true` is returned if the first character is one of `'1', 't', 'T', 'y', 'Y'`. This means that strings like `"true"` and `"yes"` are recognized as `true`, while strings like `"false"` and `"no"` are recognized as `false`. For more complex matching you'll have to write your own function.
+
+NOTE: `as_llong` and `as_ullong` are only available if your platform has reliable support for the `long long` type, including string conversions.
+
+[[code_traverse_base_data]]
+This is an example of using these functions, along with node data retrieval ones (link:samples/traverse_base.cpp[]):
+
+[source,indent=0]
+----
+include::samples/traverse_base.cpp[tags=data] 
+----
+
+[[access.contents]]
+=== Contents-based traversal functions
+
+[[xml_node::child]][[xml_node::attribute]][[xml_node::next_sibling_name]][[xml_node::previous_sibling_name]]
+Since a lot of document traversal consists of finding the node/attribute with the correct name, there are special functions for that purpose:
+
+[source]
+----
+xml_node xml_node::child(const char_t* name) const;
+xml_attribute xml_node::attribute(const char_t* name) const;
+xml_node xml_node::next_sibling(const char_t* name) const;
+xml_node xml_node::previous_sibling(const char_t* name) const;
+----
+
+`child` and `attribute` return the first child/attribute with the specified name; `next_sibling` and `previous_sibling` return the first sibling in the corresponding direction with the specified name. All string comparisons are case-sensitive. In case the node handle is null or there is no node/attribute with the specified name, null handle is returned.
+
+`child` and `next_sibling` functions can be used together to loop through all child nodes with the desired name like this:
+
+[source]
+----
+for (pugi::xml_node tool = tools.child("Tool"); tool; tool = tool.next_sibling("Tool"))
+----
+
+[[xml_node::find_child_by_attribute]]
+Occasionally the needed node is specified not by the unique name but instead by the value of some attribute; for example, it is common to have node collections with each node having a unique id: `<group><item id="1"/> <item id="2"/></group>`. There are two functions for finding child nodes based on the attribute values:
+
+[source]
+----
+xml_node xml_node::find_child_by_attribute(const char_t* name, const char_t* attr_name, const char_t* attr_value) const;
+xml_node xml_node::find_child_by_attribute(const char_t* attr_name, const char_t* attr_value) const;
+----
+
+The three-argument function returns the first child node with the specified name which has an attribute with the specified name/value; the two-argument function skips the name test for the node, which can be useful for searching in heterogeneous collections. If the node handle is null or if no node is found, null handle is returned. All string comparisons are case-sensitive.
+
+In all of the above functions, all arguments have to be valid strings; passing null pointers results in undefined behavior.
+
+This is an example of using these functions (link:samples/traverse_base.cpp[]):
+
+[source,indent=0]
+----
+include::samples/traverse_base.cpp[tags=contents] 
+----
+
+[[access.rangefor]]
+=== Range-based for-loop support
+
+[[xml_node::children]][[xml_node::attributes]]
+If your C{plus}{plus} compiler supports range-based for-loop (this is a C{plus}{plus}11 feature, at the time of writing it's supported by Microsoft Visual Studio 2012+, GCC 4.6+ and Clang 3.0+), you can use it to enumerate nodes/attributes. Additional helpers are provided to support this; note that they are also compatible with http://www.boost.org/libs/foreach/[Boost Foreach], and possibly other pre-C{plus}{plus}11 foreach facilities.
+
+[source,subs="+quotes"]
+----
+_implementation_-_defined_-_type_ xml_node::children() const;
+_implementation_-_defined_-_type_ xml_node::children(const char_t* name) const;
+_implementation_-_defined_-_type_ xml_node::attributes() const;
+----
+
+`children` function allows you to enumerate all child nodes; `children` function with `name` argument allows you to enumerate all child nodes with a specific name; `attributes` function allows you to enumerate all attributes of the node. Note that you can also use node object itself in a range-based for construct, which is equivalent to using `children()`.
+
+This is an example of using these functions (link:samples/traverse_rangefor.cpp[]):
+
+[source,indent=0]
+----
+include::samples/traverse_rangefor.cpp[tags=code] 
+----
+
+[[access.iterators]]
+=== Traversing node/attribute lists via iterators
+
+[[xml_node_iterator]][[xml_attribute_iterator]][[xml_node::begin]][[xml_node::end]][[xml_node::attributes_begin]][[xml_node::attributes_end]]
+Child node lists and attribute lists are simply double-linked lists; while you can use `previous_sibling`/`next_sibling` and other such functions for iteration, pugixml additionally provides node and attribute iterators, so that you can treat nodes as containers of other nodes or attributes:
+
+[source]
+----
+class xml_node_iterator;
+class xml_attribute_iterator;
+
+typedef xml_node_iterator xml_node::iterator;
+iterator xml_node::begin() const;
+iterator xml_node::end() const;
+
+typedef xml_attribute_iterator xml_node::attribute_iterator;
+attribute_iterator xml_node::attributes_begin() const;
+attribute_iterator xml_node::attributes_end() const;
+----
+
+`begin` and `attributes_begin` return iterators that point to the first node/attribute, respectively; `end` and `attributes_end` return past-the-end iterator for node/attribute list, respectively - this iterator can't be dereferenced, but decrementing it results in an iterator pointing to the last element in the list (except for empty lists, where decrementing past-the-end iterator results in undefined behavior). Past-the-end iterator is commonly used as a termination value for iteration loops (see sample below). If you want to get an iterator that points to an existing handle, you can construct the iterator with the handle as a single constructor argument, like so: `xml_node_iterator(node)`. For `xml_attribute_iterator`, you'll have to provide both an attribute and its parent node.
+
+`begin` and `end` return equal iterators if called on null node; such iterators can't be dereferenced. `attributes_begin` and `attributes_end` behave the same way. For correct iterator usage this means that child node/attribute collections of null nodes appear to be empty.
+
+Both types of iterators have bidirectional iterator semantics (i.e. they can be incremented and decremented, but efficient random access is not supported) and support all usual iterator operations - comparison, dereference, etc. The iterators are invalidated if the node/attribute objects they're pointing to are removed from the tree; adding nodes/attributes does not invalidate any iterators.
+
+Here is an example of using iterators for document traversal (link:samples/traverse_iter.cpp[]):
+
+[source,indent=0]
+----
+include::samples/traverse_iter.cpp[tags=code] 
+----
+
+CAUTION: Node and attribute iterators are somewhere in the middle between const and non-const iterators. While dereference operation yields a non-constant reference to the object, so that you can use it for tree modification operations, modifying this reference using assignment - i.e. passing iterators to a function like `std::sort` - will not give expected results, as assignment modifies local handle that's stored in the iterator.
+
+[[access.walker]]
+=== Recursive traversal with xml_tree_walker
+
+[[xml_tree_walker]]
+The methods described above allow traversal of immediate children of some node; if you want to do a deep tree traversal, you'll have to do it via a recursive function or some equivalent method. However, pugixml provides a helper for depth-first traversal of a subtree. In order to use it, you have to implement `xml_tree_walker` interface and to call `traverse` function:
+
+[source]
+----
+class xml_tree_walker
+{
+public:
+ virtual bool begin(xml_node& node);
+ virtual bool for_each(xml_node& node) = 0;
+ virtual bool end(xml_node& node);
+
+ int depth() const;
+};
+
+bool xml_node::traverse(xml_tree_walker& walker);
+----
+
+[[xml_tree_walker::begin]][[xml_tree_walker::for_each]][[xml_tree_walker::end]][[xml_node::traverse]]
+The traversal is launched by calling `traverse` function on traversal root and proceeds as follows:
+
+* First, `begin` function is called with traversal root as its argument.
+* Then, `for_each` function is called for all nodes in the traversal subtree in depth first order, excluding the traversal root. Node is passed as an argument.
+* Finally, `end` function is called with traversal root as its argument.
+
+If `begin`, `end` or any of the `for_each` calls return `false`, the traversal is terminated and `false` is returned as the traversal result; otherwise, the traversal results in `true`. Note that you don't have to override `begin` or `end` functions; their default implementations return `true`.
+
+[[xml_tree_walker::depth]]
+You can get the node's depth relative to the traversal root at any point by calling `depth` function. It returns `-1` if called from `begin`/`end`, and returns 0-based depth if called from `for_each` - depth is 0 for all children of the traversal root, 1 for all grandchildren and so on.
+
+This is an example of traversing tree hierarchy with xml_tree_walker (link:samples/traverse_walker.cpp[]):
+
+[source,indent=0]
+----
+include::samples/traverse_walker.cpp[tags=impl] 
+----
+[source,indent=0]
+----
+include::samples/traverse_walker.cpp[tags=traverse] 
+----
+
+[[access.predicate]]
+=== Searching for nodes/attributes with predicates
+
+[[xml_node::find_attribute]][[xml_node::find_child]][[xml_node::find_node]]
+While there are existing functions for getting a node/attribute with known contents, they are often not sufficient for simple queries. As an alternative for manual iteration through nodes/attributes until the needed one is found, you can make a predicate and call one of `find_` functions:
+
+[source]
+----
+template <typename Predicate> xml_attribute xml_node::find_attribute(Predicate pred) const;
+template <typename Predicate> xml_node xml_node::find_child(Predicate pred) const;
+template <typename Predicate> xml_node xml_node::find_node(Predicate pred) const;
+----
+
+The predicate should be either a plain function or a function object which accepts one argument of type `xml_attribute` (for `find_attribute`) or `xml_node` (for `find_child` and `find_node`), and returns `bool`. The predicate is never called with null handle as an argument.
+
+`find_attribute` function iterates through all attributes of the specified node, and returns the first attribute for which the predicate returned `true`. If the predicate returned `false` for all attributes or if there were no attributes (including the case where the node is null), null attribute is returned.
+
+`find_child` function iterates through all child nodes of the specified node, and returns the first node for which the predicate returned `true`. If the predicate returned `false` for all nodes or if there were no child nodes (including the case where the node is null), null node is returned.
+
+`find_node` function performs a depth-first traversal through the subtree of the specified node (excluding the node itself), and returns the first node for which the predicate returned `true`. If the predicate returned `false` for all nodes or if subtree was empty, null node is returned.
+
+This is an example of using predicate-based functions (link:samples/traverse_predicate.cpp[]):
+
+[source,indent=0]
+----
+include::samples/traverse_predicate.cpp[tags=decl] 
+----
+[source,indent=0]
+----
+include::samples/traverse_predicate.cpp[tags=find] 
+----
+
+[[access.text]]
+=== Working with text contents
+
+[[xml_text]]
+It is common to store data as text contents of some node - i.e. `<node><description>This is a node</description></node>`. In this case, `<description>` node does not have a value, but instead has a child of type <<node_pcdata,node_pcdata>> with value `"This is a node"`. pugixml provides a special class, `xml_text`, to work with such data. Working with text objects to modify data is described in <<modify.text,the documentation for modifying document data>>; this section describes the access interface of `xml_text`.
+
+[[xml_node::text]]
+You can get the text object from a node by using `text()` method:
+ 
+[source]
+----
+xml_text xml_node::text() const;
+----
+
+If the node has a type `node_pcdata` or `node_cdata`, then the node itself is used to return data; otherwise, a first child node of type `node_pcdata` or `node_cdata` is used.
+
+[[xml_text::empty]][[xml_text::unspecified_bool_type]]
+You can check if the text object is bound to a valid PCDATA/CDATA node by using it as a boolean value, i.e. `if (text) { ... }` or `if (!text) { ... }`. Alternatively you can check it by using the `empty()` method:
+
+[source]
+----
+bool xml_text::empty() const;
+----
+
+[[xml_text::get]]
+Given a text object, you can get the contents (i.e. the value of PCDATA/CDATA node) by using the following function:
+
+[source]
+----
+const char_t* xml_text::get() const;
+----
+
+In case text object is empty, the function returns an empty string - it never returns a null pointer.
+
+[[xml_text::as_string]][[xml_text::as_int]][[xml_text::as_uint]][[xml_text::as_double]][[xml_text::as_float]][[xml_text::as_bool]][[xml_text::as_llong]][[xml_text::as_ullong]]
+If you need a non-empty string if the text object is empty, or if the text contents is actually a number or a boolean that is stored as a string, you can use the following accessors:
+
+[source]
+----
+const char_t* xml_text::as_string(const char_t* def = "") const;
+int xml_text::as_int(int def = 0) const;
+unsigned int xml_text::as_uint(unsigned int def = 0) const;
+double xml_text::as_double(double def = 0) const;
+float xml_text::as_float(float def = 0) const;
+bool xml_text::as_bool(bool def = false) const;
+long long xml_text::as_llong(long long def = 0) const;
+unsigned long long xml_text::as_ullong(unsigned long long def = 0) const;
+----
+
+All of the above functions have the same semantics as similar `xml_attribute` members: they return the default argument if the text object is empty, they convert the text contents to a target type using the same rules and restrictions. You can <<xml_attribute::as_int,refer to documentation for the attribute functions>> for details.
+
+[[xml_text::data]]
+`xml_text` is essentially a helper class that operates on `xml_node` values. It is bound to a node of type <<node_pcdata,node_pcdata>> or <<node_cdata,node_cdata>>. You can use the following function to retrieve this node:
+
+[source]
+----
+xml_node xml_text::data() const;
+----
+
+Essentially, assuming `text` is an `xml_text` object, calling `text.get()` is equivalent to calling `text.data().value()`.
+
+This is an example of using `xml_text` object (link:samples/text.cpp[]):
+
+[source,indent=0]
+----
+include::samples/text.cpp[tags=access] 
+----
+
+[[access.misc]]
+=== Miscellaneous functions
+
+[[xml_node::root]]
+If you need to get the document root of some node, you can use the following function:
+
+[source]
+----
+xml_node xml_node::root() const;
+----
+
+This function returns the node with type <<node_document,node_document>>, which is the root node of the document the node belongs to (unless the node is null, in which case null node is returned).
+
+[[xml_node::path]][[xml_node::first_element_by_path]]
+While pugixml supports complex XPath expressions, sometimes a simple path handling facility is needed. There are two functions, for getting node path and for converting path to a node:
+
+[source]
+----
+string_t xml_node::path(char_t delimiter = '/') const;
+xml_node xml_node::first_element_by_path(const char_t* path, char_t delimiter = '/') const;
+----
+
+Node paths consist of node names, separated with a delimiter (which is `/` by default); also paths can contain self (`.`) and parent (`..`) pseudo-names, so that this is a valid path: `"../../foo/./bar"`. `path` returns the path to the node from the document root, `first_element_by_path` looks for a node represented by a given path; a path can be an absolute one (absolute paths start with the delimiter), in which case the rest of the path is treated as document root relative, and relative to the given node. For example, in the following document: `<a><c/></a>`, node `<c/>` has path `"a/b/c"`; calling `first_element_by_path` for document with path `"a/b"` results in node ``; calling `first_element_by_path` for node `<a/>` with path `"../a/./b/../."` results in node `<a/>`; calling `first_element_by_path` with path `"/a"` results in node `<a/>` for any node.
+
+In case path component is ambiguous (if there are two nodes with given name), the first one is selected; paths are not guaranteed to uniquely identify nodes in a document. If any component of a path is not found, the result of `first_element_by_path` is null node; also `first_element_by_path` returns null node for null nodes, in which case the path does not matter. `path` returns an empty string for null nodes. 
+
+NOTE: `path` function returns the result as STL string, and thus is not available if <<PUGIXML_NO_STL,PUGIXML_NO_STL>> is defined.
+
+[[xml_node::offset_debug]]
+pugixml does not record row/column information for nodes upon parsing for efficiency reasons. However, if the node has not changed in a significant way since parsing (the name/value are not changed, and the node itself is the original one, i.e. it was not deleted from the tree and re-added later), it is possible to get the offset from the beginning of XML buffer:
+
+[source]
+----
+ptrdiff_t xml_node::offset_debug() const;
+----
+
+If the offset is not available (this happens if the node is null, was not originally parsed from a stream, or has changed in a significant way), the function returns -1. Otherwise it returns the offset to node's data from the beginning of XML buffer in <<char_t,pugi::char_t>> units. For more information on parsing offsets, see <<xml_parse_result::offset,parsing error handling documentation>>.
+
+[[modify]]
+== Modifying document data
+
+The document in pugixml is fully mutable: you can completely change the document structure and modify the data of nodes/attributes. This section provides documentation for the relevant functions. All functions take care of memory management and structural integrity themselves, so they always result in structurally valid tree - however, it is possible to create an invalid XML tree (for example, by adding two attributes with the same name or by setting attribute/node name to empty/invalid string). Tree modification is optimized for performance and for memory consumption, so if you have enough memory you can create documents from scratch with pugixml and later save them to file/stream instead of relying on error-prone manual text writing and without too much overhead.
+
+All member functions that change node/attribute data or structure are non-constant and thus can not be called on constant handles. However, you can easily convert constant handle to non-constant one by simple assignment: `void foo(const pugi::xml_node& n) { pugi::xml_node nc = n; }`, so const-correctness here mainly provides additional documentation.
+
+[import samples/modify_base.cpp]
+
+[[modify.nodedata]]
+=== Setting node data
+
+[[xml_node::set_name]][[xml_node::set_value]]
+As discussed before, nodes can have name and value, both of which are strings. Depending on node type, name or value may be absent. <<node_document,node_document>> nodes do not have a name or value, <<node_element,node_element>> and <<node_declaration,node_declaration>> nodes always have a name but never have a value, <<node_pcdata,node_pcdata>>, <<node_cdata,node_cdata>>, <<node_comment,node_comment>> and <<node_doctype,node_doctype>> nodes never have a name but always have a value (it may be empty though), <<node_pi,node_pi>> nodes always have a name and a value (again, value may be empty). In order to set node's name or value, you can use the following functions:
+
+[source]
+----
+bool xml_node::set_name(const char_t* rhs);
+bool xml_node::set_value(const char_t* rhs);
+----
+
+Both functions try to set the name/value to the specified string, and return the operation result. The operation fails if the node can not have name or value (for instance, when trying to call `set_name` on a <<node_pcdata,node_pcdata>> node), if the node handle is null, or if there is insufficient memory to handle the request. The provided string is copied into document managed memory and can be destroyed after the function returns (for example, you can safely pass stack-allocated buffers to these functions). The name/value content is not verified, so take care to use only valid XML names, or the document may become malformed.
+
+This is an example of setting node name and value (link:samples/modify_base.cpp[]):
+
+[source,indent=0]
+----
+include::samples/modify_base.cpp[tags=node] 
+----
+
+[[modify.attrdata]]
+=== Setting attribute data
+
+[[xml_attribute::set_name]][[xml_attribute::set_value]]
+All attributes have name and value, both of which are strings (value may be empty). You can set them with the following functions:
+
+[source]
+----
+bool xml_attribute::set_name(const char_t* rhs);
+bool xml_attribute::set_value(const char_t* rhs);
+----
+
+Both functions try to set the name/value to the specified string, and return the operation result. The operation fails if the attribute handle is null, or if there is insufficient memory to handle the request. The provided string is copied into document managed memory and can be destroyed after the function returns (for example, you can safely pass stack-allocated buffers to these functions). The name/value content is not verified, so take care to use only valid XML names, or the document may become malformed.
+
+In addition to string functions, several functions are provided for handling attributes with numbers and booleans as values:
+
+[source]
+----
+bool xml_attribute::set_value(int rhs);
+bool xml_attribute::set_value(unsigned int rhs);
+bool xml_attribute::set_value(double rhs);
+bool xml_attribute::set_value(float rhs);
+bool xml_attribute::set_value(bool rhs);
+bool xml_attribute::set_value(long long rhs);
+bool xml_attribute::set_value(unsigned long long rhs);
+----
+ 
+The above functions convert the argument to string and then call the base `set_value` function. Integers are converted to a decimal form, floating-point numbers are converted to either decimal or scientific form, depending on the number magnitude, boolean values are converted to either `"true"` or `"false"`.
+
+CAUTION: Number conversion functions depend on current C locale as set with `setlocale`, so may generate unexpected results if the locale is different from `"C"`.
+
+NOTE: `set_value` overloads with `long long` type are only available if your platform has reliable support for the type, including string conversions.
+
+[[xml_attribute::assign]]
+
+For convenience, all `set_value` functions have the corresponding assignment operators:
+
+[source]
+----
+xml_attribute& xml_attribute::operator=(const char_t* rhs);
+xml_attribute& xml_attribute::operator=(int rhs);
+xml_attribute& xml_attribute::operator=(unsigned int rhs);
+xml_attribute& xml_attribute::operator=(double rhs);
+xml_attribute& xml_attribute::operator=(float rhs);
+xml_attribute& xml_attribute::operator=(bool rhs);
+xml_attribute& xml_attribute::operator=(long long rhs);
+xml_attribute& xml_attribute::operator=(unsigned long long rhs);
+----
+
+These operators simply call the right `set_value` function and return the attribute they're called on; the return value of `set_value` is ignored, so errors are ignored.
+
+This is an example of setting attribute name and value (link:samples/modify_base.cpp[]):
+
+[source,indent=0]
+----
+include::samples/modify_base.cpp[tags=attr] 
+----
+
+[[modify.add]]
+=== Adding nodes/attributes
+
+[[xml_node::prepend_attribute]][[xml_node::append_attribute]][[xml_node::insert_attribute_after]][[xml_node::insert_attribute_before]][[xml_node::prepend_child]][[xml_node::append_child]][[xml_node::insert_child_after]][[xml_node::insert_child_before]]
+Nodes and attributes do not exist without a document tree, so you can't create them without adding them to some document. A node or attribute can be created at the end of node/attribute list or before/after some other node:
+
+[source]
+----
+xml_attribute xml_node::append_attribute(const char_t* name);
+xml_attribute xml_node::prepend_attribute(const char_t* name);
+xml_attribute xml_node::insert_attribute_after(const char_t* name, const xml_attribute& attr);
+xml_attribute xml_node::insert_attribute_before(const char_t* name, const xml_attribute& attr);
+
+xml_node xml_node::append_child(xml_node_type type = node_element);
+xml_node xml_node::prepend_child(xml_node_type type = node_element);
+xml_node xml_node::insert_child_after(xml_node_type type, const xml_node& node);
+xml_node xml_node::insert_child_before(xml_node_type type, const xml_node& node);
+
+xml_node xml_node::append_child(const char_t* name);
+xml_node xml_node::prepend_child(const char_t* name);
+xml_node xml_node::insert_child_after(const char_t* name, const xml_node& node);
+xml_node xml_node::insert_child_before(const char_t* name, const xml_node& node);
+----
+
+`append_attribute` and `append_child` create a new node/attribute at the end of the corresponding list of the node the method is called on; `prepend_attribute` and `prepend_child` create a new node/attribute at the beginning of the list; `insert_attribute_after`, `insert_attribute_before`, `insert_child_after` and `insert_attribute_before` add the node/attribute before or after the specified node/attribute.
+
+Attribute functions create an attribute with the specified name; you can specify the empty name and change the name later if you want to. Node functions with the `type` argument create the node with the specified type; since node type can't be changed, you have to know the desired type beforehand. Also note that not all types can be added as children; see below for clarification. Node functions with the `name` argument create the element node (<<node_element,node_element>>) with the specified name.
+
+All functions return the handle to the created object on success, and null handle on failure. There are several reasons for failure:
+
+* Adding fails if the target node is null;
+* Only <<node_element,node_element>> nodes can contain attributes, so attribute adding fails if node is not an element;
+* Only <<node_document,node_document>> and <<node_element,node_element>> nodes can contain children, so child node adding fails if the target node is not an element or a document;
+* <<node_document,node_document>> and <<node_null,node_null>> nodes can not be inserted as children, so passing <<node_document,node_document>> or <<node_null,node_null>> value as `type` results in operation failure;
+* <<node_declaration,node_declaration>> nodes can only be added as children of the document node; attempt to insert declaration node as a child of an element node fails;
+* Adding node/attribute results in memory allocation, which may fail;
+* Insertion functions fail if the specified node or attribute is null or is not in the target node's children/attribute list.
+
+Even if the operation fails, the document remains in consistent state, but the requested node/attribute is not added.
+
+CAUTION: `attribute()` and `child()` functions do not add attributes or nodes to the tree, so code like `node.attribute("id") = 123;` will not do anything if `node` does not have an attribute with name `"id"`. Make sure you're operating with existing attributes/nodes by adding them if necessary.
+
+This is an example of adding new attributes/nodes to the document (link:samples/modify_add.cpp[]):
+
+[source,indent=0]
+----
+include::samples/modify_add.cpp[tags=code] 
+----
+
+[[modify.remove]]
+=== Removing nodes/attributes
+
+[[xml_node::remove_attribute]][[xml_node::remove_child]]
+If you do not want your document to contain some node or attribute, you can remove it with one of the following functions:
+
+[source]
+----
+bool xml_node::remove_attribute(const xml_attribute& a);
+bool xml_node::remove_child(const xml_node& n);
+----
+
+`remove_attribute` removes the attribute from the attribute list of the node, and returns the operation result. `remove_child` removes the child node with the entire subtree (including all descendant nodes and attributes) from the document, and returns the operation result. Removing fails if one of the following is true:
+
+* The node the function is called on is null;
+* The attribute/node to be removed is null;
+* The attribute/node to be removed is not in the node's attribute/child list.
+
+Removing the attribute or node invalidates all handles to the same underlying object, and also invalidates all iterators pointing to the same object. Removing node also invalidates all past-the-end iterators to its attribute or child node list. Be careful to ensure that all such handles and iterators either do not exist or are not used after the attribute/node is removed.
+
+If you want to remove the attribute or child node by its name, two additional helper functions are available:
+
+[source]
+----
+bool xml_node::remove_attribute(const char_t* name);
+bool xml_node::remove_child(const char_t* name);
+----
+
+These functions look for the first attribute or child with the specified name, and then remove it, returning the result. If there is no attribute or child with such name, the function returns `false`; if there are two nodes with the given name, only the first node is deleted. If you want to delete all nodes with the specified name, you can use code like this: `while (node.remove_child("tool")) ;`.
+
+This is an example of removing attributes/nodes from the document (link:samples/modify_remove.cpp[]):
+
+[source,indent=0]
+----
+include::samples/modify_remove.cpp[tags=code] 
+----
+
+[[modify.text]]
+=== Working with text contents
+
+pugixml provides a special class, `xml_text`, to work with text contents stored as a value of some node, i.e. `<node><description>This is a node</description></node>`. Working with text objects to retrieve data is described in <<access.text,the documentation for accessing document data>>; this section describes the modification interface of `xml_text`.
+
+[[xml_text::set]]
+Once you have an `xml_text` object, you can set the text contents using the following function:
+
+[source]
+----
+bool xml_text::set(const char_t* rhs);
+----
+
+This function tries to set the contents to the specified string, and returns the operation result. The operation fails if the text object was retrieved from a node that can not have a value and is not an element node (i.e. it is a <<node_declaration,node_declaration>> node), if the text object is empty, or if there is insufficient memory to handle the request. The provided string is copied into document managed memory and can be destroyed after the function returns (for example, you can safely pass stack-allocated buffers to this function). Note that if the text object was retrieved from an element node, this function creates the PCDATA child node if necessary (i.e. if the element node does not have a PCDATA/CDATA child already).
+
+[[xml_text::set_value]]
+In addition to a string function, several functions are provided for handling text with numbers and booleans as contents:
+
+[source]
+----
+bool xml_text::set(int rhs);
+bool xml_text::set(unsigned int rhs);
+bool xml_text::set(double rhs);
+bool xml_text::set(float rhs);
+bool xml_text::set(bool rhs);
+bool xml_text::set(long long rhs);
+bool xml_text::set(unsigned long long rhs);
+----
+ 
+The above functions convert the argument to string and then call the base `set` function. These functions have the same semantics as similar `xml_attribute` functions. You can <<xml_attribute::set_value,refer to documentation for the attribute functions>> for details.
+
+[[xml_text::assign]]
+
+For convenience, all `set` functions have the corresponding assignment operators:
+
+[source]
+----
+xml_text& xml_text::operator=(const char_t* rhs);
+xml_text& xml_text::operator=(int rhs);
+xml_text& xml_text::operator=(unsigned int rhs);
+xml_text& xml_text::operator=(double rhs);
+xml_text& xml_text::operator=(float rhs);
+xml_text& xml_text::operator=(bool rhs);
+xml_text& xml_text::operator=(long long rhs);
+xml_text& xml_text::operator=(unsigned long long rhs);
+----
+
+These operators simply call the right `set` function and return the attribute they're called on; the return value of `set` is ignored, so errors are ignored.
+
+This is an example of using `xml_text` object to modify text contents (link:samples/text.cpp[]):
+
+[source,indent=0]
+----
+include::samples/text.cpp[tags=modify] 
+----
+
+[[modify.clone]]
+=== Cloning nodes/attributes
+
+[[xml_node::prepend_copy]][[xml_node::append_copy]][[xml_node::insert_copy_after]][[xml_node::insert_copy_before]]
+With the help of previously described functions, it is possible to create trees with any contents and structure, including cloning the existing data. However since this is an often needed operation, pugixml provides built-in node/attribute cloning facilities. Since nodes and attributes do not exist without a document tree, you can't create a standalone copy - you have to immediately insert it somewhere in the tree. For this, you can use one of the following functions:
+
+[source]
+----
+xml_attribute xml_node::append_copy(const xml_attribute& proto);
+xml_attribute xml_node::prepend_copy(const xml_attribute& proto);
+xml_attribute xml_node::insert_copy_after(const xml_attribute& proto, const xml_attribute& attr);
+xml_attribute xml_node::insert_copy_before(const xml_attribute& proto, const xml_attribute& attr);
+
+xml_node xml_node::append_copy(const xml_node& proto);
+xml_node xml_node::prepend_copy(const xml_node& proto);
+xml_node xml_node::insert_copy_after(const xml_node& proto, const xml_node& node);
+xml_node xml_node::insert_copy_before(const xml_node& proto, const xml_node& node);
+----
+
+These functions mirror the structure of `append_child`, `prepend_child`, `insert_child_before` and related functions - they take the handle to the prototype object, which is to be cloned, insert a new attribute/node at the appropriate place, and then copy the attribute data or the whole node subtree to the new object. The functions return the handle to the resulting duplicate object, or null handle on failure.
+
+The attribute is copied along with the name and value; the node is copied along with its type, name and value; additionally attribute list and all children are recursively cloned, resulting in the deep subtree clone. The prototype object can be a part of the same document, or a part of any other document.
+
+The failure conditions resemble those of `append_child`, `insert_child_before` and related functions, <<xml_node::append_child,consult their documentation for more information>>. There are additional caveats specific to cloning functions:
+
+* Cloning null handles results in operation failure;
+* Node cloning starts with insertion of the node of the same type as that of the prototype; for this reason, cloning functions can not be directly used to clone entire documents, since <<node_document,node_document>> is not a valid insertion type. The example below provides a workaround.
+* It is possible to copy a subtree as a child of some node inside this subtree, i.e. `node.append_copy(node.parent().parent());`. This is a valid operation, and it results in a clone of the subtree in the state before cloning started, i.e. no infinite recursion takes place.
+
+This is an example with one possible implementation of include tags in XML (link:samples/include.cpp[]). It illustrates node cloning and usage of other document modification functions:
+
+[source,indent=0]
+----
+include::samples/include.cpp[tags=code] 
+----
+
+[[modify.move]]
+=== Moving nodes
+
+[[xml_node::prepend_move]][[xml_node::append_move]][[xml_node::insert_move_after]][[xml_node::insert_move_before]]
+Sometimes instead of cloning a node you need to move an existing node to a different position in a tree. This can be accomplished by copying the node and removing the original; however, this is expensive since it results in a lot of extra operations. For moving nodes within the same document tree, you can use of the following functions instead:
+
+[source]
+----
+xml_node xml_node::append_move(const xml_node& moved);
+xml_node xml_node::prepend_move(const xml_node& moved);
+xml_node xml_node::insert_move_after(const xml_node& moved, const xml_node& node);
+xml_node xml_node::insert_move_before(const xml_node& moved, const xml_node& node);
+----
+
+These functions mirror the structure of `append_copy`, `prepend_copy`, `insert_copy_before` and `insert_copy_after` - they take the handle to the moved object and move it to the appropriate place with all attributes and/or child nodes. The functions return the handle to the resulting object (which is the same as the moved object), or null handle on failure.
+
+The failure conditions resemble those of `append_child`, `insert_child_before` and related functions, <<xml_node::append_child,consult their documentation for more information>>. There are additional caveats specific to moving functions:
+
+* Moving null handles results in operation failure;
+* Moving is only possible for nodes that belong to the same document; attempting to move nodes between documents will fail.
+* `insert_move_after` and `insert_move_before` functions fail if the moved node is the same as the `node` argument (this operation would be a no-op otherwise).
+* It is impossible to move a subtree to a child of some node inside this subtree, i.e. `node.append_move(node.parent().parent());` will fail.
+
+[[modify.fragments]]
+=== Assembling document from fragments
+
+[[xml_node::append_buffer]]
+pugixml provides several ways to assemble an XML document from other XML documents. Assuming there is a set of document fragments, represented as in-memory buffers, the implementation choices are as follows:
+
+* Use a temporary document to parse the data from a string, then clone the nodes to a destination node. For example:
++
+[source]
+----
+bool append_fragment(pugi::xml_node target, const char* buffer, size_t size)
+{
+ pugi::xml_document doc;
+ if (!doc.load_buffer(buffer, size)) return false;
+
+ for (pugi::xml_node child = doc.first_child(); child; child = child.next_sibling())
+ target.append_copy(child);
+}
+----
+
+* Cache the parsing step - instead of keeping in-memory buffers, keep document objects that already contain the parsed fragment:
++
+[source]
+----
+bool append_fragment(pugi::xml_node target, const pugi::xml_document& cached_fragment)
+{
+ for (pugi::xml_node child = cached_fragment.first_child(); child; child = child.next_sibling())
+ target.append_copy(child);
+}
+----
+
+* Use `xml_node::append_buffer` directly:
++
+[source]
+----
+xml_parse_result xml_node::append_buffer(const void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+----
+
+The first method is more convenient, but slower than the other two. The relative performance of `append_copy` and `append_buffer` depends on the buffer format - usually `append_buffer` is faster if the buffer is in native encoding (UTF-8 or wchar_t, depending on `PUGIXML_WCHAR_MODE`). At the same time it might be less efficient in terms of memory usage - the implementation makes a copy of the provided buffer, and the copy has the same lifetime as the document - the memory used by that copy will be reclaimed after the document is destroyed, but no sooner. Even deleting all nodes in the document, including the appended ones, won't reclaim the memory.
+
+`append_buffer` behaves in the same way as <<xml_document::load_buffer,xml_document::load_buffer>> - the input buffer is a byte buffer, with size in bytes; the buffer is not modified and can be freed after the function returns.
+
+[[status_append_invalid_root]]
+Since `append_buffer` needs to append child nodes to the current node, it only works if the current node is either document or element node. Calling `append_buffer` on a node with any other type results in an error with `status_append_invalid_root` status.
+
+[[saving]]
+== Saving document
+
+Often after creating a new document or loading the existing one and processing it, it is necessary to save the result back to file. Also it is occasionally useful to output the whole document or a subtree to some stream; use cases include debug printing, serialization via network or other text-oriented medium, etc. pugixml provides several functions to output any subtree of the document to a file, stream or another generic transport interface; these functions allow to customize the output format (see <<saving.options>>), and also perform necessary encoding conversions (see <<saving.encoding>>). This section documents the relevant functionality.
+
+Before writing to the destination the node/attribute data is properly formatted according to the node type; all special XML symbols, such as `<` and `&`, are properly escaped (unless <<format_no_escapes,format_no_escapes>> flag is set). In order to guard against forgotten node/attribute names, empty node/attribute names are printed as `":anonymous"`. For well-formed output, make sure all node and attribute names are set to meaningful values.
+
+CDATA sections with values that contain `"]]>"` are split into several sections as follows: section with value `"pre]]>post"` is written as `<![CDATA[pre]]]]><![CDATA[>post]]>`. While this alters the structure of the document (if you load the document after saving it, there will be two CDATA sections instead of one), this is the only way to escape CDATA contents.
+
+[[saving.file]]
+=== Saving document to a file
+
+[[xml_document::save_file]][[xml_document::save_file_wide]]
+If you want to save the whole document to a file, you can use one of the following functions:
+
+[source]
+----
+bool xml_document::save_file(const char* path, const char_t* indent = "\t", unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+bool xml_document::save_file(const wchar_t* path, const char_t* indent = "\t", unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+----
+
+These functions accept file path as its first argument, and also three optional arguments, which specify indentation and other output options (see <<saving.options>>) and output data encoding (see <<saving.encoding>>). The path has the target operating system format, so it can be a relative or absolute one, it should have the delimiters of the target system, it should have the exact case if the target file system is case-sensitive, etc.
+
+File path is passed to the system file opening function as is in case of the first function (which accepts `const char* path`); the second function either uses a special file opening function if it is provided by the runtime library or converts the path to UTF-8 and uses the system file opening function.
+
+[[xml_writer_file]]
+`save_file` opens the target file for writing, outputs the requested header (by default a document declaration is output, unless the document already has one), and then saves the document contents. If the file could not be opened, the function returns `false`. Calling `save_file` is equivalent to creating an `xml_writer_file` object with `FILE*` handle as the only constructor argument and then calling `save`; see <<saving.writer>> for writer interface details.
+
+This is a simple example of saving XML document to file (link:samples/save_file.cpp[]):
+
+[source,indent=0]
+----
+include::samples/save_file.cpp[tags=code] 
+----
+
+[[saving.stream]]
+=== Saving document to C{plus}{plus} IOstreams
+
+[[xml_document::save_stream]]
+To enhance interoperability pugixml provides functions for saving document to any object which implements C{plus}{plus} `std::ostream` interface. This allows you to save documents to any standard C{plus}{plus} stream (i.e. file stream) or any third-party compliant implementation (i.e. Boost Iostreams). Most notably, this allows for easy debug output, since you can use `std::cout` stream as saving target. There are two functions, one works with narrow character streams, another handles wide character ones:
+
+[source]
+----
+void xml_document::save(std::ostream& stream, const char_t* indent = "\t", unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+void xml_document::save(std::wostream& stream, const char_t* indent = "\t", unsigned int flags = format_default) const;
+----
+
+`save` with `std::ostream` argument saves the document to the stream in the same way as `save_file` (i.e. with requested header and with encoding conversions). On the other hand, `save` with `std::wstream` argument saves the document to the wide stream with <<encoding_wchar,encoding_wchar>> encoding. Because of this, using `save` with wide character streams requires careful (usually platform-specific) stream setup (i.e. using the `imbue` function). Generally use of wide streams is discouraged, however it provides you with the ability to save documents to non-Unicode encodings, i.e. you can save Shift-JIS encoded data if you set the correct locale.
+
+[[xml_writer_stream]]
+Calling `save` with stream target is equivalent to creating an `xml_writer_stream` object with stream as the only constructor argument and then calling `save`; see <<saving.writer>> for writer interface details.
+
+This is a simple example of saving XML document to standard output (link:samples/save_stream.cpp[]):
+
+[source,indent=0]
+----
+include::samples/save_stream.cpp[tags=code] 
+----
+
+[[saving.writer]]
+=== Saving document via writer interface
+
+[[xml_document::save]][[xml_writer]][[xml_writer::write]]
+All of the above saving functions are implemented in terms of writer interface. This is a simple interface with a single function, which is called several times during output process with chunks of document data as input:
+
+[source]
+----
+class xml_writer
+{
+public:
+ virtual void write(const void* data, size_t size) = 0;
+};
+
+void xml_document::save(xml_writer& writer, const char_t* indent = "\t", unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+----
+
+In order to output the document via some custom transport, for example sockets, you should create an object which implements `xml_writer` interface and pass it to `save` function. `xml_writer::write` function is called with a buffer as an input, where `data` points to buffer start, and `size` is equal to the buffer size in bytes. `write` implementation must write the buffer to the transport; it can not save the passed buffer pointer, as the buffer contents will change after `write` returns. The buffer contains the chunk of document data in the desired encoding.
+
+`write` function is called with relatively large blocks (size is usually several kilobytes, except for the last block that may be small), so there is often no need for additional buffering in the implementation.
+
+This is a simple example of custom writer for saving document data to STL string (link:samples/save_custom_writer.cpp[]); read the sample code for more complex examples:
+
+[source,indent=0]
+----
+include::samples/save_custom_writer.cpp[tags=code] 
+----
+
+[[saving.subtree]]
+=== Saving a single subtree
+
+[[xml_node::print]][[xml_node::print_stream]]
+While the previously described functions save the whole document to the destination, it is easy to save a single subtree. The following functions are provided:
+
+[source]
+----
+void xml_node::print(std::ostream& os, const char_t* indent = "\t", unsigned int flags = format_default, xml_encoding encoding = encoding_auto, unsigned int depth = 0) const;
+void xml_node::print(std::wostream& os, const char_t* indent = "\t", unsigned int flags = format_default, unsigned int depth = 0) const;
+void xml_node::print(xml_writer& writer, const char_t* indent = "\t", unsigned int flags = format_default, xml_encoding encoding = encoding_auto, unsigned int depth = 0) const;
+----
+
+These functions have the same arguments with the same meaning as the corresponding `xml_document::save` functions, and allow you to save the subtree to either a C{plus}{plus} IOstream or to any object that implements `xml_writer` interface.
+
+Saving a subtree differs from saving the whole document: the process behaves as if <<format_write_bom,format_write_bom>> is off, and <<format_no_declaration,format_no_declaration>> is on, even if actual values of the flags are different. This means that BOM is not written to the destination, and document declaration is only written if it is the node itself or is one of node's children. Note that this also holds if you're saving a document; this example (link:samples/save_subtree.cpp[]) illustrates the difference:
+
+[source,indent=0]
+----
+include::samples/save_subtree.cpp[tags=code] 
+----
+
+[[saving.options]]
+=== Output options
+
+All saving functions accept the optional parameter `flags`. This is a bitmask that customizes the output format; you can select the way the document nodes are printed and select the needed additional information that is output before the document contents.
+
+NOTE: You should use the usual bitwise arithmetics to manipulate the bitmask: to enable a flag, use `mask | flag`; to disable a flag, use `mask & ~flag`.
+
+These flags control the resulting tree contents:
+
+* [[format_indent]]`format_indent` determines if all nodes should be indented with the indentation string (this is an additional parameter for all saving functions, and is `"\t"` by default). If this flag is on, the indentation string is printed several times before every node, where the amount of indentation depends on the node's depth relative to the output subtree. This flag has no effect if <<format_raw,format_raw>> is enabled. This flag is *on* by default.
+
+* [[format_indent_attributes]]`format_indent_attributes` determines if all attributes should be printed on a new line, indented with the indentation string according to the attribute's depth. This flag implies <<format_indent,format_indent>>. This flag has no effect if <<format_raw,format_raw>> is enabled. This flag is *off* by default.
+
+* [[format_raw]]`format_raw` switches between formatted and raw output. If this flag is on, the nodes are not indented in any way, and also no newlines that are not part of document text are printed. Raw mode can be used for serialization where the result is not intended to be read by humans; also it can be useful if the document was parsed with <<parse_ws_pcdata,parse_ws_pcdata>> flag, to preserve the original document formatting as much as possible. This flag is *off* by default.
+
+* [[format_no_escapes]]`format_no_escapes` disables output escaping for attribute values and PCDATA contents. If this flag is off, special symbols (`"`, `&`, `<`, `>`) and all non-printable characters (those with codepoint values less than 32) are converted to XML escape sequences (i.e. `&amp;amp;`) during output. If this flag is on, no text processing is performed; therefore, output XML can be malformed if output contents contains invalid symbols (i.e. having a stray `<` in the PCDATA will make the output malformed). This flag is *off* by default.
+
+These flags control the additional output information:
+
+* [[format_no_declaration]]`format_no_declaration` disables default node declaration output. By default, if the document is saved via `save` or `save_file` function, and it does not have any document declaration, a default declaration is output before the document contents. Enabling this flag disables this declaration. This flag has no effect in `xml_node::print` functions: they never output the default declaration. This flag is *off* by default.
+
+* [[format_write_bom]]`format_write_bom` enables Byte Order Mark (BOM) output. By default, no BOM is output, so in case of non UTF-8 encodings the resulting document's encoding may not be recognized by some parsers and text editors, if they do not implement sophisticated encoding detection. Enabling this flag adds an encoding-specific BOM to the output. This flag has no effect in `xml_node::print` functions: they never output the BOM. This flag is *off* by default.
+
+* [[format_save_file_text]]`format_save_file_text` changes the file mode when using `save_file` function. By default, file is opened in binary mode, which means that the output file will
+contain platform-independent newline `\n` (ASCII 10). If this flag is on, file is opened in text mode, which on some systems changes the newline format (i.e. on Windows you can use this flag to output XML documents with `\r\n` (ASCII 13 10) newlines. This flag is *off* by default.
+
+Additionally, there is one predefined option mask:
+
+* [[format_default]]`format_default` is the default set of flags, i.e. it has all options set to their default values. It sets formatted output with indentation, without BOM and with default node declaration, if necessary.
+
+This is an example that shows the outputs of different output options (link:samples/save_options.cpp[]):
+
+[source,indent=0]
+----
+include::samples/save_options.cpp[tags=code] 
+----
+
+[[saving.encoding]]
+=== Encodings
+
+pugixml supports all popular Unicode encodings (UTF-8, UTF-16 (big and little endian), UTF-32 (big and little endian); UCS-2 is naturally supported since it's a strict subset of UTF-16) and handles all encoding conversions during output. The output encoding is set via the `encoding` parameter of saving functions, which is of type `xml_encoding`. The possible values for the encoding are documented in <<loading.encoding>>; the only flag that has a different meaning is `encoding_auto`.
+
+While all other flags set the exact encoding, `encoding_auto` is meant for automatic encoding detection. The automatic detection does not make sense for output encoding, since there is usually nothing to infer the actual encoding from, so here `encoding_auto` means UTF-8 encoding, which is the most popular encoding for XML data storage. This is also the default value of output encoding; specify another value if you do not want UTF-8 encoded output.
+
+Also note that wide stream saving functions do not have `encoding` argument and always assume <<encoding_wchar,encoding_wchar>> encoding.
+
+NOTE: The current behavior for Unicode conversion is to skip all invalid UTF sequences during conversion. This behavior should not be relied upon; if your node/attribute names do not contain any valid UTF sequences, they may be output as if they are empty, which will result in malformed XML document.
+
+[[saving.declaration]]
+=== Customizing document declaration
+
+When you are saving the document using `xml_document::save()` or `xml_document::save_file()`, a default XML document declaration is output, if `format_no_declaration` is not specified and if the document does not have a declaration node. However, the default declaration is not customizable. If you want to customize the declaration output, you need to create the declaration node yourself.
+
+NOTE: By default the declaration node is not added to the document during parsing. If you just need to preserve the original declaration node, you have to add the flag <<parse_declaration,parse_declaration>> to the parsing flags; the resulting document will contain the original declaration node, which will be output during saving.
+
+Declaration node is a node with type <<node_declaration,node_declaration>>; it behaves like an element node in that it has attributes with values (but it does not have child nodes). Therefore setting custom version, encoding or standalone declaration involves adding attributes and setting attribute values.
+
+This is an example that shows how to create a custom declaration node (link:samples/save_declaration.cpp[]):
+
+[source,indent=0]
+----
+include::samples/save_declaration.cpp[tags=code] 
+----
+
+[[xpath]]
+== XPath
+
+If the task at hand is to select a subset of document nodes that match some criteria, it is possible to code a function using the existing traversal functionality for any practical criteria. However, often either a data-driven approach is desirable, in case the criteria are not predefined and come from a file, or it is inconvenient to use traversal interfaces and a higher-level DSL is required. There is a standard language for XML processing, XPath, that can be useful for these cases. pugixml implements an almost complete subset of XPath 1.0. Because of differences in document object model and some performance implications, there are minor violations of the official specifications, which can be found in <<xpath.w3c>>. The rest of this section describes the interface for XPath functionality. Please note that if you wish to learn to use XPath language, you have to look for other tutorials or manuals; for example, you can read http://www.w3schools.com/xpath/[W3Schools XPath tutorial], http://www.tizag.com/xmlTutorial/xpathtutorial.php[XPath tutorial at tizag.com], and http://www.w3.org/TR/xpath/[the XPath 1.0 specification].
+
+[[xpath.types]]
+=== XPath types
+
+[[xpath_value_type]][[xpath_type_number]][[xpath_type_string]][[xpath_type_boolean]][[xpath_type_node_set]][[xpath_type_none]]
+Each XPath expression can have one of the following types: boolean, number, string or node set. Boolean type corresponds to `bool` type, number type corresponds to `double` type, string type corresponds to either `std::string` or `std::wstring`, depending on whether <<dom.unicode,wide character interface is enabled>>, and node set corresponds to <<xpath_node_set,xpath_node_set>> type. There is an enumeration, `xpath_value_type`, which can take the values `xpath_type_boolean`, `xpath_type_number`, `xpath_type_string` or `xpath_type_node_set`, accordingly.
+
+[[xpath_node]][[xpath_node::node]][[xpath_node::attribute]][[xpath_node::parent]]
+Because an XPath node can be either a node or an attribute, there is a special type, `xpath_node`, which is a discriminated union of these types. A value of this type contains two node handles, one of `xml_node` type, and another one of `xml_attribute` type; at most one of them can be non-null. The accessors to get these handles are available:
+
+[source]
+----
+xml_node xpath_node::node() const;
+xml_attribute xpath_node::attribute() const;
+----
+
+XPath nodes can be null, in which case both accessors return null handles.
+
+Note that as per XPath specification, each XPath node has a parent, which can be retrieved via this function:
+
+[source]
+----
+xml_node xpath_node::parent() const;
+----
+
+`parent` function returns the node's parent if the XPath node corresponds to `xml_node` handle (equivalent to `node().parent()`), or the node to which the attribute belongs to, if the XPath node corresponds to `xml_attribute` handle. For null nodes, `parent` returns null handle.
+
+[[xpath_node::unspecified_bool_type]][[xpath_node::comparison]]
+Like node and attribute handles, XPath node handles can be implicitly cast to boolean-like object to check if it is a null node, and also can be compared for equality with each other.
+
+[[xpath_node::ctor]]
+You can also create XPath nodes with one of the three constructors: the default constructor, the constructor that takes node argument, and the constructor that takes attribute and node arguments (in which case the attribute must belong to the attribute list of the node). The constructor from `xml_node` is implicit, so you can usually pass `xml_node` to functions that expect `xpath_node`. Apart from that you usually don't need to create your own XPath node objects, since they are returned to you via selection functions.
+
+[[xpath_node_set]]
+XPath expressions operate not on single nodes, but instead on node sets. A node set is a collection of nodes, which can be optionally ordered in either a forward document order or a reverse one. Document order is defined in XPath specification; an XPath node is before another node in document order if it appears before it in XML representation of the corresponding document.
+
+[[xpath_node_set::const_iterator]][[xpath_node_set::begin]][[xpath_node_set::end]]
+Node sets are represented by `xpath_node_set` object, which has an interface that resembles one of sequential random-access containers. It has an iterator type along with usual begin/past-the-end iterator accessors:
+
+[source]
+----
+typedef const xpath_node* xpath_node_set::const_iterator;
+const_iterator xpath_node_set::begin() const;
+const_iterator xpath_node_set::end() const;
+----
+
+[[xpath_node_set::index]][[xpath_node_set::size]][[xpath_node_set::empty]]
+And it also can be iterated via indices, just like `std::vector`:
+
+[source]
+----
+const xpath_node& xpath_node_set::operator[](size_t index) const;
+size_t xpath_node_set::size() const;
+bool xpath_node_set::empty() const;
+----
+
+All of the above operations have the same semantics as that of `std::vector`: the iterators are random-access, all of the above operations are constant time, and accessing the element at index that is greater or equal than the set size results in undefined behavior. You can use both iterator-based and index-based access for iteration, however the iterator-based one can be faster.
+
+[[xpath_node_set::type]][[xpath_node_set::type_unsorted]][[xpath_node_set::type_sorted]][[xpath_node_set::type_sorted_reverse]][[xpath_node_set::sort]]
+The order of iteration depends on the order of nodes inside the set; the order can be queried via the following function:
+
+[source]
+----
+enum xpath_node_set::type_t {type_unsorted, type_sorted, type_sorted_reverse};
+type_t xpath_node_set::type() const;
+----
+
+`type` function returns the current order of nodes; `type_sorted` means that the nodes are in forward document order, `type_sorted_reverse` means that the nodes are in reverse document order, and `type_unsorted` means that neither order is guaranteed (nodes can accidentally be in a sorted order even if `type()` returns `type_unsorted`). If you require a specific order of iteration, you can change it via `sort` function:
+
+[source]
+----
+void xpath_node_set::sort(bool reverse = false);
+----
+
+Calling `sort` sorts the nodes in either forward or reverse document order, depending on the argument; after this call `type()` will return `type_sorted` or `type_sorted_reverse`.
+
+[[xpath_node_set::first]]
+Often the actual iteration is not needed; instead, only the first element in document order is required. For this, a special accessor is provided:
+
+[source]
+----
+xpath_node xpath_node_set::first() const;
+----
+
+This function returns the first node in forward document order from the set, or null node if the set is empty. Note that while the result of the node does not depend on the order of nodes in the set (i.e. on the result of `type()`), the complexity does - if the set is sorted, the complexity is constant, otherwise it is linear in the number of elements or worse.
+
+[[xpath_node_set::ctor]]
+While in the majority of cases the node set is returned by XPath functions, sometimes there is a need to manually construct a node set. For such cases, a constructor is provided which takes an iterator range (`const_iterator` is a typedef for `const xpath_node*`), and an optional type:
+
+[source]
+----
+xpath_node_set::xpath_node_set(const_iterator begin, const_iterator end, type_t type = type_unsorted);
+----
+
+The constructor copies the specified range and sets the specified type. The objects in the range are not checked in any way; you'll have to ensure that the range contains no duplicates, and that the objects are sorted according to the `type` parameter. Otherwise XPath operations with this set may produce unexpected results.
+
+[[xpath.select]]
+=== Selecting nodes via XPath expression
+
+[[xml_node::select_node]][[xml_node::select_nodes]]
+If you want to select nodes that match some XPath expression, you can do it with the following functions:
+
+[source]
+----
+xpath_node xml_node::select_node(const char_t* query, xpath_variable_set* variables = 0) const;
+xpath_node_set xml_node::select_nodes(const char_t* query, xpath_variable_set* variables = 0) const;
+----
+
+`select_nodes` function compiles the expression and then executes it with the node as a context node, and returns the resulting node set. `select_node` returns only the first node in document order from the result, and is equivalent to calling `select_nodes(query).first()`. If the XPath expression does not match anything, or the node handle is null, `select_nodes` returns an empty set, and `select_node` returns null XPath node.
+
+If exception handling is not disabled, both functions throw <<xpath_exception,xpath_exception>> if the query can not be compiled or if it returns a value with type other than node set; see <<xpath.errors>> for details.
+
+[[xml_node::select_node_precomp]][[xml_node::select_nodes_precomp]]
+While compiling expressions is fast, the compilation time can introduce a significant overhead if the same expression is used many times on small subtrees. If you're doing many similar queries, consider compiling them into query objects (see <<xpath.query>> for further reference). Once you get a compiled query object, you can pass it to select functions instead of an expression string:
+
+[source]
+----
+xpath_node xml_node::select_node(const xpath_query& query) const;
+xpath_node_set xml_node::select_nodes(const xpath_query& query) const;
+----
+
+If exception handling is not disabled, both functions throw <<xpath_exception,xpath_exception>> if the query returns a value with type other than node set.
+
+This is an example of selecting nodes using XPath expressions (link:samples/xpath_select.cpp[]):
+
+[source,indent=0]
+----
+include::samples/xpath_select.cpp[tags=code] 
+----
+
+[[xpath.query]]
+=== Using query objects
+
+[[xpath_query]]
+When you call `select_nodes` with an expression string as an argument, a query object is created behind the scenes. A query object represents a compiled XPath expression. Query objects can be needed in the following circumstances:
+
+* You can precompile expressions to query objects to save compilation time if it becomes an issue;
+* You can use query objects to evaluate XPath expressions which result in booleans, numbers or strings;
+* You can get the type of expression value via query object.
+
+Query objects correspond to `xpath_query` type. They are immutable and non-copyable: they are bound to the expression at creation time and can not be cloned. If you want to put query objects in a container, allocate them on heap via `new` operator and store pointers to `xpath_query` in the container.
+
+[[xpath_query::ctor]]
+You can create a query object with the constructor that takes XPath expression as an argument:
+
+[source]
+----
+explicit xpath_query::xpath_query(const char_t* query, xpath_variable_set* variables = 0);
+----
+
+[[xpath_query::return_type]]
+The expression is compiled and the compiled representation is stored in the new query object. If compilation fails, <<xpath_exception,xpath_exception>> is thrown if exception handling is not disabled (see <<xpath.errors>> for details). After the query is created, you can query the type of the evaluation result using the following function:
+
+[source]
+----
+xpath_value_type xpath_query::return_type() const;
+----
+
+[[xpath_query::evaluate_boolean]][[xpath_query::evaluate_number]][[xpath_query::evaluate_string]][[xpath_query::evaluate_node_set]][[xpath_query::evaluate_node]]
+You can evaluate the query using one of the following functions:
+
+[source]
+----
+bool xpath_query::evaluate_boolean(const xpath_node& n) const;
+double xpath_query::evaluate_number(const xpath_node& n) const;
+string_t xpath_query::evaluate_string(const xpath_node& n) const;
+xpath_node_set xpath_query::evaluate_node_set(const xpath_node& n) const;
+xpath_node xpath_query::evaluate_node(const xpath_node& n) const;
+----
+
+All functions take the context node as an argument, compute the expression and return the result, converted to the requested type. According to XPath specification, value of any type can be converted to boolean, number or string value, but no type other than node set can be converted to node set. Because of this, `evaluate_boolean`, `evaluate_number` and `evaluate_string` always return a result, but `evaluate_node_set` and `evaluate_node` result in an error if the return type is not node set (see <<xpath.errors>>).
+
+NOTE: Calling `node.select_nodes("query")` is equivalent to calling `xpath_query("query").evaluate_node_set(node)`. Calling `node.select_node("query")` is equivalent to calling `xpath_query("query").evaluate_node(node)`.
+
+[[xpath_query::evaluate_string_buffer]]
+Note that `evaluate_string` function returns the STL string; as such, it's not available in <<PUGIXML_NO_STL,PUGIXML_NO_STL>> mode and also usually allocates memory. There is another string evaluation function:
+
+[source]
+----
+size_t xpath_query::evaluate_string(char_t* buffer, size_t capacity, const xpath_node& n) const;
+----
+
+This function evaluates the string, and then writes the result to `buffer` (but at most `capacity` characters); then it returns the full size of the result in characters, including the terminating zero. If `capacity` is not 0, the resulting buffer is always zero-terminated. You can use this function as follows: 
+
+* First call the function with `buffer = 0` and `capacity = 0`; then allocate the returned amount of characters, and call the function again, passing the allocated storage and the amount of characters;
+* First call the function with small buffer and buffer capacity; then, if the result is larger than the capacity, the output has been trimmed, so allocate a larger buffer and call the function again.
+
+This is an example of using query objects (link:samples/xpath_query.cpp[]):
+
+[source,indent=0]
+----
+include::samples/xpath_query.cpp[tags=code] 
+----
+
+[[xpath.variables]]
+=== Using variables
+
+XPath queries may contain references to variables; this is useful if you want to use queries that depend on some dynamic parameter without manually preparing the complete query string, or if you want to reuse the same query object for similar queries.
+
+Variable references have the form `$name`; in order to use them, you have to provide a variable set, which includes all variables present in the query with correct types. This set is passed to `xpath_query` constructor or to `select_nodes`/`select_node` functions:
+
+[source]
+----
+explicit xpath_query::xpath_query(const char_t* query, xpath_variable_set* variables = 0);
+xpath_node xml_node::select_node(const char_t* query, xpath_variable_set* variables = 0) const;
+xpath_node_set xml_node::select_nodes(const char_t* query, xpath_variable_set* variables = 0) const;
+----
+
+If you're using query objects, you can change the variable values before `evaluate`/`select` calls to change the query behavior.
+
+NOTE: The variable set pointer is stored in the query object; you have to ensure that the lifetime of the set exceeds that of query object.
+
+[[xpath_variable_set]]
+Variable sets correspond to `xpath_variable_set` type, which is essentially a variable container.
+
+[[xpath_variable_set::add]]
+You can add new variables with the following function:
+
+[source]
+----
+xpath_variable* xpath_variable_set::add(const char_t* name, xpath_value_type type);
+----
+
+The function tries to add a new variable with the specified name and type; if the variable with such name does not exist in the set, the function adds a new variable and returns the variable handle; if there is already a variable with the specified name, the function returns the variable handle if variable has the specified type. Otherwise the function returns null pointer; it also returns null pointer on allocation failure.
+
+New variables are assigned the default value which depends on the type: `0` for numbers, `false` for booleans, empty string for strings and empty set for node sets.
+
+[[xpath_variable_set::get]]
+You can get the existing variables with the following functions:
+
+[source]
+----
+xpath_variable* xpath_variable_set::get(const char_t* name);
+const xpath_variable* xpath_variable_set::get(const char_t* name) const;
+----
+
+The functions return the variable handle, or null pointer if the variable with the specified name is not found.
+
+[[xpath_variable_set::set]]
+Additionally, there are the helper functions for setting the variable value by name; they try to add the variable with the corresponding type, if it does not exist, and to set the value. If the variable with the same name but with different type is already present, they return `false`; they also return `false` on allocation failure. Note that these functions do not perform any type conversions.
+
+[source]
+----
+bool xpath_variable_set::set(const char_t* name, bool value);
+bool xpath_variable_set::set(const char_t* name, double value);
+bool xpath_variable_set::set(const char_t* name, const char_t* value);
+bool xpath_variable_set::set(const char_t* name, const xpath_node_set& value);
+----
+
+The variable values are copied to the internal variable storage, so you can modify or destroy them after the functions return.
+
+[[xpath_variable]]
+If setting variables by name is not efficient enough, or if you have to inspect variable information or get variable values, you can use variable handles. A variable corresponds to the `xpath_variable` type, and a variable handle is simply a pointer to `xpath_variable`.
+
+[[xpath_variable::type]][[xpath_variable::name]]
+In order to get variable information, you can use one of the following functions:
+
+[source]
+----
+const char_t* xpath_variable::name() const;
+xpath_value_type xpath_variable::type() const;
+----
+
+Note that each variable has a distinct type which is specified upon variable creation and can not be changed later.
+
+[[xpath_variable::get_boolean]][[xpath_variable::get_number]][[xpath_variable::get_string]][[xpath_variable::get_node_set]]
+In order to get variable value, you should use one of the following functions, depending on the variable type:
+
+[source]
+----
+bool xpath_variable::get_boolean() const;
+double xpath_variable::get_number() const;
+const char_t* xpath_variable::get_string() const;
+const xpath_node_set& xpath_variable::get_node_set() const;
+----
+
+These functions return the value of the variable. Note that no type conversions are performed; if the type mismatch occurs, a dummy value is returned (`false` for booleans, `NaN` for numbers, empty string for strings and empty set for node sets).
+
+[[xpath_variable::set]]
+In order to set variable value, you should use one of the following functions, depending on the variable type:
+
+[source]
+----
+bool xpath_variable::set(bool value);
+bool xpath_variable::set(double value);
+bool xpath_variable::set(const char_t* value);
+bool xpath_variable::set(const xpath_node_set& value);
+----
+
+These functions modify the variable value. Note that no type conversions are performed; if the type mismatch occurs, the functions return `false`; they also return `false` on allocation failure. The variable values are copied to the internal variable storage, so you can modify or destroy them after the functions return.
+
+This is an example of using variables in XPath queries (link:samples/xpath_variables.cpp[]):
+
+[source,indent=0]
+----
+include::samples/xpath_variables.cpp[tags=code] 
+----
+
+[[xpath.errors]]
+=== Error handling
+
+There are two different mechanisms for error handling in XPath implementation; the mechanism used depends on whether exception support is disabled (this is controlled with <<PUGIXML_NO_EXCEPTIONS,PUGIXML_NO_EXCEPTIONS>> define).
+
+[[xpath_exception]][[xpath_exception::result]][[xpath_exception::what]]
+By default, XPath functions throw `xpath_exception` object in case of errors; additionally, in the event any memory allocation fails, an `std::bad_alloc` exception is thrown. Also `xpath_exception` is thrown if the query is evaluated to a node set, but the return type is not node set. If the query constructor succeeds (i.e. no exception is thrown), the query object is valid. Otherwise you can get the error details via one of the following functions:
+
+[source]
+----
+virtual const char* xpath_exception::what() const throw();
+const xpath_parse_result& xpath_exception::result() const;
+----
+
+[[xpath_query::unspecified_bool_type]][[xpath_query::result]]
+If exceptions are disabled, then in the event of parsing failure the query is initialized to invalid state; you can test if the query object is valid by using it in a boolean expression: `if (query) { ... }`. Additionally, you can get parsing result via the result() accessor:
+
+[source]
+----
+const xpath_parse_result& xpath_query::result() const;
+----
+ 
+Without exceptions, evaluating invalid query results in `false`, empty string, `NaN` or an empty node set, depending on the type; evaluating a query as a node set results in an empty node set if the return type is not node set.
+
+[[xpath_parse_result]]
+The information about parsing result is returned via `xpath_parse_result` object. It contains parsing status and the offset of last successfully parsed character from the beginning of the source stream:
+
+[source]
+----
+struct xpath_parse_result
+{
+ const char* error;
+ ptrdiff_t offset;
+
+ operator bool() const;
+ const char* description() const;
+};
+----
+
+[[xpath_parse_result::error]]
+Parsing result is represented as the error message; it is either a null pointer, in case there is no error, or the error message in the form of ASCII zero-terminated string.
+
+[[xpath_parse_result::description]]
+`description()` member function can be used to get the error message; it never returns the null pointer, so you can safely use `description()` even if query parsing succeeded. Note that `description()` returns a `char` string even in `PUGIXML_WCHAR_MODE`; you'll have to call <<as_wide,as_wide>> to get the `wchar_t` string.
+
+[[xpath_parse_result::offset]]
+In addition to the error message, parsing result has an `offset` member, which contains the offset of last successfully parsed character. This offset is in units of <<char_t,pugi::char_t>> (bytes for character mode, wide characters for wide character mode).
+
+[[xpath_parse_result::bool]]
+Parsing result object can be implicitly converted to `bool` like this: `if (result) { ... } else { ... }`.
+
+This is an example of XPath error handling (link:samples/xpath_error.cpp[]):
+
+[source,indent=0]
+----
+include::samples/xpath_error.cpp[tags=code] 
+----
+
+[[xpath.w3c]]
+=== Conformance to W3C specification
+
+Because of the differences in document object models, performance considerations and implementation complexity, pugixml does not provide a fully conformant XPath 1.0 implementation. This is the current list of incompatibilities:
+
+* Consecutive text nodes sharing the same parent are not merged, i.e. in `<node>text1 <![CDATA[data]]> text2</node>` node should have one text node child, but instead has three.
+* Since the document type declaration is not used for parsing, `id()` function always returns an empty node set.
+* Namespace nodes are not supported (affects `namespace::` axis).
+* Name tests are performed on QNames in XML document instead of expanded names; for `<foo xmlns:ns1='uri' xmlns:ns2='uri'><ns1:child/><ns2:child/></foo>`, query `foo/ns1:*` will return only the first child, not both of them. Compliant XPath implementations can return both nodes if the user provides appropriate namespace declarations.
+* String functions consider a character to be either a single `char` value or a single `wchar_t` value, depending on the library configuration; this means that some string functions are not fully Unicode-aware. This affects `substring()`, `string-length()` and `translate()` functions.
+
+[[changes]]
+== Changelog
+
+:!numbered:
+
+[[v1.6]]
+=== v1.6 ^10.04.2015^
+
+Maintenance release. Changes:
+
+* Specification changes:
+ . Attribute/text values now use more digits when printing floating point numbers to guarantee round-tripping.
+ . Text nodes no longer get extra surrounding whitespace when pretty-printing nodes with mixed contents
+
+* Bug fixes:
+ . Fixed translate and normalize-space XPath functions to no longer return internal NUL characters
+ . Fixed buffer overrun on malformed comments inside DOCTYPE sections
+ . DOCTYPE parsing can no longer run out of stack space on malformed inputs (XML parsing is now using bounded stack space)
+ . Adjusted processing instruction output to avoid malformed documents if the PI value contains `?>`
+
+[[v1.5]]
+=== v1.5 ^27.11.2014^
+
+Major release, featuring a lot of performance improvements and some new features.
+
+* Specification changes:
+ . `xml_document::load(const char_t*)` was renamed to `load_string`; the old method is still available and will be deprecated in a future release
+ . `xml_node::select_single_node` was renamed to `select_node`; the old method is still available and will be deprecated in a future release.
+
+* New features:
+ . Added `xml_node::append_move` and other functions for moving nodes within a document
+ . Added `xpath_query::evaluate_node` for evaluating queries with a single node as a result
+
+* Performance improvements:
+ . Optimized XML parsing (10-40% faster with clang/gcc, up to 10% faster with MSVC)
+ . Optimized memory consumption when copying nodes in the same document (string contents is now shared)
+ . Optimized node copying (10% faster for cross-document copies, 3x faster for inter-document copies; also it now consumes a constant amount of stack space)
+ . Optimized node output (60% faster; also it now consumes a constant amount of stack space)
+ . Optimized XPath allocation (query evaluation now results in fewer temporary allocations)
+ . Optimized XPath sorting (node set sorting is 2-3x faster in some cases)
+ . Optimized XPath evaluation (XPathMark suite is 100x faster; some commonly used queries are 3-4x faster)
+
+* Compatibility improvements:
+ . Fixed `xml_node::offset_debug` for corner cases
+ . Fixed undefined behavior while calling memcpy in some cases
+ . Fixed MSVC 2015 compilation warnings
+ . Fixed `contrib/foreach.hpp` for Boost 1.56.0
+
+* Bug fixes
+ . Adjusted comment output to avoid malformed documents if the comment value contains `--`
+ . Fix XPath sorting for documents that were constructed using append_buffer
+ . Fix `load_file` for wide-character paths with non-ASCII characters in MinGW with C{plus}{plus}11 mode enabled
+
+[[v1.4]]
+=== v1.4 ^27.02.2014^
+
+Major release, featuring various new features, bug fixes and compatibility improvements.
+
+* Specification changes:
+ . Documents without element nodes are now rejected with `status_no_document_element` error, unless `parse_fragment` option is used
+
+* New features:
+ . Added XML fragment parsing (`parse_fragment` flag)
+ . Added PCDATA whitespace trimming (`parse_trim_pcdata` flag)
+ . Added long long support for `xml_attribute` and `xml_text` (`as_llong`, `as_ullong` and `set_value`/`set` overloads)
+ . Added hexadecimal integer parsing support for `as_int`/`as_uint`/`as_llong`/`as_ullong`
+ . Added `xml_node::append_buffer` to improve performance of assembling documents from fragments
+ . `xml_named_node_iterator` is now bidirectional
+ . Reduced XPath stack consumption during compilation and evaluation (useful for embedded systems)
+
+* Compatibility improvements:
+ . Improved support for platforms without wchar_t support
+ . Fixed several false positives in clang static analysis
+ . Fixed several compilation warnings for various GCC versions
+
+* Bug fixes:
+ . Fixed undefined pointer arithmetic in XPath implementation
+ . Fixed non-seekable iostream support for certain stream types, i.e. Boost `file_source` with pipe input
+ . Fixed `xpath_query::return_type` for some expressions
+ . Fixed dllexport issues with `xml_named_node_iterator`
+ . Fixed `find_child_by_attribute` assertion for attributes with null name/value
+
+[[v1.2]]
+=== v1.2 ^1.05.2012^
+
+Major release, featuring header-only mode, various interface enhancements (i.e. PCDATA manipulation and C{plus}{plus}11 iteration), many other features and compatibility improvements.
+
+* New features:
+ . Added `xml_text` helper class for working with PCDATA/CDATA contents of an element node
+ . Added optional header-only mode (controlled by `PUGIXML_HEADER_ONLY` define)
+ . Added `xml_node::children()` and `xml_node::attributes()` for C{plus}{plus}11 ranged for loop or `BOOST_FOREACH`
+ . Added support for Latin-1 (ISO-8859-1) encoding conversion during loading and saving
+ . Added custom default values for `xml_attribute::as_*` (they are returned if the attribute does not exist)
+ . Added `parse_ws_pcdata_single` flag for preserving whitespace-only PCDATA in case it's the only child
+ . Added `format_save_file_text` for `xml_document::save_file` to open files as text instead of binary (changes newlines on Windows)
+ . Added `format_no_escapes` flag to disable special symbol escaping (complements `~parse_escapes`)
+ . Added support for loading document from streams that do not support seeking
+ . Added `PUGIXML_MEMORY_*` constants for tweaking allocation behavior (useful for embedded systems)
+ . Added `PUGIXML_VERSION` preprocessor define
+
+* Compatibility improvements:
+ . Parser does not require setjmp support (improves compatibility with some embedded platforms, enables `/clr:pure` compilation)
+ . STL forward declarations are no longer used (fixes SunCC/RWSTL compilation, fixes clang compilation in C{plus}{plus}11 mode)
+ . Fixed AirPlay SDK, Android, Windows Mobile (WinCE) and C{plus}{plus}/CLI compilation
+ . Fixed several compilation warnings for various GCC versions, Intel C{plus}{plus} compiler and Clang
+
+* Bug fixes:
+ . Fixed unsafe bool conversion to avoid problems on C{plus}{plus}/CLI
+ . Iterator dereference operator is const now (fixes Boost `filter_iterator` support)
+ . `xml_document::save_file` now checks for file I/O errors during saving
+
+[[v1.0]]
+=== v1.0 ^1.11.2010^
+
+Major release, featuring many XPath enhancements, wide character filename support, miscellaneous performance improvements, bug fixes and more.
+
+* XPath:
+ . XPath implementation is moved to `pugixml.cpp` (which is the only source file now); use `PUGIXML_NO_XPATH` if you want to disable XPath to reduce code size
+ . XPath is now supported without exceptions (`PUGIXML_NO_EXCEPTIONS`); the error handling mechanism depends on the presence of exception support
+ . XPath is now supported without STL (`PUGIXML_NO_STL`)
+ . Introduced variable support
+ . Introduced new `xpath_query::evaluate_string`, which works without STL
+ . Introduced new `xpath_node_set` constructor (from an iterator range)
+ . Evaluation function now accept attribute context nodes
+ . All internal allocations use custom allocation functions
+ . Improved error reporting; now a last parsed offset is returned together with the parsing error
+
+* Bug fixes:
+ . Fixed memory leak for loading from streams with stream exceptions turned on
+ . Fixed custom deallocation function calling with null pointer in one case
+ . Fixed missing attributes for iterator category functions; all functions/classes can now be DLL-exported
+ . Worked around Digital Mars compiler bug, which lead to minor read overfetches in several functions
+ . `load_file` now works with 2+ Gb files in MSVC/MinGW
+ . XPath: fixed memory leaks for incorrect queries
+ . XPath: fixed `xpath_node()` attribute constructor with empty attribute argument
+ . XPath: fixed `lang()` function for non-ASCII arguments
+
+* Specification changes:
+ . CDATA nodes containing `]]>` are printed as several nodes; while this changes the internal structure, this is the only way to escape CDATA contents
+ . Memory allocation errors during parsing now preserve last parsed offset (to give an idea about parsing progress)
+ . If an element node has the only child, and it is of CDATA type, then the extra indentation is omitted (previously this behavior only held for PCDATA children)
+
+* Additional functionality:
+ . Added `xml_parse_result` default constructor
+ . Added `xml_document::load_file` and `xml_document::save_file` with wide character paths
+ . Added `as_utf8` and `as_wide` overloads for `std::wstring`/`std::string` arguments
+ . Added DOCTYPE node type (`node_doctype`) and a special parse flag, `parse_doctype`, to add such nodes to the document during parsing
+ . Added `parse_full` parse flag mask, which extends `parse_default` with all node type parsing flags except `parse_ws_pcdata`
+ . Added `xml_node::hash_value()` and `xml_attribute::hash_value()` functions for use in hash-based containers
+ . Added `internal_object()` and additional constructor for both `xml_node` and `xml_attribute` for easier marshalling (useful for language bindings)
+ . Added `xml_document::document_element()` function
+ . Added `xml_node::prepend_attribute`, `xml_node::prepend_child` and `xml_node::prepend_copy` functions
+ . Added `xml_node::append_child`, `xml_node::prepend_child`, `xml_node::insert_child_before` and `xml_node::insert_child_after` overloads for element nodes (with name instead of type)
+ . Added `xml_document::reset()` function
+
+* Performance improvements:
+ . `xml_node::root()` and `xml_node::offset_debug()` are now O(1) instead of O(logN)
+ . Minor parsing optimizations
+ . Minor memory optimization for strings in DOM tree (`set_name`/`set_value`)
+ . Memory optimization for string memory reclaiming in DOM tree (`set_name`/`set_value` now reallocate the buffer if memory waste is too big)
+ . XPath: optimized document order sorting
+ . XPath: optimized child/attribute axis step
+ . XPath: optimized number-to-string conversions in MSVC
+ . XPath: optimized concat for many arguments
+ . XPath: optimized evaluation allocation mechanism: constant and document strings are not heap-allocated
+ . XPath: optimized evaluation allocation mechanism: all temporaries' allocations use fast stack-like allocator
+
+* Compatibility:
+ . Removed wildcard functions (`xml_node::child_w`, `xml_node::attribute_w`, etc.)
+ . Removed `xml_node::all_elements_by_name`
+ . Removed `xpath_type_t` enumeration; use `xpath_value_type` instead
+ . Removed `format_write_bom_utf8` enumeration; use `format_write_bom` instead
+ . Removed `xml_document::precompute_document_order`, `xml_attribute::document_order` and `xml_node::document_order` functions; document order sort optimization is now automatic
+ . Removed `xml_document::parse` functions and `transfer_ownership` struct; use `xml_document::load_buffer_inplace` and `xml_document::load_buffer_inplace_own` instead
+ . Removed `as_utf16` function; use `as_wide` instead
+
+[[v0.9]]
+=== v0.9 ^1.07.2010^
+
+Major release, featuring extended and improved Unicode support, miscellaneous performance improvements, bug fixes and more.
+
+* Major Unicode improvements:
+ . Introduced encoding support (automatic/manual encoding detection on load, manual encoding selection on save, conversion from/to UTF8, UTF16 LE/BE, UTF32 LE/BE)
+ . Introduced `wchar_t` mode (you can set `PUGIXML_WCHAR_MODE` define to switch pugixml internal encoding from UTF8 to `wchar_t`; all functions are switched to their Unicode variants)
+ . Load/save functions now support wide streams
+
+* Bug fixes:
+ . Fixed document corruption on failed parsing bug
+ . XPath string/number conversion improvements (increased precision, fixed crash for huge numbers)
+ . Improved DOCTYPE parsing: now parser recognizes all well-formed DOCTYPE declarations
+ . Fixed `xml_attribute::as_uint()` for large numbers (i.e. 2^32^-1)
+ . Fixed `xml_node::first_element_by_path` for path components that are prefixes of node names, but are not exactly equal to them.
+
+* Specification changes:
+ . `parse()` API changed to `load_buffer`/`load_buffer_inplace`/`load_buffer_inplace_own`; `load_buffer` APIs do not require zero-terminated strings.
+ . Renamed `as_utf16` to `as_wide`
+ . Changed `xml_node::offset_debug` return type and `xml_parse_result::offset` type to `ptrdiff_t`
+ . Nodes/attributes with empty names are now printed as `:anonymous`
+
+* Performance improvements:
+ . Optimized document parsing and saving
+ . Changed internal memory management: internal allocator is used for both metadata and name/value data; allocated pages are deleted if all allocations from them are deleted
+ . Optimized memory consumption: `sizeof(xml_node_struct)` reduced from 40 bytes to 32 bytes on x86
+ . Optimized debug mode parsing/saving by order of magnitude
+
+* Miscellaneous:
+ . All STL includes except `<exception>` in `pugixml.hpp` are replaced with forward declarations
+ . `xml_node::remove_child` and `xml_node::remove_attribute` now return the operation result
+
+* Compatibility:
+ . `parse()` and `as_utf16` are left for compatibility (these functions are deprecated and will be removed in version 1.0)
+ . Wildcard functions, `document_order`/`precompute_document_order` functions, `all_elements_by_name` function and `format_write_bom_utf8` flag are deprecated and will be removed in version 1.0
+ . `xpath_type_t` enumeration was renamed to `xpath_value_type`; `xpath_type_t` is deprecated and will be removed in version 1.0
+
+[[v0.5]]
+=== v0.5 ^8.11.2009^
+
+Major bugfix release. Changes:
+
+* XPath bugfixes:
+ . Fixed `translate()`, `lang()` and `concat()` functions (infinite loops/crashes)
+ . Fixed compilation of queries with empty literal strings (`""`)
+ . Fixed axis tests: they never add empty nodes/attributes to the resulting node set now
+ . Fixed string-value evaluation for node-set (the result excluded some text descendants)
+ . Fixed `self::` axis (it behaved like `ancestor-or-self::`)
+ . Fixed `following::` and `preceding::` axes (they included descendent and ancestor nodes, respectively)
+ . Minor fix for `namespace-uri()` function (namespace declaration scope includes the parent element of namespace declaration attribute)
+ . Some incorrect queries are no longer parsed now (i.e. `foo: *`)
+ . Fixed `text()`/etc. node test parsing bug (i.e. `foo[text()]` failed to compile)
+ . Fixed root step (`/`) - it now selects empty node set if query is evaluated on empty node
+ . Fixed string to number conversion (`"123 "` converted to NaN, `"123 .456"` converted to 123.456 - now the results are 123 and NaN, respectively)
+ . Node set copying now preserves sorted type; leads to better performance on some queries
+
+* Miscellaneous bugfixes:
+ . Fixed `xml_node::offset_debug` for PI nodes
+ . Added empty attribute checks to `xml_node::remove_attribute`
+ . Fixed `node_pi` and `node_declaration` copying
+ . Const-correctness fixes
+
+* Specification changes:
+ . `xpath_node::select_nodes()` and related functions now throw exception if expression return type is not node set (instead of assertion)
+ . `xml_node::traverse()` now sets depth to -1 for both `begin()` and `end()` callbacks (was 0 at `begin()` and -1 at `end()`)
+ . In case of non-raw node printing a newline is output after PCDATA inside nodes if the PCDATA has siblings
+ . UTF8 -> `wchar_t` conversion now considers 5-byte UTF8-like sequences as invalid
+
+* New features:
+ . Added `xpath_node_set::operator[]` for index-based iteration
+ . Added `xpath_query::return_type()`
+ . Added getter accessors for memory-management functions
+
+[[v0.42]]
+=== v0.42 ^17.09.2009^
+
+Maintenance release. Changes:
+
+* Bug fixes:
+ . Fixed deallocation in case of custom allocation functions or if `delete[]` / `free` are incompatible
+ . XPath parser fixed for incorrect queries (i.e. incorrect XPath queries should now always fail to compile)
+ . Const-correctness fixes for `find_child_by_attribute`
+ . Improved compatibility (miscellaneous warning fixes, fixed `<cstring>` include dependency for GCC)
+ . Fixed iterator begin/end and print function to work correctly for empty nodes
+
+* New features:
+ . Added `PUGIXML_API`/`PUGIXML_CLASS`/`PUGIXML_FUNCTION` configuration macros to control class/function attributes
+ . Added `xml_attribute::set_value` overloads for different types
+
+[[v0.41]]
+=== v0.41 ^8.02.2009^
+
+Maintenance release. Changes:
+
+* Bug fixes:
+ . Fixed bug with node printing (occasionally some content was not written to output stream)
+
+[[v0.4]]
+=== v0.4 ^18.01.2009^
+
+Changes:
+
+* Bug fixes:
+ . Documentation fix in samples for `parse()` with manual lifetime control
+ . Fixed document order sorting in XPath (it caused wrong order of nodes after `xpath_node_set::sort` and wrong results of some XPath queries)
+
+* Node printing changes:
+ . Single quotes are no longer escaped when printing nodes
+ . Symbols in second half of ASCII table are no longer escaped when printing nodes; because of this, `format_utf8` flag is deleted as it's no longer needed and `format_write_bom` is renamed to `format_write_bom_utf8`.
+ . Reworked node printing - now it works via `xml_writer` interface; implementations for `FILE*` and `std::ostream` are available. As a side-effect, `xml_document::save_file` now works without STL.
+
+* New features:
+ . Added unsigned integer support for attributes (`xml_attribute::as_uint`, `xml_attribute::operator=`)
+ . Now document declaration (`<?xml ...?>`) is parsed as node with type `node_declaration` when `parse_declaration` flag is specified (access to encoding/version is performed as if they were attributes, i.e. `doc.child("xml").attribute("version").as_float()`); corresponding flags for node printing were also added
+ . Added support for custom memory management (see `set_memory_management_functions` for details)
+ . Implemented node/attribute copying (see `xml_node::insert_copy_*` and `xml_node::append_copy` for details)
+ . Added `find_child_by_attribute` and `find_child_by_attribute_w` to simplify parsing code in some cases (i.e. COLLADA files)
+ . Added file offset information querying for debugging purposes (now you're able to determine exact location of any `xml_node` in parsed file, see `xml_node::offset_debug` for details)
+ . Improved error handling for parsing - now `load()`, `load_file()` and `parse()` return `xml_parse_result`, which contains error code and last parsed offset; this does not break old interface as `xml_parse_result` can be implicitly casted to `bool`.
+
+[[v0.34]]
+=== v0.34 ^31.10.2007^
+
+Maintenance release. Changes:
+
+* Bug fixes:
+ . Fixed bug with loading from text-mode iostreams
+ . Fixed leak when `transfer_ownership` is true and parsing is failing
+ . Fixed bug in saving (`\r` and `\n` are now escaped in attribute values)
+ . Renamed `free()` to `destroy()` - some macro conflicts were reported
+
+* New features:
+ . Improved compatibility (supported Digital Mars C{plus}{plus}, MSVC 6, CodeWarrior 8, PGI C{plus}{plus}, Comeau, supported PS3 and XBox360)
+ . `PUGIXML_NO_EXCEPTION` flag for platforms without exception handling
+
+[[v0.3]]
+=== v0.3 ^21.02.2007^
+
+Refactored, reworked and improved version. Changes:
+
+* Interface:
+ . Added XPath
+ . Added tree modification functions
+ . Added no STL compilation mode
+ . Added saving document to file
+ . Refactored parsing flags
+ . Removed `xml_parser` class in favor of `xml_document`
+ . Added transfer ownership parsing mode
+ . Modified the way `xml_tree_walker` works
+ . Iterators are now non-constant
+
+* Implementation:
+ . Support of several compilers and platforms
+ . Refactored and sped up parsing core
+ . Improved standard compliancy
+ . Added XPath implementation
+ . Fixed several bugs
+
+[[v0.2]]
+=== v0.2 ^6.11.2006^
+
+First public release. Changes:
+
+* Bug fixes:
+ . Fixed `child_value()` (for empty nodes)
+ . Fixed `xml_parser_impl` warning at W4
+
+* New features:
+ . Introduced `child_value(name)` and `child_value_w(name)`
+ . `parse_eol_pcdata` and `parse_eol_attribute` flags + `parse_minimal` optimizations
+ . Optimizations of `strconv_t`
+
+[[v0.1]]
+=== v0.1 ^15.07.2006^
+
+First private release for testing purposes
+
+:numbered:
+
+[[apiref]]
+== API Reference
+
+This is the reference for all macros, types, enumerations, classes and functions in pugixml. Each symbol is a link that leads to the relevant section of the manual.
+
+[[apiref.macros]]
+=== Macros
+
+[source,subs="+macros"]
+----
+#define +++<a href="#PUGIXML_WCHAR_MODE">PUGIXML_WCHAR_MODE</a>+++
+#define +++<a href="#PUGIXML_NO_XPATH">PUGIXML_NO_XPATH</a>+++
+#define +++<a href="#PUGIXML_NO_STL">PUGIXML_NO_STL</a>+++
+#define +++<a href="#PUGIXML_NO_EXCEPTIONS">PUGIXML_NO_EXCEPTIONS</a>+++
+#define +++<a href="#PUGIXML_API">PUGIXML_API</a>+++
+#define +++<a href="#PUGIXML_CLASS">PUGIXML_CLASS</a>+++
+#define +++<a href="#PUGIXML_FUNCTION">PUGIXML_FUNCTION</a>+++
+#define +++<a href="#PUGIXML_MEMORY_PAGE_SIZE">PUGIXML_MEMORY_PAGE_SIZE</a>+++
+#define +++<a href="#PUGIXML_MEMORY_OUTPUT_STACK">PUGIXML_MEMORY_OUTPUT_STACK</a>+++
+#define +++<a href="#PUGIXML_MEMORY_XPATH_PAGE_SIZE">PUGIXML_MEMORY_XPATH_PAGE_SIZE</a>+++
+#define +++<a href="#PUGIXML_HEADER_ONLY">PUGIXML_HEADER_ONLY</a>+++
+#define +++<a href="#PUGIXML_HAS_LONG_LONG">PUGIXML_HAS_LONG_LONG</a>+++
+----
+
+[[apiref.types]]
+=== Types
+
+[source,subs="+macros"]
+----
+typedef configuration-defined-type +++<a href="#char_t">char_t</a>+++;
+typedef configuration-defined-type +++<a href="#string_t">string_t</a>+++;
+typedef void* (*+++<a href="#allocation_function">allocation_function</a>+++)(size_t size);
+typedef void (*+++<a href="#deallocation_function">deallocation_function</a>+++)(void* ptr);
+----
+
+[[apiref.enums]]
+=== Enumerations
+
+[source,subs="+macros"]
+----
+enum +++<a href="#xml_node_type">xml_node_type</a>+++
+ +++<a href="#node_null">node_null</a>+++
+ +++<a href="#node_document">node_document</a>+++
+ +++<a href="#node_element">node_element</a>+++
+ +++<a href="#node_pcdata">node_pcdata</a>+++
+ +++<a href="#node_cdata">node_cdata</a>+++
+ +++<a href="#node_comment">node_comment</a>+++
+ +++<a href="#node_pi">node_pi</a>+++
+ +++<a href="#node_declaration">node_declaration</a>+++
+ +++<a href="#node_doctype">node_doctype</a>+++
+
+enum +++<a href="#xml_parse_status">xml_parse_status</a>+++
+ +++<a href="#status_ok">status_ok</a>+++
+ +++<a href="#status_file_not_found">status_file_not_found</a>+++
+ +++<a href="#status_io_error">status_io_error</a>+++
+ +++<a href="#status_out_of_memory">status_out_of_memory</a>+++
+ +++<a href="#status_internal_error">status_internal_error</a>+++
+ +++<a href="#status_unrecognized_tag">status_unrecognized_tag</a>+++
+ +++<a href="#status_bad_pi">status_bad_pi</a>+++
+ +++<a href="#status_bad_comment">status_bad_comment</a>+++
+ +++<a href="#status_bad_cdata">status_bad_cdata</a>+++
+ +++<a href="#status_bad_doctype">status_bad_doctype</a>+++
+ +++<a href="#status_bad_pcdata">status_bad_pcdata</a>+++
+ +++<a href="#status_bad_start_element">status_bad_start_element</a>+++
+ +++<a href="#status_bad_attribute">status_bad_attribute</a>+++
+ +++<a href="#status_bad_end_element">status_bad_end_element</a>+++
+ +++<a href="#status_end_element_mismatch">status_end_element_mismatch</a>+++
+ +++<a href="#status_append_invalid_root">status_append_invalid_root</a>+++
+ +++<a href="#status_no_document_element">status_no_document_element</a>+++
+
+enum +++<a href="#xml_encoding">xml_encoding</a>+++
+ +++<a href="#encoding_auto">encoding_auto</a>+++
+ +++<a href="#encoding_utf8">encoding_utf8</a>+++
+ +++<a href="#encoding_utf16_le">encoding_utf16_le</a>+++
+ +++<a href="#encoding_utf16_be">encoding_utf16_be</a>+++
+ +++<a href="#encoding_utf16">encoding_utf16</a>+++
+ +++<a href="#encoding_utf32_le">encoding_utf32_le</a>+++
+ +++<a href="#encoding_utf32_be">encoding_utf32_be</a>+++
+ +++<a href="#encoding_utf32">encoding_utf32</a>+++
+ +++<a href="#encoding_wchar">encoding_wchar</a>+++
+ +++<a href="#encoding_latin1">encoding_latin1</a>+++
+
+enum +++<a href="#xpath_value_type">xpath_value_type</a>+++
+ +++<a href="#xpath_type_none">xpath_type_none</a>+++
+ +++<a href="#xpath_type_node_set">xpath_type_node_set</a>+++
+ +++<a href="#xpath_type_number">xpath_type_number</a>+++
+ +++<a href="#xpath_type_string">xpath_type_string</a>+++
+ +++<a href="#xpath_type_boolean">xpath_type_boolean</a>+++
+----
+
+[[apiref.constants]]
+=== Constants
+
+[source,subs="+macros"]
+----
+// Formatting options bit flags:
+const unsigned int +++<a href="#format_default">format_default</a>+++
+const unsigned int +++<a href="#format_indent">format_indent</a>+++
+const unsigned int +++<a href="#format_indent_attributes">format_indent_attributes</a>+++
+const unsigned int +++<a href="#format_no_declaration">format_no_declaration</a>+++
+const unsigned int +++<a href="#format_no_escapes">format_no_escapes</a>+++
+const unsigned int +++<a href="#format_raw">format_raw</a>+++
+const unsigned int +++<a href="#format_save_file_text">format_save_file_text</a>+++
+const unsigned int +++<a href="#format_write_bom">format_write_bom</a>+++
+
+// Parsing options bit flags:
+const unsigned int +++<a href="#parse_cdata">parse_cdata</a>+++
+const unsigned int +++<a href="#parse_comments">parse_comments</a>+++
+const unsigned int +++<a href="#parse_declaration">parse_declaration</a>+++
+const unsigned int +++<a href="#parse_default">parse_default</a>+++
+const unsigned int +++<a href="#parse_doctype">parse_doctype</a>+++
+const unsigned int +++<a href="#parse_eol">parse_eol</a>+++
+const unsigned int +++<a href="#parse_escapes">parse_escapes</a>+++
+const unsigned int +++<a href="#parse_fragment">parse_fragment</a>+++
+const unsigned int +++<a href="#parse_full">parse_full</a>+++
+const unsigned int +++<a href="#parse_minimal">parse_minimal</a>+++
+const unsigned int +++<a href="#parse_pi">parse_pi</a>+++
+const unsigned int +++<a href="#parse_trim_pcdata">parse_trim_pcdata</a>+++
+const unsigned int +++<a href="#parse_ws_pcdata">parse_ws_pcdata</a>+++
+const unsigned int +++<a href="#parse_ws_pcdata_single">parse_ws_pcdata_single</a>+++
+const unsigned int +++<a href="#parse_wconv_attribute">parse_wconv_attribute</a>+++
+const unsigned int +++<a href="#parse_wnorm_attribute">parse_wnorm_attribute</a>+++
+----
+ 
+[[apiref.classes]]
+=== Classes
+
+[source,subs="+macros"]
+----
++++class <a href="#xml_attribute">xml_attribute</a>+++
+ +++<a href="#xml_attribute::ctor">xml_attribute</a>+++();
+
+ bool +++<a href="#xml_attribute::empty">empty</a>+++() const;
+ operator +++<a href="#xml_attribute::unspecified_bool_type">unspecified_bool_type</a>+++() const;
+
+ bool +++<a href="#xml_attribute::comparison">operator==</a>+++(const xml_attribute& r) const;
+ bool +++<a href="#xml_attribute::comparison">operator!=</a>+++(const xml_attribute& r) const;
+ bool +++<a href="#xml_attribute::comparison">operator&lt;</a>+++(const xml_attribute& r) const;
+ bool +++<a href="#xml_attribute::comparison">operator&gt;</a>+++(const xml_attribute& r) const;
+ bool +++<a href="#xml_attribute::comparison">operator&lt;=</a>+++(const xml_attribute& r) const;
+ bool +++<a href="#xml_attribute::comparison">operator&gt;=</a>+++(const xml_attribute& r) const;
+
+ size_t +++<a href="#xml_attribute::hash_value">hash_value</a>+++() const;
+
+ xml_attribute +++<a href="#xml_attribute::next_attribute">next_attribute</a>+++() const;
+ xml_attribute +++<a href="#xml_attribute::previous_attribute">previous_attribute</a>+++() const;
+
+ const char_t* +++<a href="#xml_attribute::name">name</a>+++() const;
+ const char_t* +++<a href="#xml_attribute::value">value</a>+++() const;
+
+ const char_t* +++<a href="#xml_attribute::as_string">as_string</a>+++(const char_t* def = "") const;
+ int +++<a href="#xml_attribute::as_int">as_int</a>+++(int def = 0) const;
+ unsigned int +++<a href="#xml_attribute::as_uint">as_uint</a>+++(unsigned int def = 0) const;
+ double +++<a href="#xml_attribute::as_double">as_double</a>+++(double def = 0) const;
+ float +++<a href="#xml_attribute::as_float">as_float</a>+++(float def = 0) const;
+ bool +++<a href="#xml_attribute::as_bool">as_bool</a>+++(bool def = false) const;
+ long long +++<a href="#xml_attribute::as_llong">as_llong</a>+++(long long def = 0) const;
+ unsigned long long +++<a href="#xml_attribute::as_ullong">as_ullong</a>+++(unsigned long long def = 0) const;
+
+ bool +++<a href="#xml_attribute::set_name">set_name</a>+++(const char_t* rhs);
+ bool +++<a href="#xml_attribute::set_value">set_value</a>+++(const char_t* rhs);
+ bool +++<a href="#xml_attribute::set_value">set_value</a>+++(int rhs);
+ bool +++<a href="#xml_attribute::set_value">set_value</a>+++(unsigned int rhs);
+ bool +++<a href="#xml_attribute::set_value">set_value</a>+++(double rhs);
+ bool +++<a href="#xml_attribute::set_value">set_value</a>+++(float rhs);
+ bool +++<a href="#xml_attribute::set_value">set_value</a>+++(bool rhs);
+ bool +++<a href="#xml_attribute::set_value">set_value</a>+++(long long rhs);
+ bool +++<a href="#xml_attribute::set_value">set_value</a>+++(unsigned long long rhs);
+
+ xml_attribute& +++<a href="#xml_attribute::assign">operator=</a>+++(const char_t* rhs);
+ xml_attribute& +++<a href="#xml_attribute::assign">operator=</a>+++(int rhs);
+ xml_attribute& +++<a href="#xml_attribute::assign">operator=</a>+++(unsigned int rhs);
+ xml_attribute& +++<a href="#xml_attribute::assign">operator=</a>+++(double rhs);
+ xml_attribute& +++<a href="#xml_attribute::assign">operator=</a>+++(float rhs);
+ xml_attribute& +++<a href="#xml_attribute::assign">operator=</a>+++(bool rhs);
+ xml_attribute& +++<a href="#xml_attribute::assign">operator=</a>+++(long long rhs);
+ xml_attribute& +++<a href="#xml_attribute::assign">operator=</a>+++(unsnigned long long rhs);
+
++++class <a href="#xml_node">xml_node</a>+++
+ +++<a href="#xml_node::ctor">xml_node</a>+++();
+
+ bool +++<a href="#xml_node::empty">empty</a>+++() const;
+ operator +++<a href="#xml_node::unspecified_bool_type">unspecified_bool_type</a>+++() const;
+
+ bool +++<a href="#xml_node::comparison">operator==</a>+++(const xml_node& r) const;
+ bool +++<a href="#xml_node::comparison">operator!=</a>+++(const xml_node& r) const;
+ bool +++<a href="#xml_node::comparison">operator&lt;</a>+++(const xml_node& r) const;
+ bool +++<a href="#xml_node::comparison">operator&gt;</a>+++(const xml_node& r) const;
+ bool +++<a href="#xml_node::comparison">operator&lt;=</a>+++(const xml_node& r) const;
+ bool +++<a href="#xml_node::comparison">operator&gt;=</a>+++(const xml_node& r) const;
+
+ size_t +++<a href="#xml_node::hash_value">hash_value</a>+++() const;
+
+ xml_node_type +++<a href="#xml_node::type">type</a>+++() const;
+
+ const char_t* +++<a href="#xml_node::name">name</a>+++() const;
+ const char_t* +++<a href="#xml_node::value">value</a>+++() const;
+
+ xml_node +++<a href="#xml_node::parent">parent</a>+++() const;
+ xml_node +++<a href="#xml_node::first_child">first_child</a>+++() const;
+ xml_node +++<a href="#xml_node::last_child">last_child</a>+++() const;
+ xml_node +++<a href="#xml_node::next_sibling">next_sibling</a>+++() const;
+ xml_node +++<a href="#xml_node::previous_sibling">previous_sibling</a>+++() const;
+
+ xml_attribute +++<a href="#xml_node::first_attribute">first_attribute</a>+++() const;
+ xml_attribute +++<a href="#xml_node::last_attribute">last_attribute</a>+++() const;
+
+ implementation-defined-type +++<a href="#xml_node::children">children</a>+++() const;
+ implementation-defined-type +++<a href="#xml_node::children">children</a>+++(const char_t* name) const;
+ implementation-defined-type +++<a href="#xml_node::attributes">attributes</a>+++() const;
+
+ xml_node +++<a href="#xml_node::child">child</a>+++(const char_t* name) const;
+ xml_attribute +++<a href="#xml_node::attribute">attribute</a>+++(const char_t* name) const;
+ xml_node +++<a href="#xml_node::next_sibling_name">next_sibling</a>+++(const char_t* name) const;
+ xml_node +++<a href="#xml_node::previous_sibling_name">previous_sibling</a>+++(const char_t* name) const;
+ xml_node +++<a href="#xml_node::find_child_by_attribute">find_child_by_attribute</a>+++(const char_t* name, const char_t* attr_name, const char_t* attr_value) const;
+ xml_node +++<a href="#xml_node::find_child_by_attribute">find_child_by_attribute</a>+++(const char_t* attr_name, const char_t* attr_value) const;
+
+ const char_t* +++<a href="#xml_node::child_value">child_value</a>+++() const;
+ const char_t* +++<a href="#xml_node::child_value">child_value</a>+++(const char_t* name) const;
+ xml_text +++<a href="#xml_node::text">text</a>+++() const;
+
+ typedef xml_node_iterator +++<a href="#xml_node_iterator">iterator</a>+++;
+ iterator +++<a href="#xml_node::begin">begin</a>+++() const;
+ iterator +++<a href="#xml_node::end">end</a>+++() const;
+
+ typedef xml_attribute_iterator +++<a href="#xml_attribute_iterator">attribute_iterator</a>+++;
+ attribute_iterator +++<a href="#xml_node::attributes_begin">attributes_begin</a>+++() const;
+ attribute_iterator +++<a href="#xml_node::attributes_end">attributes_end</a>+++() const;
+
+ bool +++<a href="#xml_node::traverse">traverse</a>+++(xml_tree_walker& walker);
+
+ template <typename Predicate> xml_attribute +++<a href="#xml_node::find_attribute">find_attribute</a>+++(Predicate pred) const;
+ template <typename Predicate> xml_node +++<a href="#xml_node::find_child">find_child</a>+++(Predicate pred) const;
+ template <typename Predicate> xml_node +++<a href="#xml_node::find_node">find_node</a>+++(Predicate pred) const;
+
+ string_t +++<a href="#xml_node::path">path</a>+++(char_t delimiter = '/') const;
+ xml_node +++<a href="#xml_node::first_element_by_path">xml_node::first_element_by_path</a>+++(const char_t* path, char_t delimiter = '/') const;
+ xml_node +++<a href="#xml_node::root">root</a>+++() const;
+ ptrdiff_t +++<a href="#xml_node::offset_debug">offset_debug</a>+++() const;
+
+ bool +++<a href="#xml_node::set_name">set_name</a>+++(const char_t* rhs);
+ bool +++<a href="#xml_node::set_value">set_value</a>+++(const char_t* rhs);
+
+ xml_attribute +++<a href="#xml_node::append_attribute">append_attribute</a>+++(const char_t* name);
+ xml_attribute +++<a href="#xml_node::prepend_attribute">prepend_attribute</a>+++(const char_t* name);
+ xml_attribute +++<a href="#xml_node::insert_attribute_after">insert_attribute_after</a>+++(const char_t* name, const xml_attribute& attr);
+ xml_attribute +++<a href="#xml_node::insert_attribute_before">insert_attribute_before</a>+++(const char_t* name, const xml_attribute& attr);
+
+ xml_node +++<a href="#xml_node::append_child">append_child</a>+++(xml_node_type type = node_element);
+ xml_node +++<a href="#xml_node::prepend_child">prepend_child</a>+++(xml_node_type type = node_element);
+ xml_node +++<a href="#xml_node::insert_child_after">insert_child_after</a>+++(xml_node_type type, const xml_node& node);
+ xml_node +++<a href="#xml_node::insert_child_before">insert_child_before</a>+++(xml_node_type type, const xml_node& node);
+
+ xml_node +++<a href="#xml_node::append_child">append_child</a>+++(const char_t* name);
+ xml_node +++<a href="#xml_node::prepend_child">prepend_child</a>+++(const char_t* name);
+ xml_node +++<a href="#xml_node::insert_child_after">insert_child_after</a>+++(const char_t* name, const xml_node& node);
+ xml_node +++<a href="#xml_node::insert_child_before">insert_child_before</a>+++(const char_t* name, const xml_node& node);
+
+ xml_attribute +++<a href="#xml_node::append_copy">append_copy</a>+++(const xml_attribute& proto);
+ xml_attribute +++<a href="#xml_node::prepend_copy">prepend_copy</a>+++(const xml_attribute& proto);
+ xml_attribute +++<a href="#xml_node::insert_copy_after">insert_copy_after</a>+++(const xml_attribute& proto, const xml_attribute& attr);
+ xml_attribute +++<a href="#xml_node::insert_copy_before">insert_copy_before</a>+++(const xml_attribute& proto, const xml_attribute& attr);
+
+ xml_node +++<a href="#xml_node::append_copy">append_copy</a>+++(const xml_node& proto);
+ xml_node +++<a href="#xml_node::prepend_copy">prepend_copy</a>+++(const xml_node& proto);
+ xml_node +++<a href="#xml_node::insert_copy_after">insert_copy_after</a>+++(const xml_node& proto, const xml_node& node);
+ xml_node +++<a href="#xml_node::insert_copy_before">insert_copy_before</a>+++(const xml_node& proto, const xml_node& node);
+
+ xml_node +++<a href="#xml_node::append_move">append_move</a>+++(const xml_node& moved);
+ xml_node +++<a href="#xml_node::prepend_move">prepend_move</a>+++(const xml_node& moved);
+ xml_node +++<a href="#xml_node::insert_move_after">insert_move_after</a>+++(const xml_node& moved, const xml_node& node);
+ xml_node +++<a href="#xml_node::insert_move_before">insert_move_before</a>+++(const xml_node& moved, const xml_node& node);
+
+ bool +++<a href="#xml_node::remove_attribute">remove_attribute</a>+++(const xml_attribute& a);
+ bool +++<a href="#xml_node::remove_attribute">remove_attribute</a>+++(const char_t* name);
+ bool +++<a href="#xml_node::remove_child">remove_child</a>+++(const xml_node& n);
+ bool +++<a href="#xml_node::remove_child">remove_child</a>+++(const char_t* name);
+
+ xml_parse_result +++<a href="#xml_node::append_buffer">append_buffer</a>+++(const void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+ void +++<a href="#xml_node::print">print</a>+++(xml_writer& writer, const char_t* indent = "\t", unsigned int flags = format_default, xml_encoding encoding = encoding_auto, unsigned int depth = 0) const;
+ void +++<a href="#xml_node::print_stream">print</a>+++(std::ostream& os, const char_t* indent = "\t", unsigned int flags = format_default, xml_encoding encoding = encoding_auto, unsigned int depth = 0) const;
+ void +++<a href="#xml_node::print_stream">print</a>+++(std::wostream& os, const char_t* indent = "\t", unsigned int flags = format_default, unsigned int depth = 0) const;
+
+ xpath_node +++<a href="#xml_node::select_node">select_node</a>+++(const char_t* query, xpath_variable_set* variables = 0) const;
+ xpath_node +++<a href="#xml_node::select_node_precomp">select_node</a>+++(const xpath_query& query) const;
+ xpath_node_set +++<a href="#xml_node::select_nodes">select_nodes</a>+++(const char_t* query, xpath_variable_set* variables = 0) const;
+ xpath_node_set +++<a href="#xml_node::select_nodes_precomp">select_nodes</a>+++(const xpath_query& query) const;
+
++++class <a href="#xml_document">xml_document</a>+++
+ +++<a href="#xml_document::ctor">xml_document</a>+++();
+ ~+++<a href="#xml_document::dtor">xml_document</a>+++();
+
+ void +++<a href="#xml_document::reset">reset</a>+++();
+ void +++<a href="#xml_document::reset">reset</a>+++(const xml_document& proto);
+
+ xml_parse_result +++<a href="#xml_document::load_stream">load</a>+++(std::istream& stream, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+ xml_parse_result +++<a href="#xml_document::load_stream">load</a>+++(std::wistream& stream, unsigned int options = parse_default);
+
+ xml_parse_result +++<a href="#xml_document::load_string">load_string</a>+++(const char_t* contents, unsigned int options = parse_default);
+
+ xml_parse_result +++<a href="#xml_document::load_file">load_file</a>+++(const char* path, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+ xml_parse_result +++<a href="#xml_document::load_file_wide">load_file</a>+++(const wchar_t* path, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+ xml_parse_result +++<a href="#xml_document::load_buffer">load_buffer</a>+++(const void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+ xml_parse_result +++<a href="#xml_document::load_buffer_inplace">load_buffer_inplace</a>+++(void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+ xml_parse_result +++<a href="#xml_document::load_buffer_inplace_own">load_buffer_inplace_own</a>+++(void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+ bool +++<a href="#xml_document::save_file">save_file</a>+++(const char* path, const char_t* indent = "\t", unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+ bool +++<a href="#xml_document::save_file_wide">save_file</a>+++(const wchar_t* path, const char_t* indent = "\t", unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+
+ void +++<a href="#xml_document::save_stream">save</a>+++(std::ostream& stream, const char_t* indent = "\t", unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+ void +++<a href="#xml_document::save_stream">save</a>+++(std::wostream& stream, const char_t* indent = "\t", unsigned int flags = format_default) const;
+
+ void +++<a href="#xml_document::save">save</a>+++(xml_writer& writer, const char_t* indent = "\t", unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+
+ xml_node +++<a href="#xml_document::document_element">document_element</a>+++() const;
+
++++struct <a href="#xml_parse_result">xml_parse_result</a>+++
+ xml_parse_status +++<a href="#xml_parse_result::status">status</a>+++;
+ ptrdiff_t +++<a href="#xml_parse_result::offset">offset</a>+++;
+ xml_encoding +++<a href="#xml_parse_result::encoding">encoding</a>+++;
+
+ operator +++<a href="#xml_parse_result::bool">bool</a>+++() const;
+ const char* +++<a href="#xml_parse_result::description">description</a>+++() const;
+
++++class <a href="#xml_node_iterator">xml_node_iterator</a>+++
++++class <a href="#xml_attribute_iterator">xml_attribute_iterator</a>+++
+
++++class <a href="#xml_tree_walker">xml_tree_walker</a>+++
+ virtual bool +++<a href="#xml_tree_walker::begin">begin</a>+++(xml_node& node);
+ virtual bool +++<a href="#xml_tree_walker::for_each">for_each</a>+++(xml_node& node) = 0;
+ virtual bool +++<a href="#xml_tree_walker::end">end</a>+++(xml_node& node);
+
+ int +++<a href="#xml_tree_walker::depth">depth</a>+++() const;
+
++++class <a href="#xml_text">xml_text</a>+++
+ bool +++<a href="#xml_text::empty">empty</a>+++() const;
+ operator +++<a href="#xml_text::unspecified_bool_type">xml_text::unspecified_bool_type</a>+++() const;
+
+ const char_t* +++<a href="#xml_text::get">xml_text::get</a>+++() const;
+
+ const char_t* +++<a href="#xml_text::as_string">as_string</a>+++(const char_t* def = "") const;
+ int +++<a href="#xml_text::as_int">as_int</a>+++(int def = 0) const;
+ unsigned int +++<a href="#xml_text::as_uint">as_uint</a>+++(unsigned int def = 0) const;
+ double +++<a href="#xml_text::as_double">as_double</a>+++(double def = 0) const;
+ float +++<a href="#xml_text::as_float">as_float</a>+++(float def = 0) const;
+ bool +++<a href="#xml_text::as_bool">as_bool</a>+++(bool def = false) const;
+ long long +++<a href="#xml_text::as_llong">as_llong</a>+++(long long def = 0) const;
+ unsigned long long +++<a href="#xml_text::as_ullong">as_ullong</a>+++(unsigned long long def = 0) const;
+
+ bool +++<a href="#xml_text::set">set</a>+++(const char_t* rhs);
+
+ bool +++<a href="#xml_text::set">set</a>+++(int rhs);
+ bool +++<a href="#xml_text::set">set</a>+++(unsigned int rhs);
+ bool +++<a href="#xml_text::set">set</a>+++(double rhs);
+ bool +++<a href="#xml_text::set">set</a>+++(float rhs);
+ bool +++<a href="#xml_text::set">set</a>+++(bool rhs);
+ bool +++<a href="#xml_text::set">set</a>+++(long long rhs);
+ bool +++<a href="#xml_text::set">set</a>+++(unsigned long long rhs);
+
+ xml_text& +++<a href="#xml_text::assign">operator=</a>+++(const char_t* rhs);
+ xml_text& +++<a href="#xml_text::assign">operator=</a>+++(int rhs);
+ xml_text& +++<a href="#xml_text::assign">operator=</a>+++(unsigned int rhs);
+ xml_text& +++<a href="#xml_text::assign">operator=</a>+++(double rhs);
+ xml_text& +++<a href="#xml_text::assign">operator=</a>+++(float rhs);
+ xml_text& +++<a href="#xml_text::assign">operator=</a>+++(bool rhs);
+ xml_text& +++<a href="#xml_text::assign">operator=</a>+++(long long rhs);
+ xml_text& +++<a href="#xml_text::assign">operator=</a>+++(unsigned long long rhs);
+
+ xml_node +++<a href="#xml_text::data">data</a>+++() const;
+
++++class <a href="#xml_writer">xml_writer</a>+++
+ virtual void +++<a href="#xml_writer::write">write</a>+++(const void* data, size_t size) = 0;
+
++++class <a href="#xml_writer_file">xml_writer_file</a>+++: public xml_writer
+ +++<a href="#xml_writer_file">xml_writer_file</a>+++(void* file);
+
++++class <a href="#xml_writer_stream">xml_writer_stream</a>+++: public xml_writer
+ +++<a href="#xml_writer_stream">xml_writer_stream</a>+++(std::ostream& stream);
+ +++<a href="#xml_writer_stream">xml_writer_stream</a>+++(std::wostream& stream);
+
++++struct <a href="#xpath_parse_result">xpath_parse_result</a>+++
+ const char* +++<a href="#xpath_parse_result::error">error</a>+++;
+ ptrdiff_t +++<a href="#xpath_parse_result::offset">offset</a>+++;
+
+ operator +++<a href="#xpath_parse_result::bool">bool</a>+++() const;
+ const char* +++<a href="#xpath_parse_result::description">description</a>+++() const;
+
++++class <a href="#xpath_query">xpath_query</a>+++
+ explicit +++<a href="#xpath_query::ctor">xpath_query</a>+++(const char_t* query, xpath_variable_set* variables = 0);
+
+ bool +++<a href="#xpath_query::evaluate_boolean">evaluate_boolean</a>+++(const xpath_node& n) const;
+ double +++<a href="#xpath_query::evaluate_number">evaluate_number</a>+++(const xpath_node& n) const;
+ string_t +++<a href="#xpath_query::evaluate_string">evaluate_string</a>+++(const xpath_node& n) const;
+ size_t +++<a href="#xpath_query::evaluate_string_buffer">evaluate_string</a>+++(char_t* buffer, size_t capacity, const xpath_node& n) const;
+ xpath_node_set +++<a href="#xpath_query::evaluate_node_set">evaluate_node_set</a>+++(const xpath_node& n) const;
+ xpath_node +++<a href="#xpath_query::evaluate_node">evaluate_node</a>+++(const xpath_node& n) const;
+
+ xpath_value_type +++<a href="#xpath_query::return_type">return_type</a>+++() const;
+
+ const xpath_parse_result& +++<a href="#xpath_query::result">result</a>+++() const;
+ operator +++<a href="#xpath_query::unspecified_bool_type">unspecified_bool_type</a>+++() const;
+
++++class <a href="#xpath_exception">xpath_exception</a>+++: public std::exception
+ virtual const char* +++<a href="#xpath_exception::what">what</a>+++() const throw();
+
+ const xpath_parse_result& +++<a href="#xpath_exception::result">result</a>+++() const;
+
++++class <a href="#xpath_node">xpath_node</a>+++
+ +++<a href="#xpath_node::ctor">xpath_node</a>+++();
+ +++<a href="#xpath_node::ctor">xpath_node</a>+++(const xml_node& node);
+ +++<a href="#xpath_node::ctor">xpath_node</a>+++(const xml_attribute& attribute, const xml_node& parent);
+
+ xml_node +++<a href="#xpath_node::node">node</a>+++() const;
+ xml_attribute +++<a href="#xpath_node::attribute">attribute</a>+++() const;
+ xml_node +++<a href="#xpath_node::parent">parent</a>+++() const;
+
+ operator +++<a href="#xpath_node::unspecified_bool_type">unspecified_bool_type</a>+++() const;
+ bool +++<a href="#xpath_node::comparison">operator==</a>+++(const xpath_node& n) const;
+ bool +++<a href="#xpath_node::comparison">operator!=</a>+++(const xpath_node& n) const;
+
++++class <a href="#xpath_node_set">xpath_node_set</a>+++
+ +++<a href="#xpath_node_set::ctor">xpath_node_set</a>+++();
+ +++<a href="#xpath_node_set::ctor">xpath_node_set</a>+++(const_iterator begin, const_iterator end, type_t type = type_unsorted);
+
+ typedef const xpath_node* +++<a href="#xpath_node_set::const_iterator">const_iterator</a>+++;
+ const_iterator +++<a href="#xpath_node_set::begin">begin</a>+++() const;
+ const_iterator +++<a href="#xpath_node_set::end">end</a>+++() const;
+
+ const xpath_node& +++<a href="#xpath_node_set::index">operator[</a>+++](size_t index) const;
+ size_t +++<a href="#xpath_node_set::size">size</a>+++() const;
+ bool +++<a href="#xpath_node_set::empty">empty</a>+++() const;
+
+ xpath_node +++<a href="#xpath_node_set::first">first</a>+++() const;
+
+ enum type_t {+++<a href="#xpath_node_set::type_unsorted">type_unsorted</a>+++, +++<a href="#xpath_node_set::type_sorted">type_sorted</a>+++, +++<a href="#xpath_node_set::type_sorted_reverse">type_sorted_reverse</a>+++};
+ type_t +++<a href="#xpath_node_set::type">type</a>+++() const;
+ void +++<a href="#xpath_node_set::sort">sort</a>+++(bool reverse = false);
+
++++class <a href="#xpath_variable">xpath_variable</a>+++
+ const char_t* +++<a href="#xpath_variable::name">name</a>+++() const;
+ xpath_value_type +++<a href="#xpath_variable::type">type</a>+++() const;
+
+ bool +++<a href="#xpath_variable::get_boolean">get_boolean</a>+++() const;
+ double +++<a href="#xpath_variable::get_number">get_number</a>+++() const;
+ const char_t* +++<a href="#xpath_variable::get_string">get_string</a>+++() const;
+ const xpath_node_set& +++<a href="#xpath_variable::get_node_set">get_node_set</a>+++() const;
+
+ bool +++<a href="#xpath_variable::set">set</a>+++(bool value);
+ bool +++<a href="#xpath_variable::set">set</a>+++(double value);
+ bool +++<a href="#xpath_variable::set">set</a>+++(const char_t* value);
+ bool +++<a href="#xpath_variable::set">set</a>+++(const xpath_node_set& value);
+
++++class <a href="#xpath_variable_set">xpath_variable_set</a>+++
+ xpath_variable* +++<a href="#xpath_variable_set::add">add</a>+++(const char_t* name, xpath_value_type type);
+
+ bool +++<a href="#xpath_variable_set::set">set</a>+++(const char_t* name, bool value);
+ bool +++<a href="#xpath_variable_set::set">set</a>+++(const char_t* name, double value);
+ bool +++<a href="#xpath_variable_set::set">set</a>+++(const char_t* name, const char_t* value);
+ bool +++<a href="#xpath_variable_set::set">set</a>+++(const char_t* name, const xpath_node_set& value);
+
+ xpath_variable* +++<a href="#xpath_variable_set::get">get</a>+++(const char_t* name);
+ const xpath_variable* +++<a href="#xpath_variable_set::get">get</a>+++(const char_t* name) const;
+----
+
+[[apiref.functions]]
+=== Functions
+
+[source,subs="+macros"]
+----
+std::string +++<a href="#as_utf8">as_utf8</a>+++(const wchar_t* str);
+std::string +++<a href="#as_utf8">as_utf8</a>+++(const std::wstring& str);
+std::wstring +++<a href="#as_wide">as_wide</a>+++(const char* str);
+std::wstring +++<a href="#as_wide">as_wide</a>+++(const std::string& str);
+void +++<a href="#set_memory_management_functions">set_memory_management_functions</a>+++(allocation_function allocate, deallocation_function deallocate);
+allocation_function +++<a href="#get_memory_allocation_function">get_memory_allocation_function</a>+++();
+deallocation_function +++<a href="#get_memory_deallocation_function">get_memory_deallocation_function</a>+++();
+----

lightspark.tar.xz/src/3rdparty/pugixml/docs/manual.html Added

@@ -0,0 +1,5516 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+<meta charset="UTF-8">
+
+<meta name="viewport" content="width=device-width, initial-scale=1.0">
+<meta name="generator" content="Asciidoctor 1.5.2">
+<meta name="author" content="website, repository">
+<title>pugixml 1.6 manual</title>
+<link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Open+Sans:300,300italic,400,400italic,600,600italic%7CNoto+Serif:400,400italic,700,700italic%7CDroid+Sans+Mono:400">
+<style>
+/* Asciidoctor default stylesheet | MIT License | http://asciidoctor.org */
+/* Remove the comments around the @import statement below when using this as a custom stylesheet */
+/*@import "https://fonts.googleapis.com/css?family=Open+Sans:300,300italic,400,400italic,600,600italic%7CNoto+Serif:400,400italic,700,700italic%7CDroid+Sans+Mono:400";*/
+article,aside,details,figcaption,figure,footer,header,hgroup,main,nav,section,summary{display:block}
+audio,canvas,video{display:inline-block}
+audio:not([controls]){display:none;height:0}
+[hidden],template{display:none}
+script{display:none!important}
+html{font-family:sans-serif;-ms-text-size-adjust:100%;-webkit-text-size-adjust:100%}
+body{margin:0}
+a{background:transparent}
+a:focus{outline:thin dotted}
+a:active,a:hover{outline:0}
+h1{font-size:2em;margin:.67em 0}
+abbr[title]{border-bottom:1px dotted}
+b,strong{font-weight:bold}
+dfn{font-style:italic}
+hr{-moz-box-sizing:content-box;box-sizing:content-box;height:0}
+mark{background:#ff0;color:#000}
+code,kbd,pre,samp{font-family:monospace;font-size:1em}
+pre{white-space:pre-wrap}
+q{quotes:"\201C" "\201D" "\2018" "\2019"}
+small{font-size:80%}
+sub,sup{font-size:75%;line-height:0;position:relative;vertical-align:baseline}
+sup{top:-.5em}
+sub{bottom:-.25em}
+img{border:0}
+svg:not(:root){overflow:hidden}
+figure{margin:0}
+fieldset{border:1px solid silver;margin:0 2px;padding:.35em .625em .75em}
+legend{border:0;padding:0}
+button,input,select,textarea{font-family:inherit;font-size:100%;margin:0}
+button,input{line-height:normal}
+button,select{text-transform:none}
+button,html input[type="button"],input[type="reset"],input[type="submit"]{-webkit-appearance:button;cursor:pointer}
+button[disabled],html input[disabled]{cursor:default}
+input[type="checkbox"],input[type="radio"]{box-sizing:border-box;padding:0}
+input[type="search"]{-webkit-appearance:textfield;-moz-box-sizing:content-box;-webkit-box-sizing:content-box;box-sizing:content-box}
+input[type="search"]::-webkit-search-cancel-button,input[type="search"]::-webkit-search-decoration{-webkit-appearance:none}
+button::-moz-focus-inner,input::-moz-focus-inner{border:0;padding:0}
+textarea{overflow:auto;vertical-align:top}
+table{border-collapse:collapse;border-spacing:0}
+*,*:before,*:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}
+html,body{font-size:100%}
+body{background:#fff;color:rgba(0,0,0,.8);padding:0;margin:0;font-family:"Noto Serif","DejaVu Serif",serif;font-weight:400;font-style:normal;line-height:1;position:relative;cursor:auto}
+a:hover{cursor:pointer}
+img,object,embed{max-width:100%;height:auto}
+object,embed{height:100%}
+img{-ms-interpolation-mode:bicubic}
+#map_canvas img,#map_canvas embed,#map_canvas object,.map_canvas img,.map_canvas embed,.map_canvas object{max-width:none!important}
+.left{float:left!important}
+.right{float:right!important}
+.text-left{text-align:left!important}
+.text-right{text-align:right!important}
+.text-center{text-align:center!important}
+.text-justify{text-align:justify!important}
+.hide{display:none}
+.antialiased,body{-webkit-font-smoothing:antialiased}
+img{display:inline-block;vertical-align:middle}
+textarea{height:auto;min-height:50px}
+select{width:100%}
+p.lead,.paragraph.lead>p,#preamble>.sectionbody>.paragraph:first-of-type p{font-size:1.21875em;line-height:1.6}
+.subheader,.admonitionblock td.content>.title,.audioblock>.title,.exampleblock>.title,.imageblock>.title,.listingblock>.title,.literalblock>.title,.stemblock>.title,.openblock>.title,.paragraph>.title,.quoteblock>.title,table.tableblock>.title,.verseblock>.title,.videoblock>.title,.dlist>.title,.olist>.title,.ulist>.title,.qlist>.title,.hdlist>.title{line-height:1.45;color:#7a2518;font-weight:400;margin-top:0;margin-bottom:.25em}
+div,dl,dt,dd,ul,ol,li,h1,h2,h3,#toctitle,.sidebarblock>.content>.title,h4,h5,h6,pre,form,p,blockquote,th,td{margin:0;padding:0;direction:ltr}
+a{color:#2156a5;text-decoration:underline;line-height:inherit}
+a:hover,a:focus{color:#1d4b8f}
+a img{border:none}
+p{font-family:inherit;font-weight:400;font-size:1em;line-height:1.6;margin-bottom:1.25em;text-rendering:optimizeLegibility}
+p aside{font-size:.875em;line-height:1.35;font-style:italic}
+h1,h2,h3,#toctitle,.sidebarblock>.content>.title,h4,h5,h6{font-family:"Open Sans","DejaVu Sans",sans-serif;font-weight:300;font-style:normal;color:#ba3925;text-rendering:optimizeLegibility;margin-top:1em;margin-bottom:.5em;line-height:1.0125em}
+h1 small,h2 small,h3 small,#toctitle small,.sidebarblock>.content>.title small,h4 small,h5 small,h6 small{font-size:60%;color:#e99b8f;line-height:0}
+h1{font-size:2.125em}
+h2{font-size:1.6875em}
+h3,#toctitle,.sidebarblock>.content>.title{font-size:1.375em}
+h4,h5{font-size:1.125em}
+h6{font-size:1em}
+hr{border:solid #ddddd8;border-width:1px 0 0;clear:both;margin:1.25em 0 1.1875em;height:0}
+em,i{font-style:italic;line-height:inherit}
+strong,b{font-weight:bold;line-height:inherit}
+small{font-size:60%;line-height:inherit}
+code{font-family:"Droid Sans Mono","DejaVu Sans Mono",monospace;font-weight:400;color:rgba(0,0,0,.9)}
+ul,ol,dl{font-size:1em;line-height:1.6;margin-bottom:1.25em;list-style-position:outside;font-family:inherit}
+ul,ol,ul.no-bullet,ol.no-bullet{margin-left:1.5em}
+ul li ul,ul li ol{margin-left:1.25em;margin-bottom:0;font-size:1em}
+ul.square li ul,ul.circle li ul,ul.disc li ul{list-style:inherit}
+ul.square{list-style-type:square}
+ul.circle{list-style-type:circle}
+ul.disc{list-style-type:disc}
+ul.no-bullet{list-style:none}
+ol li ul,ol li ol{margin-left:1.25em;margin-bottom:0}
+dl dt{margin-bottom:.3125em;font-weight:bold}
+dl dd{margin-bottom:1.25em}
+abbr,acronym{text-transform:uppercase;font-size:90%;color:rgba(0,0,0,.8);border-bottom:1px dotted #ddd;cursor:help}
+abbr{text-transform:none}
+blockquote{margin:0 0 1.25em;padding:.5625em 1.25em 0 1.1875em;border-left:1px solid #ddd}
+blockquote cite{display:block;font-size:.9375em;color:rgba(0,0,0,.6)}
+blockquote cite:before{content:"\2014 \0020"}
+blockquote cite a,blockquote cite a:visited{color:rgba(0,0,0,.6)}
+blockquote,blockquote p{line-height:1.6;color:rgba(0,0,0,.85)}
+@media only screen and (min-width:768px){h1,h2,h3,#toctitle,.sidebarblock>.content>.title,h4,h5,h6{line-height:1.2}
+h1{font-size:2.75em}
+h2{font-size:2.3125em}
+h3,#toctitle,.sidebarblock>.content>.title{font-size:1.6875em}
+h4{font-size:1.4375em}}table{background:#fff;margin-bottom:1.25em;border:solid 1px #dedede}
+table thead,table tfoot{background:#f7f8f7;font-weight:bold}
+table thead tr th,table thead tr td,table tfoot tr th,table tfoot tr td{padding:.5em .625em .625em;font-size:inherit;color:rgba(0,0,0,.8);text-align:left}
+table tr th,table tr td{padding:.5625em .625em;font-size:inherit;color:rgba(0,0,0,.8)}
+table tr.even,table tr.alt,table tr:nth-of-type(even){background:#f8f8f7}
+table thead tr th,table tfoot tr th,table tbody tr td,table tr td,table tfoot tr td{display:table-cell;line-height:1.6}
+h1,h2,h3,#toctitle,.sidebarblock>.content>.title,h4,h5,h6{line-height:1.2;word-spacing:-.05em}
+h1 strong,h2 strong,h3 strong,#toctitle strong,.sidebarblock>.content>.title strong,h4 strong,h5 strong,h6 strong{font-weight:400}
+.clearfix:before,.clearfix:after,.float-group:before,.float-group:after{content:" ";display:table}
+.clearfix:after,.float-group:after{clear:both}
+*:not(pre)>code{font-size:.9375em;font-style:normal!important;letter-spacing:0;padding:.1em .5ex;word-spacing:-.15em;background-color:#f7f7f8;-webkit-border-radius:4px;border-radius:4px;line-height:1.45;text-rendering:optimizeSpeed}
+pre,pre>code{line-height:1.45;color:rgba(0,0,0,.9);font-family:"Droid Sans Mono","DejaVu Sans Mono",monospace;font-weight:400;text-rendering:optimizeSpeed}
+.keyseq{color:rgba(51,51,51,.8)}
+kbd{display:inline-block;color:rgba(0,0,0,.8);font-size:.75em;line-height:1.4;background-color:#f7f7f7;border:1px solid #ccc;-webkit-border-radius:3px;border-radius:3px;-webkit-box-shadow:0 1px 0 rgba(0,0,0,.2),0 0 0 .1em white inset;box-shadow:0 1px 0 rgba(0,0,0,.2),0 0 0 .1em #fff inset;margin:-.15em .15em 0 .15em;padding:.2em .6em .2em .5em;vertical-align:middle;white-space:nowrap}
+.keyseq kbd:first-child{margin-left:0}
+.keyseq kbd:last-child{margin-right:0}
+.menuseq,.menu{color:rgba(0,0,0,.8)}
+b.button:before,b.button:after{position:relative;top:-1px;font-weight:400}
+b.button:before{content:"[";padding:0 3px 0 2px}
+b.button:after{content:"]";padding:0 2px 0 3px}
+p a>code:hover{color:rgba(0,0,0,.9)}
+#header,#content,#footnotes,#footer{width:100%;margin-left:auto;margin-right:auto;margin-top:0;margin-bottom:0;max-width:62.5em;*zoom:1;position:relative;padding-left:.9375em;padding-right:.9375em}
+#header:before,#header:after,#content:before,#content:after,#footnotes:before,#footnotes:after,#footer:before,#footer:after{content:" ";display:table}
+#header:after,#content:after,#footnotes:after,#footer:after{clear:both}
+#content{margin-top:1.25em}
+#content:before{content:none}
+#header>h1:first-child{color:rgba(0,0,0,.85);margin-top:2.25rem;margin-bottom:0}
+#header>h1:first-child+#toc{margin-top:8px;border-top:1px solid #ddddd8}
+#header>h1:only-child,body.toc2 #header>h1:nth-last-child(2){border-bottom:1px solid #ddddd8;padding-bottom:8px}
+#header .details{border-bottom:1px solid #ddddd8;line-height:1.45;padding-top:.25em;padding-bottom:.25em;padding-left:.25em;color:rgba(0,0,0,.6);display:-ms-flexbox;display:-webkit-flex;display:flex;-ms-flex-flow:row wrap;-webkit-flex-flow:row wrap;flex-flow:row wrap}
+#header .details span:first-child{margin-left:-.125em}
+#header .details span.email a{color:rgba(0,0,0,.85)}
+#header .details br{display:none}
+#header .details br+span:before{content:"\00a0\2013\00a0"}
+#header .details br+span.author:before{content:"\00a0\22c5\00a0";color:rgba(0,0,0,.85)}
+#header .details br+span#revremark:before{content:"\00a0|\00a0"}
+#header #revnumber{text-transform:capitalize}
+#header #revnumber:after{content:"\00a0"}
+#content>h1:first-child:not([class]){color:rgba(0,0,0,.85);border-bottom:1px solid #ddddd8;padding-bottom:8px;margin-top:0;padding-top:1rem;margin-bottom:1.25rem}
+#toc{border-bottom:1px solid #efefed;padding-bottom:.5em}
+#toc>ul{margin-left:.125em}
+#toc ul.sectlevel0>li>a{font-style:italic}
+#toc ul.sectlevel0 ul.sectlevel1{margin:.5em 0}
+#toc ul{font-family:"Open Sans","DejaVu Sans",sans-serif;list-style-type:none}
+#toc a{text-decoration:none}
+#toc a:active{text-decoration:underline}
+#toctitle{color:#7a2518;font-size:1.2em}
+@media only screen and (min-width:768px){#toctitle{font-size:1.375em}
+body.toc2{padding-left:15em;padding-right:0}
+#toc.toc2{margin-top:0!important;background-color:#f8f8f7;position:fixed;width:15em;left:0;top:0;border-right:1px solid #efefed;border-top-width:0!important;border-bottom-width:0!important;z-index:1000;padding:1.25em 1em;height:100%;overflow:auto}
+#toc.toc2 #toctitle{margin-top:0;font-size:1.2em}
+#toc.toc2>ul{font-size:.9em;margin-bottom:0}
+#toc.toc2 ul ul{margin-left:0;padding-left:1em}
+#toc.toc2 ul.sectlevel0 ul.sectlevel1{padding-left:0;margin-top:.5em;margin-bottom:.5em}
+body.toc2.toc-right{padding-left:0;padding-right:15em}
+body.toc2.toc-right #toc.toc2{border-right-width:0;border-left:1px solid #efefed;left:auto;right:0}}@media only screen and (min-width:1280px){body.toc2{padding-left:20em;padding-right:0}
+#toc.toc2{width:20em}
+#toc.toc2 #toctitle{font-size:1.375em}
+#toc.toc2>ul{font-size:.95em}
+#toc.toc2 ul ul{padding-left:1.25em}
+body.toc2.toc-right{padding-left:0;padding-right:20em}}#content #toc{border-style:solid;border-width:1px;border-color:#e0e0dc;margin-bottom:1.25em;padding:1.25em;background:#f8f8f7;-webkit-border-radius:4px;border-radius:4px}
+#content #toc>:first-child{margin-top:0}
+#content #toc>:last-child{margin-bottom:0}
+#footer{max-width:100%;background-color:rgba(0,0,0,.8);padding:1.25em}
+#footer-text{color:rgba(255,255,255,.8);line-height:1.44}
+.sect1{padding-bottom:.625em}
+@media only screen and (min-width:768px){.sect1{padding-bottom:1.25em}}.sect1+.sect1{border-top:1px solid #efefed}
+#content h1>a.anchor,h2>a.anchor,h3>a.anchor,#toctitle>a.anchor,.sidebarblock>.content>.title>a.anchor,h4>a.anchor,h5>a.anchor,h6>a.anchor{position:absolute;z-index:1001;width:1.5ex;margin-left:-1.5ex;display:block;text-decoration:none!important;visibility:hidden;text-align:center;font-weight:400}
+#content h1>a.anchor:before,h2>a.anchor:before,h3>a.anchor:before,#toctitle>a.anchor:before,.sidebarblock>.content>.title>a.anchor:before,h4>a.anchor:before,h5>a.anchor:before,h6>a.anchor:before{content:"\00A7";font-size:.85em;display:block;padding-top:.1em}
+#content h1:hover>a.anchor,#content h1>a.anchor:hover,h2:hover>a.anchor,h2>a.anchor:hover,h3:hover>a.anchor,#toctitle:hover>a.anchor,.sidebarblock>.content>.title:hover>a.anchor,h3>a.anchor:hover,#toctitle>a.anchor:hover,.sidebarblock>.content>.title>a.anchor:hover,h4:hover>a.anchor,h4>a.anchor:hover,h5:hover>a.anchor,h5>a.anchor:hover,h6:hover>a.anchor,h6>a.anchor:hover{visibility:visible}
+#content h1>a.link,h2>a.link,h3>a.link,#toctitle>a.link,.sidebarblock>.content>.title>a.link,h4>a.link,h5>a.link,h6>a.link{color:#ba3925;text-decoration:none}
+#content h1>a.link:hover,h2>a.link:hover,h3>a.link:hover,#toctitle>a.link:hover,.sidebarblock>.content>.title>a.link:hover,h4>a.link:hover,h5>a.link:hover,h6>a.link:hover{color:#a53221}
+.audioblock,.imageblock,.literalblock,.listingblock,.stemblock,.videoblock{margin-bottom:1.25em}
+.admonitionblock td.content>.title,.audioblock>.title,.exampleblock>.title,.imageblock>.title,.listingblock>.title,.literalblock>.title,.stemblock>.title,.openblock>.title,.paragraph>.title,.quoteblock>.title,table.tableblock>.title,.verseblock>.title,.videoblock>.title,.dlist>.title,.olist>.title,.ulist>.title,.qlist>.title,.hdlist>.title{text-rendering:optimizeLegibility;text-align:left;font-family:"Noto Serif","DejaVu Serif",serif;font-size:1rem;font-style:italic}
+table.tableblock>caption.title{white-space:nowrap;overflow:visible;max-width:0}
+.paragraph.lead>p,#preamble>.sectionbody>.paragraph:first-of-type p{color:rgba(0,0,0,.85)}
+table.tableblock #preamble>.sectionbody>.paragraph:first-of-type p{font-size:inherit}
+.admonitionblock>table{border-collapse:separate;border:0;background:none;width:100%}
+.admonitionblock>table td.icon{text-align:center;width:80px}
+.admonitionblock>table td.icon img{max-width:none}
+.admonitionblock>table td.icon .title{font-weight:bold;font-family:"Open Sans","DejaVu Sans",sans-serif;text-transform:uppercase}
+.admonitionblock>table td.content{padding-left:1.125em;padding-right:1.25em;border-left:1px solid #ddddd8;color:rgba(0,0,0,.6)}
+.admonitionblock>table td.content>:last-child>:last-child{margin-bottom:0}
+.exampleblock>.content{border-style:solid;border-width:1px;border-color:#e6e6e6;margin-bottom:1.25em;padding:1.25em;background:#fff;-webkit-border-radius:4px;border-radius:4px}
+.exampleblock>.content>:first-child{margin-top:0}
+.exampleblock>.content>:last-child{margin-bottom:0}
+.sidebarblock{border-style:solid;border-width:1px;border-color:#e0e0dc;margin-bottom:1.25em;padding:1.25em;background:#f8f8f7;-webkit-border-radius:4px;border-radius:4px}
+.sidebarblock>:first-child{margin-top:0}
+.sidebarblock>:last-child{margin-bottom:0}
+.sidebarblock>.content>.title{color:#7a2518;margin-top:0;text-align:center}
+.exampleblock>.content>:last-child>:last-child,.exampleblock>.content .olist>ol>li:last-child>:last-child,.exampleblock>.content .ulist>ul>li:last-child>:last-child,.exampleblock>.content .qlist>ol>li:last-child>:last-child,.sidebarblock>.content>:last-child>:last-child,.sidebarblock>.content .olist>ol>li:last-child>:last-child,.sidebarblock>.content .ulist>ul>li:last-child>:last-child,.sidebarblock>.content .qlist>ol>li:last-child>:last-child{margin-bottom:0}
+.literalblock pre,.listingblock pre:not(.highlight),.listingblock pre[class="highlight"],.listingblock pre[class^="highlight "],.listingblock pre.CodeRay,.listingblock pre.prettyprint{background:#f7f7f8}
+.sidebarblock .literalblock pre,.sidebarblock .listingblock pre:not(.highlight),.sidebarblock .listingblock pre[class="highlight"],.sidebarblock .listingblock pre[class^="highlight "],.sidebarblock .listingblock pre.CodeRay,.sidebarblock .listingblock pre.prettyprint{background:#f2f1f1}
+.literalblock pre,.literalblock pre[class],.listingblock pre,.listingblock pre[class]{-webkit-border-radius:4px;border-radius:4px;word-wrap:break-word;padding:1em;font-size:.8125em}
+.literalblock pre.nowrap,.literalblock pre[class].nowrap,.listingblock pre.nowrap,.listingblock pre[class].nowrap{overflow-x:auto;white-space:pre;word-wrap:normal}
+@media only screen and (min-width:768px){.literalblock pre,.literalblock pre[class],.listingblock pre,.listingblock pre[class]{font-size:.90625em}}@media only screen and (min-width:1280px){.literalblock pre,.literalblock pre[class],.listingblock pre,.listingblock pre[class]{font-size:1em}}.literalblock.output pre{color:#f7f7f8;background-color:rgba(0,0,0,.9)}
+.listingblock pre.highlightjs{padding:0}
+.listingblock pre.highlightjs>code{padding:1em;-webkit-border-radius:4px;border-radius:4px}
+.listingblock pre.prettyprint{border-width:0}
+.listingblock>.content{position:relative}
+.listingblock code[data-lang]:before{display:none;content:attr(data-lang);position:absolute;font-size:.75em;top:.425rem;right:.5rem;line-height:1;text-transform:uppercase;color:#999}
+.listingblock:hover code[data-lang]:before{display:block}
+.listingblock.terminal pre .command:before{content:attr(data-prompt);padding-right:.5em;color:#999}
+.listingblock.terminal pre .command:not([data-prompt]):before{content:"$"}
+table.pyhltable{border-collapse:separate;border:0;margin-bottom:0;background:none}
+table.pyhltable td{vertical-align:top;padding-top:0;padding-bottom:0}
+table.pyhltable td.code{padding-left:.75em;padding-right:0}
+pre.pygments .lineno,table.pyhltable td:not(.code){color:#999;padding-left:0;padding-right:.5em;border-right:1px solid #ddddd8}
+pre.pygments .lineno{display:inline-block;margin-right:.25em}
+table.pyhltable .linenodiv{background:none!important;padding-right:0!important}
+.quoteblock{margin:0 1em 1.25em 1.5em;display:table}
+.quoteblock>.title{margin-left:-1.5em;margin-bottom:.75em}
+.quoteblock blockquote,.quoteblock blockquote p{color:rgba(0,0,0,.85);font-size:1.15rem;line-height:1.75;word-spacing:.1em;letter-spacing:0;font-style:italic;text-align:justify}
+.quoteblock blockquote{margin:0;padding:0;border:0}
+.quoteblock blockquote:before{content:"\201c";float:left;font-size:2.75em;font-weight:bold;line-height:.6em;margin-left:-.6em;color:#7a2518;text-shadow:0 1px 2px rgba(0,0,0,.1)}
+.quoteblock blockquote>.paragraph:last-child p{margin-bottom:0}
+.quoteblock .attribution{margin-top:.5em;margin-right:.5ex;text-align:right}
+.quoteblock .quoteblock{margin-left:0;margin-right:0;padding:.5em 0;border-left:3px solid rgba(0,0,0,.6)}
+.quoteblock .quoteblock blockquote{padding:0 0 0 .75em}
+.quoteblock .quoteblock blockquote:before{display:none}
+.verseblock{margin:0 1em 1.25em 1em}
+.verseblock pre{font-family:"Open Sans","DejaVu Sans",sans;font-size:1.15rem;color:rgba(0,0,0,.85);font-weight:300;text-rendering:optimizeLegibility}
+.verseblock pre strong{font-weight:400}
+.verseblock .attribution{margin-top:1.25rem;margin-left:.5ex}
+.quoteblock .attribution,.verseblock .attribution{font-size:.9375em;line-height:1.45;font-style:italic}
+.quoteblock .attribution br,.verseblock .attribution br{display:none}
+.quoteblock .attribution cite,.verseblock .attribution cite{display:block;letter-spacing:-.05em;color:rgba(0,0,0,.6)}
+.quoteblock.abstract{margin:0 0 1.25em 0;display:block}
+.quoteblock.abstract blockquote,.quoteblock.abstract blockquote p{text-align:left;word-spacing:0}
+.quoteblock.abstract blockquote:before,.quoteblock.abstract blockquote p:first-of-type:before{display:none}
+table.tableblock{max-width:100%;border-collapse:separate}
+table.tableblock td>.paragraph:last-child p>p:last-child,table.tableblock th>p:last-child,table.tableblock td>p:last-child{margin-bottom:0}
+table.spread{width:100%}
+table.tableblock,th.tableblock,td.tableblock{border:0 solid #dedede}
+table.grid-all th.tableblock,table.grid-all td.tableblock{border-width:0 1px 1px 0}
+table.grid-all tfoot>tr>th.tableblock,table.grid-all tfoot>tr>td.tableblock{border-width:1px 1px 0 0}
+table.grid-cols th.tableblock,table.grid-cols td.tableblock{border-width:0 1px 0 0}
+table.grid-all *>tr>.tableblock:last-child,table.grid-cols *>tr>.tableblock:last-child{border-right-width:0}
+table.grid-rows th.tableblock,table.grid-rows td.tableblock{border-width:0 0 1px 0}
+table.grid-all tbody>tr:last-child>th.tableblock,table.grid-all tbody>tr:last-child>td.tableblock,table.grid-all thead:last-child>tr>th.tableblock,table.grid-rows tbody>tr:last-child>th.tableblock,table.grid-rows tbody>tr:last-child>td.tableblock,table.grid-rows thead:last-child>tr>th.tableblock{border-bottom-width:0}
+table.grid-rows tfoot>tr>th.tableblock,table.grid-rows tfoot>tr>td.tableblock{border-width:1px 0 0 0}
+table.frame-all{border-width:1px}
+table.frame-sides{border-width:0 1px}
+table.frame-topbot{border-width:1px 0}
+th.halign-left,td.halign-left{text-align:left}
+th.halign-right,td.halign-right{text-align:right}
+th.halign-center,td.halign-center{text-align:center}
+th.valign-top,td.valign-top{vertical-align:top}
+th.valign-bottom,td.valign-bottom{vertical-align:bottom}
+th.valign-middle,td.valign-middle{vertical-align:middle}
+table thead th,table tfoot th{font-weight:bold}
+tbody tr th{display:table-cell;line-height:1.6;background:#f7f8f7}
+tbody tr th,tbody tr th p,tfoot tr th,tfoot tr th p{color:rgba(0,0,0,.8);font-weight:bold}
+p.tableblock>code:only-child{background:none;padding:0}
+p.tableblock{font-size:1em}
+td>div.verse{white-space:pre}
+ol{margin-left:1.75em}
+ul li ol{margin-left:1.5em}
+dl dd{margin-left:1.125em}
+dl dd:last-child,dl dd:last-child>:last-child{margin-bottom:0}
+ol>li p,ul>li p,ul dd,ol dd,.olist .olist,.ulist .ulist,.ulist .olist,.olist .ulist{margin-bottom:.625em}
+ul.unstyled,ol.unnumbered,ul.checklist,ul.none{list-style-type:none}
+ul.unstyled,ol.unnumbered,ul.checklist{margin-left:.625em}
+ul.checklist li>p:first-child>.fa-square-o:first-child,ul.checklist li>p:first-child>.fa-check-square-o:first-child{width:1em;font-size:.85em}
+ul.checklist li>p:first-child>input[type="checkbox"]:first-child{width:1em;position:relative;top:1px}
+ul.inline{margin:0 auto .625em auto;margin-left:-1.375em;margin-right:0;padding:0;list-style:none;overflow:hidden}
+ul.inline>li{list-style:none;float:left;margin-left:1.375em;display:block}
+ul.inline>li>*{display:block}
+.unstyled dl dt{font-weight:400;font-style:normal}
+ol.arabic{list-style-type:decimal}
+ol.decimal{list-style-type:decimal-leading-zero}
+ol.loweralpha{list-style-type:lower-alpha}
+ol.upperalpha{list-style-type:upper-alpha}
+ol.lowerroman{list-style-type:lower-roman}
+ol.upperroman{list-style-type:upper-roman}
+ol.lowergreek{list-style-type:lower-greek}
+.hdlist>table,.colist>table{border:0;background:none}
+.hdlist>table>tbody>tr,.colist>table>tbody>tr{background:none}
+td.hdlist1{padding-right:.75em;font-weight:bold}
+td.hdlist1,td.hdlist2{vertical-align:top}
+.literalblock+.colist,.listingblock+.colist{margin-top:-.5em}
+.colist>table tr>td:first-of-type{padding:0 .75em;line-height:1}
+.colist>table tr>td:last-of-type{padding:.25em 0}
+.thumb,.th{line-height:0;display:inline-block;border:solid 4px #fff;-webkit-box-shadow:0 0 0 1px #ddd;box-shadow:0 0 0 1px #ddd}
+.imageblock.left,.imageblock[style*="float: left"]{margin:.25em .625em 1.25em 0}
+.imageblock.right,.imageblock[style*="float: right"]{margin:.25em 0 1.25em .625em}
+.imageblock>.title{margin-bottom:0}
+.imageblock.thumb,.imageblock.th{border-width:6px}
+.imageblock.thumb>.title,.imageblock.th>.title{padding:0 .125em}
+.image.left,.image.right{margin-top:.25em;margin-bottom:.25em;display:inline-block;line-height:0}
+.image.left{margin-right:.625em}
+.image.right{margin-left:.625em}
+a.image{text-decoration:none}
+span.footnote,span.footnoteref{vertical-align:super;font-size:.875em}
+span.footnote a,span.footnoteref a{text-decoration:none}
+span.footnote a:active,span.footnoteref a:active{text-decoration:underline}
+#footnotes{padding-top:.75em;padding-bottom:.75em;margin-bottom:.625em}
+#footnotes hr{width:20%;min-width:6.25em;margin:-.25em 0 .75em 0;border-width:1px 0 0 0}
+#footnotes .footnote{padding:0 .375em;line-height:1.3;font-size:.875em;margin-left:1.2em;text-indent:-1.2em;margin-bottom:.2em}
+#footnotes .footnote a:first-of-type{font-weight:bold;text-decoration:none}
+#footnotes .footnote:last-of-type{margin-bottom:0}
+#content #footnotes{margin-top:-.625em;margin-bottom:0;padding:.75em 0}
+.gist .file-data>table{border:0;background:#fff;width:100%;margin-bottom:0}
+.gist .file-data>table td.line-data{width:99%}
+div.unbreakable{page-break-inside:avoid}
+.big{font-size:larger}
+.small{font-size:smaller}
+.underline{text-decoration:underline}
+.overline{text-decoration:overline}
+.line-through{text-decoration:line-through}
+.aqua{color:#00bfbf}
+.aqua-background{background-color:#00fafa}
+.black{color:#000}
+.black-background{background-color:#000}
+.blue{color:#0000bf}
+.blue-background{background-color:#0000fa}
+.fuchsia{color:#bf00bf}
+.fuchsia-background{background-color:#fa00fa}
+.gray{color:#606060}
+.gray-background{background-color:#7d7d7d}
+.green{color:#006000}
+.green-background{background-color:#007d00}
+.lime{color:#00bf00}
+.lime-background{background-color:#00fa00}
+.maroon{color:#600000}
+.maroon-background{background-color:#7d0000}
+.navy{color:#000060}
+.navy-background{background-color:#00007d}
+.olive{color:#606000}
+.olive-background{background-color:#7d7d00}
+.purple{color:#600060}
+.purple-background{background-color:#7d007d}
+.red{color:#bf0000}
+.red-background{background-color:#fa0000}
+.silver{color:#909090}
+.silver-background{background-color:#bcbcbc}
+.teal{color:#006060}
+.teal-background{background-color:#007d7d}
+.white{color:#bfbfbf}
+.white-background{background-color:#fafafa}
+.yellow{color:#bfbf00}
+.yellow-background{background-color:#fafa00}
+span.icon>.fa{cursor:default}
+.admonitionblock td.icon [class^="fa icon-"]{font-size:2.5em;text-shadow:1px 1px 2px rgba(0,0,0,.5);cursor:default}
+.admonitionblock td.icon .icon-note:before{content:"\f05a";color:#19407c}
+.admonitionblock td.icon .icon-tip:before{content:"\f0eb";text-shadow:1px 1px 2px rgba(155,155,0,.8);color:#111}
+.admonitionblock td.icon .icon-warning:before{content:"\f071";color:#bf6900}
+.admonitionblock td.icon .icon-caution:before{content:"\f06d";color:#bf3400}
+.admonitionblock td.icon .icon-important:before{content:"\f06a";color:#bf0000}
+.conum[data-value]{display:inline-block;color:#fff!important;background-color:rgba(0,0,0,.8);-webkit-border-radius:100px;border-radius:100px;text-align:center;font-size:.75em;width:1.67em;height:1.67em;line-height:1.67em;font-family:"Open Sans","DejaVu Sans",sans-serif;font-style:normal;font-weight:bold}
+.conum[data-value] *{color:#fff!important}
+.conum[data-value]+b{display:none}
+.conum[data-value]:after{content:attr(data-value)}
+pre .conum[data-value]{position:relative;top:-.125em}
+b.conum *{color:inherit!important}
+.conum:not([data-value]):empty{display:none}
+h1,h2{letter-spacing:-.01em}
+dt,th.tableblock,td.content{text-rendering:optimizeLegibility}
+p,td.content{letter-spacing:-.01em}
+p strong,td.content strong{letter-spacing:-.005em}
+p,blockquote,dt,td.content{font-size:1.0625rem}
+p{margin-bottom:1.25rem}
+.sidebarblock p,.sidebarblock dt,.sidebarblock td.content,p.tableblock{font-size:1em}
+.exampleblock>.content{background-color:#fffef7;border-color:#e0e0dc;-webkit-box-shadow:0 1px 4px #e0e0dc;box-shadow:0 1px 4px #e0e0dc}
+.print-only{display:none!important}
+@media print{@page{margin:1.25cm .75cm}
+*{-webkit-box-shadow:none!important;box-shadow:none!important;text-shadow:none!important}
+a{color:inherit!important;text-decoration:underline!important}
+a.bare,a[href^="#"],a[href^="mailto:"]{text-decoration:none!important}
+a[href^="http:"]:not(.bare):after,a[href^="https:"]:not(.bare):after{content:"(" attr(href) ")";display:inline-block;font-size:.875em;padding-left:.25em}
+abbr[title]:after{content:" (" attr(title) ")"}
+pre,blockquote,tr,img{page-break-inside:avoid}
+thead{display:table-header-group}
+img{max-width:100%!important}
+p,blockquote,dt,td.content{font-size:1em;orphans:3;widows:3}
+h2,h3,#toctitle,.sidebarblock>.content>.title{page-break-after:avoid}
+#toc,.sidebarblock,.exampleblock>.content{background:none!important}
+#toc{border-bottom:1px solid #ddddd8!important;padding-bottom:0!important}
+.sect1{padding-bottom:0!important}
+.sect1+.sect1{border:0!important}
+#header>h1:first-child{margin-top:1.25rem}
+body.book #header{text-align:center}
+body.book #header>h1:first-child{border:0!important;margin:2.5em 0 1em 0}
+body.book #header .details{border:0!important;display:block;padding:0!important}
+body.book #header .details span:first-child{margin-left:0!important}
+body.book #header .details br{display:block}
+body.book #header .details br+span:before{content:none!important}
+body.book #toc{border:0!important;text-align:left!important;padding:0!important;margin:0!important}
+body.book #toc,body.book #preamble,body.book h1.sect0,body.book .sect1>h2{page-break-before:always}
+.listingblock code[data-lang]:before{display:block}
+#footer{background:none!important;padding:0 .9375em}
+#footer-text{color:rgba(0,0,0,.6)!important;font-size:.9em}
+.hide-on-print{display:none!important}
+.print-only{display:block!important}
+.hide-for-print{display:none!important}
+.show-for-print{display:inherit!important}}
+</style>
+<style>
+.listingblock .pygments .hll { background-color: #ffffcc }
+.listingblock .pygments { background: #f8f8f8; }
+.listingblock .pygments .tok-c { color: #408080; font-style: italic } /* Comment */
+.listingblock .pygments .tok-err { border: 1px solid #FF0000 } /* Error */
+.listingblock .pygments .tok-k { color: #008000; font-weight: bold } /* Keyword */
+.listingblock .pygments .tok-o { color: #666666 } /* Operator */
+.listingblock .pygments .tok-cm { color: #408080; font-style: italic } /* Comment.Multiline */
+.listingblock .pygments .tok-cp { color: #BC7A00 } /* Comment.Preproc */
+.listingblock .pygments .tok-c1 { color: #408080; font-style: italic } /* Comment.Single */
+.listingblock .pygments .tok-cs { color: #408080; font-style: italic } /* Comment.Special */
+.listingblock .pygments .tok-gd { color: #A00000 } /* Generic.Deleted */
+.listingblock .pygments .tok-ge { font-style: italic } /* Generic.Emph */
+.listingblock .pygments .tok-gr { color: #FF0000 } /* Generic.Error */
+.listingblock .pygments .tok-gh { color: #000080; font-weight: bold } /* Generic.Heading */
+.listingblock .pygments .tok-gi { color: #00A000 } /* Generic.Inserted */
+.listingblock .pygments .tok-go { color: #888888 } /* Generic.Output */
+.listingblock .pygments .tok-gp { color: #000080; font-weight: bold } /* Generic.Prompt */
+.listingblock .pygments .tok-gs { font-weight: bold } /* Generic.Strong */
+.listingblock .pygments .tok-gu { color: #800080; font-weight: bold } /* Generic.Subheading */
+.listingblock .pygments .tok-gt { color: #0044DD } /* Generic.Traceback */
+.listingblock .pygments .tok-kc { color: #008000; font-weight: bold } /* Keyword.Constant */
+.listingblock .pygments .tok-kd { color: #008000; font-weight: bold } /* Keyword.Declaration */
+.listingblock .pygments .tok-kn { color: #008000; font-weight: bold } /* Keyword.Namespace */
+.listingblock .pygments .tok-kp { color: #008000 } /* Keyword.Pseudo */
+.listingblock .pygments .tok-kr { color: #008000; font-weight: bold } /* Keyword.Reserved */
+.listingblock .pygments .tok-kt { color: #B00040 } /* Keyword.Type */
+.listingblock .pygments .tok-m { color: #666666 } /* Literal.Number */
+.listingblock .pygments .tok-s { color: #BA2121 } /* Literal.String */
+.listingblock .pygments .tok-na { color: #7D9029 } /* Name.Attribute */
+.listingblock .pygments .tok-nb { color: #008000 } /* Name.Builtin */
+.listingblock .pygments .tok-nc { color: #0000FF; font-weight: bold } /* Name.Class */
+.listingblock .pygments .tok-no { color: #880000 } /* Name.Constant */
+.listingblock .pygments .tok-nd { color: #AA22FF } /* Name.Decorator */
+.listingblock .pygments .tok-ni { color: #999999; font-weight: bold } /* Name.Entity */
+.listingblock .pygments .tok-ne { color: #D2413A; font-weight: bold } /* Name.Exception */
+.listingblock .pygments .tok-nf { color: #0000FF } /* Name.Function */
+.listingblock .pygments .tok-nl { color: #A0A000 } /* Name.Label */
+.listingblock .pygments .tok-nn { color: #0000FF; font-weight: bold } /* Name.Namespace */
+.listingblock .pygments .tok-nt { color: #008000; font-weight: bold } /* Name.Tag */
+.listingblock .pygments .tok-nv { color: #19177C } /* Name.Variable */
+.listingblock .pygments .tok-ow { color: #AA22FF; font-weight: bold } /* Operator.Word */
+.listingblock .pygments .tok-w { color: #bbbbbb } /* Text.Whitespace */
+.listingblock .pygments .tok-mb { color: #666666 } /* Literal.Number.Bin */
+.listingblock .pygments .tok-mf { color: #666666 } /* Literal.Number.Float */
+.listingblock .pygments .tok-mh { color: #666666 } /* Literal.Number.Hex */
+.listingblock .pygments .tok-mi { color: #666666 } /* Literal.Number.Integer */
+.listingblock .pygments .tok-mo { color: #666666 } /* Literal.Number.Oct */
+.listingblock .pygments .tok-sb { color: #BA2121 } /* Literal.String.Backtick */
+.listingblock .pygments .tok-sc { color: #BA2121 } /* Literal.String.Char */
+.listingblock .pygments .tok-sd { color: #BA2121; font-style: italic } /* Literal.String.Doc */
+.listingblock .pygments .tok-s2 { color: #BA2121 } /* Literal.String.Double */
+.listingblock .pygments .tok-se { color: #BB6622; font-weight: bold } /* Literal.String.Escape */
+.listingblock .pygments .tok-sh { color: #BA2121 } /* Literal.String.Heredoc */
+.listingblock .pygments .tok-si { color: #BB6688; font-weight: bold } /* Literal.String.Interpol */
+.listingblock .pygments .tok-sx { color: #008000 } /* Literal.String.Other */
+.listingblock .pygments .tok-sr { color: #BB6688 } /* Literal.String.Regex */
+.listingblock .pygments .tok-s1 { color: #BA2121 } /* Literal.String.Single */
+.listingblock .pygments .tok-ss { color: #19177C } /* Literal.String.Symbol */
+.listingblock .pygments .tok-bp { color: #008000 } /* Name.Builtin.Pseudo */
+.listingblock .pygments .tok-vc { color: #19177C } /* Name.Variable.Class */
+.listingblock .pygments .tok-vg { color: #19177C } /* Name.Variable.Global */
+.listingblock .pygments .tok-vi { color: #19177C } /* Name.Variable.Instance */
+.listingblock .pygments .tok-il { color: #666666 } /* Literal.Number.Integer.Long */
+</style>
+</head>
+<body class="article toc2 toc-right">
+<div id="header">
+<h1>pugixml 1.6 manual</h1>
+<div class="details">
+website 
+<a href="http://pugixml.org" class="bare">http://pugixml.org</a> 
+repository 
+<a href="http://github.com/zeux/pugixml" class="bare">http://github.com/zeux/pugixml</a> 
+</div>
+<div id="toc" class="toc2">
+<div id="toctitle">Table of Contents</div>
+<ul class="sectlevel1">
+<li><a href="#overview">1. Overview</a>
+<ul class="sectlevel2">
+<li><a href="#overview.introduction">1.1. Introduction</a></li>
+<li><a href="#overview.feedback">1.2. Feedback</a></li>
+<li><a href="#overview.thanks">1.3. Acknowledgments</a></li>
+<li><a href="#overview.license">1.4. License</a></li>
+</ul>
+</li>
+<li><a href="#install">2. Installation</a>
+<ul class="sectlevel2">
+<li><a href="#install.getting">2.1. Getting pugixml</a></li>
+<li><a href="#install.building">2.2. Building pugixml</a></li>
+<li><a href="#install.portability">2.3. Portability</a></li>
+</ul>
+</li>
+<li><a href="#dom">3. Document object model</a>
+<ul class="sectlevel2">
+<li><a href="#dom.tree">3.1. Tree structure</a></li>
+<li><a href="#dom.cpp">3.2. C&#43;&#43; interface</a></li>
+<li><a href="#dom.unicode">3.3. Unicode interface</a></li>
+<li><a href="#dom.thread">3.4. Thread-safety guarantees</a></li>
+<li><a href="#dom.exception">3.5. Exception guarantees</a></li>
+<li><a href="#dom.memory">3.6. Memory management</a></li>
+</ul>
+</li>
+<li><a href="#loading">4. Loading document</a>
+<ul class="sectlevel2">
+<li><a href="#loading.file">4.1. Loading document from file</a></li>
+<li><a href="#loading.memory">4.2. Loading document from memory</a></li>
+<li><a href="#loading.stream">4.3. Loading document from C&#43;&#43; IOstreams</a></li>
+<li><a href="#loading.errors">4.4. Handling parsing errors</a></li>
+<li><a href="#loading.options">4.5. Parsing options</a></li>
+<li><a href="#loading.encoding">4.6. Encodings</a></li>
+<li><a href="#loading.w3c">4.7. Conformance to W3C specification</a></li>
+</ul>
+</li>
+<li><a href="#access">5. Accessing document data</a>
+<ul class="sectlevel2">
+<li><a href="#access.basic">5.1. Basic traversal functions</a></li>
+<li><a href="#access.nodedata">5.2. Getting node data</a></li>
+<li><a href="#access.attrdata">5.3. Getting attribute data</a></li>
+<li><a href="#access.contents">5.4. Contents-based traversal functions</a></li>
+<li><a href="#access.rangefor">5.5. Range-based for-loop support</a></li>
+<li><a href="#access.iterators">5.6. Traversing node/attribute lists via iterators</a></li>
+<li><a href="#access.walker">5.7. Recursive traversal with xml_tree_walker</a></li>
+<li><a href="#access.predicate">5.8. Searching for nodes/attributes with predicates</a></li>
+<li><a href="#access.text">5.9. Working with text contents</a></li>
+<li><a href="#access.misc">5.10. Miscellaneous functions</a></li>
+</ul>
+</li>
+<li><a href="#modify">6. Modifying document data</a>
+<ul class="sectlevel2">
+<li><a href="#modify.nodedata">6.1. Setting node data</a></li>
+<li><a href="#modify.attrdata">6.2. Setting attribute data</a></li>
+<li><a href="#modify.add">6.3. Adding nodes/attributes</a></li>
+<li><a href="#modify.remove">6.4. Removing nodes/attributes</a></li>
+<li><a href="#modify.text">6.5. Working with text contents</a></li>
+<li><a href="#modify.clone">6.6. Cloning nodes/attributes</a></li>
+<li><a href="#modify.move">6.7. Moving nodes</a></li>
+<li><a href="#modify.fragments">6.8. Assembling document from fragments</a></li>
+</ul>
+</li>
+<li><a href="#saving">7. Saving document</a>
+<ul class="sectlevel2">
+<li><a href="#saving.file">7.1. Saving document to a file</a></li>
+<li><a href="#saving.stream">7.2. Saving document to C&#43;&#43; IOstreams</a></li>
+<li><a href="#saving.writer">7.3. Saving document via writer interface</a></li>
+<li><a href="#saving.subtree">7.4. Saving a single subtree</a></li>
+<li><a href="#saving.options">7.5. Output options</a></li>
+<li><a href="#saving.encoding">7.6. Encodings</a></li>
+<li><a href="#saving.declaration">7.7. Customizing document declaration</a></li>
+</ul>
+</li>
+<li><a href="#xpath">8. XPath</a>
+<ul class="sectlevel2">
+<li><a href="#xpath.types">8.1. XPath types</a></li>
+<li><a href="#xpath.select">8.2. Selecting nodes via XPath expression</a></li>
+<li><a href="#xpath.query">8.3. Using query objects</a></li>
+<li><a href="#xpath.variables">8.4. Using variables</a></li>
+<li><a href="#xpath.errors">8.5. Error handling</a></li>
+<li><a href="#xpath.w3c">8.6. Conformance to W3C specification</a></li>
+</ul>
+</li>
+<li><a href="#changes">9. Changelog</a>
+<ul class="sectlevel2">
+<li><a href="#v1.6">v1.6 10.04.2015</a></li>
+<li><a href="#v1.5">v1.5 27.11.2014</a></li>
+<li><a href="#v1.4">v1.4 27.02.2014</a></li>
+<li><a href="#v1.2">v1.2 1.05.2012</a></li>
+<li><a href="#v1.0">v1.0 1.11.2010</a></li>
+<li><a href="#v0.9">v0.9 1.07.2010</a></li>
+<li><a href="#v0.5">v0.5 8.11.2009</a></li>
+<li><a href="#v0.42">v0.42 17.09.2009</a></li>
+<li><a href="#v0.41">v0.41 8.02.2009</a></li>
+<li><a href="#v0.4">v0.4 18.01.2009</a></li>
+<li><a href="#v0.34">v0.34 31.10.2007</a></li>
+<li><a href="#v0.3">v0.3 21.02.2007</a></li>
+<li><a href="#v0.2">v0.2 6.11.2006</a></li>
+<li><a href="#v0.1">v0.1 15.07.2006</a></li>
+</ul>
+</li>
+<li><a href="#apiref">10. API Reference</a>
+<ul class="sectlevel2">
+<li><a href="#apiref.macros">10.1. Macros</a></li>
+<li><a href="#apiref.types">10.2. Types</a></li>
+<li><a href="#apiref.enums">10.3. Enumerations</a></li>
+<li><a href="#apiref.constants">10.4. Constants</a></li>
+<li><a href="#apiref.classes">10.5. Classes</a></li>
+<li><a href="#apiref.functions">10.6. Functions</a></li>
+</ul>
+</li>
+</ul>
+</div>
+</div>
+<div id="content">
+<div class="sect1">
+<h2 id="overview"><a class="anchor" href="#overview"></a>1. Overview</h2>
+<div class="sectionbody">
+<div class="sect2">
+<h3 id="overview.introduction"><a class="anchor" href="#overview.introduction"></a>1.1. Introduction</h3>
+<div class="paragraph">
+<a href="http://pugixml.org/">pugixml</a> is a light-weight C&#43;&#43; XML processing library. It consists of a DOM-like interface with rich traversal/modification capabilities, an extremely fast XML parser which constructs the DOM tree from an XML file/buffer, and an <a href="#xpath">XPath 1.0 implementation</a> for complex data-driven tree queries. Full Unicode support is also available, with <a href="#dom.unicode">two Unicode interface variants</a> and conversions between different Unicode encodings (which happen automatically during parsing/saving). The library is <a href="#install.portability">extremely portable</a> and easy to integrate and use. pugixml is developed and maintained since 2006 and has many users. All code is distributed under the <a href="#overview.license">MIT license</a>, making it completely free to use in both open-source and proprietary applications.
+</div>
+<div class="paragraph">
+pugixml enables very fast, convenient and memory-efficient XML document processing. However, since pugixml has a DOM parser, it can&#8217;t process XML documents that do not fit in memory; also the parser is a non-validating one, so if you need DTD or XML Schema validation, the library is not for you.
+</div>
+<div class="paragraph">
+This is the complete manual for pugixml, which describes all features of the library in detail. If you want to start writing code as quickly as possible, you are advised to <a href="quickstart.html">read the quick start guide first</a>.
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+No documentation is perfect; neither is this one. If you find errors or omissions, please don’t hesitate to <a href="https://github.com/zeux/pugixml/issues/new">submit an issue or open a pull request</a> with a fix.
+</td>
+</tr>
+</table>
+</div>
+</div>
+<div class="sect2">
+<h3 id="overview.feedback"><a class="anchor" href="#overview.feedback"></a>1.2. Feedback</h3>
+<div class="paragraph">
+If you believe you&#8217;ve found a bug in pugixml (bugs include compilation problems (errors/warnings), crashes, performance degradation and incorrect behavior), please file an issue via <a href="https://github.com/zeux/pugixml/issues/new">issue submission form</a>. Be sure to include the relevant information so that the bug can be reproduced: the version of pugixml, compiler version and target architecture, the code that uses pugixml and exhibits the bug, etc.
+</div>
+<div class="paragraph">
+Feature requests can be reported the same way as bugs, so if you&#8217;re missing some functionality in pugixml or if the API is rough in some places and you can suggest an improvement, <a href="https://github.com/zeux/pugixml/issues/new">file an issue</a>. However please note that there are many factors when considering API changes (compatibility with previous versions, API redundancy, etc.), so generally features that can be implemented via a small function without pugixml modification are not accepted. However, all rules have exceptions.
+</div>
+<div class="paragraph">
+If you have a contribution to pugixml, such as build script for some build system/IDE, or a well-designed set of helper functions, or a binding to some language other than C&#43;&#43;, please <a href="https://github.com/zeux/pugixml/issues/new">file an issue or open a pull request</a>. Your contribution has to be distributed under the terms of a license that&#8217;s compatible with pugixml license; i.e. GPL/LGPL licensed code is not accepted.
+</div>
+<div class="paragraph">
+If filing an issue is not possible due to privacy or other concerns, you can contact pugixml author by e-mail directly: <a href="mailto:arseny.kapoulkine@gmail.com">arseny.kapoulkine@gmail.com</a>.
+</div>
+</div>
+<div class="sect2">
+<h3 id="overview.thanks"><a class="anchor" href="#overview.thanks"></a>1.3. Acknowledgments</h3>
+<div class="paragraph">
+pugixml could not be developed without the help from many people; some of them are listed in this section. If you&#8217;ve played a part in pugixml development and you can not find yourself on this list, I&#8217;m truly sorry; please <a href="#email">send me an e-mail</a> so I can fix this.
+</div>
+<div class="paragraph">
+Thanks to Kristen Wegner for pugxml parser, which was used as a basis for pugixml.
+</div>
+<div class="paragraph">
+Thanks to Neville Franks for contributions to pugxml parser.
+</div>
+<div class="paragraph">
+Thanks to Artyom Palvelev for suggesting a lazy gap contraction approach.
+</div>
+<div class="paragraph">
+Thanks to Vyacheslav Egorov for documentation proofreading.
+</div>
+</div>
+<div class="sect2">
+<h3 id="overview.license"><a class="anchor" href="#overview.license"></a>1.4. License</h3>
+<div class="paragraph">
+The pugixml library is distributed under the MIT license:
+</div>
+<div class="literalblock">
+<div class="content">
+<pre>Copyright (c) 2006-2015 Arseny Kapoulkine
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.</pre>
+</div>
+</div>
+<div class="paragraph">
+This means that you can freely use pugixml in your applications, both open-source and proprietary. If you use pugixml in a product, it is sufficient to add an acknowledgment like this to the product distribution:
+</div>
+<div class="literalblock">
+<div class="content">
+<pre>This software is based on pugixml library (http://pugixml.org).
+pugixml is Copyright (C) 2006-2015 Arseny Kapoulkine.</pre>
+</div>
+</div>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="install"><a class="anchor" href="#install"></a>2. Installation</h2>
+<div class="sectionbody">
+<div class="sect2">
+<h3 id="install.getting"><a class="anchor" href="#install.getting"></a>2.1. Getting pugixml</h3>
+<div class="paragraph">
+pugixml is distributed in source form. You can either download a source distribution or clone the Git repository.
+</div>
+<div class="sect3">
+<h4 id="install.getting.source"><a class="anchor" href="#install.getting.source"></a>2.1.1. Source distributions</h4>
+<div class="paragraph">
+You can download the latest source distribution as an archive:
+</div>
+<div class="paragraph">
+<a href="https://github.com/zeux/pugixml/releases/download/v1.6/pugixml-1.6.zip">pugixml-1.6.zip</a> (Windows line endings)
+/
+<a href="https://github.com/zeux/pugixml/releases/download/v1.6/pugixml-1.6.tar.gz">pugixml-1.6.tar.gz</a> (Unix line endings)
+</div>
+<div class="paragraph">
+The distribution contains library source, documentation (the manual you&#8217;re reading now and the quick start guide) and some code examples. After downloading the distribution, install pugixml by extracting all files from the compressed archive.
+</div>
+<div class="paragraph">
+If you need an older version, you can download it from the <a href="https://github.com/zeux/pugixml/releases">version archive</a>.
+</div>
+</div>
+<div class="sect3">
+<h4 id="install.getting.git"><a class="anchor" href="#install.getting.git"></a>2.1.2. Git repository</h4>
+<div class="paragraph">
+The Git repository is located at <a href="https://github.com/zeux/pugixml/" class="bare">https://github.com/zeux/pugixml/</a>. There is a Git tag "v{version}" for each version; also there is the "latest" tag, which always points to the latest stable release.
+</div>
+<div class="paragraph">
+For example, to checkout the current version, you can use this command:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="bash">git clone https://github.com/zeux/pugixml
+cd pugixml
+git checkout v1.6</code></pre>
+</div>
+</div>
+<div class="paragraph">
+The repository contains library source, documentation, code examples and full unit test suite.
+</div>
+<div class="paragraph">
+Use <code>latest</code> tag if you want to automatically get new versions. Use other tags if you want to switch to new versions only explicitly. Also please note that the master branch contains the work-in-progress version of the code; while this means that you can get new features and bug fixes from master without waiting for a new release, this also means that occasionally the code can be broken in some configurations.
+</div>
+</div>
+<div class="sect3">
+<h4 id="install.getting.subversion"><a class="anchor" href="#install.getting.subversion"></a>2.1.3. Subversion repository</h4>
+<div class="paragraph">
+You can access the Git repository via Subversion using <a href="https://github.com/zeux/pugixml" class="bare">https://github.com/zeux/pugixml</a> URL. For example, to checkout the current version, you can use this command:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="bash">svn checkout https://github.com/zeux/pugixml/tags/v1.6 pugixml</code></pre>
+</div>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="install.building"><a class="anchor" href="#install.building"></a>2.2. Building pugixml</h3>
+<div class="paragraph">
+pugixml is distributed in source form without any pre-built binaries; you have to build them yourself.
+</div>
+<div class="paragraph">
+The complete pugixml source consists of three files - one source file, <code>pugixml.cpp</code>, and two header files, <code>pugixml.hpp</code> and <code>pugiconfig.hpp</code>. <code>pugixml.hpp</code> is the primary header which you need to include in order to use pugixml classes/functions; <code>pugiconfig.hpp</code> is a supplementary configuration file (see <a href="#install.building.config">Additional configuration options</a>). The rest of this guide assumes that <code>pugixml.hpp</code> is either in the current directory or in one of include directories of your projects, so that <code>#include "pugixml.hpp"</code> can find the header; however you can also use relative path (i.e. <code>#include "../libs/pugixml/src/pugixml.hpp"</code>) or include directory-relative path (i.e. <code>#include &lt;xml/thirdparty/pugixml/src/pugixml.hpp&gt;</code>).
+</div>
+<div class="sect3">
+<h4 id="install.building.embed"><a class="anchor" href="#install.building.embed"></a>2.2.1. Building pugixml as a part of another static library/executable</h4>
+<div class="paragraph">
+The easiest way to build pugixml is to compile the source file, <code>pugixml.cpp</code>, along with the existing library/executable. This process depends on the method of building your application; for example, if you&#8217;re using Microsoft Visual Studio [<a id="_footnoteref_1" class="footnote" href="#_footnote_1" title="View footnote.">1</a>], Apple Xcode, Code::Blocks or any other IDE, just add <code>pugixml.cpp</code> to one of your projects.
+</div>
+<div class="paragraph">
+If you&#8217;re using Microsoft Visual Studio and the project has precompiled headers turned on, you&#8217;ll see the following error messages:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre>pugixml.cpp(3477) : fatal error C1010: unexpected end of file while looking for precompiled header. Did you forget to add '#include "stdafx.h"' to your source?</pre>
+</div>
+</div>
+<div class="paragraph">
+The correct way to resolve this is to disable precompiled headers for <code>pugixml.cpp</code>; you have to set "Create/Use Precompiled Header" option (Properties dialog &#8594; C/C&#43;&#43; &#8594; Precompiled Headers &#8594; Create/Use Precompiled Header) to "Not Using Precompiled Headers". You&#8217;ll have to do it for all project configurations/platforms (you can select Configuration "All Configurations" and Platform "All Platforms" before editing the option):
+</div>
+<table class="tableblock frame-none grid-all spread">
+<colgroup>
+<col style="width: 25%;">
+<col style="width: 25%;">
+<col style="width: 25%;">
+<col style="width: 25%;">
+</colgroup>
+<tbody>
+<tr>
+<td class="tableblock halign-left valign-top"><div><div class="imageblock">
+<div class="content">
+<a class="image" href="images/vs2005_pch1.png"><img src="images/vs2005_pch1.png" alt="vs2005 pch1"></a>
+</div>
+</div></div></td>
+<td class="tableblock halign-left valign-top"><div><div class="imageblock">
+<div class="content">
+<a class="image" href="images/vs2005_pch2.png"><img src="images/vs2005_pch2.png" alt="vs2005 pch2"></a>
+</div>
+</div></div></td>
+<td class="tableblock halign-left valign-top"><div><div class="imageblock">
+<div class="content">
+<a class="image" href="images/vs2005_pch3.png"><img src="images/vs2005_pch3.png" alt="vs2005 pch3"></a>
+</div>
+</div></div></td>
+<td class="tableblock halign-left valign-top"><div><div class="imageblock">
+<div class="content">
+<a class="image" href="images/vs2005_pch4.png"><img src="images/vs2005_pch4.png" alt="vs2005 pch4"></a>
+</div>
+</div></div></td>
+</tr>
+</tbody>
+</table>
+</div>
+<div class="sect3">
+<h4 id="install.building.static"><a class="anchor" href="#install.building.static"></a>2.2.2. Building pugixml as a standalone static library</h4>
+<div class="paragraph">
+It&#8217;s possible to compile pugixml as a standalone static library. This process depends on the method of building your application; pugixml distribution comes with project files for several popular IDEs/build systems. There are project files for Apple XCode, Code::Blocks, Codelite, Microsoft Visual Studio 2005, 2008, 2010+, and configuration scripts for CMake and premake4. You&#8217;re welcome to submit project files/build scripts for other software; see <a href="#overview.feedback">Feedback</a>.
+</div>
+<div class="paragraph">
+There are two projects for each version of Microsoft Visual Studio: one for dynamically linked CRT, which has a name like <code>pugixml_vs2008.vcproj</code>, and another one for statically linked CRT, which has a name like <code>pugixml_vs2008_static.vcproj</code>. You should select the version that matches the CRT used in your application; the default option for new projects created by Microsoft Visual Studio is dynamically linked CRT, so unless you changed the defaults, you should use the version with dynamic CRT (i.e. <code>pugixml_vs2008.vcproj</code> for Microsoft Visual Studio 2008).
+</div>
+<div class="paragraph">
+In addition to adding pugixml project to your workspace, you&#8217;ll have to make sure that your application links with pugixml library. If you&#8217;re using Microsoft Visual Studio 2005/2008, you can add a dependency from your application project to pugixml one. If you&#8217;re using Microsoft Visual Studio 2010+, you&#8217;ll have to add a reference to your application project instead. For other IDEs/systems, consult the relevant documentation.
+</div>
+<table class="tableblock frame-none grid-all spread">
+<colgroup>
+<col style="width: 25%;">
+<col style="width: 25%;">
+<col style="width: 25%;">
+<col style="width: 25%;">
+</colgroup>
+<thead>
+<tr>
+<th class="tableblock halign-left valign-top" colspan="2">Microsoft Visual Studio 2005/2008</th>
+<th class="tableblock halign-left valign-top" colspan="2">Microsoft Visual Studio 2010+</th>
+</tr>
+</thead>
+<tbody>
+<tr>
+<td class="tableblock halign-left valign-top"><div><div class="imageblock">
+<div class="content">
+<a class="image" href="images/vs2005_link1.png"><img src="images/vs2005_link1.png" alt="vs2005 link1"></a>
+</div>
+</div></div></td>
+<td class="tableblock halign-left valign-top"><div><div class="imageblock">
+<div class="content">
+<a class="image" href="images/vs2005_link2.png"><img src="images/vs2005_link2.png" alt="vs2005 link2"></a>
+</div>
+</div></div></td>
+<td class="tableblock halign-left valign-top"><div><div class="imageblock">
+<div class="content">
+<a class="image" href="images/vs2010_link1.png"><img src="images/vs2010_link1.png" alt="vs2010 link1"></a>
+</div>
+</div></div></td>
+<td class="tableblock halign-left valign-top"><div><div class="imageblock">
+<div class="content">
+<a class="image" href="images/vs2010_link2.png"><img src="images/vs2010_link2.png" alt="vs2010 link2"></a>
+</div>
+</div></div></td>
+</tr>
+</tbody>
+</table>
+</div>
+<div class="sect3">
+<h4 id="install.building.shared"><a class="anchor" href="#install.building.shared"></a>2.2.3. Building pugixml as a standalone shared library</h4>
+<div class="paragraph">
+It&#8217;s possible to compile pugixml as a standalone shared library. The process is usually similar to the static library approach; however, no preconfigured projects/scripts are included into pugixml distribution, so you&#8217;ll have to do it yourself. Generally, if you&#8217;re using GCC-based toolchain, the process does not differ from building any other library as DLL (adding -shared to compilation flags should suffice); if you&#8217;re using MSVC-based toolchain, you&#8217;ll have to explicitly mark exported symbols with a declspec attribute. You can do it by defining <a href="#PUGIXML_API">PUGIXML_API</a> macro, i.e. via <code>pugiconfig.hpp</code>:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">#ifdef _DLL
+ #define PUGIXML_API __declspec(dllexport)
+#else
+ #define PUGIXML_API __declspec(dllimport)
+#endif</code></pre>
+</div>
+</div>
+<div class="admonitionblock caution">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Caution</div>
+</td>
+<td class="content">
+If you&#8217;re using STL-related functions, you should use the shared runtime library to ensure that a single heap is used for STL allocations in your application and in pugixml; in MSVC, this means selecting the 'Multithreaded DLL' or 'Multithreaded Debug DLL' to 'Runtime library' property (<code>/MD</code> or <code>/MDd</code> linker switch). You should also make sure that your runtime library choice is consistent between different projects.
+</td>
+</tr>
+</table>
+</div>
+</div>
+<div class="sect3">
+<h4 id="install.building.header"><a class="anchor" href="#install.building.header"></a>2.2.4. Using pugixml in header-only mode</h4>
+<div id="PUGIXML_HEADER_ONLY" class="paragraph">
+It&#8217;s possible to use pugixml in header-only mode. This means that all source code for pugixml will be included in every translation unit that includes <code>pugixml.hpp</code>. This is how most of Boost and STL libraries work.
+</div>
+<div class="paragraph">
+Note that there are advantages and drawbacks of this approach. Header mode may improve tree traversal/modification performance (because many simple functions will be inlined), if your compiler toolchain does not support link-time optimization, or if you have it turned off (with link-time optimization the performance should be similar to non-header mode). However, since compiler now has to compile pugixml source once for each translation unit that includes it, compilation times may increase noticeably. If you want to use pugixml in header mode but do not need XPath support, you can consider disabling it by using <a href="#PUGIXML_NO_XPATH">PUGIXML_NO_XPATH</a> define to improve compilation time.
+</div>
+<div class="paragraph">
+To enable header-only mode, you have to define <code>PUGIXML_HEADER_ONLY</code>. You can either do it in <code>pugiconfig.hpp</code>, or provide them via compiler command-line.
+</div>
+<div class="paragraph">
+Note that it is safe to compile <code>pugixml.cpp</code> if <code>PUGIXML_HEADER_ONLY</code> is defined - so if you want to i.e. use header-only mode only in Release configuration, you
+can include pugixml.cpp in your project (see <a href="#install.building.embed">Building pugixml as a part of another static library/executable</a>), and conditionally enable header-only mode in <code>pugiconfig.hpp</code> like this:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">#ifndef _DEBUG
+ #define PUGIXML_HEADER_ONLY
+#endif</code></pre>
+</div>
+</div>
+</div>
+<div class="sect3">
+<h4 id="install.building.config"><a class="anchor" href="#install.building.config"></a>2.2.5. Additional configuration options</h4>
+<div class="paragraph">
+pugixml uses several defines to control the compilation process. There are two ways to define them: either put the needed definitions to <code>pugiconfig.hpp</code> (it has some examples that are commented out) or provide them via compiler command-line. Consistency is important: the definitions should match in all source files that include <code>pugixml.hpp</code> (including pugixml sources) throughout the application. Adding defines to <code>pugiconfig.hpp</code> lets you guarantee this, unless your macro definition is wrapped in preprocessor <code>#if</code>/<code>#ifdef</code> directive and this directive is not consistent. <code>pugiconfig.hpp</code> will never contain anything but comments, which means that when upgrading to a new version, you can safely leave your modified version intact.
+</div>
+<div class="paragraph">
+<a id="PUGIXML_WCHAR_MODE"></a><code>PUGIXML_WCHAR_MODE</code> define toggles between UTF-8 style interface (the in-memory text encoding is assumed to be UTF-8, most functions use <code>char</code> as character type) and UTF-16/32 style interface (the in-memory text encoding is assumed to be UTF-16/32, depending on <code>wchar_t</code> size, most functions use <code>wchar_t</code> as character type). See <a href="#dom.unicode">Unicode interface</a> for more details.
+</div>
+<div class="paragraph">
+<a id="PUGIXML_NO_XPATH"></a><code>PUGIXML_NO_XPATH</code> define disables XPath. Both XPath interfaces and XPath implementation are excluded from compilation. This option is provided in case you do not need XPath functionality and need to save code space.
+</div>
+<div class="paragraph">
+<a id="PUGIXML_NO_STL"></a><code>PUGIXML_NO_STL</code> define disables use of STL in pugixml. The functions that operate on STL types are no longer present (i.e. load/save via iostream) if this macro is defined. This option is provided in case your target platform does not have a standard-compliant STL implementation.
+</div>
+<div class="paragraph">
+<a id="PUGIXML_NO_EXCEPTIONS"></a><code>PUGIXML_NO_EXCEPTIONS</code> define disables use of exceptions in pugixml. This option is provided in case your target platform does not have exception handling capabilities.
+</div>
+<div class="paragraph">
+<a id="PUGIXML_API"></a><code>PUGIXML_API</code>, <a id="PUGIXML_CLASS"></a><code>PUGIXML_CLASS</code> and <a id="PUGIXML_FUNCTION"></a><code>PUGIXML_FUNCTION</code> defines let you specify custom attributes (i.e. declspec or calling conventions) for pugixml classes and non-member functions. In absence of <code>PUGIXML_CLASS</code> or <code>PUGIXML_FUNCTION</code> definitions, <code>PUGIXML_API</code> definition is used instead. For example, to specify fixed calling convention, you can define <code>PUGIXML_FUNCTION</code> to i.e. <code>__fastcall</code>. Another example is DLL import/export attributes in MSVC (see <a href="#install.building.shared">Building pugixml as a standalone shared library</a>).
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+In that example <code>PUGIXML_API</code> is inconsistent between several source files; this is an exception to the consistency rule.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+<a id="PUGIXML_MEMORY_PAGE_SIZE"></a><code>PUGIXML_MEMORY_PAGE_SIZE</code>, <a id="PUGIXML_MEMORY_OUTPUT_STACK"></a><code>PUGIXML_MEMORY_OUTPUT_STACK</code> and <a id="PUGIXML_MEMORY_XPATH_PAGE_SIZE"></a><code>PUGIXML_MEMORY_XPATH_PAGE_SIZE</code> can be used to customize certain important sizes to optimize memory usage for the application-specific patterns. For details see <a href="#dom.memory.tuning">Memory consumption tuning</a>.
+</div>
+<div class="paragraph">
+<a id="PUGIXML_HAS_LONG_LONG"></a><code>PUGIXML_HAS_LONG_LONG</code> define enables support for <code>long long</code> type in pugixml. This define is automatically enabled if your platform is known to have <code>long long</code> support (i.e. has C&#43;&#43;11 support or uses a reasonably modern version of a known compiler); if pugixml does not recognize that your platform supports <code>long long</code> but in fact it does, you can enable the define manually.
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="install.portability"><a class="anchor" href="#install.portability"></a>2.3. Portability</h3>
+<div class="paragraph">
+pugixml is written in standard-compliant C&#43;&#43; with some compiler-specific workarounds where appropriate. pugixml is compatible with the C&#43;&#43;11 standard, but does not require C&#43;&#43;11 support. Each version is tested with a unit test suite (with code coverage about 99%) on the following platforms:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Microsoft Windows:
+<div class="ulist">
+<ul>
+<li>
+Borland C&#43;&#43; Compiler 5.82
+</li>
+<li>
+Digital Mars C&#43;&#43; Compiler 8.51
+</li>
+<li>
+Intel C&#43;&#43; Compiler 8.0, 9.0 x86/x64, 10.0 x86/x64, 11.0 x86/x64
+</li>
+<li>
+Metrowerks CodeWarrior 8.0
+</li>
+<li>
+Microsoft Visual C&#43;&#43; 6.0, 7.0 (2002), 7.1 (2003), 8.0 (2005) x86/x64, 9.0 (2008) x86/x64, 10.0 (2010) x86/x64, 11.0 (2011) x86/x64/ARM, 12.0 (2013) x86/x64/ARM and some CLR versions
+</li>
+<li>
+MinGW (GCC) 3.4, 4.4, 4.5, 4.6 x64
+</li>
+</ul>
+</div>
+</li>
+<li>
+Linux (GCC 4.4.3 x86/x64, GCC 4.8.1 x64, Clang 3.2 x64)
+</li>
+<li>
+FreeBSD (GCC 4.2.1 x86/x64)
+</li>
+<li>
+Apple MacOSX (GCC 4.0.1 x86/x64/PowerPC, Clang 3.5 x64)
+</li>
+<li>
+Sun Solaris (sunCC x86/x64)
+</li>
+<li>
+Microsoft Xbox 360
+</li>
+<li>
+Nintendo Wii (Metrowerks CodeWarrior 4.1)
+</li>
+<li>
+Sony Playstation Portable (GCC 3.4.2)
+</li>
+<li>
+Sony Playstation 3 (GCC 4.1.1, SNC 310.1)
+</li>
+<li>
+Various portable platforms (Android NDK, BlackBerry NDK, Samsung bada, Windows CE)
+</li>
+</ul>
+</div>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="dom"><a class="anchor" href="#dom"></a>3. Document object model</h2>
+<div class="sectionbody">
+<div class="paragraph">
+pugixml stores XML data in DOM-like way: the entire XML document (both document structure and element data) is stored in memory as a tree. The tree can be loaded from a character stream (file, string, C&#43;&#43; I/O stream), then traversed with the special API or XPath expressions. The whole tree is mutable: both node structure and node/attribute data can be changed at any time. Finally, the result of document transformations can be saved to a character stream (file, C&#43;&#43; I/O stream or custom transport).
+</div>
+<div class="sect2">
+<h3 id="dom.tree"><a class="anchor" href="#dom.tree"></a>3.1. Tree structure</h3>
+<div class="paragraph">
+The XML document is represented with a tree data structure. The root of the tree is the document itself, which corresponds to C&#43;&#43; type <a href="#xml_document">xml_document</a>. Document has one or more child nodes, which correspond to C&#43;&#43; type <a href="#xml_node">xml_node</a>. Nodes have different types; depending on a type, a node can have a collection of child nodes, a collection of attributes, which correspond to C&#43;&#43; type <a href="#xml_attribute">xml_attribute</a>, and some additional data (i.e. name).
+</div>
+<div id="xml_node_type" class="paragraph">
+The tree nodes can be of one of the following types (which together form the enumeration <code>xml_node_type</code>):
+</div>
+<div class="ulist">
+<ul>
+<li>
+Document node (<a id="node_document"></a><code>node_document</code>) - this is the root of the tree, which consists of several child nodes. This node corresponds to <a href="#xml_document">xml_document</a> class; note that <a href="#xml_document">xml_document</a> is a sub-class of <a href="#xml_node">xml_node</a>, so the entire node interface is also available. However, document node is special in several ways, which are covered below. There can be only one document node in the tree; document node does not have any XML representation.
+</li>
+<li>
+Element/tag node (<a id="node_element"></a><code>node_element</code>) - this is the most common type of node, which represents XML elements. Element nodes have a name, a collection of attributes and a collection of child nodes (both of which may be empty). The attribute is a simple name/value pair. The example XML representation of element nodes is as follows:
+<div class="listingblock">
+<div class="content">
+<pre>&lt;node attr="value"&gt;&lt;child/&gt;&lt;/node&gt;</pre>
+</div>
+</div>
+<div class="paragraph">
+There are two element nodes here: one has name <code>"node"</code>, single attribute <code>"attr"</code> and single child <code>"child"</code>, another has name <code>"child"</code> and does not have any attributes or child nodes.
+</div>
+</li>
+<li>
+Plain character data nodes (<a id="node_pcdata"></a><code>node_pcdata</code>) represent plain text in XML. PCDATA nodes have a value, but do not have a name or children/attributes. Note that plain character data is not a part of the element node but instead has its own node; an element node can have several child PCDATA nodes. The example XML representation of text nodes is as follows:
+<div class="listingblock">
+<div class="content">
+<pre>&lt;node&gt; text1 &lt;child/&gt; text2 &lt;/node&gt;</pre>
+</div>
+</div>
+<div class="paragraph">
+Here <code>"node"</code> element has three children, two of which are PCDATA nodes with values <code>" text1 "</code> and <code>" text2 "</code>.
+</div>
+</li>
+<li>
+Character data nodes (<a id="node_cdata"></a><code>node_cdata</code>) represent text in XML that is quoted in a special way. CDATA nodes do not differ from PCDATA nodes except in XML representation - the above text example looks like this with CDATA:
+<div class="listingblock">
+<div class="content">
+<pre>&lt;node&gt; &lt;![CDATA[[text1]]&gt; &lt;child/&gt; &lt;![CDATA[[text2]]&gt; &lt;/node&gt;</pre>
+</div>
+</div>
+<div class="paragraph">
+CDATA nodes make it easy to include non-escaped <code>&lt;</code>, <code>&amp;</code> and <code>&gt;</code> characters in plain text. CDATA value can not contain the character sequence <code>]]&gt;</code>, since it is used to determine the end of node contents.
+</div>
+</li>
+<li>
+Comment nodes (<a id="node_comment"></a><code>node_comment</code>) represent comments in XML. Comment nodes have a value, but do not have a name or children/attributes. The example XML representation of a comment node is as follows:
+<div class="listingblock">
+<div class="content">
+<pre>&lt;!-- comment text --&gt;</pre>
+</div>
+</div>
+<div class="paragraph">
+Here the comment node has value <code>"comment text"</code>. By default comment nodes are treated as non-essential part of XML markup and are not loaded during XML parsing. You can override this behavior with <a href="#parse_comments">parse_comments</a> flag.
+</div>
+</li>
+<li>
+Processing instruction node (<a id="node_pi"></a><code>node_pi</code>) represent processing instructions (PI) in XML. PI nodes have a name and an optional value, but do not have children/attributes. The example XML representation of a PI node is as follows:
+<div class="listingblock">
+<div class="content">
+<pre>&lt;?name value?&gt;</pre>
+</div>
+</div>
+<div class="paragraph">
+Here the name (also called PI target) is <code>"name"</code>, and the value is <code>"value"</code>. By default PI nodes are treated as non-essential part of XML markup and are not loaded during XML parsing. You can override this behavior with <a href="#parse_pi">parse_pi</a> flag.
+</div>
+</li>
+<li>
+Declaration node (<a id="node_declaration"></a><code>node_declaration</code>) represents document declarations in XML. Declaration nodes have a name (<code>"xml"</code>) and an optional collection of attributes, but do not have value or children. There can be only one declaration node in a document; moreover, it should be the topmost node (its parent should be the document). The example XML representation of a declaration node is as follows:
+<div class="listingblock">
+<div class="content">
+<pre>&lt;?xml version="1.0"?&gt;</pre>
+</div>
+</div>
+<div class="paragraph">
+Here the node has name <code>"xml"</code> and a single attribute with name <code>"version"</code> and value <code>"1.0"</code>. By default declaration nodes are treated as non-essential part of XML markup and are not loaded during XML parsing. You can override this behavior with <a href="#parse_declaration">parse_declaration</a> flag. Also, by default a dummy declaration is output when XML document is saved unless there is already a declaration in the document; you can disable this with <a href="#format_no_declaration">format_no_declaration</a> flag.
+</div>
+</li>
+<li>
+Document type declaration node (<a id="node_doctype"></a><code>node_doctype</code>) represents document type declarations in XML. Document type declaration nodes have a value, which corresponds to the entire document type contents; no additional nodes are created for inner elements like <code>&lt;!ENTITY&gt;</code>. There can be only one document type declaration node in a document; moreover, it should be the topmost node (its parent should be the document). The example XML representation of a document type declaration node is as follows:
+<div class="listingblock">
+<div class="content">
+<pre>&lt;!DOCTYPE greeting [ &lt;!ELEMENT greeting (#PCDATA)&gt; ]&gt;</pre>
+</div>
+</div>
+<div class="paragraph">
+Here the node has value <code>"greeting [ &lt;!ELEMENT greeting (#PCDATA)&gt; ]"</code>. By default document type declaration nodes are treated as non-essential part of XML markup and are not loaded during XML parsing. You can override this behavior with <a href="#parse_doctype">parse_doctype</a> flag.
+</div>
+</li>
+</ul>
+</div>
+<div class="paragraph">
+Finally, here is a complete example of XML document and the corresponding tree representation (<a href="samples/tree.xml" class="bare">samples/tree.xml</a>):
+</div>
+<table class="tableblock frame-none grid-all spread">
+<colgroup>
+<col style="width: 50%;">
+<col style="width: 50%;">
+</colgroup>
+<tbody>
+<tr>
+<td class="tableblock halign-left valign-top"><div><div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="xml">&lt;?xml version=&quot;1.0&quot;?&gt;
+&lt;mesh name=&quot;mesh_root&quot;&gt;
+ &lt;!-- here is a mesh node --&gt;
+ some text
+ &lt;![CDATA[someothertext]]&gt;
+ some more text
+ &lt;node attr1=&quot;value1&quot; attr2=&quot;value2&quot; /&gt;
+ &lt;node attr1=&quot;value2&quot;&gt;
+ &lt;innernode/&gt;
+ &lt;/node&gt;
+&lt;/mesh&gt;
+&lt;?include somedata?&gt;</code></pre>
+</div>
+</div></div></td>
+<td class="tableblock halign-left valign-top"><div><div class="imageblock">
+<div class="content">
+<a class="image" href="images/dom_tree.png"><img src="images/dom_tree.png" alt="dom tree"></a>
+</div>
+</div></div></td>
+</tr>
+</tbody>
+</table>
+</div>
+<div class="sect2">
+<h3 id="dom.cpp"><a class="anchor" href="#dom.cpp"></a>3.2. C&#43;&#43; interface</h3>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+All pugixml classes and functions are located in the <code>pugi</code> namespace; you have to either use explicit name qualification (i.e. <code>pugi::xml_node</code>), or to gain access to relevant symbols via <code>using</code> directive (i.e. <code>using pugi::xml_node;</code> or <code>using namespace pugi;</code>). The namespace will be omitted from all declarations in this documentation hereafter; all code examples will use fully qualified names.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+Despite the fact that there are several node types, there are only three C&#43;&#43; classes representing the tree (<code>xml_document</code>, <code>xml_node</code>, <code>xml_attribute</code>); some operations on <code>xml_node</code> are only valid for certain node types. The classes are described below.
+</div>
+<div class="paragraph">
+<a id="xml_document"></a><a id="xml_document::document_element"></a>
+<code>xml_document</code> is the owner of the entire document structure; it is a non-copyable class. The interface of <code>xml_document</code> consists of loading functions (see <a href="#loading">Loading document</a>), saving functions (see <a href="#saving">Saving document</a>) and the entire interface of <code>xml_node</code>, which allows for document inspection and/or modification. Note that while <code>xml_document</code> is a sub-class of <code>xml_node</code>, <code>xml_node</code> is not a polymorphic type; the inheritance is present only to simplify usage. Alternatively you can use the <code>document_element</code> function to get the element node that&#8217;s the immediate child of the document.
+</div>
+<div class="paragraph">
+<a id="xml_document::ctor"></a><a id="xml_document::dtor"></a><a id="xml_document::reset"></a>
+Default constructor of <code>xml_document</code> initializes the document to the tree with only a root node (document node). You can then populate it with data using either tree modification functions or loading functions; all loading functions destroy the previous tree with all occupied memory, which puts existing node/attribute handles for this document to invalid state. If you want to destroy the previous tree, you can use the <code>xml_document::reset</code> function; it destroys the tree and replaces it with either an empty one or a copy of the specified document. Destructor of <code>xml_document</code> also destroys the tree, thus the lifetime of the document object should exceed the lifetimes of any node/attribute handles that point to the tree.
+</div>
+<div class="admonitionblock caution">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Caution</div>
+</td>
+<td class="content">
+While technically node/attribute handles can be alive when the tree they&#8217;re referring to is destroyed, calling any member function for these handles results in undefined behavior. Thus it is recommended to make sure that the document is destroyed only after all references to its nodes/attributes are destroyed.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+<a id="xml_node"></a><a id="xml_node::type"></a>
+<code>xml_node</code> is the handle to document node; it can point to any node in the document, including the document node itself. There is a common interface for nodes of all types; the actual <a href="#xml_node_type">node type</a> can be queried via the <code>xml_node::type()</code> method. Note that <code>xml_node</code> is only a handle to the actual node, not the node itself - you can have several <code>xml_node</code> handles pointing to the same underlying object. Destroying <code>xml_node</code> handle does not destroy the node and does not remove it from the tree. The size of <code>xml_node</code> is equal to that of a pointer, so it is nothing more than a lightweight wrapper around a pointer; you can safely pass or return <code>xml_node</code> objects by value without additional overhead.
+</div>
+<div id="node_null" class="paragraph">
+There is a special value of <code>xml_node</code> type, known as null node or empty node (such nodes have type <code>node_null</code>). It does not correspond to any node in any document, and thus resembles null pointer. However, all operations are defined on empty nodes; generally the operations don&#8217;t do anything and return empty nodes/attributes or empty strings as their result (see documentation for specific functions for more detailed information). This is useful for chaining calls; i.e. you can get the grandparent of a node like so: <code>node.parent().parent()</code>; if a node is a null node or it does not have a parent, the first <code>parent()</code> call returns null node; the second <code>parent()</code> call then also returns null node, which makes error handling easier.
+</div>
+<div id="xml_attribute" class="paragraph">
+<code>xml_attribute</code> is the handle to an XML attribute; it has the same semantics as <code>xml_node</code>, i.e. there can be several <code>xml_attribute</code> handles pointing to the same underlying object and there is a special null attribute value, which propagates to function results.
+</div>
+<div class="paragraph">
+<a id="xml_attribute::ctor"></a><a id="xml_node::ctor"></a>
+Both <code>xml_node</code> and <code>xml_attribute</code> have the default constructor which initializes them to null objects.
+</div>
+<div class="paragraph">
+<a id="xml_attribute::comparison"></a><a id="xml_node::comparison"></a>
+<code>xml_node</code> and <code>xml_attribute</code> try to behave like pointers, that is, they can be compared with other objects of the same type, making it possible to use them as keys in associative containers. All handles to the same underlying object are equal, and any two handles to different underlying objects are not equal. Null handles only compare as equal to themselves. The result of relational comparison can not be reliably determined from the order of nodes in file or in any other way. Do not use relational comparison operators except for search optimization (i.e. associative container keys).
+</div>
+<div class="paragraph">
+<a id="xml_attribute::hash_value"></a><a id="xml_node::hash_value"></a>
+If you want to use <code>xml_node</code> or <code>xml_attribute</code> objects as keys in hash-based associative containers, you can use the <code>hash_value</code> member functions. They return the hash values that are guaranteed to be the same for all handles to the same underlying object. The hash value for null handles is 0.
+</div>
+<div class="paragraph">
+<a id="xml_attribute::unspecified_bool_type"></a><a id="xml_node::unspecified_bool_type"></a><a id="xml_attribute::empty"></a><a id="xml_node::empty"></a>
+Finally handles can be implicitly cast to boolean-like objects, so that you can test if the node/attribute is empty with the following code: <code>if (node) { &#8230;&#8203; }</code> or <code>if (!node) { &#8230;&#8203; } else { &#8230;&#8203; }</code>. Alternatively you can check if a given <code>xml_node</code>/<code>xml_attribute</code> handle is null by calling the following methods:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xml_attribute::empty() const;
+bool xml_node::empty() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Nodes and attributes do not exist without a document tree, so you can&#8217;t create them without adding them to some document. Once underlying node/attribute objects are destroyed, the handles to those objects become invalid. While this means that destruction of the entire tree invalidates all node/attribute handles, it also means that destroying a subtree (by calling <a href="#xml_node::remove_child">xml_node::remove_child</a>) or removing an attribute invalidates the corresponding handles. There is no way to check handle validity; you have to ensure correctness through external mechanisms.
+</div>
+</div>
+<div class="sect2">
+<h3 id="dom.unicode"><a class="anchor" href="#dom.unicode"></a>3.3. Unicode interface</h3>
+<div class="paragraph">
+There are two choices of interface and internal representation when configuring pugixml: you can either choose the UTF-8 (also called char) interface or UTF-16/32 (also called wchar_t) one. The choice is controlled via <a href="#PUGIXML_WCHAR_MODE">PUGIXML_WCHAR_MODE</a> define; you can set it via <code>pugiconfig.hpp</code> or via preprocessor options, as discussed in <a href="#install.building.config">Additional configuration options</a>. If this define is set, the wchar_t interface is used; otherwise (by default) the char interface is used. The exact wide character encoding is assumed to be either UTF-16 or UTF-32 and is determined based on the size of <code>wchar_t</code> type.
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+If the size of <code>wchar_t</code> is 2, pugixml assumes UTF-16 encoding instead of UCS-2, which means that some characters are represented as two code points.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+All tree functions that work with strings work with either C-style null terminated strings or STL strings of the selected character type. For example, node name accessors look like this in char mode:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const char* xml_node::name() const;
+bool xml_node::set_name(const char* value);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+and like this in wchar_t mode:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const wchar_t* xml_node::name() const;
+bool xml_node::set_name(const wchar_t* value);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<a id="char_t"></a><a id="string_t"></a>
+There is a special type, <code>pugi::char_t</code>, that is defined as the character type and depends on the library configuration; it will be also used in the documentation hereafter. There is also a type <code>pugi::string_t</code>, which is defined as the STL string of the character type; it corresponds to <code>std::string</code> in char mode and to <code>std::wstring</code> in wchar_t mode.
+</div>
+<div class="paragraph">
+In addition to the interface, the internal implementation changes to store XML data as <code>pugi::char_t</code>; this means that these two modes have different memory usage characteristics. The conversion to <code>pugi::char_t</code> upon document loading and from <code>pugi::char_t</code> upon document saving happen automatically, which also carries minor performance penalty. The general advice however is to select the character mode based on usage scenario, i.e. if UTF-8 is inconvenient to process and most of your XML data is non-ASCII, wchar_t mode is probably a better choice.
+</div>
+<div class="paragraph">
+<a id="as_utf8"></a><a id="as_wide"></a>
+There are cases when you&#8217;ll have to convert string data between UTF-8 and wchar_t encodings; the following helper functions are provided for such purposes:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">std::string as_utf8(const wchar_t* str);
+std::wstring as_wide(const char* str);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Both functions accept a null-terminated string as an argument <code>str</code>, and return the converted string. <code>as_utf8</code> performs conversion from UTF-16/32 to UTF-8; <code>as_wide</code> performs conversion from UTF-8 to UTF-16/32. Invalid UTF sequences are silently discarded upon conversion. <code>str</code> has to be a valid string; passing null pointer results in undefined behavior. There are also two overloads with the same semantics which accept a string as an argument:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">std::string as_utf8(const std::wstring&amp; str);
+std::wstring as_wide(const std::string&amp; str);</code></pre>
+</div>
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+<div class="paragraph">
+Most examples in this documentation assume char interface and therefore will not compile with <a href="#PUGIXML_WCHAR_MODE">PUGIXML_WCHAR_MODE</a>. This is done to simplify the documentation; usually the only changes you&#8217;ll have to make is to pass <code>wchar_t</code> string literals, i.e. instead of
+</div>
+<div class="paragraph">
+<code>xml_node node = doc.child("bookstore").find_child_by_attribute("book", "id", "12345");</code>
+</div>
+<div class="paragraph">
+you&#8217;ll have to use
+</div>
+<div class="paragraph">
+<code>xml_node node = doc.child(L"bookstore").find_child_by_attribute(L"book", L"id", L"12345");</code>
+</div>
+</td>
+</tr>
+</table>
+</div>
+</div>
+<div class="sect2">
+<h3 id="dom.thread"><a class="anchor" href="#dom.thread"></a>3.4. Thread-safety guarantees</h3>
+<div class="paragraph">
+Almost all functions in pugixml have the following thread-safety guarantees:
+</div>
+<div class="ulist">
+<ul>
+<li>
+it is safe to call free (non-member) functions from multiple threads
+</li>
+<li>
+it is safe to perform concurrent read-only accesses to the same tree (all constant member functions do not modify the tree)
+</li>
+<li>
+it is safe to perform concurrent read/write accesses, if there is only one read or write access to the single tree at a time
+</li>
+</ul>
+</div>
+<div class="paragraph">
+Concurrent modification and traversing of a single tree requires synchronization, for example via reader-writer lock. Modification includes altering document structure and altering individual node/attribute data, i.e. changing names/values.
+</div>
+<div class="paragraph">
+The only exception is <a href="#set_memory_management_functions">set_memory_management_functions</a>; it modifies global variables and as such is not thread-safe. Its usage policy has more restrictions, see <a href="#dom.memory.custom">Custom memory allocation/deallocation functions</a>.
+</div>
+</div>
+<div class="sect2">
+<h3 id="dom.exception"><a class="anchor" href="#dom.exception"></a>3.5. Exception guarantees</h3>
+<div class="paragraph">
+With the exception of XPath, pugixml itself does not throw any exceptions. Additionally, most pugixml functions have a no-throw exception guarantee.
+</div>
+<div class="paragraph">
+This is not applicable to functions that operate on STL strings or IOstreams; such functions have either strong guarantee (functions that operate on strings) or basic guarantee (functions that operate on streams). Also functions that call user-defined callbacks (i.e. <a href="#xml_node::traverse">xml_node::traverse</a> or <a href="#xml_node::find_node">xml_node::find_node</a>) do not provide any exception guarantees beyond the ones provided by the callback.
+</div>
+<div class="paragraph">
+If exception handling is not disabled with <a href="#PUGIXML_NO_EXCEPTIONS">PUGIXML_NO_EXCEPTIONS</a> define, XPath functions may throw <a href="#xpath_exception">xpath_exception</a> on parsing errors; also, XPath functions may throw <code>std::bad_alloc</code> in low memory conditions. Still, XPath functions provide strong exception guarantee.
+</div>
+</div>
+<div class="sect2">
+<h3 id="dom.memory"><a class="anchor" href="#dom.memory"></a>3.6. Memory management</h3>
+<div class="paragraph">
+pugixml requests the memory needed for document storage in big chunks, and allocates document data inside those chunks. This section discusses replacing functions used for chunk allocation and internal memory management implementation.
+</div>
+<div class="sect3">
+<h4 id="dom.memory.custom"><a class="anchor" href="#dom.memory.custom"></a>3.6.1. Custom memory allocation/deallocation functions</h4>
+<div class="paragraph">
+<a id="allocation_function"></a><a id="deallocation_function"></a>
+All memory for tree structure, tree data and XPath objects is allocated via globally specified functions, which default to malloc/free. You can set your own allocation functions with set_memory_management function. The function interfaces are the same as that of malloc/free:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">typedef void* (*allocation_function)(size_t size);
+typedef void (*deallocation_function)(void* ptr);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<a id="set_memory_management_functions"></a><a id="get_memory_allocation_function"></a><a id="get_memory_deallocation_function"></a>
+You can use the following accessor functions to change or get current memory management functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">void set_memory_management_functions(allocation_function allocate, deallocation_function deallocate);
+allocation_function get_memory_allocation_function();
+deallocation_function get_memory_deallocation_function();</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Allocation function is called with the size (in bytes) as an argument and should return a pointer to a memory block with alignment that is suitable for storage of primitive types (usually a maximum of <code>void*</code> and <code>double</code> types alignment is sufficient) and size that is greater than or equal to the requested one. If the allocation fails, the function has to return null pointer (throwing an exception from allocation function results in undefined behavior).
+</div>
+<div class="paragraph">
+Deallocation function is called with the pointer that was returned by some call to allocation function; it is never called with a null pointer. If memory management functions are not thread-safe, library thread safety is not guaranteed.
+</div>
+<div class="paragraph">
+This is a simple example of custom memory management (<a href="samples/custom_memory_management.cpp" class="bare">samples/custom_memory_management.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">void* custom_allocate(size_t size)
+{
+ return new (std::nothrow) char[size];
+}
+
+void custom_deallocate(void* ptr)
+{
+ delete[] static_cast&lt;char*&gt;(ptr);
+}</code></pre>
+</div>
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">pugi::set_memory_management_functions(custom_allocate, custom_deallocate);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+When setting new memory management functions, care must be taken to make sure that there are no live pugixml objects. Otherwise when the objects are destroyed, the new deallocation function will be called with the memory obtained by the old allocation function, resulting in undefined behavior.
+</div>
+</div>
+<div class="sect3">
+<h4 id="dom.memory.tuning"><a class="anchor" href="#dom.memory.tuning"></a>3.6.2. Memory consumption tuning</h4>
+<div class="paragraph">
+There are several important buffering optimizations in pugixml that rely on predefined constants. These constants have default values that were tuned for common usage patterns; for some applications, changing these constants might improve memory consumption or increase performance. Changing these constants is not recommended unless their default values result in visible problems.
+</div>
+<div class="paragraph">
+These constants can be tuned via configuration defines, as discussed in <a href="#install.building.config">Additional configuration options</a>; it is recommended to set them in <code>pugiconfig.hpp</code>.
+</div>
+<div class="ulist">
+<ul>
+<li>
+<code>PUGIXML_MEMORY_PAGE_SIZE</code> controls the page size for document memory allocation. Memory for node/attribute objects is allocated in pages of the specified size. The default size is 32 Kb; for some applications the size is too large (i.e. embedded systems with little heap space or applications that keep lots of XML documents in memory). A minimum size of 1 Kb is recommended.
+</li>
+<li>
+<code>PUGIXML_MEMORY_OUTPUT_STACK</code> controls the cumulative stack space required to output the node. Any output operation (i.e. saving a subtree to file) uses an internal buffering scheme for performance reasons. The default size is 10 Kb; if you&#8217;re using node output from threads with little stack space, decreasing this value can prevent stack overflows. A minimum size of 1 Kb is recommended.
+</li>
+<li>
+<code>PUGIXML_MEMORY_XPATH_PAGE_SIZE</code> controls the page size for XPath memory allocation. Memory for XPath query objects as well as internal memory for XPath evaluation is allocated in pages of the specified size. The default size is 4 Kb; if you have a lot of resident XPath query objects, you might need to decrease the size to improve memory consumption. A minimum size of 256 bytes is recommended.
+</li>
+</ul>
+</div>
+</div>
+<div class="sect3">
+<h4 id="dom.memory.internals"><a class="anchor" href="#dom.memory.internals"></a>3.6.3. Document memory management internals</h4>
+<div class="paragraph">
+Constructing a document object using the default constructor does not result in any allocations; document node is stored inside the <a href="#xml_document">xml_document</a> object.
+</div>
+<div class="paragraph">
+When the document is loaded from file/buffer, unless an inplace loading function is used (see <a href="#loading.memory">Loading document from memory</a>), a complete copy of character stream is made; all names/values of nodes and attributes are allocated in this buffer. This buffer is allocated via a single large allocation and is only freed when document memory is reclaimed (i.e. if the <a href="#xml_document">xml_document</a> object is destroyed or if another document is loaded in the same object). Also when loading from file or stream, an additional large allocation may be performed if encoding conversion is required; a temporary buffer is allocated, and it is freed before load function returns.
+</div>
+<div class="paragraph">
+All additional memory, such as memory for document structure (node/attribute objects) and memory for node/attribute names/values is allocated in pages on the order of 32 Kb; actual objects are allocated inside the pages using a memory management scheme optimized for fast allocation/deallocation of many small objects. Because of the scheme specifics, the pages are only destroyed if all objects inside them are destroyed; also, generally destroying an object does not mean that subsequent object creation will reuse the same memory. This means that it is possible to devise a usage scheme which will lead to higher memory usage than expected; one example is adding a lot of nodes, and them removing all even numbered ones; not a single page is reclaimed in the process. However this is an example specifically crafted to produce unsatisfying behavior; in all practical usage scenarios the memory consumption is less than that of a general-purpose allocator because allocation meta-data is very small in size.
+</div>
+</div>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="loading"><a class="anchor" href="#loading"></a>4. Loading document</h2>
+<div class="sectionbody">
+<div class="paragraph">
+pugixml provides several functions for loading XML data from various places - files, C&#43;&#43; iostreams, memory buffers. All functions use an extremely fast non-validating parser. This parser is not fully W3C conformant - it can load any valid XML document, but does not perform some well-formedness checks. While considerable effort is made to reject invalid XML documents, some validation is not performed for performance reasons. Also some XML transformations (i.e. EOL handling or attribute value normalization) can impact parsing speed and thus can be disabled. However for vast majority of XML documents there is no performance difference between different parsing options. Parsing options also control whether certain XML nodes are parsed; see <a href="#loading.options">Parsing options</a> for more information.
+</div>
+<div class="paragraph">
+XML data is always converted to internal character format (see <a href="#dom.unicode">Unicode interface</a>) before parsing. pugixml supports all popular Unicode encodings (UTF-8, UTF-16 (big and little endian), UTF-32 (big and little endian); UCS-2 is naturally supported since it&#8217;s a strict subset of UTF-16) and handles all encoding conversions automatically. Unless explicit encoding is specified, loading functions perform automatic encoding detection based on first few characters of XML data, so in almost all cases you do not have to specify document encoding. Encoding conversion is described in more detail in <a href="#loading.encoding">Encodings</a>.
+</div>
+<div class="sect2">
+<h3 id="loading.file"><a class="anchor" href="#loading.file"></a>4.1. Loading document from file</h3>
+<div class="paragraph">
+<a id="xml_document::load_file"></a><a id="xml_document::load_file_wide"></a>
+The most common source of XML data is files; pugixml provides dedicated functions for loading an XML document from file:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_parse_result xml_document::load_file(const char* path, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+xml_parse_result xml_document::load_file(const wchar_t* path, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+These functions accept the file path as its first argument, and also two optional arguments, which specify parsing options (see <a href="#loading.options">Parsing options</a>) and input data encoding (see <a href="#loading.encoding">Encodings</a>). The path has the target operating system format, so it can be a relative or absolute one, it should have the delimiters of the target system, it should have the exact case if the target file system is case-sensitive, etc.
+</div>
+<div class="paragraph">
+File path is passed to the system file opening function as is in case of the first function (which accepts <code>const char* path</code>); the second function either uses a special file opening function if it is provided by the runtime library or converts the path to UTF-8 and uses the system file opening function.
+</div>
+<div class="paragraph">
+<code>load_file</code> destroys the existing document tree and then tries to load the new tree from the specified file. The result of the operation is returned in an <a href="#xml_parse_result">xml_parse_result</a> object; this object contains the operation status and the related information (i.e. last successfully parsed position in the input file, if parsing fails). See <a href="#loading.errors">Handling parsing errors</a> for error handling details.
+</div>
+<div class="paragraph">
+This is an example of loading XML document from file (<a href="samples/load_file.cpp" class="bare">samples/load_file.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">pugi::xml_document doc;
+
+pugi::xml_parse_result result = doc.load_file(&quot;tree.xml&quot;);
+
+std::cout &lt;&lt; &quot;Load result: &quot; &lt;&lt; result.description() &lt;&lt; &quot;, mesh name: &quot; &lt;&lt; doc.child(&quot;mesh&quot;).attribute(&quot;name&quot;).value() &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="loading.memory"><a class="anchor" href="#loading.memory"></a>4.2. Loading document from memory</h3>
+<div class="paragraph">
+<a id="xml_document::load_buffer"></a><a id="xml_document::load_buffer_inplace"></a><a id="xml_document::load_buffer_inplace_own"></a>
+Sometimes XML data should be loaded from some other source than a file, i.e. HTTP URL; also you may want to load XML data from file using non-standard functions, i.e. to use your virtual file system facilities or to load XML from GZip-compressed files. All these scenarios require loading document from memory. First you should prepare a contiguous memory block with all XML data; then you have to invoke one of buffer loading functions. These functions will handle the necessary encoding conversions, if any, and then will parse the data into the corresponding XML tree. There are several buffer loading functions, which differ in the behavior and thus in performance/memory usage:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_parse_result xml_document::load_buffer(const void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+xml_parse_result xml_document::load_buffer_inplace(void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+xml_parse_result xml_document::load_buffer_inplace_own(void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+All functions accept the buffer which is represented by a pointer to XML data, <code>contents</code>, and data size in bytes. Also there are two optional arguments, which specify parsing options (see <a href="#loading.options">Parsing options</a>) and input data encoding (see <a href="#loading.encoding">Encodings</a>). The buffer does not have to be zero-terminated.
+</div>
+<div class="paragraph">
+<code>load_buffer</code> function works with immutable buffer - it does not ever modify the buffer. Because of this restriction it has to create a private buffer and copy XML data to it before parsing (applying encoding conversions if necessary). This copy operation carries a performance penalty, so inplace functions are provided - <code>load_buffer_inplace</code> and <code>load_buffer_inplace_own</code> store the document data in the buffer, modifying it in the process. In order for the document to stay valid, you have to make sure that the buffer&#8217;s lifetime exceeds that of the tree if you&#8217;re using inplace functions. In addition to that, <code>load_buffer_inplace</code> does not assume ownership of the buffer, so you&#8217;ll have to destroy it yourself; <code>load_buffer_inplace_own</code> assumes ownership of the buffer and destroys it once it is not needed. This means that if you&#8217;re using <code>load_buffer_inplace_own</code>, you have to allocate memory with pugixml allocation function (you can get it via <a href="#get_memory_allocation_function">get_memory_allocation_function</a>).
+</div>
+<div class="paragraph">
+The best way from the performance/memory point of view is to load document using <code>load_buffer_inplace_own</code>; this function has maximum control of the buffer with XML data so it is able to avoid redundant copies and reduce peak memory usage while parsing. This is the recommended function if you have to load the document from memory and performance is critical.
+</div>
+<div id="xml_document::load_string" class="paragraph">
+There is also a simple helper function for cases when you want to load the XML document from null-terminated character string:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_parse_result xml_document::load_string(const char_t* contents, unsigned int options = parse_default);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+It is equivalent to calling <code>load_buffer</code> with <code>size</code> being either <code>strlen(contents)</code> or <code>wcslen(contents) * sizeof(wchar_t)</code>, depending on the character type. This function assumes native encoding for input data, so it does not do any encoding conversion. In general, this function is fine for loading small documents from string literals, but has more overhead and less functionality than the buffer loading functions.
+</div>
+<div class="paragraph">
+This is an example of loading XML document from memory using different functions (<a href="samples/load_memory.cpp" class="bare">samples/load_memory.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const char source[] = &quot;&lt;mesh name=&#39;sphere&#39;&gt;&lt;bounds&gt;0 0 1 1&lt;/bounds&gt;&lt;/mesh&gt;&quot;;
+size_t size = sizeof(source);</code></pre>
+</div>
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// You can use load_buffer to load document from immutable memory block:
+pugi::xml_parse_result result = doc.load_buffer(source, size);</code></pre>
+</div>
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// You can use load_buffer_inplace to load document from mutable memory block; the block&#39;s lifetime must exceed that of document
+char* buffer = new char[size];
+memcpy(buffer, source, size);
+
+// The block can be allocated by any method; the block is modified during parsing
+pugi::xml_parse_result result = doc.load_buffer_inplace(buffer, size);
+
+// You have to destroy the block yourself after the document is no longer used
+delete[] buffer;</code></pre>
+</div>
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// You can use load_buffer_inplace_own to load document from mutable memory block and to pass the ownership of this block
+// The block has to be allocated via pugixml allocation function - using i.e. operator new here is incorrect
+char* buffer = static_cast&lt;char*&gt;(pugi::get_memory_allocation_function()(size));
+memcpy(buffer, source, size);
+
+// The block will be deleted by the document
+pugi::xml_parse_result result = doc.load_buffer_inplace_own(buffer, size);</code></pre>
+</div>
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// You can use load to load document from null-terminated strings, for example literals:
+pugi::xml_parse_result result = doc.load_string(&quot;&lt;mesh name=&#39;sphere&#39;&gt;&lt;bounds&gt;0 0 1 1&lt;/bounds&gt;&lt;/mesh&gt;&quot;);</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="loading.stream"><a class="anchor" href="#loading.stream"></a>4.3. Loading document from C&#43;&#43; IOstreams</h3>
+<div id="xml_document::load_stream" class="paragraph">
+To enhance interoperability, pugixml provides functions for loading document from any object which implements C&#43;&#43; <code>std::istream</code> interface. This allows you to load documents from any standard C&#43;&#43; stream (i.e. file stream) or any third-party compliant implementation (i.e. Boost Iostreams). There are two functions, one works with narrow character streams, another handles wide character ones:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_parse_result xml_document::load(std::istream&amp; stream, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+xml_parse_result xml_document::load(std::wistream&amp; stream, unsigned int options = parse_default);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>load</code> with <code>std::istream</code> argument loads the document from stream from the current read position to the end, treating the stream contents as a byte stream of the specified encoding (with encoding autodetection as necessary). Thus calling <code>xml_document::load</code> on an opened <code>std::ifstream</code> object is equivalent to calling <code>xml_document::load_file</code>.
+</div>
+<div class="paragraph">
+<code>load</code> with <code>std::wstream</code> argument treats the stream contents as a wide character stream (encoding is always <a href="#encoding_wchar">encoding_wchar</a>). Because of this, using <code>load</code> with wide character streams requires careful (usually platform-specific) stream setup (i.e. using the <code>imbue</code> function). Generally use of wide streams is discouraged, however it provides you the ability to load documents from non-Unicode encodings, i.e. you can load Shift-JIS encoded data if you set the correct locale.
+</div>
+<div class="paragraph">
+This is a simple example of loading XML document from file using streams (<a href="samples/load_stream.cpp" class="bare">samples/load_stream.cpp</a>); read the sample code for more complex examples involving wide streams and locales:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">std::ifstream stream(&quot;weekly-utf-8.xml&quot;);
+pugi::xml_parse_result result = doc.load(stream);</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="loading.errors"><a class="anchor" href="#loading.errors"></a>4.4. Handling parsing errors</h3>
+<div id="xml_parse_result" class="paragraph">
+All document loading functions return the parsing result via <code>xml_parse_result</code> object. It contains parsing status, the offset of last successfully parsed character from the beginning of the source stream, and the encoding of the source stream:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">struct xml_parse_result
+{
+ xml_parse_status status;
+ ptrdiff_t offset;
+ xml_encoding encoding;
+
+ operator bool() const;
+ const char* description() const;
+};</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<a id="xml_parse_status"></a><a id="xml_parse_result::status"></a>
+Parsing status is represented as the <code>xml_parse_status</code> enumeration and can be one of the following:
+</div>
+<div class="ulist">
+<ul>
+<li>
+<a id="status_ok"></a><code>status_ok</code> means that no error was encountered during parsing; the source stream represents the valid XML document which was fully parsed and converted to a tree.
+</li>
+<li>
+<a id="status_file_not_found"></a><code>status_file_not_found</code> is only returned by <code>load_file</code> function and means that file could not be opened.
+</li>
+<li>
+<a id="status_io_error"></a><code>status_io_error</code> is returned by <code>load_file</code> function and by <code>load</code> functions with <code>std::istream</code>/<code>std::wstream</code> arguments; it means that some I/O error has occurred during reading the file/stream.
+</li>
+<li>
+<a id="status_out_of_memory"></a><code>status_out_of_memory</code> means that there was not enough memory during some allocation; any allocation failure during parsing results in this error.
+</li>
+<li>
+<a id="status_internal_error"></a><code>status_internal_error</code> means that something went horribly wrong; currently this error does not occur
+</li>
+<li>
+<a id="status_unrecognized_tag"></a><code>status_unrecognized_tag</code> means that parsing stopped due to a tag with either an empty name or a name which starts with incorrect character, such as <code>#</code>.
+</li>
+<li>
+<a id="status_bad_pi"></a><code>status_bad_pi</code> means that parsing stopped due to incorrect document declaration/processing instruction
+</li>
+<li>
+<a id="status_bad_comment"></a><code>status_bad_comment</code>, <a id="status_bad_cdata"></a><code>status_bad_cdata</code>, <a id="status_bad_doctype"></a><code>status_bad_doctype</code> and <a id="status_bad_pcdata"></a><code>status_bad_pcdata</code> mean that parsing stopped due to the invalid construct of the respective type
+</li>
+<li>
+<a id="status_bad_start_element"></a><code>status_bad_start_element</code> means that parsing stopped because starting tag either had no closing <code>&gt;</code> symbol or contained some incorrect symbol
+</li>
+<li>
+<a id="status_bad_attribute"></a><code>status_bad_attribute</code> means that parsing stopped because there was an incorrect attribute, such as an attribute without value or with value that is not quoted (note that <code>&lt;node attr=1&gt;</code> is incorrect in XML)
+</li>
+<li>
+<a id="status_bad_end_element"></a><code>status_bad_end_element</code> means that parsing stopped because ending tag had incorrect syntax (i.e. extra non-whitespace symbols between tag name and <code>&gt;</code>)
+</li>
+<li>
+<a id="status_end_element_mismatch"></a><code>status_end_element_mismatch</code> means that parsing stopped because the closing tag did not match the opening one (i.e. <code>&lt;node&gt;&lt;/nedo&gt;</code>) or because some tag was not closed at all
+</li>
+<li>
+<a id="status_no_document_element"></a><code>status_no_document_element</code> means that no element nodes were discovered during parsing; this usually indicates an empty or invalid document
+</li>
+</ul>
+</div>
+<div id="xml_parse_result::description" class="paragraph">
+<code>description()</code> member function can be used to convert parsing status to a string; the returned message is always in English, so you&#8217;ll have to write your own function if you need a localized string. However please note that the exact messages returned by <code>description()</code> function may change from version to version, so any complex status handling should be based on <code>status</code> value. Note that <code>description()</code> returns a <code>char</code> string even in <code>PUGIXML_WCHAR_MODE</code>; you&#8217;ll have to call <a href="#as_wide">as_wide</a> to get the <code>wchar_t</code> string.
+</div>
+<div class="paragraph">
+If parsing failed because the source data was not a valid XML, the resulting tree is not destroyed - despite the fact that load function returns error, you can use the part of the tree that was successfully parsed. Obviously, the last element may have an unexpected name/value; for example, if the attribute value does not end with the necessary quotation mark, like in <code>&lt;node attr="value&gt;some data&lt;/node&gt;</code> example, the value of attribute <code>attr</code> will contain the string <code>value&gt;some data&lt;/node&gt;</code>.
+</div>
+<div id="xml_parse_result::offset" class="paragraph">
+In addition to the status code, parsing result has an <code>offset</code> member, which contains the offset of last successfully parsed character if parsing failed because of an error in source data; otherwise <code>offset</code> is 0. For parsing efficiency reasons, pugixml does not track the current line during parsing; this offset is in units of <a href="#char_t">pugi::char_t</a> (bytes for character mode, wide characters for wide character mode). Many text editors support 'Go To Position' feature - you can use it to locate the exact error position. Alternatively, if you&#8217;re loading the document from memory, you can display the error chunk along with the error description (see the example code below).
+</div>
+<div class="admonitionblock caution">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Caution</div>
+</td>
+<td class="content">
+Offset is calculated in the XML buffer in native encoding; if encoding conversion is performed during parsing, offset can not be used to reliably track the error position.
+</td>
+</tr>
+</table>
+</div>
+<div id="xml_parse_result::encoding" class="paragraph">
+Parsing result also has an <code>encoding</code> member, which can be used to check that the source data encoding was correctly guessed. It is equal to the exact encoding used during parsing (i.e. with the exact endianness); see <a href="#loading.encoding">Encodings</a> for more information.
+</div>
+<div id="xml_parse_result::bool" class="paragraph">
+Parsing result object can be implicitly converted to <code>bool</code>; if you do not want to handle parsing errors thoroughly, you can just check the return value of load functions as if it was a <code>bool</code>: <code>if (doc.load_file("file.xml")) { &#8230;&#8203; } else { &#8230;&#8203; }</code>.
+</div>
+<div class="paragraph">
+This is an example of handling loading errors (<a href="samples/load_error_handling.cpp" class="bare">samples/load_error_handling.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">pugi::xml_document doc;
+pugi::xml_parse_result result = doc.load_string(source);
+
+if (result)
+{
+ std::cout &lt;&lt; &quot;XML [&quot; &lt;&lt; source &lt;&lt; &quot;] parsed without errors, attr value: [&quot; &lt;&lt; doc.child(&quot;node&quot;).attribute(&quot;attr&quot;).value() &lt;&lt; &quot;]\n\n&quot;;
+}
+else
+{
+ std::cout &lt;&lt; &quot;XML [&quot; &lt;&lt; source &lt;&lt; &quot;] parsed with errors, attr value: [&quot; &lt;&lt; doc.child(&quot;node&quot;).attribute(&quot;attr&quot;).value() &lt;&lt; &quot;]\n&quot;;
+ std::cout &lt;&lt; &quot;Error description: &quot; &lt;&lt; result.description() &lt;&lt; &quot;\n&quot;;
+ std::cout &lt;&lt; &quot;Error offset: &quot; &lt;&lt; result.offset &lt;&lt; &quot; (error at [...&quot; &lt;&lt; (source + result.offset) &lt;&lt; &quot;]\n\n&quot;;
+}</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="loading.options"><a class="anchor" href="#loading.options"></a>4.5. Parsing options</h3>
+<div class="paragraph">
+All document loading functions accept the optional parameter <code>options</code>. This is a bitmask that customizes the parsing process: you can select the node types that are parsed and various transformations that are performed with the XML text. Disabling certain transformations can improve parsing performance for some documents; however, the code for all transformations is very well optimized, and thus the majority of documents won&#8217;t get any performance benefit. As a rule of thumb, only modify parsing flags if you want to get some nodes in the document that are excluded by default (i.e. declaration or comment nodes).
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+You should use the usual bitwise arithmetics to manipulate the bitmask: to enable a flag, use <code>mask | flag</code>; to disable a flag, use <code>mask &amp; ~flag</code>.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+These flags control the resulting tree contents:
+</div>
+<div class="ulist">
+<ul>
+<li>
+<a id="parse_declaration"></a><code>parse_declaration</code> determines if XML document declaration (node with type <a href="#node_declaration">node_declaration</a>) is to be put in DOM tree. If this flag is off, it is not put in the tree, but is still parsed and checked for correctness. This flag is off by default.
+</li>
+<li>
+<a id="parse_doctype"></a><code>parse_doctype</code> determines if XML document type declaration (node with type <a href="#node_doctype">node_doctype</a>) is to be put in DOM tree. If this flag is off, it is not put in the tree, but is still parsed and checked for correctness. This flag is off by default.
+</li>
+<li>
+<a id="parse_pi"></a><code>parse_pi</code> determines if processing instructions (nodes with type <a href="#node_pi">node_pi</a>) 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. Note that <code>&lt;?xml &#8230;&#8203;?&gt;</code> (document declaration) is not considered to be a PI. This flag is off by default.
+</li>
+<li>
+<a id="parse_comments"></a><code>parse_comments</code> determines if comments (nodes with type <a href="#node_comment">node_comment</a>) 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. This flag is off by default.
+</li>
+<li>
+<a id="parse_cdata"></a><code>parse_cdata</code> determines if CDATA sections (nodes with type <a href="#node_cdata">node_cdata</a>) 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. This flag is on by default.
+</li>
+<li>
+<a id="parse_trim_pcdata"></a><code>parse_trim_pcdata</code> determines if leading and trailing whitespace characters are to be removed from PCDATA nodes. While for some applications leading/trailing whitespace is significant, often the application only cares about the non-whitespace contents so it&#8217;s easier to trim whitespace from text during parsing. This flag is off by default.
+</li>
+<li>
+<a id="parse_ws_pcdata"></a><code>parse_ws_pcdata</code> determines if PCDATA nodes (nodes with type <a href="#node_pcdata">node_pcdata</a>) 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 <code>&lt;node&gt; &lt;a/&gt; &lt;/node&gt;</code>, <code>&lt;node&gt;</code> element will have three children when <code>parse_ws_pcdata</code> is set (child with type <a href="#node_pcdata">node_pcdata</a> and value <code>" "</code>, child with type <a href="#node_element">node_element</a> and name <code>"a"</code>, and another child with type <a href="#node_pcdata">node_pcdata</a> and value <code>" "</code>), and only one child when <code>parse_ws_pcdata</code> is not set. This flag is off by default.
+</li>
+<li>
+<a id="parse_ws_pcdata_single"></a><code>parse_ws_pcdata_single</code> determines if whitespace-only PCDATA nodes that have no sibling nodes are to be put in DOM tree. In some cases application needs to parse the whitespace-only contents of nodes, i.e. <code>&lt;node&gt; &lt;/node&gt;</code>, but is not interested in whitespace markup elsewhere. It is possible to use <a href="#parse_ws_pcdata">parse_ws_pcdata</a> flag in this case, but it results in excessive allocations and complicates document processing; this flag can be used to avoid that. As an example, after parsing XML string <code>&lt;node&gt; &lt;a&gt; &lt;/a&gt; &lt;/node&gt;</code> with <code>parse_ws_pcdata_single</code> flag set, <code>&lt;node&gt;</code> element will have one child <code>&lt;a&gt;</code>, and <code>&lt;a&gt;</code> element will have one child with type <a href="#node_pcdata">node_pcdata</a> and value <code>" "</code>. This flag has no effect if <a href="#parse_ws_pcdata">parse_ws_pcdata</a> is enabled. This flag is off by default.
+</li>
+<li>
+<a id="parse_fragment"></a><code>parse_fragment</code> determines if document should be treated as a fragment of a valid XML. Parsing document as a fragment leads to top-level PCDATA content (i.e. text that is not located inside a node) to be added to a tree, and additionally treats documents without element nodes as valid. This flag is off by default.
+</li>
+</ul>
+</div>
+<div class="admonitionblock caution">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Caution</div>
+</td>
+<td class="content">
+Using in-place parsing (<a href="#xml_document::load_buffer_inplace">load_buffer_inplace</a>) with <code>parse_fragment</code> flag may result in the loss of the last character of the buffer if it is a part of PCDATA. Since PCDATA values are null-terminated strings, the only way to resolve this is to provide a null-terminated buffer as an input to <code>load_buffer_inplace</code> - i.e. <code>doc.load_buffer_inplace("test\0", 5, pugi::parse_default | pugi::parse_fragment)</code>.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+These flags control the transformation of tree element contents:
+</div>
+<div class="ulist">
+<ul>
+<li>
+<a id="parse_escapes"></a><code>parse_escapes</code> determines if character and entity references are to be expanded during the parsing process. Character references have the form <code>&amp;#&#8230;&#8203;;</code> or <code>&amp;#x&#8230;&#8203;;</code> (<code>&#8230;&#8203;</code> is Unicode numeric representation of character in either decimal (<code>&amp;#&#8230;&#8203;;</code>) or hexadecimal (<code>&amp;#x&#8230;&#8203;;</code>) form), entity references are <code>&amp;lt;</code>, <code>&amp;gt;</code>, <code>&amp;amp;</code>, <code>&amp;apos;</code> and <code>&amp;quot;</code> (note that as pugixml does not handle DTD, the only allowed entities are predefined ones). If character/entity reference can not be expanded, it is left as is, so you can do additional processing later. Reference expansion is performed on attribute values and PCDATA content. This flag is on by default.
+</li>
+<li>
+<a id="parse_eol"></a><code>parse_eol</code> determines if EOL handling (that is, replacing sequences <code>\r\n</code> by a single <code>\n</code> character, and replacing all standalone <code>\r</code> characters by <code>\n</code>) is to be performed on input data (that is, comment contents, PCDATA/CDATA contents and attribute values). This flag is on by default.
+</li>
+<li>
+<a id="parse_wconv_attribute"></a><code>parse_wconv_attribute</code> determines if attribute value normalization should be performed for all attributes. This means, that whitespace characters (new line, tab and space) are replaced with space (<code>' '</code>). New line characters are always treated as if <a href="#parse_eol">parse_eol</a> is set, i.e. <code>\r\n</code> is converted to a single space. This flag is on by default.
+</li>
+<li>
+<a id="parse_wnorm_attribute"></a><code>parse_wnorm_attribute</code> determines if extended attribute value normalization should be performed for all attributes. This means, that after attribute values are normalized as if <a href="#parse_wconv_attribute">parse_wconv_attribute</a> was set, leading and trailing space characters are removed, and all sequences of space characters are replaced by a single space character. <a href="#parse_wconv_attribute">parse_wconv_attribute</a> has no effect if this flag is on. This flag is off by default.
+</li>
+</ul>
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+<code>parse_wconv_attribute</code> option performs transformations that are required by W3C specification for attributes that are declared as CDATA; <a href="#parse_wnorm_attribute">parse_wnorm_attribute</a> performs transformations required for NMTOKENS attributes. In the absence of document type declaration all attributes should behave as if they are declared as CDATA, thus <a href="#parse_wconv_attribute">parse_wconv_attribute</a> is the default option.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+Additionally there are three predefined option masks:
+</div>
+<div class="ulist">
+<ul>
+<li>
+<a id="parse_minimal"></a><code>parse_minimal</code> has all options turned off. This option mask means that pugixml does not add declaration nodes, document type declaration nodes, PI nodes, CDATA sections and comments to the resulting tree and does not perform any conversion for input data, so theoretically it is the fastest mode. However, as mentioned above, in practice <a href="#parse_default">parse_default</a> is usually equally fast.
+</li>
+<li>
+<a id="parse_default"></a><code>parse_default</code> is the default set of flags, i.e. it has all options set to their default values. 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.
+</li>
+<li>
+<a id="parse_full"></a><code>parse_full</code> is the set of flags which adds nodes of all types to the resulting tree and performs default conversions for input data. It includes parsing CDATA sections, comments, PI nodes, document declaration node and document type declaration node, 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 in this mode.
+</li>
+</ul>
+</div>
+<div class="paragraph">
+This is an example of using different parsing options (<a href="samples/load_options.cpp" class="bare">samples/load_options.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const char* source = &quot;&lt;!--comment--&gt;&lt;node&gt;&amp;lt;&lt;/node&gt;&quot;;
+
+// Parsing with default options; note that comment node is not added to the tree, and entity reference &amp;lt; is expanded
+doc.load_string(source);
+std::cout &lt;&lt; &quot;First node value: [&quot; &lt;&lt; doc.first_child().value() &lt;&lt; &quot;], node child value: [&quot; &lt;&lt; doc.child_value(&quot;node&quot;) &lt;&lt; &quot;]\n&quot;;
+
+// Parsing with additional parse_comments option; comment node is now added to the tree
+doc.load_string(source, pugi::parse_default | pugi::parse_comments);
+std::cout &lt;&lt; &quot;First node value: [&quot; &lt;&lt; doc.first_child().value() &lt;&lt; &quot;], node child value: [&quot; &lt;&lt; doc.child_value(&quot;node&quot;) &lt;&lt; &quot;]\n&quot;;
+
+// Parsing with additional parse_comments option and without the (default) parse_escapes option; &amp;lt; is not expanded
+doc.load_string(source, (pugi::parse_default | pugi::parse_comments) &amp; ~pugi::parse_escapes);
+std::cout &lt;&lt; &quot;First node value: [&quot; &lt;&lt; doc.first_child().value() &lt;&lt; &quot;], node child value: [&quot; &lt;&lt; doc.child_value(&quot;node&quot;) &lt;&lt; &quot;]\n&quot;;
+
+// Parsing with minimal option mask; comment node is not added to the tree, and &amp;lt; is not expanded
+doc.load_string(source, pugi::parse_minimal);
+std::cout &lt;&lt; &quot;First node value: [&quot; &lt;&lt; doc.first_child().value() &lt;&lt; &quot;], node child value: [&quot; &lt;&lt; doc.child_value(&quot;node&quot;) &lt;&lt; &quot;]\n&quot;;</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="loading.encoding"><a class="anchor" href="#loading.encoding"></a>4.6. Encodings</h3>
+<div id="xml_encoding" class="paragraph">
+pugixml supports all popular Unicode encodings (UTF-8, UTF-16 (big and little endian), UTF-32 (big and little endian); UCS-2 is naturally supported since it&#8217;s a strict subset of UTF-16) and handles all encoding conversions. Most loading functions accept the optional parameter <code>encoding</code>. This is a value of enumeration type <code>xml_encoding</code>, that can have the following values:
+</div>
+<div class="ulist">
+<ul>
+<li>
+<a id="encoding_auto"></a><code>encoding_auto</code> means that pugixml will try to guess the encoding based on source XML data. The algorithm is a modified version of the one presented in <a href="http://www.w3.org/TR/REC-xml/#sec-guessing-no-ext-info">Appendix F.1 of XML recommendation</a>; it tries to match the first few bytes of input data with the following patterns in strict order:
+<div class="ulist">
+<ul>
+<li>
+If first four bytes match UTF-32 BOM (Byte Order Mark), encoding is assumed to be UTF-32 with the endianness equal to that of BOM;
+</li>
+<li>
+If first two bytes match UTF-16 BOM, encoding is assumed to be UTF-16 with the endianness equal to that of BOM;
+</li>
+<li>
+If first three bytes match UTF-8 BOM, encoding is assumed to be UTF-8;
+</li>
+<li>
+If first four bytes match UTF-32 representation of <code>&lt;</code>, encoding is assumed to be UTF-32 with the corresponding endianness;
+</li>
+<li>
+If first four bytes match UTF-16 representation of <code>&lt;?</code>, encoding is assumed to be UTF-16 with the corresponding endianness;
+</li>
+<li>
+If first two bytes match UTF-16 representation of <code>&lt;</code>, encoding is assumed to be UTF-16 with the corresponding endianness (this guess may yield incorrect result, but it&#8217;s better than UTF-8);
+</li>
+<li>
+Otherwise encoding is assumed to be UTF-8.
+</li>
+</ul>
+</div>
+</li>
+<li>
+<a id="encoding_utf8"></a><code>encoding_utf8</code> corresponds to UTF-8 encoding as defined in the Unicode standard; UTF-8 sequences with length equal to 5 or 6 are not standard and are rejected.
+</li>
+<li>
+<a id="encoding_utf16_le"></a><code>encoding_utf16_le</code> corresponds to little-endian UTF-16 encoding as defined in the Unicode standard; surrogate pairs are supported.
+</li>
+<li>
+<a id="encoding_utf16_be"></a><code>encoding_utf16_be</code> corresponds to big-endian UTF-16 encoding as defined in the Unicode standard; surrogate pairs are supported.
+</li>
+<li>
+<a id="encoding_utf16"></a><code>encoding_utf16</code> corresponds to UTF-16 encoding as defined in the Unicode standard; the endianness is assumed to be that of the target platform.
+</li>
+<li>
+<a id="encoding_utf32_le"></a><code>encoding_utf32_le</code> corresponds to little-endian UTF-32 encoding as defined in the Unicode standard.
+</li>
+<li>
+<a id="encoding_utf32_be"></a><code>encoding_utf32_be</code> corresponds to big-endian UTF-32 encoding as defined in the Unicode standard.
+</li>
+<li>
+<a id="encoding_utf32"></a><code>encoding_utf32</code> corresponds to UTF-32 encoding as defined in the Unicode standard; the endianness is assumed to be that of the target platform.
+</li>
+<li>
+<a id="encoding_wchar"></a><code>encoding_wchar</code> corresponds to the encoding of <code>wchar_t</code> type; it has the same meaning as either <code>encoding_utf16</code> or <code>encoding_utf32</code>, depending on <code>wchar_t</code> size.
+</li>
+<li>
+<a id="encoding_latin1"></a><code>encoding_latin1</code> corresponds to ISO-8859-1 encoding (also known as Latin-1).
+</li>
+</ul>
+</div>
+<div class="paragraph">
+The algorithm used for <code>encoding_auto</code> correctly detects any supported Unicode encoding for all well-formed XML documents (since they start with document declaration) and for all other XML documents that start with <code>&lt;</code>; if your XML document does not start with <code>&lt;</code> and has encoding that is different from UTF-8, use the specific encoding.
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+The current behavior for Unicode conversion is to skip all invalid UTF sequences during conversion. This behavior should not be relied upon; moreover, in case no encoding conversion is performed, the invalid sequences are not removed, so you&#8217;ll get them as is in node/attribute contents.
+</td>
+</tr>
+</table>
+</div>
+</div>
+<div class="sect2">
+<h3 id="loading.w3c"><a class="anchor" href="#loading.w3c"></a>4.7. Conformance to W3C specification</h3>
+<div class="paragraph">
+pugixml is not fully W3C conformant - it can load any valid XML document, but does not perform some well-formedness checks. While considerable effort is made to reject invalid XML documents, some validation is not performed because of performance reasons.
+</div>
+<div class="paragraph">
+There is only one non-conformant behavior when dealing with valid XML documents: pugixml does not use information supplied in document type declaration for parsing. This means that entities declared in DOCTYPE are not expanded, and all attribute/PCDATA values are always processed in a uniform way that depends only on parsing options.
+</div>
+<div class="paragraph">
+As for rejecting invalid XML documents, there are a number of incompatibilities with W3C specification, including:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Multiple attributes of the same node can have equal names.
+</li>
+<li>
+All non-ASCII characters are treated in the same way as symbols of English alphabet, so some invalid tag names are not rejected.
+</li>
+<li>
+Attribute values which contain <code>&lt;</code> are not rejected.
+</li>
+<li>
+Invalid entity/character references are not rejected and are instead left as is.
+</li>
+<li>
+Comment values can contain <code>--</code>.
+</li>
+<li>
+XML data is not required to begin with document declaration; additionally, document declaration can appear after comments and other nodes.
+</li>
+<li>
+Invalid document type declarations are silently ignored in some cases.
+</li>
+</ul>
+</div>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="access"><a class="anchor" href="#access"></a>5. Accessing document data</h2>
+<div class="sectionbody">
+<div class="paragraph">
+pugixml features an extensive interface for getting various types of data from the document and for traversing the document. This section provides documentation for all such functions that do not modify the tree except for XPath-related functions; see <a href="#xpath">XPath</a> for XPath reference. As discussed in <a href="#dom.cpp">C&#43;&#43; interface</a>, there are two types of handles to tree data - <a href="#xml_node">xml_node</a> and <a href="#xml_attribute">xml_attribute</a>. The handles have special null (empty) values which propagate through various functions and thus are useful for writing more concise code; see <a href="#node_null">this description</a> for details. The documentation in this section will explicitly state the results of all function in case of null inputs.
+</div>
+<div class="sect2">
+<h3 id="access.basic"><a class="anchor" href="#access.basic"></a>5.1. Basic traversal functions</h3>
+<div class="paragraph">
+<a id="xml_node::parent"></a><a id="xml_node::first_child"></a><a id="xml_node::last_child"></a><a id="xml_node::next_sibling"></a><a id="xml_node::previous_sibling"></a><a id="xml_node::first_attribute"></a><a id="xml_node::last_attribute"></a><a id="xml_attribute::next_attribute"></a><a id="xml_attribute::previous_attribute"></a>
+The internal representation of the document is a tree, where each node has a list of child nodes (the order of children corresponds to their order in the XML representation), and additionally element nodes have a list of attributes, which is also ordered. Several functions are provided in order to let you get from one node in the tree to the other. These functions roughly correspond to the internal representation, and thus are usually building blocks for other methods of traversing (i.e. XPath traversals are based on these functions).
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_node xml_node::parent() const;
+xml_node xml_node::first_child() const;
+xml_node xml_node::last_child() const;
+xml_node xml_node::next_sibling() const;
+xml_node xml_node::previous_sibling() const;
+
+xml_attribute xml_node::first_attribute() const;
+xml_attribute xml_node::last_attribute() const;
+xml_attribute xml_attribute::next_attribute() const;
+xml_attribute xml_attribute::previous_attribute() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>parent</code> function returns the node&#8217;s parent; all non-null nodes except the document have non-null parent. <code>first_child</code> and <code>last_child</code> return the first and last child of the node, respectively; note that only document nodes and element nodes can have non-empty child node list. If node has no children, both functions return null nodes. <code>next_sibling</code> and <code>previous_sibling</code> return the node that&#8217;s immediately to the right/left of this node in the children list, respectively - for example, in <code>&lt;a/&gt;&lt;b/&gt;&lt;c/&gt;</code>, calling <code>next_sibling</code> for a handle that points to <code>&lt;b/&gt;</code> results in a handle pointing to <code>&lt;c/&gt;</code>, and calling <code>previous_sibling</code> results in handle pointing to <code>&lt;a/&gt;</code>. If node does not have next/previous sibling (this happens if it is the last/first node in the list, respectively), the functions return null nodes. <code>first_attribute</code>, <code>last_attribute</code>, <code>next_attribute</code> and <code>previous_attribute</code> functions behave similarly to the corresponding child node functions and allow to iterate through attribute list in the same way.
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+Because of memory consumption reasons, attributes do not have a link to their parent nodes. Thus there is no <code>xml_attribute::parent()</code> function.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+Calling any of the functions above on the null handle results in a null handle - i.e. <code>node.first_child().next_sibling()</code> returns the second child of <code>node</code>, and null handle if <code>node</code> is null, has no children at all or if it has only one child node.
+</div>
+<div class="paragraph">
+With these functions, you can iterate through all child nodes and display all attributes like this (<a href="samples/traverse_base.cpp" class="bare">samples/traverse_base.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">for (pugi::xml_node tool = tools.first_child(); tool; tool = tool.next_sibling())
+{
+ std::cout &lt;&lt; &quot;Tool:&quot;;
+
+ for (pugi::xml_attribute attr = tool.first_attribute(); attr; attr = attr.next_attribute())
+ {
+ std::cout &lt;&lt; &quot; &quot; &lt;&lt; attr.name() &lt;&lt; &quot;=&quot; &lt;&lt; attr.value();
+ }
+
+ std::cout &lt;&lt; std::endl;
+}</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="access.nodedata"><a class="anchor" href="#access.nodedata"></a>5.2. Getting node data</h3>
+<div class="paragraph">
+<a id="xml_node::name"></a><a id="xml_node::value"></a>
+Apart from structural information (parent, child nodes, attributes), nodes can have name and value, both of which are strings. Depending on node type, name or value may be absent. <a href="#node_document">node_document</a> nodes do not have a name or value, <a href="#node_element">node_element</a> and <a href="#node_declaration">node_declaration</a> nodes always have a name but never have a value, <a href="#node_pcdata">node_pcdata</a>, <a href="#node_cdata">node_cdata</a>, <a href="#node_comment">node_comment</a> and <a href="#node_doctype">node_doctype</a> nodes never have a name but always have a value (it may be empty though), <a href="#node_pi">node_pi</a> nodes always have a name and a value (again, value may be empty). In order to get node&#8217;s name or value, you can use the following functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const char_t* xml_node::name() const;
+const char_t* xml_node::value() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+In case node does not have a name or value or if the node handle is null, both functions return empty strings - they never return null pointers.
+</div>
+<div id="xml_node::child_value" class="paragraph">
+It is common to store data as text contents of some node - i.e. <code>&lt;node&gt;&lt;description&gt;This is a node&lt;/description&gt;&lt;/node&gt;</code>. In this case, <code>&lt;description&gt;</code> node does not have a value, but instead has a child of type <a href="#node_pcdata">node_pcdata</a> with value <code>"This is a node"</code>. pugixml provides several helper functions to parse such data:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const char_t* xml_node::child_value() const;
+const char_t* xml_node::child_value(const char_t* name) const;
+xml_text xml_node::text() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>child_value()</code> returns the value of the first child with type <a href="#node_pcdata">node_pcdata</a> or <a href="#node_cdata">node_cdata</a>; <code>child_value(name)</code> is a simple wrapper for <code>child(name).child_value()</code>. For the above example, calling <code>node.child_value("description")</code> and <code>description.child_value()</code> will both produce string <code>"This is a node"</code>. If there is no child with relevant type, or if the handle is null, <code>child_value</code> functions return empty string.
+</div>
+<div class="paragraph">
+<code>text()</code> returns a special object that can be used for working with PCDATA contents in more complex cases than just retrieving the value; it is described in <a href="#access.text">Working with text contents</a> sections.
+</div>
+<div class="paragraph">
+There is an example of using some of these functions <a href="#code_traverse_base_data">at the end of the next section</a>.
+</div>
+</div>
+<div class="sect2">
+<h3 id="access.attrdata"><a class="anchor" href="#access.attrdata"></a>5.3. Getting attribute data</h3>
+<div class="paragraph">
+<a id="xml_attribute::name"></a><a id="xml_attribute::value"></a>
+All attributes have name and value, both of which are strings (value may be empty). There are two corresponding accessors, like for <code>xml_node</code>:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const char_t* xml_attribute::name() const;
+const char_t* xml_attribute::value() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+In case the attribute handle is null, both functions return empty strings - they never return null pointers.
+</div>
+<div id="xml_attribute::as_string" class="paragraph">
+If you need a non-empty string if the attribute handle is null (for example, you need to get the option value from XML attribute, but if it is not specified, you need it to default to <code>"sorted"</code> instead of <code>""</code>), you can use <code>as_string</code> accessor:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const char_t* xml_attribute::as_string(const char_t* def = &quot;&quot;) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+It returns <code>def</code> argument if the attribute handle is null. If you do not specify the argument, the function is equivalent to <code>value()</code>.
+</div>
+<div class="paragraph">
+<a id="xml_attribute::as_int"></a><a id="xml_attribute::as_uint"></a><a id="xml_attribute::as_double"></a><a id="xml_attribute::as_float"></a><a id="xml_attribute::as_bool"></a><a id="xml_attribute::as_llong"></a><a id="xml_attribute::as_ullong"></a>
+In many cases attribute values have types that are not strings - i.e. an attribute may always contain values that should be treated as integers, despite the fact that they are represented as strings in XML. pugixml provides several accessors that convert attribute value to some other type:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">int xml_attribute::as_int(int def = 0) const;
+unsigned int xml_attribute::as_uint(unsigned int def = 0) const;
+double xml_attribute::as_double(double def = 0) const;
+float xml_attribute::as_float(float def = 0) const;
+bool xml_attribute::as_bool(bool def = false) const;
+long long xml_attribute::as_llong(long long def = 0) const;
+unsigned long long xml_attribute::as_ullong(unsigned long long def = 0) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>as_int</code>, <code>as_uint</code>, <code>as_llong</code>, <code>as_ullong</code>, <code>as_double</code> and <code>as_float</code> convert attribute values to numbers. If attribute handle is null or attribute value is empty, <code>def</code> argument is returned (which is 0 by default). Otherwise, all leading whitespace characters are truncated, and the remaining string is parsed as an integer number in either decimal or hexadecimal form (applicable to <code>as_int</code>, <code>as_uint</code>, <code>as_llong</code> and <code>as_ullong</code>; hexadecimal format is used if the number has <code>0x</code> or <code>0X</code> prefix) or as a floating point number in either decimal or scientific form (<code>as_double</code> or <code>as_float</code>). Any extra characters are silently discarded, i.e. <code>as_int</code> will return <code>1</code> for string <code>"1abc"</code>.
+</div>
+<div class="paragraph">
+In case the input string contains a number that is out of the target numeric range, the result is undefined.
+</div>
+<div class="admonitionblock caution">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Caution</div>
+</td>
+<td class="content">
+Number conversion functions depend on current C locale as set with <code>setlocale</code>, so may return unexpected results if the locale is different from <code>"C"</code>.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+<code>as_bool</code> converts attribute value to boolean as follows: if attribute handle is null, <code>def</code> argument is returned (which is <code>false</code> by default). If attribute value is empty, <code>false</code> is returned. Otherwise, <code>true</code> is returned if the first character is one of <code>'1', 't', 'T', 'y', 'Y'</code>. This means that strings like <code>"true"</code> and <code>"yes"</code> are recognized as <code>true</code>, while strings like <code>"false"</code> and <code>"no"</code> are recognized as <code>false</code>. For more complex matching you&#8217;ll have to write your own function.
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+<code>as_llong</code> and <code>as_ullong</code> are only available if your platform has reliable support for the <code>long long</code> type, including string conversions.
+</td>
+</tr>
+</table>
+</div>
+<div id="code_traverse_base_data" class="paragraph">
+This is an example of using these functions, along with node data retrieval ones (<a href="samples/traverse_base.cpp" class="bare">samples/traverse_base.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">for (pugi::xml_node tool = tools.child(&quot;Tool&quot;); tool; tool = tool.next_sibling(&quot;Tool&quot;))
+{
+ std::cout &lt;&lt; &quot;Tool &quot; &lt;&lt; tool.attribute(&quot;Filename&quot;).value();
+ std::cout &lt;&lt; &quot;: AllowRemote &quot; &lt;&lt; tool.attribute(&quot;AllowRemote&quot;).as_bool();
+ std::cout &lt;&lt; &quot;, Timeout &quot; &lt;&lt; tool.attribute(&quot;Timeout&quot;).as_int();
+ std::cout &lt;&lt; &quot;, Description &#39;&quot; &lt;&lt; tool.child_value(&quot;Description&quot;) &lt;&lt; &quot;&#39;\n&quot;;
+}</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="access.contents"><a class="anchor" href="#access.contents"></a>5.4. Contents-based traversal functions</h3>
+<div class="paragraph">
+<a id="xml_node::child"></a><a id="xml_node::attribute"></a><a id="xml_node::next_sibling_name"></a><a id="xml_node::previous_sibling_name"></a>
+Since a lot of document traversal consists of finding the node/attribute with the correct name, there are special functions for that purpose:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_node xml_node::child(const char_t* name) const;
+xml_attribute xml_node::attribute(const char_t* name) const;
+xml_node xml_node::next_sibling(const char_t* name) const;
+xml_node xml_node::previous_sibling(const char_t* name) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>child</code> and <code>attribute</code> return the first child/attribute with the specified name; <code>next_sibling</code> and <code>previous_sibling</code> return the first sibling in the corresponding direction with the specified name. All string comparisons are case-sensitive. In case the node handle is null or there is no node/attribute with the specified name, null handle is returned.
+</div>
+<div class="paragraph">
+<code>child</code> and <code>next_sibling</code> functions can be used together to loop through all child nodes with the desired name like this:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">for (pugi::xml_node tool = tools.child(&quot;Tool&quot;); tool; tool = tool.next_sibling(&quot;Tool&quot;))</code></pre>
+</div>
+</div>
+<div id="xml_node::find_child_by_attribute" class="paragraph">
+Occasionally the needed node is specified not by the unique name but instead by the value of some attribute; for example, it is common to have node collections with each node having a unique id: <code>&lt;group&gt;&lt;item id="1"/&gt; &lt;item id="2"/&gt;&lt;/group&gt;</code>. There are two functions for finding child nodes based on the attribute values:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_node xml_node::find_child_by_attribute(const char_t* name, const char_t* attr_name, const char_t* attr_value) const;
+xml_node xml_node::find_child_by_attribute(const char_t* attr_name, const char_t* attr_value) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+The three-argument function returns the first child node with the specified name which has an attribute with the specified name/value; the two-argument function skips the name test for the node, which can be useful for searching in heterogeneous collections. If the node handle is null or if no node is found, null handle is returned. All string comparisons are case-sensitive.
+</div>
+<div class="paragraph">
+In all of the above functions, all arguments have to be valid strings; passing null pointers results in undefined behavior.
+</div>
+<div class="paragraph">
+This is an example of using these functions (<a href="samples/traverse_base.cpp" class="bare">samples/traverse_base.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">std::cout &lt;&lt; &quot;Tool for *.dae generation: &quot; &lt;&lt; tools.find_child_by_attribute(&quot;Tool&quot;, &quot;OutputFileMasks&quot;, &quot;*.dae&quot;).attribute(&quot;Filename&quot;).value() &lt;&lt; &quot;\n&quot;;
+
+for (pugi::xml_node tool = tools.child(&quot;Tool&quot;); tool; tool = tool.next_sibling(&quot;Tool&quot;))
+{
+ std::cout &lt;&lt; &quot;Tool &quot; &lt;&lt; tool.attribute(&quot;Filename&quot;).value() &lt;&lt; &quot;\n&quot;;
+}</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="access.rangefor"><a class="anchor" href="#access.rangefor"></a>5.5. Range-based for-loop support</h3>
+<div class="paragraph">
+<a id="xml_node::children"></a><a id="xml_node::attributes"></a>
+If your C&#43;&#43; compiler supports range-based for-loop (this is a C&#43;&#43;11 feature, at the time of writing it&#8217;s supported by Microsoft Visual Studio 2012+, GCC 4.6+ and Clang 3.0+), you can use it to enumerate nodes/attributes. Additional helpers are provided to support this; note that they are also compatible with <a href="http://www.boost.org/libs/foreach/">Boost Foreach</a>, and possibly other pre-C&#43;&#43;11 foreach facilities.
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">implementation-defined-type xml_node::children() const;
+implementation-defined-type xml_node::children(const char_t* name) const;
+implementation-defined-type xml_node::attributes() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>children</code> function allows you to enumerate all child nodes; <code>children</code> function with <code>name</code> argument allows you to enumerate all child nodes with a specific name; <code>attributes</code> function allows you to enumerate all attributes of the node. Note that you can also use node object itself in a range-based for construct, which is equivalent to using <code>children()</code>.
+</div>
+<div class="paragraph">
+This is an example of using these functions (<a href="samples/traverse_rangefor.cpp" class="bare">samples/traverse_rangefor.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">for (pugi::xml_node tool: tools.children(&quot;Tool&quot;))
+{
+ std::cout &lt;&lt; &quot;Tool:&quot;;
+
+ for (pugi::xml_attribute attr: tool.attributes())
+ {
+ std::cout &lt;&lt; &quot; &quot; &lt;&lt; attr.name() &lt;&lt; &quot;=&quot; &lt;&lt; attr.value();
+ }
+
+ for (pugi::xml_node child: tool.children())
+ {
+ std::cout &lt;&lt; &quot;, child &quot; &lt;&lt; child.name();
+ }
+
+ std::cout &lt;&lt; std::endl;
+}</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="access.iterators"><a class="anchor" href="#access.iterators"></a>5.6. Traversing node/attribute lists via iterators</h3>
+<div class="paragraph">
+<a id="xml_node_iterator"></a><a id="xml_attribute_iterator"></a><a id="xml_node::begin"></a><a id="xml_node::end"></a><a id="xml_node::attributes_begin"></a><a id="xml_node::attributes_end"></a>
+Child node lists and attribute lists are simply double-linked lists; while you can use <code>previous_sibling</code>/<code>next_sibling</code> and other such functions for iteration, pugixml additionally provides node and attribute iterators, so that you can treat nodes as containers of other nodes or attributes:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">class xml_node_iterator;
+class xml_attribute_iterator;
+
+typedef xml_node_iterator xml_node::iterator;
+iterator xml_node::begin() const;
+iterator xml_node::end() const;
+
+typedef xml_attribute_iterator xml_node::attribute_iterator;
+attribute_iterator xml_node::attributes_begin() const;
+attribute_iterator xml_node::attributes_end() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>begin</code> and <code>attributes_begin</code> return iterators that point to the first node/attribute, respectively; <code>end</code> and <code>attributes_end</code> return past-the-end iterator for node/attribute list, respectively - this iterator can&#8217;t be dereferenced, but decrementing it results in an iterator pointing to the last element in the list (except for empty lists, where decrementing past-the-end iterator results in undefined behavior). Past-the-end iterator is commonly used as a termination value for iteration loops (see sample below). If you want to get an iterator that points to an existing handle, you can construct the iterator with the handle as a single constructor argument, like so: <code>xml_node_iterator(node)</code>. For <code>xml_attribute_iterator</code>, you&#8217;ll have to provide both an attribute and its parent node.
+</div>
+<div class="paragraph">
+<code>begin</code> and <code>end</code> return equal iterators if called on null node; such iterators can&#8217;t be dereferenced. <code>attributes_begin</code> and <code>attributes_end</code> behave the same way. For correct iterator usage this means that child node/attribute collections of null nodes appear to be empty.
+</div>
+<div class="paragraph">
+Both types of iterators have bidirectional iterator semantics (i.e. they can be incremented and decremented, but efficient random access is not supported) and support all usual iterator operations - comparison, dereference, etc. The iterators are invalidated if the node/attribute objects they&#8217;re pointing to are removed from the tree; adding nodes/attributes does not invalidate any iterators.
+</div>
+<div class="paragraph">
+Here is an example of using iterators for document traversal (<a href="samples/traverse_iter.cpp" class="bare">samples/traverse_iter.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">for (pugi::xml_node_iterator it = tools.begin(); it != tools.end(); ++it)
+{
+ std::cout &lt;&lt; &quot;Tool:&quot;;
+
+ for (pugi::xml_attribute_iterator ait = it-&gt;attributes_begin(); ait != it-&gt;attributes_end(); ++ait)
+ {
+ std::cout &lt;&lt; &quot; &quot; &lt;&lt; ait-&gt;name() &lt;&lt; &quot;=&quot; &lt;&lt; ait-&gt;value();
+ }
+
+ std::cout &lt;&lt; std::endl;
+}</code></pre>
+</div>
+</div>
+<div class="admonitionblock caution">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Caution</div>
+</td>
+<td class="content">
+Node and attribute iterators are somewhere in the middle between const and non-const iterators. While dereference operation yields a non-constant reference to the object, so that you can use it for tree modification operations, modifying this reference using assignment - i.e. passing iterators to a function like <code>std::sort</code> - will not give expected results, as assignment modifies local handle that&#8217;s stored in the iterator.
+</td>
+</tr>
+</table>
+</div>
+</div>
+<div class="sect2">
+<h3 id="access.walker"><a class="anchor" href="#access.walker"></a>5.7. Recursive traversal with xml_tree_walker</h3>
+<div id="xml_tree_walker" class="paragraph">
+The methods described above allow traversal of immediate children of some node; if you want to do a deep tree traversal, you&#8217;ll have to do it via a recursive function or some equivalent method. However, pugixml provides a helper for depth-first traversal of a subtree. In order to use it, you have to implement <code>xml_tree_walker</code> interface and to call <code>traverse</code> function:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">class xml_tree_walker
+{
+public:
+ virtual bool begin(xml_node&amp; node);
+ virtual bool for_each(xml_node&amp; node) = 0;
+ virtual bool end(xml_node&amp; node);
+
+ int depth() const;
+};
+
+bool xml_node::traverse(xml_tree_walker&amp; walker);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<a id="xml_tree_walker::begin"></a><a id="xml_tree_walker::for_each"></a><a id="xml_tree_walker::end"></a><a id="xml_node::traverse"></a>
+The traversal is launched by calling <code>traverse</code> function on traversal root and proceeds as follows:
+</div>
+<div class="ulist">
+<ul>
+<li>
+First, <code>begin</code> function is called with traversal root as its argument.
+</li>
+<li>
+Then, <code>for_each</code> function is called for all nodes in the traversal subtree in depth first order, excluding the traversal root. Node is passed as an argument.
+</li>
+<li>
+Finally, <code>end</code> function is called with traversal root as its argument.
+</li>
+</ul>
+</div>
+<div class="paragraph">
+If <code>begin</code>, <code>end</code> or any of the <code>for_each</code> calls return <code>false</code>, the traversal is terminated and <code>false</code> is returned as the traversal result; otherwise, the traversal results in <code>true</code>. Note that you don&#8217;t have to override <code>begin</code> or <code>end</code> functions; their default implementations return <code>true</code>.
+</div>
+<div id="xml_tree_walker::depth" class="paragraph">
+You can get the node&#8217;s depth relative to the traversal root at any point by calling <code>depth</code> function. It returns <code>-1</code> if called from <code>begin</code>/<code>end</code>, and returns 0-based depth if called from <code>for_each</code> - depth is 0 for all children of the traversal root, 1 for all grandchildren and so on.
+</div>
+<div class="paragraph">
+This is an example of traversing tree hierarchy with xml_tree_walker (<a href="samples/traverse_walker.cpp" class="bare">samples/traverse_walker.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">struct simple_walker: pugi::xml_tree_walker
+{
+ virtual bool for_each(pugi::xml_node&amp; node)
+ {
+ for (int i = 0; i &lt; depth(); ++i) std::cout &lt;&lt; &quot; &quot;; // indentation
+
+ std::cout &lt;&lt; node_types[node.type()] &lt;&lt; &quot;: name=&#39;&quot; &lt;&lt; node.name() &lt;&lt; &quot;&#39;, value=&#39;&quot; &lt;&lt; node.value() &lt;&lt; &quot;&#39;\n&quot;;
+
+ return true; // continue traversal
+ }
+};</code></pre>
+</div>
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">simple_walker walker;
+doc.traverse(walker);</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="access.predicate"><a class="anchor" href="#access.predicate"></a>5.8. Searching for nodes/attributes with predicates</h3>
+<div class="paragraph">
+<a id="xml_node::find_attribute"></a><a id="xml_node::find_child"></a><a id="xml_node::find_node"></a>
+While there are existing functions for getting a node/attribute with known contents, they are often not sufficient for simple queries. As an alternative for manual iteration through nodes/attributes until the needed one is found, you can make a predicate and call one of <code>find_</code> functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">template &lt;typename Predicate&gt; xml_attribute xml_node::find_attribute(Predicate pred) const;
+template &lt;typename Predicate&gt; xml_node xml_node::find_child(Predicate pred) const;
+template &lt;typename Predicate&gt; xml_node xml_node::find_node(Predicate pred) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+The predicate should be either a plain function or a function object which accepts one argument of type <code>xml_attribute</code> (for <code>find_attribute</code>) or <code>xml_node</code> (for <code>find_child</code> and <code>find_node</code>), and returns <code>bool</code>. The predicate is never called with null handle as an argument.
+</div>
+<div class="paragraph">
+<code>find_attribute</code> function iterates through all attributes of the specified node, and returns the first attribute for which the predicate returned <code>true</code>. If the predicate returned <code>false</code> for all attributes or if there were no attributes (including the case where the node is null), null attribute is returned.
+</div>
+<div class="paragraph">
+<code>find_child</code> function iterates through all child nodes of the specified node, and returns the first node for which the predicate returned <code>true</code>. If the predicate returned <code>false</code> for all nodes or if there were no child nodes (including the case where the node is null), null node is returned.
+</div>
+<div class="paragraph">
+<code>find_node</code> function performs a depth-first traversal through the subtree of the specified node (excluding the node itself), and returns the first node for which the predicate returned <code>true</code>. If the predicate returned <code>false</code> for all nodes or if subtree was empty, null node is returned.
+</div>
+<div class="paragraph">
+This is an example of using predicate-based functions (<a href="samples/traverse_predicate.cpp" class="bare">samples/traverse_predicate.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool small_timeout(pugi::xml_node node)
+{
+ return node.attribute(&quot;Timeout&quot;).as_int() &lt; 20;
+}
+
+struct allow_remote_predicate
+{
+ bool operator()(pugi::xml_attribute attr) const
+ {
+ return strcmp(attr.name(), &quot;AllowRemote&quot;) == 0;
+ }
+
+ bool operator()(pugi::xml_node node) const
+ {
+ return node.attribute(&quot;AllowRemote&quot;).as_bool();
+ }
+};</code></pre>
+</div>
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// Find child via predicate (looks for direct children only)
+std::cout &lt;&lt; tools.find_child(allow_remote_predicate()).attribute(&quot;Filename&quot;).value() &lt;&lt; std::endl;
+
+// Find node via predicate (looks for all descendants in depth-first order)
+std::cout &lt;&lt; doc.find_node(allow_remote_predicate()).attribute(&quot;Filename&quot;).value() &lt;&lt; std::endl;
+
+// Find attribute via predicate
+std::cout &lt;&lt; tools.last_child().find_attribute(allow_remote_predicate()).value() &lt;&lt; std::endl;
+
+// We can use simple functions instead of function objects
+std::cout &lt;&lt; tools.find_child(small_timeout).attribute(&quot;Filename&quot;).value() &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="access.text"><a class="anchor" href="#access.text"></a>5.9. Working with text contents</h3>
+<div id="xml_text" class="paragraph">
+It is common to store data as text contents of some node - i.e. <code>&lt;node&gt;&lt;description&gt;This is a node&lt;/description&gt;&lt;/node&gt;</code>. In this case, <code>&lt;description&gt;</code> node does not have a value, but instead has a child of type <a href="#node_pcdata">node_pcdata</a> with value <code>"This is a node"</code>. pugixml provides a special class, <code>xml_text</code>, to work with such data. Working with text objects to modify data is described in <a href="#modify.text">the documentation for modifying document data</a>; this section describes the access interface of <code>xml_text</code>.
+</div>
+<div id="xml_node::text" class="paragraph">
+You can get the text object from a node by using <code>text()</code> method:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_text xml_node::text() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+If the node has a type <code>node_pcdata</code> or <code>node_cdata</code>, then the node itself is used to return data; otherwise, a first child node of type <code>node_pcdata</code> or <code>node_cdata</code> is used.
+</div>
+<div class="paragraph">
+<a id="xml_text::empty"></a><a id="xml_text::unspecified_bool_type"></a>
+You can check if the text object is bound to a valid PCDATA/CDATA node by using it as a boolean value, i.e. <code>if (text) { &#8230;&#8203; }</code> or <code>if (!text) { &#8230;&#8203; }</code>. Alternatively you can check it by using the <code>empty()</code> method:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xml_text::empty() const;</code></pre>
+</div>
+</div>
+<div id="xml_text::get" class="paragraph">
+Given a text object, you can get the contents (i.e. the value of PCDATA/CDATA node) by using the following function:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const char_t* xml_text::get() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+In case text object is empty, the function returns an empty string - it never returns a null pointer.
+</div>
+<div class="paragraph">
+<a id="xml_text::as_string"></a><a id="xml_text::as_int"></a><a id="xml_text::as_uint"></a><a id="xml_text::as_double"></a><a id="xml_text::as_float"></a><a id="xml_text::as_bool"></a><a id="xml_text::as_llong"></a><a id="xml_text::as_ullong"></a>
+If you need a non-empty string if the text object is empty, or if the text contents is actually a number or a boolean that is stored as a string, you can use the following accessors:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const char_t* xml_text::as_string(const char_t* def = &quot;&quot;) const;
+int xml_text::as_int(int def = 0) const;
+unsigned int xml_text::as_uint(unsigned int def = 0) const;
+double xml_text::as_double(double def = 0) const;
+float xml_text::as_float(float def = 0) const;
+bool xml_text::as_bool(bool def = false) const;
+long long xml_text::as_llong(long long def = 0) const;
+unsigned long long xml_text::as_ullong(unsigned long long def = 0) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+All of the above functions have the same semantics as similar <code>xml_attribute</code> members: they return the default argument if the text object is empty, they convert the text contents to a target type using the same rules and restrictions. You can <a href="#xml_attribute::as_int">refer to documentation for the attribute functions</a> for details.
+</div>
+<div id="xml_text::data" class="paragraph">
+<code>xml_text</code> is essentially a helper class that operates on <code>xml_node</code> values. It is bound to a node of type <a href="#node_pcdata">node_pcdata</a> or <a href="#node_cdata">node_cdata</a>. You can use the following function to retrieve this node:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_node xml_text::data() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Essentially, assuming <code>text</code> is an <code>xml_text</code> object, calling <code>text.get()</code> is equivalent to calling <code>text.data().value()</code>.
+</div>
+<div class="paragraph">
+This is an example of using <code>xml_text</code> object (<a href="samples/text.cpp" class="bare">samples/text.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">std::cout &lt;&lt; &quot;Project name: &quot; &lt;&lt; project.child(&quot;name&quot;).text().get() &lt;&lt; std::endl;
+std::cout &lt;&lt; &quot;Project version: &quot; &lt;&lt; project.child(&quot;version&quot;).text().as_double() &lt;&lt; std::endl;
+std::cout &lt;&lt; &quot;Project visibility: &quot; &lt;&lt; (project.child(&quot;public&quot;).text().as_bool(/* def= */ true) ? &quot;public&quot; : &quot;private&quot;) &lt;&lt; std::endl;
+std::cout &lt;&lt; &quot;Project description: &quot; &lt;&lt; project.child(&quot;description&quot;).text().get() &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="access.misc"><a class="anchor" href="#access.misc"></a>5.10. Miscellaneous functions</h3>
+<div id="xml_node::root" class="paragraph">
+If you need to get the document root of some node, you can use the following function:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_node xml_node::root() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+This function returns the node with type <a href="#node_document">node_document</a>, which is the root node of the document the node belongs to (unless the node is null, in which case null node is returned).
+</div>
+<div class="paragraph">
+<a id="xml_node::path"></a><a id="xml_node::first_element_by_path"></a>
+While pugixml supports complex XPath expressions, sometimes a simple path handling facility is needed. There are two functions, for getting node path and for converting path to a node:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">string_t xml_node::path(char_t delimiter = &#39;/&#39;) const;
+xml_node xml_node::first_element_by_path(const char_t* path, char_t delimiter = &#39;/&#39;) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Node paths consist of node names, separated with a delimiter (which is <code>/</code> by default); also paths can contain self (<code>.</code>) and parent (<code>..</code>) pseudo-names, so that this is a valid path: <code>"../../foo/./bar"</code>. <code>path</code> returns the path to the node from the document root, <code>first_element_by_path</code> looks for a node represented by a given path; a path can be an absolute one (absolute paths start with the delimiter), in which case the rest of the path is treated as document root relative, and relative to the given node. For example, in the following document: <code>&lt;a&gt;&lt;b&gt;&lt;c/&gt;&lt;/b&gt;&lt;/a&gt;</code>, node <code>&lt;c/&gt;</code> has path <code>"a/b/c"</code>; calling <code>first_element_by_path</code> for document with path <code>"a/b"</code> results in node <code>&lt;b/&gt;</code>; calling <code>first_element_by_path</code> for node <code>&lt;a/&gt;</code> with path <code>"../a/./b/../."</code> results in node <code>&lt;a/&gt;</code>; calling <code>first_element_by_path</code> with path <code>"/a"</code> results in node <code>&lt;a/&gt;</code> for any node.
+</div>
+<div class="paragraph">
+In case path component is ambiguous (if there are two nodes with given name), the first one is selected; paths are not guaranteed to uniquely identify nodes in a document. If any component of a path is not found, the result of <code>first_element_by_path</code> is null node; also <code>first_element_by_path</code> returns null node for null nodes, in which case the path does not matter. <code>path</code> returns an empty string for null nodes.
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+<code>path</code> function returns the result as STL string, and thus is not available if <a href="#PUGIXML_NO_STL">PUGIXML_NO_STL</a> is defined.
+</td>
+</tr>
+</table>
+</div>
+<div id="xml_node::offset_debug" class="paragraph">
+pugixml does not record row/column information for nodes upon parsing for efficiency reasons. However, if the node has not changed in a significant way since parsing (the name/value are not changed, and the node itself is the original one, i.e. it was not deleted from the tree and re-added later), it is possible to get the offset from the beginning of XML buffer:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">ptrdiff_t xml_node::offset_debug() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+If the offset is not available (this happens if the node is null, was not originally parsed from a stream, or has changed in a significant way), the function returns -1. Otherwise it returns the offset to node&#8217;s data from the beginning of XML buffer in <a href="#char_t">pugi::char_t</a> units. For more information on parsing offsets, see <a href="#xml_parse_result::offset">parsing error handling documentation</a>.
+</div>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="modify"><a class="anchor" href="#modify"></a>6. Modifying document data</h2>
+<div class="sectionbody">
+<div class="paragraph">
+The document in pugixml is fully mutable: you can completely change the document structure and modify the data of nodes/attributes. This section provides documentation for the relevant functions. All functions take care of memory management and structural integrity themselves, so they always result in structurally valid tree - however, it is possible to create an invalid XML tree (for example, by adding two attributes with the same name or by setting attribute/node name to empty/invalid string). Tree modification is optimized for performance and for memory consumption, so if you have enough memory you can create documents from scratch with pugixml and later save them to file/stream instead of relying on error-prone manual text writing and without too much overhead.
+</div>
+<div class="paragraph">
+All member functions that change node/attribute data or structure are non-constant and thus can not be called on constant handles. However, you can easily convert constant handle to non-constant one by simple assignment: <code>void foo(const pugi::xml_node&amp; n) { pugi::xml_node nc = n; }</code>, so const-correctness here mainly provides additional documentation.
+</div>
+<div class="sect2">
+<h3 id="modify.nodedata"><a class="anchor" href="#modify.nodedata"></a>6.1. Setting node data</h3>
+<div class="paragraph">
+<a id="xml_node::set_name"></a><a id="xml_node::set_value"></a>
+As discussed before, nodes can have name and value, both of which are strings. Depending on node type, name or value may be absent. <a href="#node_document">node_document</a> nodes do not have a name or value, <a href="#node_element">node_element</a> and <a href="#node_declaration">node_declaration</a> nodes always have a name but never have a value, <a href="#node_pcdata">node_pcdata</a>, <a href="#node_cdata">node_cdata</a>, <a href="#node_comment">node_comment</a> and <a href="#node_doctype">node_doctype</a> nodes never have a name but always have a value (it may be empty though), <a href="#node_pi">node_pi</a> nodes always have a name and a value (again, value may be empty). In order to set node&#8217;s name or value, you can use the following functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xml_node::set_name(const char_t* rhs);
+bool xml_node::set_value(const char_t* rhs);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Both functions try to set the name/value to the specified string, and return the operation result. The operation fails if the node can not have name or value (for instance, when trying to call <code>set_name</code> on a <a href="#node_pcdata">node_pcdata</a> node), if the node handle is null, or if there is insufficient memory to handle the request. The provided string is copied into document managed memory and can be destroyed after the function returns (for example, you can safely pass stack-allocated buffers to these functions). The name/value content is not verified, so take care to use only valid XML names, or the document may become malformed.
+</div>
+<div class="paragraph">
+This is an example of setting node name and value (<a href="samples/modify_base.cpp" class="bare">samples/modify_base.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">pugi::xml_node node = doc.child(&quot;node&quot;);
+
+// change node name
+std::cout &lt;&lt; node.set_name(&quot;notnode&quot;);
+std::cout &lt;&lt; &quot;, new node name: &quot; &lt;&lt; node.name() &lt;&lt; std::endl;
+
+// change comment text
+std::cout &lt;&lt; doc.last_child().set_value(&quot;useless comment&quot;);
+std::cout &lt;&lt; &quot;, new comment text: &quot; &lt;&lt; doc.last_child().value() &lt;&lt; std::endl;
+
+// we can&#39;t change value of the element or name of the comment
+std::cout &lt;&lt; node.set_value(&quot;1&quot;) &lt;&lt; &quot;, &quot; &lt;&lt; doc.last_child().set_name(&quot;2&quot;) &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="modify.attrdata"><a class="anchor" href="#modify.attrdata"></a>6.2. Setting attribute data</h3>
+<div class="paragraph">
+<a id="xml_attribute::set_name"></a><a id="xml_attribute::set_value"></a>
+All attributes have name and value, both of which are strings (value may be empty). You can set them with the following functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xml_attribute::set_name(const char_t* rhs);
+bool xml_attribute::set_value(const char_t* rhs);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Both functions try to set the name/value to the specified string, and return the operation result. The operation fails if the attribute handle is null, or if there is insufficient memory to handle the request. The provided string is copied into document managed memory and can be destroyed after the function returns (for example, you can safely pass stack-allocated buffers to these functions). The name/value content is not verified, so take care to use only valid XML names, or the document may become malformed.
+</div>
+<div class="paragraph">
+In addition to string functions, several functions are provided for handling attributes with numbers and booleans as values:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xml_attribute::set_value(int rhs);
+bool xml_attribute::set_value(unsigned int rhs);
+bool xml_attribute::set_value(double rhs);
+bool xml_attribute::set_value(float rhs);
+bool xml_attribute::set_value(bool rhs);
+bool xml_attribute::set_value(long long rhs);
+bool xml_attribute::set_value(unsigned long long rhs);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+The above functions convert the argument to string and then call the base <code>set_value</code> function. Integers are converted to a decimal form, floating-point numbers are converted to either decimal or scientific form, depending on the number magnitude, boolean values are converted to either <code>"true"</code> or <code>"false"</code>.
+</div>
+<div class="admonitionblock caution">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Caution</div>
+</td>
+<td class="content">
+Number conversion functions depend on current C locale as set with <code>setlocale</code>, so may generate unexpected results if the locale is different from <code>"C"</code>.
+</td>
+</tr>
+</table>
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+<code>set_value</code> overloads with <code>long long</code> type are only available if your platform has reliable support for the type, including string conversions.
+</td>
+</tr>
+</table>
+</div>
+<div id="xml_attribute::assign" class="paragraph">
+For convenience, all <code>set_value</code> functions have the corresponding assignment operators:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_attribute&amp; xml_attribute::operator=(const char_t* rhs);
+xml_attribute&amp; xml_attribute::operator=(int rhs);
+xml_attribute&amp; xml_attribute::operator=(unsigned int rhs);
+xml_attribute&amp; xml_attribute::operator=(double rhs);
+xml_attribute&amp; xml_attribute::operator=(float rhs);
+xml_attribute&amp; xml_attribute::operator=(bool rhs);
+xml_attribute&amp; xml_attribute::operator=(long long rhs);
+xml_attribute&amp; xml_attribute::operator=(unsigned long long rhs);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+These operators simply call the right <code>set_value</code> function and return the attribute they&#8217;re called on; the return value of <code>set_value</code> is ignored, so errors are ignored.
+</div>
+<div class="paragraph">
+This is an example of setting attribute name and value (<a href="samples/modify_base.cpp" class="bare">samples/modify_base.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">pugi::xml_attribute attr = node.attribute(&quot;id&quot;);
+
+// change attribute name/value
+std::cout &lt;&lt; attr.set_name(&quot;key&quot;) &lt;&lt; &quot;, &quot; &lt;&lt; attr.set_value(&quot;345&quot;);
+std::cout &lt;&lt; &quot;, new attribute: &quot; &lt;&lt; attr.name() &lt;&lt; &quot;=&quot; &lt;&lt; attr.value() &lt;&lt; std::endl;
+
+// we can use numbers or booleans
+attr.set_value(1.234);
+std::cout &lt;&lt; &quot;new attribute value: &quot; &lt;&lt; attr.value() &lt;&lt; std::endl;
+
+// we can also use assignment operators for more concise code
+attr = true;
+std::cout &lt;&lt; &quot;final attribute value: &quot; &lt;&lt; attr.value() &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="modify.add"><a class="anchor" href="#modify.add"></a>6.3. Adding nodes/attributes</h3>
+<div class="paragraph">
+<a id="xml_node::prepend_attribute"></a><a id="xml_node::append_attribute"></a><a id="xml_node::insert_attribute_after"></a><a id="xml_node::insert_attribute_before"></a><a id="xml_node::prepend_child"></a><a id="xml_node::append_child"></a><a id="xml_node::insert_child_after"></a><a id="xml_node::insert_child_before"></a>
+Nodes and attributes do not exist without a document tree, so you can&#8217;t create them without adding them to some document. A node or attribute can be created at the end of node/attribute list or before/after some other node:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_attribute xml_node::append_attribute(const char_t* name);
+xml_attribute xml_node::prepend_attribute(const char_t* name);
+xml_attribute xml_node::insert_attribute_after(const char_t* name, const xml_attribute&amp; attr);
+xml_attribute xml_node::insert_attribute_before(const char_t* name, const xml_attribute&amp; attr);
+
+xml_node xml_node::append_child(xml_node_type type = node_element);
+xml_node xml_node::prepend_child(xml_node_type type = node_element);
+xml_node xml_node::insert_child_after(xml_node_type type, const xml_node&amp; node);
+xml_node xml_node::insert_child_before(xml_node_type type, const xml_node&amp; node);
+
+xml_node xml_node::append_child(const char_t* name);
+xml_node xml_node::prepend_child(const char_t* name);
+xml_node xml_node::insert_child_after(const char_t* name, const xml_node&amp; node);
+xml_node xml_node::insert_child_before(const char_t* name, const xml_node&amp; node);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>append_attribute</code> and <code>append_child</code> create a new node/attribute at the end of the corresponding list of the node the method is called on; <code>prepend_attribute</code> and <code>prepend_child</code> create a new node/attribute at the beginning of the list; <code>insert_attribute_after</code>, <code>insert_attribute_before</code>, <code>insert_child_after</code> and <code>insert_attribute_before</code> add the node/attribute before or after the specified node/attribute.
+</div>
+<div class="paragraph">
+Attribute functions create an attribute with the specified name; you can specify the empty name and change the name later if you want to. Node functions with the <code>type</code> argument create the node with the specified type; since node type can&#8217;t be changed, you have to know the desired type beforehand. Also note that not all types can be added as children; see below for clarification. Node functions with the <code>name</code> argument create the element node (<a href="#node_element">node_element</a>) with the specified name.
+</div>
+<div class="paragraph">
+All functions return the handle to the created object on success, and null handle on failure. There are several reasons for failure:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Adding fails if the target node is null;
+</li>
+<li>
+Only <a href="#node_element">node_element</a> nodes can contain attributes, so attribute adding fails if node is not an element;
+</li>
+<li>
+Only <a href="#node_document">node_document</a> and <a href="#node_element">node_element</a> nodes can contain children, so child node adding fails if the target node is not an element or a document;
+</li>
+<li>
+<a href="#node_document">node_document</a> and <a href="#node_null">node_null</a> nodes can not be inserted as children, so passing <a href="#node_document">node_document</a> or <a href="#node_null">node_null</a> value as <code>type</code> results in operation failure;
+</li>
+<li>
+<a href="#node_declaration">node_declaration</a> nodes can only be added as children of the document node; attempt to insert declaration node as a child of an element node fails;
+</li>
+<li>
+Adding node/attribute results in memory allocation, which may fail;
+</li>
+<li>
+Insertion functions fail if the specified node or attribute is null or is not in the target node&#8217;s children/attribute list.
+</li>
+</ul>
+</div>
+<div class="paragraph">
+Even if the operation fails, the document remains in consistent state, but the requested node/attribute is not added.
+</div>
+<div class="admonitionblock caution">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Caution</div>
+</td>
+<td class="content">
+<code>attribute()</code> and <code>child()</code> functions do not add attributes or nodes to the tree, so code like <code>node.attribute("id") = 123;</code> will not do anything if <code>node</code> does not have an attribute with name <code>"id"</code>. Make sure you&#8217;re operating with existing attributes/nodes by adding them if necessary.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+This is an example of adding new attributes/nodes to the document (<a href="samples/modify_add.cpp" class="bare">samples/modify_add.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// add node with some name
+pugi::xml_node node = doc.append_child(&quot;node&quot;);
+
+// add description node with text child
+pugi::xml_node descr = node.append_child(&quot;description&quot;);
+descr.append_child(pugi::node_pcdata).set_value(&quot;Simple node&quot;);
+
+// add param node before the description
+pugi::xml_node param = node.insert_child_before(&quot;param&quot;, descr);
+
+// add attributes to param node
+param.append_attribute(&quot;name&quot;) = &quot;version&quot;;
+param.append_attribute(&quot;value&quot;) = 1.1;
+param.insert_attribute_after(&quot;type&quot;, param.attribute(&quot;name&quot;)) = &quot;float&quot;;</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="modify.remove"><a class="anchor" href="#modify.remove"></a>6.4. Removing nodes/attributes</h3>
+<div class="paragraph">
+<a id="xml_node::remove_attribute"></a><a id="xml_node::remove_child"></a>
+If you do not want your document to contain some node or attribute, you can remove it with one of the following functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xml_node::remove_attribute(const xml_attribute&amp; a);
+bool xml_node::remove_child(const xml_node&amp; n);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>remove_attribute</code> removes the attribute from the attribute list of the node, and returns the operation result. <code>remove_child</code> removes the child node with the entire subtree (including all descendant nodes and attributes) from the document, and returns the operation result. Removing fails if one of the following is true:
+</div>
+<div class="ulist">
+<ul>
+<li>
+The node the function is called on is null;
+</li>
+<li>
+The attribute/node to be removed is null;
+</li>
+<li>
+The attribute/node to be removed is not in the node&#8217;s attribute/child list.
+</li>
+</ul>
+</div>
+<div class="paragraph">
+Removing the attribute or node invalidates all handles to the same underlying object, and also invalidates all iterators pointing to the same object. Removing node also invalidates all past-the-end iterators to its attribute or child node list. Be careful to ensure that all such handles and iterators either do not exist or are not used after the attribute/node is removed.
+</div>
+<div class="paragraph">
+If you want to remove the attribute or child node by its name, two additional helper functions are available:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xml_node::remove_attribute(const char_t* name);
+bool xml_node::remove_child(const char_t* name);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+These functions look for the first attribute or child with the specified name, and then remove it, returning the result. If there is no attribute or child with such name, the function returns <code>false</code>; if there are two nodes with the given name, only the first node is deleted. If you want to delete all nodes with the specified name, you can use code like this: <code>while (node.remove_child("tool")) ;</code>.
+</div>
+<div class="paragraph">
+This is an example of removing attributes/nodes from the document (<a href="samples/modify_remove.cpp" class="bare">samples/modify_remove.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// remove description node with the whole subtree
+pugi::xml_node node = doc.child(&quot;node&quot;);
+node.remove_child(&quot;description&quot;);
+
+// remove id attribute
+pugi::xml_node param = node.child(&quot;param&quot;);
+param.remove_attribute(&quot;value&quot;);
+
+// we can also remove nodes/attributes by handles
+pugi::xml_attribute id = param.attribute(&quot;name&quot;);
+param.remove_attribute(id);</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="modify.text"><a class="anchor" href="#modify.text"></a>6.5. Working with text contents</h3>
+<div class="paragraph">
+pugixml provides a special class, <code>xml_text</code>, to work with text contents stored as a value of some node, i.e. <code>&lt;node&gt;&lt;description&gt;This is a node&lt;/description&gt;&lt;/node&gt;</code>. Working with text objects to retrieve data is described in <a href="#access.text">the documentation for accessing document data</a>; this section describes the modification interface of <code>xml_text</code>.
+</div>
+<div id="xml_text::set" class="paragraph">
+Once you have an <code>xml_text</code> object, you can set the text contents using the following function:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xml_text::set(const char_t* rhs);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+This function tries to set the contents to the specified string, and returns the operation result. The operation fails if the text object was retrieved from a node that can not have a value and is not an element node (i.e. it is a <a href="#node_declaration">node_declaration</a> node), if the text object is empty, or if there is insufficient memory to handle the request. The provided string is copied into document managed memory and can be destroyed after the function returns (for example, you can safely pass stack-allocated buffers to this function). Note that if the text object was retrieved from an element node, this function creates the PCDATA child node if necessary (i.e. if the element node does not have a PCDATA/CDATA child already).
+</div>
+<div id="xml_text::set_value" class="paragraph">
+In addition to a string function, several functions are provided for handling text with numbers and booleans as contents:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xml_text::set(int rhs);
+bool xml_text::set(unsigned int rhs);
+bool xml_text::set(double rhs);
+bool xml_text::set(float rhs);
+bool xml_text::set(bool rhs);
+bool xml_text::set(long long rhs);
+bool xml_text::set(unsigned long long rhs);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+The above functions convert the argument to string and then call the base <code>set</code> function. These functions have the same semantics as similar <code>xml_attribute</code> functions. You can <a href="#xml_attribute::set_value">refer to documentation for the attribute functions</a> for details.
+</div>
+<div id="xml_text::assign" class="paragraph">
+For convenience, all <code>set</code> functions have the corresponding assignment operators:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_text&amp; xml_text::operator=(const char_t* rhs);
+xml_text&amp; xml_text::operator=(int rhs);
+xml_text&amp; xml_text::operator=(unsigned int rhs);
+xml_text&amp; xml_text::operator=(double rhs);
+xml_text&amp; xml_text::operator=(float rhs);
+xml_text&amp; xml_text::operator=(bool rhs);
+xml_text&amp; xml_text::operator=(long long rhs);
+xml_text&amp; xml_text::operator=(unsigned long long rhs);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+These operators simply call the right <code>set</code> function and return the attribute they&#8217;re called on; the return value of <code>set</code> is ignored, so errors are ignored.
+</div>
+<div class="paragraph">
+This is an example of using <code>xml_text</code> object to modify text contents (<a href="samples/text.cpp" class="bare">samples/text.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// change project version
+project.child(&quot;version&quot;).text() = 1.2;
+
+// add description element and set the contents
+// note that we do not have to explicitly add the node_pcdata child
+project.append_child(&quot;description&quot;).text().set(&quot;a test project&quot;);</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="modify.clone"><a class="anchor" href="#modify.clone"></a>6.6. Cloning nodes/attributes</h3>
+<div class="paragraph">
+<a id="xml_node::prepend_copy"></a><a id="xml_node::append_copy"></a><a id="xml_node::insert_copy_after"></a><a id="xml_node::insert_copy_before"></a>
+With the help of previously described functions, it is possible to create trees with any contents and structure, including cloning the existing data. However since this is an often needed operation, pugixml provides built-in node/attribute cloning facilities. Since nodes and attributes do not exist without a document tree, you can&#8217;t create a standalone copy - you have to immediately insert it somewhere in the tree. For this, you can use one of the following functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_attribute xml_node::append_copy(const xml_attribute&amp; proto);
+xml_attribute xml_node::prepend_copy(const xml_attribute&amp; proto);
+xml_attribute xml_node::insert_copy_after(const xml_attribute&amp; proto, const xml_attribute&amp; attr);
+xml_attribute xml_node::insert_copy_before(const xml_attribute&amp; proto, const xml_attribute&amp; attr);
+
+xml_node xml_node::append_copy(const xml_node&amp; proto);
+xml_node xml_node::prepend_copy(const xml_node&amp; proto);
+xml_node xml_node::insert_copy_after(const xml_node&amp; proto, const xml_node&amp; node);
+xml_node xml_node::insert_copy_before(const xml_node&amp; proto, const xml_node&amp; node);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+These functions mirror the structure of <code>append_child</code>, <code>prepend_child</code>, <code>insert_child_before</code> and related functions - they take the handle to the prototype object, which is to be cloned, insert a new attribute/node at the appropriate place, and then copy the attribute data or the whole node subtree to the new object. The functions return the handle to the resulting duplicate object, or null handle on failure.
+</div>
+<div class="paragraph">
+The attribute is copied along with the name and value; the node is copied along with its type, name and value; additionally attribute list and all children are recursively cloned, resulting in the deep subtree clone. The prototype object can be a part of the same document, or a part of any other document.
+</div>
+<div class="paragraph">
+The failure conditions resemble those of <code>append_child</code>, <code>insert_child_before</code> and related functions, <a href="#xml_node::append_child">consult their documentation for more information</a>. There are additional caveats specific to cloning functions:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Cloning null handles results in operation failure;
+</li>
+<li>
+Node cloning starts with insertion of the node of the same type as that of the prototype; for this reason, cloning functions can not be directly used to clone entire documents, since <a href="#node_document">node_document</a> is not a valid insertion type. The example below provides a workaround.
+</li>
+<li>
+It is possible to copy a subtree as a child of some node inside this subtree, i.e. <code>node.append_copy(node.parent().parent());</code>. This is a valid operation, and it results in a clone of the subtree in the state before cloning started, i.e. no infinite recursion takes place.
+</li>
+</ul>
+</div>
+<div class="paragraph">
+This is an example with one possible implementation of include tags in XML (<a href="samples/include.cpp" class="bare">samples/include.cpp</a>). It illustrates node cloning and usage of other document modification functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool load_preprocess(pugi::xml_document&amp; doc, const char* path);
+
+bool preprocess(pugi::xml_node node)
+{
+ for (pugi::xml_node child = node.first_child(); child; )
+ {
+ if (child.type() == pugi::node_pi &amp;&amp; strcmp(child.name(), &quot;include&quot;) == 0)
+ {
+ pugi::xml_node include = child;
+
+ // load new preprocessed document (note: ideally this should handle relative paths)
+ const char* path = include.value();
+
+ pugi::xml_document doc;
+ if (!load_preprocess(doc, path)) return false;
+
+ // insert the comment marker above include directive
+ node.insert_child_before(pugi::node_comment, include).set_value(path);
+
+ // copy the document above the include directive (this retains the original order!)
+ for (pugi::xml_node ic = doc.first_child(); ic; ic = ic.next_sibling())
+ {
+ node.insert_copy_before(ic, include);
+ }
+
+ // remove the include node and move to the next child
+ child = child.next_sibling();
+
+ node.remove_child(include);
+ }
+ else
+ {
+ if (!preprocess(child)) return false;
+
+ child = child.next_sibling();
+ }
+ }
+
+ return true;
+}
+
+bool load_preprocess(pugi::xml_document&amp; doc, const char* path)
+{
+ pugi::xml_parse_result result = doc.load_file(path, pugi::parse_default | pugi::parse_pi); // for &lt;?include?&gt;
+
+ return result ? preprocess(doc) : false;
+}</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="modify.move"><a class="anchor" href="#modify.move"></a>6.7. Moving nodes</h3>
+<div class="paragraph">
+<a id="xml_node::prepend_move"></a><a id="xml_node::append_move"></a><a id="xml_node::insert_move_after"></a><a id="xml_node::insert_move_before"></a>
+Sometimes instead of cloning a node you need to move an existing node to a different position in a tree. This can be accomplished by copying the node and removing the original; however, this is expensive since it results in a lot of extra operations. For moving nodes within the same document tree, you can use of the following functions instead:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_node xml_node::append_move(const xml_node&amp; moved);
+xml_node xml_node::prepend_move(const xml_node&amp; moved);
+xml_node xml_node::insert_move_after(const xml_node&amp; moved, const xml_node&amp; node);
+xml_node xml_node::insert_move_before(const xml_node&amp; moved, const xml_node&amp; node);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+These functions mirror the structure of <code>append_copy</code>, <code>prepend_copy</code>, <code>insert_copy_before</code> and <code>insert_copy_after</code> - they take the handle to the moved object and move it to the appropriate place with all attributes and/or child nodes. The functions return the handle to the resulting object (which is the same as the moved object), or null handle on failure.
+</div>
+<div class="paragraph">
+The failure conditions resemble those of <code>append_child</code>, <code>insert_child_before</code> and related functions, <a href="#xml_node::append_child">consult their documentation for more information</a>. There are additional caveats specific to moving functions:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Moving null handles results in operation failure;
+</li>
+<li>
+Moving is only possible for nodes that belong to the same document; attempting to move nodes between documents will fail.
+</li>
+<li>
+<code>insert_move_after</code> and <code>insert_move_before</code> functions fail if the moved node is the same as the <code>node</code> argument (this operation would be a no-op otherwise).
+</li>
+<li>
+It is impossible to move a subtree to a child of some node inside this subtree, i.e. <code>node.append_move(node.parent().parent());</code> will fail.
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="modify.fragments"><a class="anchor" href="#modify.fragments"></a>6.8. Assembling document from fragments</h3>
+<div id="xml_node::append_buffer" class="paragraph">
+pugixml provides several ways to assemble an XML document from other XML documents. Assuming there is a set of document fragments, represented as in-memory buffers, the implementation choices are as follows:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Use a temporary document to parse the data from a string, then clone the nodes to a destination node. For example:
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool append_fragment(pugi::xml_node target, const char* buffer, size_t size)
+{
+ pugi::xml_document doc;
+ if (!doc.load_buffer(buffer, size)) return false;
+
+ for (pugi::xml_node child = doc.first_child(); child; child = child.next_sibling())
+ target.append_copy(child);
+}</code></pre>
+</div>
+</div>
+</li>
+<li>
+Cache the parsing step - instead of keeping in-memory buffers, keep document objects that already contain the parsed fragment:
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool append_fragment(pugi::xml_node target, const pugi::xml_document&amp; cached_fragment)
+{
+ for (pugi::xml_node child = cached_fragment.first_child(); child; child = child.next_sibling())
+ target.append_copy(child);
+}</code></pre>
+</div>
+</div>
+</li>
+<li>
+Use <code>xml_node::append_buffer</code> directly:
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_parse_result xml_node::append_buffer(const void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);</code></pre>
+</div>
+</div>
+</li>
+</ul>
+</div>
+<div class="paragraph">
+The first method is more convenient, but slower than the other two. The relative performance of <code>append_copy</code> and <code>append_buffer</code> depends on the buffer format - usually <code>append_buffer</code> is faster if the buffer is in native encoding (UTF-8 or wchar_t, depending on <code>PUGIXML_WCHAR_MODE</code>). At the same time it might be less efficient in terms of memory usage - the implementation makes a copy of the provided buffer, and the copy has the same lifetime as the document - the memory used by that copy will be reclaimed after the document is destroyed, but no sooner. Even deleting all nodes in the document, including the appended ones, won&#8217;t reclaim the memory.
+</div>
+<div class="paragraph">
+<code>append_buffer</code> behaves in the same way as <a href="#xml_document::load_buffer">xml_document::load_buffer</a> - the input buffer is a byte buffer, with size in bytes; the buffer is not modified and can be freed after the function returns.
+</div>
+<div id="status_append_invalid_root" class="paragraph">
+Since <code>append_buffer</code> needs to append child nodes to the current node, it only works if the current node is either document or element node. Calling <code>append_buffer</code> on a node with any other type results in an error with <code>status_append_invalid_root</code> status.
+</div>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="saving"><a class="anchor" href="#saving"></a>7. Saving document</h2>
+<div class="sectionbody">
+<div class="paragraph">
+Often after creating a new document or loading the existing one and processing it, it is necessary to save the result back to file. Also it is occasionally useful to output the whole document or a subtree to some stream; use cases include debug printing, serialization via network or other text-oriented medium, etc. pugixml provides several functions to output any subtree of the document to a file, stream or another generic transport interface; these functions allow to customize the output format (see <a href="#saving.options">Output options</a>), and also perform necessary encoding conversions (see <a href="#saving.encoding">Encodings</a>). This section documents the relevant functionality.
+</div>
+<div class="paragraph">
+Before writing to the destination the node/attribute data is properly formatted according to the node type; all special XML symbols, such as <code>&lt;</code> and <code>&amp;</code>, are properly escaped (unless <a href="#format_no_escapes">format_no_escapes</a> flag is set). In order to guard against forgotten node/attribute names, empty node/attribute names are printed as <code>":anonymous"</code>. For well-formed output, make sure all node and attribute names are set to meaningful values.
+</div>
+<div class="paragraph">
+CDATA sections with values that contain <code>"]]&gt;"</code> are split into several sections as follows: section with value <code>"pre]]&gt;post"</code> is written as <code>&lt;![CDATA[pre]]]]&gt;&lt;![CDATA[&gt;post]]&gt;</code>. While this alters the structure of the document (if you load the document after saving it, there will be two CDATA sections instead of one), this is the only way to escape CDATA contents.
+</div>
+<div class="sect2">
+<h3 id="saving.file"><a class="anchor" href="#saving.file"></a>7.1. Saving document to a file</h3>
+<div class="paragraph">
+<a id="xml_document::save_file"></a><a id="xml_document::save_file_wide"></a>
+If you want to save the whole document to a file, you can use one of the following functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xml_document::save_file(const char* path, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+bool xml_document::save_file(const wchar_t* path, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+These functions accept file path as its first argument, and also three optional arguments, which specify indentation and other output options (see <a href="#saving.options">Output options</a>) and output data encoding (see <a href="#saving.encoding">Encodings</a>). The path has the target operating system format, so it can be a relative or absolute one, it should have the delimiters of the target system, it should have the exact case if the target file system is case-sensitive, etc.
+</div>
+<div class="paragraph">
+File path is passed to the system file opening function as is in case of the first function (which accepts <code>const char* path</code>); the second function either uses a special file opening function if it is provided by the runtime library or converts the path to UTF-8 and uses the system file opening function.
+</div>
+<div id="xml_writer_file" class="paragraph">
+<code>save_file</code> opens the target file for writing, outputs the requested header (by default a document declaration is output, unless the document already has one), and then saves the document contents. If the file could not be opened, the function returns <code>false</code>. Calling <code>save_file</code> is equivalent to creating an <code>xml_writer_file</code> object with <code>FILE*</code> handle as the only constructor argument and then calling <code>save</code>; see <a href="#saving.writer">Saving document via writer interface</a> for writer interface details.
+</div>
+<div class="paragraph">
+This is a simple example of saving XML document to file (<a href="samples/save_file.cpp" class="bare">samples/save_file.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// save document to file
+std::cout &lt;&lt; &quot;Saving result: &quot; &lt;&lt; doc.save_file(&quot;save_file_output.xml&quot;) &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="saving.stream"><a class="anchor" href="#saving.stream"></a>7.2. Saving document to C&#43;&#43; IOstreams</h3>
+<div id="xml_document::save_stream" class="paragraph">
+To enhance interoperability pugixml provides functions for saving document to any object which implements C&#43;&#43; <code>std::ostream</code> interface. This allows you to save documents to any standard C&#43;&#43; stream (i.e. file stream) or any third-party compliant implementation (i.e. Boost Iostreams). Most notably, this allows for easy debug output, since you can use <code>std::cout</code> stream as saving target. There are two functions, one works with narrow character streams, another handles wide character ones:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">void xml_document::save(std::ostream&amp; stream, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+void xml_document::save(std::wostream&amp; stream, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>save</code> with <code>std::ostream</code> argument saves the document to the stream in the same way as <code>save_file</code> (i.e. with requested header and with encoding conversions). On the other hand, <code>save</code> with <code>std::wstream</code> argument saves the document to the wide stream with <a href="#encoding_wchar">encoding_wchar</a> encoding. Because of this, using <code>save</code> with wide character streams requires careful (usually platform-specific) stream setup (i.e. using the <code>imbue</code> function). Generally use of wide streams is discouraged, however it provides you with the ability to save documents to non-Unicode encodings, i.e. you can save Shift-JIS encoded data if you set the correct locale.
+</div>
+<div id="xml_writer_stream" class="paragraph">
+Calling <code>save</code> with stream target is equivalent to creating an <code>xml_writer_stream</code> object with stream as the only constructor argument and then calling <code>save</code>; see <a href="#saving.writer">Saving document via writer interface</a> for writer interface details.
+</div>
+<div class="paragraph">
+This is a simple example of saving XML document to standard output (<a href="samples/save_stream.cpp" class="bare">samples/save_stream.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// save document to standard output
+std::cout &lt;&lt; &quot;Document:\n&quot;;
+doc.save(std::cout);</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="saving.writer"><a class="anchor" href="#saving.writer"></a>7.3. Saving document via writer interface</h3>
+<div class="paragraph">
+<a id="xml_document::save"></a><a id="xml_writer"></a><a id="xml_writer::write"></a>
+All of the above saving functions are implemented in terms of writer interface. This is a simple interface with a single function, which is called several times during output process with chunks of document data as input:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">class xml_writer
+{
+public:
+ virtual void write(const void* data, size_t size) = 0;
+};
+
+void xml_document::save(xml_writer&amp; writer, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+In order to output the document via some custom transport, for example sockets, you should create an object which implements <code>xml_writer</code> interface and pass it to <code>save</code> function. <code>xml_writer::write</code> function is called with a buffer as an input, where <code>data</code> points to buffer start, and <code>size</code> is equal to the buffer size in bytes. <code>write</code> implementation must write the buffer to the transport; it can not save the passed buffer pointer, as the buffer contents will change after <code>write</code> returns. The buffer contains the chunk of document data in the desired encoding.
+</div>
+<div class="paragraph">
+<code>write</code> function is called with relatively large blocks (size is usually several kilobytes, except for the last block that may be small), so there is often no need for additional buffering in the implementation.
+</div>
+<div class="paragraph">
+This is a simple example of custom writer for saving document data to STL string (<a href="samples/save_custom_writer.cpp" class="bare">samples/save_custom_writer.cpp</a>); read the sample code for more complex examples:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">struct xml_string_writer: pugi::xml_writer
+{
+ std::string result;
+
+ virtual void write(const void* data, size_t size)
+ {
+ result.append(static_cast&lt;const char*&gt;(data), size);
+ }
+};</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="saving.subtree"><a class="anchor" href="#saving.subtree"></a>7.4. Saving a single subtree</h3>
+<div class="paragraph">
+<a id="xml_node::print"></a><a id="xml_node::print_stream"></a>
+While the previously described functions save the whole document to the destination, it is easy to save a single subtree. The following functions are provided:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">void xml_node::print(std::ostream&amp; os, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, xml_encoding encoding = encoding_auto, unsigned int depth = 0) const;
+void xml_node::print(std::wostream&amp; os, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, unsigned int depth = 0) const;
+void xml_node::print(xml_writer&amp; writer, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, xml_encoding encoding = encoding_auto, unsigned int depth = 0) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+These functions have the same arguments with the same meaning as the corresponding <code>xml_document::save</code> functions, and allow you to save the subtree to either a C&#43;&#43; IOstream or to any object that implements <code>xml_writer</code> interface.
+</div>
+<div class="paragraph">
+Saving a subtree differs from saving the whole document: the process behaves as if <a href="#format_write_bom">format_write_bom</a> is off, and <a href="#format_no_declaration">format_no_declaration</a> is on, even if actual values of the flags are different. This means that BOM is not written to the destination, and document declaration is only written if it is the node itself or is one of node&#8217;s children. Note that this also holds if you&#8217;re saving a document; this example (<a href="samples/save_subtree.cpp" class="bare">samples/save_subtree.cpp</a>) illustrates the difference:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// get a test document
+pugi::xml_document doc;
+doc.load_string(&quot;&lt;foo bar=&#39;baz&#39;&gt;&lt;call&gt;hey&lt;/call&gt;&lt;/foo&gt;&quot;);
+
+// print document to standard output (prints &lt;?xml version=&quot;1.0&quot;?&gt;&lt;foo bar=&quot;baz&quot;&gt;&lt;call&gt;hey&lt;/call&gt;&lt;/foo&gt;)
+doc.save(std::cout, &quot;&quot;, pugi::format_raw);
+std::cout &lt;&lt; std::endl;
+
+// print document to standard output as a regular node (prints &lt;foo bar=&quot;baz&quot;&gt;&lt;call&gt;hey&lt;/call&gt;&lt;/foo&gt;)
+doc.print(std::cout, &quot;&quot;, pugi::format_raw);
+std::cout &lt;&lt; std::endl;
+
+// print a subtree to standard output (prints &lt;call&gt;hey&lt;/call&gt;)
+doc.child(&quot;foo&quot;).child(&quot;call&quot;).print(std::cout, &quot;&quot;, pugi::format_raw);
+std::cout &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="saving.options"><a class="anchor" href="#saving.options"></a>7.5. Output options</h3>
+<div class="paragraph">
+All saving functions accept the optional parameter <code>flags</code>. This is a bitmask that customizes the output format; you can select the way the document nodes are printed and select the needed additional information that is output before the document contents.
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+You should use the usual bitwise arithmetics to manipulate the bitmask: to enable a flag, use <code>mask | flag</code>; to disable a flag, use <code>mask &amp; ~flag</code>.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+These flags control the resulting tree contents:
+</div>
+<div class="ulist">
+<ul>
+<li>
+<a id="format_indent"></a><code>format_indent</code> determines if all nodes should be indented with the indentation string (this is an additional parameter for all saving functions, and is <code>"\t"</code> by default). If this flag is on, before every node the indentation string is output several times, where the amount of indentation depends on the node&#8217;s depth relative to the output subtree. This flag has no effect if <a href="#format_raw">format_raw</a> is enabled. This flag is on by default.
+</li>
+<li>
+<a id="format_raw"></a><code>format_raw</code> switches between formatted and raw output. If this flag is on, the nodes are not indented in any way, and also no newlines that are not part of document text are printed. Raw mode can be used for serialization where the result is not intended to be read by humans; also it can be useful if the document was parsed with <a href="#parse_ws_pcdata">parse_ws_pcdata</a> flag, to preserve the original document formatting as much as possible. This flag is off by default.
+</li>
+<li>
+<a id="format_no_escapes"></a><code>format_no_escapes</code> disables output escaping for attribute values and PCDATA contents. If this flag is off, special symbols (<code>"</code>, <code>&amp;</code>, <code>&lt;</code>, <code>&gt;</code>) and all non-printable characters (those with codepoint values less than 32) are converted to XML escape sequences (i.e. <code>&amp;amp;</code>) during output. If this flag is on, no text processing is performed; therefore, output XML can be malformed if output contents contains invalid symbols (i.e. having a stray <code>&lt;</code> in the PCDATA will make the output malformed). This flag is off by default.
+</li>
+</ul>
+</div>
+<div class="paragraph">
+These flags control the additional output information:
+</div>
+<div class="ulist">
+<ul>
+<li>
+<a id="format_no_declaration"></a><code>format_no_declaration</code> disables default node declaration output. By default, if the document is saved via <code>save</code> or <code>save_file</code> function, and it does not have any document declaration, a default declaration is output before the document contents. Enabling this flag disables this declaration. This flag has no effect in <code>xml_node::print</code> functions: they never output the default declaration. This flag is off by default.
+</li>
+<li>
+<a id="format_write_bom"></a><code>format_write_bom</code> enables Byte Order Mark (BOM) output. By default, no BOM is output, so in case of non UTF-8 encodings the resulting document&#8217;s encoding may not be recognized by some parsers and text editors, if they do not implement sophisticated encoding detection. Enabling this flag adds an encoding-specific BOM to the output. This flag has no effect in <code>xml_node::print</code> functions: they never output the BOM. This flag is off by default.
+</li>
+<li>
+<a id="format_save_file_text"></a><code>format_save_file_text</code> changes the file mode when using <code>save_file</code> function. By default, file is opened in binary mode, which means that the output file will
+contain platform-independent newline <code>\n</code> (ASCII 10). If this flag is on, file is opened in text mode, which on some systems changes the newline format (i.e. on Windows you can use this flag to output XML documents with <code>\r\n</code> (ASCII 13 10) newlines. This flag is off by default.
+</li>
+</ul>
+</div>
+<div class="paragraph">
+Additionally, there is one predefined option mask:
+</div>
+<div class="ulist">
+<ul>
+<li>
+<a id="format_default"></a><code>format_default</code> is the default set of flags, i.e. it has all options set to their default values. It sets formatted output with indentation, without BOM and with default node declaration, if necessary.
+</li>
+</ul>
+</div>
+<div class="paragraph">
+This is an example that shows the outputs of different output options (<a href="samples/save_options.cpp" class="bare">samples/save_options.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// get a test document
+pugi::xml_document doc;
+doc.load_string(&quot;&lt;foo bar=&#39;baz&#39;&gt;&lt;call&gt;hey&lt;/call&gt;&lt;/foo&gt;&quot;);
+
+// default options; prints
+// &lt;?xml version=&quot;1.0&quot;?&gt;
+// &lt;foo bar=&quot;baz&quot;&gt;
+// &lt;call&gt;hey&lt;/call&gt;
+// &lt;/foo&gt;
+doc.save(std::cout);
+std::cout &lt;&lt; std::endl;
+
+// default options with custom indentation string; prints
+// &lt;?xml version=&quot;1.0&quot;?&gt;
+// &lt;foo bar=&quot;baz&quot;&gt;
+// --&lt;call&gt;hey&lt;/call&gt;
+// &lt;/foo&gt;
+doc.save(std::cout, &quot;--&quot;);
+std::cout &lt;&lt; std::endl;
+
+// default options without indentation; prints
+// &lt;?xml version=&quot;1.0&quot;?&gt;
+// &lt;foo bar=&quot;baz&quot;&gt;
+// &lt;call&gt;hey&lt;/call&gt;
+// &lt;/foo&gt;
+doc.save(std::cout, &quot;\t&quot;, pugi::format_default &amp; ~pugi::format_indent); // can also pass &quot;&quot; instead of indentation string for the same effect
+std::cout &lt;&lt; std::endl;
+
+// raw output; prints
+// &lt;?xml version=&quot;1.0&quot;?&gt;&lt;foo bar=&quot;baz&quot;&gt;&lt;call&gt;hey&lt;/call&gt;&lt;/foo&gt;
+doc.save(std::cout, &quot;\t&quot;, pugi::format_raw);
+std::cout &lt;&lt; std::endl &lt;&lt; std::endl;
+
+// raw output without declaration; prints
+// &lt;foo bar=&quot;baz&quot;&gt;&lt;call&gt;hey&lt;/call&gt;&lt;/foo&gt;
+doc.save(std::cout, &quot;\t&quot;, pugi::format_raw | pugi::format_no_declaration);
+std::cout &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="saving.encoding"><a class="anchor" href="#saving.encoding"></a>7.6. Encodings</h3>
+<div class="paragraph">
+pugixml supports all popular Unicode encodings (UTF-8, UTF-16 (big and little endian), UTF-32 (big and little endian); UCS-2 is naturally supported since it&#8217;s a strict subset of UTF-16) and handles all encoding conversions during output. The output encoding is set via the <code>encoding</code> parameter of saving functions, which is of type <code>xml_encoding</code>. The possible values for the encoding are documented in <a href="#loading.encoding">Encodings</a>; the only flag that has a different meaning is <code>encoding_auto</code>.
+</div>
+<div class="paragraph">
+While all other flags set the exact encoding, <code>encoding_auto</code> is meant for automatic encoding detection. The automatic detection does not make sense for output encoding, since there is usually nothing to infer the actual encoding from, so here <code>encoding_auto</code> means UTF-8 encoding, which is the most popular encoding for XML data storage. This is also the default value of output encoding; specify another value if you do not want UTF-8 encoded output.
+</div>
+<div class="paragraph">
+Also note that wide stream saving functions do not have <code>encoding</code> argument and always assume <a href="#encoding_wchar">encoding_wchar</a> encoding.
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+The current behavior for Unicode conversion is to skip all invalid UTF sequences during conversion. This behavior should not be relied upon; if your node/attribute names do not contain any valid UTF sequences, they may be output as if they are empty, which will result in malformed XML document.
+</td>
+</tr>
+</table>
+</div>
+</div>
+<div class="sect2">
+<h3 id="saving.declaration"><a class="anchor" href="#saving.declaration"></a>7.7. Customizing document declaration</h3>
+<div class="paragraph">
+When you are saving the document using <code>xml_document::save()</code> or <code>xml_document::save_file()</code>, a default XML document declaration is output, if <code>format_no_declaration</code> is not specified and if the document does not have a declaration node. However, the default declaration is not customizable. If you want to customize the declaration output, you need to create the declaration node yourself.
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+By default the declaration node is not added to the document during parsing. If you just need to preserve the original declaration node, you have to add the flag <a href="#parse_declaration">parse_declaration</a> to the parsing flags; the resulting document will contain the original declaration node, which will be output during saving.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+Declaration node is a node with type <a href="#node_declaration">node_declaration</a>; it behaves like an element node in that it has attributes with values (but it does not have child nodes). Therefore setting custom version, encoding or standalone declaration involves adding attributes and setting attribute values.
+</div>
+<div class="paragraph">
+This is an example that shows how to create a custom declaration node (<a href="samples/save_declaration.cpp" class="bare">samples/save_declaration.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// get a test document
+pugi::xml_document doc;
+doc.load_string(&quot;&lt;foo bar=&#39;baz&#39;&gt;&lt;call&gt;hey&lt;/call&gt;&lt;/foo&gt;&quot;);
+
+// add a custom declaration node
+pugi::xml_node decl = doc.prepend_child(pugi::node_declaration);
+decl.append_attribute(&quot;version&quot;) = &quot;1.0&quot;;
+decl.append_attribute(&quot;encoding&quot;) = &quot;UTF-8&quot;;
+decl.append_attribute(&quot;standalone&quot;) = &quot;no&quot;;
+
+// &lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot; standalone=&quot;no&quot;?&gt;
+// &lt;foo bar=&quot;baz&quot;&gt;
+// &lt;call&gt;hey&lt;/call&gt;
+// &lt;/foo&gt;
+doc.save(std::cout);
+std::cout &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="xpath"><a class="anchor" href="#xpath"></a>8. XPath</h2>
+<div class="sectionbody">
+<div class="paragraph">
+If the task at hand is to select a subset of document nodes that match some criteria, it is possible to code a function using the existing traversal functionality for any practical criteria. However, often either a data-driven approach is desirable, in case the criteria are not predefined and come from a file, or it is inconvenient to use traversal interfaces and a higher-level DSL is required. There is a standard language for XML processing, XPath, that can be useful for these cases. pugixml implements an almost complete subset of XPath 1.0. Because of differences in document object model and some performance implications, there are minor violations of the official specifications, which can be found in <a href="#xpath.w3c">Conformance to W3C specification</a>. The rest of this section describes the interface for XPath functionality. Please note that if you wish to learn to use XPath language, you have to look for other tutorials or manuals; for example, you can read <a href="http://www.w3schools.com/xpath/">W3Schools XPath tutorial</a>, <a href="http://www.tizag.com/xmlTutorial/xpathtutorial.php">XPath tutorial at tizag.com</a>, and <a href="http://www.w3.org/TR/xpath/">the XPath 1.0 specification</a>.
+</div>
+<div class="sect2">
+<h3 id="xpath.types"><a class="anchor" href="#xpath.types"></a>8.1. XPath types</h3>
+<div class="paragraph">
+<a id="xpath_value_type"></a><a id="xpath_type_number"></a><a id="xpath_type_string"></a><a id="xpath_type_boolean"></a><a id="xpath_type_node_set"></a><a id="xpath_type_none"></a>
+Each XPath expression can have one of the following types: boolean, number, string or node set. Boolean type corresponds to <code>bool</code> type, number type corresponds to <code>double</code> type, string type corresponds to either <code>std::string</code> or <code>std::wstring</code>, depending on whether <a href="#dom.unicode">wide character interface is enabled</a>, and node set corresponds to <a href="#xpath_node_set">xpath_node_set</a> type. There is an enumeration, <code>xpath_value_type</code>, which can take the values <code>xpath_type_boolean</code>, <code>xpath_type_number</code>, <code>xpath_type_string</code> or <code>xpath_type_node_set</code>, accordingly.
+</div>
+<div class="paragraph">
+<a id="xpath_node"></a><a id="xpath_node::node"></a><a id="xpath_node::attribute"></a><a id="xpath_node::parent"></a>
+Because an XPath node can be either a node or an attribute, there is a special type, <code>xpath_node</code>, which is a discriminated union of these types. A value of this type contains two node handles, one of <code>xml_node</code> type, and another one of <code>xml_attribute</code> type; at most one of them can be non-null. The accessors to get these handles are available:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_node xpath_node::node() const;
+xml_attribute xpath_node::attribute() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+XPath nodes can be null, in which case both accessors return null handles.
+</div>
+<div class="paragraph">
+Note that as per XPath specification, each XPath node has a parent, which can be retrieved via this function:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xml_node xpath_node::parent() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>parent</code> function returns the node&#8217;s parent if the XPath node corresponds to <code>xml_node</code> handle (equivalent to <code>node().parent()</code>), or the node to which the attribute belongs to, if the XPath node corresponds to <code>xml_attribute</code> handle. For null nodes, <code>parent</code> returns null handle.
+</div>
+<div class="paragraph">
+<a id="xpath_node::unspecified_bool_type"></a><a id="xpath_node::comparison"></a>
+Like node and attribute handles, XPath node handles can be implicitly cast to boolean-like object to check if it is a null node, and also can be compared for equality with each other.
+</div>
+<div id="xpath_node::ctor" class="paragraph">
+You can also create XPath nodes with one of the three constructors: the default constructor, the constructor that takes node argument, and the constructor that takes attribute and node arguments (in which case the attribute must belong to the attribute list of the node). The constructor from <code>xml_node</code> is implicit, so you can usually pass <code>xml_node</code> to functions that expect <code>xpath_node</code>. Apart from that you usually don&#8217;t need to create your own XPath node objects, since they are returned to you via selection functions.
+</div>
+<div id="xpath_node_set" class="paragraph">
+XPath expressions operate not on single nodes, but instead on node sets. A node set is a collection of nodes, which can be optionally ordered in either a forward document order or a reverse one. Document order is defined in XPath specification; an XPath node is before another node in document order if it appears before it in XML representation of the corresponding document.
+</div>
+<div class="paragraph">
+<a id="xpath_node_set::const_iterator"></a><a id="xpath_node_set::begin"></a><a id="xpath_node_set::end"></a>
+Node sets are represented by <code>xpath_node_set</code> object, which has an interface that resembles one of sequential random-access containers. It has an iterator type along with usual begin/past-the-end iterator accessors:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">typedef const xpath_node* xpath_node_set::const_iterator;
+const_iterator xpath_node_set::begin() const;
+const_iterator xpath_node_set::end() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<a id="xpath_node_set::index"></a><a id="xpath_node_set::size"></a><a id="xpath_node_set::empty"></a>
+And it also can be iterated via indices, just like <code>std::vector</code>:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const xpath_node&amp; xpath_node_set::operator[](size_t index) const;
+size_t xpath_node_set::size() const;
+bool xpath_node_set::empty() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+All of the above operations have the same semantics as that of <code>std::vector</code>: the iterators are random-access, all of the above operations are constant time, and accessing the element at index that is greater or equal than the set size results in undefined behavior. You can use both iterator-based and index-based access for iteration, however the iterator-based one can be faster.
+</div>
+<div class="paragraph">
+<a id="xpath_node_set::type"></a><a id="xpath_node_set::type_unsorted"></a><a id="xpath_node_set::type_sorted"></a><a id="xpath_node_set::type_sorted_reverse"></a><a id="xpath_node_set::sort"></a>
+The order of iteration depends on the order of nodes inside the set; the order can be queried via the following function:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">enum xpath_node_set::type_t {type_unsorted, type_sorted, type_sorted_reverse};
+type_t xpath_node_set::type() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>type</code> function returns the current order of nodes; <code>type_sorted</code> means that the nodes are in forward document order, <code>type_sorted_reverse</code> means that the nodes are in reverse document order, and <code>type_unsorted</code> means that neither order is guaranteed (nodes can accidentally be in a sorted order even if <code>type()</code> returns <code>type_unsorted</code>). If you require a specific order of iteration, you can change it via <code>sort</code> function:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">void xpath_node_set::sort(bool reverse = false);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Calling <code>sort</code> sorts the nodes in either forward or reverse document order, depending on the argument; after this call <code>type()</code> will return <code>type_sorted</code> or <code>type_sorted_reverse</code>.
+</div>
+<div id="xpath_node_set::first" class="paragraph">
+Often the actual iteration is not needed; instead, only the first element in document order is required. For this, a special accessor is provided:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xpath_node xpath_node_set::first() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+This function returns the first node in forward document order from the set, or null node if the set is empty. Note that while the result of the node does not depend on the order of nodes in the set (i.e. on the result of <code>type()</code>), the complexity does - if the set is sorted, the complexity is constant, otherwise it is linear in the number of elements or worse.
+</div>
+<div id="xpath_node_set::ctor" class="paragraph">
+While in the majority of cases the node set is returned by XPath functions, sometimes there is a need to manually construct a node set. For such cases, a constructor is provided which takes an iterator range (<code>const_iterator</code> is a typedef for <code>const xpath_node*</code>), and an optional type:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xpath_node_set::xpath_node_set(const_iterator begin, const_iterator end, type_t type = type_unsorted);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+The constructor copies the specified range and sets the specified type. The objects in the range are not checked in any way; you&#8217;ll have to ensure that the range contains no duplicates, and that the objects are sorted according to the <code>type</code> parameter. Otherwise XPath operations with this set may produce unexpected results.
+</div>
+</div>
+<div class="sect2">
+<h3 id="xpath.select"><a class="anchor" href="#xpath.select"></a>8.2. Selecting nodes via XPath expression</h3>
+<div class="paragraph">
+<a id="xml_node::select_node"></a><a id="xml_node::select_nodes"></a>
+If you want to select nodes that match some XPath expression, you can do it with the following functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xpath_node xml_node::select_node(const char_t* query, xpath_variable_set* variables = 0) const;
+xpath_node_set xml_node::select_nodes(const char_t* query, xpath_variable_set* variables = 0) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>select_nodes</code> function compiles the expression and then executes it with the node as a context node, and returns the resulting node set. <code>select_node</code> returns only the first node in document order from the result, and is equivalent to calling <code>select_nodes(query).first()</code>. If the XPath expression does not match anything, or the node handle is null, <code>select_nodes</code> returns an empty set, and <code>select_node</code> returns null XPath node.
+</div>
+<div class="paragraph">
+If exception handling is not disabled, both functions throw <a href="#xpath_exception">xpath_exception</a> if the query can not be compiled or if it returns a value with type other than node set; see <a href="#xpath.errors">Error handling</a> for details.
+</div>
+<div class="paragraph">
+<a id="xml_node::select_node_precomp"></a><a id="xml_node::select_nodes_precomp"></a>
+While compiling expressions is fast, the compilation time can introduce a significant overhead if the same expression is used many times on small subtrees. If you&#8217;re doing many similar queries, consider compiling them into query objects (see <a href="#xpath.query">Using query objects</a> for further reference). Once you get a compiled query object, you can pass it to select functions instead of an expression string:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xpath_node xml_node::select_node(const xpath_query&amp; query) const;
+xpath_node_set xml_node::select_nodes(const xpath_query&amp; query) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+If exception handling is not disabled, both functions throw <a href="#xpath_exception">xpath_exception</a> if the query returns a value with type other than node set.
+</div>
+<div class="paragraph">
+This is an example of selecting nodes using XPath expressions (<a href="samples/xpath_select.cpp" class="bare">samples/xpath_select.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">pugi::xpath_node_set tools = doc.select_nodes(&quot;/Profile/Tools/Tool[@AllowRemote=&#39;true&#39; and @DeriveCaptionFrom=&#39;lastparam&#39;]&quot;);
+
+std::cout &lt;&lt; &quot;Tools:\n&quot;;
+
+for (pugi::xpath_node_set::const_iterator it = tools.begin(); it != tools.end(); ++it)
+{
+ pugi::xpath_node node = *it;
+ std::cout &lt;&lt; node.node().attribute(&quot;Filename&quot;).value() &lt;&lt; &quot;\n&quot;;
+}
+
+pugi::xpath_node build_tool = doc.select_node(&quot;//Tool[contains(Description, &#39;build system&#39;)]&quot;);
+
+if (build_tool)
+ std::cout &lt;&lt; &quot;Build tool: &quot; &lt;&lt; build_tool.node().attribute(&quot;Filename&quot;).value() &lt;&lt; &quot;\n&quot;;</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="xpath.query"><a class="anchor" href="#xpath.query"></a>8.3. Using query objects</h3>
+<div id="xpath_query" class="paragraph">
+When you call <code>select_nodes</code> with an expression string as an argument, a query object is created behind the scenes. A query object represents a compiled XPath expression. Query objects can be needed in the following circumstances:
+</div>
+<div class="ulist">
+<ul>
+<li>
+You can precompile expressions to query objects to save compilation time if it becomes an issue;
+</li>
+<li>
+You can use query objects to evaluate XPath expressions which result in booleans, numbers or strings;
+</li>
+<li>
+You can get the type of expression value via query object.
+</li>
+</ul>
+</div>
+<div class="paragraph">
+Query objects correspond to <code>xpath_query</code> type. They are immutable and non-copyable: they are bound to the expression at creation time and can not be cloned. If you want to put query objects in a container, allocate them on heap via <code>new</code> operator and store pointers to <code>xpath_query</code> in the container.
+</div>
+<div id="xpath_query::ctor" class="paragraph">
+You can create a query object with the constructor that takes XPath expression as an argument:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">explicit xpath_query::xpath_query(const char_t* query, xpath_variable_set* variables = 0);</code></pre>
+</div>
+</div>
+<div id="xpath_query::return_type" class="paragraph">
+The expression is compiled and the compiled representation is stored in the new query object. If compilation fails, <a href="#xpath_exception">xpath_exception</a> is thrown if exception handling is not disabled (see <a href="#xpath.errors">Error handling</a> for details). After the query is created, you can query the type of the evaluation result using the following function:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xpath_value_type xpath_query::return_type() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<a id="xpath_query::evaluate_boolean"></a><a id="xpath_query::evaluate_number"></a><a id="xpath_query::evaluate_string"></a><a id="xpath_query::evaluate_node_set"></a><a id="xpath_query::evaluate_node"></a>
+You can evaluate the query using one of the following functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xpath_query::evaluate_boolean(const xpath_node&amp; n) const;
+double xpath_query::evaluate_number(const xpath_node&amp; n) const;
+string_t xpath_query::evaluate_string(const xpath_node&amp; n) const;
+xpath_node_set xpath_query::evaluate_node_set(const xpath_node&amp; n) const;
+xpath_node xpath_query::evaluate_node(const xpath_node&amp; n) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+All functions take the context node as an argument, compute the expression and return the result, converted to the requested type. According to XPath specification, value of any type can be converted to boolean, number or string value, but no type other than node set can be converted to node set. Because of this, <code>evaluate_boolean</code>, <code>evaluate_number</code> and <code>evaluate_string</code> always return a result, but <code>evaluate_node_set</code> and <code>evaluate_node</code> result in an error if the return type is not node set (see <a href="#xpath.errors">Error handling</a>).
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+Calling <code>node.select_nodes("query")</code> is equivalent to calling <code>xpath_query("query").evaluate_node_set(node)</code>. Calling <code>node.select_node("query")</code> is equivalent to calling <code>xpath_query("query").evaluate_node(node)</code>.
+</td>
+</tr>
+</table>
+</div>
+<div id="xpath_query::evaluate_string_buffer" class="paragraph">
+Note that <code>evaluate_string</code> function returns the STL string; as such, it&#8217;s not available in <a href="#PUGIXML_NO_STL">PUGIXML_NO_STL</a> mode and also usually allocates memory. There is another string evaluation function:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">size_t xpath_query::evaluate_string(char_t* buffer, size_t capacity, const xpath_node&amp; n) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+This function evaluates the string, and then writes the result to <code>buffer</code> (but at most <code>capacity</code> characters); then it returns the full size of the result in characters, including the terminating zero. If <code>capacity</code> is not 0, the resulting buffer is always zero-terminated. You can use this function as follows:
+</div>
+<div class="ulist">
+<ul>
+<li>
+First call the function with <code>buffer = 0</code> and <code>capacity = 0</code>; then allocate the returned amount of characters, and call the function again, passing the allocated storage and the amount of characters;
+</li>
+<li>
+First call the function with small buffer and buffer capacity; then, if the result is larger than the capacity, the output has been trimmed, so allocate a larger buffer and call the function again.
+</li>
+</ul>
+</div>
+<div class="paragraph">
+This is an example of using query objects (<a href="samples/xpath_query.cpp" class="bare">samples/xpath_query.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// Select nodes via compiled query
+pugi::xpath_query query_remote_tools(&quot;/Profile/Tools/Tool[@AllowRemote=&#39;true&#39;]&quot;);
+
+pugi::xpath_node_set tools = query_remote_tools.evaluate_node_set(doc);
+std::cout &lt;&lt; &quot;Remote tool: &quot;;
+tools[2].node().print(std::cout);
+
+// Evaluate numbers via compiled query
+pugi::xpath_query query_timeouts(&quot;sum(//Tool/@Timeout)&quot;);
+std::cout &lt;&lt; query_timeouts.evaluate_number(doc) &lt;&lt; std::endl;
+
+// Evaluate strings via compiled query for different context nodes
+pugi::xpath_query query_name_valid(&quot;string-length(substring-before(@Filename, &#39;_&#39;)) &gt; 0 and @OutputFileMasks&quot;);
+pugi::xpath_query query_name(&quot;concat(substring-before(@Filename, &#39;_&#39;), &#39; produces &#39;, @OutputFileMasks)&quot;);
+
+for (pugi::xml_node tool = doc.first_element_by_path(&quot;Profile/Tools/Tool&quot;); tool; tool = tool.next_sibling())
+{
+ std::string s = query_name.evaluate_string(tool);
+
+ if (query_name_valid.evaluate_boolean(tool)) std::cout &lt;&lt; s &lt;&lt; std::endl;
+}</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="xpath.variables"><a class="anchor" href="#xpath.variables"></a>8.4. Using variables</h3>
+<div class="paragraph">
+XPath queries may contain references to variables; this is useful if you want to use queries that depend on some dynamic parameter without manually preparing the complete query string, or if you want to reuse the same query object for similar queries.
+</div>
+<div class="paragraph">
+Variable references have the form <code>$name</code>; in order to use them, you have to provide a variable set, which includes all variables present in the query with correct types. This set is passed to <code>xpath_query</code> constructor or to <code>select_nodes</code>/<code>select_node</code> functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">explicit xpath_query::xpath_query(const char_t* query, xpath_variable_set* variables = 0);
+xpath_node xml_node::select_node(const char_t* query, xpath_variable_set* variables = 0) const;
+xpath_node_set xml_node::select_nodes(const char_t* query, xpath_variable_set* variables = 0) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+If you&#8217;re using query objects, you can change the variable values before <code>evaluate</code>/<code>select</code> calls to change the query behavior.
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+The variable set pointer is stored in the query object; you have to ensure that the lifetime of the set exceeds that of query object.
+</td>
+</tr>
+</table>
+</div>
+<div id="xpath_variable_set" class="paragraph">
+Variable sets correspond to <code>xpath_variable_set</code> type, which is essentially a variable container.
+</div>
+<div id="xpath_variable_set::add" class="paragraph">
+You can add new variables with the following function:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xpath_variable* xpath_variable_set::add(const char_t* name, xpath_value_type type);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+The function tries to add a new variable with the specified name and type; if the variable with such name does not exist in the set, the function adds a new variable and returns the variable handle; if there is already a variable with the specified name, the function returns the variable handle if variable has the specified type. Otherwise the function returns null pointer; it also returns null pointer on allocation failure.
+</div>
+<div class="paragraph">
+New variables are assigned the default value which depends on the type: <code>0</code> for numbers, <code>false</code> for booleans, empty string for strings and empty set for node sets.
+</div>
+<div id="xpath_variable_set::get" class="paragraph">
+You can get the existing variables with the following functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">xpath_variable* xpath_variable_set::get(const char_t* name);
+const xpath_variable* xpath_variable_set::get(const char_t* name) const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+The functions return the variable handle, or null pointer if the variable with the specified name is not found.
+</div>
+<div id="xpath_variable_set::set" class="paragraph">
+Additionally, there are the helper functions for setting the variable value by name; they try to add the variable with the corresponding type, if it does not exist, and to set the value. If the variable with the same name but with different type is already present, they return <code>false</code>; they also return <code>false</code> on allocation failure. Note that these functions do not perform any type conversions.
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xpath_variable_set::set(const char_t* name, bool value);
+bool xpath_variable_set::set(const char_t* name, double value);
+bool xpath_variable_set::set(const char_t* name, const char_t* value);
+bool xpath_variable_set::set(const char_t* name, const xpath_node_set&amp; value);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+The variable values are copied to the internal variable storage, so you can modify or destroy them after the functions return.
+</div>
+<div id="xpath_variable" class="paragraph">
+If setting variables by name is not efficient enough, or if you have to inspect variable information or get variable values, you can use variable handles. A variable corresponds to the <code>xpath_variable</code> type, and a variable handle is simply a pointer to <code>xpath_variable</code>.
+</div>
+<div class="paragraph">
+<a id="xpath_variable::type"></a><a id="xpath_variable::name"></a>
+In order to get variable information, you can use one of the following functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const char_t* xpath_variable::name() const;
+xpath_value_type xpath_variable::type() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Note that each variable has a distinct type which is specified upon variable creation and can not be changed later.
+</div>
+<div class="paragraph">
+<a id="xpath_variable::get_boolean"></a><a id="xpath_variable::get_number"></a><a id="xpath_variable::get_string"></a><a id="xpath_variable::get_node_set"></a>
+In order to get variable value, you should use one of the following functions, depending on the variable type:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xpath_variable::get_boolean() const;
+double xpath_variable::get_number() const;
+const char_t* xpath_variable::get_string() const;
+const xpath_node_set&amp; xpath_variable::get_node_set() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+These functions return the value of the variable. Note that no type conversions are performed; if the type mismatch occurs, a dummy value is returned (<code>false</code> for booleans, <code>NaN</code> for numbers, empty string for strings and empty set for node sets).
+</div>
+<div id="xpath_variable::set" class="paragraph">
+In order to set variable value, you should use one of the following functions, depending on the variable type:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">bool xpath_variable::set(bool value);
+bool xpath_variable::set(double value);
+bool xpath_variable::set(const char_t* value);
+bool xpath_variable::set(const xpath_node_set&amp; value);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+These functions modify the variable value. Note that no type conversions are performed; if the type mismatch occurs, the functions return <code>false</code>; they also return <code>false</code> on allocation failure. The variable values are copied to the internal variable storage, so you can modify or destroy them after the functions return.
+</div>
+<div class="paragraph">
+This is an example of using variables in XPath queries (<a href="samples/xpath_variables.cpp" class="bare">samples/xpath_variables.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// Select nodes via compiled query
+pugi::xpath_variable_set vars;
+vars.add(&quot;remote&quot;, pugi::xpath_type_boolean);
+
+pugi::xpath_query query_remote_tools(&quot;/Profile/Tools/Tool[@AllowRemote = string($remote)]&quot;, &amp;vars);
+
+vars.set(&quot;remote&quot;, true);
+pugi::xpath_node_set tools_remote = query_remote_tools.evaluate_node_set(doc);
+
+vars.set(&quot;remote&quot;, false);
+pugi::xpath_node_set tools_local = query_remote_tools.evaluate_node_set(doc);
+
+std::cout &lt;&lt; &quot;Remote tool: &quot;;
+tools_remote[2].node().print(std::cout);
+
+std::cout &lt;&lt; &quot;Local tool: &quot;;
+tools_local[0].node().print(std::cout);
+
+// You can pass the context directly to select_nodes/select_node
+pugi::xpath_node_set tools_local_imm = doc.select_nodes(&quot;/Profile/Tools/Tool[@AllowRemote = string($remote)]&quot;, &amp;vars);
+
+std::cout &lt;&lt; &quot;Local tool imm: &quot;;
+tools_local_imm[0].node().print(std::cout);</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="xpath.errors"><a class="anchor" href="#xpath.errors"></a>8.5. Error handling</h3>
+<div class="paragraph">
+There are two different mechanisms for error handling in XPath implementation; the mechanism used depends on whether exception support is disabled (this is controlled with <a href="#PUGIXML_NO_EXCEPTIONS">PUGIXML_NO_EXCEPTIONS</a> define).
+</div>
+<div class="paragraph">
+<a id="xpath_exception"></a><a id="xpath_exception::result"></a><a id="xpath_exception::what"></a>
+By default, XPath functions throw <code>xpath_exception</code> object in case of errors; additionally, in the event any memory allocation fails, an <code>std::bad_alloc</code> exception is thrown. Also <code>xpath_exception</code> is thrown if the query is evaluated to a node set, but the return type is not node set. If the query constructor succeeds (i.e. no exception is thrown), the query object is valid. Otherwise you can get the error details via one of the following functions:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">virtual const char* xpath_exception::what() const throw();
+const xpath_parse_result&amp; xpath_exception::result() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<a id="xpath_query::unspecified_bool_type"></a><a id="xpath_query::result"></a>
+If exceptions are disabled, then in the event of parsing failure the query is initialized to invalid state; you can test if the query object is valid by using it in a boolean expression: <code>if (query) { &#8230;&#8203; }</code>. Additionally, you can get parsing result via the result() accessor:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const xpath_parse_result&amp; xpath_query::result() const;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Without exceptions, evaluating invalid query results in <code>false</code>, empty string, <code>NaN</code> or an empty node set, depending on the type; evaluating a query as a node set results in an empty node set if the return type is not node set.
+</div>
+<div id="xpath_parse_result" class="paragraph">
+The information about parsing result is returned via <code>xpath_parse_result</code> object. It contains parsing status and the offset of last successfully parsed character from the beginning of the source stream:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">struct xpath_parse_result
+{
+ const char* error;
+ ptrdiff_t offset;
+
+ operator bool() const;
+ const char* description() const;
+};</code></pre>
+</div>
+</div>
+<div id="xpath_parse_result::error" class="paragraph">
+Parsing result is represented as the error message; it is either a null pointer, in case there is no error, or the error message in the form of ASCII zero-terminated string.
+</div>
+<div id="xpath_parse_result::description" class="paragraph">
+<code>description()</code> member function can be used to get the error message; it never returns the null pointer, so you can safely use <code>description()</code> even if query parsing succeeded. Note that <code>description()</code> returns a <code>char</code> string even in <code>PUGIXML_WCHAR_MODE</code>; you&#8217;ll have to call <a href="#as_wide">as_wide</a> to get the <code>wchar_t</code> string.
+</div>
+<div id="xpath_parse_result::offset" class="paragraph">
+In addition to the error message, parsing result has an <code>offset</code> member, which contains the offset of last successfully parsed character. This offset is in units of <a href="#char_t">pugi::char_t</a> (bytes for character mode, wide characters for wide character mode).
+</div>
+<div id="xpath_parse_result::bool" class="paragraph">
+Parsing result object can be implicitly converted to <code>bool</code> like this: <code>if (result) { &#8230;&#8203; } else { &#8230;&#8203; }</code>.
+</div>
+<div class="paragraph">
+This is an example of XPath error handling (<a href="samples/xpath_error.cpp" class="bare">samples/xpath_error.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// Exception is thrown for incorrect query syntax
+try
+{
+ doc.select_nodes(&quot;//nodes[#true()]&quot;);
+}
+catch (const pugi::xpath_exception&amp; e)
+{
+ std::cout &lt;&lt; &quot;Select failed: &quot; &lt;&lt; e.what() &lt;&lt; std::endl;
+}
+
+// Exception is thrown for incorrect query semantics
+try
+{
+ doc.select_nodes(&quot;(123)/next&quot;);
+}
+catch (const pugi::xpath_exception&amp; e)
+{
+ std::cout &lt;&lt; &quot;Select failed: &quot; &lt;&lt; e.what() &lt;&lt; std::endl;
+}
+
+// Exception is thrown for query with incorrect return type
+try
+{
+ doc.select_nodes(&quot;123&quot;);
+}
+catch (const pugi::xpath_exception&amp; e)
+{
+ std::cout &lt;&lt; &quot;Select failed: &quot; &lt;&lt; e.what() &lt;&lt; std::endl;
+}</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="xpath.w3c"><a class="anchor" href="#xpath.w3c"></a>8.6. Conformance to W3C specification</h3>
+<div class="paragraph">
+Because of the differences in document object models, performance considerations and implementation complexity, pugixml does not provide a fully conformant XPath 1.0 implementation. This is the current list of incompatibilities:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Consecutive text nodes sharing the same parent are not merged, i.e. in <code>&lt;node&gt;text1 &lt;![CDATA[data]]&gt; text2&lt;/node&gt;</code> node should have one text node child, but instead has three.
+</li>
+<li>
+Since the document type declaration is not used for parsing, <code>id()</code> function always returns an empty node set.
+</li>
+<li>
+Namespace nodes are not supported (affects <code>namespace::</code> axis).
+</li>
+<li>
+Name tests are performed on QNames in XML document instead of expanded names; for <code>&lt;foo xmlns:ns1='uri' xmlns:ns2='uri'&gt;&lt;ns1:child/&gt;&lt;ns2:child/&gt;&lt;/foo&gt;</code>, query <code>foo/ns1:*</code> will return only the first child, not both of them. Compliant XPath implementations can return both nodes if the user provides appropriate namespace declarations.
+</li>
+<li>
+String functions consider a character to be either a single <code>char</code> value or a single <code>wchar_t</code> value, depending on the library configuration; this means that some string functions are not fully Unicode-aware. This affects <code>substring()</code>, <code>string-length()</code> and <code>translate()</code> functions.
+</li>
+</ul>
+</div>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="changes"><a class="anchor" href="#changes"></a>9. Changelog</h2>
+<div class="sectionbody">
+<div class="sect2">
+<h3 id="v1.6"><a class="anchor" href="#v1.6"></a>v1.6 10.04.2015</h3>
+<div class="paragraph">
+Maintenance release. Changes:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Specification changes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Attribute/text values now use more digits when printing floating point numbers to guarantee round-tripping.
+</li>
+<li>
+Text nodes no longer get extra surrounding whitespace when pretty-printing nodes with mixed contents
+</li>
+</ol>
+</div>
+</li>
+<li>
+Bug fixes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Fixed translate and normalize-space XPath functions to no longer return internal NUL characters
+</li>
+<li>
+Fixed buffer overrun on malformed comments inside DOCTYPE sections
+</li>
+<li>
+DOCTYPE parsing can no longer run out of stack space on malformed inputs (XML parsing is now using bounded stack space)
+</li>
+<li>
+Adjusted processing instruction output to avoid malformed documents if the PI value contains <code>?&gt;</code>
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v1.5"><a class="anchor" href="#v1.5"></a>v1.5 27.11.2014</h3>
+<div class="paragraph">
+Major release, featuring a lot of performance improvements and some new features.
+</div>
+<div class="ulist">
+<ul>
+<li>
+Specification changes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+<code>xml_document::load(const char_t*)</code> was renamed to <code>load_string</code>; the old method is still available and will be deprecated in a future release
+</li>
+<li>
+<code>xml_node::select_single_node</code> was renamed to <code>select_node</code>; the old method is still available and will be deprecated in a future release.
+</li>
+</ol>
+</div>
+</li>
+<li>
+New features:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Added <code>xml_node::append_move</code> and other functions for moving nodes within a document
+</li>
+<li>
+Added <code>xpath_query::evaluate_node</code> for evaluating queries with a single node as a result
+</li>
+</ol>
+</div>
+</li>
+<li>
+Performance improvements:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Optimized XML parsing (10-40% faster with clang/gcc, up to 10% faster with MSVC)
+</li>
+<li>
+Optimized memory consumption when copying nodes in the same document (string contents is now shared)
+</li>
+<li>
+Optimized node copying (10% faster for cross-document copies, 3x faster for inter-document copies; also it now consumes a constant amount of stack space)
+</li>
+<li>
+Optimized node output (60% faster; also it now consumes a constant amount of stack space)
+</li>
+<li>
+Optimized XPath allocation (query evaluation now results in fewer temporary allocations)
+</li>
+<li>
+Optimized XPath sorting (node set sorting is 2-3x faster in some cases)
+</li>
+<li>
+Optimized XPath evaluation (XPathMark suite is 100x faster; some commonly used queries are 3-4x faster)
+</li>
+</ol>
+</div>
+</li>
+<li>
+Compatibility improvements:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Fixed <code>xml_node::offset_debug</code> for corner cases
+</li>
+<li>
+Fixed undefined behavior while calling memcpy in some cases
+</li>
+<li>
+Fixed MSVC 2015 compilation warnings
+</li>
+<li>
+Fixed <code>contrib/foreach.hpp</code> for Boost 1.56.0
+</li>
+</ol>
+</div>
+</li>
+<li>
+Bug fixes
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Adjusted comment output to avoid malformed documents if the comment value contains <code>--</code>
+</li>
+<li>
+Fix XPath sorting for documents that were constructed using append_buffer
+</li>
+<li>
+Fix <code>load_file</code> for wide-character paths with non-ASCII characters in MinGW with C&#43;&#43;11 mode enabled
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v1.4"><a class="anchor" href="#v1.4"></a>v1.4 27.02.2014</h3>
+<div class="paragraph">
+Major release, featuring various new features, bug fixes and compatibility improvements.
+</div>
+<div class="ulist">
+<ul>
+<li>
+Specification changes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Documents without element nodes are now rejected with <code>status_no_document_element</code> error, unless <code>parse_fragment</code> option is used
+</li>
+</ol>
+</div>
+</li>
+<li>
+New features:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Added XML fragment parsing (<code>parse_fragment</code> flag)
+</li>
+<li>
+Added PCDATA whitespace trimming (<code>parse_trim_pcdata</code> flag)
+</li>
+<li>
+Added long long support for <code>xml_attribute</code> and <code>xml_text</code> (<code>as_llong</code>, <code>as_ullong</code> and <code>set_value</code>/<code>set</code> overloads)
+</li>
+<li>
+Added hexadecimal integer parsing support for <code>as_int</code>/<code>as_uint</code>/<code>as_llong</code>/<code>as_ullong</code>
+</li>
+<li>
+Added <code>xml_node::append_buffer</code> to improve performance of assembling documents from fragments
+</li>
+<li>
+<code>xml_named_node_iterator</code> is now bidirectional
+</li>
+<li>
+Reduced XPath stack consumption during compilation and evaluation (useful for embedded systems)
+</li>
+</ol>
+</div>
+</li>
+<li>
+Compatibility improvements:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Improved support for platforms without wchar_t support
+</li>
+<li>
+Fixed several false positives in clang static analysis
+</li>
+<li>
+Fixed several compilation warnings for various GCC versions
+</li>
+</ol>
+</div>
+</li>
+<li>
+Bug fixes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Fixed undefined pointer arithmetic in XPath implementation
+</li>
+<li>
+Fixed non-seekable iostream support for certain stream types, i.e. Boost <code>file_source</code> with pipe input
+</li>
+<li>
+Fixed <code>xpath_query::return_type</code> for some expressions
+</li>
+<li>
+Fixed dllexport issues with <code>xml_named_node_iterator</code>
+</li>
+<li>
+Fixed <code>find_child_by_attribute</code> assertion for attributes with null name/value
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v1.2"><a class="anchor" href="#v1.2"></a>v1.2 1.05.2012</h3>
+<div class="paragraph">
+Major release, featuring header-only mode, various interface enhancements (i.e. PCDATA manipulation and C&#43;&#43;11 iteration), many other features and compatibility improvements.
+</div>
+<div class="ulist">
+<ul>
+<li>
+New features:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Added <code>xml_text</code> helper class for working with PCDATA/CDATA contents of an element node
+</li>
+<li>
+Added optional header-only mode (controlled by <code>PUGIXML_HEADER_ONLY</code> define)
+</li>
+<li>
+Added <code>xml_node::children()</code> and <code>xml_node::attributes()</code> for C&#43;&#43;11 ranged for loop or <code>BOOST_FOREACH</code>
+</li>
+<li>
+Added support for Latin-1 (ISO-8859-1) encoding conversion during loading and saving
+</li>
+<li>
+Added custom default values for <code>xml_attribute::as_*</code> (they are returned if the attribute does not exist)
+</li>
+<li>
+Added <code>parse_ws_pcdata_single</code> flag for preserving whitespace-only PCDATA in case it&#8217;s the only child
+</li>
+<li>
+Added <code>format_save_file_text</code> for <code>xml_document::save_file</code> to open files as text instead of binary (changes newlines on Windows)
+</li>
+<li>
+Added <code>format_no_escapes</code> flag to disable special symbol escaping (complements <code>~parse_escapes</code>)
+</li>
+<li>
+Added support for loading document from streams that do not support seeking
+</li>
+<li>
+Added <code>PUGIXML_MEMORY_*</code> constants for tweaking allocation behavior (useful for embedded systems)
+</li>
+<li>
+Added <code>PUGIXML_VERSION</code> preprocessor define
+</li>
+</ol>
+</div>
+</li>
+<li>
+Compatibility improvements:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Parser does not require setjmp support (improves compatibility with some embedded platforms, enables <code>/clr:pure</code> compilation)
+</li>
+<li>
+STL forward declarations are no longer used (fixes SunCC/RWSTL compilation, fixes clang compilation in C&#43;&#43;11 mode)
+</li>
+<li>
+Fixed AirPlay SDK, Android, Windows Mobile (WinCE) and C&#43;&#43;/CLI compilation
+</li>
+<li>
+Fixed several compilation warnings for various GCC versions, Intel C&#43;&#43; compiler and Clang
+</li>
+</ol>
+</div>
+</li>
+<li>
+Bug fixes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Fixed unsafe bool conversion to avoid problems on C&#43;&#43;/CLI
+</li>
+<li>
+Iterator dereference operator is const now (fixes Boost <code>filter_iterator</code> support)
+</li>
+<li>
+<code>xml_document::save_file</code> now checks for file I/O errors during saving
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v1.0"><a class="anchor" href="#v1.0"></a>v1.0 1.11.2010</h3>
+<div class="paragraph">
+Major release, featuring many XPath enhancements, wide character filename support, miscellaneous performance improvements, bug fixes and more.
+</div>
+<div class="ulist">
+<ul>
+<li>
+XPath:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+XPath implementation is moved to <code>pugixml.cpp</code> (which is the only source file now); use <code>PUGIXML_NO_XPATH</code> if you want to disable XPath to reduce code size
+</li>
+<li>
+XPath is now supported without exceptions (<code>PUGIXML_NO_EXCEPTIONS</code>); the error handling mechanism depends on the presence of exception support
+</li>
+<li>
+XPath is now supported without STL (<code>PUGIXML_NO_STL</code>)
+</li>
+<li>
+Introduced variable support
+</li>
+<li>
+Introduced new <code>xpath_query::evaluate_string</code>, which works without STL
+</li>
+<li>
+Introduced new <code>xpath_node_set</code> constructor (from an iterator range)
+</li>
+<li>
+Evaluation function now accept attribute context nodes
+</li>
+<li>
+All internal allocations use custom allocation functions
+</li>
+<li>
+Improved error reporting; now a last parsed offset is returned together with the parsing error
+</li>
+</ol>
+</div>
+</li>
+<li>
+Bug fixes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Fixed memory leak for loading from streams with stream exceptions turned on
+</li>
+<li>
+Fixed custom deallocation function calling with null pointer in one case
+</li>
+<li>
+Fixed missing attributes for iterator category functions; all functions/classes can now be DLL-exported
+</li>
+<li>
+Worked around Digital Mars compiler bug, which lead to minor read overfetches in several functions
+</li>
+<li>
+<code>load_file</code> now works with 2+ Gb files in MSVC/MinGW
+</li>
+<li>
+XPath: fixed memory leaks for incorrect queries
+</li>
+<li>
+XPath: fixed <code>xpath_node()</code> attribute constructor with empty attribute argument
+</li>
+<li>
+XPath: fixed <code>lang()</code> function for non-ASCII arguments
+</li>
+</ol>
+</div>
+</li>
+<li>
+Specification changes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+CDATA nodes containing <code>]]&gt;</code> are printed as several nodes; while this changes the internal structure, this is the only way to escape CDATA contents
+</li>
+<li>
+Memory allocation errors during parsing now preserve last parsed offset (to give an idea about parsing progress)
+</li>
+<li>
+If an element node has the only child, and it is of CDATA type, then the extra indentation is omitted (previously this behavior only held for PCDATA children)
+</li>
+</ol>
+</div>
+</li>
+<li>
+Additional functionality:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Added <code>xml_parse_result</code> default constructor
+</li>
+<li>
+Added <code>xml_document::load_file</code> and <code>xml_document::save_file</code> with wide character paths
+</li>
+<li>
+Added <code>as_utf8</code> and <code>as_wide</code> overloads for <code>std::wstring</code>/<code>std::string</code> arguments
+</li>
+<li>
+Added DOCTYPE node type (<code>node_doctype</code>) and a special parse flag, <code>parse_doctype</code>, to add such nodes to the document during parsing
+</li>
+<li>
+Added <code>parse_full</code> parse flag mask, which extends <code>parse_default</code> with all node type parsing flags except <code>parse_ws_pcdata</code>
+</li>
+<li>
+Added <code>xml_node::hash_value()</code> and <code>xml_attribute::hash_value()</code> functions for use in hash-based containers
+</li>
+<li>
+Added <code>internal_object()</code> and additional constructor for both <code>xml_node</code> and <code>xml_attribute</code> for easier marshalling (useful for language bindings)
+</li>
+<li>
+Added <code>xml_document::document_element()</code> function
+</li>
+<li>
+Added <code>xml_node::prepend_attribute</code>, <code>xml_node::prepend_child</code> and <code>xml_node::prepend_copy</code> functions
+</li>
+<li>
+Added <code>xml_node::append_child</code>, <code>xml_node::prepend_child</code>, <code>xml_node::insert_child_before</code> and <code>xml_node::insert_child_after</code> overloads for element nodes (with name instead of type)
+</li>
+<li>
+Added <code>xml_document::reset()</code> function
+</li>
+</ol>
+</div>
+</li>
+<li>
+Performance improvements:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+<code>xml_node::root()</code> and <code>xml_node::offset_debug()</code> are now O(1) instead of O(logN)
+</li>
+<li>
+Minor parsing optimizations
+</li>
+<li>
+Minor memory optimization for strings in DOM tree (<code>set_name</code>/<code>set_value</code>)
+</li>
+<li>
+Memory optimization for string memory reclaiming in DOM tree (<code>set_name</code>/<code>set_value</code> now reallocate the buffer if memory waste is too big)
+</li>
+<li>
+XPath: optimized document order sorting
+</li>
+<li>
+XPath: optimized child/attribute axis step
+</li>
+<li>
+XPath: optimized number-to-string conversions in MSVC
+</li>
+<li>
+XPath: optimized concat for many arguments
+</li>
+<li>
+XPath: optimized evaluation allocation mechanism: constant and document strings are not heap-allocated
+</li>
+<li>
+XPath: optimized evaluation allocation mechanism: all temporaries' allocations use fast stack-like allocator
+</li>
+</ol>
+</div>
+</li>
+<li>
+Compatibility:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Removed wildcard functions (<code>xml_node::child_w</code>, <code>xml_node::attribute_w</code>, etc.)
+</li>
+<li>
+Removed <code>xml_node::all_elements_by_name</code>
+</li>
+<li>
+Removed <code>xpath_type_t</code> enumeration; use <code>xpath_value_type</code> instead
+</li>
+<li>
+Removed <code>format_write_bom_utf8</code> enumeration; use <code>format_write_bom</code> instead
+</li>
+<li>
+Removed <code>xml_document::precompute_document_order</code>, <code>xml_attribute::document_order</code> and <code>xml_node::document_order</code> functions; document order sort optimization is now automatic
+</li>
+<li>
+Removed <code>xml_document::parse</code> functions and <code>transfer_ownership</code> struct; use <code>xml_document::load_buffer_inplace</code> and <code>xml_document::load_buffer_inplace_own</code> instead
+</li>
+<li>
+Removed <code>as_utf16</code> function; use <code>as_wide</code> instead
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v0.9"><a class="anchor" href="#v0.9"></a>v0.9 1.07.2010</h3>
+<div class="paragraph">
+Major release, featuring extended and improved Unicode support, miscellaneous performance improvements, bug fixes and more.
+</div>
+<div class="ulist">
+<ul>
+<li>
+Major Unicode improvements:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Introduced encoding support (automatic/manual encoding detection on load, manual encoding selection on save, conversion from/to UTF8, UTF16 LE/BE, UTF32 LE/BE)
+</li>
+<li>
+Introduced <code>wchar_t</code> mode (you can set <code>PUGIXML_WCHAR_MODE</code> define to switch pugixml internal encoding from UTF8 to <code>wchar_t</code>; all functions are switched to their Unicode variants)
+</li>
+<li>
+Load/save functions now support wide streams
+</li>
+</ol>
+</div>
+</li>
+<li>
+Bug fixes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Fixed document corruption on failed parsing bug
+</li>
+<li>
+XPath string/number conversion improvements (increased precision, fixed crash for huge numbers)
+</li>
+<li>
+Improved DOCTYPE parsing: now parser recognizes all well-formed DOCTYPE declarations
+</li>
+<li>
+Fixed <code>xml_attribute::as_uint()</code> for large numbers (i.e. 232-1)
+</li>
+<li>
+Fixed <code>xml_node::first_element_by_path</code> for path components that are prefixes of node names, but are not exactly equal to them.
+</li>
+</ol>
+</div>
+</li>
+<li>
+Specification changes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+<code>parse()</code> API changed to <code>load_buffer</code>/<code>load_buffer_inplace</code>/<code>load_buffer_inplace_own</code>; <code>load_buffer</code> APIs do not require zero-terminated strings.
+</li>
+<li>
+Renamed <code>as_utf16</code> to <code>as_wide</code>
+</li>
+<li>
+Changed <code>xml_node::offset_debug</code> return type and <code>xml_parse_result::offset</code> type to <code>ptrdiff_t</code>
+</li>
+<li>
+Nodes/attributes with empty names are now printed as <code>:anonymous</code>
+</li>
+</ol>
+</div>
+</li>
+<li>
+Performance improvements:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Optimized document parsing and saving
+</li>
+<li>
+Changed internal memory management: internal allocator is used for both metadata and name/value data; allocated pages are deleted if all allocations from them are deleted
+</li>
+<li>
+Optimized memory consumption: <code>sizeof(xml_node_struct)</code> reduced from 40 bytes to 32 bytes on x86
+</li>
+<li>
+Optimized debug mode parsing/saving by order of magnitude
+</li>
+</ol>
+</div>
+</li>
+<li>
+Miscellaneous:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+All STL includes except <code>&lt;exception&gt;</code> in <code>pugixml.hpp</code> are replaced with forward declarations
+</li>
+<li>
+<code>xml_node::remove_child</code> and <code>xml_node::remove_attribute</code> now return the operation result
+</li>
+</ol>
+</div>
+</li>
+<li>
+Compatibility:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+<code>parse()</code> and <code>as_utf16</code> are left for compatibility (these functions are deprecated and will be removed in version 1.0)
+</li>
+<li>
+Wildcard functions, <code>document_order</code>/<code>precompute_document_order</code> functions, <code>all_elements_by_name</code> function and <code>format_write_bom_utf8</code> flag are deprecated and will be removed in version 1.0
+</li>
+<li>
+<code>xpath_type_t</code> enumeration was renamed to <code>xpath_value_type</code>; <code>xpath_type_t</code> is deprecated and will be removed in version 1.0
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v0.5"><a class="anchor" href="#v0.5"></a>v0.5 8.11.2009</h3>
+<div class="paragraph">
+Major bugfix release. Changes:
+</div>
+<div class="ulist">
+<ul>
+<li>
+XPath bugfixes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Fixed <code>translate()</code>, <code>lang()</code> and <code>concat()</code> functions (infinite loops/crashes)
+</li>
+<li>
+Fixed compilation of queries with empty literal strings (<code>""</code>)
+</li>
+<li>
+Fixed axis tests: they never add empty nodes/attributes to the resulting node set now
+</li>
+<li>
+Fixed string-value evaluation for node-set (the result excluded some text descendants)
+</li>
+<li>
+Fixed <code>self::</code> axis (it behaved like <code>ancestor-or-self::</code>)
+</li>
+<li>
+Fixed <code>following::</code> and <code>preceding::</code> axes (they included descendent and ancestor nodes, respectively)
+</li>
+<li>
+Minor fix for <code>namespace-uri()</code> function (namespace declaration scope includes the parent element of namespace declaration attribute)
+</li>
+<li>
+Some incorrect queries are no longer parsed now (i.e. <code>foo: *</code>)
+</li>
+<li>
+Fixed <code>text()</code>/etc. node test parsing bug (i.e. <code>foo[text()]</code> failed to compile)
+</li>
+<li>
+Fixed root step (<code>/</code>) - it now selects empty node set if query is evaluated on empty node
+</li>
+<li>
+Fixed string to number conversion (<code>"123 "</code> converted to NaN, <code>"123 .456"</code> converted to 123.456 - now the results are 123 and NaN, respectively)
+</li>
+<li>
+Node set copying now preserves sorted type; leads to better performance on some queries
+</li>
+</ol>
+</div>
+</li>
+<li>
+Miscellaneous bugfixes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Fixed <code>xml_node::offset_debug</code> for PI nodes
+</li>
+<li>
+Added empty attribute checks to <code>xml_node::remove_attribute</code>
+</li>
+<li>
+Fixed <code>node_pi</code> and <code>node_declaration</code> copying
+</li>
+<li>
+Const-correctness fixes
+</li>
+</ol>
+</div>
+</li>
+<li>
+Specification changes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+<code>xpath_node::select_nodes()</code> and related functions now throw exception if expression return type is not node set (instead of assertion)
+</li>
+<li>
+<code>xml_node::traverse()</code> now sets depth to -1 for both <code>begin()</code> and <code>end()</code> callbacks (was 0 at <code>begin()</code> and -1 at <code>end()</code>)
+</li>
+<li>
+In case of non-raw node printing a newline is output after PCDATA inside nodes if the PCDATA has siblings
+</li>
+<li>
+UTF8 &#8594; <code>wchar_t</code> conversion now considers 5-byte UTF8-like sequences as invalid
+</li>
+</ol>
+</div>
+</li>
+<li>
+New features:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Added <code>xpath_node_set::operator[]</code> for index-based iteration
+</li>
+<li>
+Added <code>xpath_query::return_type()</code>
+</li>
+<li>
+Added getter accessors for memory-management functions
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v0.42"><a class="anchor" href="#v0.42"></a>v0.42 17.09.2009</h3>
+<div class="paragraph">
+Maintenance release. Changes:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Bug fixes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Fixed deallocation in case of custom allocation functions or if <code>delete[]</code> / <code>free</code> are incompatible
+</li>
+<li>
+XPath parser fixed for incorrect queries (i.e. incorrect XPath queries should now always fail to compile)
+</li>
+<li>
+Const-correctness fixes for <code>find_child_by_attribute</code>
+</li>
+<li>
+Improved compatibility (miscellaneous warning fixes, fixed <code>&lt;cstring&gt;</code> include dependency for GCC)
+</li>
+<li>
+Fixed iterator begin/end and print function to work correctly for empty nodes
+</li>
+</ol>
+</div>
+</li>
+<li>
+New features:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Added <code>PUGIXML_API</code>/<code>PUGIXML_CLASS</code>/<code>PUGIXML_FUNCTION</code> configuration macros to control class/function attributes
+</li>
+<li>
+Added <code>xml_attribute::set_value</code> overloads for different types
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v0.41"><a class="anchor" href="#v0.41"></a>v0.41 8.02.2009</h3>
+<div class="paragraph">
+Maintenance release. Changes:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Bug fixes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Fixed bug with node printing (occasionally some content was not written to output stream)
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v0.4"><a class="anchor" href="#v0.4"></a>v0.4 18.01.2009</h3>
+<div class="paragraph">
+Changes:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Bug fixes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Documentation fix in samples for <code>parse()</code> with manual lifetime control
+</li>
+<li>
+Fixed document order sorting in XPath (it caused wrong order of nodes after <code>xpath_node_set::sort</code> and wrong results of some XPath queries)
+</li>
+</ol>
+</div>
+</li>
+<li>
+Node printing changes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Single quotes are no longer escaped when printing nodes
+</li>
+<li>
+Symbols in second half of ASCII table are no longer escaped when printing nodes; because of this, <code>format_utf8</code> flag is deleted as it&#8217;s no longer needed and <code>format_write_bom</code> is renamed to <code>format_write_bom_utf8</code>.
+</li>
+<li>
+Reworked node printing - now it works via <code>xml_writer</code> interface; implementations for <code>FILE*</code> and <code>std::ostream</code> are available. As a side-effect, <code>xml_document::save_file</code> now works without STL.
+</li>
+</ol>
+</div>
+</li>
+<li>
+New features:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Added unsigned integer support for attributes (<code>xml_attribute::as_uint</code>, <code>xml_attribute::operator=</code>)
+</li>
+<li>
+Now document declaration (<code>&lt;?xml &#8230;&#8203;?&gt;</code>) is parsed as node with type <code>node_declaration</code> when <code>parse_declaration</code> flag is specified (access to encoding/version is performed as if they were attributes, i.e. <code>doc.child("xml").attribute("version").as_float()</code>); corresponding flags for node printing were also added
+</li>
+<li>
+Added support for custom memory management (see <code>set_memory_management_functions</code> for details)
+</li>
+<li>
+Implemented node/attribute copying (see <code>xml_node::insert_copy_*</code> and <code>xml_node::append_copy</code> for details)
+</li>
+<li>
+Added <code>find_child_by_attribute</code> and <code>find_child_by_attribute_w</code> to simplify parsing code in some cases (i.e. COLLADA files)
+</li>
+<li>
+Added file offset information querying for debugging purposes (now you&#8217;re able to determine exact location of any <code>xml_node</code> in parsed file, see <code>xml_node::offset_debug</code> for details)
+</li>
+<li>
+Improved error handling for parsing - now <code>load()</code>, <code>load_file()</code> and <code>parse()</code> return <code>xml_parse_result</code>, which contains error code and last parsed offset; this does not break old interface as <code>xml_parse_result</code> can be implicitly casted to <code>bool</code>.
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v0.34"><a class="anchor" href="#v0.34"></a>v0.34 31.10.2007</h3>
+<div class="paragraph">
+Maintenance release. Changes:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Bug fixes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Fixed bug with loading from text-mode iostreams
+</li>
+<li>
+Fixed leak when <code>transfer_ownership</code> is true and parsing is failing
+</li>
+<li>
+Fixed bug in saving (<code>\r</code> and <code>\n</code> are now escaped in attribute values)
+</li>
+<li>
+Renamed <code>free()</code> to <code>destroy()</code> - some macro conflicts were reported
+</li>
+</ol>
+</div>
+</li>
+<li>
+New features:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Improved compatibility (supported Digital Mars C&#43;&#43;, MSVC 6, CodeWarrior 8, PGI C&#43;&#43;, Comeau, supported PS3 and XBox360)
+</li>
+<li>
+<code>PUGIXML_NO_EXCEPTION</code> flag for platforms without exception handling
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v0.3"><a class="anchor" href="#v0.3"></a>v0.3 21.02.2007</h3>
+<div class="paragraph">
+Refactored, reworked and improved version. Changes:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Interface:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Added XPath
+</li>
+<li>
+Added tree modification functions
+</li>
+<li>
+Added no STL compilation mode
+</li>
+<li>
+Added saving document to file
+</li>
+<li>
+Refactored parsing flags
+</li>
+<li>
+Removed <code>xml_parser</code> class in favor of <code>xml_document</code>
+</li>
+<li>
+Added transfer ownership parsing mode
+</li>
+<li>
+Modified the way <code>xml_tree_walker</code> works
+</li>
+<li>
+Iterators are now non-constant
+</li>
+</ol>
+</div>
+</li>
+<li>
+Implementation:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Support of several compilers and platforms
+</li>
+<li>
+Refactored and sped up parsing core
+</li>
+<li>
+Improved standard compliancy
+</li>
+<li>
+Added XPath implementation
+</li>
+<li>
+Fixed several bugs
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v0.2"><a class="anchor" href="#v0.2"></a>v0.2 6.11.2006</h3>
+<div class="paragraph">
+First public release. Changes:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Bug fixes:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Fixed <code>child_value()</code> (for empty nodes)
+</li>
+<li>
+Fixed <code>xml_parser_impl</code> warning at W4
+</li>
+</ol>
+</div>
+</li>
+<li>
+New features:
+<div class="olist arabic">
+<ol class="arabic">
+<li>
+Introduced <code>child_value(name)</code> and <code>child_value_w(name)</code>
+</li>
+<li>
+<code>parse_eol_pcdata</code> and <code>parse_eol_attribute</code> flags + <code>parse_minimal</code> optimizations
+</li>
+<li>
+Optimizations of <code>strconv_t</code>
+</li>
+</ol>
+</div>
+</li>
+</ul>
+</div>
+</div>
+<div class="sect2">
+<h3 id="v0.1"><a class="anchor" href="#v0.1"></a>v0.1 15.07.2006</h3>
+<div class="paragraph">
+First private release for testing purposes
+</div>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="apiref"><a class="anchor" href="#apiref"></a>10. API Reference</h2>
+<div class="sectionbody">
+<div class="paragraph">
+This is the reference for all macros, types, enumerations, classes and functions in pugixml. Each symbol is a link that leads to the relevant section of the manual.
+</div>
+<div class="sect2">
+<h3 id="apiref.macros"><a class="anchor" href="#apiref.macros"></a>10.1. Macros</h3>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">#define <a href="#PUGIXML_WCHAR_MODE">PUGIXML_WCHAR_MODE</a>
+#define <a href="#PUGIXML_NO_XPATH">PUGIXML_NO_XPATH</a>
+#define <a href="#PUGIXML_NO_STL">PUGIXML_NO_STL</a>
+#define <a href="#PUGIXML_NO_EXCEPTIONS">PUGIXML_NO_EXCEPTIONS</a>
+#define <a href="#PUGIXML_API">PUGIXML_API</a>
+#define <a href="#PUGIXML_CLASS">PUGIXML_CLASS</a>
+#define <a href="#PUGIXML_FUNCTION">PUGIXML_FUNCTION</a>
+#define <a href="#PUGIXML_MEMORY_PAGE_SIZE">PUGIXML_MEMORY_PAGE_SIZE</a>
+#define <a href="#PUGIXML_MEMORY_OUTPUT_STACK">PUGIXML_MEMORY_OUTPUT_STACK</a>
+#define <a href="#PUGIXML_MEMORY_XPATH_PAGE_SIZE">PUGIXML_MEMORY_XPATH_PAGE_SIZE</a>
+#define <a href="#PUGIXML_HEADER_ONLY">PUGIXML_HEADER_ONLY</a>
+#define <a href="#PUGIXML_HAS_LONG_LONG">PUGIXML_HAS_LONG_LONG</a></code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="apiref.types"><a class="anchor" href="#apiref.types"></a>10.2. Types</h3>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">typedef configuration-defined-type <a href="#char_t">char_t</a>;
+typedef configuration-defined-type <a href="#string_t">string_t</a>;
+typedef void* (*<a href="#allocation_function">allocation_function</a>)(size_t size);
+typedef void (*<a href="#deallocation_function">deallocation_function</a>)(void* ptr);</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="apiref.enums"><a class="anchor" href="#apiref.enums"></a>10.3. Enumerations</h3>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">enum <a href="#xml_node_type">xml_node_type</a>
+ <a href="#node_null">node_null</a>
+ <a href="#node_document">node_document</a>
+ <a href="#node_element">node_element</a>
+ <a href="#node_pcdata">node_pcdata</a>
+ <a href="#node_cdata">node_cdata</a>
+ <a href="#node_comment">node_comment</a>
+ <a href="#node_pi">node_pi</a>
+ <a href="#node_declaration">node_declaration</a>
+ <a href="#node_doctype">node_doctype</a>
+
+enum <a href="#xml_parse_status">xml_parse_status</a>
+ <a href="#status_ok">status_ok</a>
+ <a href="#status_file_not_found">status_file_not_found</a>
+ <a href="#status_io_error">status_io_error</a>
+ <a href="#status_out_of_memory">status_out_of_memory</a>
+ <a href="#status_internal_error">status_internal_error</a>
+ <a href="#status_unrecognized_tag">status_unrecognized_tag</a>
+ <a href="#status_bad_pi">status_bad_pi</a>
+ <a href="#status_bad_comment">status_bad_comment</a>
+ <a href="#status_bad_cdata">status_bad_cdata</a>
+ <a href="#status_bad_doctype">status_bad_doctype</a>
+ <a href="#status_bad_pcdata">status_bad_pcdata</a>
+ <a href="#status_bad_start_element">status_bad_start_element</a>
+ <a href="#status_bad_attribute">status_bad_attribute</a>
+ <a href="#status_bad_end_element">status_bad_end_element</a>
+ <a href="#status_end_element_mismatch">status_end_element_mismatch</a>
+ <a href="#status_append_invalid_root">status_append_invalid_root</a>
+ <a href="#status_no_document_element">status_no_document_element</a>
+
+enum <a href="#xml_encoding">xml_encoding</a>
+ <a href="#encoding_auto">encoding_auto</a>
+ <a href="#encoding_utf8">encoding_utf8</a>
+ <a href="#encoding_utf16_le">encoding_utf16_le</a>
+ <a href="#encoding_utf16_be">encoding_utf16_be</a>
+ <a href="#encoding_utf16">encoding_utf16</a>
+ <a href="#encoding_utf32_le">encoding_utf32_le</a>
+ <a href="#encoding_utf32_be">encoding_utf32_be</a>
+ <a href="#encoding_utf32">encoding_utf32</a>
+ <a href="#encoding_wchar">encoding_wchar</a>
+ <a href="#encoding_latin1">encoding_latin1</a>
+
+enum <a href="#xpath_value_type">xpath_value_type</a>
+ <a href="#xpath_type_none">xpath_type_none</a>
+ <a href="#xpath_type_node_set">xpath_type_node_set</a>
+ <a href="#xpath_type_number">xpath_type_number</a>
+ <a href="#xpath_type_string">xpath_type_string</a>
+ <a href="#xpath_type_boolean">xpath_type_boolean</a></code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="apiref.constants"><a class="anchor" href="#apiref.constants"></a>10.4. Constants</h3>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// Formatting options bit flags:
+const unsigned int <a href="#format_default">format_default</a>
+const unsigned int <a href="#format_indent">format_indent</a>
+const unsigned int <a href="#format_no_declaration">format_no_declaration</a>
+const unsigned int <a href="#format_no_escapes">format_no_escapes</a>
+const unsigned int <a href="#format_raw">format_raw</a>
+const unsigned int <a href="#format_save_file_text">format_save_file_text</a>
+const unsigned int <a href="#format_write_bom">format_write_bom</a>
+
+// Parsing options bit flags:
+const unsigned int <a href="#parse_cdata">parse_cdata</a>
+const unsigned int <a href="#parse_comments">parse_comments</a>
+const unsigned int <a href="#parse_declaration">parse_declaration</a>
+const unsigned int <a href="#parse_default">parse_default</a>
+const unsigned int <a href="#parse_doctype">parse_doctype</a>
+const unsigned int <a href="#parse_eol">parse_eol</a>
+const unsigned int <a href="#parse_escapes">parse_escapes</a>
+const unsigned int <a href="#parse_fragment">parse_fragment</a>
+const unsigned int <a href="#parse_full">parse_full</a>
+const unsigned int <a href="#parse_minimal">parse_minimal</a>
+const unsigned int <a href="#parse_pi">parse_pi</a>
+const unsigned int <a href="#parse_trim_pcdata">parse_trim_pcdata</a>
+const unsigned int <a href="#parse_ws_pcdata">parse_ws_pcdata</a>
+const unsigned int <a href="#parse_ws_pcdata_single">parse_ws_pcdata_single</a>
+const unsigned int <a href="#parse_wconv_attribute">parse_wconv_attribute</a>
+const unsigned int <a href="#parse_wnorm_attribute">parse_wnorm_attribute</a></code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="apiref.classes"><a class="anchor" href="#apiref.classes"></a>10.5. Classes</h3>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">class <a href="#xml_attribute">xml_attribute</a>
+ <a href="#xml_attribute::ctor">xml_attribute</a>();
+
+ bool <a href="#xml_attribute::empty">empty</a>() const;
+ operator <a href="#xml_attribute::unspecified_bool_type">unspecified_bool_type</a>() const;
+
+ bool <a href="#xml_attribute::comparison">operator==</a>(const xml_attribute&amp; r) const;
+ bool <a href="#xml_attribute::comparison">operator!=</a>(const xml_attribute&amp; r) const;
+ bool <a href="#xml_attribute::comparison">operator&lt;</a>(const xml_attribute&amp; r) const;
+ bool <a href="#xml_attribute::comparison">operator&gt;</a>(const xml_attribute&amp; r) const;
+ bool <a href="#xml_attribute::comparison">operator&lt;=</a>(const xml_attribute&amp; r) const;
+ bool <a href="#xml_attribute::comparison">operator&gt;=</a>(const xml_attribute&amp; r) const;
+
+ size_t <a href="#xml_attribute::hash_value">hash_value</a>() const;
+
+ xml_attribute <a href="#xml_attribute::next_attribute">next_attribute</a>() const;
+ xml_attribute <a href="#xml_attribute::previous_attribute">previous_attribute</a>() const;
+
+ const char_t* <a href="#xml_attribute::name">name</a>() const;
+ const char_t* <a href="#xml_attribute::value">value</a>() const;
+
+ const char_t* <a href="#xml_attribute::as_string">as_string</a>(const char_t* def = &quot;&quot;) const;
+ int <a href="#xml_attribute::as_int">as_int</a>(int def = 0) const;
+ unsigned int <a href="#xml_attribute::as_uint">as_uint</a>(unsigned int def = 0) const;
+ double <a href="#xml_attribute::as_double">as_double</a>(double def = 0) const;
+ float <a href="#xml_attribute::as_float">as_float</a>(float def = 0) const;
+ bool <a href="#xml_attribute::as_bool">as_bool</a>(bool def = false) const;
+ long long <a href="#xml_attribute::as_llong">as_llong</a>(long long def = 0) const;
+ unsigned long long <a href="#xml_attribute::as_ullong">as_ullong</a>(unsigned long long def = 0) const;
+
+ bool <a href="#xml_attribute::set_name">set_name</a>(const char_t* rhs);
+ bool <a href="#xml_attribute::set_value">set_value</a>(const char_t* rhs);
+ bool <a href="#xml_attribute::set_value">set_value</a>(int rhs);
+ bool <a href="#xml_attribute::set_value">set_value</a>(unsigned int rhs);
+ bool <a href="#xml_attribute::set_value">set_value</a>(double rhs);
+ bool <a href="#xml_attribute::set_value">set_value</a>(float rhs);
+ bool <a href="#xml_attribute::set_value">set_value</a>(bool rhs);
+ bool <a href="#xml_attribute::set_value">set_value</a>(long long rhs);
+ bool <a href="#xml_attribute::set_value">set_value</a>(unsigned long long rhs);
+
+ xml_attribute&amp; <a href="#xml_attribute::assign">operator=</a>(const char_t* rhs);
+ xml_attribute&amp; <a href="#xml_attribute::assign">operator=</a>(int rhs);
+ xml_attribute&amp; <a href="#xml_attribute::assign">operator=</a>(unsigned int rhs);
+ xml_attribute&amp; <a href="#xml_attribute::assign">operator=</a>(double rhs);
+ xml_attribute&amp; <a href="#xml_attribute::assign">operator=</a>(float rhs);
+ xml_attribute&amp; <a href="#xml_attribute::assign">operator=</a>(bool rhs);
+ xml_attribute&amp; <a href="#xml_attribute::assign">operator=</a>(long long rhs);
+ xml_attribute&amp; <a href="#xml_attribute::assign">operator=</a>(unsnigned long long rhs);
+
+class <a href="#xml_node">xml_node</a>
+ <a href="#xml_node::ctor">xml_node</a>();
+
+ bool <a href="#xml_node::empty">empty</a>() const;
+ operator <a href="#xml_node::unspecified_bool_type">unspecified_bool_type</a>() const;
+
+ bool <a href="#xml_node::comparison">operator==</a>(const xml_node&amp; r) const;
+ bool <a href="#xml_node::comparison">operator!=</a>(const xml_node&amp; r) const;
+ bool <a href="#xml_node::comparison">operator&lt;</a>(const xml_node&amp; r) const;
+ bool <a href="#xml_node::comparison">operator&gt;</a>(const xml_node&amp; r) const;
+ bool <a href="#xml_node::comparison">operator&lt;=</a>(const xml_node&amp; r) const;
+ bool <a href="#xml_node::comparison">operator&gt;=</a>(const xml_node&amp; r) const;
+
+ size_t <a href="#xml_node::hash_value">hash_value</a>() const;
+
+ xml_node_type <a href="#xml_node::type">type</a>() const;
+
+ const char_t* <a href="#xml_node::name">name</a>() const;
+ const char_t* <a href="#xml_node::value">value</a>() const;
+
+ xml_node <a href="#xml_node::parent">parent</a>() const;
+ xml_node <a href="#xml_node::first_child">first_child</a>() const;
+ xml_node <a href="#xml_node::last_child">last_child</a>() const;
+ xml_node <a href="#xml_node::next_sibling">next_sibling</a>() const;
+ xml_node <a href="#xml_node::previous_sibling">previous_sibling</a>() const;
+
+ xml_attribute <a href="#xml_node::first_attribute">first_attribute</a>() const;
+ xml_attribute <a href="#xml_node::last_attribute">last_attribute</a>() const;
+
+ implementation-defined-type <a href="#xml_node::children">children</a>() const;
+ implementation-defined-type <a href="#xml_node::children">children</a>(const char_t* name) const;
+ implementation-defined-type <a href="#xml_node::attributes">attributes</a>() const;
+
+ xml_node <a href="#xml_node::child">child</a>(const char_t* name) const;
+ xml_attribute <a href="#xml_node::attribute">attribute</a>(const char_t* name) const;
+ xml_node <a href="#xml_node::next_sibling_name">next_sibling</a>(const char_t* name) const;
+ xml_node <a href="#xml_node::previous_sibling_name">previous_sibling</a>(const char_t* name) const;
+ xml_node <a href="#xml_node::find_child_by_attribute">find_child_by_attribute</a>(const char_t* name, const char_t* attr_name, const char_t* attr_value) const;
+ xml_node <a href="#xml_node::find_child_by_attribute">find_child_by_attribute</a>(const char_t* attr_name, const char_t* attr_value) const;
+
+ const char_t* <a href="#xml_node::child_value">child_value</a>() const;
+ const char_t* <a href="#xml_node::child_value">child_value</a>(const char_t* name) const;
+ xml_text <a href="#xml_node::text">text</a>() const;
+
+ typedef xml_node_iterator <a href="#xml_node_iterator">iterator</a>;
+ iterator <a href="#xml_node::begin">begin</a>() const;
+ iterator <a href="#xml_node::end">end</a>() const;
+
+ typedef xml_attribute_iterator <a href="#xml_attribute_iterator">attribute_iterator</a>;
+ attribute_iterator <a href="#xml_node::attributes_begin">attributes_begin</a>() const;
+ attribute_iterator <a href="#xml_node::attributes_end">attributes_end</a>() const;
+
+ bool <a href="#xml_node::traverse">traverse</a>(xml_tree_walker&amp; walker);
+
+ template &lt;typename Predicate&gt; xml_attribute <a href="#xml_node::find_attribute">find_attribute</a>(Predicate pred) const;
+ template &lt;typename Predicate&gt; xml_node <a href="#xml_node::find_child">find_child</a>(Predicate pred) const;
+ template &lt;typename Predicate&gt; xml_node <a href="#xml_node::find_node">find_node</a>(Predicate pred) const;
+
+ string_t <a href="#xml_node::path">path</a>(char_t delimiter = &#39;/&#39;) const;
+ xml_node <a href="#xml_node::first_element_by_path">xml_node::first_element_by_path</a>(const char_t* path, char_t delimiter = &#39;/&#39;) const;
+ xml_node <a href="#xml_node::root">root</a>() const;
+ ptrdiff_t <a href="#xml_node::offset_debug">offset_debug</a>() const;
+
+ bool <a href="#xml_node::set_name">set_name</a>(const char_t* rhs);
+ bool <a href="#xml_node::set_value">set_value</a>(const char_t* rhs);
+
+ xml_attribute <a href="#xml_node::append_attribute">append_attribute</a>(const char_t* name);
+ xml_attribute <a href="#xml_node::prepend_attribute">prepend_attribute</a>(const char_t* name);
+ xml_attribute <a href="#xml_node::insert_attribute_after">insert_attribute_after</a>(const char_t* name, const xml_attribute&amp; attr);
+ xml_attribute <a href="#xml_node::insert_attribute_before">insert_attribute_before</a>(const char_t* name, const xml_attribute&amp; attr);
+
+ xml_node <a href="#xml_node::append_child">append_child</a>(xml_node_type type = node_element);
+ xml_node <a href="#xml_node::prepend_child">prepend_child</a>(xml_node_type type = node_element);
+ xml_node <a href="#xml_node::insert_child_after">insert_child_after</a>(xml_node_type type, const xml_node&amp; node);
+ xml_node <a href="#xml_node::insert_child_before">insert_child_before</a>(xml_node_type type, const xml_node&amp; node);
+
+ xml_node <a href="#xml_node::append_child">append_child</a>(const char_t* name);
+ xml_node <a href="#xml_node::prepend_child">prepend_child</a>(const char_t* name);
+ xml_node <a href="#xml_node::insert_child_after">insert_child_after</a>(const char_t* name, const xml_node&amp; node);
+ xml_node <a href="#xml_node::insert_child_before">insert_child_before</a>(const char_t* name, const xml_node&amp; node);
+
+ xml_attribute <a href="#xml_node::append_copy">append_copy</a>(const xml_attribute&amp; proto);
+ xml_attribute <a href="#xml_node::prepend_copy">prepend_copy</a>(const xml_attribute&amp; proto);
+ xml_attribute <a href="#xml_node::insert_copy_after">insert_copy_after</a>(const xml_attribute&amp; proto, const xml_attribute&amp; attr);
+ xml_attribute <a href="#xml_node::insert_copy_before">insert_copy_before</a>(const xml_attribute&amp; proto, const xml_attribute&amp; attr);
+
+ xml_node <a href="#xml_node::append_copy">append_copy</a>(const xml_node&amp; proto);
+ xml_node <a href="#xml_node::prepend_copy">prepend_copy</a>(const xml_node&amp; proto);
+ xml_node <a href="#xml_node::insert_copy_after">insert_copy_after</a>(const xml_node&amp; proto, const xml_node&amp; node);
+ xml_node <a href="#xml_node::insert_copy_before">insert_copy_before</a>(const xml_node&amp; proto, const xml_node&amp; node);
+
+ xml_node <a href="#xml_node::append_move">append_move</a>(const xml_node&amp; moved);
+ xml_node <a href="#xml_node::prepend_move">prepend_move</a>(const xml_node&amp; moved);
+ xml_node <a href="#xml_node::insert_move_after">insert_move_after</a>(const xml_node&amp; moved, const xml_node&amp; node);
+ xml_node <a href="#xml_node::insert_move_before">insert_move_before</a>(const xml_node&amp; moved, const xml_node&amp; node);
+
+ bool <a href="#xml_node::remove_attribute">remove_attribute</a>(const xml_attribute&amp; a);
+ bool <a href="#xml_node::remove_attribute">remove_attribute</a>(const char_t* name);
+ bool <a href="#xml_node::remove_child">remove_child</a>(const xml_node&amp; n);
+ bool <a href="#xml_node::remove_child">remove_child</a>(const char_t* name);
+
+ xml_parse_result <a href="#xml_node::append_buffer">append_buffer</a>(const void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+ void <a href="#xml_node::print">print</a>(xml_writer&amp; writer, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, xml_encoding encoding = encoding_auto, unsigned int depth = 0) const;
+ void <a href="#xml_node::print_stream">print</a>(std::ostream&amp; os, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, xml_encoding encoding = encoding_auto, unsigned int depth = 0) const;
+ void <a href="#xml_node::print_stream">print</a>(std::wostream&amp; os, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, unsigned int depth = 0) const;
+
+ xpath_node <a href="#xml_node::select_node">select_node</a>(const char_t* query, xpath_variable_set* variables = 0) const;
+ xpath_node <a href="#xml_node::select_node_precomp">select_node</a>(const xpath_query&amp; query) const;
+ xpath_node_set <a href="#xml_node::select_nodes">select_nodes</a>(const char_t* query, xpath_variable_set* variables = 0) const;
+ xpath_node_set <a href="#xml_node::select_nodes_precomp">select_nodes</a>(const xpath_query&amp; query) const;
+
+class <a href="#xml_document">xml_document</a>
+ <a href="#xml_document::ctor">xml_document</a>();
+ ~<a href="#xml_document::dtor">xml_document</a>();
+
+ void <a href="#xml_document::reset">reset</a>();
+ void <a href="#xml_document::reset">reset</a>(const xml_document&amp; proto);
+
+ xml_parse_result <a href="#xml_document::load_stream">load</a>(std::istream&amp; stream, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+ xml_parse_result <a href="#xml_document::load_stream">load</a>(std::wistream&amp; stream, unsigned int options = parse_default);
+
+ xml_parse_result <a href="#xml_document::load_string">load_string</a>(const char_t* contents, unsigned int options = parse_default);
+
+ xml_parse_result <a href="#xml_document::load_file">load_file</a>(const char* path, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+ xml_parse_result <a href="#xml_document::load_file_wide">load_file</a>(const wchar_t* path, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+ xml_parse_result <a href="#xml_document::load_buffer">load_buffer</a>(const void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+ xml_parse_result <a href="#xml_document::load_buffer_inplace">load_buffer_inplace</a>(void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+ xml_parse_result <a href="#xml_document::load_buffer_inplace_own">load_buffer_inplace_own</a>(void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+ bool <a href="#xml_document::save_file">save_file</a>(const char* path, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+ bool <a href="#xml_document::save_file_wide">save_file</a>(const wchar_t* path, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+
+ void <a href="#xml_document::save_stream">save</a>(std::ostream&amp; stream, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+ void <a href="#xml_document::save_stream">save</a>(std::wostream&amp; stream, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default) const;
+
+ void <a href="#xml_document::save">save</a>(xml_writer&amp; writer, const char_t* indent = &quot;\t&quot;, unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+
+ xml_node <a href="#xml_document::document_element">document_element</a>() const;
+
+struct <a href="#xml_parse_result">xml_parse_result</a>
+ xml_parse_status <a href="#xml_parse_result::status">status</a>;
+ ptrdiff_t <a href="#xml_parse_result::offset">offset</a>;
+ xml_encoding <a href="#xml_parse_result::encoding">encoding</a>;
+
+ operator <a href="#xml_parse_result::bool">bool</a>() const;
+ const char* <a href="#xml_parse_result::description">description</a>() const;
+
+class <a href="#xml_node_iterator">xml_node_iterator</a>
+class <a href="#xml_attribute_iterator">xml_attribute_iterator</a>
+
+class <a href="#xml_tree_walker">xml_tree_walker</a>
+ virtual bool <a href="#xml_tree_walker::begin">begin</a>(xml_node&amp; node);
+ virtual bool <a href="#xml_tree_walker::for_each">for_each</a>(xml_node&amp; node) = 0;
+ virtual bool <a href="#xml_tree_walker::end">end</a>(xml_node&amp; node);
+
+ int <a href="#xml_tree_walker::depth">depth</a>() const;
+
+class <a href="#xml_text">xml_text</a>
+ bool <a href="#xml_text::empty">empty</a>() const;
+ operator <a href="#xml_text::unspecified_bool_type">xml_text::unspecified_bool_type</a>() const;
+
+ const char_t* <a href="#xml_text::get">xml_text::get</a>() const;
+
+ const char_t* <a href="#xml_text::as_string">as_string</a>(const char_t* def = &quot;&quot;) const;
+ int <a href="#xml_text::as_int">as_int</a>(int def = 0) const;
+ unsigned int <a href="#xml_text::as_uint">as_uint</a>(unsigned int def = 0) const;
+ double <a href="#xml_text::as_double">as_double</a>(double def = 0) const;
+ float <a href="#xml_text::as_float">as_float</a>(float def = 0) const;
+ bool <a href="#xml_text::as_bool">as_bool</a>(bool def = false) const;
+ long long <a href="#xml_text::as_llong">as_llong</a>(long long def = 0) const;
+ unsigned long long <a href="#xml_text::as_ullong">as_ullong</a>(unsigned long long def = 0) const;
+
+ bool <a href="#xml_text::set">set</a>(const char_t* rhs);
+
+ bool <a href="#xml_text::set">set</a>(int rhs);
+ bool <a href="#xml_text::set">set</a>(unsigned int rhs);
+ bool <a href="#xml_text::set">set</a>(double rhs);
+ bool <a href="#xml_text::set">set</a>(float rhs);
+ bool <a href="#xml_text::set">set</a>(bool rhs);
+ bool <a href="#xml_text::set">set</a>(long long rhs);
+ bool <a href="#xml_text::set">set</a>(unsigned long long rhs);
+
+ xml_text&amp; <a href="#xml_text::assign">operator=</a>(const char_t* rhs);
+ xml_text&amp; <a href="#xml_text::assign">operator=</a>(int rhs);
+ xml_text&amp; <a href="#xml_text::assign">operator=</a>(unsigned int rhs);
+ xml_text&amp; <a href="#xml_text::assign">operator=</a>(double rhs);
+ xml_text&amp; <a href="#xml_text::assign">operator=</a>(float rhs);
+ xml_text&amp; <a href="#xml_text::assign">operator=</a>(bool rhs);
+ xml_text&amp; <a href="#xml_text::assign">operator=</a>(long long rhs);
+ xml_text&amp; <a href="#xml_text::assign">operator=</a>(unsigned long long rhs);
+
+ xml_node <a href="#xml_text::data">data</a>() const;
+
+class <a href="#xml_writer">xml_writer</a>
+ virtual void <a href="#xml_writer::write">write</a>(const void* data, size_t size) = 0;
+
+class <a href="#xml_writer_file">xml_writer_file</a>: public xml_writer
+ <a href="#xml_writer_file">xml_writer_file</a>(void* file);
+
+class <a href="#xml_writer_stream">xml_writer_stream</a>: public xml_writer
+ <a href="#xml_writer_stream">xml_writer_stream</a>(std::ostream&amp; stream);
+ <a href="#xml_writer_stream">xml_writer_stream</a>(std::wostream&amp; stream);
+
+struct <a href="#xpath_parse_result">xpath_parse_result</a>
+ const char* <a href="#xpath_parse_result::error">error</a>;
+ ptrdiff_t <a href="#xpath_parse_result::offset">offset</a>;
+
+ operator <a href="#xpath_parse_result::bool">bool</a>() const;
+ const char* <a href="#xpath_parse_result::description">description</a>() const;
+
+class <a href="#xpath_query">xpath_query</a>
+ explicit <a href="#xpath_query::ctor">xpath_query</a>(const char_t* query, xpath_variable_set* variables = 0);
+
+ bool <a href="#xpath_query::evaluate_boolean">evaluate_boolean</a>(const xpath_node&amp; n) const;
+ double <a href="#xpath_query::evaluate_number">evaluate_number</a>(const xpath_node&amp; n) const;
+ string_t <a href="#xpath_query::evaluate_string">evaluate_string</a>(const xpath_node&amp; n) const;
+ size_t <a href="#xpath_query::evaluate_string_buffer">evaluate_string</a>(char_t* buffer, size_t capacity, const xpath_node&amp; n) const;
+ xpath_node_set <a href="#xpath_query::evaluate_node_set">evaluate_node_set</a>(const xpath_node&amp; n) const;
+ xpath_node <a href="#xpath_query::evaluate_node">evaluate_node</a>(const xpath_node&amp; n) const;
+
+ xpath_value_type <a href="#xpath_query::return_type">return_type</a>() const;
+
+ const xpath_parse_result&amp; <a href="#xpath_query::result">result</a>() const;
+ operator <a href="#xpath_query::unspecified_bool_type">unspecified_bool_type</a>() const;
+
+class <a href="#xpath_exception">xpath_exception</a>: public std::exception
+ virtual const char* <a href="#xpath_exception::what">what</a>() const throw();
+
+ const xpath_parse_result&amp; <a href="#xpath_exception::result">result</a>() const;
+
+class <a href="#xpath_node">xpath_node</a>
+ <a href="#xpath_node::ctor">xpath_node</a>();
+ <a href="#xpath_node::ctor">xpath_node</a>(const xml_node&amp; node);
+ <a href="#xpath_node::ctor">xpath_node</a>(const xml_attribute&amp; attribute, const xml_node&amp; parent);
+
+ xml_node <a href="#xpath_node::node">node</a>() const;
+ xml_attribute <a href="#xpath_node::attribute">attribute</a>() const;
+ xml_node <a href="#xpath_node::parent">parent</a>() const;
+
+ operator <a href="#xpath_node::unspecified_bool_type">unspecified_bool_type</a>() const;
+ bool <a href="#xpath_node::comparison">operator==</a>(const xpath_node&amp; n) const;
+ bool <a href="#xpath_node::comparison">operator!=</a>(const xpath_node&amp; n) const;
+
+class <a href="#xpath_node_set">xpath_node_set</a>
+ <a href="#xpath_node_set::ctor">xpath_node_set</a>();
+ <a href="#xpath_node_set::ctor">xpath_node_set</a>(const_iterator begin, const_iterator end, type_t type = type_unsorted);
+
+ typedef const xpath_node* <a href="#xpath_node_set::const_iterator">const_iterator</a>;
+ const_iterator <a href="#xpath_node_set::begin">begin</a>() const;
+ const_iterator <a href="#xpath_node_set::end">end</a>() const;
+
+ const xpath_node&amp; <a href="#xpath_node_set::index">operator[</a>](size_t index) const;
+ size_t <a href="#xpath_node_set::size">size</a>() const;
+ bool <a href="#xpath_node_set::empty">empty</a>() const;
+
+ xpath_node <a href="#xpath_node_set::first">first</a>() const;
+
+ enum type_t {<a href="#xpath_node_set::type_unsorted">type_unsorted</a>, <a href="#xpath_node_set::type_sorted">type_sorted</a>, <a href="#xpath_node_set::type_sorted_reverse">type_sorted_reverse</a>};
+ type_t <a href="#xpath_node_set::type">type</a>() const;
+ void <a href="#xpath_node_set::sort">sort</a>(bool reverse = false);
+
+class <a href="#xpath_variable">xpath_variable</a>
+ const char_t* <a href="#xpath_variable::name">name</a>() const;
+ xpath_value_type <a href="#xpath_variable::type">type</a>() const;
+
+ bool <a href="#xpath_variable::get_boolean">get_boolean</a>() const;
+ double <a href="#xpath_variable::get_number">get_number</a>() const;
+ const char_t* <a href="#xpath_variable::get_string">get_string</a>() const;
+ const xpath_node_set&amp; <a href="#xpath_variable::get_node_set">get_node_set</a>() const;
+
+ bool <a href="#xpath_variable::set">set</a>(bool value);
+ bool <a href="#xpath_variable::set">set</a>(double value);
+ bool <a href="#xpath_variable::set">set</a>(const char_t* value);
+ bool <a href="#xpath_variable::set">set</a>(const xpath_node_set&amp; value);
+
+class <a href="#xpath_variable_set">xpath_variable_set</a>
+ xpath_variable* <a href="#xpath_variable_set::add">add</a>(const char_t* name, xpath_value_type type);
+
+ bool <a href="#xpath_variable_set::set">set</a>(const char_t* name, bool value);
+ bool <a href="#xpath_variable_set::set">set</a>(const char_t* name, double value);
+ bool <a href="#xpath_variable_set::set">set</a>(const char_t* name, const char_t* value);
+ bool <a href="#xpath_variable_set::set">set</a>(const char_t* name, const xpath_node_set&amp; value);
+
+ xpath_variable* <a href="#xpath_variable_set::get">get</a>(const char_t* name);
+ const xpath_variable* <a href="#xpath_variable_set::get">get</a>(const char_t* name) const;</code></pre>
+</div>
+</div>
+</div>
+<div class="sect2">
+<h3 id="apiref.functions"><a class="anchor" href="#apiref.functions"></a>10.6. Functions</h3>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">std::string <a href="#as_utf8">as_utf8</a>(const wchar_t* str);
+std::string <a href="#as_utf8">as_utf8</a>(const std::wstring&amp; str);
+std::wstring <a href="#as_wide">as_wide</a>(const char* str);
+std::wstring <a href="#as_wide">as_wide</a>(const std::string&amp; str);
+void <a href="#set_memory_management_functions">set_memory_management_functions</a>(allocation_function allocate, deallocation_function deallocate);
+allocation_function <a href="#get_memory_allocation_function">get_memory_allocation_function</a>();
+deallocation_function <a href="#get_memory_deallocation_function">get_memory_deallocation_function</a>();</code></pre>
+</div>
+</div>
+</div>
+</div>
+</div>
+</div>
+<div id="footnotes">
+<hr>
+<div class="footnote" id="_footnote_1">
+<a href="#_footnoteref_1">1</a>. All trademarks used are properties of their respective owners.
+</div>
+</div>
+<div id="footer">
+<div id="footer-text">
+Last updated 2015-04-10 20:49:27 PDT
+</div>
+</div>
+</body>
+</html>
\ No newline at end of file

lightspark.tar.xz/src/3rdparty/pugixml/docs/quickstart.adoc Added

@@ -0,0 +1,287 @@
+= pugixml {version} quick start guide
+include::config.adoc[]
+
+[[introduction]]
+== Introduction
+
+http://pugixml.org/[pugixml] is a light-weight C{plus}{plus} XML processing library. It consists of a DOM-like interface with rich traversal/modification capabilities, an extremely fast XML parser which constructs the DOM tree from an XML file/buffer, and an XPath 1.0 implementation for complex data-driven tree queries. Full Unicode support is also available, with two Unicode interface variants and conversions between different Unicode encodings (which happen automatically during parsing/saving). The library is extremely portable and easy to integrate and use. pugixml is developed and maintained since 2006 and has many users. All code is distributed under the <<license,MIT license>>, making it completely free to use in both open-source and proprietary applications.
+
+pugixml enables very fast, convenient and memory-efficient XML document processing. However, since pugixml has a DOM parser, it can't process XML documents that do not fit in memory; also the parser is a non-validating one, so if you need DTD/Schema validation, the library is not for you.
+
+This is the quick start guide for pugixml, which purpose is to enable you to start using the library quickly. Many important library features are either not described at all or only mentioned briefly; for more complete information you link:manual.html[should read the complete manual].
+
+NOTE: No documentation is perfect; neither is this one. If you find errors or omissions, please don’t hesitate to https://github.com/zeux/pugixml/issues/new[submit an issue or open a pull request] with a fix.
+
+[[install]]
+== Installation
+
+You can download the latest source distribution as an archive:
+
+https://github.com/zeux/pugixml/releases/download/v{version}/pugixml-{version}.zip[pugixml-{version}.zip] (Windows line endings)
+/
+https://github.com/zeux/pugixml/releases/download/v{version}/pugixml-{version}.tar.gz[pugixml-{version}.tar.gz] (Unix line endings)
+
+The distribution contains library source, documentation (the guide you're reading now and the manual) and some code examples. After downloading the distribution, install pugixml by extracting all files from the compressed archive.
+
+The complete pugixml source consists of three files - one source file, `pugixml.cpp`, and two header files, `pugixml.hpp` and `pugiconfig.hpp`. `pugixml.hpp` is the primary header which you need to include in order to use pugixml classes/functions. The rest of this guide assumes that `pugixml.hpp` is either in the current directory or in one of include directories of your projects, so that `#include "pugixml.hpp"` can find the header; however you can also use relative path (i.e. `#include "../libs/pugixml/src/pugixml.hpp"`) or include directory-relative path (i.e. `#include <xml/thirdparty/pugixml/src/pugixml.hpp>`).
+ 
+The easiest way to build pugixml is to compile the source file, `pugixml.cpp`, along with the existing library/executable. This process depends on the method of building your application; for example, if you're using Microsoft Visual Studio footnote:[All trademarks used are properties of their respective owners.], Apple Xcode, Code::Blocks or any other IDE, just add `pugixml.cpp` to one of your projects. There are other building methods available, including building pugixml as a standalone static/shared library; link:manual/install.html#install.building[read the manual] for further information.
+
+[[dom]]
+== Document object model
+
+pugixml stores XML data in DOM-like way: the entire XML document (both document structure and element data) is stored in memory as a tree. The tree can be loaded from character stream (file, string, C{plus}{plus} I/O stream), then traversed via special API or XPath expressions. The whole tree is mutable: both node structure and node/attribute data can be changed at any time. Finally, the result of document transformations can be saved to a character stream (file, C{plus}{plus} I/O stream or custom transport).
+
+The root of the tree is the document itself, which corresponds to C{plus}{plus} type `xml_document`. Document has one or more child nodes, which correspond to C{plus}{plus} type `xml_node`. Nodes have different types; depending on a type, a node can have a collection of child nodes, a collection of attributes, which correspond to C{plus}{plus} type `xml_attribute`, and some additional data (i.e. name).
+
+The most common node types are:
+
+* Document node (`node_document`) - this is the root of the tree, which consists of several child nodes. This node corresponds to `xml_document` class; note that `xml_document` is a sub-class of `xml_node`, so the entire node interface is also available.
+
+* Element/tag node (`node_element`) - this is the most common type of node, which represents XML elements. Element nodes have a name, a collection of attributes and a collection of child nodes (both of which may be empty). The attribute is a simple name/value pair.
+
+* Plain character data nodes (`node_pcdata`) represent plain text in XML. PCDATA nodes have a value, but do not have name or children/attributes. Note that *plain character data is not a part of the element node but instead has its own node*; for example, an element node can have several child PCDATA nodes.
+
+Despite the fact that there are several node types, there are only three C{plus}{plus} types representing the tree (`xml_document`, `xml_node`, `xml_attribute`); some operations on `xml_node` are only valid for certain node types. They are described below.
+
+NOTE: All pugixml classes and functions are located in `pugi` namespace; you have to either use explicit name qualification (i.e. `pugi::xml_node`), or to gain access to relevant symbols via `using` directive (i.e. `using pugi::xml_node;` or `using namespace pugi;`).
+
+`xml_document` is the owner of the entire document structure; destroying the document destroys the whole tree. The interface of `xml_document` consists of loading functions, saving functions and the entire interface of `xml_node`, which allows for document inspection and/or modification. Note that while `xml_document` is a sub-class of `xml_node`, `xml_node` is not a polymorphic type; the inheritance is present only to simplify usage.
+
+`xml_node` is the handle to document node; it can point to any node in the document, including document itself. There is a common interface for nodes of all types. Note that `xml_node` is only a handle to the actual node, not the node itself - you can have several `xml_node` handles pointing to the same underlying object. Destroying `xml_node` handle does not destroy the node and does not remove it from the tree.
+
+There is a special value of `xml_node` type, known as null node or empty node. It does not correspond to any node in any document, and thus resembles null pointer. However, all operations are defined on empty nodes; generally the operations don't do anything and return empty nodes/attributes or empty strings as their result. This is useful for chaining calls; i.e. you can get the grandparent of a node like so: `node.parent().parent()`; if a node is a null node or it does not have a parent, the first `parent()` call returns null node; the second `parent()` call then also returns null node, so you don't have to check for errors twice. You can test if a handle is null via implicit boolean cast: `if (node) { ... }` or `if (!node) { ... }`.
+
+`xml_attribute` is the handle to an XML attribute; it has the same semantics as `xml_node`, i.e. there can be several `xml_attribute` handles pointing to the same underlying object and there is a special null attribute value, which propagates to function results.
+
+There are two choices of interface and internal representation when configuring pugixml: you can either choose the UTF-8 (also called char) interface or UTF-16/32 (also called wchar_t) one. The choice is controlled via `PUGIXML_WCHAR_MODE` define; you can set it via `pugiconfig.hpp` or via preprocessor options. All tree functions that work with strings work with either C-style null terminated strings or STL strings of the selected character type. link:manual/dom.html#dom.unicode[Read the manual] for additional information on Unicode interface.
+
+[[loading]]
+== Loading document
+
+pugixml provides several functions for loading XML data from various places - files, C{plus}{plus} iostreams, memory buffers. All functions use an extremely fast non-validating parser. This parser is not fully W3C conformant - it can load any valid XML document, but does not perform some well-formedness checks. While considerable effort is made to reject invalid XML documents, some validation is not performed because of performance reasons. XML data is always converted to internal character format before parsing. pugixml supports all popular Unicode encodings (UTF-8, UTF-16 (big and little endian), UTF-32 (big and little endian); UCS-2 is naturally supported since it's a strict subset of UTF-16) and handles all encoding conversions automatically.
+
+The most common source of XML data is files; pugixml provides a separate function for loading XML document from file. This function accepts file path as its first argument, and also two optional arguments, which specify parsing options and input data encoding, which are described in the manual.
+
+This is an example of loading XML document from file (link:samples/load_file.cpp[]):
+
+[source,indent=0]
+----
+include::samples/load_file.cpp[tags=code] 
+----
+
+`load_file`, as well as other loading functions, destroys the existing document tree and then tries to load the new tree from the specified file. The result of the operation is returned in an `xml_parse_result` object; this object contains the operation status, and the related information (i.e. last successfully parsed position in the input file, if parsing fails).
+
+Parsing result object can be implicitly converted to `bool`; if you do not want to handle parsing errors thoroughly, you can just check the return value of load functions as if it was a `bool`: `if (doc.load_file("file.xml")) { ... } else { ... }`. Otherwise you can use the `status` member to get parsing status, or the `description()` member function to get the status in a string form.
+
+This is an example of handling loading errors (link:samples/load_error_handling.cpp[]):
+
+[source,indent=0]
+----
+include::samples/load_error_handling.cpp[tags=code] 
+----
+
+Sometimes XML data should be loaded from some other source than file, i.e. HTTP URL; also you may want to load XML data from file using non-standard functions, i.e. to use your virtual file system facilities or to load XML from gzip-compressed files. These scenarios either require loading document from memory, in which case you should prepare a contiguous memory block with all XML data and to pass it to one of buffer loading functions, or loading document from C{plus}{plus} IOstream, in which case you should provide an object which implements `std::istream` or `std::wistream` interface.
+
+There are different functions for loading document from memory; they treat the passed buffer as either an immutable one (`load_buffer`), a mutable buffer which is owned by the caller (`load_buffer_inplace`), or a mutable buffer which ownership belongs to pugixml (`load_buffer_inplace_own`). There is also a simple helper function, `xml_document::load`, for cases when you want to load the XML document from null-terminated character string.
+
+This is an example of loading XML document from memory using one of these functions (link:samples/load_memory.cpp[]); read the sample code for more examples:
+
+[source,indent=0]
+----
+include::samples/load_memory.cpp[tags=decl]
+----
+[source,indent=0]
+----
+include::samples/load_memory.cpp[tags=load_buffer_inplace_begin]
+
+include::samples/load_memory.cpp[tags=load_buffer_inplace_end]
+----
+
+This is a simple example of loading XML document from file using streams (link:samples/load_stream.cpp[]); read the sample code for more complex examples involving wide streams and locales:
+
+[source,indent=0]
+----
+include::samples/load_stream.cpp[tags=code]
+----
+
+[[access]]
+== Accessing document data
+
+pugixml features an extensive interface for getting various types of data from the document and for traversing the document. You can use various accessors to get node/attribute data, you can traverse the child node/attribute lists via accessors or iterators, you can do depth-first traversals with `xml_tree_walker` objects, and you can use XPath for complex data-driven queries.
+
+You can get node or attribute name via `name()` accessor, and value via `value()` accessor. Note that both functions never return null pointers - they either return a string with the relevant content, or an empty string if name/value is absent or if the handle is null. Also there are two notable things for reading values:
+
+* It is common to store data as text contents of some node - i.e. `<node><description>This is a node</description></node>`. In this case, `<description>` node does not have a value, but instead has a child of type `node_pcdata` with value `"This is a node"`. pugixml provides `child_value()` and `text()` helper functions to parse such data.
+
+* In many cases attribute values have types that are not strings - i.e. an attribute may always contain values that should be treated as integers, despite the fact that they are represented as strings in XML. pugixml provides several accessors that convert attribute value to some other type.
+
+This is an example of using these functions (link:samples/traverse_base.cpp[]):
+
+[source,indent=0]
+----
+include::samples/traverse_base.cpp[tags=data]
+----
+
+Since a lot of document traversal consists of finding the node/attribute with the correct name, there are special functions for that purpose. For example, `child("Tool")` returns the first node which has the name `"Tool"`, or null handle if there is no such node. This is an example of using such functions (link:samples/traverse_base.cpp[]):
+
+[source,indent=0]
+----
+include::samples/traverse_base.cpp[tags=contents]
+----
+
+Child node lists and attribute lists are simply double-linked lists; while you can use `previous_sibling`/`next_sibling` and other such functions for iteration, pugixml additionally provides node and attribute iterators, so that you can treat nodes as containers of other nodes or attributes. All iterators are bidirectional and support all usual iterator operations. The iterators are invalidated if the node/attribute objects they're pointing to are removed from the tree; adding nodes/attributes does not invalidate any iterators.
+
+Here is an example of using iterators for document traversal (link:samples/traverse_iter.cpp[]):
+
+[source,indent=0]
+----
+include::samples/traverse_iter.cpp[tags=code]
+----
+
+If your C{plus}{plus} compiler supports range-based for-loop (this is a C{plus}{plus}11 feature, at the time of writing it's supported by Microsoft Visual Studio 11 Beta, GCC 4.6 and Clang 3.0), you can use it to enumerate nodes/attributes. Additional helpers are provided to support this; note that they are also compatible with http://www.boost.org/libs/foreach/[Boost Foreach], and possibly other pre-C{plus}{plus}11 foreach facilities.
+
+Here is an example of using C{plus}{plus}11 range-based for loop for document traversal (link:samples/traverse_rangefor.cpp[]):
+
+[source,indent=0]
+----
+include::samples/traverse_rangefor.cpp[tags=code]
+----
+
+The methods described above allow traversal of immediate children of some node; if you want to do a deep tree traversal, you'll have to do it via a recursive function or some equivalent method. However, pugixml provides a helper for depth-first traversal of a subtree. In order to use it, you have to implement `xml_tree_walker` interface and to call `traverse` function.
+
+This is an example of traversing tree hierarchy with xml_tree_walker (link:samples/traverse_walker.cpp[]):
+
+[source,indent=0]
+----
+include::samples/traverse_walker.cpp[tags=impl]
+----
+[source,indent=0]
+----
+include::samples/traverse_walker.cpp[tags=traverse]
+----
+
+Finally, for complex queries often a higher-level DSL is needed. pugixml provides an implementation of XPath 1.0 language for such queries. The complete description of XPath usage can be found in the manual, but here are some examples:
+
+[source,indent=0]
+----
+include::samples/xpath_select.cpp[tags=code]
+----
+
+CAUTION: XPath functions throw `xpath_exception` objects on error; the sample above does not catch these exceptions.
+
+[[modify]]
+== Modifying document data
+
+The document in pugixml is fully mutable: you can completely change the document structure and modify the data of nodes/attributes. All functions take care of memory management and structural integrity themselves, so they always result in structurally valid tree - however, it is possible to create an invalid XML tree (for example, by adding two attributes with the same name or by setting attribute/node name to empty/invalid string). Tree modification is optimized for performance and for memory consumption, so if you have enough memory you can create documents from scratch with pugixml and later save them to file/stream instead of relying on error-prone manual text writing and without too much overhead.
+
+All member functions that change node/attribute data or structure are non-constant and thus can not be called on constant handles. However, you can easily convert constant handle to non-constant one by simple assignment: `void foo(const pugi::xml_node& n) { pugi::xml_node nc = n; }`, so const-correctness here mainly provides additional documentation.
+
+As discussed before, nodes can have name and value, both of which are strings. Depending on node type, name or value may be absent. You can use `set_name` and `set_value` member functions to set them. Similar functions are available for attributes; however, the `set_value` function is overloaded for some other types except strings, like floating-point numbers. Also, attribute value can be set using an assignment operator. This is an example of setting node/attribute name and value (link:samples/modify_base.cpp[]):
+
+[source,indent=0]
+----
+include::samples/modify_base.cpp[tags=node]
+----
+[source,indent=0]
+----
+include::samples/modify_base.cpp[tags=attr]
+----
+
+Nodes and attributes do not exist without a document tree, so you can't create them without adding them to some document. A node or attribute can be created at the end of node/attribute list or before/after some other node. All insertion functions return the handle to newly created object on success, and null handle on failure. Even if the operation fails (for example, if you're trying to add a child node to PCDATA node), the document remains in consistent state, but the requested node/attribute is not added.
+
+CAUTION: `attribute()` and `child()` functions do not add attributes or nodes to the tree, so code like `node.attribute("id") = 123;` will not do anything if `node` does not have an attribute with name `"id"`. Make sure you're operating with existing attributes/nodes by adding them if necessary.
+
+This is an example of adding new attributes/nodes to the document (link:samples/modify_add.cpp[]):
+
+[source,indent=0]
+----
+include::samples/modify_add.cpp[tags=code]
+----
+
+If you do not want your document to contain some node or attribute, you can remove it with `remove_attribute` and `remove_child` functions. Removing the attribute or node invalidates all handles to the same underlying object, and also invalidates all iterators pointing to the same object. Removing node also invalidates all past-the-end iterators to its attribute or child node list. Be careful to ensure that all such handles and iterators either do not exist or are not used after the attribute/node is removed.
+
+This is an example of removing attributes/nodes from the document (link:samples/modify_remove.cpp[]):
+
+[source,indent=0]
+----
+include::samples/modify_remove.cpp[tags=code]
+----
+
+[[saving]]
+== Saving document
+
+Often after creating a new document or loading the existing one and processing it, it is necessary to save the result back to file. Also it is occasionally useful to output the whole document or a subtree to some stream; use cases include debug printing, serialization via network or other text-oriented medium, etc. pugixml provides several functions to output any subtree of the document to a file, stream or another generic transport interface; these functions allow to customize the output format, and also perform necessary encoding conversions.
+
+Before writing to the destination the node/attribute data is properly formatted according to the node type; all special XML symbols, such as < and &, are properly escaped. In order to guard against forgotten node/attribute names, empty node/attribute names are printed as `":anonymous"`. For well-formed output, make sure all node and attribute names are set to meaningful values.
+
+If you want to save the whole document to a file, you can use the `save_file` function, which returns `true` on success. This is a simple example of saving XML document to file (link:samples/save_file.cpp[]):
+
+[source,indent=0]
+----
+include::samples/save_file.cpp[tags=code]
+----
+
+To enhance interoperability pugixml provides functions for saving document to any object which implements C{plus}{plus} `std::ostream` interface. This allows you to save documents to any standard C{plus}{plus} stream (i.e. file stream) or any third-party compliant implementation (i.e. Boost Iostreams). Most notably, this allows for easy debug output, since you can use `std::cout` stream as saving target. There are two functions, one works with narrow character streams, another handles wide character ones.
+
+This is a simple example of saving XML document to standard output (link:samples/save_stream.cpp[]):
+
+[source,indent=0]
+----
+include::samples/save_stream.cpp[tags=code]
+----
+
+All of the above saving functions are implemented in terms of writer interface. This is a simple interface with a single function, which is called several times during output process with chunks of document data as input. In order to output the document via some custom transport, for example sockets, you should create an object which implements `xml_writer_file` interface and pass it to `xml_document::save` function.
+
+This is a simple example of custom writer for saving document data to STL string (link:samples/save_custom_writer.cpp[]); read the sample code for more complex examples:
+
+[source,indent=0]
+----
+include::samples/save_custom_writer.cpp[tags=code]
+----
+
+While the previously described functions save the whole document to the destination, it is easy to save a single subtree. Instead of calling `xml_document::save`, just call `xml_node::print` function on the target node. You can save node contents to C{plus}{plus} IOstream object or custom writer in this way. Saving a subtree slightly differs from saving the whole document; link:manual/saving.html#saving.subtree[read the manual] for more information.
+
+[[feedback]]
+== Feedback
+
+If you believe you've found a bug in pugixml, please file an issue via https://github.com/zeux/pugixml/issues/new[issue submission form]. Be sure to include the relevant information so that the bug can be reproduced: the version of pugixml, compiler version and target architecture, the code that uses pugixml and exhibits the bug, etc. Feature requests and contributions can be filed as issues, too.
+
+If filing an issue is not possible due to privacy or other concerns, you can contact pugixml author by e-mail directly: arseny.kapoulkine@gmail.com.
+
+[[license]]
+== License
+
+The pugixml library is distributed under the MIT license:
+
+....
+Copyright (c) 2006-2015 Arseny Kapoulkine
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
+....
+
+This means that you can freely use pugixml in your applications, both open-source and proprietary. If you use pugixml in a product, it is sufficient to add an acknowledgment like this to the product distribution:
+ 
+....
+This software is based on pugixml library (http://pugixml.org).
+pugixml is Copyright (C) 2006-2015 Arseny Kapoulkine.
+....
\ No newline at end of file

lightspark.tar.xz/src/3rdparty/pugixml/docs/quickstart.html Added

@@ -0,0 +1,1075 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+<meta charset="UTF-8">
+
+<meta name="viewport" content="width=device-width, initial-scale=1.0">
+<meta name="generator" content="Asciidoctor 1.5.2">
+<meta name="author" content="website, repository">
+<title>pugixml 1.6 quick start guide</title>
+<link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Open+Sans:300,300italic,400,400italic,600,600italic%7CNoto+Serif:400,400italic,700,700italic%7CDroid+Sans+Mono:400">
+<style>
+/* Asciidoctor default stylesheet | MIT License | http://asciidoctor.org */
+/* Remove the comments around the @import statement below when using this as a custom stylesheet */
+/*@import "https://fonts.googleapis.com/css?family=Open+Sans:300,300italic,400,400italic,600,600italic%7CNoto+Serif:400,400italic,700,700italic%7CDroid+Sans+Mono:400";*/
+article,aside,details,figcaption,figure,footer,header,hgroup,main,nav,section,summary{display:block}
+audio,canvas,video{display:inline-block}
+audio:not([controls]){display:none;height:0}
+[hidden],template{display:none}
+script{display:none!important}
+html{font-family:sans-serif;-ms-text-size-adjust:100%;-webkit-text-size-adjust:100%}
+body{margin:0}
+a{background:transparent}
+a:focus{outline:thin dotted}
+a:active,a:hover{outline:0}
+h1{font-size:2em;margin:.67em 0}
+abbr[title]{border-bottom:1px dotted}
+b,strong{font-weight:bold}
+dfn{font-style:italic}
+hr{-moz-box-sizing:content-box;box-sizing:content-box;height:0}
+mark{background:#ff0;color:#000}
+code,kbd,pre,samp{font-family:monospace;font-size:1em}
+pre{white-space:pre-wrap}
+q{quotes:"\201C" "\201D" "\2018" "\2019"}
+small{font-size:80%}
+sub,sup{font-size:75%;line-height:0;position:relative;vertical-align:baseline}
+sup{top:-.5em}
+sub{bottom:-.25em}
+img{border:0}
+svg:not(:root){overflow:hidden}
+figure{margin:0}
+fieldset{border:1px solid silver;margin:0 2px;padding:.35em .625em .75em}
+legend{border:0;padding:0}
+button,input,select,textarea{font-family:inherit;font-size:100%;margin:0}
+button,input{line-height:normal}
+button,select{text-transform:none}
+button,html input[type="button"],input[type="reset"],input[type="submit"]{-webkit-appearance:button;cursor:pointer}
+button[disabled],html input[disabled]{cursor:default}
+input[type="checkbox"],input[type="radio"]{box-sizing:border-box;padding:0}
+input[type="search"]{-webkit-appearance:textfield;-moz-box-sizing:content-box;-webkit-box-sizing:content-box;box-sizing:content-box}
+input[type="search"]::-webkit-search-cancel-button,input[type="search"]::-webkit-search-decoration{-webkit-appearance:none}
+button::-moz-focus-inner,input::-moz-focus-inner{border:0;padding:0}
+textarea{overflow:auto;vertical-align:top}
+table{border-collapse:collapse;border-spacing:0}
+*,*:before,*:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}
+html,body{font-size:100%}
+body{background:#fff;color:rgba(0,0,0,.8);padding:0;margin:0;font-family:"Noto Serif","DejaVu Serif",serif;font-weight:400;font-style:normal;line-height:1;position:relative;cursor:auto}
+a:hover{cursor:pointer}
+img,object,embed{max-width:100%;height:auto}
+object,embed{height:100%}
+img{-ms-interpolation-mode:bicubic}
+#map_canvas img,#map_canvas embed,#map_canvas object,.map_canvas img,.map_canvas embed,.map_canvas object{max-width:none!important}
+.left{float:left!important}
+.right{float:right!important}
+.text-left{text-align:left!important}
+.text-right{text-align:right!important}
+.text-center{text-align:center!important}
+.text-justify{text-align:justify!important}
+.hide{display:none}
+.antialiased,body{-webkit-font-smoothing:antialiased}
+img{display:inline-block;vertical-align:middle}
+textarea{height:auto;min-height:50px}
+select{width:100%}
+p.lead,.paragraph.lead>p,#preamble>.sectionbody>.paragraph:first-of-type p{font-size:1.21875em;line-height:1.6}
+.subheader,.admonitionblock td.content>.title,.audioblock>.title,.exampleblock>.title,.imageblock>.title,.listingblock>.title,.literalblock>.title,.stemblock>.title,.openblock>.title,.paragraph>.title,.quoteblock>.title,table.tableblock>.title,.verseblock>.title,.videoblock>.title,.dlist>.title,.olist>.title,.ulist>.title,.qlist>.title,.hdlist>.title{line-height:1.45;color:#7a2518;font-weight:400;margin-top:0;margin-bottom:.25em}
+div,dl,dt,dd,ul,ol,li,h1,h2,h3,#toctitle,.sidebarblock>.content>.title,h4,h5,h6,pre,form,p,blockquote,th,td{margin:0;padding:0;direction:ltr}
+a{color:#2156a5;text-decoration:underline;line-height:inherit}
+a:hover,a:focus{color:#1d4b8f}
+a img{border:none}
+p{font-family:inherit;font-weight:400;font-size:1em;line-height:1.6;margin-bottom:1.25em;text-rendering:optimizeLegibility}
+p aside{font-size:.875em;line-height:1.35;font-style:italic}
+h1,h2,h3,#toctitle,.sidebarblock>.content>.title,h4,h5,h6{font-family:"Open Sans","DejaVu Sans",sans-serif;font-weight:300;font-style:normal;color:#ba3925;text-rendering:optimizeLegibility;margin-top:1em;margin-bottom:.5em;line-height:1.0125em}
+h1 small,h2 small,h3 small,#toctitle small,.sidebarblock>.content>.title small,h4 small,h5 small,h6 small{font-size:60%;color:#e99b8f;line-height:0}
+h1{font-size:2.125em}
+h2{font-size:1.6875em}
+h3,#toctitle,.sidebarblock>.content>.title{font-size:1.375em}
+h4,h5{font-size:1.125em}
+h6{font-size:1em}
+hr{border:solid #ddddd8;border-width:1px 0 0;clear:both;margin:1.25em 0 1.1875em;height:0}
+em,i{font-style:italic;line-height:inherit}
+strong,b{font-weight:bold;line-height:inherit}
+small{font-size:60%;line-height:inherit}
+code{font-family:"Droid Sans Mono","DejaVu Sans Mono",monospace;font-weight:400;color:rgba(0,0,0,.9)}
+ul,ol,dl{font-size:1em;line-height:1.6;margin-bottom:1.25em;list-style-position:outside;font-family:inherit}
+ul,ol,ul.no-bullet,ol.no-bullet{margin-left:1.5em}
+ul li ul,ul li ol{margin-left:1.25em;margin-bottom:0;font-size:1em}
+ul.square li ul,ul.circle li ul,ul.disc li ul{list-style:inherit}
+ul.square{list-style-type:square}
+ul.circle{list-style-type:circle}
+ul.disc{list-style-type:disc}
+ul.no-bullet{list-style:none}
+ol li ul,ol li ol{margin-left:1.25em;margin-bottom:0}
+dl dt{margin-bottom:.3125em;font-weight:bold}
+dl dd{margin-bottom:1.25em}
+abbr,acronym{text-transform:uppercase;font-size:90%;color:rgba(0,0,0,.8);border-bottom:1px dotted #ddd;cursor:help}
+abbr{text-transform:none}
+blockquote{margin:0 0 1.25em;padding:.5625em 1.25em 0 1.1875em;border-left:1px solid #ddd}
+blockquote cite{display:block;font-size:.9375em;color:rgba(0,0,0,.6)}
+blockquote cite:before{content:"\2014 \0020"}
+blockquote cite a,blockquote cite a:visited{color:rgba(0,0,0,.6)}
+blockquote,blockquote p{line-height:1.6;color:rgba(0,0,0,.85)}
+@media only screen and (min-width:768px){h1,h2,h3,#toctitle,.sidebarblock>.content>.title,h4,h5,h6{line-height:1.2}
+h1{font-size:2.75em}
+h2{font-size:2.3125em}
+h3,#toctitle,.sidebarblock>.content>.title{font-size:1.6875em}
+h4{font-size:1.4375em}}table{background:#fff;margin-bottom:1.25em;border:solid 1px #dedede}
+table thead,table tfoot{background:#f7f8f7;font-weight:bold}
+table thead tr th,table thead tr td,table tfoot tr th,table tfoot tr td{padding:.5em .625em .625em;font-size:inherit;color:rgba(0,0,0,.8);text-align:left}
+table tr th,table tr td{padding:.5625em .625em;font-size:inherit;color:rgba(0,0,0,.8)}
+table tr.even,table tr.alt,table tr:nth-of-type(even){background:#f8f8f7}
+table thead tr th,table tfoot tr th,table tbody tr td,table tr td,table tfoot tr td{display:table-cell;line-height:1.6}
+h1,h2,h3,#toctitle,.sidebarblock>.content>.title,h4,h5,h6{line-height:1.2;word-spacing:-.05em}
+h1 strong,h2 strong,h3 strong,#toctitle strong,.sidebarblock>.content>.title strong,h4 strong,h5 strong,h6 strong{font-weight:400}
+.clearfix:before,.clearfix:after,.float-group:before,.float-group:after{content:" ";display:table}
+.clearfix:after,.float-group:after{clear:both}
+*:not(pre)>code{font-size:.9375em;font-style:normal!important;letter-spacing:0;padding:.1em .5ex;word-spacing:-.15em;background-color:#f7f7f8;-webkit-border-radius:4px;border-radius:4px;line-height:1.45;text-rendering:optimizeSpeed}
+pre,pre>code{line-height:1.45;color:rgba(0,0,0,.9);font-family:"Droid Sans Mono","DejaVu Sans Mono",monospace;font-weight:400;text-rendering:optimizeSpeed}
+.keyseq{color:rgba(51,51,51,.8)}
+kbd{display:inline-block;color:rgba(0,0,0,.8);font-size:.75em;line-height:1.4;background-color:#f7f7f7;border:1px solid #ccc;-webkit-border-radius:3px;border-radius:3px;-webkit-box-shadow:0 1px 0 rgba(0,0,0,.2),0 0 0 .1em white inset;box-shadow:0 1px 0 rgba(0,0,0,.2),0 0 0 .1em #fff inset;margin:-.15em .15em 0 .15em;padding:.2em .6em .2em .5em;vertical-align:middle;white-space:nowrap}
+.keyseq kbd:first-child{margin-left:0}
+.keyseq kbd:last-child{margin-right:0}
+.menuseq,.menu{color:rgba(0,0,0,.8)}
+b.button:before,b.button:after{position:relative;top:-1px;font-weight:400}
+b.button:before{content:"[";padding:0 3px 0 2px}
+b.button:after{content:"]";padding:0 2px 0 3px}
+p a>code:hover{color:rgba(0,0,0,.9)}
+#header,#content,#footnotes,#footer{width:100%;margin-left:auto;margin-right:auto;margin-top:0;margin-bottom:0;max-width:62.5em;*zoom:1;position:relative;padding-left:.9375em;padding-right:.9375em}
+#header:before,#header:after,#content:before,#content:after,#footnotes:before,#footnotes:after,#footer:before,#footer:after{content:" ";display:table}
+#header:after,#content:after,#footnotes:after,#footer:after{clear:both}
+#content{margin-top:1.25em}
+#content:before{content:none}
+#header>h1:first-child{color:rgba(0,0,0,.85);margin-top:2.25rem;margin-bottom:0}
+#header>h1:first-child+#toc{margin-top:8px;border-top:1px solid #ddddd8}
+#header>h1:only-child,body.toc2 #header>h1:nth-last-child(2){border-bottom:1px solid #ddddd8;padding-bottom:8px}
+#header .details{border-bottom:1px solid #ddddd8;line-height:1.45;padding-top:.25em;padding-bottom:.25em;padding-left:.25em;color:rgba(0,0,0,.6);display:-ms-flexbox;display:-webkit-flex;display:flex;-ms-flex-flow:row wrap;-webkit-flex-flow:row wrap;flex-flow:row wrap}
+#header .details span:first-child{margin-left:-.125em}
+#header .details span.email a{color:rgba(0,0,0,.85)}
+#header .details br{display:none}
+#header .details br+span:before{content:"\00a0\2013\00a0"}
+#header .details br+span.author:before{content:"\00a0\22c5\00a0";color:rgba(0,0,0,.85)}
+#header .details br+span#revremark:before{content:"\00a0|\00a0"}
+#header #revnumber{text-transform:capitalize}
+#header #revnumber:after{content:"\00a0"}
+#content>h1:first-child:not([class]){color:rgba(0,0,0,.85);border-bottom:1px solid #ddddd8;padding-bottom:8px;margin-top:0;padding-top:1rem;margin-bottom:1.25rem}
+#toc{border-bottom:1px solid #efefed;padding-bottom:.5em}
+#toc>ul{margin-left:.125em}
+#toc ul.sectlevel0>li>a{font-style:italic}
+#toc ul.sectlevel0 ul.sectlevel1{margin:.5em 0}
+#toc ul{font-family:"Open Sans","DejaVu Sans",sans-serif;list-style-type:none}
+#toc a{text-decoration:none}
+#toc a:active{text-decoration:underline}
+#toctitle{color:#7a2518;font-size:1.2em}
+@media only screen and (min-width:768px){#toctitle{font-size:1.375em}
+body.toc2{padding-left:15em;padding-right:0}
+#toc.toc2{margin-top:0!important;background-color:#f8f8f7;position:fixed;width:15em;left:0;top:0;border-right:1px solid #efefed;border-top-width:0!important;border-bottom-width:0!important;z-index:1000;padding:1.25em 1em;height:100%;overflow:auto}
+#toc.toc2 #toctitle{margin-top:0;font-size:1.2em}
+#toc.toc2>ul{font-size:.9em;margin-bottom:0}
+#toc.toc2 ul ul{margin-left:0;padding-left:1em}
+#toc.toc2 ul.sectlevel0 ul.sectlevel1{padding-left:0;margin-top:.5em;margin-bottom:.5em}
+body.toc2.toc-right{padding-left:0;padding-right:15em}
+body.toc2.toc-right #toc.toc2{border-right-width:0;border-left:1px solid #efefed;left:auto;right:0}}@media only screen and (min-width:1280px){body.toc2{padding-left:20em;padding-right:0}
+#toc.toc2{width:20em}
+#toc.toc2 #toctitle{font-size:1.375em}
+#toc.toc2>ul{font-size:.95em}
+#toc.toc2 ul ul{padding-left:1.25em}
+body.toc2.toc-right{padding-left:0;padding-right:20em}}#content #toc{border-style:solid;border-width:1px;border-color:#e0e0dc;margin-bottom:1.25em;padding:1.25em;background:#f8f8f7;-webkit-border-radius:4px;border-radius:4px}
+#content #toc>:first-child{margin-top:0}
+#content #toc>:last-child{margin-bottom:0}
+#footer{max-width:100%;background-color:rgba(0,0,0,.8);padding:1.25em}
+#footer-text{color:rgba(255,255,255,.8);line-height:1.44}
+.sect1{padding-bottom:.625em}
+@media only screen and (min-width:768px){.sect1{padding-bottom:1.25em}}.sect1+.sect1{border-top:1px solid #efefed}
+#content h1>a.anchor,h2>a.anchor,h3>a.anchor,#toctitle>a.anchor,.sidebarblock>.content>.title>a.anchor,h4>a.anchor,h5>a.anchor,h6>a.anchor{position:absolute;z-index:1001;width:1.5ex;margin-left:-1.5ex;display:block;text-decoration:none!important;visibility:hidden;text-align:center;font-weight:400}
+#content h1>a.anchor:before,h2>a.anchor:before,h3>a.anchor:before,#toctitle>a.anchor:before,.sidebarblock>.content>.title>a.anchor:before,h4>a.anchor:before,h5>a.anchor:before,h6>a.anchor:before{content:"\00A7";font-size:.85em;display:block;padding-top:.1em}
+#content h1:hover>a.anchor,#content h1>a.anchor:hover,h2:hover>a.anchor,h2>a.anchor:hover,h3:hover>a.anchor,#toctitle:hover>a.anchor,.sidebarblock>.content>.title:hover>a.anchor,h3>a.anchor:hover,#toctitle>a.anchor:hover,.sidebarblock>.content>.title>a.anchor:hover,h4:hover>a.anchor,h4>a.anchor:hover,h5:hover>a.anchor,h5>a.anchor:hover,h6:hover>a.anchor,h6>a.anchor:hover{visibility:visible}
+#content h1>a.link,h2>a.link,h3>a.link,#toctitle>a.link,.sidebarblock>.content>.title>a.link,h4>a.link,h5>a.link,h6>a.link{color:#ba3925;text-decoration:none}
+#content h1>a.link:hover,h2>a.link:hover,h3>a.link:hover,#toctitle>a.link:hover,.sidebarblock>.content>.title>a.link:hover,h4>a.link:hover,h5>a.link:hover,h6>a.link:hover{color:#a53221}
+.audioblock,.imageblock,.literalblock,.listingblock,.stemblock,.videoblock{margin-bottom:1.25em}
+.admonitionblock td.content>.title,.audioblock>.title,.exampleblock>.title,.imageblock>.title,.listingblock>.title,.literalblock>.title,.stemblock>.title,.openblock>.title,.paragraph>.title,.quoteblock>.title,table.tableblock>.title,.verseblock>.title,.videoblock>.title,.dlist>.title,.olist>.title,.ulist>.title,.qlist>.title,.hdlist>.title{text-rendering:optimizeLegibility;text-align:left;font-family:"Noto Serif","DejaVu Serif",serif;font-size:1rem;font-style:italic}
+table.tableblock>caption.title{white-space:nowrap;overflow:visible;max-width:0}
+.paragraph.lead>p,#preamble>.sectionbody>.paragraph:first-of-type p{color:rgba(0,0,0,.85)}
+table.tableblock #preamble>.sectionbody>.paragraph:first-of-type p{font-size:inherit}
+.admonitionblock>table{border-collapse:separate;border:0;background:none;width:100%}
+.admonitionblock>table td.icon{text-align:center;width:80px}
+.admonitionblock>table td.icon img{max-width:none}
+.admonitionblock>table td.icon .title{font-weight:bold;font-family:"Open Sans","DejaVu Sans",sans-serif;text-transform:uppercase}
+.admonitionblock>table td.content{padding-left:1.125em;padding-right:1.25em;border-left:1px solid #ddddd8;color:rgba(0,0,0,.6)}
+.admonitionblock>table td.content>:last-child>:last-child{margin-bottom:0}
+.exampleblock>.content{border-style:solid;border-width:1px;border-color:#e6e6e6;margin-bottom:1.25em;padding:1.25em;background:#fff;-webkit-border-radius:4px;border-radius:4px}
+.exampleblock>.content>:first-child{margin-top:0}
+.exampleblock>.content>:last-child{margin-bottom:0}
+.sidebarblock{border-style:solid;border-width:1px;border-color:#e0e0dc;margin-bottom:1.25em;padding:1.25em;background:#f8f8f7;-webkit-border-radius:4px;border-radius:4px}
+.sidebarblock>:first-child{margin-top:0}
+.sidebarblock>:last-child{margin-bottom:0}
+.sidebarblock>.content>.title{color:#7a2518;margin-top:0;text-align:center}
+.exampleblock>.content>:last-child>:last-child,.exampleblock>.content .olist>ol>li:last-child>:last-child,.exampleblock>.content .ulist>ul>li:last-child>:last-child,.exampleblock>.content .qlist>ol>li:last-child>:last-child,.sidebarblock>.content>:last-child>:last-child,.sidebarblock>.content .olist>ol>li:last-child>:last-child,.sidebarblock>.content .ulist>ul>li:last-child>:last-child,.sidebarblock>.content .qlist>ol>li:last-child>:last-child{margin-bottom:0}
+.literalblock pre,.listingblock pre:not(.highlight),.listingblock pre[class="highlight"],.listingblock pre[class^="highlight "],.listingblock pre.CodeRay,.listingblock pre.prettyprint{background:#f7f7f8}
+.sidebarblock .literalblock pre,.sidebarblock .listingblock pre:not(.highlight),.sidebarblock .listingblock pre[class="highlight"],.sidebarblock .listingblock pre[class^="highlight "],.sidebarblock .listingblock pre.CodeRay,.sidebarblock .listingblock pre.prettyprint{background:#f2f1f1}
+.literalblock pre,.literalblock pre[class],.listingblock pre,.listingblock pre[class]{-webkit-border-radius:4px;border-radius:4px;word-wrap:break-word;padding:1em;font-size:.8125em}
+.literalblock pre.nowrap,.literalblock pre[class].nowrap,.listingblock pre.nowrap,.listingblock pre[class].nowrap{overflow-x:auto;white-space:pre;word-wrap:normal}
+@media only screen and (min-width:768px){.literalblock pre,.literalblock pre[class],.listingblock pre,.listingblock pre[class]{font-size:.90625em}}@media only screen and (min-width:1280px){.literalblock pre,.literalblock pre[class],.listingblock pre,.listingblock pre[class]{font-size:1em}}.literalblock.output pre{color:#f7f7f8;background-color:rgba(0,0,0,.9)}
+.listingblock pre.highlightjs{padding:0}
+.listingblock pre.highlightjs>code{padding:1em;-webkit-border-radius:4px;border-radius:4px}
+.listingblock pre.prettyprint{border-width:0}
+.listingblock>.content{position:relative}
+.listingblock code[data-lang]:before{display:none;content:attr(data-lang);position:absolute;font-size:.75em;top:.425rem;right:.5rem;line-height:1;text-transform:uppercase;color:#999}
+.listingblock:hover code[data-lang]:before{display:block}
+.listingblock.terminal pre .command:before{content:attr(data-prompt);padding-right:.5em;color:#999}
+.listingblock.terminal pre .command:not([data-prompt]):before{content:"$"}
+table.pyhltable{border-collapse:separate;border:0;margin-bottom:0;background:none}
+table.pyhltable td{vertical-align:top;padding-top:0;padding-bottom:0}
+table.pyhltable td.code{padding-left:.75em;padding-right:0}
+pre.pygments .lineno,table.pyhltable td:not(.code){color:#999;padding-left:0;padding-right:.5em;border-right:1px solid #ddddd8}
+pre.pygments .lineno{display:inline-block;margin-right:.25em}
+table.pyhltable .linenodiv{background:none!important;padding-right:0!important}
+.quoteblock{margin:0 1em 1.25em 1.5em;display:table}
+.quoteblock>.title{margin-left:-1.5em;margin-bottom:.75em}
+.quoteblock blockquote,.quoteblock blockquote p{color:rgba(0,0,0,.85);font-size:1.15rem;line-height:1.75;word-spacing:.1em;letter-spacing:0;font-style:italic;text-align:justify}
+.quoteblock blockquote{margin:0;padding:0;border:0}
+.quoteblock blockquote:before{content:"\201c";float:left;font-size:2.75em;font-weight:bold;line-height:.6em;margin-left:-.6em;color:#7a2518;text-shadow:0 1px 2px rgba(0,0,0,.1)}
+.quoteblock blockquote>.paragraph:last-child p{margin-bottom:0}
+.quoteblock .attribution{margin-top:.5em;margin-right:.5ex;text-align:right}
+.quoteblock .quoteblock{margin-left:0;margin-right:0;padding:.5em 0;border-left:3px solid rgba(0,0,0,.6)}
+.quoteblock .quoteblock blockquote{padding:0 0 0 .75em}
+.quoteblock .quoteblock blockquote:before{display:none}
+.verseblock{margin:0 1em 1.25em 1em}
+.verseblock pre{font-family:"Open Sans","DejaVu Sans",sans;font-size:1.15rem;color:rgba(0,0,0,.85);font-weight:300;text-rendering:optimizeLegibility}
+.verseblock pre strong{font-weight:400}
+.verseblock .attribution{margin-top:1.25rem;margin-left:.5ex}
+.quoteblock .attribution,.verseblock .attribution{font-size:.9375em;line-height:1.45;font-style:italic}
+.quoteblock .attribution br,.verseblock .attribution br{display:none}
+.quoteblock .attribution cite,.verseblock .attribution cite{display:block;letter-spacing:-.05em;color:rgba(0,0,0,.6)}
+.quoteblock.abstract{margin:0 0 1.25em 0;display:block}
+.quoteblock.abstract blockquote,.quoteblock.abstract blockquote p{text-align:left;word-spacing:0}
+.quoteblock.abstract blockquote:before,.quoteblock.abstract blockquote p:first-of-type:before{display:none}
+table.tableblock{max-width:100%;border-collapse:separate}
+table.tableblock td>.paragraph:last-child p>p:last-child,table.tableblock th>p:last-child,table.tableblock td>p:last-child{margin-bottom:0}
+table.spread{width:100%}
+table.tableblock,th.tableblock,td.tableblock{border:0 solid #dedede}
+table.grid-all th.tableblock,table.grid-all td.tableblock{border-width:0 1px 1px 0}
+table.grid-all tfoot>tr>th.tableblock,table.grid-all tfoot>tr>td.tableblock{border-width:1px 1px 0 0}
+table.grid-cols th.tableblock,table.grid-cols td.tableblock{border-width:0 1px 0 0}
+table.grid-all *>tr>.tableblock:last-child,table.grid-cols *>tr>.tableblock:last-child{border-right-width:0}
+table.grid-rows th.tableblock,table.grid-rows td.tableblock{border-width:0 0 1px 0}
+table.grid-all tbody>tr:last-child>th.tableblock,table.grid-all tbody>tr:last-child>td.tableblock,table.grid-all thead:last-child>tr>th.tableblock,table.grid-rows tbody>tr:last-child>th.tableblock,table.grid-rows tbody>tr:last-child>td.tableblock,table.grid-rows thead:last-child>tr>th.tableblock{border-bottom-width:0}
+table.grid-rows tfoot>tr>th.tableblock,table.grid-rows tfoot>tr>td.tableblock{border-width:1px 0 0 0}
+table.frame-all{border-width:1px}
+table.frame-sides{border-width:0 1px}
+table.frame-topbot{border-width:1px 0}
+th.halign-left,td.halign-left{text-align:left}
+th.halign-right,td.halign-right{text-align:right}
+th.halign-center,td.halign-center{text-align:center}
+th.valign-top,td.valign-top{vertical-align:top}
+th.valign-bottom,td.valign-bottom{vertical-align:bottom}
+th.valign-middle,td.valign-middle{vertical-align:middle}
+table thead th,table tfoot th{font-weight:bold}
+tbody tr th{display:table-cell;line-height:1.6;background:#f7f8f7}
+tbody tr th,tbody tr th p,tfoot tr th,tfoot tr th p{color:rgba(0,0,0,.8);font-weight:bold}
+p.tableblock>code:only-child{background:none;padding:0}
+p.tableblock{font-size:1em}
+td>div.verse{white-space:pre}
+ol{margin-left:1.75em}
+ul li ol{margin-left:1.5em}
+dl dd{margin-left:1.125em}
+dl dd:last-child,dl dd:last-child>:last-child{margin-bottom:0}
+ol>li p,ul>li p,ul dd,ol dd,.olist .olist,.ulist .ulist,.ulist .olist,.olist .ulist{margin-bottom:.625em}
+ul.unstyled,ol.unnumbered,ul.checklist,ul.none{list-style-type:none}
+ul.unstyled,ol.unnumbered,ul.checklist{margin-left:.625em}
+ul.checklist li>p:first-child>.fa-square-o:first-child,ul.checklist li>p:first-child>.fa-check-square-o:first-child{width:1em;font-size:.85em}
+ul.checklist li>p:first-child>input[type="checkbox"]:first-child{width:1em;position:relative;top:1px}
+ul.inline{margin:0 auto .625em auto;margin-left:-1.375em;margin-right:0;padding:0;list-style:none;overflow:hidden}
+ul.inline>li{list-style:none;float:left;margin-left:1.375em;display:block}
+ul.inline>li>*{display:block}
+.unstyled dl dt{font-weight:400;font-style:normal}
+ol.arabic{list-style-type:decimal}
+ol.decimal{list-style-type:decimal-leading-zero}
+ol.loweralpha{list-style-type:lower-alpha}
+ol.upperalpha{list-style-type:upper-alpha}
+ol.lowerroman{list-style-type:lower-roman}
+ol.upperroman{list-style-type:upper-roman}
+ol.lowergreek{list-style-type:lower-greek}
+.hdlist>table,.colist>table{border:0;background:none}
+.hdlist>table>tbody>tr,.colist>table>tbody>tr{background:none}
+td.hdlist1{padding-right:.75em;font-weight:bold}
+td.hdlist1,td.hdlist2{vertical-align:top}
+.literalblock+.colist,.listingblock+.colist{margin-top:-.5em}
+.colist>table tr>td:first-of-type{padding:0 .75em;line-height:1}
+.colist>table tr>td:last-of-type{padding:.25em 0}
+.thumb,.th{line-height:0;display:inline-block;border:solid 4px #fff;-webkit-box-shadow:0 0 0 1px #ddd;box-shadow:0 0 0 1px #ddd}
+.imageblock.left,.imageblock[style*="float: left"]{margin:.25em .625em 1.25em 0}
+.imageblock.right,.imageblock[style*="float: right"]{margin:.25em 0 1.25em .625em}
+.imageblock>.title{margin-bottom:0}
+.imageblock.thumb,.imageblock.th{border-width:6px}
+.imageblock.thumb>.title,.imageblock.th>.title{padding:0 .125em}
+.image.left,.image.right{margin-top:.25em;margin-bottom:.25em;display:inline-block;line-height:0}
+.image.left{margin-right:.625em}
+.image.right{margin-left:.625em}
+a.image{text-decoration:none}
+span.footnote,span.footnoteref{vertical-align:super;font-size:.875em}
+span.footnote a,span.footnoteref a{text-decoration:none}
+span.footnote a:active,span.footnoteref a:active{text-decoration:underline}
+#footnotes{padding-top:.75em;padding-bottom:.75em;margin-bottom:.625em}
+#footnotes hr{width:20%;min-width:6.25em;margin:-.25em 0 .75em 0;border-width:1px 0 0 0}
+#footnotes .footnote{padding:0 .375em;line-height:1.3;font-size:.875em;margin-left:1.2em;text-indent:-1.2em;margin-bottom:.2em}
+#footnotes .footnote a:first-of-type{font-weight:bold;text-decoration:none}
+#footnotes .footnote:last-of-type{margin-bottom:0}
+#content #footnotes{margin-top:-.625em;margin-bottom:0;padding:.75em 0}
+.gist .file-data>table{border:0;background:#fff;width:100%;margin-bottom:0}
+.gist .file-data>table td.line-data{width:99%}
+div.unbreakable{page-break-inside:avoid}
+.big{font-size:larger}
+.small{font-size:smaller}
+.underline{text-decoration:underline}
+.overline{text-decoration:overline}
+.line-through{text-decoration:line-through}
+.aqua{color:#00bfbf}
+.aqua-background{background-color:#00fafa}
+.black{color:#000}
+.black-background{background-color:#000}
+.blue{color:#0000bf}
+.blue-background{background-color:#0000fa}
+.fuchsia{color:#bf00bf}
+.fuchsia-background{background-color:#fa00fa}
+.gray{color:#606060}
+.gray-background{background-color:#7d7d7d}
+.green{color:#006000}
+.green-background{background-color:#007d00}
+.lime{color:#00bf00}
+.lime-background{background-color:#00fa00}
+.maroon{color:#600000}
+.maroon-background{background-color:#7d0000}
+.navy{color:#000060}
+.navy-background{background-color:#00007d}
+.olive{color:#606000}
+.olive-background{background-color:#7d7d00}
+.purple{color:#600060}
+.purple-background{background-color:#7d007d}
+.red{color:#bf0000}
+.red-background{background-color:#fa0000}
+.silver{color:#909090}
+.silver-background{background-color:#bcbcbc}
+.teal{color:#006060}
+.teal-background{background-color:#007d7d}
+.white{color:#bfbfbf}
+.white-background{background-color:#fafafa}
+.yellow{color:#bfbf00}
+.yellow-background{background-color:#fafa00}
+span.icon>.fa{cursor:default}
+.admonitionblock td.icon [class^="fa icon-"]{font-size:2.5em;text-shadow:1px 1px 2px rgba(0,0,0,.5);cursor:default}
+.admonitionblock td.icon .icon-note:before{content:"\f05a";color:#19407c}
+.admonitionblock td.icon .icon-tip:before{content:"\f0eb";text-shadow:1px 1px 2px rgba(155,155,0,.8);color:#111}
+.admonitionblock td.icon .icon-warning:before{content:"\f071";color:#bf6900}
+.admonitionblock td.icon .icon-caution:before{content:"\f06d";color:#bf3400}
+.admonitionblock td.icon .icon-important:before{content:"\f06a";color:#bf0000}
+.conum[data-value]{display:inline-block;color:#fff!important;background-color:rgba(0,0,0,.8);-webkit-border-radius:100px;border-radius:100px;text-align:center;font-size:.75em;width:1.67em;height:1.67em;line-height:1.67em;font-family:"Open Sans","DejaVu Sans",sans-serif;font-style:normal;font-weight:bold}
+.conum[data-value] *{color:#fff!important}
+.conum[data-value]+b{display:none}
+.conum[data-value]:after{content:attr(data-value)}
+pre .conum[data-value]{position:relative;top:-.125em}
+b.conum *{color:inherit!important}
+.conum:not([data-value]):empty{display:none}
+h1,h2{letter-spacing:-.01em}
+dt,th.tableblock,td.content{text-rendering:optimizeLegibility}
+p,td.content{letter-spacing:-.01em}
+p strong,td.content strong{letter-spacing:-.005em}
+p,blockquote,dt,td.content{font-size:1.0625rem}
+p{margin-bottom:1.25rem}
+.sidebarblock p,.sidebarblock dt,.sidebarblock td.content,p.tableblock{font-size:1em}
+.exampleblock>.content{background-color:#fffef7;border-color:#e0e0dc;-webkit-box-shadow:0 1px 4px #e0e0dc;box-shadow:0 1px 4px #e0e0dc}
+.print-only{display:none!important}
+@media print{@page{margin:1.25cm .75cm}
+*{-webkit-box-shadow:none!important;box-shadow:none!important;text-shadow:none!important}
+a{color:inherit!important;text-decoration:underline!important}
+a.bare,a[href^="#"],a[href^="mailto:"]{text-decoration:none!important}
+a[href^="http:"]:not(.bare):after,a[href^="https:"]:not(.bare):after{content:"(" attr(href) ")";display:inline-block;font-size:.875em;padding-left:.25em}
+abbr[title]:after{content:" (" attr(title) ")"}
+pre,blockquote,tr,img{page-break-inside:avoid}
+thead{display:table-header-group}
+img{max-width:100%!important}
+p,blockquote,dt,td.content{font-size:1em;orphans:3;widows:3}
+h2,h3,#toctitle,.sidebarblock>.content>.title{page-break-after:avoid}
+#toc,.sidebarblock,.exampleblock>.content{background:none!important}
+#toc{border-bottom:1px solid #ddddd8!important;padding-bottom:0!important}
+.sect1{padding-bottom:0!important}
+.sect1+.sect1{border:0!important}
+#header>h1:first-child{margin-top:1.25rem}
+body.book #header{text-align:center}
+body.book #header>h1:first-child{border:0!important;margin:2.5em 0 1em 0}
+body.book #header .details{border:0!important;display:block;padding:0!important}
+body.book #header .details span:first-child{margin-left:0!important}
+body.book #header .details br{display:block}
+body.book #header .details br+span:before{content:none!important}
+body.book #toc{border:0!important;text-align:left!important;padding:0!important;margin:0!important}
+body.book #toc,body.book #preamble,body.book h1.sect0,body.book .sect1>h2{page-break-before:always}
+.listingblock code[data-lang]:before{display:block}
+#footer{background:none!important;padding:0 .9375em}
+#footer-text{color:rgba(0,0,0,.6)!important;font-size:.9em}
+.hide-on-print{display:none!important}
+.print-only{display:block!important}
+.hide-for-print{display:none!important}
+.show-for-print{display:inherit!important}}
+</style>
+<style>
+.listingblock .pygments .hll { background-color: #ffffcc }
+.listingblock .pygments { background: #f8f8f8; }
+.listingblock .pygments .tok-c { color: #408080; font-style: italic } /* Comment */
+.listingblock .pygments .tok-err { border: 1px solid #FF0000 } /* Error */
+.listingblock .pygments .tok-k { color: #008000; font-weight: bold } /* Keyword */
+.listingblock .pygments .tok-o { color: #666666 } /* Operator */
+.listingblock .pygments .tok-cm { color: #408080; font-style: italic } /* Comment.Multiline */
+.listingblock .pygments .tok-cp { color: #BC7A00 } /* Comment.Preproc */
+.listingblock .pygments .tok-c1 { color: #408080; font-style: italic } /* Comment.Single */
+.listingblock .pygments .tok-cs { color: #408080; font-style: italic } /* Comment.Special */
+.listingblock .pygments .tok-gd { color: #A00000 } /* Generic.Deleted */
+.listingblock .pygments .tok-ge { font-style: italic } /* Generic.Emph */
+.listingblock .pygments .tok-gr { color: #FF0000 } /* Generic.Error */
+.listingblock .pygments .tok-gh { color: #000080; font-weight: bold } /* Generic.Heading */
+.listingblock .pygments .tok-gi { color: #00A000 } /* Generic.Inserted */
+.listingblock .pygments .tok-go { color: #888888 } /* Generic.Output */
+.listingblock .pygments .tok-gp { color: #000080; font-weight: bold } /* Generic.Prompt */
+.listingblock .pygments .tok-gs { font-weight: bold } /* Generic.Strong */
+.listingblock .pygments .tok-gu { color: #800080; font-weight: bold } /* Generic.Subheading */
+.listingblock .pygments .tok-gt { color: #0044DD } /* Generic.Traceback */
+.listingblock .pygments .tok-kc { color: #008000; font-weight: bold } /* Keyword.Constant */
+.listingblock .pygments .tok-kd { color: #008000; font-weight: bold } /* Keyword.Declaration */
+.listingblock .pygments .tok-kn { color: #008000; font-weight: bold } /* Keyword.Namespace */
+.listingblock .pygments .tok-kp { color: #008000 } /* Keyword.Pseudo */
+.listingblock .pygments .tok-kr { color: #008000; font-weight: bold } /* Keyword.Reserved */
+.listingblock .pygments .tok-kt { color: #B00040 } /* Keyword.Type */
+.listingblock .pygments .tok-m { color: #666666 } /* Literal.Number */
+.listingblock .pygments .tok-s { color: #BA2121 } /* Literal.String */
+.listingblock .pygments .tok-na { color: #7D9029 } /* Name.Attribute */
+.listingblock .pygments .tok-nb { color: #008000 } /* Name.Builtin */
+.listingblock .pygments .tok-nc { color: #0000FF; font-weight: bold } /* Name.Class */
+.listingblock .pygments .tok-no { color: #880000 } /* Name.Constant */
+.listingblock .pygments .tok-nd { color: #AA22FF } /* Name.Decorator */
+.listingblock .pygments .tok-ni { color: #999999; font-weight: bold } /* Name.Entity */
+.listingblock .pygments .tok-ne { color: #D2413A; font-weight: bold } /* Name.Exception */
+.listingblock .pygments .tok-nf { color: #0000FF } /* Name.Function */
+.listingblock .pygments .tok-nl { color: #A0A000 } /* Name.Label */
+.listingblock .pygments .tok-nn { color: #0000FF; font-weight: bold } /* Name.Namespace */
+.listingblock .pygments .tok-nt { color: #008000; font-weight: bold } /* Name.Tag */
+.listingblock .pygments .tok-nv { color: #19177C } /* Name.Variable */
+.listingblock .pygments .tok-ow { color: #AA22FF; font-weight: bold } /* Operator.Word */
+.listingblock .pygments .tok-w { color: #bbbbbb } /* Text.Whitespace */
+.listingblock .pygments .tok-mb { color: #666666 } /* Literal.Number.Bin */
+.listingblock .pygments .tok-mf { color: #666666 } /* Literal.Number.Float */
+.listingblock .pygments .tok-mh { color: #666666 } /* Literal.Number.Hex */
+.listingblock .pygments .tok-mi { color: #666666 } /* Literal.Number.Integer */
+.listingblock .pygments .tok-mo { color: #666666 } /* Literal.Number.Oct */
+.listingblock .pygments .tok-sb { color: #BA2121 } /* Literal.String.Backtick */
+.listingblock .pygments .tok-sc { color: #BA2121 } /* Literal.String.Char */
+.listingblock .pygments .tok-sd { color: #BA2121; font-style: italic } /* Literal.String.Doc */
+.listingblock .pygments .tok-s2 { color: #BA2121 } /* Literal.String.Double */
+.listingblock .pygments .tok-se { color: #BB6622; font-weight: bold } /* Literal.String.Escape */
+.listingblock .pygments .tok-sh { color: #BA2121 } /* Literal.String.Heredoc */
+.listingblock .pygments .tok-si { color: #BB6688; font-weight: bold } /* Literal.String.Interpol */
+.listingblock .pygments .tok-sx { color: #008000 } /* Literal.String.Other */
+.listingblock .pygments .tok-sr { color: #BB6688 } /* Literal.String.Regex */
+.listingblock .pygments .tok-s1 { color: #BA2121 } /* Literal.String.Single */
+.listingblock .pygments .tok-ss { color: #19177C } /* Literal.String.Symbol */
+.listingblock .pygments .tok-bp { color: #008000 } /* Name.Builtin.Pseudo */
+.listingblock .pygments .tok-vc { color: #19177C } /* Name.Variable.Class */
+.listingblock .pygments .tok-vg { color: #19177C } /* Name.Variable.Global */
+.listingblock .pygments .tok-vi { color: #19177C } /* Name.Variable.Instance */
+.listingblock .pygments .tok-il { color: #666666 } /* Literal.Number.Integer.Long */
+</style>
+</head>
+<body class="article toc2 toc-right">
+<div id="header">
+<h1>pugixml 1.6 quick start guide</h1>
+<div class="details">
+website 
+<a href="http://pugixml.org" class="bare">http://pugixml.org</a> 
+repository 
+<a href="http://github.com/zeux/pugixml" class="bare">http://github.com/zeux/pugixml</a> 
+</div>
+<div id="toc" class="toc2">
+<div id="toctitle">Table of Contents</div>
+<ul class="sectlevel1">
+<li><a href="#introduction">Introduction</a></li>
+<li><a href="#install">Installation</a></li>
+<li><a href="#dom">Document object model</a></li>
+<li><a href="#loading">Loading document</a></li>
+<li><a href="#access">Accessing document data</a></li>
+<li><a href="#modify">Modifying document data</a></li>
+<li><a href="#saving">Saving document</a></li>
+<li><a href="#feedback">Feedback</a></li>
+<li><a href="#license">License</a></li>
+</ul>
+</div>
+</div>
+<div id="content">
+<div class="sect1">
+<h2 id="introduction"><a class="anchor" href="#introduction"></a>Introduction</h2>
+<div class="sectionbody">
+<div class="paragraph">
+<a href="http://pugixml.org/">pugixml</a> is a light-weight C&#43;&#43; XML processing library. It consists of a DOM-like interface with rich traversal/modification capabilities, an extremely fast XML parser which constructs the DOM tree from an XML file/buffer, and an XPath 1.0 implementation for complex data-driven tree queries. Full Unicode support is also available, with two Unicode interface variants and conversions between different Unicode encodings (which happen automatically during parsing/saving). The library is extremely portable and easy to integrate and use. pugixml is developed and maintained since 2006 and has many users. All code is distributed under the <a href="#license">MIT license</a>, making it completely free to use in both open-source and proprietary applications.
+</div>
+<div class="paragraph">
+pugixml enables very fast, convenient and memory-efficient XML document processing. However, since pugixml has a DOM parser, it can&#8217;t process XML documents that do not fit in memory; also the parser is a non-validating one, so if you need DTD/Schema validation, the library is not for you.
+</div>
+<div class="paragraph">
+This is the quick start guide for pugixml, which purpose is to enable you to start using the library quickly. Many important library features are either not described at all or only mentioned briefly; for more complete information you <a href="manual.html">should read the complete manual</a>.
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+No documentation is perfect; neither is this one. If you find errors or omissions, please don’t hesitate to <a href="https://github.com/zeux/pugixml/issues/new">submit an issue or open a pull request</a> with a fix.
+</td>
+</tr>
+</table>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="install"><a class="anchor" href="#install"></a>Installation</h2>
+<div class="sectionbody">
+<div class="paragraph">
+You can download the latest source distribution as an archive:
+</div>
+<div class="paragraph">
+<a href="https://github.com/zeux/pugixml/releases/download/v1.6/pugixml-1.6.zip">pugixml-1.6.zip</a> (Windows line endings)
+/
+<a href="https://github.com/zeux/pugixml/releases/download/v1.6/pugixml-1.6.tar.gz">pugixml-1.6.tar.gz</a> (Unix line endings)
+</div>
+<div class="paragraph">
+The distribution contains library source, documentation (the guide you&#8217;re reading now and the manual) and some code examples. After downloading the distribution, install pugixml by extracting all files from the compressed archive.
+</div>
+<div class="paragraph">
+The complete pugixml source consists of three files - one source file, <code>pugixml.cpp</code>, and two header files, <code>pugixml.hpp</code> and <code>pugiconfig.hpp</code>. <code>pugixml.hpp</code> is the primary header which you need to include in order to use pugixml classes/functions. The rest of this guide assumes that <code>pugixml.hpp</code> is either in the current directory or in one of include directories of your projects, so that <code>#include "pugixml.hpp"</code> can find the header; however you can also use relative path (i.e. <code>#include "../libs/pugixml/src/pugixml.hpp"</code>) or include directory-relative path (i.e. <code>#include &lt;xml/thirdparty/pugixml/src/pugixml.hpp&gt;</code>).
+</div>
+<div class="paragraph">
+The easiest way to build pugixml is to compile the source file, <code>pugixml.cpp</code>, along with the existing library/executable. This process depends on the method of building your application; for example, if you&#8217;re using Microsoft Visual Studio [<a id="_footnoteref_1" class="footnote" href="#_footnote_1" title="View footnote.">1</a>], Apple Xcode, Code::Blocks or any other IDE, just add <code>pugixml.cpp</code> to one of your projects. There are other building methods available, including building pugixml as a standalone static/shared library; <a href="manual/install.html#install.building">read the manual</a> for further information.
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="dom"><a class="anchor" href="#dom"></a>Document object model</h2>
+<div class="sectionbody">
+<div class="paragraph">
+pugixml stores XML data in DOM-like way: the entire XML document (both document structure and element data) is stored in memory as a tree. The tree can be loaded from character stream (file, string, C&#43;&#43; I/O stream), then traversed via special API or XPath expressions. The whole tree is mutable: both node structure and node/attribute data can be changed at any time. Finally, the result of document transformations can be saved to a character stream (file, C&#43;&#43; I/O stream or custom transport).
+</div>
+<div class="paragraph">
+The root of the tree is the document itself, which corresponds to C&#43;&#43; type <code>xml_document</code>. Document has one or more child nodes, which correspond to C&#43;&#43; type <code>xml_node</code>. Nodes have different types; depending on a type, a node can have a collection of child nodes, a collection of attributes, which correspond to C&#43;&#43; type <code>xml_attribute</code>, and some additional data (i.e. name).
+</div>
+<div class="paragraph">
+The most common node types are:
+</div>
+<div class="ulist">
+<ul>
+<li>
+Document node (<code>node_document</code>) - this is the root of the tree, which consists of several child nodes. This node corresponds to <code>xml_document</code> class; note that <code>xml_document</code> is a sub-class of <code>xml_node</code>, so the entire node interface is also available.
+</li>
+<li>
+Element/tag node (<code>node_element</code>) - this is the most common type of node, which represents XML elements. Element nodes have a name, a collection of attributes and a collection of child nodes (both of which may be empty). The attribute is a simple name/value pair.
+</li>
+<li>
+Plain character data nodes (<code>node_pcdata</code>) represent plain text in XML. PCDATA nodes have a value, but do not have name or children/attributes. Note that plain character data is not a part of the element node but instead has its own node; for example, an element node can have several child PCDATA nodes.
+</li>
+</ul>
+</div>
+<div class="paragraph">
+Despite the fact that there are several node types, there are only three C&#43;&#43; types representing the tree (<code>xml_document</code>, <code>xml_node</code>, <code>xml_attribute</code>); some operations on <code>xml_node</code> are only valid for certain node types. They are described below.
+</div>
+<div class="admonitionblock note">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Note</div>
+</td>
+<td class="content">
+All pugixml classes and functions are located in <code>pugi</code> namespace; you have to either use explicit name qualification (i.e. <code>pugi::xml_node</code>), or to gain access to relevant symbols via <code>using</code> directive (i.e. <code>using pugi::xml_node;</code> or <code>using namespace pugi;</code>).
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+<code>xml_document</code> is the owner of the entire document structure; destroying the document destroys the whole tree. The interface of <code>xml_document</code> consists of loading functions, saving functions and the entire interface of <code>xml_node</code>, which allows for document inspection and/or modification. Note that while <code>xml_document</code> is a sub-class of <code>xml_node</code>, <code>xml_node</code> is not a polymorphic type; the inheritance is present only to simplify usage.
+</div>
+<div class="paragraph">
+<code>xml_node</code> is the handle to document node; it can point to any node in the document, including document itself. There is a common interface for nodes of all types. Note that <code>xml_node</code> is only a handle to the actual node, not the node itself - you can have several <code>xml_node</code> handles pointing to the same underlying object. Destroying <code>xml_node</code> handle does not destroy the node and does not remove it from the tree.
+</div>
+<div class="paragraph">
+There is a special value of <code>xml_node</code> type, known as null node or empty node. It does not correspond to any node in any document, and thus resembles null pointer. However, all operations are defined on empty nodes; generally the operations don&#8217;t do anything and return empty nodes/attributes or empty strings as their result. This is useful for chaining calls; i.e. you can get the grandparent of a node like so: <code>node.parent().parent()</code>; if a node is a null node or it does not have a parent, the first <code>parent()</code> call returns null node; the second <code>parent()</code> call then also returns null node, so you don&#8217;t have to check for errors twice. You can test if a handle is null via implicit boolean cast: <code>if (node) { &#8230;&#8203; }</code> or <code>if (!node) { &#8230;&#8203; }</code>.
+</div>
+<div class="paragraph">
+<code>xml_attribute</code> is the handle to an XML attribute; it has the same semantics as <code>xml_node</code>, i.e. there can be several <code>xml_attribute</code> handles pointing to the same underlying object and there is a special null attribute value, which propagates to function results.
+</div>
+<div class="paragraph">
+There are two choices of interface and internal representation when configuring pugixml: you can either choose the UTF-8 (also called char) interface or UTF-16/32 (also called wchar_t) one. The choice is controlled via <code>PUGIXML_WCHAR_MODE</code> define; you can set it via <code>pugiconfig.hpp</code> or via preprocessor options. All tree functions that work with strings work with either C-style null terminated strings or STL strings of the selected character type. <a href="manual/dom.html#dom.unicode">Read the manual</a> for additional information on Unicode interface.
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="loading"><a class="anchor" href="#loading"></a>Loading document</h2>
+<div class="sectionbody">
+<div class="paragraph">
+pugixml provides several functions for loading XML data from various places - files, C&#43;&#43; iostreams, memory buffers. All functions use an extremely fast non-validating parser. This parser is not fully W3C conformant - it can load any valid XML document, but does not perform some well-formedness checks. While considerable effort is made to reject invalid XML documents, some validation is not performed because of performance reasons. XML data is always converted to internal character format before parsing. pugixml supports all popular Unicode encodings (UTF-8, UTF-16 (big and little endian), UTF-32 (big and little endian); UCS-2 is naturally supported since it&#8217;s a strict subset of UTF-16) and handles all encoding conversions automatically.
+</div>
+<div class="paragraph">
+The most common source of XML data is files; pugixml provides a separate function for loading XML document from file. This function accepts file path as its first argument, and also two optional arguments, which specify parsing options and input data encoding, which are described in the manual.
+</div>
+<div class="paragraph">
+This is an example of loading XML document from file (<a href="samples/load_file.cpp" class="bare">samples/load_file.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">pugi::xml_document doc;
+
+pugi::xml_parse_result result = doc.load_file(&quot;tree.xml&quot;);
+
+std::cout &lt;&lt; &quot;Load result: &quot; &lt;&lt; result.description() &lt;&lt; &quot;, mesh name: &quot; &lt;&lt; doc.child(&quot;mesh&quot;).attribute(&quot;name&quot;).value() &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+<code>load_file</code>, as well as other loading functions, destroys the existing document tree and then tries to load the new tree from the specified file. The result of the operation is returned in an <code>xml_parse_result</code> object; this object contains the operation status, and the related information (i.e. last successfully parsed position in the input file, if parsing fails).
+</div>
+<div class="paragraph">
+Parsing result object can be implicitly converted to <code>bool</code>; if you do not want to handle parsing errors thoroughly, you can just check the return value of load functions as if it was a <code>bool</code>: <code>if (doc.load_file("file.xml")) { &#8230;&#8203; } else { &#8230;&#8203; }</code>. Otherwise you can use the <code>status</code> member to get parsing status, or the <code>description()</code> member function to get the status in a string form.
+</div>
+<div class="paragraph">
+This is an example of handling loading errors (<a href="samples/load_error_handling.cpp" class="bare">samples/load_error_handling.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">pugi::xml_document doc;
+pugi::xml_parse_result result = doc.load_string(source);
+
+if (result)
+{
+ std::cout &lt;&lt; &quot;XML [&quot; &lt;&lt; source &lt;&lt; &quot;] parsed without errors, attr value: [&quot; &lt;&lt; doc.child(&quot;node&quot;).attribute(&quot;attr&quot;).value() &lt;&lt; &quot;]\n\n&quot;;
+}
+else
+{
+ std::cout &lt;&lt; &quot;XML [&quot; &lt;&lt; source &lt;&lt; &quot;] parsed with errors, attr value: [&quot; &lt;&lt; doc.child(&quot;node&quot;).attribute(&quot;attr&quot;).value() &lt;&lt; &quot;]\n&quot;;
+ std::cout &lt;&lt; &quot;Error description: &quot; &lt;&lt; result.description() &lt;&lt; &quot;\n&quot;;
+ std::cout &lt;&lt; &quot;Error offset: &quot; &lt;&lt; result.offset &lt;&lt; &quot; (error at [...&quot; &lt;&lt; (source + result.offset) &lt;&lt; &quot;]\n\n&quot;;
+}</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Sometimes XML data should be loaded from some other source than file, i.e. HTTP URL; also you may want to load XML data from file using non-standard functions, i.e. to use your virtual file system facilities or to load XML from gzip-compressed files. These scenarios either require loading document from memory, in which case you should prepare a contiguous memory block with all XML data and to pass it to one of buffer loading functions, or loading document from C&#43;&#43; IOstream, in which case you should provide an object which implements <code>std::istream</code> or <code>std::wistream</code> interface.
+</div>
+<div class="paragraph">
+There are different functions for loading document from memory; they treat the passed buffer as either an immutable one (<code>load_buffer</code>), a mutable buffer which is owned by the caller (<code>load_buffer_inplace</code>), or a mutable buffer which ownership belongs to pugixml (<code>load_buffer_inplace_own</code>). There is also a simple helper function, <code>xml_document::load</code>, for cases when you want to load the XML document from null-terminated character string.
+</div>
+<div class="paragraph">
+This is an example of loading XML document from memory using one of these functions (<a href="samples/load_memory.cpp" class="bare">samples/load_memory.cpp</a>); read the sample code for more examples:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">const char source[] = &quot;&lt;mesh name=&#39;sphere&#39;&gt;&lt;bounds&gt;0 0 1 1&lt;/bounds&gt;&lt;/mesh&gt;&quot;;
+size_t size = sizeof(source);</code></pre>
+</div>
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// You can use load_buffer_inplace to load document from mutable memory block; the block&#39;s lifetime must exceed that of document
+char* buffer = new char[size];
+memcpy(buffer, source, size);
+
+// The block can be allocated by any method; the block is modified during parsing
+pugi::xml_parse_result result = doc.load_buffer_inplace(buffer, size);
+
+// You have to destroy the block yourself after the document is no longer used
+delete[] buffer;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+This is a simple example of loading XML document from file using streams (<a href="samples/load_stream.cpp" class="bare">samples/load_stream.cpp</a>); read the sample code for more complex examples involving wide streams and locales:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">std::ifstream stream(&quot;weekly-utf-8.xml&quot;);
+pugi::xml_parse_result result = doc.load(stream);</code></pre>
+</div>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="access"><a class="anchor" href="#access"></a>Accessing document data</h2>
+<div class="sectionbody">
+<div class="paragraph">
+pugixml features an extensive interface for getting various types of data from the document and for traversing the document. You can use various accessors to get node/attribute data, you can traverse the child node/attribute lists via accessors or iterators, you can do depth-first traversals with <code>xml_tree_walker</code> objects, and you can use XPath for complex data-driven queries.
+</div>
+<div class="paragraph">
+You can get node or attribute name via <code>name()</code> accessor, and value via <code>value()</code> accessor. Note that both functions never return null pointers - they either return a string with the relevant content, or an empty string if name/value is absent or if the handle is null. Also there are two notable things for reading values:
+</div>
+<div class="ulist">
+<ul>
+<li>
+It is common to store data as text contents of some node - i.e. <code>&lt;node&gt;&lt;description&gt;This is a node&lt;/description&gt;&lt;/node&gt;</code>. In this case, <code>&lt;description&gt;</code> node does not have a value, but instead has a child of type <code>node_pcdata</code> with value <code>"This is a node"</code>. pugixml provides <code>child_value()</code> and <code>text()</code> helper functions to parse such data.
+</li>
+<li>
+In many cases attribute values have types that are not strings - i.e. an attribute may always contain values that should be treated as integers, despite the fact that they are represented as strings in XML. pugixml provides several accessors that convert attribute value to some other type.
+</li>
+</ul>
+</div>
+<div class="paragraph">
+This is an example of using these functions (<a href="samples/traverse_base.cpp" class="bare">samples/traverse_base.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">for (pugi::xml_node tool = tools.child(&quot;Tool&quot;); tool; tool = tool.next_sibling(&quot;Tool&quot;))
+{
+ std::cout &lt;&lt; &quot;Tool &quot; &lt;&lt; tool.attribute(&quot;Filename&quot;).value();
+ std::cout &lt;&lt; &quot;: AllowRemote &quot; &lt;&lt; tool.attribute(&quot;AllowRemote&quot;).as_bool();
+ std::cout &lt;&lt; &quot;, Timeout &quot; &lt;&lt; tool.attribute(&quot;Timeout&quot;).as_int();
+ std::cout &lt;&lt; &quot;, Description &#39;&quot; &lt;&lt; tool.child_value(&quot;Description&quot;) &lt;&lt; &quot;&#39;\n&quot;;
+}</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Since a lot of document traversal consists of finding the node/attribute with the correct name, there are special functions for that purpose. For example, <code>child("Tool")</code> returns the first node which has the name <code>"Tool"</code>, or null handle if there is no such node. This is an example of using such functions (<a href="samples/traverse_base.cpp" class="bare">samples/traverse_base.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">std::cout &lt;&lt; &quot;Tool for *.dae generation: &quot; &lt;&lt; tools.find_child_by_attribute(&quot;Tool&quot;, &quot;OutputFileMasks&quot;, &quot;*.dae&quot;).attribute(&quot;Filename&quot;).value() &lt;&lt; &quot;\n&quot;;
+
+for (pugi::xml_node tool = tools.child(&quot;Tool&quot;); tool; tool = tool.next_sibling(&quot;Tool&quot;))
+{
+ std::cout &lt;&lt; &quot;Tool &quot; &lt;&lt; tool.attribute(&quot;Filename&quot;).value() &lt;&lt; &quot;\n&quot;;
+}</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Child node lists and attribute lists are simply double-linked lists; while you can use <code>previous_sibling</code>/<code>next_sibling</code> and other such functions for iteration, pugixml additionally provides node and attribute iterators, so that you can treat nodes as containers of other nodes or attributes. All iterators are bidirectional and support all usual iterator operations. The iterators are invalidated if the node/attribute objects they&#8217;re pointing to are removed from the tree; adding nodes/attributes does not invalidate any iterators.
+</div>
+<div class="paragraph">
+Here is an example of using iterators for document traversal (<a href="samples/traverse_iter.cpp" class="bare">samples/traverse_iter.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">for (pugi::xml_node_iterator it = tools.begin(); it != tools.end(); ++it)
+{
+ std::cout &lt;&lt; &quot;Tool:&quot;;
+
+ for (pugi::xml_attribute_iterator ait = it-&gt;attributes_begin(); ait != it-&gt;attributes_end(); ++ait)
+ {
+ std::cout &lt;&lt; &quot; &quot; &lt;&lt; ait-&gt;name() &lt;&lt; &quot;=&quot; &lt;&lt; ait-&gt;value();
+ }
+
+ std::cout &lt;&lt; std::endl;
+}</code></pre>
+</div>
+</div>
+<div class="paragraph">
+If your C&#43;&#43; compiler supports range-based for-loop (this is a C&#43;&#43;11 feature, at the time of writing it&#8217;s supported by Microsoft Visual Studio 11 Beta, GCC 4.6 and Clang 3.0), you can use it to enumerate nodes/attributes. Additional helpers are provided to support this; note that they are also compatible with <a href="http://www.boost.org/libs/foreach/">Boost Foreach</a>, and possibly other pre-C&#43;&#43;11 foreach facilities.
+</div>
+<div class="paragraph">
+Here is an example of using C&#43;&#43;11 range-based for loop for document traversal (<a href="samples/traverse_rangefor.cpp" class="bare">samples/traverse_rangefor.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">for (pugi::xml_node tool: tools.children(&quot;Tool&quot;))
+{
+ std::cout &lt;&lt; &quot;Tool:&quot;;
+
+ for (pugi::xml_attribute attr: tool.attributes())
+ {
+ std::cout &lt;&lt; &quot; &quot; &lt;&lt; attr.name() &lt;&lt; &quot;=&quot; &lt;&lt; attr.value();
+ }
+
+ for (pugi::xml_node child: tool.children())
+ {
+ std::cout &lt;&lt; &quot;, child &quot; &lt;&lt; child.name();
+ }
+
+ std::cout &lt;&lt; std::endl;
+}</code></pre>
+</div>
+</div>
+<div class="paragraph">
+The methods described above allow traversal of immediate children of some node; if you want to do a deep tree traversal, you&#8217;ll have to do it via a recursive function or some equivalent method. However, pugixml provides a helper for depth-first traversal of a subtree. In order to use it, you have to implement <code>xml_tree_walker</code> interface and to call <code>traverse</code> function.
+</div>
+<div class="paragraph">
+This is an example of traversing tree hierarchy with xml_tree_walker (<a href="samples/traverse_walker.cpp" class="bare">samples/traverse_walker.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">struct simple_walker: pugi::xml_tree_walker
+{
+ virtual bool for_each(pugi::xml_node&amp; node)
+ {
+ for (int i = 0; i &lt; depth(); ++i) std::cout &lt;&lt; &quot; &quot;; // indentation
+
+ std::cout &lt;&lt; node_types[node.type()] &lt;&lt; &quot;: name=&#39;&quot; &lt;&lt; node.name() &lt;&lt; &quot;&#39;, value=&#39;&quot; &lt;&lt; node.value() &lt;&lt; &quot;&#39;\n&quot;;
+
+ return true; // continue traversal
+ }
+};</code></pre>
+</div>
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">simple_walker walker;
+doc.traverse(walker);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Finally, for complex queries often a higher-level DSL is needed. pugixml provides an implementation of XPath 1.0 language for such queries. The complete description of XPath usage can be found in the manual, but here are some examples:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">pugi::xpath_node_set tools = doc.select_nodes(&quot;/Profile/Tools/Tool[@AllowRemote=&#39;true&#39; and @DeriveCaptionFrom=&#39;lastparam&#39;]&quot;);
+
+std::cout &lt;&lt; &quot;Tools:\n&quot;;
+
+for (pugi::xpath_node_set::const_iterator it = tools.begin(); it != tools.end(); ++it)
+{
+ pugi::xpath_node node = *it;
+ std::cout &lt;&lt; node.node().attribute(&quot;Filename&quot;).value() &lt;&lt; &quot;\n&quot;;
+}
+
+pugi::xpath_node build_tool = doc.select_node(&quot;//Tool[contains(Description, &#39;build system&#39;)]&quot;);
+
+if (build_tool)
+ std::cout &lt;&lt; &quot;Build tool: &quot; &lt;&lt; build_tool.node().attribute(&quot;Filename&quot;).value() &lt;&lt; &quot;\n&quot;;</code></pre>
+</div>
+</div>
+<div class="admonitionblock caution">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Caution</div>
+</td>
+<td class="content">
+XPath functions throw <code>xpath_exception</code> objects on error; the sample above does not catch these exceptions.
+</td>
+</tr>
+</table>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="modify"><a class="anchor" href="#modify"></a>Modifying document data</h2>
+<div class="sectionbody">
+<div class="paragraph">
+The document in pugixml is fully mutable: you can completely change the document structure and modify the data of nodes/attributes. All functions take care of memory management and structural integrity themselves, so they always result in structurally valid tree - however, it is possible to create an invalid XML tree (for example, by adding two attributes with the same name or by setting attribute/node name to empty/invalid string). Tree modification is optimized for performance and for memory consumption, so if you have enough memory you can create documents from scratch with pugixml and later save them to file/stream instead of relying on error-prone manual text writing and without too much overhead.
+</div>
+<div class="paragraph">
+All member functions that change node/attribute data or structure are non-constant and thus can not be called on constant handles. However, you can easily convert constant handle to non-constant one by simple assignment: <code>void foo(const pugi::xml_node&amp; n) { pugi::xml_node nc = n; }</code>, so const-correctness here mainly provides additional documentation.
+</div>
+<div class="paragraph">
+As discussed before, nodes can have name and value, both of which are strings. Depending on node type, name or value may be absent. You can use <code>set_name</code> and <code>set_value</code> member functions to set them. Similar functions are available for attributes; however, the <code>set_value</code> function is overloaded for some other types except strings, like floating-point numbers. Also, attribute value can be set using an assignment operator. This is an example of setting node/attribute name and value (<a href="samples/modify_base.cpp" class="bare">samples/modify_base.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">pugi::xml_node node = doc.child(&quot;node&quot;);
+
+// change node name
+std::cout &lt;&lt; node.set_name(&quot;notnode&quot;);
+std::cout &lt;&lt; &quot;, new node name: &quot; &lt;&lt; node.name() &lt;&lt; std::endl;
+
+// change comment text
+std::cout &lt;&lt; doc.last_child().set_value(&quot;useless comment&quot;);
+std::cout &lt;&lt; &quot;, new comment text: &quot; &lt;&lt; doc.last_child().value() &lt;&lt; std::endl;
+
+// we can&#39;t change value of the element or name of the comment
+std::cout &lt;&lt; node.set_value(&quot;1&quot;) &lt;&lt; &quot;, &quot; &lt;&lt; doc.last_child().set_name(&quot;2&quot;) &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">pugi::xml_attribute attr = node.attribute(&quot;id&quot;);
+
+// change attribute name/value
+std::cout &lt;&lt; attr.set_name(&quot;key&quot;) &lt;&lt; &quot;, &quot; &lt;&lt; attr.set_value(&quot;345&quot;);
+std::cout &lt;&lt; &quot;, new attribute: &quot; &lt;&lt; attr.name() &lt;&lt; &quot;=&quot; &lt;&lt; attr.value() &lt;&lt; std::endl;
+
+// we can use numbers or booleans
+attr.set_value(1.234);
+std::cout &lt;&lt; &quot;new attribute value: &quot; &lt;&lt; attr.value() &lt;&lt; std::endl;
+
+// we can also use assignment operators for more concise code
+attr = true;
+std::cout &lt;&lt; &quot;final attribute value: &quot; &lt;&lt; attr.value() &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+Nodes and attributes do not exist without a document tree, so you can&#8217;t create them without adding them to some document. A node or attribute can be created at the end of node/attribute list or before/after some other node. All insertion functions return the handle to newly created object on success, and null handle on failure. Even if the operation fails (for example, if you&#8217;re trying to add a child node to PCDATA node), the document remains in consistent state, but the requested node/attribute is not added.
+</div>
+<div class="admonitionblock caution">
+<table>
+<tr>
+<td class="icon">
+<div class="title">Caution</div>
+</td>
+<td class="content">
+<code>attribute()</code> and <code>child()</code> functions do not add attributes or nodes to the tree, so code like <code>node.attribute("id") = 123;</code> will not do anything if <code>node</code> does not have an attribute with name <code>"id"</code>. Make sure you&#8217;re operating with existing attributes/nodes by adding them if necessary.
+</td>
+</tr>
+</table>
+</div>
+<div class="paragraph">
+This is an example of adding new attributes/nodes to the document (<a href="samples/modify_add.cpp" class="bare">samples/modify_add.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// add node with some name
+pugi::xml_node node = doc.append_child(&quot;node&quot;);
+
+// add description node with text child
+pugi::xml_node descr = node.append_child(&quot;description&quot;);
+descr.append_child(pugi::node_pcdata).set_value(&quot;Simple node&quot;);
+
+// add param node before the description
+pugi::xml_node param = node.insert_child_before(&quot;param&quot;, descr);
+
+// add attributes to param node
+param.append_attribute(&quot;name&quot;) = &quot;version&quot;;
+param.append_attribute(&quot;value&quot;) = 1.1;
+param.insert_attribute_after(&quot;type&quot;, param.attribute(&quot;name&quot;)) = &quot;float&quot;;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+If you do not want your document to contain some node or attribute, you can remove it with <code>remove_attribute</code> and <code>remove_child</code> functions. Removing the attribute or node invalidates all handles to the same underlying object, and also invalidates all iterators pointing to the same object. Removing node also invalidates all past-the-end iterators to its attribute or child node list. Be careful to ensure that all such handles and iterators either do not exist or are not used after the attribute/node is removed.
+</div>
+<div class="paragraph">
+This is an example of removing attributes/nodes from the document (<a href="samples/modify_remove.cpp" class="bare">samples/modify_remove.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// remove description node with the whole subtree
+pugi::xml_node node = doc.child(&quot;node&quot;);
+node.remove_child(&quot;description&quot;);
+
+// remove id attribute
+pugi::xml_node param = node.child(&quot;param&quot;);
+param.remove_attribute(&quot;value&quot;);
+
+// we can also remove nodes/attributes by handles
+pugi::xml_attribute id = param.attribute(&quot;name&quot;);
+param.remove_attribute(id);</code></pre>
+</div>
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="saving"><a class="anchor" href="#saving"></a>Saving document</h2>
+<div class="sectionbody">
+<div class="paragraph">
+Often after creating a new document or loading the existing one and processing it, it is necessary to save the result back to file. Also it is occasionally useful to output the whole document or a subtree to some stream; use cases include debug printing, serialization via network or other text-oriented medium, etc. pugixml provides several functions to output any subtree of the document to a file, stream or another generic transport interface; these functions allow to customize the output format, and also perform necessary encoding conversions.
+</div>
+<div class="paragraph">
+Before writing to the destination the node/attribute data is properly formatted according to the node type; all special XML symbols, such as &lt; and &amp;, are properly escaped. In order to guard against forgotten node/attribute names, empty node/attribute names are printed as <code>":anonymous"</code>. For well-formed output, make sure all node and attribute names are set to meaningful values.
+</div>
+<div class="paragraph">
+If you want to save the whole document to a file, you can use the <code>save_file</code> function, which returns <code>true</code> on success. This is a simple example of saving XML document to file (<a href="samples/save_file.cpp" class="bare">samples/save_file.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// save document to file
+std::cout &lt;&lt; &quot;Saving result: &quot; &lt;&lt; doc.save_file(&quot;save_file_output.xml&quot;) &lt;&lt; std::endl;</code></pre>
+</div>
+</div>
+<div class="paragraph">
+To enhance interoperability pugixml provides functions for saving document to any object which implements C&#43;&#43; <code>std::ostream</code> interface. This allows you to save documents to any standard C&#43;&#43; stream (i.e. file stream) or any third-party compliant implementation (i.e. Boost Iostreams). Most notably, this allows for easy debug output, since you can use <code>std::cout</code> stream as saving target. There are two functions, one works with narrow character streams, another handles wide character ones.
+</div>
+<div class="paragraph">
+This is a simple example of saving XML document to standard output (<a href="samples/save_stream.cpp" class="bare">samples/save_stream.cpp</a>):
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">// save document to standard output
+std::cout &lt;&lt; &quot;Document:\n&quot;;
+doc.save(std::cout);</code></pre>
+</div>
+</div>
+<div class="paragraph">
+All of the above saving functions are implemented in terms of writer interface. This is a simple interface with a single function, which is called several times during output process with chunks of document data as input. In order to output the document via some custom transport, for example sockets, you should create an object which implements <code>xml_writer_file</code> interface and pass it to <code>xml_document::save</code> function.
+</div>
+<div class="paragraph">
+This is a simple example of custom writer for saving document data to STL string (<a href="samples/save_custom_writer.cpp" class="bare">samples/save_custom_writer.cpp</a>); read the sample code for more complex examples:
+</div>
+<div class="listingblock">
+<div class="content">
+<pre class="pygments highlight"><code data-lang="c++">struct xml_string_writer: pugi::xml_writer
+{
+ std::string result;
+
+ virtual void write(const void* data, size_t size)
+ {
+ result.append(static_cast&lt;const char*&gt;(data), size);
+ }
+};</code></pre>
+</div>
+</div>
+<div class="paragraph">
+While the previously described functions save the whole document to the destination, it is easy to save a single subtree. Instead of calling <code>xml_document::save</code>, just call <code>xml_node::print</code> function on the target node. You can save node contents to C&#43;&#43; IOstream object or custom writer in this way. Saving a subtree slightly differs from saving the whole document; <a href="manual/saving.html#saving.subtree">read the manual</a> for more information.
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="feedback"><a class="anchor" href="#feedback"></a>Feedback</h2>
+<div class="sectionbody">
+<div class="paragraph">
+If you believe you&#8217;ve found a bug in pugixml, please file an issue via <a href="https://github.com/zeux/pugixml/issues/new">issue submission form</a>. Be sure to include the relevant information so that the bug can be reproduced: the version of pugixml, compiler version and target architecture, the code that uses pugixml and exhibits the bug, etc. Feature requests and contributions can be filed as issues, too.
+</div>
+<div class="paragraph">
+If filing an issue is not possible due to privacy or other concerns, you can contact pugixml author by e-mail directly: <a href="mailto:arseny.kapoulkine@gmail.com">arseny.kapoulkine@gmail.com</a>.
+</div>
+</div>
+</div>
+<div class="sect1">
+<h2 id="license"><a class="anchor" href="#license"></a>License</h2>
+<div class="sectionbody">
+<div class="paragraph">
+The pugixml library is distributed under the MIT license:
+</div>
+<div class="literalblock">
+<div class="content">
+<pre>Copyright (c) 2006-2015 Arseny Kapoulkine
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.</pre>
+</div>
+</div>
+<div class="paragraph">
+This means that you can freely use pugixml in your applications, both open-source and proprietary. If you use pugixml in a product, it is sufficient to add an acknowledgment like this to the product distribution:
+</div>
+<div class="literalblock">
+<div class="content">
+<pre>This software is based on pugixml library (http://pugixml.org).
+pugixml is Copyright (C) 2006-2015 Arseny Kapoulkine.</pre>
+</div>
+</div>
+</div>
+</div>
+</div>
+<div id="footnotes">
+<hr>
+<div class="footnote" id="_footnote_1">
+<a href="#_footnoteref_1">1</a>. All trademarks used are properties of their respective owners.
+</div>
+</div>
+<div id="footer">
+<div id="footer-text">
+Last updated 2015-03-24 20:19:09 PDT
+</div>
+</div>
+</body>
+</html>
\ No newline at end of file

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/character.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/custom_memory_management.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/include.cpp Added

@@ -0,0 +1,64 @@
+#include "pugixml.hpp"
+
+#include <string.h>
+#include <iostream>
+
+// tag::code[]
+bool load_preprocess(pugi::xml_document& doc, const char* path);
+
+bool preprocess(pugi::xml_node node)
+{
+ for (pugi::xml_node child = node.first_child(); child; )
+ {
+ if (child.type() == pugi::node_pi && strcmp(child.name(), "include") == 0)
+ {
+ pugi::xml_node include = child;
+
+ // load new preprocessed document (note: ideally this should handle relative paths)
+ const char* path = include.value();
+
+ pugi::xml_document doc;
+ if (!load_preprocess(doc, path)) return false;
+
+ // insert the comment marker above include directive
+ node.insert_child_before(pugi::node_comment, include).set_value(path);
+
+ // copy the document above the include directive (this retains the original order!)
+ for (pugi::xml_node ic = doc.first_child(); ic; ic = ic.next_sibling())
+ {
+ node.insert_copy_before(ic, include);
+ }
+
+ // remove the include node and move to the next child
+ child = child.next_sibling();
+
+ node.remove_child(include);
+ }
+ else
+ {
+ if (!preprocess(child)) return false;
+
+ child = child.next_sibling();
+ }
+ }
+
+ return true;
+}
+
+bool load_preprocess(pugi::xml_document& doc, const char* path)
+{
+ pugi::xml_parse_result result = doc.load_file(path, pugi::parse_default | pugi::parse_pi); // for <?include?>
+ 
+ return result ? preprocess(doc) : false;
+}
+// end::code[]
+
+int main()
+{
+ pugi::xml_document doc;
+ if (!load_preprocess(doc, "character.xml")) return -1;
+
+ doc.print(std::cout);
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/load_error_handling.cpp Added

@@ -0,0 +1,33 @@
+#include "pugixml.hpp"
+
+#include <iostream>
+
+void check_xml(const char* source)
+{
+// tag::code[]
+ pugi::xml_document doc;
+ pugi::xml_parse_result result = doc.load_string(source);
+
+ if (result)
+ {
+ std::cout << "XML [" << source << "] parsed without errors, attr value: [" << doc.child("node").attribute("attr").value() << "]\n\n";
+ }
+ else
+ {
+ std::cout << "XML [" << source << "] parsed with errors, attr value: [" << doc.child("node").attribute("attr").value() << "]\n";
+ std::cout << "Error description: " << result.description() << "\n";
+ std::cout << "Error offset: " << result.offset << " (error at [..." << (source + result.offset) << "]\n\n";
+ }
+// end::code[]
+}
+
+int main()
+{
+ check_xml("<node attr='value'><child>text</child></node>");
+ check_xml("<node attr='value'><child>text</chil></node>");
+ check_xml("<node attr='value'><child>text</child>");
+ check_xml("<node attr='value\"><child>text</child></node>");
+ check_xml("<node attr='value'><#tag /></node>");
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/load_file.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/load_memory.cpp Added

@@ -0,0 +1,66 @@
+#include "pugixml.hpp"
+
+#include <iostream>
+#include <cstring>
+
+int main()
+{
+// tag::decl[]
+ const char source[] = "<mesh name='sphere'><bounds>0 0 1 1</bounds></mesh>";
+ size_t size = sizeof(source);
+// end::decl[]
+
+ pugi::xml_document doc;
+
+ {
+ // tag::load_buffer[]
+ // You can use load_buffer to load document from immutable memory block:
+ pugi::xml_parse_result result = doc.load_buffer(source, size);
+ // end::load_buffer[]
+
+ std::cout << "Load result: " << result.description() << ", mesh name: " << doc.child("mesh").attribute("name").value() << std::endl;
+ }
+
+ {
+ // tag::load_buffer_inplace_begin[]
+ // You can use load_buffer_inplace to load document from mutable memory block; the block's lifetime must exceed that of document
+ char* buffer = new char[size];
+ memcpy(buffer, source, size);
+
+ // The block can be allocated by any method; the block is modified during parsing
+ pugi::xml_parse_result result = doc.load_buffer_inplace(buffer, size);
+ // end::load_buffer_inplace_begin[]
+
+ std::cout << "Load result: " << result.description() << ", mesh name: " << doc.child("mesh").attribute("name").value() << std::endl;
+
+ // tag::load_buffer_inplace_end[]
+ // You have to destroy the block yourself after the document is no longer used
+ delete[] buffer;
+ // end::load_buffer_inplace_end[]
+ }
+
+ {
+ // tag::load_buffer_inplace_own[]
+ // You can use load_buffer_inplace_own to load document from mutable memory block and to pass the ownership of this block
+ // The block has to be allocated via pugixml allocation function - using i.e. operator new here is incorrect
+ char* buffer = static_cast<char*>(pugi::get_memory_allocation_function()(size));
+ memcpy(buffer, source, size);
+
+ // The block will be deleted by the document
+ pugi::xml_parse_result result = doc.load_buffer_inplace_own(buffer, size);
+ // end::load_buffer_inplace_own[]
+
+ std::cout << "Load result: " << result.description() << ", mesh name: " << doc.child("mesh").attribute("name").value() << std::endl;
+ }
+
+ {
+ // tag::load_string[]
+ // You can use load to load document from null-terminated strings, for example literals:
+ pugi::xml_parse_result result = doc.load_string("<mesh name='sphere'><bounds>0 0 1 1</bounds></mesh>");
+ // end::load_string[]
+
+ std::cout << "Load result: " << result.description() << ", mesh name: " << doc.child("mesh").attribute("name").value() << std::endl;
+ }
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/load_options.cpp Added

@@ -0,0 +1,30 @@
+#include "pugixml.hpp"
+
+#include <iostream>
+
+int main()
+{
+ pugi::xml_document doc;
+
+// tag::code[]
+ const char* source = "<node>&lt;</node>";
+
+ // Parsing with default options; note that comment node is not added to the tree, and entity reference &lt; is expanded
+ doc.load_string(source);
+ std::cout << "First node value: [" << doc.first_child().value() << "], node child value: [" << doc.child_value("node") << "]\n";
+
+ // Parsing with additional parse_comments option; comment node is now added to the tree
+ doc.load_string(source, pugi::parse_default | pugi::parse_comments);
+ std::cout << "First node value: [" << doc.first_child().value() << "], node child value: [" << doc.child_value("node") << "]\n";
+
+ // Parsing with additional parse_comments option and without the (default) parse_escapes option; &lt; is not expanded
+ doc.load_string(source, (pugi::parse_default | pugi::parse_comments) & ~pugi::parse_escapes);
+ std::cout << "First node value: [" << doc.first_child().value() << "], node child value: [" << doc.child_value("node") << "]\n";
+
+ // Parsing with minimal option mask; comment node is not added to the tree, and &lt; is not expanded
+ doc.load_string(source, pugi::parse_minimal);
+ std::cout << "First node value: [" << doc.first_child().value() << "], node child value: [" << doc.child_value("node") << "]\n";
+// end::code[]
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/load_stream.cpp Added

@@ -0,0 +1,97 @@
+#include "pugixml.hpp"
+
+#include <fstream>
+#include <iomanip>
+#include <iostream>
+
+void print_doc(const char* message, const pugi::xml_document& doc, const pugi::xml_parse_result& result)
+{
+ std::cout
+ << message
+ << "\t: load result '" << result.description() << "'"
+ << ", first character of root name: U+" << std::hex << std::uppercase << std::setw(4) << std::setfill('0') << pugi::as_wide(doc.first_child().name())[0]
+ << ", year: " << doc.first_child().first_child().first_child().child_value()
+ << std::endl;
+}
+
+bool try_imbue(std::wistream& stream, const char* name)
+{
+ try
+ {
+ stream.imbue(std::locale(name));
+
+ return true;
+ }
+ catch (const std::exception&)
+ {
+ return false;
+ }
+}
+
+int main()
+{
+ pugi::xml_document doc;
+
+ {
+ // tag::code[]
+ std::ifstream stream("weekly-utf-8.xml");
+ pugi::xml_parse_result result = doc.load(stream);
+ // end::code[]
+
+ // first character of root name: U+9031, year: 1997
+ print_doc("UTF8 file from narrow stream", doc, result);
+ }
+
+ {
+ std::ifstream stream("weekly-utf-16.xml");
+ pugi::xml_parse_result result = doc.load(stream);
+
+ // first character of root name: U+9031, year: 1997
+ print_doc("UTF16 file from narrow stream", doc, result);
+ }
+
+ {
+ // Since wide streams are treated as UTF-16/32 ones, you can't load the UTF-8 file from a wide stream
+ // directly if you have localized characters; you'll have to provide a UTF8 locale (there is no
+ // standard one; you can use utf8_codecvt_facet from Boost or codecvt_utf8 from C++0x)
+ std::wifstream stream("weekly-utf-8.xml");
+
+ if (try_imbue(stream, "en_US.UTF-8")) // try Linux encoding
+ {
+ pugi::xml_parse_result result = doc.load(stream);
+
+ // first character of root name: U+00E9, year: 1997
+ print_doc("UTF8 file from wide stream", doc, result);
+ }
+ else
+ {
+ std::cout << "UTF-8 locale is not available\n";
+ }
+ }
+
+ {
+ // Since wide streams are treated as UTF-16/32 ones, you can't load the UTF-16 file from a wide stream without
+ // using custom codecvt; you can use codecvt_utf16 from C++0x
+ }
+
+ {
+ // Since encoding names are non-standard, you can't load the Shift-JIS (or any other non-ASCII) file
+ // from a wide stream portably
+ std::wifstream stream("weekly-shift_jis.xml");
+
+ if (try_imbue(stream, ".932") || // try Microsoft encoding
+ try_imbue(stream, "ja_JP.SJIS")) // try Linux encoding; run "localedef -i ja_JP -c -f SHIFT_JIS /usr/lib/locale/ja_JP.SJIS" to get it
+ {
+ pugi::xml_parse_result result = doc.load(stream);
+
+ // first character of root name: U+9031, year: 1997
+ print_doc("Shift-JIS file from wide stream", doc, result);
+ }
+ else
+ {
+ std::cout << "Shift-JIS locale is not available\n";
+ }
+ }
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/modify_add.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/modify_base.cpp Added

@@ -0,0 +1,43 @@
+#include "pugixml.hpp"
+
+#include <string.h>
+#include <iostream>
+
+int main()
+{
+ pugi::xml_document doc;
+ if (!doc.load_string("<node id='123'>text</node>", pugi::parse_default | pugi::parse_comments)) return -1;
+
+ // tag::node[]
+ pugi::xml_node node = doc.child("node");
+
+ // change node name
+ std::cout << node.set_name("notnode");
+ std::cout << ", new node name: " << node.name() << std::endl;
+
+ // change comment text
+ std::cout << doc.last_child().set_value("useless comment");
+ std::cout << ", new comment text: " << doc.last_child().value() << std::endl;
+
+ // we can't change value of the element or name of the comment
+ std::cout << node.set_value("1") << ", " << doc.last_child().set_name("2") << std::endl;
+ // end::node[]
+
+ // tag::attr[]
+ pugi::xml_attribute attr = node.attribute("id");
+
+ // change attribute name/value
+ std::cout << attr.set_name("key") << ", " << attr.set_value("345");
+ std::cout << ", new attribute: " << attr.name() << "=" << attr.value() << std::endl;
+
+ // we can use numbers or booleans
+ attr.set_value(1.234);
+ std::cout << "new attribute value: " << attr.value() << std::endl;
+
+ // we can also use assignment operators for more concise code
+ attr = true;
+ std::cout << "final attribute value: " << attr.value() << std::endl;
+ // end::attr[]
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/modify_remove.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/save_custom_writer.cpp Added

@@ -0,0 +1,116 @@
+#include "pugixml.hpp"
+
+#include <string>
+#include <iostream>
+#include <cstring>
+
+// tag::code[]
+struct xml_string_writer: pugi::xml_writer
+{
+ std::string result;
+
+ virtual void write(const void* data, size_t size)
+ {
+ result.append(static_cast<const char*>(data), size);
+ }
+};
+// end::code[]
+
+struct xml_memory_writer: pugi::xml_writer
+{
+ char* buffer;
+ size_t capacity;
+
+ size_t result;
+
+ xml_memory_writer(): buffer(0), capacity(0), result(0)
+ {
+ }
+
+ xml_memory_writer(char* buffer, size_t capacity): buffer(buffer), capacity(capacity), result(0)
+ {
+ }
+
+ size_t written_size() const
+ {
+ return result < capacity ? result : capacity;
+ }
+
+ virtual void write(const void* data, size_t size)
+ {
+ if (result < capacity)
+ {
+ size_t chunk = (capacity - result < size) ? capacity - result : size;
+
+ memcpy(buffer + result, data, chunk);
+ }
+
+ result += size;
+ }
+};
+
+std::string node_to_string(pugi::xml_node node)
+{
+ xml_string_writer writer;
+ node.print(writer);
+
+ return writer.result;
+}
+
+char* node_to_buffer(pugi::xml_node node, char* buffer, size_t size)
+{
+ if (size == 0) return buffer;
+
+ // leave one character for null terminator
+ xml_memory_writer writer(buffer, size - 1);
+ node.print(writer);
+
+ // null terminate
+ buffer[writer.written_size()] = 0;
+
+ return buffer;
+}
+
+char* node_to_buffer_heap(pugi::xml_node node)
+{
+ // first pass: get required memory size
+ xml_memory_writer counter;
+ node.print(counter);
+
+ // allocate necessary size (+1 for null termination)
+ char* buffer = new char[counter.result + 1];
+
+ // second pass: actual printing
+ xml_memory_writer writer(buffer, counter.result);
+ node.print(writer);
+
+ // null terminate
+ buffer[writer.written_size()] = 0;
+
+ return buffer;
+}
+
+int main()
+{
+ // get a test document
+ pugi::xml_document doc;
+ doc.load_string("<foo bar='baz'>hey</foo>");
+
+ // get contents as std::string (single pass)
+ std::cout << "contents: [" << node_to_string(doc) << "]\n";
+
+ // get contents into fixed-size buffer (single pass)
+ char large_buf[128];
+ std::cout << "contents: [" << node_to_buffer(doc, large_buf, sizeof(large_buf)) << "]\n";
+
+ // get contents into fixed-size buffer (single pass, shows truncating behavior)
+ char small_buf[22];
+ std::cout << "contents: [" << node_to_buffer(doc, small_buf, sizeof(small_buf)) << "]\n";
+
+ // get contents into heap-allocated buffer (two passes)
+ char* heap_buf = node_to_buffer_heap(doc);
+ std::cout << "contents: [" << heap_buf << "]\n";
+ delete[] heap_buf;
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/save_declaration.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/save_file.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/save_options.cpp Added

@@ -0,0 +1,48 @@
+#include "pugixml.hpp"
+
+#include <iostream>
+
+int main()
+{
+ // tag::code[]
+ // get a test document
+ pugi::xml_document doc;
+ doc.load_string("<foo bar='baz'><call>hey</call></foo>");
+
+ // default options; prints
+ // <?xml version="1.0"?>
+ // <foo bar="baz">
+ // <call>hey</call>
+ // </foo>
+ doc.save(std::cout);
+ std::cout << std::endl;
+
+ // default options with custom indentation string; prints
+ // <?xml version="1.0"?>
+ // <foo bar="baz">
+ // --<call>hey</call>
+ // </foo>
+ doc.save(std::cout, "--");
+ std::cout << std::endl;
+
+ // default options without indentation; prints
+ // <?xml version="1.0"?>
+ // <foo bar="baz">
+ // <call>hey</call>
+ // </foo>
+ doc.save(std::cout, "\t", pugi::format_default & ~pugi::format_indent); // can also pass "" instead of indentation string for the same effect
+ std::cout << std::endl;
+
+ // raw output; prints
+ // <?xml version="1.0"?><foo bar="baz"><call>hey</call></foo>
+ doc.save(std::cout, "\t", pugi::format_raw);
+ std::cout << std::endl << std::endl;
+
+ // raw output without declaration; prints
+ // <foo bar="baz"><call>hey</call></foo>
+ doc.save(std::cout, "\t", pugi::format_raw | pugi::format_no_declaration);
+ std::cout << std::endl;
+ // end::code[]
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/save_stream.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/save_subtree.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/text.cpp Added

@@ -0,0 +1,35 @@
+#include "pugixml.hpp"
+
+#include <iostream>
+
+int main()
+{
+ pugi::xml_document doc;
+
+ // get a test document
+ doc.load_string("<project><name>test</name><version>1.1</version><public>yes</public></project>");
+
+ pugi::xml_node project = doc.child("project");
+
+ // tag::access[]
+ std::cout << "Project name: " << project.child("name").text().get() << std::endl;
+ std::cout << "Project version: " << project.child("version").text().as_double() << std::endl;
+ std::cout << "Project visibility: " << (project.child("public").text().as_bool(/* def= */ true) ? "public" : "private") << std::endl;
+ std::cout << "Project description: " << project.child("description").text().get() << std::endl;
+ // end::access[]
+
+ std::cout << std::endl;
+
+ // tag::modify[]
+ // change project version
+ project.child("version").text() = 1.2;
+
+ // add description element and set the contents
+ // note that we do not have to explicitly add the node_pcdata child
+ project.append_child("description").text().set("a test project");
+ // end::modify[]
+
+ doc.save(std::cout);
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/transitions.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/traverse_base.cpp Added

@@ -0,0 +1,51 @@
+#include "pugixml.hpp"
+
+#include <string.h>
+#include <iostream>
+
+int main()
+{
+ pugi::xml_document doc;
+ if (!doc.load_file("xgconsole.xml")) return -1;
+
+ pugi::xml_node tools = doc.child("Profile").child("Tools");
+
+ // tag::basic[]
+ for (pugi::xml_node tool = tools.first_child(); tool; tool = tool.next_sibling())
+ {
+ std::cout << "Tool:";
+
+ for (pugi::xml_attribute attr = tool.first_attribute(); attr; attr = attr.next_attribute())
+ {
+ std::cout << " " << attr.name() << "=" << attr.value();
+ }
+
+ std::cout << std::endl;
+ }
+ // end::basic[]
+
+ std::cout << std::endl;
+
+ // tag::data[]
+ for (pugi::xml_node tool = tools.child("Tool"); tool; tool = tool.next_sibling("Tool"))
+ {
+ std::cout << "Tool " << tool.attribute("Filename").value();
+ std::cout << ": AllowRemote " << tool.attribute("AllowRemote").as_bool();
+ std::cout << ", Timeout " << tool.attribute("Timeout").as_int();
+ std::cout << ", Description '" << tool.child_value("Description") << "'\n";
+ }
+ // end::data[]
+
+ std::cout << std::endl;
+
+ // tag::contents[]
+ std::cout << "Tool for *.dae generation: " << tools.find_child_by_attribute("Tool", "OutputFileMasks", "*.dae").attribute("Filename").value() << "\n";
+
+ for (pugi::xml_node tool = tools.child("Tool"); tool; tool = tool.next_sibling("Tool"))
+ {
+ std::cout << "Tool " << tool.attribute("Filename").value() << "\n";
+ }
+ // end::contents[]
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/traverse_iter.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/traverse_predicate.cpp Added

@@ -0,0 +1,48 @@
+#include "pugixml.hpp"
+
+#include <string.h>
+#include <iostream>
+
+// tag::decl[]
+bool small_timeout(pugi::xml_node node)
+{
+ return node.attribute("Timeout").as_int() < 20;
+}
+
+struct allow_remote_predicate
+{
+ bool operator()(pugi::xml_attribute attr) const
+ {
+ return strcmp(attr.name(), "AllowRemote") == 0;
+ }
+
+ bool operator()(pugi::xml_node node) const
+ {
+ return node.attribute("AllowRemote").as_bool();
+ }
+};
+// end::decl[]
+
+int main()
+{
+ pugi::xml_document doc;
+ if (!doc.load_file("xgconsole.xml")) return -1;
+
+ pugi::xml_node tools = doc.child("Profile").child("Tools");
+
+ // tag::find[]
+ // Find child via predicate (looks for direct children only)
+ std::cout << tools.find_child(allow_remote_predicate()).attribute("Filename").value() << std::endl;
+
+ // Find node via predicate (looks for all descendants in depth-first order)
+ std::cout << doc.find_node(allow_remote_predicate()).attribute("Filename").value() << std::endl;
+
+ // Find attribute via predicate
+ std::cout << tools.last_child().find_attribute(allow_remote_predicate()).value() << std::endl;
+
+ // We can use simple functions instead of function objects
+ std::cout << tools.find_child(small_timeout).attribute("Filename").value() << std::endl;
+ // end::find[]
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/traverse_rangefor.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/traverse_walker.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/tree.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/weekly-shift_jis.xml Added

@@ -0,0 +1,78 @@
+<?xml version="1.0" encoding="Shift_JIS"?>
+<!DOCTYPE Tñ SYSTEM "weekly-shift_jis.dtd">
+
+<Tñ>
+ <NT>
+ <Nx>1997</Nx>
+ <x>1</x>
+ <T>1</T>
+ </NT>
+
+ <¼>
+ <>Rc</>
+ <¼>¾Y</¼>
+ </¼>
+
+ <Æ±ñXg>
+ <Æ±ñ>
+ <Æ±¼>XMLGfB^[Ìì¬</Æ±¼>
+ <Æ±R[h>X3355-23</Æ±R[h>
+ <HÇ>
+ <©ÏàèH>1600</©ÏàèH>
+ <ÀÑH>320</ÀÑH>
+ <©ÏàèH>160</©ÏàèH>
+ <ÀÑH>24</ÀÑH>
+ </HÇ>
+ <\èÚXg>
+ <\èÚ>
+ XMLGfB^[Ìî{dlÌì¬
+ </\èÚ>
+ </\èÚXg>
+ <À{Xg>
+ <À{>
+ XMLGfB^[Ìî{dlÌì¬
+ </À{>
+ <À{>
+ £¼Ð»iÌ@\²¸
+ </À{>
+ </À{Xg>
+ <ã·ÖÌv¿Xg>
+ <ã·ÖÌv¿>
+ ÁÉÈµ
+ </ã·ÖÌv¿>
+ </ã·ÖÌv¿Xg>
+ <âè_Îô>
+ XMLÆÍ½©í©çÈ¢B
+ </âè_Îô>
+ </Æ±ñ>
+
+ <Æ±ñ>
+ <Æ±¼>õGWÌJ</Æ±¼>
+ <Æ±R[h>S8821-76</Æ±R[h>
+ <HÇ>
+ <©ÏàèH>120</©ÏàèH>
+ <ÀÑH>6</ÀÑH>
+ <©ÏàèH>32</©ÏàèH>
+ <ÀÑH>2</ÀÑH>
+ </HÇ>
+ <\èÚXg>
+ <\èÚ>
+ <A href="http://www.goo.ne.jp">goo</A>Ì@\ð²×ÄÝé
+ </\èÚ>
+ </\èÚXg>
+ <À{Xg>
+ <À{>
+ XÉAÇ¤¢¤õGWª é©²¸·é
+ </À{>
+ </À{Xg>
+ <ã·ÖÌv¿Xg>
+ <ã·ÖÌv¿>
+ Jð·éÌÍßñÇ¤ÈÌÅAYahoo!ðûµÄº³¢B
+ </ã·ÖÌv¿>
+ </ã·ÖÌv¿Xg>
+ <âè_Îô>
+ õGWÅÔðç¹é±ÆªÅ«È¢Biv²¸j
+ </âè_Îô>
+ </Æ±ñ>
+ </Æ±ñXg>
+</Tñ>

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/weekly-utf-16.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/weekly-utf-8.xml Added

@@ -0,0 +1,78 @@
+<?xml version="1.0"?>
+<!DOCTYPE 週報 SYSTEM "weekly-utf-8.dtd">
+
+<週報>
+ <年月週>
+ <年度>1997</年度>
+ <月度>1</月度>
+ <週>1</週>
+ </年月週>
+
+ <氏名>
+ <氏>山田</氏>
+ <名>太郎</名>
+ </氏名>
+
+ <業務報告リスト>
+ <業務報告>
+ <業務名>XMLエディターの作成</業務名>
+ <業務コード>X3355-23</業務コード>
+ <工数管理>
+ <見積もり工数>1600</見積もり工数>
+ <実績工数>320</実績工数>
+ <当月見積もり工数>160</当月見積もり工数>
+ <当月実績工数>24</当月実績工数>
+ </工数管理>
+ <予定項目リスト>
+ <予定項目>
+ XMLエディターの基本仕様の作成
+ </予定項目>
+ </予定項目リスト>
+ <実施事項リスト>
+ <実施事項>
+ XMLエディターの基本仕様の作成
+ </実施事項>
+ <実施事項>
+ 競合他社製品の機能調査
+ </実施事項>
+ </実施事項リスト>
+ <上長への要請事項リスト>
+ <上長への要請事項>
+ 特になし
+ </上長への要請事項>
+ </上長への要請事項リスト>
+ <問題点対策>
+ XMLとは何かわからない。
+ </問題点対策>
+ </業務報告>
+
+ <業務報告>
+ <業務名>検索エンジンの開発</業務名>
+ <業務コード>S8821-76</業務コード>
+ <工数管理>
+ <見積もり工数>120</見積もり工数>
+ <実績工数>6</実績工数>
+ <当月見積もり工数>32</当月見積もり工数>
+ <当月実績工数>2</当月実績工数>
+ </工数管理>
+ <予定項目リスト>
+ <予定項目>
+ <A href="http://www.goo.ne.jp">goo</A>の機能を調べてみる
+ </予定項目>
+ </予定項目リスト>
+ <実施事項リスト>
+ <実施事項>
+ 更に、どういう検索エンジンがあるか調査する
+ </実施事項>
+ </実施事項リスト>
+ <上長への要請事項リスト>
+ <上長への要請事項>
+ 開発をするのはめんどうなので、Yahoo!を買収して下さい。
+ </上長への要請事項>
+ </上長への要請事項リスト>
+ <問題点対策>
+ 検索エンジンで車を走らせることができない。（要調査）
+ </問題点対策>
+ </業務報告>
+ </業務報告リスト>
+</週報>

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/xgconsole.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/xpath_error.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/xpath_query.cpp Added

@@ -0,0 +1,36 @@
+#include "pugixml.hpp"
+
+#include <iostream>
+#include <string>
+
+int main()
+{
+ pugi::xml_document doc;
+ if (!doc.load_file("xgconsole.xml")) return -1;
+
+// tag::code[]
+ // Select nodes via compiled query
+ pugi::xpath_query query_remote_tools("/Profile/Tools/Tool[@AllowRemote='true']");
+
+ pugi::xpath_node_set tools = query_remote_tools.evaluate_node_set(doc);
+ std::cout << "Remote tool: ";
+ tools[2].node().print(std::cout);
+
+ // Evaluate numbers via compiled query
+ pugi::xpath_query query_timeouts("sum(//Tool/@Timeout)");
+ std::cout << query_timeouts.evaluate_number(doc) << std::endl;
+
+ // Evaluate strings via compiled query for different context nodes
+ pugi::xpath_query query_name_valid("string-length(substring-before(@Filename, '_')) > 0 and @OutputFileMasks");
+ pugi::xpath_query query_name("concat(substring-before(@Filename, '_'), ' produces ', @OutputFileMasks)");
+
+ for (pugi::xml_node tool = doc.first_element_by_path("Profile/Tools/Tool"); tool; tool = tool.next_sibling())
+ {
+ std::string s = query_name.evaluate_string(tool);
+
+ if (query_name_valid.evaluate_boolean(tool)) std::cout << s << std::endl;
+ }
+// end::code[]
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/xpath_select.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/docs/samples/xpath_variables.cpp Added

@@ -0,0 +1,38 @@
+#include "pugixml.hpp"
+
+#include <iostream>
+#include <string>
+
+int main()
+{
+ pugi::xml_document doc;
+ if (!doc.load_file("xgconsole.xml")) return -1;
+
+// tag::code[]
+ // Select nodes via compiled query
+ pugi::xpath_variable_set vars;
+ vars.add("remote", pugi::xpath_type_boolean);
+
+ pugi::xpath_query query_remote_tools("/Profile/Tools/Tool[@AllowRemote = string($remote)]", &vars);
+
+ vars.set("remote", true);
+ pugi::xpath_node_set tools_remote = query_remote_tools.evaluate_node_set(doc);
+
+ vars.set("remote", false);
+ pugi::xpath_node_set tools_local = query_remote_tools.evaluate_node_set(doc);
+
+ std::cout << "Remote tool: ";
+ tools_remote[2].node().print(std::cout);
+
+ std::cout << "Local tool: ";
+ tools_local[0].node().print(std::cout);
+
+ // You can pass the context directly to select_nodes/select_node
+ pugi::xpath_node_set tools_local_imm = doc.select_nodes("/Profile/Tools/Tool[@AllowRemote = string($remote)]", &vars);
+
+ std::cout << "Local tool imm: ";
+ tools_local_imm[0].node().print(std::cout);
+// end::code[]
+}
+
+// vim:et

lightspark.tar.xz/src/3rdparty/pugixml/readme.txt Added

@@ -0,0 +1,52 @@
+pugixml 1.6 - an XML processing library
+
+Copyright (C) 2006-2015, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)
+Report bugs and download new versions at http://pugixml.org/
+
+This is the distribution of pugixml, which is a C++ XML processing library,
+which consists of a DOM-like interface with rich traversal/modification
+capabilities, an extremely fast XML parser which constructs the DOM tree from
+an XML file/buffer, and an XPath 1.0 implementation for complex data-driven
+tree queries. Full Unicode support is also available, with Unicode interface
+variants and conversions between different Unicode encodings (which happen
+automatically during parsing/saving).
+
+The distribution contains the following folders:
+
+	contrib/ - various contributions to pugixml
+
+	docs/ - documentation
+		docs/samples - pugixml usage examples
+		docs/quickstart.html - quick start guide
+		docs/manual.html - complete manual
+
+	scripts/ - project files for IDE/build systems
+
+	src/ - header and source files
+
+	readme.txt - this file.
+
+This library is distributed under the MIT License:
+
+Copyright (c) 2006-2015 Arseny Kapoulkine
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.

lightspark.tar.xz/src/3rdparty/pugixml/scripts Added

lightspark.tar.xz/src/3rdparty/pugixml/scripts/CMakeLists.txt Added

@@ -0,0 +1,47 @@
+project(pugixml)
+
+cmake_minimum_required(VERSION 2.6)
+
+option(BUILD_SHARED_LIBS "Build shared instead of static library" OFF)
+option(BUILD_TESTS "Build tests" OFF)
+set(BUILD_DEFINES "" CACHE STRING "Build defines")
+
+# Pre-defines standard install locations on *nix systems.
+include(GNUInstallDirs)
+mark_as_advanced(CLEAR CMAKE_INSTALL_LIBDIR CMAKE_INSTALL_INCLUDEDIR)
+
+set(HEADERS ../src/pugixml.hpp ../src/pugiconfig.hpp)
+set(SOURCES ${HEADERS} ../src/pugixml.cpp)
+
+if(DEFINED BUILD_DEFINES)
+	foreach(DEFINE ${BUILD_DEFINES})
+		add_definitions("-D" ${DEFINE})
+	endforeach()
+endif()
+
+if(BUILD_SHARED_LIBS)
+	add_library(pugixml SHARED ${SOURCES})
+else()
+	add_library(pugixml STATIC ${SOURCES})
+endif()
+
+set_target_properties(pugixml PROPERTIES VERSION 1.6 SOVERSION 1)
+
+install(TARGETS pugixml EXPORT pugixml-config 
+	ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR}
+	LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}
+	RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR}
+)
+
+install(FILES ${HEADERS} DESTINATION ${CMAKE_INSTALL_INCLUDEDIR})
+install(EXPORT pugixml-config DESTINATION ${CMAKE_INSTALL_LIBDIR}/cmake/pugixml)
+
+if(BUILD_TESTS)
+	file(GLOB TEST_SOURCES ../tests/*.cpp)
+	file(GLOB FUZZ_SOURCES ../tests/fuzz_*.cpp)
+	list(REMOVE_ITEM TEST_SOURCES ${FUZZ_SOURCES})
+
+	add_executable(check ${TEST_SOURCES})
+	target_link_libraries(check pugixml)
+	add_custom_command(TARGET check POST_BUILD COMMAND check WORKING_DIRECTORY ${CMAKE_SOURCE_DIR}/..)
+endif()
\ No newline at end of file

lightspark.tar.xz/src/3rdparty/pugixml/scripts/premake4.lua Added

@@ -0,0 +1,92 @@
+-- Reset RNG seed to get consistent results across runs (i.e. XCode)
+math.randomseed(12345)
+
+local static = _ARGS[1] == 'static'
+local action = premake.action.current()
+
+if string.startswith(_ACTION, "vs") then
+	if action then
+		-- Disable solution generation
+		function action.onsolution(sln)
+			sln.vstudio_configs = premake.vstudio_buildconfigs(sln)
+		end
+
+		-- Rename output file
+		function action.onproject(prj)
+            local name = "%%_" .. _ACTION .. (static and "_static" or "")
+
+            if static then
+                for k, v in pairs(prj.project.__configs) do
+                    v.objectsdir = v.objectsdir .. "Static"
+                end
+            end
+
+            if _ACTION == "vs2010" then
+                premake.generate(prj, name .. ".vcxproj", premake.vs2010_vcxproj)
+            else
+                premake.generate(prj, name .. ".vcproj", premake.vs200x_vcproj)
+            end
+		end
+	end
+elseif _ACTION == "codeblocks" then
+	action.onsolution = nil
+
+	function action.onproject(prj)
+		premake.generate(prj, "%%_" .. _ACTION .. ".cbp", premake.codeblocks_cbp)
+	end
+elseif _ACTION == "codelite" then
+	action.onsolution = nil
+
+	function action.onproject(prj)
+		premake.generate(prj, "%%_" .. _ACTION .. ".project", premake.codelite_project)
+	end
+end
+
+solution "pugixml"
+	objdir(_ACTION)
+	targetdir(_ACTION)
+
+if string.startswith(_ACTION, "vs") then
+	if _ACTION ~= "vs2002" and _ACTION ~= "vs2003" then
+		platforms { "x32", "x64" }
+
+		configuration "x32" targetdir(_ACTION .. "/x32")
+		configuration "x64" targetdir(_ACTION .. "/x64")
+	end
+
+	configurations { "Debug", "Release" }
+
+    if static then
+        configuration "Debug" targetsuffix "sd"
+        configuration "Release" targetsuffix "s"
+    else
+        configuration "Debug" targetsuffix "d"
+    end
+else
+	if _ACTION == "xcode3" then
+		platforms "universal"
+	end
+
+	configurations { "Debug", "Release" }
+
+	configuration "Debug" targetsuffix "d"
+end
+
+project "pugixml"
+	kind "StaticLib"
+	language "C++"
+	files { "../src/pugixml.hpp", "../src/pugiconfig.hpp", "../src/pugixml.cpp" }
+	flags { "NoPCH", "NoMinimalRebuild", "NoEditAndContinue", "Symbols" }
+	uuid "89A1E353-E2DC-495C-B403-742BE206ACED"
+
+configuration "Debug"
+	defines { "_DEBUG" }
+
+configuration "Release"
+	defines { "NDEBUG" }
+	flags { "Optimize" }
+
+if static then
+    configuration "*"
+        flags { "StaticRuntime" }
+end

lightspark.tar.xz/src/3rdparty/pugixml/scripts/pugixml.xcodeproj Added

lightspark.tar.xz/src/3rdparty/pugixml/scripts/pugixml.xcodeproj/project.pbxproj Added

@@ -0,0 +1,212 @@
+// !$*UTF8*$!
+{
+	archiveVersion = 1;
+	classes = {
+	};
+	objectVersion = 45;
+	objects = {
+
+/* Begin PBXBuildFile section */
+		0424128F67AB5C730232235E /* pugixml.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 47481C4F0E03673E0E780637 /* pugixml.cpp */; };
+/* End PBXBuildFile section */
+
+/* Begin PBXFileReference section */
+		0B66463C5F896E6449051D38 /* pugiconfig.hpp */ = {isa = PBXFileReference; lastKnownFileType = text; name = "pugiconfig.hpp"; path = "pugiconfig.hpp"; sourceTree = "<group>"; };
+		47481C4F0E03673E0E780637 /* pugixml.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; name = "pugixml.cpp"; path = "pugixml.cpp"; sourceTree = "<group>"; };
+		6C911F0460FC44CD3B1B5624 /* pugixml.hpp */ = {isa = PBXFileReference; lastKnownFileType = text; name = "pugixml.hpp"; path = "pugixml.hpp"; sourceTree = "<group>"; };
+		1DA04ADC64C3566D16C45B6D /* libpugixmld.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; name = "libpugixmld.a"; path = "libpugixmld.a"; sourceTree = BUILT_PRODUCTS_DIR; };
+/* End PBXFileReference section */
+
+/* Begin PBXFrameworksBuildPhase section */
+		2BA00212518037166623673F /* Frameworks */ = {
+			isa = PBXFrameworksBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+/* End PBXFrameworksBuildPhase section */
+
+/* Begin PBXGroup section */
+		19E0517F3CF26ED63AE23641 /* pugixml */ = {
+			isa = PBXGroup;
+			children = (
+				578963B4309E714F05E01D71 /* src */,
+				219F66186DDF392149043810 /* Products */,
+			);
+			name = "pugixml";
+			sourceTree = "<group>";
+		};
+		578963B4309E714F05E01D71 /* src */ = {
+			isa = PBXGroup;
+			children = (
+				0B66463C5F896E6449051D38 /* pugiconfig.hpp */,
+				47481C4F0E03673E0E780637 /* pugixml.cpp */,
+				6C911F0460FC44CD3B1B5624 /* pugixml.hpp */,
+			);
+			name = "src";
+			path = ../src;
+			sourceTree = "<group>";
+		};
+		219F66186DDF392149043810 /* Products */ = {
+			isa = PBXGroup;
+			children = (
+				1DA04ADC64C3566D16C45B6D /* libpugixmld.a */,
+			);
+			name = "Products";
+			sourceTree = "<group>";
+		};
+/* End PBXGroup section */
+
+/* Begin PBXNativeTarget section */
+		6B55152571905B6C3A6F39D0 /* pugixml */ = {
+			isa = PBXNativeTarget;
+			buildConfigurationList = 73BF376C14AA1ECC0AC517ED /* Build configuration list for PBXNativeTarget "pugixml" */;
+			buildPhases = (
+				6CA66B9B6252229A36E8733C /* Resources */,
+				287808486FBF545206A47CC1 /* Sources */,
+				2BA00212518037166623673F /* Frameworks */,
+			);
+			buildRules = (
+			);
+			dependencies = (
+			);
+			name = "pugixml";
+			productName = "pugixml";
+			productReference = 1DA04ADC64C3566D16C45B6D /* libpugixmld.a */;
+			productType = "com.apple.product-type.library.static";
+		};
+/* End PBXNativeTarget section */
+
+/* Begin PBXProject section */
+		08FB7793FE84155DC02AAC07 /* Project object */ = {
+			isa = PBXProject;
+			buildConfigurationList = 1DEB928908733DD80010E9CD /* Build configuration list for PBXProject "pugixml" */;
+			compatibilityVersion = "Xcode 3.1";
+			hasScannedForEncodings = 1;
+			mainGroup = 19E0517F3CF26ED63AE23641 /* pugixml */;
+			projectDirPath = "";
+			projectRoot = "";
+			targets = (
+				6B55152571905B6C3A6F39D0 /* libpugixmld.a */,
+			);
+		};
+/* End PBXProject section */
+
+/* Begin PBXResourcesBuildPhase section */
+		6CA66B9B6252229A36E8733C /* Resources */ = {
+			isa = PBXResourcesBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+/* End PBXResourcesBuildPhase section */
+
+/* Begin PBXSourcesBuildPhase section */
+		287808486FBF545206A47CC1 /* Sources */ = {
+			isa = PBXSourcesBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				0424128F67AB5C730232235E /* pugixml.cpp in Sources */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+/* End PBXSourcesBuildPhase section */
+
+/* Begin PBXVariantGroup section */
+/* End PBXVariantGroup section */
+
+/* Begin XCBuildConfiguration section */
+		4FDB54E4253E36FC55CE27E8 /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				ALWAYS_SEARCH_USER_PATHS = NO;
+				CONFIGURATION_BUILD_DIR = xcode3;
+				GCC_DYNAMIC_NO_PIC = NO;
+				GCC_MODEL_TUNING = G5;
+				INSTALL_PATH = /usr/local/lib;
+				PRODUCT_NAME = "pugixmld";
+			};
+			name = "Debug";
+		};
+		0A4C28F553990E0405306C15 /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				ALWAYS_SEARCH_USER_PATHS = NO;
+				CONFIGURATION_BUILD_DIR = xcode3;
+				GCC_DYNAMIC_NO_PIC = NO;
+				GCC_MODEL_TUNING = G5;
+				INSTALL_PATH = /usr/local/lib;
+				PRODUCT_NAME = "pugixml";
+			};
+			name = "Release";
+		};
+		65DB0F6D27EA20852B6E3BB4 /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				ARCHS = "$(ARCHS_STANDARD_32_64_BIT)";
+				CONFIGURATION_BUILD_DIR = "$(SYMROOT)";
+				CONFIGURATION_TEMP_DIR = "$(OBJROOT)";
+				COPY_PHASE_STRIP = NO;
+				GCC_C_LANGUAGE_STANDARD = gnu99;
+				GCC_OPTIMIZATION_LEVEL = 0;
+				GCC_PREPROCESSOR_DEFINITIONS = (
+					"_DEBUG",
+				);
+				GCC_WARN_ABOUT_RETURN_TYPE = YES;
+				GCC_WARN_UNUSED_VARIABLE = YES;
+				OBJROOT = "xcode3/Universal/Debug";
+				ONLY_ACTIVE_ARCH = NO;
+				PREBINDING = NO;
+				SYMROOT = "xcode3";
+			};
+			name = "Debug";
+		};
+		5314084032B57C1A11945858 /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				ARCHS = "$(ARCHS_STANDARD_32_64_BIT)";
+				CONFIGURATION_BUILD_DIR = "$(SYMROOT)";
+				CONFIGURATION_TEMP_DIR = "$(OBJROOT)";
+				COPY_PHASE_STRIP = NO;
+				GCC_C_LANGUAGE_STANDARD = gnu99;
+				GCC_OPTIMIZATION_LEVEL = s;
+				GCC_PREPROCESSOR_DEFINITIONS = (
+					"NDEBUG",
+				);
+				GCC_WARN_ABOUT_RETURN_TYPE = YES;
+				GCC_WARN_UNUSED_VARIABLE = YES;
+				OBJROOT = "xcode3/Universal/Release";
+				ONLY_ACTIVE_ARCH = NO;
+				PREBINDING = NO;
+				SYMROOT = "xcode3";
+			};
+			name = "Release";
+		};
+/* End XCBuildConfiguration section */
+
+/* Begin XCConfigurationList section */
+		73BF376C14AA1ECC0AC517ED /* Build configuration list for PBXNativeTarget "libpugixmld.a" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				4FDB54E4253E36FC55CE27E8 /* Debug */,
+				0A4C28F553990E0405306C15 /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = "Debug";
+		};
+		1DEB928908733DD80010E9CD /* Build configuration list for PBXProject "pugixml" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				65DB0F6D27EA20852B6E3BB4 /* Debug */,
+				5314084032B57C1A11945858 /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = "Debug";
+		};
+/* End XCConfigurationList section */
+
+	};
+	rootObject = 08FB7793FE84155DC02AAC07 /* Project object */;
+}

lightspark.tar.xz/src/3rdparty/pugixml/scripts/pugixml_airplay.mkf Added

lightspark.tar.xz/src/3rdparty/pugixml/scripts/pugixml_codeblocks.cbp Added

@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
+<CodeBlocks_project_file>
+	<FileVersion major="1" minor="6" />
+	<Project>
+		<Option title="pugixml" />
+		<Option pch_mode="2" />
+		<Option compiler="gcc" />
+		<Build>
+			<Target title="Debug">
+				<Option output="codeblocks/libpugixmld.a" prefix_auto="0" extension_auto="0" />
+				<Option object_output="codeblocks/Debug" />
+				<Option type="2" />
+				<Option compiler="gcc" />
+				<Compiler>
+					<Add option="-g" />
+					<Add option="-D_DEBUG" />
+				</Compiler>
+				<Linker>
+				</Linker>
+			</Target>
+			<Target title="Release">
+				<Option output="codeblocks/libpugixml.a" prefix_auto="0" extension_auto="0" />
+				<Option object_output="codeblocks/Release" />
+				<Option type="2" />
+				<Option compiler="gcc" />
+				<Compiler>
+					<Add option="-g" />
+					<Add option="-O2" />
+					<Add option="-DNDEBUG" />
+				</Compiler>
+				<Linker>
+				</Linker>
+			</Target>
+		</Build>
+		<Unit filename="../src/pugixml.hpp">
+		</Unit>
+		<Unit filename="../src/pugiconfig.hpp">
+		</Unit>
+		<Unit filename="../src/pugixml.cpp">
+		</Unit>
+		<Extensions />
+	</Project>
+</CodeBlocks_project_file>
+

lightspark.tar.xz/src/3rdparty/pugixml/scripts/pugixml_codelite.project Added

@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="utf-8"?>
+<CodeLite_Project Name="pugixml">
+ <VirtualDirectory Name="src">
+ <File Name="../src/pugixml.hpp"/>
+ <File Name="../src/pugiconfig.hpp"/>
+ <File Name="../src/pugixml.cpp"/>
+ </VirtualDirectory>
+ <Settings Type="Static Library">
+ <Configuration Name="Debug" CompilerType="gnu g++" DebuggerType="GNU gdb debugger" Type="Static Library">
+ <General OutputFile="codelite/libpugixmld.a" IntermediateDirectory="codelite/Debug" Command="./libpugixmld.a" CommandArguments="" WorkingDirectory="codelite" PauseExecWhenProcTerminates="yes"/>
+ <Compiler Required="yes" Options="-g">
+ <Preprocessor Value="_DEBUG"/>
+ </Compiler>
+ <Linker Required="yes" Options="">
+ </Linker>
+ <ResourceCompiler Required="no" Options=""/>
+ <CustomBuild Enabled="no">
+ <CleanCommand></CleanCommand>
+ <BuildCommand></BuildCommand>
+ <SingleFileCommand></SingleFileCommand>
+ <MakefileGenerationCommand></MakefileGenerationCommand>
+ <ThirdPartyToolName>None</ThirdPartyToolName>
+ <WorkingDirectory></WorkingDirectory>
+ </CustomBuild>
+ <AdditionalRules>
+ <CustomPostBuild></CustomPostBuild>
+ <CustomPreBuild></CustomPreBuild>
+ </AdditionalRules>
+ </Configuration>
+ <Configuration Name="Release" CompilerType="gnu g++" DebuggerType="GNU gdb debugger" Type="Static Library">
+ <General OutputFile="codelite/libpugixml.a" IntermediateDirectory="codelite/Release" Command="./libpugixml.a" CommandArguments="" WorkingDirectory="codelite" PauseExecWhenProcTerminates="yes"/>
+ <Compiler Required="yes" Options="-g;-O2">
+ <Preprocessor Value="NDEBUG"/>
+ </Compiler>
+ <Linker Required="yes" Options="">
+ </Linker>
+ <ResourceCompiler Required="no" Options=""/>
+ <CustomBuild Enabled="no">
+ <CleanCommand></CleanCommand>
+ <BuildCommand></BuildCommand>
+ <SingleFileCommand></SingleFileCommand>
+ <MakefileGenerationCommand></MakefileGenerationCommand>
+ <ThirdPartyToolName>None</ThirdPartyToolName>
+ <WorkingDirectory></WorkingDirectory>
+ </CustomBuild>
+ <AdditionalRules>
+ <CustomPostBuild></CustomPostBuild>
+ <CustomPreBuild></CustomPreBuild>
+ </AdditionalRules>
+ </Configuration>
+ </Settings>
+ <Dependencies name="Debug">
+ </Dependencies>
+ <Dependencies name="Release">
+ </Dependencies>
+</CodeLite_Project>

lightspark.tar.xz/src/3rdparty/pugixml/scripts/pugixml_vs2005.vcproj Added

@@ -0,0 +1,343 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8.00"
+	Name="pugixml"
+	ProjectGUID="{89A1E353-E2DC-495C-B403-742BE206ACED}"
+	RootNamespace="pugixml"
+	Keyword="Win32Proj"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+		<Platform
+			Name="x64"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="vs2005\x32"
+			IntermediateDirectory="vs2005\x32\Debug"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				PreprocessorDefinitions="_DEBUG"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="3"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				ProgramDataBaseFileName="$(OutDir)\pugixmld.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixmld.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|x64"
+			OutputDirectory="vs2005\x64"
+			IntermediateDirectory="vs2005\x64\Debug"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				PreprocessorDefinitions="_DEBUG"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="3"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				ProgramDataBaseFileName="$(OutDir)\pugixmld.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixmld.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="vs2005\x32"
+			IntermediateDirectory="vs2005\x32\Release"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="3"
+				PreprocessorDefinitions="NDEBUG"
+				StringPooling="true"
+				RuntimeLibrary="2"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				ProgramDataBaseFileName="$(OutDir)\pugixml.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixml.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|x64"
+			OutputDirectory="vs2005\x64"
+			IntermediateDirectory="vs2005\x64\Release"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="3"
+				PreprocessorDefinitions="NDEBUG"
+				StringPooling="true"
+				RuntimeLibrary="2"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				ProgramDataBaseFileName="$(OutDir)\pugixml.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixml.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="src"
+			Filter=""
+			>
+			<File
+				RelativePath="..\src\pugixml.hpp"
+				>
+			</File>
+			<File
+				RelativePath="..\src\pugiconfig.hpp"
+				>
+			</File>
+			<File
+				RelativePath="..\src\pugixml.cpp"
+				>
+			</File>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>

lightspark.tar.xz/src/3rdparty/pugixml/scripts/pugixml_vs2005_static.vcproj Added

@@ -0,0 +1,343 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8.00"
+	Name="pugixml"
+	ProjectGUID="{89A1E353-E2DC-495C-B403-742BE206ACED}"
+	RootNamespace="pugixml"
+	Keyword="Win32Proj"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+		<Platform
+			Name="x64"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="vs2005\x32"
+			IntermediateDirectory="vs2005\x32\DebugStatic"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				PreprocessorDefinitions="_DEBUG"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="1"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				ProgramDataBaseFileName="$(OutDir)\pugixmlsd.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixmlsd.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|x64"
+			OutputDirectory="vs2005\x64"
+			IntermediateDirectory="vs2005\x64\DebugStatic"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				PreprocessorDefinitions="_DEBUG"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="1"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				ProgramDataBaseFileName="$(OutDir)\pugixmlsd.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixmlsd.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="vs2005\x32"
+			IntermediateDirectory="vs2005\x32\ReleaseStatic"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="3"
+				PreprocessorDefinitions="NDEBUG"
+				StringPooling="true"
+				RuntimeLibrary="0"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				ProgramDataBaseFileName="$(OutDir)\pugixmls.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixmls.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|x64"
+			OutputDirectory="vs2005\x64"
+			IntermediateDirectory="vs2005\x64\ReleaseStatic"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="3"
+				PreprocessorDefinitions="NDEBUG"
+				StringPooling="true"
+				RuntimeLibrary="0"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				ProgramDataBaseFileName="$(OutDir)\pugixmls.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixmls.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="src"
+			Filter=""
+			>
+			<File
+				RelativePath="..\src\pugixml.hpp"
+				>
+			</File>
+			<File
+				RelativePath="..\src\pugiconfig.hpp"
+				>
+			</File>
+			<File
+				RelativePath="..\src\pugixml.cpp"
+				>
+			</File>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>

lightspark.tar.xz/src/3rdparty/pugixml/scripts/pugixml_vs2008.vcproj Added

@@ -0,0 +1,339 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="9.00"
+	Name="pugixml"
+	ProjectGUID="{89A1E353-E2DC-495C-B403-742BE206ACED}"
+	RootNamespace="pugixml"
+	Keyword="Win32Proj"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+		<Platform
+			Name="x64"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="vs2008\x32"
+			IntermediateDirectory="vs2008\x32\Debug"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				PreprocessorDefinitions="_DEBUG"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="3"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				ProgramDataBaseFileName="$(OutDir)\pugixmld.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixmld.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|x64"
+			OutputDirectory="vs2008\x64"
+			IntermediateDirectory="vs2008\x64\Debug"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				PreprocessorDefinitions="_DEBUG"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="3"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				ProgramDataBaseFileName="$(OutDir)\pugixmld.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixmld.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="vs2008\x32"
+			IntermediateDirectory="vs2008\x32\Release"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="3"
+				PreprocessorDefinitions="NDEBUG"
+				StringPooling="true"
+				RuntimeLibrary="2"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				ProgramDataBaseFileName="$(OutDir)\pugixml.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixml.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|x64"
+			OutputDirectory="vs2008\x64"
+			IntermediateDirectory="vs2008\x64\Release"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="3"
+				PreprocessorDefinitions="NDEBUG"
+				StringPooling="true"
+				RuntimeLibrary="2"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				ProgramDataBaseFileName="$(OutDir)\pugixml.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixml.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="src"
+			Filter=""
+			>
+			<File
+				RelativePath="..\src\pugixml.hpp"
+				>
+			</File>
+			<File
+				RelativePath="..\src\pugiconfig.hpp"
+				>
+			</File>
+			<File
+				RelativePath="..\src\pugixml.cpp"
+				>
+			</File>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>

lightspark.tar.xz/src/3rdparty/pugixml/scripts/pugixml_vs2008_static.vcproj Added

@@ -0,0 +1,339 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="9.00"
+	Name="pugixml"
+	ProjectGUID="{89A1E353-E2DC-495C-B403-742BE206ACED}"
+	RootNamespace="pugixml"
+	Keyword="Win32Proj"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+		<Platform
+			Name="x64"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="vs2008\x32"
+			IntermediateDirectory="vs2008\x32\DebugStatic"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				PreprocessorDefinitions="_DEBUG"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="1"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				ProgramDataBaseFileName="$(OutDir)\pugixmlsd.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixmlsd.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|x64"
+			OutputDirectory="vs2008\x64"
+			IntermediateDirectory="vs2008\x64\DebugStatic"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				PreprocessorDefinitions="_DEBUG"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="1"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				ProgramDataBaseFileName="$(OutDir)\pugixmlsd.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixmlsd.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="vs2008\x32"
+			IntermediateDirectory="vs2008\x32\ReleaseStatic"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="3"
+				PreprocessorDefinitions="NDEBUG"
+				StringPooling="true"
+				RuntimeLibrary="0"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				ProgramDataBaseFileName="$(OutDir)\pugixmls.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixmls.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|x64"
+			OutputDirectory="vs2008\x64"
+			IntermediateDirectory="vs2008\x64\ReleaseStatic"
+			ConfigurationType="4"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="3"
+				PreprocessorDefinitions="NDEBUG"
+				StringPooling="true"
+				RuntimeLibrary="0"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				ProgramDataBaseFileName="$(OutDir)\pugixmls.pdb"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				OutputFile="$(OutDir)\pugixmls.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="src"
+			Filter=""
+			>
+			<File
+				RelativePath="..\src\pugixml.hpp"
+				>
+			</File>
+			<File
+				RelativePath="..\src\pugiconfig.hpp"
+				>
+			</File>
+			<File
+				RelativePath="..\src\pugixml.cpp"
+				>
+			</File>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>

lightspark.tar.xz/src/3rdparty/pugixml/scripts/pugixml_vs2010.vcxproj Added

@@ -0,0 +1,191 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project DefaultTargets="Build" ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+	<ItemGroup Label="ProjectConfigurations">
+		<ProjectConfiguration Include="Debug|Win32">
+			<Configuration>Debug</Configuration>
+			<Platform>Win32</Platform>
+		</ProjectConfiguration>
+		<ProjectConfiguration Include="Debug|x64">
+			<Configuration>Debug</Configuration>
+			<Platform>x64</Platform>
+		</ProjectConfiguration>
+		<ProjectConfiguration Include="Release|Win32">
+			<Configuration>Release</Configuration>
+			<Platform>Win32</Platform>
+		</ProjectConfiguration>
+		<ProjectConfiguration Include="Release|x64">
+			<Configuration>Release</Configuration>
+			<Platform>x64</Platform>
+		</ProjectConfiguration>
+	</ItemGroup>
+	<PropertyGroup Label="Globals">
+		<ProjectGuid>{89A1E353-E2DC-495C-B403-742BE206ACED}</ProjectGuid>
+		<RootNamespace>pugixml</RootNamespace>
+		<Keyword>Win32Proj</Keyword>
+	</PropertyGroup>
+	<Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
+	<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
+		<ConfigurationType>StaticLibrary</ConfigurationType>
+		<CharacterSet>MultiByte</CharacterSet>
+		<UseDebugLibraries>true</UseDebugLibraries>
+	</PropertyGroup>
+	<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
+		<ConfigurationType>StaticLibrary</ConfigurationType>
+		<CharacterSet>MultiByte</CharacterSet>
+		<UseDebugLibraries>true</UseDebugLibraries>
+	</PropertyGroup>
+	<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
+		<ConfigurationType>StaticLibrary</ConfigurationType>
+		<CharacterSet>MultiByte</CharacterSet>
+		<WholeProgramOptimization>true</WholeProgramOptimization>
+		<UseDebugLibraries>false</UseDebugLibraries>
+	</PropertyGroup>
+	<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
+		<ConfigurationType>StaticLibrary</ConfigurationType>
+		<CharacterSet>MultiByte</CharacterSet>
+		<WholeProgramOptimization>true</WholeProgramOptimization>
+		<UseDebugLibraries>false</UseDebugLibraries>
+	</PropertyGroup>
+	<Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
+	<ImportGroup Label="ExtensionSettings">
+	</ImportGroup>
+	<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="PropertySheets">
+		<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+	</ImportGroup>
+	<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="PropertySheets">
+		<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+	</ImportGroup>
+	<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="PropertySheets">
+		<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+	</ImportGroup>
+	<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="PropertySheets">
+		<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+	</ImportGroup>
+	<PropertyGroup Label="UserMacros" />
+	<PropertyGroup>
+		<_ProjectFileVersion>10.0.30319.1</_ProjectFileVersion>
+		<OutDir Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">vs2010\x32\</OutDir>
+		<IntDir Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">vs2010\x32\Debug\</IntDir>
+		<TargetName Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">pugixmld</TargetName>
+		<OutDir Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">vs2010\x64\</OutDir>
+		<IntDir Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">vs2010\x64\Debug\</IntDir>
+		<TargetName Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">pugixmld</TargetName>
+		<OutDir Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">vs2010\x32\</OutDir>
+		<IntDir Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">vs2010\x32\Release\</IntDir>
+		<TargetName Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">pugixml</TargetName>
+		<OutDir Condition="'$(Configuration)|$(Platform)'=='Release|x64'">vs2010\x64\</OutDir>
+		<IntDir Condition="'$(Configuration)|$(Platform)'=='Release|x64'">vs2010\x64\Release\</IntDir>
+		<TargetName Condition="'$(Configuration)|$(Platform)'=='Release|x64'">pugixml</TargetName>
+	</PropertyGroup>
+	<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+		<ClCompile>
+			<Optimization>Disabled</Optimization>
+			<PreprocessorDefinitions>_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+			<MinimalRebuild>false</MinimalRebuild>
+			<BasicRuntimeChecks>EnableFastChecks</BasicRuntimeChecks>
+			<RuntimeLibrary>MultiThreadedDebugDLL</RuntimeLibrary>
+			<FunctionLevelLinking>true</FunctionLevelLinking>
+			<PrecompiledHeader></PrecompiledHeader>
+			<WarningLevel>Level3</WarningLevel>
+			<DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
+		</ClCompile>
+		<ResourceCompile>
+			<PreprocessorDefinitions>_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+		</ResourceCompile>
+	<Lib>
+		<OutputFile>$(OutDir)pugixmld.lib</OutputFile>
+	</Lib>
+		<Link>
+			<SubSystem>Windows</SubSystem>
+			<GenerateDebugInformation>true</GenerateDebugInformation>
+			<ProgramDataBaseFileName>$(OutDir)pugixmld.pdb</ProgramDataBaseFileName>
+		</Link>
+	</ItemDefinitionGroup>
+	<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+		<ClCompile>
+			<Optimization>Disabled</Optimization>
+			<PreprocessorDefinitions>_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+			<MinimalRebuild>false</MinimalRebuild>
+			<BasicRuntimeChecks>EnableFastChecks</BasicRuntimeChecks>
+			<RuntimeLibrary>MultiThreadedDebugDLL</RuntimeLibrary>
+			<FunctionLevelLinking>true</FunctionLevelLinking>
+			<PrecompiledHeader></PrecompiledHeader>
+			<WarningLevel>Level3</WarningLevel>
+			<DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
+		</ClCompile>
+		<ResourceCompile>
+			<PreprocessorDefinitions>_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+		</ResourceCompile>
+	<Lib>
+		<OutputFile>$(OutDir)pugixmld.lib</OutputFile>
+	</Lib>
+		<Link>
+			<SubSystem>Windows</SubSystem>
+			<GenerateDebugInformation>true</GenerateDebugInformation>
+			<ProgramDataBaseFileName>$(OutDir)pugixmld.pdb</ProgramDataBaseFileName>
+		</Link>
+	</ItemDefinitionGroup>
+	<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+		<ClCompile>
+			<Optimization>Full</Optimization>
+			<PreprocessorDefinitions>NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+			<MinimalRebuild>false</MinimalRebuild>
+			<StringPooling>true</StringPooling>
+			<RuntimeLibrary>MultiThreadedDLL</RuntimeLibrary>
+			<FunctionLevelLinking>true</FunctionLevelLinking>
+			<PrecompiledHeader></PrecompiledHeader>
+			<WarningLevel>Level3</WarningLevel>
+			<DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
+		</ClCompile>
+		<ResourceCompile>
+			<PreprocessorDefinitions>NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+		</ResourceCompile>
+	<Lib>
+		<OutputFile>$(OutDir)pugixml.lib</OutputFile>
+	</Lib>
+		<Link>
+			<SubSystem>Windows</SubSystem>
+			<GenerateDebugInformation>true</GenerateDebugInformation>
+			<OptimizeReferences>true</OptimizeReferences>
+			<EnableCOMDATFolding>true</EnableCOMDATFolding>
+			<ProgramDataBaseFileName>$(OutDir)pugixml.pdb</ProgramDataBaseFileName>
+		</Link>
+	</ItemDefinitionGroup>
+	<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+		<ClCompile>
+			<Optimization>Full</Optimization>
+			<PreprocessorDefinitions>NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+			<MinimalRebuild>false</MinimalRebuild>
+			<StringPooling>true</StringPooling>
+			<RuntimeLibrary>MultiThreadedDLL</RuntimeLibrary>
+			<FunctionLevelLinking>true</FunctionLevelLinking>
+			<PrecompiledHeader></PrecompiledHeader>
+			<WarningLevel>Level3</WarningLevel>
+			<DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
+		</ClCompile>
+		<ResourceCompile>
+			<PreprocessorDefinitions>NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+		</ResourceCompile>
+	<Lib>
+		<OutputFile>$(OutDir)pugixml.lib</OutputFile>
+	</Lib>
+		<Link>
+			<SubSystem>Windows</SubSystem>
+			<GenerateDebugInformation>true</GenerateDebugInformation>
+			<OptimizeReferences>true</OptimizeReferences>
+			<EnableCOMDATFolding>true</EnableCOMDATFolding>
+			<ProgramDataBaseFileName>$(OutDir)pugixml.pdb</ProgramDataBaseFileName>
+		</Link>
+	</ItemDefinitionGroup>
+	<ItemGroup>
+		<ClInclude Include="..\src\pugixml.hpp" />
+		<ClInclude Include="..\src\pugiconfig.hpp" />
+	</ItemGroup>
+	<ItemGroup>
+		<ClCompile Include="..\src\pugixml.cpp">
+		</ClCompile>
+	</ItemGroup>
+	<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
+	<ImportGroup Label="ExtensionTargets">
+	</ImportGroup>
+</Project>

lightspark.tar.xz/src/3rdparty/pugixml/scripts/pugixml_vs2010_static.vcxproj Added

@@ -0,0 +1,191 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project DefaultTargets="Build" ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+	<ItemGroup Label="ProjectConfigurations">
+		<ProjectConfiguration Include="Debug|Win32">
+			<Configuration>Debug</Configuration>
+			<Platform>Win32</Platform>
+		</ProjectConfiguration>
+		<ProjectConfiguration Include="Debug|x64">
+			<Configuration>Debug</Configuration>
+			<Platform>x64</Platform>
+		</ProjectConfiguration>
+		<ProjectConfiguration Include="Release|Win32">
+			<Configuration>Release</Configuration>
+			<Platform>Win32</Platform>
+		</ProjectConfiguration>
+		<ProjectConfiguration Include="Release|x64">
+			<Configuration>Release</Configuration>
+			<Platform>x64</Platform>
+		</ProjectConfiguration>
+	</ItemGroup>
+	<PropertyGroup Label="Globals">
+		<ProjectGuid>{89A1E353-E2DC-495C-B403-742BE206ACED}</ProjectGuid>
+		<RootNamespace>pugixml</RootNamespace>
+		<Keyword>Win32Proj</Keyword>
+	</PropertyGroup>
+	<Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
+	<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
+		<ConfigurationType>StaticLibrary</ConfigurationType>
+		<CharacterSet>MultiByte</CharacterSet>
+		<UseDebugLibraries>true</UseDebugLibraries>
+	</PropertyGroup>
+	<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
+		<ConfigurationType>StaticLibrary</ConfigurationType>
+		<CharacterSet>MultiByte</CharacterSet>
+		<UseDebugLibraries>true</UseDebugLibraries>
+	</PropertyGroup>
+	<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
+		<ConfigurationType>StaticLibrary</ConfigurationType>
+		<CharacterSet>MultiByte</CharacterSet>
+		<WholeProgramOptimization>true</WholeProgramOptimization>
+		<UseDebugLibraries>false</UseDebugLibraries>
+	</PropertyGroup>
+	<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
+		<ConfigurationType>StaticLibrary</ConfigurationType>
+		<CharacterSet>MultiByte</CharacterSet>
+		<WholeProgramOptimization>true</WholeProgramOptimization>
+		<UseDebugLibraries>false</UseDebugLibraries>
+	</PropertyGroup>
+	<Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
+	<ImportGroup Label="ExtensionSettings">
+	</ImportGroup>
+	<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="PropertySheets">
+		<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+	</ImportGroup>
+	<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="PropertySheets">
+		<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+	</ImportGroup>
+	<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="PropertySheets">
+		<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+	</ImportGroup>
+	<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="PropertySheets">
+		<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+	</ImportGroup>
+	<PropertyGroup Label="UserMacros" />
+	<PropertyGroup>
+		<_ProjectFileVersion>10.0.30319.1</_ProjectFileVersion>
+		<OutDir Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">vs2010\x32\</OutDir>
+		<IntDir Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">vs2010\x32\DebugStatic\</IntDir>
+		<TargetName Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">pugixmlsd</TargetName>
+		<OutDir Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">vs2010\x64\</OutDir>
+		<IntDir Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">vs2010\x64\DebugStatic\</IntDir>
+		<TargetName Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">pugixmlsd</TargetName>
+		<OutDir Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">vs2010\x32\</OutDir>
+		<IntDir Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">vs2010\x32\ReleaseStatic\</IntDir>
+		<TargetName Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">pugixmls</TargetName>
+		<OutDir Condition="'$(Configuration)|$(Platform)'=='Release|x64'">vs2010\x64\</OutDir>
+		<IntDir Condition="'$(Configuration)|$(Platform)'=='Release|x64'">vs2010\x64\ReleaseStatic\</IntDir>
+		<TargetName Condition="'$(Configuration)|$(Platform)'=='Release|x64'">pugixmls</TargetName>
+	</PropertyGroup>
+	<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+		<ClCompile>
+			<Optimization>Disabled</Optimization>
+			<PreprocessorDefinitions>_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+			<MinimalRebuild>false</MinimalRebuild>
+			<BasicRuntimeChecks>EnableFastChecks</BasicRuntimeChecks>
+			<RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
+			<FunctionLevelLinking>true</FunctionLevelLinking>
+			<PrecompiledHeader></PrecompiledHeader>
+			<WarningLevel>Level3</WarningLevel>
+			<DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
+		</ClCompile>
+		<ResourceCompile>
+			<PreprocessorDefinitions>_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+		</ResourceCompile>
+	<Lib>
+		<OutputFile>$(OutDir)pugixmlsd.lib</OutputFile>
+	</Lib>
+		<Link>
+			<SubSystem>Windows</SubSystem>
+			<GenerateDebugInformation>true</GenerateDebugInformation>
+			<ProgramDataBaseFileName>$(OutDir)pugixmlsd.pdb</ProgramDataBaseFileName>
+		</Link>
+	</ItemDefinitionGroup>
+	<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+		<ClCompile>
+			<Optimization>Disabled</Optimization>
+			<PreprocessorDefinitions>_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+			<MinimalRebuild>false</MinimalRebuild>
+			<BasicRuntimeChecks>EnableFastChecks</BasicRuntimeChecks>
+			<RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
+			<FunctionLevelLinking>true</FunctionLevelLinking>
+			<PrecompiledHeader></PrecompiledHeader>
+			<WarningLevel>Level3</WarningLevel>
+			<DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
+		</ClCompile>
+		<ResourceCompile>
+			<PreprocessorDefinitions>_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+		</ResourceCompile>
+	<Lib>
+		<OutputFile>$(OutDir)pugixmlsd.lib</OutputFile>
+	</Lib>
+		<Link>
+			<SubSystem>Windows</SubSystem>
+			<GenerateDebugInformation>true</GenerateDebugInformation>
+			<ProgramDataBaseFileName>$(OutDir)pugixmlsd.pdb</ProgramDataBaseFileName>
+		</Link>
+	</ItemDefinitionGroup>
+	<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+		<ClCompile>
+			<Optimization>Full</Optimization>
+			<PreprocessorDefinitions>NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+			<MinimalRebuild>false</MinimalRebuild>
+			<StringPooling>true</StringPooling>
+			<RuntimeLibrary>MultiThreaded</RuntimeLibrary>
+			<FunctionLevelLinking>true</FunctionLevelLinking>
+			<PrecompiledHeader></PrecompiledHeader>
+			<WarningLevel>Level3</WarningLevel>
+			<DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
+		</ClCompile>
+		<ResourceCompile>
+			<PreprocessorDefinitions>NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+		</ResourceCompile>
+	<Lib>
+		<OutputFile>$(OutDir)pugixmls.lib</OutputFile>
+	</Lib>
+		<Link>
+			<SubSystem>Windows</SubSystem>
+			<GenerateDebugInformation>true</GenerateDebugInformation>
+			<OptimizeReferences>true</OptimizeReferences>
+			<EnableCOMDATFolding>true</EnableCOMDATFolding>
+			<ProgramDataBaseFileName>$(OutDir)pugixmls.pdb</ProgramDataBaseFileName>
+		</Link>
+	</ItemDefinitionGroup>
+	<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+		<ClCompile>
+			<Optimization>Full</Optimization>
+			<PreprocessorDefinitions>NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+			<MinimalRebuild>false</MinimalRebuild>
+			<StringPooling>true</StringPooling>
+			<RuntimeLibrary>MultiThreaded</RuntimeLibrary>
+			<FunctionLevelLinking>true</FunctionLevelLinking>
+			<PrecompiledHeader></PrecompiledHeader>
+			<WarningLevel>Level3</WarningLevel>
+			<DebugInformationFormat>ProgramDatabase</DebugInformationFormat>
+		</ClCompile>
+		<ResourceCompile>
+			<PreprocessorDefinitions>NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+		</ResourceCompile>
+	<Lib>
+		<OutputFile>$(OutDir)pugixmls.lib</OutputFile>
+	</Lib>
+		<Link>
+			<SubSystem>Windows</SubSystem>
+			<GenerateDebugInformation>true</GenerateDebugInformation>
+			<OptimizeReferences>true</OptimizeReferences>
+			<EnableCOMDATFolding>true</EnableCOMDATFolding>
+			<ProgramDataBaseFileName>$(OutDir)pugixmls.pdb</ProgramDataBaseFileName>
+		</Link>
+	</ItemDefinitionGroup>
+	<ItemGroup>
+		<ClInclude Include="..\src\pugixml.hpp" />
+		<ClInclude Include="..\src\pugiconfig.hpp" />
+	</ItemGroup>
+	<ItemGroup>
+		<ClCompile Include="..\src\pugixml.cpp">
+		</ClCompile>
+	</ItemGroup>
+	<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
+	<ImportGroup Label="ExtensionTargets">
+	</ImportGroup>
+</Project>

lightspark.tar.xz/src/3rdparty/pugixml/src Added

lightspark.tar.xz/src/3rdparty/pugixml/src/pugiconfig.hpp Added

@@ -0,0 +1,73 @@
+/**
+ * pugixml parser - version 1.6
+ * --------------------------------------------------------
+ * Copyright (C) 2006-2015, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)
+ * Report bugs and download new versions at http://pugixml.org/
+ *
+ * This library is distributed under the MIT License. See notice at the end
+ * of this file.
+ *
+ * This work is based on the pugxml parser, which is:
+ * Copyright (C) 2003, by Kristen Wegner (kristen@tima.net)
+ */
+
+#ifndef HEADER_PUGICONFIG_HPP
+#define HEADER_PUGICONFIG_HPP
+
+// Uncomment this to enable wchar_t mode
+// #define PUGIXML_WCHAR_MODE
+
+// Uncomment this to disable XPath
+#define PUGIXML_NO_XPATH
+
+// Uncomment this to disable STL
+// #define PUGIXML_NO_STL
+
+// Uncomment this to disable exceptions
+// #define PUGIXML_NO_EXCEPTIONS
+
+// Set this to control attributes for public classes/functions, i.e.:
+// #define PUGIXML_API __declspec(dllexport) // to export all public symbols from DLL
+// #define PUGIXML_CLASS __declspec(dllimport) // to import all classes from DLL
+// #define PUGIXML_FUNCTION __fastcall // to set calling conventions to all public functions to fastcall
+// In absence of PUGIXML_CLASS/PUGIXML_FUNCTION definitions PUGIXML_API is used instead
+
+// Tune these constants to adjust memory-related behavior
+// #define PUGIXML_MEMORY_PAGE_SIZE 32768
+// #define PUGIXML_MEMORY_OUTPUT_STACK 10240
+// #define PUGIXML_MEMORY_XPATH_PAGE_SIZE 4096
+
+// Uncomment this to switch to header-only version
+// #define PUGIXML_HEADER_ONLY
+
+// Uncomment this to enable long long support
+// #define PUGIXML_HAS_LONG_LONG
+
+// this enables parser quirks required for lightspark
+#define PUGIXML_LIGHTSPARK_MODE
+#endif
+
+/**
+ * Copyright (c) 2006-2015 Arseny Kapoulkine
+ *
+ * Permission is hereby granted, free of charge, to any person
+ * obtaining a copy of this software and associated documentation
+ * files (the "Software"), to deal in the Software without
+ * restriction, including without limitation the rights to use,
+ * copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following
+ * conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ * 
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+ * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+ * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+ * OTHER DEALINGS IN THE SOFTWARE.
+ */

lightspark.tar.xz/src/3rdparty/pugixml/src/pugixml.cpp Added

@@ -0,0 +1,12503 @@
+/**
+ * pugixml parser - version 1.6
+ * --------------------------------------------------------
+ * Copyright (C) 2006-2015, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)
+ * Report bugs and download new versions at http://pugixml.org/
+ *
+ * This library is distributed under the MIT License. See notice at the end
+ * of this file.
+ *
+ * This work is based on the pugxml parser, which is:
+ * Copyright (C) 2003, by Kristen Wegner (kristen@tima.net)
+ */
+
+#ifndef SOURCE_PUGIXML_CPP
+#define SOURCE_PUGIXML_CPP
+
+#include "pugixml.hpp"
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <assert.h>
+
+#ifdef PUGIXML_WCHAR_MODE
+#	include <wchar.h>
+#endif
+
+#ifndef PUGIXML_NO_XPATH
+#	include <math.h>
+#	include <float.h>
+#	ifdef PUGIXML_NO_EXCEPTIONS
+#		include <setjmp.h>
+#	endif
+#endif
+
+#ifndef PUGIXML_NO_STL
+#	include <istream>
+#	include <ostream>
+#	include <string>
+#endif
+
+// For placement new
+#include <new>
+
+#ifdef _MSC_VER
+#	pragma warning(push)
+#	pragma warning(disable: 4127) // conditional expression is constant
+#	pragma warning(disable: 4324) // structure was padded due to __declspec(align())
+#	pragma warning(disable: 4611) // interaction between '_setjmp' and C++ object destruction is non-portable
+#	pragma warning(disable: 4702) // unreachable code
+#	pragma warning(disable: 4996) // this function or variable may be unsafe
+#	pragma warning(disable: 4793) // function compiled as native: presence of '_setjmp' makes a function unmanaged
+#endif
+
+#ifdef __INTEL_COMPILER
+#	pragma warning(disable: 177) // function was declared but never referenced 
+#	pragma warning(disable: 279) // controlling expression is constant
+#	pragma warning(disable: 1478 1786) // function was declared "deprecated"
+#	pragma warning(disable: 1684) // conversion from pointer to same-sized integral type
+#endif
+
+#if defined(__BORLANDC__) && defined(PUGIXML_HEADER_ONLY)
+#	pragma warn -8080 // symbol is declared but never used; disabling this inside push/pop bracket does not make the warning go away
+#endif
+
+#ifdef __BORLANDC__
+#	pragma option push
+#	pragma warn -8008 // condition is always false
+#	pragma warn -8066 // unreachable code
+#endif
+
+#ifdef __SNC__
+// Using diag_push/diag_pop does not disable the warnings inside templates due to a compiler bug
+#	pragma diag_suppress=178 // function was declared but never referenced
+#	pragma diag_suppress=237 // controlling expression is constant
+#endif
+
+// Inlining controls
+#if defined(_MSC_VER) && _MSC_VER >= 1300
+#	define PUGI__NO_INLINE __declspec(noinline)
+#elif defined(__GNUC__)
+#	define PUGI__NO_INLINE __attribute__((noinline))
+#else
+#	define PUGI__NO_INLINE 
+#endif
+
+// Branch weight controls
+#if defined(__GNUC__)
+#	define PUGI__UNLIKELY(cond) __builtin_expect(cond, 0)
+#else
+#	define PUGI__UNLIKELY(cond) (cond)
+#endif
+
+// Simple static assertion
+#define PUGI__STATIC_ASSERT(cond) { static const char condition_failed[(cond) ? 1 : -1] = {0}; (void)condition_failed[0]; }
+
+// Digital Mars C++ bug workaround for passing char loaded from memory via stack
+#ifdef __DMC__
+#	define PUGI__DMC_VOLATILE volatile
+#else
+#	define PUGI__DMC_VOLATILE
+#endif
+
+// Borland C++ bug workaround for not defining ::memcpy depending on header include order (can't always use std::memcpy because some compilers don't have it at all)
+#if defined(__BORLANDC__) && !defined(__MEM_H_USING_LIST)
+using std::memcpy;
+using std::memmove;
+#endif
+
+// In some environments MSVC is a compiler but the CRT lacks certain MSVC-specific features
+#if defined(_MSC_VER) && !defined(__S3E__)
+#	define PUGI__MSVC_CRT_VERSION _MSC_VER
+#endif
+
+#ifdef PUGIXML_HEADER_ONLY
+#	define PUGI__NS_BEGIN namespace pugi { namespace impl {
+#	define PUGI__NS_END } }
+#	define PUGI__FN inline
+#	define PUGI__FN_NO_INLINE inline
+#else
+#	if defined(_MSC_VER) && _MSC_VER < 1300 // MSVC6 seems to have an amusing bug with anonymous namespaces inside namespaces
+#		define PUGI__NS_BEGIN namespace pugi { namespace impl {
+#		define PUGI__NS_END } }
+#	else
+#		define PUGI__NS_BEGIN namespace pugi { namespace impl { namespace {
+#		define PUGI__NS_END } } }
+#	endif
+#	define PUGI__FN
+#	define PUGI__FN_NO_INLINE PUGI__NO_INLINE
+#endif
+
+// uintptr_t
+#if !defined(_MSC_VER) || _MSC_VER >= 1600
+#	include <stdint.h>
+#else
+namespace pugi
+{
+#	ifndef _UINTPTR_T_DEFINED
+	typedef size_t uintptr_t;
+#	endif
+
+	typedef unsigned __int8 uint8_t;
+	typedef unsigned __int16 uint16_t;
+	typedef unsigned __int32 uint32_t;
+}
+#endif
+
+// Memory allocation
+PUGI__NS_BEGIN
+	PUGI__FN void* default_allocate(size_t size)
+	{
+		return malloc(size);
+	}
+
+	PUGI__FN void default_deallocate(void* ptr)
+	{
+		free(ptr);
+	}
+
+	template <typename T>
+	struct xml_memory_management_function_storage
+	{
+		static allocation_function allocate;
+		static deallocation_function deallocate;
+	};
+
+	// Global allocation functions are stored in class statics so that in header mode linker deduplicates them
+	// Without a template<> we'll get multiple definitions of the same static
+	template <typename T> allocation_function xml_memory_management_function_storage<T>::allocate = default_allocate;
+	template <typename T> deallocation_function xml_memory_management_function_storage<T>::deallocate = default_deallocate;
+
+	typedef xml_memory_management_function_storage<int> xml_memory;
+PUGI__NS_END
+
+// String utilities
+PUGI__NS_BEGIN
+	// Get string length
+	PUGI__FN size_t strlength(const char_t* s)
+	{
+		assert(s);
+
+	#ifdef PUGIXML_WCHAR_MODE
+		return wcslen(s);
+	#else
+		return strlen(s);
+	#endif
+	}
+
+	// Compare two strings
+	PUGI__FN bool strequal(const char_t* src, const char_t* dst)
+	{
+		assert(src && dst);
+
+	#ifdef PUGIXML_WCHAR_MODE
+		return wcscmp(src, dst) == 0;
+	#else
+		return strcmp(src, dst) == 0;
+	#endif
+	}
+
+	// Compare lhs with [rhs_begin, rhs_end)
+	PUGI__FN bool strequalrange(const char_t* lhs, const char_t* rhs, size_t count)
+	{
+		for (size_t i = 0; i < count; ++i)
+			if (lhs[i] != rhs[i])
+				return false;
+	
+		return lhs[count] == 0;
+	}
+
+	// Get length of wide string, even if CRT lacks wide character support
+	PUGI__FN size_t strlength_wide(const wchar_t* s)
+	{
+		assert(s);
+
+	#ifdef PUGIXML_WCHAR_MODE
+		return wcslen(s);
+	#else
+		const wchar_t* end = s;
+		while (*end) end++;
+		return static_cast<size_t>(end - s);
+	#endif
+	}
+
+#ifdef PUGIXML_WCHAR_MODE
+	// Convert string to wide string, assuming all symbols are ASCII
+	PUGI__FN void widen_ascii(wchar_t* dest, const char* source)
+	{
+		for (const char* i = source; *i; ++i) *dest++ = *i;
+		*dest = 0;
+	}
+#endif
+PUGI__NS_END
+
+// auto_ptr-like object for exception recovery
+PUGI__NS_BEGIN
+	template <typename T, typename D = void(*)(T*)> struct auto_deleter
+	{
+		T* data;
+		D deleter;
+
+		auto_deleter(T* data_, D deleter_): data(data_), deleter(deleter_)
+		{
+		}
+
+		~auto_deleter()
+		{
+			if (data) deleter(data);
+		}
+
+		T* release()
+		{
+			T* result = data;
+			data = 0;
+			return result;
+		}
+	};
+PUGI__NS_END
+
+#ifdef PUGIXML_COMPACT
+PUGI__NS_BEGIN
+	class compact_hash_table
+	{
+	public:
+		compact_hash_table(): _items(0), _capacity(0), _count(0)
+		{
+		}
+
+		void clear()
+		{
+			if (_items)
+			{
+				xml_memory::deallocate(_items);
+				_items = 0;
+				_capacity = 0;
+				_count = 0;
+			}
+		}
+
+		void** find(const void* key)
+		{
+			assert(key);
+
+			if (_capacity == 0) return 0;
+
+			size_t hashmod = _capacity - 1;
+			size_t bucket = hash(key) & hashmod;
+
+			for (size_t probe = 0; probe <= hashmod; ++probe)
+			{
+				item_t& probe_item = _items[bucket];
+
+				if (probe_item.key == key)
+					return &probe_item.value;
+
+				if (probe_item.key == 0)
+					return 0;
+
+				// hash collision, quadratic probing
+				bucket = (bucket + probe + 1) & hashmod;
+			}
+
+			assert(!"Hash table is full");
+			return 0;
+		}
+
+		void** insert(const void* key)
+		{
+			assert(key);
+			assert(_count < _capacity * 3 / 4);
+
+			size_t hashmod = _capacity - 1;
+			size_t bucket = hash(key) & hashmod;
+
+			for (size_t probe = 0; probe <= hashmod; ++probe)
+			{
+				item_t& probe_item = _items[bucket];
+
+				if (probe_item.key == 0)
+				{
+					probe_item.key = key;
+					_count++;
+					return &probe_item.value;
+				}
+
+				if (probe_item.key == key)
+					return &probe_item.value;
+
+				// hash collision, quadratic probing
+				bucket = (bucket + probe + 1) & hashmod;
+			}
+
+			assert(!"Hash table is full");
+			return 0;
+		}
+
+		bool reserve()
+		{
+			if (_count + 16 >= _capacity - _capacity / 4)
+				return rehash();
+
+			return true;
+		}
+
+	private:
+		struct item_t
+		{
+			const void* key;
+			void* value;
+		};
+
+		item_t* _items;
+		size_t _capacity;
+
+		size_t _count;
+
+		bool rehash();
+
+		static unsigned int hash(const void* key)
+		{
+			unsigned int h = static_cast<unsigned int>(reinterpret_cast<uintptr_t>(key));
+
+			// MurmurHash3 32-bit finalizer
+			h ^= h >> 16;
+			h *= 0x85ebca6bu;
+			h ^= h >> 13;
+			h *= 0xc2b2ae35u;
+			h ^= h >> 16;
+
+			return h;
+		}
+	};
+
+	PUGI__FN_NO_INLINE bool compact_hash_table::rehash()
+	{
+		compact_hash_table rt;
+		rt._capacity = (_capacity == 0) ? 32 : _capacity * 2;
+		rt._items = static_cast<item_t*>(xml_memory::allocate(sizeof(item_t) * rt._capacity));
+
+		if (!rt._items)
+			return false;
+
+		memset(rt._items, 0, sizeof(item_t) * rt._capacity);
+
+		for (size_t i = 0; i < _capacity; ++i)
+			if (_items[i].key)
+				*rt.insert(_items[i].key) = _items[i].value;
+
+		if (_items)
+			xml_memory::deallocate(_items);
+
+		_capacity = rt._capacity;
+		_items = rt._items;
+
+		return true;
+	}
+
+PUGI__NS_END
+#endif
+
+PUGI__NS_BEGIN
+	static const size_t xml_memory_page_size =
+	#ifdef PUGIXML_MEMORY_PAGE_SIZE
+		PUGIXML_MEMORY_PAGE_SIZE
+	#else
+		32768
+	#endif
+		;
+
+#ifdef PUGIXML_COMPACT
+	static const uintptr_t xml_memory_block_alignment = 4;
+
+	static const uintptr_t xml_memory_page_alignment = sizeof(void*);
+#else
+	static const uintptr_t xml_memory_block_alignment = sizeof(void*);
+
+	static const uintptr_t xml_memory_page_alignment = 64;
+	static const uintptr_t xml_memory_page_pointer_mask = ~(xml_memory_page_alignment - 1);
+#endif
+
+	// extra metadata bits
+	static const uintptr_t xml_memory_page_contents_shared_mask = 32;
+	static const uintptr_t xml_memory_page_name_allocated_mask = 16;
+	static const uintptr_t xml_memory_page_value_allocated_mask = 8;
+	static const uintptr_t xml_memory_page_type_mask = 7;
+
+	// combined masks for string uniqueness
+	static const uintptr_t xml_memory_page_name_allocated_or_shared_mask = xml_memory_page_name_allocated_mask | xml_memory_page_contents_shared_mask;
+	static const uintptr_t xml_memory_page_value_allocated_or_shared_mask = xml_memory_page_value_allocated_mask | xml_memory_page_contents_shared_mask;
+
+#ifdef PUGIXML_COMPACT
+	#define PUGI__GETPAGE_IMPL(header) (header).get_page()
+#else
+	#define PUGI__GETPAGE_IMPL(header) reinterpret_cast<impl::xml_memory_page*>((header) & impl::xml_memory_page_pointer_mask)
+#endif
+
+	#define PUGI__GETPAGE(n) PUGI__GETPAGE_IMPL((n)->header)
+	#define PUGI__NODETYPE(n) static_cast<xml_node_type>(((n)->header & impl::xml_memory_page_type_mask) + 1)
+
+	struct xml_allocator;
+
+	struct xml_memory_page
+	{
+		static xml_memory_page* construct(void* memory)
+		{
+			xml_memory_page* result = static_cast<xml_memory_page*>(memory);
+
+			result->allocator = 0;
+			result->prev = 0;
+			result->next = 0;
+			result->busy_size = 0;
+			result->freed_size = 0;
+
+		#ifdef PUGIXML_COMPACT
+			result->compact_string_base = 0;
+			result->compact_shared_parent = 0;
+			result->compact_page_marker = 0;
+		#endif
+
+			return result;
+		}
+
+		xml_allocator* allocator;
+
+		xml_memory_page* prev;
+		xml_memory_page* next;
+
+		size_t busy_size;
+		size_t freed_size;
+
+	#ifdef PUGIXML_COMPACT
+		char_t* compact_string_base;
+		void* compact_shared_parent;
+		uint32_t* compact_page_marker;
+	#endif
+	};
+
+	struct xml_memory_string_header
+	{
+		uint16_t page_offset; // offset from page->data
+		uint16_t full_size; // 0 if string occupies whole page
+	};
+
+	struct xml_allocator
+	{
+		xml_allocator(xml_memory_page* root): _root(root), _busy_size(root->busy_size)
+		{
+		#ifdef PUGIXML_COMPACT
+			_hash = 0;
+		#endif
+		}
+
+		xml_memory_page* allocate_page(size_t data_size)
+		{
+			size_t size = sizeof(xml_memory_page) + data_size;
+
+			// allocate block with some alignment, leaving memory for worst-case padding
+			void* memory = xml_memory::allocate(size + xml_memory_page_alignment);
+			if (!memory) return 0;
+
+			// align to next page boundary (note: this guarantees at least 1 usable byte before the page)
+			char* page_memory = reinterpret_cast<char*>((reinterpret_cast<uintptr_t>(memory) + xml_memory_page_alignment) & ~(xml_memory_page_alignment - 1));
+
+			// prepare page structure
+			xml_memory_page* page = xml_memory_page::construct(page_memory);
+			assert(page);
+
+			page->allocator = _root->allocator;
+
+			// record the offset for freeing the memory block
+			assert(page_memory > memory && page_memory - static_cast<char*>(memory) <= 127);
+			page_memory[-1] = static_cast<char>(page_memory - static_cast<char*>(memory));
+
+			return page;
+		}
+
+		static void deallocate_page(xml_memory_page* page)
+		{
+			char* page_memory = reinterpret_cast<char*>(page);
+
+			xml_memory::deallocate(page_memory - page_memory[-1]);
+		}
+
+		void* allocate_memory_oob(size_t size, xml_memory_page*& out_page);
+
+		void* allocate_memory(size_t size, xml_memory_page*& out_page)
+		{
+			if (PUGI__UNLIKELY(_busy_size + size > xml_memory_page_size))
+				return allocate_memory_oob(size, out_page);
+
+			void* buf = reinterpret_cast<char*>(_root) + sizeof(xml_memory_page) + _busy_size;
+
+			_busy_size += size;
+
+			out_page = _root;
+
+			return buf;
+		}
+
+	#ifdef PUGIXML_COMPACT
+		void* allocate_object(size_t size, xml_memory_page*& out_page)
+		{
+			void* result = allocate_memory(size + sizeof(uint32_t), out_page);
+			if (!result) return 0;
+
+			// adjust for marker
+			ptrdiff_t offset = static_cast<char*>(result) - reinterpret_cast<char*>(out_page->compact_page_marker);
+
+			if (PUGI__UNLIKELY(static_cast<uintptr_t>(offset) >= 256 * xml_memory_block_alignment))
+			{
+				// insert new marker
+				uint32_t* marker = static_cast<uint32_t*>(result);
+
+				*marker = static_cast<uint32_t>(reinterpret_cast<char*>(marker) - reinterpret_cast<char*>(out_page));
+				out_page->compact_page_marker = marker;
+
+				// since we don't reuse the page space until we reallocate it, we can just pretend that we freed the marker block
+				// this will make sure deallocate_memory correctly tracks the size
+				out_page->freed_size += sizeof(uint32_t);
+
+				return marker + 1;
+			}
+			else
+			{
+				// roll back uint32_t part
+				_busy_size -= sizeof(uint32_t);
+
+				return result;
+			}
+		}
+	#else
+		void* allocate_object(size_t size, xml_memory_page*& out_page)
+		{
+			return allocate_memory(size, out_page);
+		}
+	#endif
+
+		void deallocate_memory(void* ptr, size_t size, xml_memory_page* page)
+		{
+			if (page == _root) page->busy_size = _busy_size;
+
+			assert(ptr >= reinterpret_cast<char*>(page) + sizeof(xml_memory_page) && ptr < reinterpret_cast<char*>(page) + sizeof(xml_memory_page) + page->busy_size);
+			(void)!ptr;
+
+			page->freed_size += size;
+			assert(page->freed_size <= page->busy_size);
+
+			if (page->freed_size == page->busy_size)
+			{
+				if (page->next == 0)
+				{
+					assert(_root == page);
+
+					// top page freed, just reset sizes
+					page->busy_size = 0;
+					page->freed_size = 0;
+
+				#ifdef PUGIXML_COMPACT
+					// reset compact state to maximize efficiency
+					page->compact_string_base = 0;
+					page->compact_shared_parent = 0;
+					page->compact_page_marker = 0;
+				#endif
+
+					_busy_size = 0;
+				}
+				else
+				{
+					assert(_root != page);
+					assert(page->prev);
+
+					// remove from the list
+					page->prev->next = page->next;
+					page->next->prev = page->prev;
+
+					// deallocate
+					deallocate_page(page);
+				}
+			}
+		}
+
+		char_t* allocate_string(size_t length)
+		{
+			static const size_t max_encoded_offset = (1 << 16) * xml_memory_block_alignment;
+
+			PUGI__STATIC_ASSERT(xml_memory_page_size <= max_encoded_offset);
+
+			// allocate memory for string and header block
+			size_t size = sizeof(xml_memory_string_header) + length * sizeof(char_t);
+			
+			// round size up to block alignment boundary
+			size_t full_size = (size + (xml_memory_block_alignment - 1)) & ~(xml_memory_block_alignment - 1);
+
+			xml_memory_page* page;
+			xml_memory_string_header* header = static_cast<xml_memory_string_header*>(allocate_memory(full_size, page));
+
+			if (!header) return 0;
+
+			// setup header
+			ptrdiff_t page_offset = reinterpret_cast<char*>(header) - reinterpret_cast<char*>(page) - sizeof(xml_memory_page);
+
+			assert(page_offset % xml_memory_block_alignment == 0);
+			assert(page_offset >= 0 && static_cast<size_t>(page_offset) < max_encoded_offset);
+			header->page_offset = static_cast<uint16_t>(static_cast<size_t>(page_offset) / xml_memory_block_alignment);
+
+			// full_size == 0 for large strings that occupy the whole page
+			assert(full_size % xml_memory_block_alignment == 0);
+			assert(full_size < max_encoded_offset || (page->busy_size == full_size && page_offset == 0));
+			header->full_size = static_cast<uint16_t>(full_size < max_encoded_offset ? full_size / xml_memory_block_alignment : 0);
+
+			// round-trip through void* to avoid 'cast increases required alignment of target type' warning
+			// header is guaranteed a pointer-sized alignment, which should be enough for char_t
+			return static_cast<char_t*>(static_cast<void*>(header + 1));
+		}
+
+		void deallocate_string(char_t* string)
+		{
+			// this function casts pointers through void* to avoid 'cast increases required alignment of target type' warnings
+			// we're guaranteed the proper (pointer-sized) alignment on the input string if it was allocated via allocate_string
+
+			// get header
+			xml_memory_string_header* header = static_cast<xml_memory_string_header*>(static_cast<void*>(string)) - 1;
+			assert(header);
+
+			// deallocate
+			size_t page_offset = sizeof(xml_memory_page) + header->page_offset * xml_memory_block_alignment;
+			xml_memory_page* page = reinterpret_cast<xml_memory_page*>(static_cast<void*>(reinterpret_cast<char*>(header) - page_offset));
+
+			// if full_size == 0 then this string occupies the whole page
+			size_t full_size = header->full_size == 0 ? page->busy_size : header->full_size * xml_memory_block_alignment;
+
+			deallocate_memory(header, full_size, page);
+		}
+
+		bool reserve()
+		{
+		#ifdef PUGIXML_COMPACT
+			return _hash->reserve();
+		#else
+			return true;
+		#endif
+		}
+
+		xml_memory_page* _root;
+		size_t _busy_size;
+
+	#ifdef PUGIXML_COMPACT
+		compact_hash_table* _hash;
+	#endif
+	};
+
+	PUGI__FN_NO_INLINE void* xml_allocator::allocate_memory_oob(size_t size, xml_memory_page*& out_page)
+	{
+		const size_t large_allocation_threshold = xml_memory_page_size / 4;
+
+		xml_memory_page* page = allocate_page(size <= large_allocation_threshold ? xml_memory_page_size : size);
+		out_page = page;
+
+		if (!page) return 0;
+
+		if (size <= large_allocation_threshold)
+		{
+			_root->busy_size = _busy_size;
+
+			// insert page at the end of linked list
+			page->prev = _root;
+			_root->next = page;
+			_root = page;
+
+			_busy_size = size;
+		}
+		else
+		{
+			// insert page before the end of linked list, so that it is deleted as soon as possible
+			// the last page is not deleted even if it's empty (see deallocate_memory)
+			assert(_root->prev);
+
+			page->prev = _root->prev;
+			page->next = _root;
+
+			_root->prev->next = page;
+			_root->prev = page;
+
+			page->busy_size = size;
+		}
+
+		return reinterpret_cast<char*>(page) + sizeof(xml_memory_page);
+	}
+PUGI__NS_END
+
+#ifdef PUGIXML_COMPACT
+PUGI__NS_BEGIN
+	static const uintptr_t compact_alignment_log2 = 2;
+	static const uintptr_t compact_alignment = 1 << compact_alignment_log2;
+
+	class compact_header
+	{
+	public:
+		compact_header(xml_memory_page* page, unsigned int flags)
+		{
+			PUGI__STATIC_ASSERT(xml_memory_block_alignment == compact_alignment);
+
+			ptrdiff_t offset = (reinterpret_cast<char*>(this) - reinterpret_cast<char*>(page->compact_page_marker));
+			assert(offset % compact_alignment == 0 && static_cast<uintptr_t>(offset) < 256 * compact_alignment);
+
+			_page = static_cast<unsigned char>(offset >> compact_alignment_log2);
+			_flags = static_cast<unsigned char>(flags);
+		}
+
+		void operator&=(uintptr_t mod)
+		{
+			_flags &= mod;
+		}
+
+		void operator|=(uintptr_t mod)
+		{
+			_flags |= mod;
+		}
+
+		uintptr_t operator&(uintptr_t mod) const
+		{
+			return _flags & mod;
+		}
+
+		xml_memory_page* get_page() const
+		{
+			const char* page_marker = reinterpret_cast<const char*>(this) - (_page << compact_alignment_log2);
+			const char* page = page_marker - *reinterpret_cast<const uint32_t*>(page_marker);
+
+			return const_cast<xml_memory_page*>(reinterpret_cast<const xml_memory_page*>(page));
+		}
+
+	private:
+		unsigned char _page;
+		unsigned char _flags;
+	};
+
+	PUGI__FN xml_memory_page* compact_get_page(const void* object, int header_offset)
+	{
+		const compact_header* header = reinterpret_cast<const compact_header*>(static_cast<const char*>(object) - header_offset);
+
+		return header->get_page();
+	}
+
+	template <int header_offset, typename T> PUGI__FN_NO_INLINE T* compact_get_value(const void* object)
+	{
+		return static_cast<T*>(*compact_get_page(object, header_offset)->allocator->_hash->find(object));
+	}
+
+	template <int header_offset, typename T> PUGI__FN_NO_INLINE void compact_set_value(const void* object, T* value)
+	{
+		*compact_get_page(object, header_offset)->allocator->_hash->insert(object) = value;
+	}
+
+	template <typename T, int header_offset, int start = -126> class compact_pointer
+	{
+	public:
+		compact_pointer(): _data(0)
+		{
+		}
+
+		void operator=(const compact_pointer& rhs)
+		{
+			*this = rhs + 0;
+		}
+
+		void operator=(T* value)
+		{
+			if (value)
+			{
+				// value is guaranteed to be compact-aligned; 'this' is not
+				// our decoding is based on 'this' aligned to compact alignment downwards (see operator T*)
+				// so for negative offsets (e.g. -3) we need to adjust the diff by compact_alignment - 1 to
+				// compensate for arithmetic shift rounding for negative values
+				ptrdiff_t diff = reinterpret_cast<char*>(value) - reinterpret_cast<char*>(this);
+				ptrdiff_t offset = ((diff + int(compact_alignment - 1)) >> compact_alignment_log2) - start;
+
+				if (static_cast<uintptr_t>(offset) <= 253)
+					_data = static_cast<unsigned char>(offset + 1);
+				else
+				{
+					compact_set_value<header_offset>(this, value);
+
+					_data = 255;
+				}
+			}
+			else
+				_data = 0;
+		}
+
+		operator T*() const
+		{
+			if (_data)
+			{
+				if (_data < 255)
+				{
+					uintptr_t base = reinterpret_cast<uintptr_t>(this) & ~(compact_alignment - 1);
+
+					return reinterpret_cast<T*>(base + ((_data - 1 + start) << compact_alignment_log2));
+				}
+				else
+					return compact_get_value<header_offset, T>(this);
+			}
+			else
+				return 0;
+		}
+
+		T* operator->() const
+		{
+			return operator T*();
+		}
+
+	private:
+		unsigned char _data;
+	};
+
+	template <typename T, int header_offset> class compact_pointer_parent
+	{
+	public:
+		compact_pointer_parent(): _data(0)
+		{
+		}
+
+		void operator=(const compact_pointer_parent& rhs)
+		{
+			*this = rhs + 0;
+		}
+
+		void operator=(T* value)
+		{
+			if (value)
+			{
+				// value is guaranteed to be compact-aligned; 'this' is not
+				// our decoding is based on 'this' aligned to compact alignment downwards (see operator T*)
+				// so for negative offsets (e.g. -3) we need to adjust the diff by compact_alignment - 1 to
+				// compensate for arithmetic shift behavior for negative values
+				ptrdiff_t diff = reinterpret_cast<char*>(value) - reinterpret_cast<char*>(this);
+				ptrdiff_t offset = ((diff + int(compact_alignment - 1)) >> compact_alignment_log2) + 65533;
+
+				if (static_cast<uintptr_t>(offset) <= 65533)
+				{
+					_data = static_cast<unsigned short>(offset + 1);
+				}
+				else
+				{
+					xml_memory_page* page = compact_get_page(this, header_offset);
+
+					if (PUGI__UNLIKELY(page->compact_shared_parent == 0))
+						page->compact_shared_parent = value;
+
+					if (page->compact_shared_parent == value)
+					{
+						_data = 65534;
+					}
+					else
+					{
+						compact_set_value<header_offset>(this, value);
+
+						_data = 65535;
+					}
+				}
+			}
+			else
+			{
+				_data = 0;
+			}
+		}
+
+		operator T*() const
+		{
+			if (_data)
+			{
+				if (_data < 65534)
+				{
+					uintptr_t base = reinterpret_cast<uintptr_t>(this) & ~(compact_alignment - 1);
+
+					return reinterpret_cast<T*>(base + ((_data - 1 - 65533) << compact_alignment_log2));
+				}
+				else if (_data == 65534)
+					return static_cast<T*>(compact_get_page(this, header_offset)->compact_shared_parent);
+				else
+					return compact_get_value<header_offset, T>(this);
+			}
+			else
+				return 0;
+		}
+
+		T* operator->() const
+		{
+			return operator T*();
+		}
+
+	private:
+		uint16_t _data;
+	};
+
+	template <int header_offset, int base_offset> class compact_string
+	{
+	public:
+		compact_string(): _data(0)
+		{
+		}
+
+		void operator=(const compact_string& rhs)
+		{
+			*this = rhs + 0;
+		}
+
+		void operator=(char_t* value)
+		{
+			if (value)
+			{
+				xml_memory_page* page = compact_get_page(this, header_offset);
+
+				if (PUGI__UNLIKELY(page->compact_string_base == 0))
+					page->compact_string_base = value;
+
+				ptrdiff_t offset = value - page->compact_string_base;
+
+				if (static_cast<uintptr_t>(offset) < (65535 << 7))
+				{
+					uint16_t* base = reinterpret_cast<uint16_t*>(reinterpret_cast<char*>(this) - base_offset);
+
+					if (*base == 0)
+					{
+						*base = static_cast<uint16_t>((offset >> 7) + 1);
+						_data = static_cast<unsigned char>((offset & 127) + 1);
+					}
+					else
+					{
+						ptrdiff_t remainder = offset - ((*base - 1) << 7);
+
+						if (static_cast<uintptr_t>(remainder) <= 253)
+						{
+							_data = static_cast<unsigned char>(remainder + 1);
+						}
+						else
+						{
+							compact_set_value<header_offset>(this, value);
+
+							_data = 255;
+						}
+					}
+				}
+				else
+				{
+					compact_set_value<header_offset>(this, value);
+
+					_data = 255;
+				}
+			}
+			else
+			{
+				_data = 0;
+			}
+		}
+
+		operator char_t*() const
+		{
+			if (_data)
+			{
+				if (_data < 255)
+				{
+					xml_memory_page* page = compact_get_page(this, header_offset);
+
+					const uint16_t* base = reinterpret_cast<const uint16_t*>(reinterpret_cast<const char*>(this) - base_offset);
+					assert(*base);
+
+					ptrdiff_t offset = ((*base - 1) << 7) + (_data - 1);
+
+					return page->compact_string_base + offset;
+				}
+				else
+				{
+					return compact_get_value<header_offset, char_t>(this);
+				}
+			}
+			else
+				return 0;
+		}
+
+	private:
+		unsigned char _data;
+	};
+PUGI__NS_END
+#endif
+
+#ifdef PUGIXML_COMPACT
+namespace pugi
+{
+	struct xml_attribute_struct
+	{
+		xml_attribute_struct(impl::xml_memory_page* page): header(page, 0), namevalue_base(0)
+		{
+			PUGI__STATIC_ASSERT(sizeof(xml_attribute_struct) == 8);
+		}
+
+		impl::compact_header header;
+
+		uint16_t namevalue_base;
+
+		impl::compact_string<4, 2> name;
+		impl::compact_string<5, 3> value;
+
+		impl::compact_pointer<xml_attribute_struct, 6> prev_attribute_c;
+		impl::compact_pointer<xml_attribute_struct, 7, 0> next_attribute;
+	};
+
+	struct xml_node_struct
+	{
+		xml_node_struct(impl::xml_memory_page* page, xml_node_type type): header(page, type - 1), namevalue_base(0)
+		{
+			PUGI__STATIC_ASSERT(sizeof(xml_node_struct) == 12);
+		}
+
+		impl::compact_header header;
+
+		uint16_t namevalue_base;
+
+		impl::compact_string<4, 2> name;
+		impl::compact_string<5, 3> value;
+
+		impl::compact_pointer_parent<xml_node_struct, 6> parent;
+
+		impl::compact_pointer<xml_node_struct, 8, 0> first_child;
+
+		impl::compact_pointer<xml_node_struct, 9> prev_sibling_c;
+		impl::compact_pointer<xml_node_struct, 10, 0> next_sibling;
+
+		impl::compact_pointer<xml_attribute_struct, 11, 0> first_attribute;
+	};
+}
+#else
+namespace pugi
+{
+	struct xml_attribute_struct
+	{
+		xml_attribute_struct(impl::xml_memory_page* page): header(reinterpret_cast<uintptr_t>(page)), name(0), value(0), prev_attribute_c(0), next_attribute(0)
+		{
+		}
+
+		uintptr_t header;
+
+		char_t*	name;
+		char_t*	value;
+
+		xml_attribute_struct* prev_attribute_c;
+		xml_attribute_struct* next_attribute;
+	};
+
+	struct xml_node_struct
+	{
+		xml_node_struct(impl::xml_memory_page* page, xml_node_type type): header(reinterpret_cast<uintptr_t>(page) | (type - 1)), name(0), value(0), parent(0), first_child(0), prev_sibling_c(0), next_sibling(0), first_attribute(0)
+		{
+		}
+
+		uintptr_t header;
+
+		char_t* name;
+		char_t* value;
+
+		xml_node_struct* parent;
+
+		xml_node_struct* first_child;
+
+		xml_node_struct* prev_sibling_c;
+		xml_node_struct* next_sibling;
+
+		xml_attribute_struct* first_attribute;
+	};
+}
+#endif
+
+PUGI__NS_BEGIN
+	struct xml_extra_buffer
+	{
+		char_t* buffer;
+		xml_extra_buffer* next;
+	};
+
+	struct xml_document_struct: public xml_node_struct, public xml_allocator
+	{
+		xml_document_struct(xml_memory_page* page): xml_node_struct(page, node_document), xml_allocator(page), buffer(0), extra_buffers(0)
+		{
+		#ifdef PUGIXML_COMPACT
+			_hash = &hash;
+		#endif
+		}
+
+		const char_t* buffer;
+
+		xml_extra_buffer* extra_buffers;
+
+	#ifdef PUGIXML_COMPACT
+		compact_hash_table hash;
+	#endif
+	};
+
+	template <typename Object> inline xml_allocator& get_allocator(const Object* object)
+	{
+		assert(object);
+
+		return *PUGI__GETPAGE(object)->allocator;
+	}
+
+	template <typename Object> inline xml_document_struct& get_document(const Object* object)
+	{
+		assert(object);
+
+		return *static_cast<xml_document_struct*>(PUGI__GETPAGE(object)->allocator);
+	}
+PUGI__NS_END
+
+// Low-level DOM operations
+PUGI__NS_BEGIN
+	inline xml_attribute_struct* allocate_attribute(xml_allocator& alloc)
+	{
+		xml_memory_page* page;
+		void* memory = alloc.allocate_object(sizeof(xml_attribute_struct), page);
+		if (!memory) return 0;
+
+		return new (memory) xml_attribute_struct(page);
+	}
+
+	inline xml_node_struct* allocate_node(xml_allocator& alloc, xml_node_type type)
+	{
+		xml_memory_page* page;
+		void* memory = alloc.allocate_object(sizeof(xml_node_struct), page);
+		if (!memory) return 0;
+
+		return new (memory) xml_node_struct(page, type);
+	}
+
+	inline void destroy_attribute(xml_attribute_struct* a, xml_allocator& alloc)
+	{
+		if (a->header & impl::xml_memory_page_name_allocated_mask)
+			alloc.deallocate_string(a->name);
+
+		if (a->header & impl::xml_memory_page_value_allocated_mask)
+			alloc.deallocate_string(a->value);
+
+		alloc.deallocate_memory(a, sizeof(xml_attribute_struct), PUGI__GETPAGE(a));
+	}
+
+	inline void destroy_node(xml_node_struct* n, xml_allocator& alloc)
+	{
+		if (n->header & impl::xml_memory_page_name_allocated_mask)
+			alloc.deallocate_string(n->name);
+
+		if (n->header & impl::xml_memory_page_value_allocated_mask)
+			alloc.deallocate_string(n->value);
+
+		for (xml_attribute_struct* attr = n->first_attribute; attr; )
+		{
+			xml_attribute_struct* next = attr->next_attribute;
+
+			destroy_attribute(attr, alloc);
+
+			attr = next;
+		}
+
+		for (xml_node_struct* child = n->first_child; child; )
+		{
+			xml_node_struct* next = child->next_sibling;
+
+			destroy_node(child, alloc);
+
+			child = next;
+		}
+
+		alloc.deallocate_memory(n, sizeof(xml_node_struct), PUGI__GETPAGE(n));
+	}
+
+	inline void append_node(xml_node_struct* child, xml_node_struct* node)
+	{
+		child->parent = node;
+
+		xml_node_struct* head = node->first_child;
+
+		if (head)
+		{
+			xml_node_struct* tail = head->prev_sibling_c;
+
+			tail->next_sibling = child;
+			child->prev_sibling_c = tail;
+			head->prev_sibling_c = child;
+		}
+		else
+		{
+			node->first_child = child;
+			child->prev_sibling_c = child;
+		}
+	}
+
+	inline void prepend_node(xml_node_struct* child, xml_node_struct* node)
+	{
+		child->parent = node;
+
+		xml_node_struct* head = node->first_child;
+
+		if (head)
+		{
+			child->prev_sibling_c = head->prev_sibling_c;
+			head->prev_sibling_c = child;
+		}
+		else
+			child->prev_sibling_c = child;
+
+		child->next_sibling = head;
+		node->first_child = child;
+	}
+
+	inline void insert_node_after(xml_node_struct* child, xml_node_struct* node)
+	{
+		xml_node_struct* parent = node->parent;
+
+		child->parent = parent;
+
+		if (node->next_sibling)
+			node->next_sibling->prev_sibling_c = child;
+		else
+			parent->first_child->prev_sibling_c = child;
+
+		child->next_sibling = node->next_sibling;
+		child->prev_sibling_c = node;
+
+		node->next_sibling = child;
+	}
+
+	inline void insert_node_before(xml_node_struct* child, xml_node_struct* node)
+	{
+		xml_node_struct* parent = node->parent;
+
+		child->parent = parent;
+
+		if (node->prev_sibling_c->next_sibling)
+			node->prev_sibling_c->next_sibling = child;
+		else
+			parent->first_child = child;
+
+		child->prev_sibling_c = node->prev_sibling_c;
+		child->next_sibling = node;
+
+		node->prev_sibling_c = child;
+	}
+
+	inline void remove_node(xml_node_struct* node)
+	{
+		xml_node_struct* parent = node->parent;
+
+		if (node->next_sibling)
+			node->next_sibling->prev_sibling_c = node->prev_sibling_c;
+		else
+			parent->first_child->prev_sibling_c = node->prev_sibling_c;
+
+		if (node->prev_sibling_c->next_sibling)
+			node->prev_sibling_c->next_sibling = node->next_sibling;
+		else
+			parent->first_child = node->next_sibling;
+
+		node->parent = 0;
+		node->prev_sibling_c = 0;
+		node->next_sibling = 0;
+	}
+
+	inline void append_attribute(xml_attribute_struct* attr, xml_node_struct* node)
+	{
+		xml_attribute_struct* head = node->first_attribute;
+
+		if (head)
+		{
+			xml_attribute_struct* tail = head->prev_attribute_c;
+
+			tail->next_attribute = attr;
+			attr->prev_attribute_c = tail;
+			head->prev_attribute_c = attr;
+		}
+		else
+		{
+			node->first_attribute = attr;
+			attr->prev_attribute_c = attr;
+		}
+	}
+
+	inline void prepend_attribute(xml_attribute_struct* attr, xml_node_struct* node)
+	{
+		xml_attribute_struct* head = node->first_attribute;
+
+		if (head)
+		{
+			attr->prev_attribute_c = head->prev_attribute_c;
+			head->prev_attribute_c = attr;
+		}
+		else
+			attr->prev_attribute_c = attr;
+
+		attr->next_attribute = head;
+		node->first_attribute = attr;
+	}
+
+	inline void insert_attribute_after(xml_attribute_struct* attr, xml_attribute_struct* place, xml_node_struct* node)
+	{
+		if (place->next_attribute)
+			place->next_attribute->prev_attribute_c = attr;
+		else
+			node->first_attribute->prev_attribute_c = attr;
+
+		attr->next_attribute = place->next_attribute;
+		attr->prev_attribute_c = place;
+		place->next_attribute = attr;
+	}
+
+	inline void insert_attribute_before(xml_attribute_struct* attr, xml_attribute_struct* place, xml_node_struct* node)
+	{
+		if (place->prev_attribute_c->next_attribute)
+			place->prev_attribute_c->next_attribute = attr;
+		else
+			node->first_attribute = attr;
+
+		attr->prev_attribute_c = place->prev_attribute_c;
+		attr->next_attribute = place;
+		place->prev_attribute_c = attr;
+	}
+
+	inline void remove_attribute(xml_attribute_struct* attr, xml_node_struct* node)
+	{
+		if (attr->next_attribute)
+			attr->next_attribute->prev_attribute_c = attr->prev_attribute_c;
+		else
+			node->first_attribute->prev_attribute_c = attr->prev_attribute_c;
+
+		if (attr->prev_attribute_c->next_attribute)
+			attr->prev_attribute_c->next_attribute = attr->next_attribute;
+		else
+			node->first_attribute = attr->next_attribute;
+
+		attr->prev_attribute_c = 0;
+		attr->next_attribute = 0;
+	}
+
+	PUGI__FN_NO_INLINE xml_node_struct* append_new_node(xml_node_struct* node, xml_allocator& alloc, xml_node_type type = node_element)
+	{
+		if (!alloc.reserve()) return 0;
+
+		xml_node_struct* child = allocate_node(alloc, type);
+		if (!child) return 0;
+
+		append_node(child, node);
+
+		return child;
+	}
+
+	PUGI__FN_NO_INLINE xml_attribute_struct* append_new_attribute(xml_node_struct* node, xml_allocator& alloc)
+	{
+		if (!alloc.reserve()) return 0;
+
+		xml_attribute_struct* attr = allocate_attribute(alloc);
+		if (!attr) return 0;
+
+		append_attribute(attr, node);
+
+		return attr;
+	}
+PUGI__NS_END
+
+// Helper classes for code generation
+PUGI__NS_BEGIN
+	struct opt_false
+	{
+		enum { value = 0 };
+	};
+
+	struct opt_true
+	{
+		enum { value = 1 };
+	};
+PUGI__NS_END
+
+// Unicode utilities
+PUGI__NS_BEGIN
+	inline uint16_t endian_swap(uint16_t value)
+	{
+		return static_cast<uint16_t>(((value & 0xff) << 8) | (value >> 8));
+	}
+
+	inline uint32_t endian_swap(uint32_t value)
+	{
+		return ((value & 0xff) << 24) | ((value & 0xff00) << 8) | ((value & 0xff0000) >> 8) | (value >> 24);
+	}
+
+	struct utf8_counter
+	{
+		typedef size_t value_type;
+
+		static value_type low(value_type result, uint32_t ch)
+		{
+			// U+0000..U+007F
+			if (ch < 0x80) return result + 1;
+			// U+0080..U+07FF
+			else if (ch < 0x800) return result + 2;
+			// U+0800..U+FFFF
+			else return result + 3;
+		}
+
+		static value_type high(value_type result, uint32_t)
+		{
+			// U+10000..U+10FFFF
+			return result + 4;
+		}
+	};
+
+	struct utf8_writer
+	{
+		typedef uint8_t* value_type;
+
+		static value_type low(value_type result, uint32_t ch)
+		{
+			// U+0000..U+007F
+			if (ch < 0x80)
+			{
+				*result = static_cast<uint8_t>(ch);
+				return result + 1;
+			}
+			// U+0080..U+07FF
+			else if (ch < 0x800)
+			{
+				result[0] = static_cast<uint8_t>(0xC0 | (ch >> 6));
+				result[1] = static_cast<uint8_t>(0x80 | (ch & 0x3F));
+				return result + 2;
+			}
+			// U+0800..U+FFFF
+			else
+			{
+				result[0] = static_cast<uint8_t>(0xE0 | (ch >> 12));
+				result[1] = static_cast<uint8_t>(0x80 | ((ch >> 6) & 0x3F));
+				result[2] = static_cast<uint8_t>(0x80 | (ch & 0x3F));
+				return result + 3;
+			}
+		}
+
+		static value_type high(value_type result, uint32_t ch)
+		{
+			// U+10000..U+10FFFF
+			result[0] = static_cast<uint8_t>(0xF0 | (ch >> 18));
+			result[1] = static_cast<uint8_t>(0x80 | ((ch >> 12) & 0x3F));
+			result[2] = static_cast<uint8_t>(0x80 | ((ch >> 6) & 0x3F));
+			result[3] = static_cast<uint8_t>(0x80 | (ch & 0x3F));
+			return result + 4;
+		}
+
+		static value_type any(value_type result, uint32_t ch)
+		{
+			return (ch < 0x10000) ? low(result, ch) : high(result, ch);
+		}
+	};
+
+	struct utf16_counter
+	{
+		typedef size_t value_type;
+
+		static value_type low(value_type result, uint32_t)
+		{
+			return result + 1;
+		}
+
+		static value_type high(value_type result, uint32_t)
+		{
+			return result + 2;
+		}
+	};
+
+	struct utf16_writer
+	{
+		typedef uint16_t* value_type;
+
+		static value_type low(value_type result, uint32_t ch)
+		{
+			*result = static_cast<uint16_t>(ch);
+
+			return result + 1;
+		}
+
+		static value_type high(value_type result, uint32_t ch)
+		{
+			uint32_t msh = static_cast<uint32_t>(ch - 0x10000) >> 10;
+			uint32_t lsh = static_cast<uint32_t>(ch - 0x10000) & 0x3ff;
+
+			result[0] = static_cast<uint16_t>(0xD800 + msh);
+			result[1] = static_cast<uint16_t>(0xDC00 + lsh);
+
+			return result + 2;
+		}
+
+		static value_type any(value_type result, uint32_t ch)
+		{
+			return (ch < 0x10000) ? low(result, ch) : high(result, ch);
+		}
+	};
+
+	struct utf32_counter
+	{
+		typedef size_t value_type;
+
+		static value_type low(value_type result, uint32_t)
+		{
+			return result + 1;
+		}
+
+		static value_type high(value_type result, uint32_t)
+		{
+			return result + 1;
+		}
+	};
+
+	struct utf32_writer
+	{
+		typedef uint32_t* value_type;
+
+		static value_type low(value_type result, uint32_t ch)
+		{
+			*result = ch;
+
+			return result + 1;
+		}
+
+		static value_type high(value_type result, uint32_t ch)
+		{
+			*result = ch;
+
+			return result + 1;
+		}
+
+		static value_type any(value_type result, uint32_t ch)
+		{
+			*result = ch;
+
+			return result + 1;
+		}
+	};
+
+	struct latin1_writer
+	{
+		typedef uint8_t* value_type;
+
+		static value_type low(value_type result, uint32_t ch)
+		{
+			*result = static_cast<uint8_t>(ch > 255 ? '?' : ch);
+
+			return result + 1;
+		}
+
+		static value_type high(value_type result, uint32_t ch)
+		{
+			(void)ch;
+
+			*result = '?';
+
+			return result + 1;
+		}
+	};
+
+	template <size_t size> struct wchar_selector;
+
+	template <> struct wchar_selector<2>
+	{
+		typedef uint16_t type;
+		typedef utf16_counter counter;
+		typedef utf16_writer writer;
+	};
+
+	template <> struct wchar_selector<4>
+	{
+		typedef uint32_t type;
+		typedef utf32_counter counter;
+		typedef utf32_writer writer;
+	};
+
+	typedef wchar_selector<sizeof(wchar_t)>::counter wchar_counter;
+	typedef wchar_selector<sizeof(wchar_t)>::writer wchar_writer;
+
+	template <typename Traits, typename opt_swap = opt_false> struct utf_decoder
+	{
+		static inline typename Traits::value_type decode_utf8_block(const uint8_t* data, size_t size, typename Traits::value_type result)
+		{
+			const uint8_t utf8_byte_mask = 0x3f;
+
+			while (size)
+			{
+				uint8_t lead = *data;
+
+				// 0xxxxxxx -> U+0000..U+007F
+				if (lead < 0x80)
+				{
+					result = Traits::low(result, lead);
+					data += 1;
+					size -= 1;
+
+					// process aligned single-byte (ascii) blocks
+					if ((reinterpret_cast<uintptr_t>(data) & 3) == 0)
+					{
+						// round-trip through void* to silence 'cast increases required alignment of target type' warnings
+						while (size >= 4 && (*static_cast<const uint32_t*>(static_cast<const void*>(data)) & 0x80808080) == 0)
+						{
+							result = Traits::low(result, data[0]);
+							result = Traits::low(result, data[1]);
+							result = Traits::low(result, data[2]);
+							result = Traits::low(result, data[3]);
+							data += 4;
+							size -= 4;
+						}
+					}
+				}
+				// 110xxxxx -> U+0080..U+07FF
+				else if (static_cast<unsigned int>(lead - 0xC0) < 0x20 && size >= 2 && (data[1] & 0xc0) == 0x80)
+				{
+					result = Traits::low(result, ((lead & ~0xC0) << 6) | (data[1] & utf8_byte_mask));
+					data += 2;
+					size -= 2;
+				}
+				// 1110xxxx -> U+0800-U+FFFF
+				else if (static_cast<unsigned int>(lead - 0xE0) < 0x10 && size >= 3 && (data[1] & 0xc0) == 0x80 && (data[2] & 0xc0) == 0x80)
+				{
+					result = Traits::low(result, ((lead & ~0xE0) << 12) | ((data[1] & utf8_byte_mask) << 6) | (data[2] & utf8_byte_mask));
+					data += 3;
+					size -= 3;
+				}
+				// 11110xxx -> U+10000..U+10FFFF
+				else if (static_cast<unsigned int>(lead - 0xF0) < 0x08 && size >= 4 && (data[1] & 0xc0) == 0x80 && (data[2] & 0xc0) == 0x80 && (data[3] & 0xc0) == 0x80)
+				{
+					result = Traits::high(result, ((lead & ~0xF0) << 18) | ((data[1] & utf8_byte_mask) << 12) | ((data[2] & utf8_byte_mask) << 6) | (data[3] & utf8_byte_mask));
+					data += 4;
+					size -= 4;
+				}
+				// 10xxxxxx or 11111xxx -> invalid
+				else
+				{
+					data += 1;
+					size -= 1;
+				}
+			}
+
+			return result;
+		}
+
+		static inline typename Traits::value_type decode_utf16_block(const uint16_t* data, size_t size, typename Traits::value_type result)
+		{
+			const uint16_t* end = data + size;
+
+			while (data < end)
+			{
+				unsigned int lead = opt_swap::value ? endian_swap(*data) : *data;
+
+				// U+0000..U+D7FF
+				if (lead < 0xD800)
+				{
+					result = Traits::low(result, lead);
+					data += 1;
+				}
+				// U+E000..U+FFFF
+				else if (static_cast<unsigned int>(lead - 0xE000) < 0x2000)
+				{
+					result = Traits::low(result, lead);
+					data += 1;
+				}
+				// surrogate pair lead
+				else if (static_cast<unsigned int>(lead - 0xD800) < 0x400 && data + 1 < end)
+				{
+					uint16_t next = opt_swap::value ? endian_swap(data[1]) : data[1];
+
+					if (static_cast<unsigned int>(next - 0xDC00) < 0x400)
+					{
+						result = Traits::high(result, 0x10000 + ((lead & 0x3ff) << 10) + (next & 0x3ff));
+						data += 2;
+					}
+					else
+					{
+						data += 1;
+					}
+				}
+				else
+				{
+					data += 1;
+				}
+			}
+
+			return result;
+		}
+
+		static inline typename Traits::value_type decode_utf32_block(const uint32_t* data, size_t size, typename Traits::value_type result)
+		{
+			const uint32_t* end = data + size;
+
+			while (data < end)
+			{
+				uint32_t lead = opt_swap::value ? endian_swap(*data) : *data;
+
+				// U+0000..U+FFFF
+				if (lead < 0x10000)
+				{
+					result = Traits::low(result, lead);
+					data += 1;
+				}
+				// U+10000..U+10FFFF
+				else
+				{
+					result = Traits::high(result, lead);
+					data += 1;
+				}
+			}
+
+			return result;
+		}
+
+		static inline typename Traits::value_type decode_latin1_block(const uint8_t* data, size_t size, typename Traits::value_type result)
+		{
+			for (size_t i = 0; i < size; ++i)
+			{
+				result = Traits::low(result, data[i]);
+			}
+
+			return result;
+		}
+
+		static inline typename Traits::value_type decode_wchar_block_impl(const uint16_t* data, size_t size, typename Traits::value_type result)
+		{
+			return decode_utf16_block(data, size, result);
+		}
+
+		static inline typename Traits::value_type decode_wchar_block_impl(const uint32_t* data, size_t size, typename Traits::value_type result)
+		{
+			return decode_utf32_block(data, size, result);
+		}
+
+		static inline typename Traits::value_type decode_wchar_block(const wchar_t* data, size_t size, typename Traits::value_type result)
+		{
+			return decode_wchar_block_impl(reinterpret_cast<const wchar_selector<sizeof(wchar_t)>::type*>(data), size, result);
+		}
+	};
+
+	template <typename T> PUGI__FN void convert_utf_endian_swap(T* result, const T* data, size_t length)
+	{
+		for (size_t i = 0; i < length; ++i) result[i] = endian_swap(data[i]);
+	}
+
+#ifdef PUGIXML_WCHAR_MODE
+	PUGI__FN void convert_wchar_endian_swap(wchar_t* result, const wchar_t* data, size_t length)
+	{
+		for (size_t i = 0; i < length; ++i) result[i] = static_cast<wchar_t>(endian_swap(static_cast<wchar_selector<sizeof(wchar_t)>::type>(data[i])));
+	}
+#endif
+PUGI__NS_END
+
+PUGI__NS_BEGIN
+	enum chartype_t
+	{
+		ct_parse_pcdata = 1,	// \0, &, \r, <
+		ct_parse_attr = 2,		// \0, &, \r, ', "
+		ct_parse_attr_ws = 4,	// \0, &, \r, ', ", \n, tab
+		ct_space = 8,			// \r, \n, space, tab
+		ct_parse_cdata = 16,	// \0, ], >, \r
+		ct_parse_comment = 32,	// \0, -, >, \r
+		ct_symbol = 64,			// Any symbol > 127, a-z, A-Z, 0-9, _, :, -, .
+		ct_start_symbol = 128	// Any symbol > 127, a-z, A-Z, _, :
+	};
+
+	static const unsigned char chartype_table[256] =
+	{
+		55, 0, 0, 0, 0, 0, 0, 0, 0, 12, 12, 0, 0, 63, 0, 0, // 0-15
+		0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 16-31
+		8, 0, 6, 0, 0, 0, 7, 6, 0, 0, 0, 0, 0, 96, 64, 0, // 32-47
+		64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 192, 0, 1, 0, 48, 0, // 48-63
+		0, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, // 64-79
+		192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 0, 0, 16, 0, 192, // 80-95
+		0, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, // 96-111
+		192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 0, 0, 0, 0, 0, // 112-127
+
+		192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, // 128+
+		192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192,
+		192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192,
+		192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192,
+		192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192,
+		192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192,
+		192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192,
+		192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192
+	};
+
+	enum chartypex_t
+	{
+		ctx_special_pcdata = 1, // Any symbol >= 0 and < 32 (except \t, \r, \n), &, <, >
+		ctx_special_attr = 2, // Any symbol >= 0 and < 32 (except \t), &, <, >, "
+		ctx_start_symbol = 4,	 // Any symbol > 127, a-z, A-Z, _
+		ctx_digit = 8,			 // 0-9
+		ctx_symbol = 16			 // Any symbol > 127, a-z, A-Z, 0-9, _, -, .
+	};
+	
+	static const unsigned char chartypex_table[256] =
+	{
+		3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 2, 3, 3, 2, 3, 3, // 0-15
+		3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, // 16-31
+		0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 16, 16, 0, // 32-47
+		24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 0, 0, 3, 0, 3, 0, // 48-63
+
+		0, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, // 64-79
+		20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 0, 0, 0, 0, 20, // 80-95
+		0, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, // 96-111
+		20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 0, 0, 0, 0, 0, // 112-127
+
+		20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, // 128+
+		20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
+		20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
+		20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
+		20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
+		20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
+		20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
+		20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20
+	};
+	
+#ifdef PUGIXML_WCHAR_MODE
+	#define PUGI__IS_CHARTYPE_IMPL(c, ct, table) ((static_cast<unsigned int>(c) < 128 ? table[static_cast<unsigned int>(c)] : table[128]) & (ct))
+#else
+	#define PUGI__IS_CHARTYPE_IMPL(c, ct, table) (table[static_cast<unsigned char>(c)] & (ct))
+#endif
+
+	#define PUGI__IS_CHARTYPE(c, ct) PUGI__IS_CHARTYPE_IMPL(c, ct, chartype_table)
+	#define PUGI__IS_CHARTYPEX(c, ct) PUGI__IS_CHARTYPE_IMPL(c, ct, chartypex_table)
+
+	PUGI__FN bool is_little_endian()
+	{
+		unsigned int ui = 1;
+
+		return *reinterpret_cast<unsigned char*>(&ui) == 1;
+	}
+
+	PUGI__FN xml_encoding get_wchar_encoding()
+	{
+		PUGI__STATIC_ASSERT(sizeof(wchar_t) == 2 || sizeof(wchar_t) == 4);
+
+		if (sizeof(wchar_t) == 2)
+			return is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+		else 
+			return is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+	}
+
+	PUGI__FN xml_encoding guess_buffer_encoding(uint8_t d0, uint8_t d1, uint8_t d2, uint8_t d3)
+	{
+		// look for BOM in first few bytes
+		if (d0 == 0 && d1 == 0 && d2 == 0xfe && d3 == 0xff) return encoding_utf32_be;
+		if (d0 == 0xff && d1 == 0xfe && d2 == 0 && d3 == 0) return encoding_utf32_le;
+		if (d0 == 0xfe && d1 == 0xff) return encoding_utf16_be;
+		if (d0 == 0xff && d1 == 0xfe) return encoding_utf16_le;
+		if (d0 == 0xef && d1 == 0xbb && d2 == 0xbf) return encoding_utf8;
+
+		// look for <, <? or <?xm in various encodings
+		if (d0 == 0 && d1 == 0 && d2 == 0 && d3 == 0x3c) return encoding_utf32_be;
+		if (d0 == 0x3c && d1 == 0 && d2 == 0 && d3 == 0) return encoding_utf32_le;
+		if (d0 == 0 && d1 == 0x3c && d2 == 0 && d3 == 0x3f) return encoding_utf16_be;
+		if (d0 == 0x3c && d1 == 0 && d2 == 0x3f && d3 == 0) return encoding_utf16_le;
+		if (d0 == 0x3c && d1 == 0x3f && d2 == 0x78 && d3 == 0x6d) return encoding_utf8;
+
+		// look for utf16 < followed by node name (this may fail, but is better than utf8 since it's zero terminated so early)
+		if (d0 == 0 && d1 == 0x3c) return encoding_utf16_be;
+		if (d0 == 0x3c && d1 == 0) return encoding_utf16_le;
+
+		// no known BOM detected, assume utf8
+		return encoding_utf8;
+	}
+
+	PUGI__FN xml_encoding get_buffer_encoding(xml_encoding encoding, const void* contents, size_t size)
+	{
+		// replace wchar encoding with utf implementation
+		if (encoding == encoding_wchar) return get_wchar_encoding();
+
+		// replace utf16 encoding with utf16 with specific endianness
+		if (encoding == encoding_utf16) return is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+
+		// replace utf32 encoding with utf32 with specific endianness
+		if (encoding == encoding_utf32) return is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+
+		// only do autodetection if no explicit encoding is requested
+		if (encoding != encoding_auto) return encoding;
+
+		// skip encoding autodetection if input buffer is too small
+		if (size < 4) return encoding_utf8;
+
+		// try to guess encoding (based on XML specification, Appendix F.1)
+		const uint8_t* data = static_cast<const uint8_t*>(contents);
+
+		PUGI__DMC_VOLATILE uint8_t d0 = data[0], d1 = data[1], d2 = data[2], d3 = data[3];
+
+		return guess_buffer_encoding(d0, d1, d2, d3);
+	}
+
+	PUGI__FN bool get_mutable_buffer(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, bool is_mutable)
+	{
+		size_t length = size / sizeof(char_t);
+
+		if (is_mutable)
+		{
+			out_buffer = static_cast<char_t*>(const_cast<void*>(contents));
+			out_length = length;
+		}
+		else
+		{
+			char_t* buffer = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+			if (!buffer) return false;
+
+			if (contents)
+				memcpy(buffer, contents, length * sizeof(char_t));
+			else
+				assert(length == 0);
+
+			buffer[length] = 0;
+
+			out_buffer = buffer;
+			out_length = length + 1;
+		}
+
+		return true;
+	}
+
+#ifdef PUGIXML_WCHAR_MODE
+	PUGI__FN bool need_endian_swap_utf(xml_encoding le, xml_encoding re)
+	{
+		return (le == encoding_utf16_be && re == encoding_utf16_le) || (le == encoding_utf16_le && re == encoding_utf16_be) ||
+			 (le == encoding_utf32_be && re == encoding_utf32_le) || (le == encoding_utf32_le && re == encoding_utf32_be);
+	}
+
+	PUGI__FN bool convert_buffer_endian_swap(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, bool is_mutable)
+	{
+		const char_t* data = static_cast<const char_t*>(contents);
+		size_t length = size / sizeof(char_t);
+
+		if (is_mutable)
+		{
+			char_t* buffer = const_cast<char_t*>(data);
+
+			convert_wchar_endian_swap(buffer, data, length);
+
+			out_buffer = buffer;
+			out_length = length;
+		}
+		else
+		{
+			char_t* buffer = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+			if (!buffer) return false;
+
+			convert_wchar_endian_swap(buffer, data, length);
+			buffer[length] = 0;
+
+			out_buffer = buffer;
+			out_length = length + 1;
+		}
+
+		return true;
+	}
+
+	PUGI__FN bool convert_buffer_utf8(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size)
+	{
+		const uint8_t* data = static_cast<const uint8_t*>(contents);
+		size_t data_length = size;
+
+		// first pass: get length in wchar_t units
+		size_t length = utf_decoder<wchar_counter>::decode_utf8_block(data, data_length, 0);
+
+		// allocate buffer of suitable length
+		char_t* buffer = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+		if (!buffer) return false;
+
+		// second pass: convert utf8 input to wchar_t
+		wchar_writer::value_type obegin = reinterpret_cast<wchar_writer::value_type>(buffer);
+		wchar_writer::value_type oend = utf_decoder<wchar_writer>::decode_utf8_block(data, data_length, obegin);
+
+		assert(oend == obegin + length);
+		*oend = 0;
+
+		out_buffer = buffer;
+		out_length = length + 1;
+
+		return true;
+	}
+
+	template <typename opt_swap> PUGI__FN bool convert_buffer_utf16(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, opt_swap)
+	{
+		const uint16_t* data = static_cast<const uint16_t*>(contents);
+		size_t data_length = size / sizeof(uint16_t);
+
+		// first pass: get length in wchar_t units
+		size_t length = utf_decoder<wchar_counter, opt_swap>::decode_utf16_block(data, data_length, 0);
+
+		// allocate buffer of suitable length
+		char_t* buffer = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+		if (!buffer) return false;
+
+		// second pass: convert utf16 input to wchar_t
+		wchar_writer::value_type obegin = reinterpret_cast<wchar_writer::value_type>(buffer);
+		wchar_writer::value_type oend = utf_decoder<wchar_writer, opt_swap>::decode_utf16_block(data, data_length, obegin);
+
+		assert(oend == obegin + length);
+		*oend = 0;
+
+		out_buffer = buffer;
+		out_length = length + 1;
+
+		return true;
+	}
+
+	template <typename opt_swap> PUGI__FN bool convert_buffer_utf32(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, opt_swap)
+	{
+		const uint32_t* data = static_cast<const uint32_t*>(contents);
+		size_t data_length = size / sizeof(uint32_t);
+
+		// first pass: get length in wchar_t units
+		size_t length = utf_decoder<wchar_counter, opt_swap>::decode_utf32_block(data, data_length, 0);
+
+		// allocate buffer of suitable length
+		char_t* buffer = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+		if (!buffer) return false;
+
+		// second pass: convert utf32 input to wchar_t
+		wchar_writer::value_type obegin = reinterpret_cast<wchar_writer::value_type>(buffer);
+		wchar_writer::value_type oend = utf_decoder<wchar_writer, opt_swap>::decode_utf32_block(data, data_length, obegin);
+
+		assert(oend == obegin + length);
+		*oend = 0;
+
+		out_buffer = buffer;
+		out_length = length + 1;
+
+		return true;
+	}
+
+	PUGI__FN bool convert_buffer_latin1(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size)
+	{
+		const uint8_t* data = static_cast<const uint8_t*>(contents);
+		size_t data_length = size;
+
+		// get length in wchar_t units
+		size_t length = data_length;
+
+		// allocate buffer of suitable length
+		char_t* buffer = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+		if (!buffer) return false;
+
+		// convert latin1 input to wchar_t
+		wchar_writer::value_type obegin = reinterpret_cast<wchar_writer::value_type>(buffer);
+		wchar_writer::value_type oend = utf_decoder<wchar_writer>::decode_latin1_block(data, data_length, obegin);
+
+		assert(oend == obegin + length);
+		*oend = 0;
+
+		out_buffer = buffer;
+		out_length = length + 1;
+
+		return true;
+	}
+
+	PUGI__FN bool convert_buffer(char_t*& out_buffer, size_t& out_length, xml_encoding encoding, const void* contents, size_t size, bool is_mutable)
+	{
+		// get native encoding
+		xml_encoding wchar_encoding = get_wchar_encoding();
+
+		// fast path: no conversion required
+		if (encoding == wchar_encoding) return get_mutable_buffer(out_buffer, out_length, contents, size, is_mutable);
+
+		// only endian-swapping is required
+		if (need_endian_swap_utf(encoding, wchar_encoding)) return convert_buffer_endian_swap(out_buffer, out_length, contents, size, is_mutable);
+
+		// source encoding is utf8
+		if (encoding == encoding_utf8) return convert_buffer_utf8(out_buffer, out_length, contents, size);
+
+		// source encoding is utf16
+		if (encoding == encoding_utf16_be || encoding == encoding_utf16_le)
+		{
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+
+			return (native_encoding == encoding) ?
+				convert_buffer_utf16(out_buffer, out_length, contents, size, opt_false()) :
+				convert_buffer_utf16(out_buffer, out_length, contents, size, opt_true());
+		}
+
+		// source encoding is utf32
+		if (encoding == encoding_utf32_be || encoding == encoding_utf32_le)
+		{
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+
+			return (native_encoding == encoding) ?
+				convert_buffer_utf32(out_buffer, out_length, contents, size, opt_false()) :
+				convert_buffer_utf32(out_buffer, out_length, contents, size, opt_true());
+		}
+
+		// source encoding is latin1
+		if (encoding == encoding_latin1) return convert_buffer_latin1(out_buffer, out_length, contents, size);
+
+		assert(!"Invalid encoding");
+		return false;
+	}
+#else
+	template <typename opt_swap> PUGI__FN bool convert_buffer_utf16(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, opt_swap)
+	{
+		const uint16_t* data = static_cast<const uint16_t*>(contents);
+		size_t data_length = size / sizeof(uint16_t);
+
+		// first pass: get length in utf8 units
+		size_t length = utf_decoder<utf8_counter, opt_swap>::decode_utf16_block(data, data_length, 0);
+
+		// allocate buffer of suitable length
+		char_t* buffer = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+		if (!buffer) return false;
+
+		// second pass: convert utf16 input to utf8
+		uint8_t* obegin = reinterpret_cast<uint8_t*>(buffer);
+		uint8_t* oend = utf_decoder<utf8_writer, opt_swap>::decode_utf16_block(data, data_length, obegin);
+
+		assert(oend == obegin + length);
+		*oend = 0;
+
+		out_buffer = buffer;
+		out_length = length + 1;
+
+		return true;
+	}
+
+	template <typename opt_swap> PUGI__FN bool convert_buffer_utf32(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, opt_swap)
+	{
+		const uint32_t* data = static_cast<const uint32_t*>(contents);
+		size_t data_length = size / sizeof(uint32_t);
+
+		// first pass: get length in utf8 units
+		size_t length = utf_decoder<utf8_counter, opt_swap>::decode_utf32_block(data, data_length, 0);
+
+		// allocate buffer of suitable length
+		char_t* buffer = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+		if (!buffer) return false;
+
+		// second pass: convert utf32 input to utf8
+		uint8_t* obegin = reinterpret_cast<uint8_t*>(buffer);
+		uint8_t* oend = utf_decoder<utf8_writer, opt_swap>::decode_utf32_block(data, data_length, obegin);
+
+		assert(oend == obegin + length);
+		*oend = 0;
+
+		out_buffer = buffer;
+		out_length = length + 1;
+
+		return true;
+	}
+
+	PUGI__FN size_t get_latin1_7bit_prefix_length(const uint8_t* data, size_t size)
+	{
+		for (size_t i = 0; i < size; ++i)
+			if (data[i] > 127)
+				return i;
+
+		return size;
+	}
+
+	PUGI__FN bool convert_buffer_latin1(char_t*& out_buffer, size_t& out_length, const void* contents, size_t size, bool is_mutable)
+	{
+		const uint8_t* data = static_cast<const uint8_t*>(contents);
+		size_t data_length = size;
+
+		// get size of prefix that does not need utf8 conversion
+		size_t prefix_length = get_latin1_7bit_prefix_length(data, data_length);
+		assert(prefix_length <= data_length);
+
+		const uint8_t* postfix = data + prefix_length;
+		size_t postfix_length = data_length - prefix_length;
+
+		// if no conversion is needed, just return the original buffer
+		if (postfix_length == 0) return get_mutable_buffer(out_buffer, out_length, contents, size, is_mutable);
+
+		// first pass: get length in utf8 units
+		size_t length = prefix_length + utf_decoder<utf8_counter>::decode_latin1_block(postfix, postfix_length, 0);
+
+		// allocate buffer of suitable length
+		char_t* buffer = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+		if (!buffer) return false;
+
+		// second pass: convert latin1 input to utf8
+		memcpy(buffer, data, prefix_length);
+
+		uint8_t* obegin = reinterpret_cast<uint8_t*>(buffer);
+		uint8_t* oend = utf_decoder<utf8_writer>::decode_latin1_block(postfix, postfix_length, obegin + prefix_length);
+
+		assert(oend == obegin + length);
+		*oend = 0;
+
+		out_buffer = buffer;
+		out_length = length + 1;
+
+		return true;
+	}
+
+	PUGI__FN bool convert_buffer(char_t*& out_buffer, size_t& out_length, xml_encoding encoding, const void* contents, size_t size, bool is_mutable)
+	{
+		// fast path: no conversion required
+		if (encoding == encoding_utf8) return get_mutable_buffer(out_buffer, out_length, contents, size, is_mutable);
+
+		// source encoding is utf16
+		if (encoding == encoding_utf16_be || encoding == encoding_utf16_le)
+		{
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+
+			return (native_encoding == encoding) ?
+				convert_buffer_utf16(out_buffer, out_length, contents, size, opt_false()) :
+				convert_buffer_utf16(out_buffer, out_length, contents, size, opt_true());
+		}
+
+		// source encoding is utf32
+		if (encoding == encoding_utf32_be || encoding == encoding_utf32_le)
+		{
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+
+			return (native_encoding == encoding) ?
+				convert_buffer_utf32(out_buffer, out_length, contents, size, opt_false()) :
+				convert_buffer_utf32(out_buffer, out_length, contents, size, opt_true());
+		}
+
+		// source encoding is latin1
+		if (encoding == encoding_latin1) return convert_buffer_latin1(out_buffer, out_length, contents, size, is_mutable);
+
+		assert(!"Invalid encoding");
+		return false;
+	}
+#endif
+
+	PUGI__FN size_t as_utf8_begin(const wchar_t* str, size_t length)
+	{
+		// get length in utf8 characters
+		return utf_decoder<utf8_counter>::decode_wchar_block(str, length, 0);
+	}
+
+	PUGI__FN void as_utf8_end(char* buffer, size_t size, const wchar_t* str, size_t length)
+	{
+		// convert to utf8
+		uint8_t* begin = reinterpret_cast<uint8_t*>(buffer);
+		uint8_t* end = utf_decoder<utf8_writer>::decode_wchar_block(str, length, begin);
+	
+		assert(begin + size == end);
+		(void)!end;
+		(void)!size;
+	}
+	
+#ifndef PUGIXML_NO_STL
+	PUGI__FN std::string as_utf8_impl(const wchar_t* str, size_t length)
+	{
+		// first pass: get length in utf8 characters
+		size_t size = as_utf8_begin(str, length);
+
+		// allocate resulting string
+		std::string result;
+		result.resize(size);
+
+		// second pass: convert to utf8
+		if (size > 0) as_utf8_end(&result[0], size, str, length);
+
+		return result;
+	}
+
+	PUGI__FN std::basic_string<wchar_t> as_wide_impl(const char* str, size_t size)
+	{
+		const uint8_t* data = reinterpret_cast<const uint8_t*>(str);
+
+		// first pass: get length in wchar_t units
+		size_t length = utf_decoder<wchar_counter>::decode_utf8_block(data, size, 0);
+
+		// allocate resulting string
+		std::basic_string<wchar_t> result;
+		result.resize(length);
+
+		// second pass: convert to wchar_t
+		if (length > 0)
+		{
+			wchar_writer::value_type begin = reinterpret_cast<wchar_writer::value_type>(&result[0]);
+			wchar_writer::value_type end = utf_decoder<wchar_writer>::decode_utf8_block(data, size, begin);
+
+			assert(begin + length == end);
+			(void)!end;
+		}
+
+		return result;
+	}
+#endif
+
+	template <typename Header>
+	inline bool strcpy_insitu_allow(size_t length, const Header& header, uintptr_t header_mask, char_t* target)
+	{
+		// never reuse shared memory
+		if (header & xml_memory_page_contents_shared_mask) return false;
+
+		size_t target_length = strlength(target);
+
+		// always reuse document buffer memory if possible
+		if ((header & header_mask) == 0) return target_length >= length;
+
+		// reuse heap memory if waste is not too great
+		const size_t reuse_threshold = 32;
+
+		return target_length >= length && (target_length < reuse_threshold || target_length - length < target_length / 2);
+	}
+
+	template <typename String, typename Header>
+	PUGI__FN bool strcpy_insitu(String& dest, Header& header, uintptr_t header_mask, const char_t* source)
+	{
+		size_t source_length = strlength(source);
+
+		if (source_length == 0)
+		{
+			// empty string and null pointer are equivalent, so just deallocate old memory
+			xml_allocator* alloc = PUGI__GETPAGE_IMPL(header)->allocator;
+
+			if (header & header_mask) alloc->deallocate_string(dest);
+			
+			// mark the string as not allocated
+			dest = 0;
+			header &= ~header_mask;
+
+			return true;
+		}
+		else if (dest && strcpy_insitu_allow(source_length, header, header_mask, dest))
+		{
+			// we can reuse old buffer, so just copy the new data (including zero terminator)
+			memcpy(dest, source, (source_length + 1) * sizeof(char_t));
+			
+			return true;
+		}
+		else
+		{
+			xml_allocator* alloc = PUGI__GETPAGE_IMPL(header)->allocator;
+
+			if (!alloc->reserve()) return false;
+
+			// allocate new buffer
+			char_t* buf = alloc->allocate_string(source_length + 1);
+			if (!buf) return false;
+
+			// copy the string (including zero terminator)
+			memcpy(buf, source, (source_length + 1) * sizeof(char_t));
+
+			// deallocate old buffer (*after* the above to protect against overlapping memory and/or allocation failures)
+			if (header & header_mask) alloc->deallocate_string(dest);
+			
+			// the string is now allocated, so set the flag
+			dest = buf;
+			header |= header_mask;
+
+			return true;
+		}
+	}
+
+	struct gap
+	{
+		char_t* end;
+		size_t size;
+			
+		gap(): end(0), size(0)
+		{
+		}
+			
+		// Push new gap, move s count bytes further (skipping the gap).
+		// Collapse previous gap.
+		void push(char_t*& s, size_t count)
+		{
+			if (end) // there was a gap already; collapse it
+			{
+				// Move [old_gap_end, new_gap_start) to [old_gap_start, ...)
+				assert(s >= end);
+				memmove(end - size, end, reinterpret_cast<char*>(s) - reinterpret_cast<char*>(end));
+			}
+				
+			s += count; // end of current gap
+				
+			// "merge" two gaps
+			end = s;
+			size += count;
+		}
+			
+		// Collapse all gaps, return past-the-end pointer
+		char_t* flush(char_t* s)
+		{
+			if (end)
+			{
+				// Move [old_gap_end, current_pos) to [old_gap_start, ...)
+				assert(s >= end);
+				memmove(end - size, end, reinterpret_cast<char*>(s) - reinterpret_cast<char*>(end));
+
+				return s - size;
+			}
+			else return s;
+		}
+	};
+	
+	PUGI__FN char_t* strconv_escape(char_t* s, gap& g)
+	{
+		char_t* stre = s + 1;
+
+		switch (*stre)
+		{
+			case '#':	// &#...
+			{
+				unsigned int ucsc = 0;
+
+				if (stre[1] == 'x') // &#x... (hex code)
+				{
+					stre += 2;
+
+					char_t ch = *stre;
+
+					if (ch == ';') return stre;
+
+					for (;;)
+					{
+						if (static_cast<unsigned int>(ch - '0') <= 9)
+							ucsc = 16 * ucsc + (ch - '0');
+						else if (static_cast<unsigned int>((ch | ' ') - 'a') <= 5)
+							ucsc = 16 * ucsc + ((ch | ' ') - 'a' + 10);
+						else if (ch == ';')
+							break;
+						else // cancel
+							return stre;
+
+						ch = *++stre;
+					}
+					
+					++stre;
+				}
+				else	// &#... (dec code)
+				{
+					char_t ch = *++stre;
+
+					if (ch == ';') return stre;
+
+					for (;;)
+					{
+						if (static_cast<unsigned int>(static_cast<unsigned int>(ch) - '0') <= 9)
+							ucsc = 10 * ucsc + (ch - '0');
+						else if (ch == ';')
+							break;
+						else // cancel
+							return stre;
+
+						ch = *++stre;
+					}
+					
+					++stre;
+				}
+
+			#ifdef PUGIXML_WCHAR_MODE
+				s = reinterpret_cast<char_t*>(wchar_writer::any(reinterpret_cast<wchar_writer::value_type>(s), ucsc));
+			#else
+				s = reinterpret_cast<char_t*>(utf8_writer::any(reinterpret_cast<uint8_t*>(s), ucsc));
+			#endif
+					
+				g.push(s, stre - s);
+				return stre;
+			}
+
+			case 'a':	// &a
+			{
+				++stre;
+
+				if (*stre == 'm') // &am
+				{
+					if (*++stre == 'p' && *++stre == ';') // &amp;
+					{
+						*s++ = '&';
+						++stre;
+							
+						g.push(s, stre - s);
+						return stre;
+					}
+				}
+				else if (*stre == 'p') // &ap
+				{
+					if (*++stre == 'o' && *++stre == 's' && *++stre == ';') // &apos;
+					{
+						*s++ = '\'';
+						++stre;
+
+						g.push(s, stre - s);
+						return stre;
+					}
+				}
+				break;
+			}
+
+			case 'g': // &g
+			{
+				if (*++stre == 't' && *++stre == ';') // &gt;
+				{
+					*s++ = '>';
+					++stre;
+					
+					g.push(s, stre - s);
+					return stre;
+				}
+				break;
+			}
+
+			case 'l': // &l
+			{
+				if (*++stre == 't' && *++stre == ';') // &lt;
+				{
+					*s++ = '<';
+					++stre;
+						
+					g.push(s, stre - s);
+					return stre;
+				}
+				break;
+			}
+
+			case 'q': // &q
+			{
+				if (*++stre == 'u' && *++stre == 'o' && *++stre == 't' && *++stre == ';') // &quot;
+				{
+					*s++ = '"';
+					++stre;
+					
+					g.push(s, stre - s);
+					return stre;
+				}
+				break;
+			}
+
+			default:
+				break;
+		}
+		
+		return stre;
+	}
+
+	// Parser utilities
+	#define PUGI__ENDSWITH(c, e) ((c) == (e) || ((c) == 0 && endch == (e)))
+	#define PUGI__SKIPWS() { while (PUGI__IS_CHARTYPE(*s, ct_space)) ++s; }
+	#define PUGI__OPTSET(OPT) ( optmsk & (OPT) )
+	#define PUGI__PUSHNODE(TYPE) { cursor = append_new_node(cursor, alloc, TYPE); if (!cursor) PUGI__THROW_ERROR(status_out_of_memory, s); }
+	#define PUGI__POPNODE() { cursor = cursor->parent; }
+	#define PUGI__SCANFOR(X) { while (*s != 0 && !(X)) ++s; }
+	#define PUGI__SCANWHILE(X) { while (X) ++s; }
+	#define PUGI__SCANWHILE_UNROLL(X) { for (;;) { char_t ss = s[0]; if (PUGI__UNLIKELY(!(X))) { break; } ss = s[1]; if (PUGI__UNLIKELY(!(X))) { s += 1; break; } ss = s[2]; if (PUGI__UNLIKELY(!(X))) { s += 2; break; } ss = s[3]; if (PUGI__UNLIKELY(!(X))) { s += 3; break; } s += 4; } }
+	#define PUGI__ENDSEG() { ch = *s; *s = 0; ++s; }
+	#define PUGI__THROW_ERROR(err, m) return error_offset = m, error_status = err, static_cast<char_t*>(0)
+	#define PUGI__CHECK_ERROR(err, m) { if (*s == 0) PUGI__THROW_ERROR(err, m); }
+
+	PUGI__FN char_t* strconv_comment(char_t* s, char_t endch)
+	{
+		gap g;
+		
+		while (true)
+		{
+			PUGI__SCANWHILE_UNROLL(!PUGI__IS_CHARTYPE(ss, ct_parse_comment));
+		
+			if (*s == '\r') // Either a single 0x0d or 0x0d 0x0a pair
+			{
+				*s++ = '\n'; // replace first one with 0x0a
+				
+				if (*s == '\n') g.push(s, 1);
+			}
+			else if (s[0] == '-' && s[1] == '-' && PUGI__ENDSWITH(s[2], '>')) // comment ends here
+			{
+				*g.flush(s) = 0;
+				
+				return s + (s[2] == '>' ? 3 : 2);
+			}
+			else if (*s == 0)
+			{
+				return 0;
+			}
+			else ++s;
+		}
+	}
+
+	PUGI__FN char_t* strconv_cdata(char_t* s, char_t endch)
+	{
+		gap g;
+			
+		while (true)
+		{
+			PUGI__SCANWHILE_UNROLL(!PUGI__IS_CHARTYPE(ss, ct_parse_cdata));
+			
+			if (*s == '\r') // Either a single 0x0d or 0x0d 0x0a pair
+			{
+				*s++ = '\n'; // replace first one with 0x0a
+				
+				if (*s == '\n') g.push(s, 1);
+			}
+			else if (s[0] == ']' && s[1] == ']' && PUGI__ENDSWITH(s[2], '>')) // CDATA ends here
+			{
+				*g.flush(s) = 0;
+				
+				return s + 1;
+			}
+			else if (*s == 0)
+			{
+				return 0;
+			}
+			else ++s;
+		}
+	}
+	
+	typedef char_t* (*strconv_pcdata_t)(char_t*);
+		
+	template <typename opt_trim, typename opt_eol, typename opt_escape> struct strconv_pcdata_impl
+	{
+		static char_t* parse(char_t* s)
+		{
+			gap g;
+
+			char_t* begin = s;
+
+			while (true)
+			{
+				PUGI__SCANWHILE_UNROLL(!PUGI__IS_CHARTYPE(ss, ct_parse_pcdata));
+
+				if (*s == '<') // PCDATA ends here
+				{
+					char_t* end = g.flush(s);
+
+					if (opt_trim::value)
+						while (end > begin && PUGI__IS_CHARTYPE(end[-1], ct_space))
+							--end;
+
+					*end = 0;
+					
+					return s + 1;
+				}
+				else if (opt_eol::value && *s == '\r') // Either a single 0x0d or 0x0d 0x0a pair
+				{
+					*s++ = '\n'; // replace first one with 0x0a
+					
+					if (*s == '\n') g.push(s, 1);
+				}
+				else if (opt_escape::value && *s == '&')
+				{
+					s = strconv_escape(s, g);
+				}
+				else if (*s == 0)
+				{
+					char_t* end = g.flush(s);
+
+					if (opt_trim::value)
+						while (end > begin && PUGI__IS_CHARTYPE(end[-1], ct_space))
+							--end;
+
+					*end = 0;
+
+					return s;
+				}
+				else ++s;
+			}
+		}
+	};
+	
+	PUGI__FN strconv_pcdata_t get_strconv_pcdata(unsigned int optmask)
+	{
+		PUGI__STATIC_ASSERT(parse_escapes == 0x10 && parse_eol == 0x20 && parse_trim_pcdata == 0x0800);
+
+		switch (((optmask >> 4) & 3) | ((optmask >> 9) & 4)) // get bitmask for flags (eol escapes trim)
+		{
+		case 0: return strconv_pcdata_impl<opt_false, opt_false, opt_false>::parse;
+		case 1: return strconv_pcdata_impl<opt_false, opt_false, opt_true>::parse;
+		case 2: return strconv_pcdata_impl<opt_false, opt_true, opt_false>::parse;
+		case 3: return strconv_pcdata_impl<opt_false, opt_true, opt_true>::parse;
+		case 4: return strconv_pcdata_impl<opt_true, opt_false, opt_false>::parse;
+		case 5: return strconv_pcdata_impl<opt_true, opt_false, opt_true>::parse;
+		case 6: return strconv_pcdata_impl<opt_true, opt_true, opt_false>::parse;
+		case 7: return strconv_pcdata_impl<opt_true, opt_true, opt_true>::parse;
+		default: assert(false); return 0; // should not get here
+		}
+	}
+
+	typedef char_t* (*strconv_attribute_t)(char_t*, char_t);
+	
+	template <typename opt_escape> struct strconv_attribute_impl
+	{
+		static char_t* parse_wnorm(char_t* s, char_t end_quote)
+		{
+			gap g;
+
+			// trim leading whitespaces
+			if (PUGI__IS_CHARTYPE(*s, ct_space))
+			{
+				char_t* str = s;
+				
+				do ++str;
+				while (PUGI__IS_CHARTYPE(*str, ct_space));
+				
+				g.push(s, str - s);
+			}
+
+			while (true)
+			{
+				PUGI__SCANWHILE_UNROLL(!PUGI__IS_CHARTYPE(ss, ct_parse_attr_ws | ct_space));
+				
+				if (*s == end_quote)
+				{
+					char_t* str = g.flush(s);
+					
+					do *str-- = 0;
+					while (PUGI__IS_CHARTYPE(*str, ct_space));
+				
+					return s + 1;
+				}
+				else if (PUGI__IS_CHARTYPE(*s, ct_space))
+				{
+					*s++ = ' ';
+		
+					if (PUGI__IS_CHARTYPE(*s, ct_space))
+					{
+						char_t* str = s + 1;
+						while (PUGI__IS_CHARTYPE(*str, ct_space)) ++str;
+						
+						g.push(s, str - s);
+					}
+				}
+				else if (opt_escape::value && *s == '&')
+				{
+					s = strconv_escape(s, g);
+				}
+				else if (!*s)
+				{
+					return 0;
+				}
+				else ++s;
+			}
+		}
+
+		static char_t* parse_wconv(char_t* s, char_t end_quote)
+		{
+			gap g;
+
+			while (true)
+			{
+				PUGI__SCANWHILE_UNROLL(!PUGI__IS_CHARTYPE(ss, ct_parse_attr_ws));
+				
+				if (*s == end_quote)
+				{
+					*g.flush(s) = 0;
+				
+					return s + 1;
+				}
+				else if (PUGI__IS_CHARTYPE(*s, ct_space))
+				{
+					if (*s == '\r')
+					{
+						*s++ = ' ';
+				
+						if (*s == '\n') g.push(s, 1);
+					}
+					else *s++ = ' ';
+				}
+				else if (opt_escape::value && *s == '&')
+				{
+					s = strconv_escape(s, g);
+				}
+				else if (!*s)
+				{
+					return 0;
+				}
+				else ++s;
+			}
+		}
+
+		static char_t* parse_eol(char_t* s, char_t end_quote)
+		{
+			gap g;
+
+			while (true)
+			{
+				PUGI__SCANWHILE_UNROLL(!PUGI__IS_CHARTYPE(ss, ct_parse_attr));
+				
+				if (*s == end_quote)
+				{
+					*g.flush(s) = 0;
+				
+					return s + 1;
+				}
+				else if (*s == '\r')
+				{
+					*s++ = '\n';
+					
+					if (*s == '\n') g.push(s, 1);
+				}
+				else if (opt_escape::value && *s == '&')
+				{
+					s = strconv_escape(s, g);
+				}
+				else if (!*s)
+				{
+					return 0;
+				}
+				else ++s;
+			}
+		}
+
+		static char_t* parse_simple(char_t* s, char_t end_quote)
+		{
+			gap g;
+
+			while (true)
+			{
+				PUGI__SCANWHILE_UNROLL(!PUGI__IS_CHARTYPE(ss, ct_parse_attr));
+				
+				if (*s == end_quote)
+				{
+					*g.flush(s) = 0;
+				
+					return s + 1;
+				}
+				else if (opt_escape::value && *s == '&')
+				{
+					s = strconv_escape(s, g);
+				}
+				else if (!*s)
+				{
+					return 0;
+				}
+				else ++s;
+			}
+		}
+	};
+
+	PUGI__FN strconv_attribute_t get_strconv_attribute(unsigned int optmask)
+	{
+		PUGI__STATIC_ASSERT(parse_escapes == 0x10 && parse_eol == 0x20 && parse_wconv_attribute == 0x40 && parse_wnorm_attribute == 0x80);
+		
+		switch ((optmask >> 4) & 15) // get bitmask for flags (wconv wnorm eol escapes)
+		{
+		case 0: return strconv_attribute_impl<opt_false>::parse_simple;
+		case 1: return strconv_attribute_impl<opt_true>::parse_simple;
+		case 2: return strconv_attribute_impl<opt_false>::parse_eol;
+		case 3: return strconv_attribute_impl<opt_true>::parse_eol;
+		case 4: return strconv_attribute_impl<opt_false>::parse_wconv;
+		case 5: return strconv_attribute_impl<opt_true>::parse_wconv;
+		case 6: return strconv_attribute_impl<opt_false>::parse_wconv;
+		case 7: return strconv_attribute_impl<opt_true>::parse_wconv;
+		case 8: return strconv_attribute_impl<opt_false>::parse_wnorm;
+		case 9: return strconv_attribute_impl<opt_true>::parse_wnorm;
+		case 10: return strconv_attribute_impl<opt_false>::parse_wnorm;
+		case 11: return strconv_attribute_impl<opt_true>::parse_wnorm;
+		case 12: return strconv_attribute_impl<opt_false>::parse_wnorm;
+		case 13: return strconv_attribute_impl<opt_true>::parse_wnorm;
+		case 14: return strconv_attribute_impl<opt_false>::parse_wnorm;
+		case 15: return strconv_attribute_impl<opt_true>::parse_wnorm;
+		default: assert(false); return 0; // should not get here
+		}
+	}
+
+	inline xml_parse_result make_parse_result(xml_parse_status status, ptrdiff_t offset = 0)
+	{
+		xml_parse_result result;
+		result.status = status;
+		result.offset = offset;
+
+		return result;
+	}
+
+	struct xml_parser
+	{
+		xml_allocator alloc;
+		xml_allocator* alloc_state;
+		char_t* error_offset;
+		xml_parse_status error_status;
+		
+		xml_parser(xml_allocator* alloc_): alloc(*alloc_), alloc_state(alloc_), error_offset(0), error_status(status_ok)
+		{
+		}
+
+		~xml_parser()
+		{
+			*alloc_state = alloc;
+		}
+
+		// DOCTYPE consists of nested sections of the following possible types:
+		// , <? ... ?>, "...", '...'
+		// <![...]]>
+		// <!...>
+		// First group can not contain nested groups
+		// Second group can contain nested groups of the same type
+		// Third group can contain all other groups
+		char_t* parse_doctype_primitive(char_t* s)
+		{
+			if (*s == '"' || *s == '\'')
+			{
+				// quoted string
+				char_t ch = *s++;
+				PUGI__SCANFOR(*s == ch);
+				if (!*s) PUGI__THROW_ERROR(status_bad_doctype, s);
+
+				s++;
+			}
+			else if (s[0] == '<' && s[1] == '?')
+			{
+				// <? ... ?>
+				s += 2;
+				PUGI__SCANFOR(s[0] == '?' && s[1] == '>'); // no need for ENDSWITH because ?> can't terminate proper doctype
+				if (!*s) PUGI__THROW_ERROR(status_bad_doctype, s);
+
+				s += 2;
+			}
+			else if (s[0] == '<' && s[1] == '!' && s[2] == '-' && s[3] == '-')
+			{
+				s += 4;
+				PUGI__SCANFOR(s[0] == '-' && s[1] == '-' && s[2] == '>'); // no need for ENDSWITH because --> can't terminate proper doctype
+				if (!*s) PUGI__THROW_ERROR(status_bad_doctype, s);
+
+				s += 3;
+			}
+			else PUGI__THROW_ERROR(status_bad_doctype, s);
+
+			return s;
+		}
+
+		char_t* parse_doctype_ignore(char_t* s)
+		{
+			size_t depth = 0;
+
+			assert(s[0] == '<' && s[1] == '!' && s[2] == '[');
+			s += 3;
+
+			while (*s)
+			{
+				if (s[0] == '<' && s[1] == '!' && s[2] == '[')
+				{
+					// nested ignore section
+					s += 3;
+					depth++;
+				}
+				else if (s[0] == ']' && s[1] == ']' && s[2] == '>')
+				{
+					// ignore section end
+					s += 3;
+
+					if (depth == 0)
+						return s;
+
+					depth--;
+				}
+				else s++;
+			}
+
+			PUGI__THROW_ERROR(status_bad_doctype, s);
+		}
+
+		char_t* parse_doctype_group(char_t* s, char_t endch)
+		{
+			size_t depth = 0;
+
+			assert((s[0] == '<' || s[0] == 0) && s[1] == '!');
+			s += 2;
+
+			while (*s)
+			{
+				if (s[0] == '<' && s[1] == '!' && s[2] != '-')
+				{
+					if (s[2] == '[')
+					{
+						// ignore
+						s = parse_doctype_ignore(s);
+						if (!s) return s;
+					}
+					else
+					{
+						// some control group
+						s += 2;
+						depth++;
+					}
+				}
+				else if (s[0] == '<' || s[0] == '"' || s[0] == '\'')
+				{
+					// unknown tag (forbidden), or some primitive group
+					s = parse_doctype_primitive(s);
+					if (!s) return s;
+				}
+				else if (*s == '>')
+				{
+					if (depth == 0)
+						return s;
+
+					depth--;
+					s++;
+				}
+				else s++;
+			}
+
+			if (depth != 0 || endch != '>') PUGI__THROW_ERROR(status_bad_doctype, s);
+
+			return s;
+		}
+
+		char_t* parse_exclamation(char_t* s, xml_node_struct* cursor, unsigned int optmsk, char_t endch)
+		{
+			// parse node contents, starting with exclamation mark
+			++s;
+
+			if (*s == '-') // '<!-...'
+			{
+				++s;
+
+				if (*s == '-') // ''.
+						PUGI__SCANFOR(s[0] == '-' && s[1] == '-' && PUGI__ENDSWITH(s[2], '>'));
+						PUGI__CHECK_ERROR(status_bad_comment, s);
+
+						if (PUGI__OPTSET(parse_comments))
+							*s = 0; // Zero-terminate this segment at the first terminating '-'.
+
+						s += (s[2] == '>' ? 3 : 2); // Step over the '\0->'.
+					}
+				}
+				else PUGI__THROW_ERROR(status_bad_comment, s);
+			}
+			else if (*s == '[')
+			{
+				// '<![CDATA[...'
+// flash xml doesn't require CDATA in uppercase
+#ifdef PUGIXML_LIGHTSPARK_MODE
+				if (toupper(*++s)=='C' && toupper(*++s)=='D' && toupper(*++s)=='A' && toupper(*++s)=='T' && toupper(*++s)=='A' && *++s == '[')
+#else
+				if (*++s=='C' && *++s=='D' && *++s=='A' && *++s=='T' && *++s=='A' && *++s == '[')
+#endif
+				{
+					++s;
+
+					if (PUGI__OPTSET(parse_cdata))
+					{
+						PUGI__PUSHNODE(node_cdata); // Append a new node on the tree.
+						cursor->value = s; // Save the offset.
+
+						if (PUGI__OPTSET(parse_eol))
+						{
+							s = strconv_cdata(s, endch);
+
+							if (!s) PUGI__THROW_ERROR(status_bad_cdata, cursor->value);
+						}
+						else
+						{
+							// Scan for terminating ']]>'.
+							PUGI__SCANFOR(s[0] == ']' && s[1] == ']' && PUGI__ENDSWITH(s[2], '>'));
+							PUGI__CHECK_ERROR(status_bad_cdata, s);
+
+							*s++ = 0; // Zero-terminate this segment.
+						}
+					}
+					else // Flagged for discard, but we still have to scan for the terminator.
+					{
+						// Scan for terminating ']]>'.
+						PUGI__SCANFOR(s[0] == ']' && s[1] == ']' && PUGI__ENDSWITH(s[2], '>'));
+						PUGI__CHECK_ERROR(status_bad_cdata, s);
+
+						++s;
+					}
+
+					s += (s[1] == '>' ? 2 : 1); // Step over the last ']>'.
+				}
+				else PUGI__THROW_ERROR(status_bad_cdata, s);
+			}
+// flash xml doesn't require DOCTYPE in uppercase
+#ifdef PUGIXML_LIGHTSPARK_MODE
+			else if (toupper(s[0]) == 'D' && toupper(s[1]) == 'O' && toupper(s[2]) == 'C' && toupper(s[3]) == 'T' && toupper(s[4]) == 'Y' && toupper(s[5]) == 'P' && PUGI__ENDSWITH(toupper(s[6]), 'E'))
+#else
+			else if (s[0] == 'D' && s[1] == 'O' && s[2] == 'C' && s[3] == 'T' && s[4] == 'Y' && s[5] == 'P' && PUGI__ENDSWITH(s[6], 'E'))
+#endif
+			{
+				s -= 2;
+
+				if (cursor->parent) PUGI__THROW_ERROR(status_bad_doctype, s);
+
+				char_t* mark = s + 9;
+
+				s = parse_doctype_group(s, endch);
+				if (!s) return s;
+
+				assert((*s == 0 && endch == '>') || *s == '>');
+				if (*s) *s++ = 0;
+
+				if (PUGI__OPTSET(parse_doctype))
+				{
+					while (PUGI__IS_CHARTYPE(*mark, ct_space)) ++mark;
+
+					PUGI__PUSHNODE(node_doctype);
+
+					cursor->value = mark;
+				}
+			}
+			else if (*s == 0 && endch == '-') PUGI__THROW_ERROR(status_bad_comment, s);
+			else if (*s == 0 && endch == '[') PUGI__THROW_ERROR(status_bad_cdata, s);
+			else PUGI__THROW_ERROR(status_unrecognized_tag, s);
+
+			return s;
+		}
+
+		char_t* parse_question(char_t* s, xml_node_struct*& ref_cursor, unsigned int optmsk, char_t endch)
+		{
+			// load into registers
+			xml_node_struct* cursor = ref_cursor;
+			char_t ch = 0;
+
+			// parse node contents, starting with question mark
+			++s;
+
+			// read PI target
+			char_t* target = s;
+
+// flash xml allows PI with whitespace after <?
+#ifndef PUGIXML_LIGHTSPARK_MODE
+			if (!PUGI__IS_CHARTYPE(*s, ct_start_symbol)) PUGI__THROW_ERROR(status_bad_pi, s);
+#endif
+
+			PUGI__SCANWHILE(PUGI__IS_CHARTYPE(*s, ct_symbol));
+			PUGI__CHECK_ERROR(status_bad_pi, s);
+
+			// determine node type; stricmp / strcasecmp is not portable
+			bool declaration = (target[0] | ' ') == 'x' && (target[1] | ' ') == 'm' && (target[2] | ' ') == 'l' && target + 3 == s;
+
+			if (declaration ? PUGI__OPTSET(parse_declaration) : PUGI__OPTSET(parse_pi))
+			{
+				if (declaration)
+				{
+// flash xml allows decleration in child nodes
+#ifndef PUGIXML_LIGHTSPARK_MODE
+					// disallow non top-level declarations
+					if (cursor->parent) PUGI__THROW_ERROR(status_bad_pi, s);
+#endif
+					PUGI__PUSHNODE(node_declaration);
+				}
+				else
+				{
+					PUGI__PUSHNODE(node_pi);
+				}
+
+				cursor->name = target;
+
+				PUGI__ENDSEG();
+
+				// parse value/attributes
+				if (ch == '?')
+				{
+					// empty node
+					if (!PUGI__ENDSWITH(*s, '>')) PUGI__THROW_ERROR(status_bad_pi, s);
+					s += (*s == '>');
+
+					PUGI__POPNODE();
+				}
+				else if (PUGI__IS_CHARTYPE(ch, ct_space))
+				{
+					PUGI__SKIPWS();
+
+					// scan for tag end
+					char_t* value = s;
+
+					PUGI__SCANFOR(s[0] == '?' && PUGI__ENDSWITH(s[1], '>'));
+					PUGI__CHECK_ERROR(status_bad_pi, s);
+
+					if (declaration)
+					{
+						// replace ending ? with / so that 'element' terminates properly
+						*s = '/';
+
+						// we exit from this function with cursor at node_declaration, which is a signal to parse() to go to LOC_ATTRIBUTES
+						s = value;
+					}
+					else
+					{
+						// store value and step over >
+						cursor->value = value;
+
+						PUGI__POPNODE();
+
+						PUGI__ENDSEG();
+
+						s += (*s == '>');
+					}
+				}
+				else PUGI__THROW_ERROR(status_bad_pi, s);
+			}
+			else
+			{
+				// scan for tag end
+				PUGI__SCANFOR(s[0] == '?' && PUGI__ENDSWITH(s[1], '>'));
+				PUGI__CHECK_ERROR(status_bad_pi, s);
+
+				s += (s[1] == '>' ? 2 : 1);
+			}
+
+			// store from registers
+			ref_cursor = cursor;
+
+			return s;
+		}
+
+		char_t* parse_tree(char_t* s, xml_node_struct* root, unsigned int optmsk, char_t endch)
+		{
+			strconv_attribute_t strconv_attribute = get_strconv_attribute(optmsk);
+			strconv_pcdata_t strconv_pcdata = get_strconv_pcdata(optmsk);
+			
+			char_t ch = 0;
+			xml_node_struct* cursor = root;
+			char_t* mark = s;
+
+			while (*s != 0)
+			{
+				if (*s == '<')
+				{
+					++s;
+
+				LOC_TAG:
+					if (PUGI__IS_CHARTYPE(*s, ct_start_symbol)) // '<#...'
+					{
+						PUGI__PUSHNODE(node_element); // Append a new node to the tree.
+
+						cursor->name = s;
+
+						PUGI__SCANWHILE_UNROLL(PUGI__IS_CHARTYPE(ss, ct_symbol)); // Scan for a terminator.
+						PUGI__ENDSEG(); // Save char in 'ch', terminate & step over.
+
+						if (ch == '>')
+						{
+							// end of tag
+						}
+						else if (PUGI__IS_CHARTYPE(ch, ct_space))
+						{
+						LOC_ATTRIBUTES:
+							while (true)
+							{
+								PUGI__SKIPWS(); // Eat any whitespace.
+						
+								if (PUGI__IS_CHARTYPE(*s, ct_start_symbol)) // <... #...
+								{
+									xml_attribute_struct* a = append_new_attribute(cursor, alloc); // Make space for this attribute.
+									if (!a) PUGI__THROW_ERROR(status_out_of_memory, s);
+
+									a->name = s; // Save the offset.
+
+									PUGI__SCANWHILE_UNROLL(PUGI__IS_CHARTYPE(ss, ct_symbol)); // Scan for a terminator.
+									PUGI__ENDSEG(); // Save char in 'ch', terminate & step over.
+
+									if (PUGI__IS_CHARTYPE(ch, ct_space))
+									{
+										PUGI__SKIPWS(); // Eat any whitespace.
+
+										ch = *s;
+										++s;
+									}
+									
+									if (ch == '=') // '<... #=...'
+									{
+										PUGI__SKIPWS(); // Eat any whitespace.
+
+										if (*s == '"' || *s == '\'') // '<... #="...'
+										{
+											ch = *s; // Save quote char to avoid breaking on "''" -or- '""'.
+											++s; // Step over the quote.
+											a->value = s; // Save the offset.
+
+											s = strconv_attribute(s, ch);
+										
+											if (!s) PUGI__THROW_ERROR(status_bad_attribute, a->value);
+
+											// After this line the loop continues from the start;
+											// Whitespaces, / and > are ok, symbols and EOF are wrong,
+											// everything else will be detected
+// flash xml allows next attribute without whitespace
+#ifndef PUGIXML_LIGHTSPARK_MODE 
+											if (PUGI__IS_CHARTYPE(*s, ct_start_symbol)) PUGI__THROW_ERROR(status_bad_attribute, s);
+#endif
+										}
+										else PUGI__THROW_ERROR(status_bad_attribute, s);
+									}
+									else PUGI__THROW_ERROR(status_bad_attribute, s);
+								}
+								else if (*s == '/')
+								{
+									++s;
+									
+									if (*s == '>')
+									{
+										PUGI__POPNODE();
+										s++;
+										break;
+									}
+									else if (*s == 0 && endch == '>')
+									{
+										PUGI__POPNODE();
+										break;
+									}
+									else PUGI__THROW_ERROR(status_bad_start_element, s);
+								}
+								else if (*s == '>')
+								{
+									++s;
+
+									break;
+								}
+								else if (*s == 0 && endch == '>')
+								{
+									break;
+								}
+								else PUGI__THROW_ERROR(status_bad_start_element, s);
+							}
+
+							// !!!
+						}
+						else if (ch == '/') // '<#.../'
+						{
+							if (!PUGI__ENDSWITH(*s, '>')) PUGI__THROW_ERROR(status_bad_start_element, s);
+
+							PUGI__POPNODE(); // Pop.
+
+							s += (*s == '>');
+						}
+						else if (ch == 0)
+						{
+							// we stepped over null terminator, backtrack & handle closing tag
+							--s;
+							
+							if (endch != '>') PUGI__THROW_ERROR(status_bad_start_element, s);
+						}
+						else PUGI__THROW_ERROR(status_bad_start_element, s);
+					}
+					else if (*s == '/')
+					{
+						++s;
+
+						char_t* name = cursor->name;
+						if (!name) PUGI__THROW_ERROR(status_end_element_mismatch, s);
+						
+						while (PUGI__IS_CHARTYPE(*s, ct_symbol))
+						{
+							if (*s++ != *name++) PUGI__THROW_ERROR(status_end_element_mismatch, s);
+						}
+
+						if (*name)
+						{
+							if (*s == 0 && name[0] == endch && name[1] == 0) PUGI__THROW_ERROR(status_bad_end_element, s);
+							else PUGI__THROW_ERROR(status_end_element_mismatch, s);
+						}
+							
+						PUGI__POPNODE(); // Pop.
+
+						PUGI__SKIPWS();
+
+						if (*s == 0)
+						{
+							if (endch != '>') PUGI__THROW_ERROR(status_bad_end_element, s);
+						}
+						else
+						{
+							if (*s != '>') PUGI__THROW_ERROR(status_bad_end_element, s);
+							++s;
+						}
+					}
+					else if (*s == '?') // '<?...'
+					{
+						s = parse_question(s, cursor, optmsk, endch);
+						if (!s) return s;
+
+						assert(cursor);
+						if (PUGI__NODETYPE(cursor) == node_declaration) goto LOC_ATTRIBUTES;
+					}
+					else if (*s == '!') // '<!...'
+					{
+						s = parse_exclamation(s, cursor, optmsk, endch);
+						if (!s) return s;
+					}
+					else if (*s == 0 && endch == '?') PUGI__THROW_ERROR(status_bad_pi, s);
+					else PUGI__THROW_ERROR(status_unrecognized_tag, s);
+				}
+				else
+				{
+					mark = s; // Save this offset while searching for a terminator.
+
+					PUGI__SKIPWS(); // Eat whitespace if no genuine PCDATA here.
+
+					if (*s == '<' || !*s)
+					{
+						// We skipped some whitespace characters because otherwise we would take the tag branch instead of PCDATA one
+						assert(mark != s);
+
+						if (!PUGI__OPTSET(parse_ws_pcdata | parse_ws_pcdata_single) || PUGI__OPTSET(parse_trim_pcdata))
+						{
+							continue;
+						}
+						else if (PUGI__OPTSET(parse_ws_pcdata_single))
+						{
+							if (s[0] != '<' || s[1] != '/' || cursor->first_child) continue;
+						}
+					}
+
+					if (!PUGI__OPTSET(parse_trim_pcdata))
+						s = mark;
+							
+					if (cursor->parent || PUGI__OPTSET(parse_fragment))
+					{
+						PUGI__PUSHNODE(node_pcdata); // Append a new node on the tree.
+						cursor->value = s; // Save the offset.
+
+						s = strconv_pcdata(s);
+								
+						PUGI__POPNODE(); // Pop since this is a standalone.
+						
+						if (!*s) break;
+					}
+					else
+					{
+						PUGI__SCANFOR(*s == '<'); // '...<'
+						if (!*s) break;
+						
+						++s;
+					}
+
+					// We're after '<'
+					goto LOC_TAG;
+				}
+			}
+
+			// check that last tag is closed
+			if (cursor != root) PUGI__THROW_ERROR(status_end_element_mismatch, s);
+
+			return s;
+		}
+
+	#ifdef PUGIXML_WCHAR_MODE
+		static char_t* parse_skip_bom(char_t* s)
+		{
+			unsigned int bom = 0xfeff;
+			return (s[0] == static_cast<wchar_t>(bom)) ? s + 1 : s;
+		}
+	#else
+		static char_t* parse_skip_bom(char_t* s)
+		{
+			return (s[0] == '\xef' && s[1] == '\xbb' && s[2] == '\xbf') ? s + 3 : s;
+		}
+	#endif
+
+		static bool has_element_node_siblings(xml_node_struct* node)
+		{
+			while (node)
+			{
+				if (PUGI__NODETYPE(node) == node_element) return true;
+
+				node = node->next_sibling;
+			}
+
+			return false;
+		}
+
+		static xml_parse_result parse(char_t* buffer, size_t length, xml_document_struct* xmldoc, xml_node_struct* root, unsigned int optmsk)
+		{
+			// early-out for empty documents
+			if (length == 0)
+				return make_parse_result(PUGI__OPTSET(parse_fragment) ? status_ok : status_no_document_element);
+
+			// get last child of the root before parsing
+			xml_node_struct* last_root_child = root->first_child ? root->first_child->prev_sibling_c + 0 : 0;
+	
+			// create parser on stack
+			xml_parser parser(static_cast<xml_allocator*>(xmldoc));
+
+			// save last character and make buffer zero-terminated (speeds up parsing)
+			char_t endch = buffer[length - 1];
+			buffer[length - 1] = 0;
+			
+			// skip BOM to make sure it does not end up as part of parse output
+			char_t* buffer_data = parse_skip_bom(buffer);
+
+			// perform actual parsing
+			parser.parse_tree(buffer_data, root, optmsk, endch);
+
+			xml_parse_result result = make_parse_result(parser.error_status, parser.error_offset ? parser.error_offset - buffer : 0);
+			assert(result.offset >= 0 && static_cast<size_t>(result.offset) <= length);
+
+			if (result)
+			{
+				// since we removed last character, we have to handle the only possible false positive (stray <)
+				if (endch == '<')
+					return make_parse_result(status_unrecognized_tag, length - 1);
+
+				// check if there are any element nodes parsed
+				xml_node_struct* first_root_child_parsed = last_root_child ? last_root_child->next_sibling + 0 : root->first_child;
+
+				if (!PUGI__OPTSET(parse_fragment) && !has_element_node_siblings(first_root_child_parsed))
+					return make_parse_result(status_no_document_element, length - 1);
+			}
+			else
+			{
+				// roll back offset if it occurs on a null terminator in the source buffer
+				if (result.offset > 0 && static_cast<size_t>(result.offset) == length - 1 && endch == 0)
+					result.offset--;
+			}
+
+			return result;
+		}
+	};
+
+	// Output facilities
+	PUGI__FN xml_encoding get_write_native_encoding()
+	{
+	#ifdef PUGIXML_WCHAR_MODE
+		return get_wchar_encoding();
+	#else
+		return encoding_utf8;
+	#endif
+	}
+
+	PUGI__FN xml_encoding get_write_encoding(xml_encoding encoding)
+	{
+		// replace wchar encoding with utf implementation
+		if (encoding == encoding_wchar) return get_wchar_encoding();
+
+		// replace utf16 encoding with utf16 with specific endianness
+		if (encoding == encoding_utf16) return is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+
+		// replace utf32 encoding with utf32 with specific endianness
+		if (encoding == encoding_utf32) return is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+
+		// only do autodetection if no explicit encoding is requested
+		if (encoding != encoding_auto) return encoding;
+
+		// assume utf8 encoding
+		return encoding_utf8;
+	}
+
+#ifdef PUGIXML_WCHAR_MODE
+	PUGI__FN size_t get_valid_length(const char_t* data, size_t length)
+	{
+		if (length < 1) return 0;
+
+		// discard last character if it's the lead of a surrogate pair 
+		return (sizeof(wchar_t) == 2 && static_cast<unsigned int>(static_cast<uint16_t>(data[length - 1]) - 0xD800) < 0x400) ? length - 1 : length;
+	}
+
+	PUGI__FN size_t convert_buffer_output(char_t* r_char, uint8_t* r_u8, uint16_t* r_u16, uint32_t* r_u32, const char_t* data, size_t length, xml_encoding encoding)
+	{
+		// only endian-swapping is required
+		if (need_endian_swap_utf(encoding, get_wchar_encoding()))
+		{
+			convert_wchar_endian_swap(r_char, data, length);
+
+			return length * sizeof(char_t);
+		}
+	
+		// convert to utf8
+		if (encoding == encoding_utf8)
+		{
+			uint8_t* dest = r_u8;
+			uint8_t* end = utf_decoder<utf8_writer>::decode_wchar_block(data, length, dest);
+
+			return static_cast<size_t>(end - dest);
+		}
+
+		// convert to utf16
+		if (encoding == encoding_utf16_be || encoding == encoding_utf16_le)
+		{
+			uint16_t* dest = r_u16;
+
+			// convert to native utf16
+			uint16_t* end = utf_decoder<utf16_writer>::decode_wchar_block(data, length, dest);
+
+			// swap if necessary
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+
+			if (native_encoding != encoding) convert_utf_endian_swap(dest, dest, static_cast<size_t>(end - dest));
+
+			return static_cast<size_t>(end - dest) * sizeof(uint16_t);
+		}
+
+		// convert to utf32
+		if (encoding == encoding_utf32_be || encoding == encoding_utf32_le)
+		{
+			uint32_t* dest = r_u32;
+
+			// convert to native utf32
+			uint32_t* end = utf_decoder<utf32_writer>::decode_wchar_block(data, length, dest);
+
+			// swap if necessary
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+
+			if (native_encoding != encoding) convert_utf_endian_swap(dest, dest, static_cast<size_t>(end - dest));
+
+			return static_cast<size_t>(end - dest) * sizeof(uint32_t);
+		}
+
+		// convert to latin1
+		if (encoding == encoding_latin1)
+		{
+			uint8_t* dest = r_u8;
+			uint8_t* end = utf_decoder<latin1_writer>::decode_wchar_block(data, length, dest);
+
+			return static_cast<size_t>(end - dest);
+		}
+
+		assert(!"Invalid encoding");
+		return 0;
+	}
+#else
+	PUGI__FN size_t get_valid_length(const char_t* data, size_t length)
+	{
+		if (length < 5) return 0;
+
+		for (size_t i = 1; i <= 4; ++i)
+		{
+			uint8_t ch = static_cast<uint8_t>(data[length - i]);
+
+			// either a standalone character or a leading one
+			if ((ch & 0xc0) != 0x80) return length - i;
+		}
+
+		// there are four non-leading characters at the end, sequence tail is broken so might as well process the whole chunk
+		return length;
+	}
+
+	PUGI__FN size_t convert_buffer_output(char_t* /* r_char */, uint8_t* r_u8, uint16_t* r_u16, uint32_t* r_u32, const char_t* data, size_t length, xml_encoding encoding)
+	{
+		if (encoding == encoding_utf16_be || encoding == encoding_utf16_le)
+		{
+			uint16_t* dest = r_u16;
+
+			// convert to native utf16
+			uint16_t* end = utf_decoder<utf16_writer>::decode_utf8_block(reinterpret_cast<const uint8_t*>(data), length, dest);
+
+			// swap if necessary
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf16_le : encoding_utf16_be;
+
+			if (native_encoding != encoding) convert_utf_endian_swap(dest, dest, static_cast<size_t>(end - dest));
+
+			return static_cast<size_t>(end - dest) * sizeof(uint16_t);
+		}
+
+		if (encoding == encoding_utf32_be || encoding == encoding_utf32_le)
+		{
+			uint32_t* dest = r_u32;
+
+			// convert to native utf32
+			uint32_t* end = utf_decoder<utf32_writer>::decode_utf8_block(reinterpret_cast<const uint8_t*>(data), length, dest);
+
+			// swap if necessary
+			xml_encoding native_encoding = is_little_endian() ? encoding_utf32_le : encoding_utf32_be;
+
+			if (native_encoding != encoding) convert_utf_endian_swap(dest, dest, static_cast<size_t>(end - dest));
+
+			return static_cast<size_t>(end - dest) * sizeof(uint32_t);
+		}
+
+		if (encoding == encoding_latin1)
+		{
+			uint8_t* dest = r_u8;
+			uint8_t* end = utf_decoder<latin1_writer>::decode_utf8_block(reinterpret_cast<const uint8_t*>(data), length, dest);
+
+			return static_cast<size_t>(end - dest);
+		}
+
+		assert(!"Invalid encoding");
+		return 0;
+	}
+#endif
+
+	class xml_buffered_writer
+	{
+		xml_buffered_writer(const xml_buffered_writer&);
+		xml_buffered_writer& operator=(const xml_buffered_writer&);
+
+	public:
+		xml_buffered_writer(xml_writer& writer_, xml_encoding user_encoding): writer(writer_), bufsize(0), encoding(get_write_encoding(user_encoding))
+		{
+			PUGI__STATIC_ASSERT(bufcapacity >= 8);
+		}
+
+		size_t flush()
+		{
+			flush(buffer, bufsize);
+			bufsize = 0;
+			return 0;
+		}
+
+		void flush(const char_t* data, size_t size)
+		{
+			if (size == 0) return;
+
+			// fast path, just write data
+			if (encoding == get_write_native_encoding())
+				writer.write(data, size * sizeof(char_t));
+			else
+			{
+				// convert chunk
+				size_t result = convert_buffer_output(scratch.data_char, scratch.data_u8, scratch.data_u16, scratch.data_u32, data, size, encoding);
+				assert(result <= sizeof(scratch));
+
+				// write data
+				writer.write(scratch.data_u8, result);
+			}
+		}
+
+		void write_direct(const char_t* data, size_t length)
+		{
+			// flush the remaining buffer contents
+			flush();
+
+			// handle large chunks
+			if (length > bufcapacity)
+			{
+				if (encoding == get_write_native_encoding())
+				{
+					// fast path, can just write data chunk
+					writer.write(data, length * sizeof(char_t));
+					return;
+				}
+
+				// need to convert in suitable chunks
+				while (length > bufcapacity)
+				{
+					// get chunk size by selecting such number of characters that are guaranteed to fit into scratch buffer
+					// and form a complete codepoint sequence (i.e. discard start of last codepoint if necessary)
+					size_t chunk_size = get_valid_length(data, bufcapacity);
+					assert(chunk_size);
+
+					// convert chunk and write
+					flush(data, chunk_size);
+
+					// iterate
+					data += chunk_size;
+					length -= chunk_size;
+				}
+
+				// small tail is copied below
+				bufsize = 0;
+			}
+
+			memcpy(buffer + bufsize, data, length * sizeof(char_t));
+			bufsize += length;
+		}
+
+		void write_buffer(const char_t* data, size_t length)
+		{
+			size_t offset = bufsize;
+
+			if (offset + length <= bufcapacity)
+			{
+				memcpy(buffer + offset, data, length * sizeof(char_t));
+				bufsize = offset + length;
+			}
+			else
+			{
+				write_direct(data, length);
+			}
+		}
+
+		void write_string(const char_t* data)
+		{
+			// write the part of the string that fits in the buffer
+			size_t offset = bufsize;
+
+			while (*data && offset < bufcapacity)
+				buffer[offset++] = *data++;
+
+			// write the rest
+			if (offset < bufcapacity)
+			{
+				bufsize = offset;
+			}
+			else
+			{
+				// backtrack a bit if we have split the codepoint
+				size_t length = offset - bufsize;
+				size_t extra = length - get_valid_length(data - length, length);
+
+				bufsize = offset - extra;
+
+				write_direct(data - extra, strlength(data) + extra);
+			}
+		}
+
+		void write(char_t d0)
+		{
+			size_t offset = bufsize;
+			if (offset > bufcapacity - 1) offset = flush();
+
+			buffer[offset + 0] = d0;
+			bufsize = offset + 1;
+		}
+
+		void write(char_t d0, char_t d1)
+		{
+			size_t offset = bufsize;
+			if (offset > bufcapacity - 2) offset = flush();
+
+			buffer[offset + 0] = d0;
+			buffer[offset + 1] = d1;
+			bufsize = offset + 2;
+		}
+
+		void write(char_t d0, char_t d1, char_t d2)
+		{
+			size_t offset = bufsize;
+			if (offset > bufcapacity - 3) offset = flush();
+
+			buffer[offset + 0] = d0;
+			buffer[offset + 1] = d1;
+			buffer[offset + 2] = d2;
+			bufsize = offset + 3;
+		}
+
+		void write(char_t d0, char_t d1, char_t d2, char_t d3)
+		{
+			size_t offset = bufsize;
+			if (offset > bufcapacity - 4) offset = flush();
+
+			buffer[offset + 0] = d0;
+			buffer[offset + 1] = d1;
+			buffer[offset + 2] = d2;
+			buffer[offset + 3] = d3;
+			bufsize = offset + 4;
+		}
+
+		void write(char_t d0, char_t d1, char_t d2, char_t d3, char_t d4)
+		{
+			size_t offset = bufsize;
+			if (offset > bufcapacity - 5) offset = flush();
+
+			buffer[offset + 0] = d0;
+			buffer[offset + 1] = d1;
+			buffer[offset + 2] = d2;
+			buffer[offset + 3] = d3;
+			buffer[offset + 4] = d4;
+			bufsize = offset + 5;
+		}
+
+		void write(char_t d0, char_t d1, char_t d2, char_t d3, char_t d4, char_t d5)
+		{
+			size_t offset = bufsize;
+			if (offset > bufcapacity - 6) offset = flush();
+
+			buffer[offset + 0] = d0;
+			buffer[offset + 1] = d1;
+			buffer[offset + 2] = d2;
+			buffer[offset + 3] = d3;
+			buffer[offset + 4] = d4;
+			buffer[offset + 5] = d5;
+			bufsize = offset + 6;
+		}
+
+		// utf8 maximum expansion: x4 (-> utf32)
+		// utf16 maximum expansion: x2 (-> utf32)
+		// utf32 maximum expansion: x1
+		enum
+		{
+			bufcapacitybytes =
+			#ifdef PUGIXML_MEMORY_OUTPUT_STACK
+				PUGIXML_MEMORY_OUTPUT_STACK
+			#else
+				10240
+			#endif
+			,
+			bufcapacity = bufcapacitybytes / (sizeof(char_t) + 4)
+		};
+
+		char_t buffer[bufcapacity];
+
+		union
+		{
+			uint8_t data_u8[4 * bufcapacity];
+			uint16_t data_u16[2 * bufcapacity];
+			uint32_t data_u32[bufcapacity];
+			char_t data_char[bufcapacity];
+		} scratch;
+
+		xml_writer& writer;
+		size_t bufsize;
+		xml_encoding encoding;
+	};
+
+	PUGI__FN void text_output_escaped(xml_buffered_writer& writer, const char_t* s, chartypex_t type)
+	{
+		while (*s)
+		{
+			const char_t* prev = s;
+			
+			// While *s is a usual symbol
+			PUGI__SCANWHILE_UNROLL(!PUGI__IS_CHARTYPEX(ss, type));
+		
+			writer.write_buffer(prev, static_cast<size_t>(s - prev));
+
+			switch (*s)
+			{
+				case 0: break;
+				case '&':
+					writer.write('&', 'a', 'm', 'p', ';');
+					++s;
+					break;
+				case '<':
+					writer.write('&', 'l', 't', ';');
+					++s;
+					break;
+				case '>':
+					writer.write('&', 'g', 't', ';');
+					++s;
+					break;
+				case '"':
+					writer.write('&', 'q', 'u', 'o', 't', ';');
+					++s;
+					break;
+				default: // s is not a usual symbol
+				{
+					unsigned int ch = static_cast<unsigned int>(*s++);
+					assert(ch < 32);
+
+					writer.write('&', '#', static_cast<char_t>((ch / 10) + '0'), static_cast<char_t>((ch % 10) + '0'), ';');
+				}
+			}
+		}
+	}
+
+	PUGI__FN void text_output(xml_buffered_writer& writer, const char_t* s, chartypex_t type, unsigned int flags)
+	{
+		if (flags & format_no_escapes)
+			writer.write_string(s);
+		else
+			text_output_escaped(writer, s, type);
+	}
+
+	PUGI__FN void text_output_cdata(xml_buffered_writer& writer, const char_t* s)
+	{
+		do
+		{
+			writer.write('<', '!', '[', 'C', 'D');
+			writer.write('A', 'T', 'A', '[');
+
+			const char_t* prev = s;
+
+			// look for ]]> sequence - we can't output it as is since it terminates CDATA
+			while (*s && !(s[0] == ']' && s[1] == ']' && s[2] == '>')) ++s;
+
+			// skip ]] if we stopped at ]]>, > will go to the next CDATA section
+			if (*s) s += 2;
+
+			writer.write_buffer(prev, static_cast<size_t>(s - prev));
+
+			writer.write(']', ']', '>');
+		}
+		while (*s);
+	}
+
+	PUGI__FN void text_output_indent(xml_buffered_writer& writer, const char_t* indent, size_t indent_length, unsigned int depth)
+	{
+		switch (indent_length)
+		{
+		case 1:
+		{
+			for (unsigned int i = 0; i < depth; ++i)
+				writer.write(indent[0]);
+			break;
+		}
+
+		case 2:
+		{
+			for (unsigned int i = 0; i < depth; ++i)
+				writer.write(indent[0], indent[1]);
+			break;
+		}
+
+		case 3:
+		{
+			for (unsigned int i = 0; i < depth; ++i)
+				writer.write(indent[0], indent[1], indent[2]);
+			break;
+		}
+
+		case 4:
+		{
+			for (unsigned int i = 0; i < depth; ++i)
+				writer.write(indent[0], indent[1], indent[2], indent[3]);
+			break;
+		}
+
+		default:
+		{
+			for (unsigned int i = 0; i < depth; ++i)
+				writer.write_buffer(indent, indent_length);
+		}
+		}
+	}
+
+	PUGI__FN void node_output_comment(xml_buffered_writer& writer, const char_t* s)
+	{
+		writer.write('<', '!', '-', '-');
+
+		while (*s)
+		{
+			const char_t* prev = s;
+
+			// look for -\0 or -- sequence - we can't output it since -- is illegal in comment body
+			while (*s && !(s[0] == '-' && (s[1] == '-' || s[1] == 0))) ++s;
+
+			writer.write_buffer(prev, static_cast<size_t>(s - prev));
+
+			if (*s)
+			{
+				assert(*s == '-');
+
+				writer.write('-', ' ');
+				++s;
+			}
+		}
+
+		writer.write('-', '-', '>');
+	}
+
+	PUGI__FN void node_output_pi_value(xml_buffered_writer& writer, const char_t* s)
+	{
+		while (*s)
+		{
+			const char_t* prev = s;
+
+			// look for ?> sequence - we can't output it since ?> terminates PI
+			while (*s && !(s[0] == '?' && s[1] == '>')) ++s;
+
+			writer.write_buffer(prev, static_cast<size_t>(s - prev));
+
+			if (*s)
+			{
+				assert(s[0] == '?' && s[1] == '>');
+
+				writer.write('?', ' ', '>');
+				s += 2;
+			}
+		}
+	}
+
+	PUGI__FN void node_output_attributes(xml_buffered_writer& writer, xml_node_struct* node, const char_t* indent, size_t indent_length, unsigned int flags, unsigned int depth)
+	{
+		const char_t* default_name = PUGIXML_TEXT(":anonymous");
+
+		for (xml_attribute_struct* a = node->first_attribute; a; a = a->next_attribute)
+		{
+			if ((flags & (format_indent_attributes | format_raw)) == format_indent_attributes)
+			{
+				writer.write('\n');
+
+				text_output_indent(writer, indent, indent_length, depth + 1);
+			}
+			else
+			{
+				writer.write(' ');
+			}
+
+			writer.write_string(a->name ? a->name : default_name);
+			writer.write('=', '"');
+
+			if (a->value)
+				text_output(writer, a->value, ctx_special_attr, flags);
+
+			writer.write('"');
+		}
+	}
+
+	PUGI__FN bool node_output_start(xml_buffered_writer& writer, xml_node_struct* node, const char_t* indent, size_t indent_length, unsigned int flags, unsigned int depth)
+	{
+		const char_t* default_name = PUGIXML_TEXT(":anonymous");
+		const char_t* name = node->name ? node->name : default_name;
+
+		writer.write('<');
+		writer.write_string(name);
+
+		if (node->first_attribute)
+			node_output_attributes(writer, node, indent, indent_length, flags, depth);
+
+		if (!node->first_child)
+		{
+			writer.write(' ', '/', '>');
+
+			return false;
+		}
+		else
+		{
+			writer.write('>');
+
+			return true;
+		}
+	}
+
+	PUGI__FN void node_output_end(xml_buffered_writer& writer, xml_node_struct* node)
+	{
+		const char_t* default_name = PUGIXML_TEXT(":anonymous");
+		const char_t* name = node->name ? node->name : default_name;
+
+		writer.write('<', '/');
+		writer.write_string(name);
+		writer.write('>');
+	}
+
+	PUGI__FN void node_output_simple(xml_buffered_writer& writer, xml_node_struct* node, unsigned int flags)
+	{
+		const char_t* default_name = PUGIXML_TEXT(":anonymous");
+
+		switch (PUGI__NODETYPE(node))
+		{
+			case node_pcdata:
+				text_output(writer, node->value ? node->value + 0 : PUGIXML_TEXT(""), ctx_special_pcdata, flags);
+				break;
+
+			case node_cdata:
+				text_output_cdata(writer, node->value ? node->value + 0 : PUGIXML_TEXT(""));
+				break;
+
+			case node_comment:
+				node_output_comment(writer, node->value ? node->value + 0 : PUGIXML_TEXT(""));
+				break;
+
+			case node_pi:
+				writer.write('<', '?');
+				writer.write_string(node->name ? node->name : default_name);
+
+				if (node->value)
+				{
+					writer.write(' ');
+					node_output_pi_value(writer, node->value);
+				}
+
+				writer.write('?', '>');
+				break;
+
+			case node_declaration:
+				writer.write('<', '?');
+				writer.write_string(node->name ? node->name : default_name);
+				node_output_attributes(writer, node, PUGIXML_TEXT(""), 0, flags | format_raw, 0);
+				writer.write('?', '>');
+				break;
+
+			case node_doctype:
+				writer.write('<', '!', 'D', 'O', 'C');
+				writer.write('T', 'Y', 'P', 'E');
+
+				if (node->value)
+				{
+					writer.write(' ');
+					writer.write_string(node->value);
+				}
+
+				writer.write('>');
+				break;
+
+			default:
+				assert(!"Invalid node type");
+		}
+	}
+
+	enum indent_flags_t
+	{
+		indent_newline = 1,
+		indent_indent = 2
+	};
+
+	PUGI__FN void node_output(xml_buffered_writer& writer, xml_node_struct* root, const char_t* indent, unsigned int flags, unsigned int depth)
+	{
+		size_t indent_length = ((flags & (format_indent | format_indent_attributes)) && (flags & format_raw) == 0) ? strlength(indent) : 0;
+		unsigned int indent_flags = indent_indent;
+
+		xml_node_struct* node = root;
+
+		do
+		{
+			assert(node);
+
+			// begin writing current node
+			if (PUGI__NODETYPE(node) == node_pcdata || PUGI__NODETYPE(node) == node_cdata)
+			{
+				node_output_simple(writer, node, flags);
+
+				indent_flags = 0;
+			}
+			else
+			{
+				if ((indent_flags & indent_newline) && (flags & format_raw) == 0)
+					writer.write('\n');
+
+				if ((indent_flags & indent_indent) && indent_length)
+					text_output_indent(writer, indent, indent_length, depth);
+
+				if (PUGI__NODETYPE(node) == node_element)
+				{
+					indent_flags = indent_newline | indent_indent;
+
+					if (node_output_start(writer, node, indent, indent_length, flags, depth))
+					{
+						node = node->first_child;
+						depth++;
+						continue;
+					}
+				}
+				else if (PUGI__NODETYPE(node) == node_document)
+				{
+					indent_flags = indent_indent;
+
+					if (node->first_child)
+					{
+						node = node->first_child;
+						continue;
+					}
+				}
+				else
+				{
+					node_output_simple(writer, node, flags);
+
+					indent_flags = indent_newline | indent_indent;
+				}
+			}
+
+			// continue to the next node
+			while (node != root)
+			{
+				if (node->next_sibling)
+				{
+					node = node->next_sibling;
+					break;
+				}
+
+				node = node->parent;
+
+				// write closing node
+				if (PUGI__NODETYPE(node) == node_element)
+				{
+					depth--;
+
+					if ((indent_flags & indent_newline) && (flags & format_raw) == 0)
+						writer.write('\n');
+
+					if ((indent_flags & indent_indent) && indent_length)
+						text_output_indent(writer, indent, indent_length, depth);
+
+					node_output_end(writer, node);
+
+					indent_flags = indent_newline | indent_indent;
+				}
+			}
+		}
+		while (node != root);
+
+		if ((indent_flags & indent_newline) && (flags & format_raw) == 0)
+			writer.write('\n');
+	}
+
+	PUGI__FN bool has_declaration(xml_node_struct* node)
+	{
+		for (xml_node_struct* child = node->first_child; child; child = child->next_sibling)
+		{
+			xml_node_type type = PUGI__NODETYPE(child);
+
+			if (type == node_declaration) return true;
+			if (type == node_element) return false;
+		}
+
+		return false;
+	}
+
+	PUGI__FN bool is_attribute_of(xml_attribute_struct* attr, xml_node_struct* node)
+	{
+		for (xml_attribute_struct* a = node->first_attribute; a; a = a->next_attribute)
+			if (a == attr)
+				return true;
+
+		return false;
+	}
+
+	PUGI__FN bool allow_insert_attribute(xml_node_type parent)
+	{
+		return parent == node_element || parent == node_declaration;
+	}
+
+	PUGI__FN bool allow_insert_child(xml_node_type parent, xml_node_type child)
+	{
+		if (parent != node_document && parent != node_element) return false;
+		if (child == node_document || child == node_null) return false;
+		if (parent != node_document && (child == node_declaration || child == node_doctype)) return false;
+
+		return true;
+	}
+
+	PUGI__FN bool allow_move(xml_node parent, xml_node child)
+	{
+		// check that child can be a child of parent
+		if (!allow_insert_child(parent.type(), child.type()))
+			return false;
+
+		// check that node is not moved between documents
+		if (parent.root() != child.root())
+			return false;
+
+		// check that new parent is not in the child subtree
+		xml_node cur = parent;
+
+		while (cur)
+		{
+			if (cur == child)
+				return false;
+
+			cur = cur.parent();
+		}
+
+		return true;
+	}
+
+	template <typename String, typename Header>
+	PUGI__FN void node_copy_string(String& dest, Header& header, uintptr_t header_mask, char_t* source, Header& source_header, xml_allocator* alloc)
+	{
+		assert(!dest && (header & header_mask) == 0);
+
+		if (source)
+		{
+			if (alloc && (source_header & header_mask) == 0)
+			{
+				dest = source;
+
+				// since strcpy_insitu can reuse document buffer memory we need to mark both source and dest as shared
+				header |= xml_memory_page_contents_shared_mask;
+				source_header |= xml_memory_page_contents_shared_mask;
+			}
+			else
+				strcpy_insitu(dest, header, header_mask, source);
+		}
+	}
+
+	PUGI__FN void node_copy_contents(xml_node_struct* dn, xml_node_struct* sn, xml_allocator* shared_alloc)
+	{
+		node_copy_string(dn->name, dn->header, xml_memory_page_name_allocated_mask, sn->name, sn->header, shared_alloc);
+		node_copy_string(dn->value, dn->header, xml_memory_page_value_allocated_mask, sn->value, sn->header, shared_alloc);
+
+		for (xml_attribute_struct* sa = sn->first_attribute; sa; sa = sa->next_attribute)
+		{
+			xml_attribute_struct* da = append_new_attribute(dn, get_allocator(dn));
+
+			if (da)
+			{
+				node_copy_string(da->name, da->header, xml_memory_page_name_allocated_mask, sa->name, sa->header, shared_alloc);
+				node_copy_string(da->value, da->header, xml_memory_page_value_allocated_mask, sa->value, sa->header, shared_alloc);
+			}
+		}
+	}
+
+	PUGI__FN void node_copy_tree(xml_node_struct* dn, xml_node_struct* sn)
+	{
+		xml_allocator& alloc = get_allocator(dn);
+		xml_allocator* shared_alloc = (&alloc == &get_allocator(sn)) ? &alloc : 0;
+
+		node_copy_contents(dn, sn, shared_alloc);
+
+		xml_node_struct* dit = dn;
+		xml_node_struct* sit = sn->first_child;
+
+		while (sit && sit != sn)
+		{
+			if (sit != dn)
+			{
+				xml_node_struct* copy = append_new_node(dit, alloc, PUGI__NODETYPE(sit));
+
+				if (copy)
+				{
+					node_copy_contents(copy, sit, shared_alloc);
+
+					if (sit->first_child)
+					{
+						dit = copy;
+						sit = sit->first_child;
+						continue;
+					}
+				}
+			}
+
+			// continue to the next node
+			do
+			{
+				if (sit->next_sibling)
+				{
+					sit = sit->next_sibling;
+					break;
+				}
+
+				sit = sit->parent;
+				dit = dit->parent;
+			}
+			while (sit != sn);
+		}
+	}
+
+	PUGI__FN void node_copy_attribute(xml_attribute_struct* da, xml_attribute_struct* sa)
+	{
+		xml_allocator& alloc = get_allocator(da);
+		xml_allocator* shared_alloc = (&alloc == &get_allocator(sa)) ? &alloc : 0;
+
+		node_copy_string(da->name, da->header, xml_memory_page_name_allocated_mask, sa->name, sa->header, shared_alloc);
+		node_copy_string(da->value, da->header, xml_memory_page_value_allocated_mask, sa->value, sa->header, shared_alloc);
+	}
+
+	inline bool is_text_node(xml_node_struct* node)
+	{
+		xml_node_type type = PUGI__NODETYPE(node);
+
+		return type == node_pcdata || type == node_cdata;
+	}
+
+	// get value with conversion functions
+	PUGI__FN int get_integer_base(const char_t* value)
+	{
+		const char_t* s = value;
+
+		while (PUGI__IS_CHARTYPE(*s, ct_space))
+			s++;
+
+		if (*s == '-')
+			s++;
+
+		return (s[0] == '0' && (s[1] == 'x' || s[1] == 'X')) ? 16 : 10;
+	}
+
+	PUGI__FN int get_value_int(const char_t* value)
+	{
+		int base = get_integer_base(value);
+
+	#ifdef PUGIXML_WCHAR_MODE
+		return static_cast<int>(wcstol(value, 0, base));
+	#else
+		return static_cast<int>(strtol(value, 0, base));
+	#endif
+	}
+
+	PUGI__FN unsigned int get_value_uint(const char_t* value)
+	{
+		int base = get_integer_base(value);
+
+	#ifdef PUGIXML_WCHAR_MODE
+		return static_cast<unsigned int>(wcstoul(value, 0, base));
+	#else
+		return static_cast<unsigned int>(strtoul(value, 0, base));
+	#endif
+	}
+
+	PUGI__FN double get_value_double(const char_t* value)
+	{
+	#ifdef PUGIXML_WCHAR_MODE
+		return wcstod(value, 0);
+	#else
+		return strtod(value, 0);
+	#endif
+	}
+
+	PUGI__FN float get_value_float(const char_t* value)
+	{
+	#ifdef PUGIXML_WCHAR_MODE
+		return static_cast<float>(wcstod(value, 0));
+	#else
+		return static_cast<float>(strtod(value, 0));
+	#endif
+	}
+
+	PUGI__FN bool get_value_bool(const char_t* value)
+	{
+		// only look at first char
+		char_t first = *value;
+
+		// 1*, t* (true), T* (True), y* (yes), Y* (YES)
+		return (first == '1' || first == 't' || first == 'T' || first == 'y' || first == 'Y');
+	}
+
+#ifdef PUGIXML_HAS_LONG_LONG
+	PUGI__FN long long get_value_llong(const char_t* value)
+	{
+		int base = get_integer_base(value);
+
+	#ifdef PUGIXML_WCHAR_MODE
+		#ifdef PUGI__MSVC_CRT_VERSION
+			return _wcstoi64(value, 0, base);
+		#else
+			return wcstoll(value, 0, base);
+		#endif
+	#else
+		#ifdef PUGI__MSVC_CRT_VERSION
+			return _strtoi64(value, 0, base);
+		#else
+			return strtoll(value, 0, base);
+		#endif
+	#endif
+	}
+
+	PUGI__FN unsigned long long get_value_ullong(const char_t* value)
+	{
+		int base = get_integer_base(value);
+
+	#ifdef PUGIXML_WCHAR_MODE
+		#ifdef PUGI__MSVC_CRT_VERSION
+			return _wcstoui64(value, 0, base);
+		#else
+			return wcstoull(value, 0, base);
+		#endif
+	#else
+		#ifdef PUGI__MSVC_CRT_VERSION
+			return _strtoui64(value, 0, base);
+		#else
+			return strtoull(value, 0, base);
+		#endif
+	#endif
+	}
+#endif
+
+	// set value with conversion functions
+	template <typename String, typename Header>
+	PUGI__FN bool set_value_buffer(String& dest, Header& header, uintptr_t header_mask, char (&buf)[128])
+	{
+	#ifdef PUGIXML_WCHAR_MODE
+		char_t wbuf[128];
+		impl::widen_ascii(wbuf, buf);
+
+		return strcpy_insitu(dest, header, header_mask, wbuf);
+	#else
+		return strcpy_insitu(dest, header, header_mask, buf);
+	#endif
+	}
+
+	template <typename String, typename Header>
+	PUGI__FN bool set_value_convert(String& dest, Header& header, uintptr_t header_mask, int value)
+	{
+		char buf[128];
+		sprintf(buf, "%d", value);
+	
+		return set_value_buffer(dest, header, header_mask, buf);
+	}
+
+	template <typename String, typename Header>
+	PUGI__FN bool set_value_convert(String& dest, Header& header, uintptr_t header_mask, unsigned int value)
+	{
+		char buf[128];
+		sprintf(buf, "%u", value);
+
+		return set_value_buffer(dest, header, header_mask, buf);
+	}
+
+	template <typename String, typename Header>
+	PUGI__FN bool set_value_convert(String& dest, Header& header, uintptr_t header_mask, float value)
+	{
+		char buf[128];
+		sprintf(buf, "%.9g", value);
+
+		return set_value_buffer(dest, header, header_mask, buf);
+	}
+
+	template <typename String, typename Header>
+	PUGI__FN bool set_value_convert(String& dest, Header& header, uintptr_t header_mask, double value)
+	{
+		char buf[128];
+		sprintf(buf, "%.17g", value);
+
+		return set_value_buffer(dest, header, header_mask, buf);
+	}
+	
+	template <typename String, typename Header>
+	PUGI__FN bool set_value_convert(String& dest, Header& header, uintptr_t header_mask, bool value)
+	{
+		return strcpy_insitu(dest, header, header_mask, value ? PUGIXML_TEXT("true") : PUGIXML_TEXT("false"));
+	}
+
+#ifdef PUGIXML_HAS_LONG_LONG
+	template <typename String, typename Header>
+	PUGI__FN bool set_value_convert(String& dest, Header& header, uintptr_t header_mask, long long value)
+	{
+		char buf[128];
+		sprintf(buf, "%lld", value);
+	
+		return set_value_buffer(dest, header, header_mask, buf);
+	}
+
+	template <typename String, typename Header>
+	PUGI__FN bool set_value_convert(String& dest, Header& header, uintptr_t header_mask, unsigned long long value)
+	{
+		char buf[128];
+		sprintf(buf, "%llu", value);
+	
+		return set_value_buffer(dest, header, header_mask, buf);
+	}
+#endif
+
+	// we need to get length of entire file to load it in memory; the only (relatively) sane way to do it is via seek/tell trick
+	PUGI__FN xml_parse_status get_file_size(FILE* file, size_t& out_result)
+	{
+	#if defined(PUGI__MSVC_CRT_VERSION) && PUGI__MSVC_CRT_VERSION >= 1400 && !defined(_WIN32_WCE)
+		// there are 64-bit versions of fseek/ftell, let's use them
+		typedef __int64 length_type;
+
+		_fseeki64(file, 0, SEEK_END);
+		length_type length = _ftelli64(file);
+		_fseeki64(file, 0, SEEK_SET);
+	#elif defined(__MINGW32__) && !defined(__NO_MINGW_LFS) && (!defined(__STRICT_ANSI__) || defined(__MINGW64_VERSION_MAJOR))
+		// there are 64-bit versions of fseek/ftell, let's use them
+		typedef off64_t length_type;
+
+		fseeko64(file, 0, SEEK_END);
+		length_type length = ftello64(file);
+		fseeko64(file, 0, SEEK_SET);
+	#else
+		// if this is a 32-bit OS, long is enough; if this is a unix system, long is 64-bit, which is enough; otherwise we can't do anything anyway.
+		typedef long length_type;
+
+		fseek(file, 0, SEEK_END);
+		length_type length = ftell(file);
+		fseek(file, 0, SEEK_SET);
+	#endif
+
+		// check for I/O errors
+		if (length < 0) return status_io_error;
+		
+		// check for overflow
+		size_t result = static_cast<size_t>(length);
+
+		if (static_cast<length_type>(result) != length) return status_out_of_memory;
+
+		// finalize
+		out_result = result;
+
+		return status_ok;
+	}
+
+	// This function assumes that buffer has extra sizeof(char_t) writable bytes after size
+	PUGI__FN size_t zero_terminate_buffer(void* buffer, size_t size, xml_encoding encoding) 
+	{
+		// We only need to zero-terminate if encoding conversion does not do it for us
+	#ifdef PUGIXML_WCHAR_MODE
+		xml_encoding wchar_encoding = get_wchar_encoding();
+
+		if (encoding == wchar_encoding || need_endian_swap_utf(encoding, wchar_encoding))
+		{
+			size_t length = size / sizeof(char_t);
+
+			static_cast<char_t*>(buffer)[length] = 0;
+			return (length + 1) * sizeof(char_t);
+		}
+	#else
+		if (encoding == encoding_utf8)
+		{
+			static_cast<char*>(buffer)[size] = 0;
+			return size + 1;
+		}
+	#endif
+
+		return size;
+	}
+
+	PUGI__FN xml_parse_result load_file_impl(xml_document& doc, FILE* file, unsigned int options, xml_encoding encoding)
+	{
+		if (!file) return make_parse_result(status_file_not_found);
+
+		// get file size (can result in I/O errors)
+		size_t size = 0;
+		xml_parse_status size_status = get_file_size(file, size);
+		if (size_status != status_ok) return make_parse_result(size_status);
+		
+		size_t max_suffix_size = sizeof(char_t);
+
+		// allocate buffer for the whole file
+		char* contents = static_cast<char*>(xml_memory::allocate(size + max_suffix_size));
+		if (!contents) return make_parse_result(status_out_of_memory);
+
+		// read file in memory
+		size_t read_size = fread(contents, 1, size, file);
+
+		if (read_size != size)
+		{
+			xml_memory::deallocate(contents);
+			return make_parse_result(status_io_error);
+		}
+
+		xml_encoding real_encoding = get_buffer_encoding(encoding, contents, size);
+		
+		return doc.load_buffer_inplace_own(contents, zero_terminate_buffer(contents, size, real_encoding), options, real_encoding);
+	}
+
+#ifndef PUGIXML_NO_STL
+	template <typename T> struct xml_stream_chunk
+	{
+		static xml_stream_chunk* create()
+		{
+			void* memory = xml_memory::allocate(sizeof(xml_stream_chunk));
+			if (!memory) return 0;
+			
+			return new (memory) xml_stream_chunk();
+		}
+
+		static void destroy(xml_stream_chunk* chunk)
+		{
+			// free chunk chain
+			while (chunk)
+			{
+				xml_stream_chunk* next_ = chunk->next;
+
+				xml_memory::deallocate(chunk);
+
+				chunk = next_;
+			}
+		}
+
+		xml_stream_chunk(): next(0), size(0)
+		{
+		}
+
+		xml_stream_chunk* next;
+		size_t size;
+
+		T data[xml_memory_page_size / sizeof(T)];
+	};
+
+	template <typename T> PUGI__FN xml_parse_status load_stream_data_noseek(std::basic_istream<T>& stream, void** out_buffer, size_t* out_size)
+	{
+		auto_deleter<xml_stream_chunk<T> > chunks(0, xml_stream_chunk<T>::destroy);
+
+		// read file to a chunk list
+		size_t total = 0;
+		xml_stream_chunk<T>* last = 0;
+
+		while (!stream.eof())
+		{
+			// allocate new chunk
+			xml_stream_chunk<T>* chunk = xml_stream_chunk<T>::create();
+			if (!chunk) return status_out_of_memory;
+
+			// append chunk to list
+			if (last) last = last->next = chunk;
+			else chunks.data = last = chunk;
+
+			// read data to chunk
+			stream.read(chunk->data, static_cast<std::streamsize>(sizeof(chunk->data) / sizeof(T)));
+			chunk->size = static_cast<size_t>(stream.gcount()) * sizeof(T);
+
+			// read may set failbit | eofbit in case gcount() is less than read length, so check for other I/O errors
+			if (stream.bad() || (!stream.eof() && stream.fail())) return status_io_error;
+
+			// guard against huge files (chunk size is small enough to make this overflow check work)
+			if (total + chunk->size < total) return status_out_of_memory;
+			total += chunk->size;
+		}
+
+		size_t max_suffix_size = sizeof(char_t);
+
+		// copy chunk list to a contiguous buffer
+		char* buffer = static_cast<char*>(xml_memory::allocate(total + max_suffix_size));
+		if (!buffer) return status_out_of_memory;
+
+		char* write = buffer;
+
+		for (xml_stream_chunk<T>* chunk = chunks.data; chunk; chunk = chunk->next)
+		{
+			assert(write + chunk->size <= buffer + total);
+			memcpy(write, chunk->data, chunk->size);
+			write += chunk->size;
+		}
+
+		assert(write == buffer + total);
+
+		// return buffer
+		*out_buffer = buffer;
+		*out_size = total;
+
+		return status_ok;
+	}
+
+	template <typename T> PUGI__FN xml_parse_status load_stream_data_seek(std::basic_istream<T>& stream, void** out_buffer, size_t* out_size)
+	{
+		// get length of remaining data in stream
+		typename std::basic_istream<T>::pos_type pos = stream.tellg();
+		stream.seekg(0, std::ios::end);
+		std::streamoff length = stream.tellg() - pos;
+		stream.seekg(pos);
+
+		if (stream.fail() || pos < 0) return status_io_error;
+
+		// guard against huge files
+		size_t read_length = static_cast<size_t>(length);
+
+		if (static_cast<std::streamsize>(read_length) != length || length < 0) return status_out_of_memory;
+
+		size_t max_suffix_size = sizeof(char_t);
+
+		// read stream data into memory (guard against stream exceptions with buffer holder)
+		auto_deleter<void> buffer(xml_memory::allocate(read_length * sizeof(T) + max_suffix_size), xml_memory::deallocate);
+		if (!buffer.data) return status_out_of_memory;
+
+		stream.read(static_cast<T*>(buffer.data), static_cast<std::streamsize>(read_length));
+
+		// read may set failbit | eofbit in case gcount() is less than read_length (i.e. line ending conversion), so check for other I/O errors
+		if (stream.bad() || (!stream.eof() && stream.fail())) return status_io_error;
+
+		// return buffer
+		size_t actual_length = static_cast<size_t>(stream.gcount());
+		assert(actual_length <= read_length);
+		
+		*out_buffer = buffer.release();
+		*out_size = actual_length * sizeof(T);
+
+		return status_ok;
+	}
+
+	template <typename T> PUGI__FN xml_parse_result load_stream_impl(xml_document& doc, std::basic_istream<T>& stream, unsigned int options, xml_encoding encoding)
+	{
+		void* buffer = 0;
+		size_t size = 0;
+		xml_parse_status status = status_ok;
+
+		// if stream has an error bit set, bail out (otherwise tellg() can fail and we'll clear error bits)
+		if (stream.fail()) return make_parse_result(status_io_error);
+
+		// load stream to memory (using seek-based implementation if possible, since it's faster and takes less memory)
+		if (stream.tellg() < 0)
+		{
+			stream.clear(); // clear error flags that could be set by a failing tellg
+			status = load_stream_data_noseek(stream, &buffer, &size);
+		}
+		else
+			status = load_stream_data_seek(stream, &buffer, &size);
+
+		if (status != status_ok) return make_parse_result(status);
+
+		xml_encoding real_encoding = get_buffer_encoding(encoding, buffer, size);
+		
+		return doc.load_buffer_inplace_own(buffer, zero_terminate_buffer(buffer, size, real_encoding), options, real_encoding);
+	}
+#endif
+
+#if defined(PUGI__MSVC_CRT_VERSION) || defined(__BORLANDC__) || (defined(__MINGW32__) && (!defined(__STRICT_ANSI__) || defined(__MINGW64_VERSION_MAJOR)))
+	PUGI__FN FILE* open_file_wide(const wchar_t* path, const wchar_t* mode)
+	{
+		return _wfopen(path, mode);
+	}
+#else
+	PUGI__FN char* convert_path_heap(const wchar_t* str)
+	{
+		assert(str);
+
+		// first pass: get length in utf8 characters
+		size_t length = strlength_wide(str);
+		size_t size = as_utf8_begin(str, length);
+
+		// allocate resulting string
+		char* result = static_cast<char*>(xml_memory::allocate(size + 1));
+		if (!result) return 0;
+
+		// second pass: convert to utf8
+		as_utf8_end(result, size, str, length);
+
+		// zero-terminate
+		result[size] = 0;
+
+		return result;
+	}
+
+	PUGI__FN FILE* open_file_wide(const wchar_t* path, const wchar_t* mode)
+	{
+		// there is no standard function to open wide paths, so our best bet is to try utf8 path
+		char* path_utf8 = convert_path_heap(path);
+		if (!path_utf8) return 0;
+
+		// convert mode to ASCII (we mirror _wfopen interface)
+		char mode_ascii[4] = {0};
+		for (size_t i = 0; mode[i]; ++i) mode_ascii[i] = static_cast<char>(mode[i]);
+
+		// try to open the utf8 path
+		FILE* result = fopen(path_utf8, mode_ascii);
+
+		// free dummy buffer
+		xml_memory::deallocate(path_utf8);
+
+		return result;
+	}
+#endif
+
+	PUGI__FN bool save_file_impl(const xml_document& doc, FILE* file, const char_t* indent, unsigned int flags, xml_encoding encoding)
+	{
+		if (!file) return false;
+
+		xml_writer_file writer(file);
+		doc.save(writer, indent, flags, encoding);
+
+		return ferror(file) == 0;
+	}
+
+	PUGI__FN xml_parse_result load_buffer_impl(xml_document_struct* doc, xml_node_struct* root, void* contents, size_t size, unsigned int options, xml_encoding encoding, bool is_mutable, bool own, char_t** out_buffer)
+	{
+		// check input buffer
+		if (!contents && size) return make_parse_result(status_io_error);
+
+		// get actual encoding
+		xml_encoding buffer_encoding = impl::get_buffer_encoding(encoding, contents, size);
+
+		// get private buffer
+		char_t* buffer = 0;
+		size_t length = 0;
+
+		if (!impl::convert_buffer(buffer, length, buffer_encoding, contents, size, is_mutable)) return impl::make_parse_result(status_out_of_memory);
+		
+		// delete original buffer if we performed a conversion
+		if (own && buffer != contents && contents) impl::xml_memory::deallocate(contents);
+
+		// grab onto buffer if it's our buffer, user is responsible for deallocating contents himself
+		if (own || buffer != contents) *out_buffer = buffer;
+
+		// store buffer for offset_debug
+		doc->buffer = buffer;
+
+		// parse
+		xml_parse_result res = impl::xml_parser::parse(buffer, length, doc, root, options);
+
+		// remember encoding
+		res.encoding = buffer_encoding;
+
+		return res;
+	}
+PUGI__NS_END
+
+namespace pugi
+{
+	PUGI__FN xml_writer_file::xml_writer_file(void* file_): file(file_)
+	{
+	}
+
+	PUGI__FN void xml_writer_file::write(const void* data, size_t size)
+	{
+		size_t result = fwrite(data, 1, size, static_cast<FILE*>(file));
+		(void)!result; // unfortunately we can't do proper error handling here
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN xml_writer_stream::xml_writer_stream(std::basic_ostream<char, std::char_traits<char> >& stream): narrow_stream(&stream), wide_stream(0)
+	{
+	}
+
+	PUGI__FN xml_writer_stream::xml_writer_stream(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >& stream): narrow_stream(0), wide_stream(&stream)
+	{
+	}
+
+	PUGI__FN void xml_writer_stream::write(const void* data, size_t size)
+	{
+		if (narrow_stream)
+		{
+			assert(!wide_stream);
+			narrow_stream->write(reinterpret_cast<const char*>(data), static_cast<std::streamsize>(size));
+		}
+		else
+		{
+			assert(wide_stream);
+			assert(size % sizeof(wchar_t) == 0);
+
+			wide_stream->write(reinterpret_cast<const wchar_t*>(data), static_cast<std::streamsize>(size / sizeof(wchar_t)));
+		}
+	}
+#endif
+
+	PUGI__FN xml_tree_walker::xml_tree_walker(): _depth(0)
+	{
+	}
+	
+	PUGI__FN xml_tree_walker::~xml_tree_walker()
+	{
+	}
+
+	PUGI__FN int xml_tree_walker::depth() const
+	{
+		return _depth;
+	}
+
+	PUGI__FN bool xml_tree_walker::begin(xml_node&)
+	{
+		return true;
+	}
+
+	PUGI__FN bool xml_tree_walker::end(xml_node&)
+	{
+		return true;
+	}
+
+	PUGI__FN xml_attribute::xml_attribute(): _attr(0)
+	{
+	}
+
+	PUGI__FN xml_attribute::xml_attribute(xml_attribute_struct* attr): _attr(attr)
+	{
+	}
+
+	PUGI__FN static void unspecified_bool_xml_attribute(xml_attribute***)
+	{
+	}
+
+	PUGI__FN xml_attribute::operator xml_attribute::unspecified_bool_type() const
+	{
+		return _attr ? unspecified_bool_xml_attribute : 0;
+	}
+
+	PUGI__FN bool xml_attribute::operator!() const
+	{
+		return !_attr;
+	}
+
+	PUGI__FN bool xml_attribute::operator==(const xml_attribute& r) const
+	{
+		return (_attr == r._attr);
+	}
+	
+	PUGI__FN bool xml_attribute::operator!=(const xml_attribute& r) const
+	{
+		return (_attr != r._attr);
+	}
+
+	PUGI__FN bool xml_attribute::operator<(const xml_attribute& r) const
+	{
+		return (_attr < r._attr);
+	}
+	
+	PUGI__FN bool xml_attribute::operator>(const xml_attribute& r) const
+	{
+		return (_attr > r._attr);
+	}
+	
+	PUGI__FN bool xml_attribute::operator<=(const xml_attribute& r) const
+	{
+		return (_attr <= r._attr);
+	}
+	
+	PUGI__FN bool xml_attribute::operator>=(const xml_attribute& r) const
+	{
+		return (_attr >= r._attr);
+	}
+
+	PUGI__FN xml_attribute xml_attribute::next_attribute() const
+	{
+		return _attr ? xml_attribute(_attr->next_attribute) : xml_attribute();
+	}
+
+	PUGI__FN xml_attribute xml_attribute::previous_attribute() const
+	{
+		return _attr && _attr->prev_attribute_c->next_attribute ? xml_attribute(_attr->prev_attribute_c) : xml_attribute();
+	}
+
+	PUGI__FN const char_t* xml_attribute::as_string(const char_t* def) const
+	{
+		return (_attr && _attr->value) ? _attr->value : def;
+	}
+
+	PUGI__FN int xml_attribute::as_int(int def) const
+	{
+		return (_attr && _attr->value) ? impl::get_value_int(_attr->value) : def;
+	}
+
+	PUGI__FN unsigned int xml_attribute::as_uint(unsigned int def) const
+	{
+		return (_attr && _attr->value) ? impl::get_value_uint(_attr->value) : def;
+	}
+
+	PUGI__FN double xml_attribute::as_double(double def) const
+	{
+		return (_attr && _attr->value) ? impl::get_value_double(_attr->value) : def;
+	}
+
+	PUGI__FN float xml_attribute::as_float(float def) const
+	{
+		return (_attr && _attr->value) ? impl::get_value_float(_attr->value) : def;
+	}
+
+	PUGI__FN bool xml_attribute::as_bool(bool def) const
+	{
+		return (_attr && _attr->value) ? impl::get_value_bool(_attr->value) : def;
+	}
+
+#ifdef PUGIXML_HAS_LONG_LONG
+	PUGI__FN long long xml_attribute::as_llong(long long def) const
+	{
+		return (_attr && _attr->value) ? impl::get_value_llong(_attr->value) : def;
+	}
+
+	PUGI__FN unsigned long long xml_attribute::as_ullong(unsigned long long def) const
+	{
+		return (_attr && _attr->value) ? impl::get_value_ullong(_attr->value) : def;
+	}
+#endif
+
+	PUGI__FN bool xml_attribute::empty() const
+	{
+		return !_attr;
+	}
+
+	PUGI__FN const char_t* xml_attribute::name() const
+	{
+		return (_attr && _attr->name) ? _attr->name + 0 : PUGIXML_TEXT("");
+	}
+
+	PUGI__FN const char_t* xml_attribute::value() const
+	{
+		return (_attr && _attr->value) ? _attr->value + 0 : PUGIXML_TEXT("");
+	}
+
+	PUGI__FN size_t xml_attribute::hash_value() const
+	{
+		return static_cast<size_t>(reinterpret_cast<uintptr_t>(_attr) / sizeof(xml_attribute_struct));
+	}
+
+	PUGI__FN xml_attribute_struct* xml_attribute::internal_object() const
+	{
+		return _attr;
+	}
+
+	PUGI__FN xml_attribute& xml_attribute::operator=(const char_t* rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+	
+	PUGI__FN xml_attribute& xml_attribute::operator=(int rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_attribute& xml_attribute::operator=(unsigned int rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_attribute& xml_attribute::operator=(double rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+	
+	PUGI__FN xml_attribute& xml_attribute::operator=(float rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_attribute& xml_attribute::operator=(bool rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+
+#ifdef PUGIXML_HAS_LONG_LONG
+	PUGI__FN xml_attribute& xml_attribute::operator=(long long rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_attribute& xml_attribute::operator=(unsigned long long rhs)
+	{
+		set_value(rhs);
+		return *this;
+	}
+#endif
+
+	PUGI__FN bool xml_attribute::set_name(const char_t* rhs)
+	{
+		if (!_attr) return false;
+		
+		return impl::strcpy_insitu(_attr->name, _attr->header, impl::xml_memory_page_name_allocated_mask, rhs);
+	}
+		
+	PUGI__FN bool xml_attribute::set_value(const char_t* rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::strcpy_insitu(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+
+	PUGI__FN bool xml_attribute::set_value(int rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::set_value_convert(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+
+	PUGI__FN bool xml_attribute::set_value(unsigned int rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::set_value_convert(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+
+	PUGI__FN bool xml_attribute::set_value(double rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::set_value_convert(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+	
+	PUGI__FN bool xml_attribute::set_value(float rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::set_value_convert(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+
+	PUGI__FN bool xml_attribute::set_value(bool rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::set_value_convert(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+
+#ifdef PUGIXML_HAS_LONG_LONG
+	PUGI__FN bool xml_attribute::set_value(long long rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::set_value_convert(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+
+	PUGI__FN bool xml_attribute::set_value(unsigned long long rhs)
+	{
+		if (!_attr) return false;
+
+		return impl::set_value_convert(_attr->value, _attr->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+#endif
+
+#ifdef __BORLANDC__
+	PUGI__FN bool operator&&(const xml_attribute& lhs, bool rhs)
+	{
+		return (bool)lhs && rhs;
+	}
+
+	PUGI__FN bool operator||(const xml_attribute& lhs, bool rhs)
+	{
+		return (bool)lhs || rhs;
+	}
+#endif
+
+	PUGI__FN xml_node::xml_node(): _root(0)
+	{
+	}
+
+	PUGI__FN xml_node::xml_node(xml_node_struct* p): _root(p)
+	{
+	}
+	
+	PUGI__FN static void unspecified_bool_xml_node(xml_node***)
+	{
+	}
+
+	PUGI__FN xml_node::operator xml_node::unspecified_bool_type() const
+	{
+		return _root ? unspecified_bool_xml_node : 0;
+	}
+
+	PUGI__FN bool xml_node::operator!() const
+	{
+		return !_root;
+	}
+
+	PUGI__FN xml_node::iterator xml_node::begin() const
+	{
+		return iterator(_root ? _root->first_child + 0 : 0, _root);
+	}
+
+	PUGI__FN xml_node::iterator xml_node::end() const
+	{
+		return iterator(0, _root);
+	}
+	
+	PUGI__FN xml_node::attribute_iterator xml_node::attributes_begin() const
+	{
+		return attribute_iterator(_root ? _root->first_attribute + 0 : 0, _root);
+	}
+
+	PUGI__FN xml_node::attribute_iterator xml_node::attributes_end() const
+	{
+		return attribute_iterator(0, _root);
+	}
+	
+	PUGI__FN xml_object_range<xml_node_iterator> xml_node::children() const
+	{
+		return xml_object_range<xml_node_iterator>(begin(), end());
+	}
+
+	PUGI__FN xml_object_range<xml_named_node_iterator> xml_node::children(const char_t* name_) const
+	{
+		return xml_object_range<xml_named_node_iterator>(xml_named_node_iterator(child(name_)._root, _root, name_), xml_named_node_iterator(0, _root, name_));
+	}
+
+	PUGI__FN xml_object_range<xml_attribute_iterator> xml_node::attributes() const
+	{
+		return xml_object_range<xml_attribute_iterator>(attributes_begin(), attributes_end());
+	}
+
+	PUGI__FN bool xml_node::operator==(const xml_node& r) const
+	{
+		return (_root == r._root);
+	}
+
+	PUGI__FN bool xml_node::operator!=(const xml_node& r) const
+	{
+		return (_root != r._root);
+	}
+
+	PUGI__FN bool xml_node::operator<(const xml_node& r) const
+	{
+		return (_root < r._root);
+	}
+	
+	PUGI__FN bool xml_node::operator>(const xml_node& r) const
+	{
+		return (_root > r._root);
+	}
+	
+	PUGI__FN bool xml_node::operator<=(const xml_node& r) const
+	{
+		return (_root <= r._root);
+	}
+	
+	PUGI__FN bool xml_node::operator>=(const xml_node& r) const
+	{
+		return (_root >= r._root);
+	}
+
+	PUGI__FN bool xml_node::empty() const
+	{
+		return !_root;
+	}
+	
+	PUGI__FN const char_t* xml_node::name() const
+	{
+		return (_root && _root->name) ? _root->name + 0 : PUGIXML_TEXT("");
+	}
+
+	PUGI__FN xml_node_type xml_node::type() const
+	{
+		return _root ? PUGI__NODETYPE(_root) : node_null;
+	}
+	
+	PUGI__FN const char_t* xml_node::value() const
+	{
+		return (_root && _root->value) ? _root->value + 0 : PUGIXML_TEXT("");
+	}
+	
+	PUGI__FN xml_node xml_node::child(const char_t* name_) const
+	{
+		if (!_root) return xml_node();
+
+		for (xml_node_struct* i = _root->first_child; i; i = i->next_sibling)
+			if (i->name && impl::strequal(name_, i->name)) return xml_node(i);
+
+		return xml_node();
+	}
+
+	PUGI__FN xml_attribute xml_node::attribute(const char_t* name_) const
+	{
+		if (!_root) return xml_attribute();
+
+		for (xml_attribute_struct* i = _root->first_attribute; i; i = i->next_attribute)
+			if (i->name && impl::strequal(name_, i->name))
+				return xml_attribute(i);
+		
+		return xml_attribute();
+	}
+	
+	PUGI__FN xml_node xml_node::next_sibling(const char_t* name_) const
+	{
+		if (!_root) return xml_node();
+		
+		for (xml_node_struct* i = _root->next_sibling; i; i = i->next_sibling)
+			if (i->name && impl::strequal(name_, i->name)) return xml_node(i);
+
+		return xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::next_sibling() const
+	{
+		return _root ? xml_node(_root->next_sibling) : xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::previous_sibling(const char_t* name_) const
+	{
+		if (!_root) return xml_node();
+		
+		for (xml_node_struct* i = _root->prev_sibling_c; i->next_sibling; i = i->prev_sibling_c)
+			if (i->name && impl::strequal(name_, i->name)) return xml_node(i);
+
+		return xml_node();
+	}
+
+	PUGI__FN xml_attribute xml_node::attribute(const char_t* name_, xml_attribute& hint_) const
+	{
+		xml_attribute_struct* hint = hint_._attr;
+
+		// if hint is not an attribute of node, behavior is not defined
+		assert(!hint || (_root && impl::is_attribute_of(hint, _root)));
+
+		if (!_root) return xml_attribute();
+
+		// optimistically search from hint up until the end
+		for (xml_attribute_struct* i = hint; i; i = i->next_attribute)
+			if (i->name && impl::strequal(name_, i->name))
+			{
+				// update hint to maximize efficiency of searching for consecutive attributes
+				hint_._attr = i->next_attribute;
+
+				return xml_attribute(i);
+			}
+
+		// wrap around and search from the first attribute until the hint
+		// 'j' null pointer check is technically redundant, but it prevents a crash in case the assertion above fails
+		for (xml_attribute_struct* j = _root->first_attribute; j && j != hint; j = j->next_attribute)
+			if (j->name && impl::strequal(name_, j->name))
+			{
+				// update hint to maximize efficiency of searching for consecutive attributes
+				hint_._attr = j->next_attribute;
+
+				return xml_attribute(j);
+			}
+
+		return xml_attribute();
+	}
+
+	PUGI__FN xml_node xml_node::previous_sibling() const
+	{
+		if (!_root) return xml_node();
+		
+		if (_root->prev_sibling_c->next_sibling) return xml_node(_root->prev_sibling_c);
+		else return xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::parent() const
+	{
+		return _root ? xml_node(_root->parent) : xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::root() const
+	{
+		return _root ? xml_node(&impl::get_document(_root)) : xml_node();
+	}
+
+	PUGI__FN xml_text xml_node::text() const
+	{
+		return xml_text(_root);
+	}
+
+	PUGI__FN const char_t* xml_node::child_value() const
+	{
+		if (!_root) return PUGIXML_TEXT("");
+		
+		for (xml_node_struct* i = _root->first_child; i; i = i->next_sibling)
+			if (impl::is_text_node(i) && i->value)
+				return i->value;
+
+		return PUGIXML_TEXT("");
+	}
+
+	PUGI__FN const char_t* xml_node::child_value(const char_t* name_) const
+	{
+		return child(name_).child_value();
+	}
+
+	PUGI__FN xml_attribute xml_node::first_attribute() const
+	{
+		return _root ? xml_attribute(_root->first_attribute) : xml_attribute();
+	}
+
+	PUGI__FN xml_attribute xml_node::last_attribute() const
+	{
+		return _root && _root->first_attribute ? xml_attribute(_root->first_attribute->prev_attribute_c) : xml_attribute();
+	}
+
+	PUGI__FN xml_node xml_node::first_child() const
+	{
+		return _root ? xml_node(_root->first_child) : xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::last_child() const
+	{
+		return _root && _root->first_child ? xml_node(_root->first_child->prev_sibling_c) : xml_node();
+	}
+
+	PUGI__FN bool xml_node::set_name(const char_t* rhs)
+	{
+		static const bool has_name[] = { false, false, true, false, false, false, true, true, false };
+
+		if (!_root || !has_name[PUGI__NODETYPE(_root)])
+			return false;
+
+		return impl::strcpy_insitu(_root->name, _root->header, impl::xml_memory_page_name_allocated_mask, rhs);
+	}
+		
+	PUGI__FN bool xml_node::set_value(const char_t* rhs)
+	{
+		static const bool has_value[] = { false, false, false, true, true, true, true, false, true };
+
+		if (!_root || !has_value[PUGI__NODETYPE(_root)])
+			return false;
+
+		return impl::strcpy_insitu(_root->value, _root->header, impl::xml_memory_page_value_allocated_mask, rhs);
+	}
+
+	PUGI__FN xml_attribute xml_node::append_attribute(const char_t* name_)
+	{
+		if (!impl::allow_insert_attribute(type())) return xml_attribute();
+		
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_attribute();
+
+		xml_attribute a(impl::allocate_attribute(alloc));
+		if (!a) return xml_attribute();
+
+		impl::append_attribute(a._attr, _root);
+
+		a.set_name(name_);
+		
+		return a;
+	}
+
+	PUGI__FN xml_attribute xml_node::prepend_attribute(const char_t* name_)
+	{
+		if (!impl::allow_insert_attribute(type())) return xml_attribute();
+		
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_attribute();
+
+		xml_attribute a(impl::allocate_attribute(alloc));
+		if (!a) return xml_attribute();
+
+		impl::prepend_attribute(a._attr, _root);
+
+		a.set_name(name_);
+
+		return a;
+	}
+
+	PUGI__FN xml_attribute xml_node::insert_attribute_after(const char_t* name_, const xml_attribute& attr)
+	{
+		if (!impl::allow_insert_attribute(type())) return xml_attribute();
+		if (!attr || !impl::is_attribute_of(attr._attr, _root)) return xml_attribute();
+		
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_attribute();
+
+		xml_attribute a(impl::allocate_attribute(alloc));
+		if (!a) return xml_attribute();
+
+		impl::insert_attribute_after(a._attr, attr._attr, _root);
+
+		a.set_name(name_);
+
+		return a;
+	}
+
+	PUGI__FN xml_attribute xml_node::insert_attribute_before(const char_t* name_, const xml_attribute& attr)
+	{
+		if (!impl::allow_insert_attribute(type())) return xml_attribute();
+		if (!attr || !impl::is_attribute_of(attr._attr, _root)) return xml_attribute();
+		
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_attribute();
+
+		xml_attribute a(impl::allocate_attribute(alloc));
+		if (!a) return xml_attribute();
+
+		impl::insert_attribute_before(a._attr, attr._attr, _root);
+
+		a.set_name(name_);
+
+		return a;
+	}
+
+	PUGI__FN xml_attribute xml_node::append_copy(const xml_attribute& proto)
+	{
+		if (!proto) return xml_attribute();
+		if (!impl::allow_insert_attribute(type())) return xml_attribute();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_attribute();
+
+		xml_attribute a(impl::allocate_attribute(alloc));
+		if (!a) return xml_attribute();
+
+		impl::append_attribute(a._attr, _root);
+		impl::node_copy_attribute(a._attr, proto._attr);
+
+		return a;
+	}
+
+	PUGI__FN xml_attribute xml_node::prepend_copy(const xml_attribute& proto)
+	{
+		if (!proto) return xml_attribute();
+		if (!impl::allow_insert_attribute(type())) return xml_attribute();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_attribute();
+
+		xml_attribute a(impl::allocate_attribute(alloc));
+		if (!a) return xml_attribute();
+
+		impl::prepend_attribute(a._attr, _root);
+		impl::node_copy_attribute(a._attr, proto._attr);
+
+		return a;
+	}
+
+	PUGI__FN xml_attribute xml_node::insert_copy_after(const xml_attribute& proto, const xml_attribute& attr)
+	{
+		if (!proto) return xml_attribute();
+		if (!impl::allow_insert_attribute(type())) return xml_attribute();
+		if (!attr || !impl::is_attribute_of(attr._attr, _root)) return xml_attribute();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_attribute();
+
+		xml_attribute a(impl::allocate_attribute(alloc));
+		if (!a) return xml_attribute();
+
+		impl::insert_attribute_after(a._attr, attr._attr, _root);
+		impl::node_copy_attribute(a._attr, proto._attr);
+
+		return a;
+	}
+
+	PUGI__FN xml_attribute xml_node::insert_copy_before(const xml_attribute& proto, const xml_attribute& attr)
+	{
+		if (!proto) return xml_attribute();
+		if (!impl::allow_insert_attribute(type())) return xml_attribute();
+		if (!attr || !impl::is_attribute_of(attr._attr, _root)) return xml_attribute();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_attribute();
+
+		xml_attribute a(impl::allocate_attribute(alloc));
+		if (!a) return xml_attribute();
+
+		impl::insert_attribute_before(a._attr, attr._attr, _root);
+		impl::node_copy_attribute(a._attr, proto._attr);
+
+		return a;
+	}
+
+	PUGI__FN xml_node xml_node::append_child(xml_node_type type_)
+	{
+		if (!impl::allow_insert_child(type(), type_)) return xml_node();
+		
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_node();
+
+		xml_node n(impl::allocate_node(alloc, type_));
+		if (!n) return xml_node();
+
+		impl::append_node(n._root, _root);
+
+		if (type_ == node_declaration) n.set_name(PUGIXML_TEXT("xml"));
+
+		return n;
+	}
+
+	PUGI__FN xml_node xml_node::prepend_child(xml_node_type type_)
+	{
+		if (!impl::allow_insert_child(type(), type_)) return xml_node();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_node();
+		
+		xml_node n(impl::allocate_node(alloc, type_));
+		if (!n) return xml_node();
+
+		impl::prepend_node(n._root, _root);
+				
+		if (type_ == node_declaration) n.set_name(PUGIXML_TEXT("xml"));
+
+		return n;
+	}
+
+	PUGI__FN xml_node xml_node::insert_child_before(xml_node_type type_, const xml_node& node)
+	{
+		if (!impl::allow_insert_child(type(), type_)) return xml_node();
+		if (!node._root || node._root->parent != _root) return xml_node();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_node();
+	
+		xml_node n(impl::allocate_node(alloc, type_));
+		if (!n) return xml_node();
+
+		impl::insert_node_before(n._root, node._root);
+
+		if (type_ == node_declaration) n.set_name(PUGIXML_TEXT("xml"));
+
+		return n;
+	}
+
+	PUGI__FN xml_node xml_node::insert_child_after(xml_node_type type_, const xml_node& node)
+	{
+		if (!impl::allow_insert_child(type(), type_)) return xml_node();
+		if (!node._root || node._root->parent != _root) return xml_node();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_node();
+	
+		xml_node n(impl::allocate_node(alloc, type_));
+		if (!n) return xml_node();
+
+		impl::insert_node_after(n._root, node._root);
+
+		if (type_ == node_declaration) n.set_name(PUGIXML_TEXT("xml"));
+
+		return n;
+	}
+
+	PUGI__FN xml_node xml_node::append_child(const char_t* name_)
+	{
+		xml_node result = append_child(node_element);
+
+		result.set_name(name_);
+
+		return result;
+	}
+
+	PUGI__FN xml_node xml_node::prepend_child(const char_t* name_)
+	{
+		xml_node result = prepend_child(node_element);
+
+		result.set_name(name_);
+
+		return result;
+	}
+
+	PUGI__FN xml_node xml_node::insert_child_after(const char_t* name_, const xml_node& node)
+	{
+		xml_node result = insert_child_after(node_element, node);
+
+		result.set_name(name_);
+
+		return result;
+	}
+
+	PUGI__FN xml_node xml_node::insert_child_before(const char_t* name_, const xml_node& node)
+	{
+		xml_node result = insert_child_before(node_element, node);
+
+		result.set_name(name_);
+
+		return result;
+	}
+
+	PUGI__FN xml_node xml_node::append_copy(const xml_node& proto)
+	{
+		xml_node_type type_ = proto.type();
+		if (!impl::allow_insert_child(type(), type_)) return xml_node();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_node();
+
+		xml_node n(impl::allocate_node(alloc, type_));
+		if (!n) return xml_node();
+
+		impl::append_node(n._root, _root);
+		impl::node_copy_tree(n._root, proto._root);
+
+		return n;
+	}
+
+	PUGI__FN xml_node xml_node::prepend_copy(const xml_node& proto)
+	{
+		xml_node_type type_ = proto.type();
+		if (!impl::allow_insert_child(type(), type_)) return xml_node();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_node();
+
+		xml_node n(impl::allocate_node(alloc, type_));
+		if (!n) return xml_node();
+
+		impl::prepend_node(n._root, _root);
+		impl::node_copy_tree(n._root, proto._root);
+
+		return n;
+	}
+
+	PUGI__FN xml_node xml_node::insert_copy_after(const xml_node& proto, const xml_node& node)
+	{
+		xml_node_type type_ = proto.type();
+		if (!impl::allow_insert_child(type(), type_)) return xml_node();
+		if (!node._root || node._root->parent != _root) return xml_node();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_node();
+
+		xml_node n(impl::allocate_node(alloc, type_));
+		if (!n) return xml_node();
+
+		impl::insert_node_after(n._root, node._root);
+		impl::node_copy_tree(n._root, proto._root);
+
+		return n;
+	}
+
+	PUGI__FN xml_node xml_node::insert_copy_before(const xml_node& proto, const xml_node& node)
+	{
+		xml_node_type type_ = proto.type();
+		if (!impl::allow_insert_child(type(), type_)) return xml_node();
+		if (!node._root || node._root->parent != _root) return xml_node();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_node();
+
+		xml_node n(impl::allocate_node(alloc, type_));
+		if (!n) return xml_node();
+
+		impl::insert_node_before(n._root, node._root);
+		impl::node_copy_tree(n._root, proto._root);
+
+		return n;
+	}
+
+	PUGI__FN xml_node xml_node::append_move(const xml_node& moved)
+	{
+		if (!impl::allow_move(*this, moved)) return xml_node();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_node();
+
+		// disable document_buffer_order optimization since moving nodes around changes document order without changing buffer pointers
+		impl::get_document(_root).header |= impl::xml_memory_page_contents_shared_mask;
+
+		impl::remove_node(moved._root);
+		impl::append_node(moved._root, _root);
+
+		return moved;
+	}
+
+	PUGI__FN xml_node xml_node::prepend_move(const xml_node& moved)
+	{
+		if (!impl::allow_move(*this, moved)) return xml_node();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_node();
+
+		// disable document_buffer_order optimization since moving nodes around changes document order without changing buffer pointers
+		impl::get_document(_root).header |= impl::xml_memory_page_contents_shared_mask;
+
+		impl::remove_node(moved._root);
+		impl::prepend_node(moved._root, _root);
+
+		return moved;
+	}
+
+	PUGI__FN xml_node xml_node::insert_move_after(const xml_node& moved, const xml_node& node)
+	{
+		if (!impl::allow_move(*this, moved)) return xml_node();
+		if (!node._root || node._root->parent != _root) return xml_node();
+		if (moved._root == node._root) return xml_node();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_node();
+
+		// disable document_buffer_order optimization since moving nodes around changes document order without changing buffer pointers
+		impl::get_document(_root).header |= impl::xml_memory_page_contents_shared_mask;
+
+		impl::remove_node(moved._root);
+		impl::insert_node_after(moved._root, node._root);
+
+		return moved;
+	}
+
+	PUGI__FN xml_node xml_node::insert_move_before(const xml_node& moved, const xml_node& node)
+	{
+		if (!impl::allow_move(*this, moved)) return xml_node();
+		if (!node._root || node._root->parent != _root) return xml_node();
+		if (moved._root == node._root) return xml_node();
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return xml_node();
+
+		// disable document_buffer_order optimization since moving nodes around changes document order without changing buffer pointers
+		impl::get_document(_root).header |= impl::xml_memory_page_contents_shared_mask;
+
+		impl::remove_node(moved._root);
+		impl::insert_node_before(moved._root, node._root);
+
+		return moved;
+	}
+
+	PUGI__FN bool xml_node::remove_attribute(const char_t* name_)
+	{
+		return remove_attribute(attribute(name_));
+	}
+
+	PUGI__FN bool xml_node::remove_attribute(const xml_attribute& a)
+	{
+		if (!_root || !a._attr) return false;
+		if (!impl::is_attribute_of(a._attr, _root)) return false;
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return false;
+
+		impl::remove_attribute(a._attr, _root);
+		impl::destroy_attribute(a._attr, alloc);
+
+		return true;
+	}
+
+	PUGI__FN bool xml_node::remove_child(const char_t* name_)
+	{
+		return remove_child(child(name_));
+	}
+
+	PUGI__FN bool xml_node::remove_child(const xml_node& n)
+	{
+		if (!_root || !n._root || n._root->parent != _root) return false;
+
+		impl::xml_allocator& alloc = impl::get_allocator(_root);
+		if (!alloc.reserve()) return false;
+
+		impl::remove_node(n._root);
+		impl::destroy_node(n._root, alloc);
+
+		return true;
+	}
+
+	PUGI__FN xml_parse_result xml_node::append_buffer(const void* contents, size_t size, unsigned int options, xml_encoding encoding)
+	{
+		// append_buffer is only valid for elements/documents
+		if (!impl::allow_insert_child(type(), node_element)) return impl::make_parse_result(status_append_invalid_root);
+
+		// get document node
+		impl::xml_document_struct* doc = &impl::get_document(_root);
+
+		// disable document_buffer_order optimization since in a document with multiple buffers comparing buffer pointers does not make sense
+		doc->header |= impl::xml_memory_page_contents_shared_mask;
+		
+		// get extra buffer element (we'll store the document fragment buffer there so that we can deallocate it later)
+		impl::xml_memory_page* page = 0;
+		impl::xml_extra_buffer* extra = static_cast<impl::xml_extra_buffer*>(doc->allocate_memory(sizeof(impl::xml_extra_buffer), page));
+		(void)page;
+
+		if (!extra) return impl::make_parse_result(status_out_of_memory);
+
+		// add extra buffer to the list
+		extra->buffer = 0;
+		extra->next = doc->extra_buffers;
+		doc->extra_buffers = extra;
+
+		// name of the root has to be NULL before parsing - otherwise closing node mismatches will not be detected at the top level
+		struct name_sentry
+		{
+			xml_node_struct* node;
+			char_t* name;
+
+			~name_sentry() { node->name = name; }
+		};
+
+		name_sentry sentry = { _root, _root->name };
+
+		sentry.node->name = 0;
+
+		return impl::load_buffer_impl(doc, _root, const_cast<void*>(contents), size, options, encoding, false, false, &extra->buffer);
+	}
+
+	PUGI__FN xml_node xml_node::find_child_by_attribute(const char_t* name_, const char_t* attr_name, const char_t* attr_value) const
+	{
+		if (!_root) return xml_node();
+		
+		for (xml_node_struct* i = _root->first_child; i; i = i->next_sibling)
+			if (i->name && impl::strequal(name_, i->name))
+			{
+				for (xml_attribute_struct* a = i->first_attribute; a; a = a->next_attribute)
+					if (a->name && impl::strequal(attr_name, a->name) && impl::strequal(attr_value, a->value ? a->value + 0 : PUGIXML_TEXT("")))
+						return xml_node(i);
+			}
+
+		return xml_node();
+	}
+
+	PUGI__FN xml_node xml_node::find_child_by_attribute(const char_t* attr_name, const char_t* attr_value) const
+	{
+		if (!_root) return xml_node();
+		
+		for (xml_node_struct* i = _root->first_child; i; i = i->next_sibling)
+			for (xml_attribute_struct* a = i->first_attribute; a; a = a->next_attribute)
+				if (a->name && impl::strequal(attr_name, a->name) && impl::strequal(attr_value, a->value ? a->value + 0 : PUGIXML_TEXT("")))
+					return xml_node(i);
+
+		return xml_node();
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN string_t xml_node::path(char_t delimiter) const
+	{
+		if (!_root) return string_t();
+
+		size_t offset = 0;
+
+		for (xml_node_struct* i = _root; i; i = i->parent)
+		{
+			offset += (i != _root);
+			offset += i->name ? impl::strlength(i->name) : 0;
+		}
+
+		string_t result;
+		result.resize(offset);
+
+		for (xml_node_struct* j = _root; j; j = j->parent)
+		{
+			if (j != _root)
+				result[--offset] = delimiter;
+
+			if (j->name && *j->name)
+			{
+				size_t length = impl::strlength(j->name);
+
+				offset -= length;
+				memcpy(&result[offset], j->name, length * sizeof(char_t));
+			}
+		}
+
+		assert(offset == 0);
+
+		return result;
+	}
+#endif
+
+	PUGI__FN xml_node xml_node::first_element_by_path(const char_t* path_, char_t delimiter) const
+	{
+		xml_node found = *this; // Current search context.
+
+		if (!_root || !path_ || !path_[0]) return found;
+
+		if (path_[0] == delimiter)
+		{
+			// Absolute path; e.g. '/foo/bar'
+			found = found.root();
+			++path_;
+		}
+
+		const char_t* path_segment = path_;
+
+		while (*path_segment == delimiter) ++path_segment;
+
+		const char_t* path_segment_end = path_segment;
+
+		while (*path_segment_end && *path_segment_end != delimiter) ++path_segment_end;
+
+		if (path_segment == path_segment_end) return found;
+
+		const char_t* next_segment = path_segment_end;
+
+		while (*next_segment == delimiter) ++next_segment;
+
+		if (*path_segment == '.' && path_segment + 1 == path_segment_end)
+			return found.first_element_by_path(next_segment, delimiter);
+		else if (*path_segment == '.' && *(path_segment+1) == '.' && path_segment + 2 == path_segment_end)
+			return found.parent().first_element_by_path(next_segment, delimiter);
+		else
+		{
+			for (xml_node_struct* j = found._root->first_child; j; j = j->next_sibling)
+			{
+				if (j->name && impl::strequalrange(j->name, path_segment, static_cast<size_t>(path_segment_end - path_segment)))
+				{
+					xml_node subsearch = xml_node(j).first_element_by_path(next_segment, delimiter);
+
+					if (subsearch) return subsearch;
+				}
+			}
+
+			return xml_node();
+		}
+	}
+
+	PUGI__FN bool xml_node::traverse(xml_tree_walker& walker)
+	{
+		walker._depth = -1;
+		
+		xml_node arg_begin = *this;
+		if (!walker.begin(arg_begin)) return false;
+
+		xml_node cur = first_child();
+				
+		if (cur)
+		{
+			++walker._depth;
+
+			do 
+			{
+				xml_node arg_for_each = cur;
+				if (!walker.for_each(arg_for_each))
+					return false;
+						
+				if (cur.first_child())
+				{
+					++walker._depth;
+					cur = cur.first_child();
+				}
+				else if (cur.next_sibling())
+					cur = cur.next_sibling();
+				else
+				{
+					// Borland C++ workaround
+					while (!cur.next_sibling() && cur != *this && !cur.parent().empty())
+					{
+						--walker._depth;
+						cur = cur.parent();
+					}
+						
+					if (cur != *this)
+						cur = cur.next_sibling();
+				}
+			}
+			while (cur && cur != *this);
+		}
+
+		assert(walker._depth == -1);
+
+		xml_node arg_end = *this;
+		return walker.end(arg_end);
+	}
+
+	PUGI__FN size_t xml_node::hash_value() const
+	{
+		return static_cast<size_t>(reinterpret_cast<uintptr_t>(_root) / sizeof(xml_node_struct));
+	}
+
+	PUGI__FN xml_node_struct* xml_node::internal_object() const
+	{
+		return _root;
+	}
+
+	PUGI__FN void xml_node::print(xml_writer& writer, const char_t* indent, unsigned int flags, xml_encoding encoding, unsigned int depth) const
+	{
+		if (!_root) return;
+
+		impl::xml_buffered_writer buffered_writer(writer, encoding);
+
+		impl::node_output(buffered_writer, _root, indent, flags, depth);
+
+		buffered_writer.flush();
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN void xml_node::print(std::basic_ostream<char, std::char_traits<char> >& stream, const char_t* indent, unsigned int flags, xml_encoding encoding, unsigned int depth) const
+	{
+		xml_writer_stream writer(stream);
+
+		print(writer, indent, flags, encoding, depth);
+	}
+
+	PUGI__FN void xml_node::print(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >& stream, const char_t* indent, unsigned int flags, unsigned int depth) const
+	{
+		xml_writer_stream writer(stream);
+
+		print(writer, indent, flags, encoding_wchar, depth);
+	}
+#endif
+
+	PUGI__FN ptrdiff_t xml_node::offset_debug() const
+	{
+		if (!_root) return -1;
+
+		impl::xml_document_struct& doc = impl::get_document(_root);
+
+		// we can determine the offset reliably only if there is exactly once parse buffer
+		if (!doc.buffer || doc.extra_buffers) return -1;
+
+		switch (type())
+		{
+		case node_document:
+			return 0;
+
+		case node_element:
+		case node_declaration:
+		case node_pi:
+			return _root->name && (_root->header & impl::xml_memory_page_name_allocated_or_shared_mask) == 0 ? _root->name - doc.buffer : -1;
+
+		case node_pcdata:
+		case node_cdata:
+		case node_comment:
+		case node_doctype:
+			return _root->value && (_root->header & impl::xml_memory_page_value_allocated_or_shared_mask) == 0 ? _root->value - doc.buffer : -1;
+
+		default:
+			return -1;
+		}
+	}
+
+#ifdef __BORLANDC__
+	PUGI__FN bool operator&&(const xml_node& lhs, bool rhs)
+	{
+		return (bool)lhs && rhs;
+	}
+
+	PUGI__FN bool operator||(const xml_node& lhs, bool rhs)
+	{
+		return (bool)lhs || rhs;
+	}
+#endif
+
+	PUGI__FN xml_text::xml_text(xml_node_struct* root): _root(root)
+	{
+	}
+
+	PUGI__FN xml_node_struct* xml_text::_data() const
+	{
+		if (!_root || impl::is_text_node(_root)) return _root;
+
+		for (xml_node_struct* node = _root->first_child; node; node = node->next_sibling)
+			if (impl::is_text_node(node))
+				return node;
+
+		return 0;
+	}
+
+	PUGI__FN xml_node_struct* xml_text::_data_new()
+	{
+		xml_node_struct* d = _data();
+		if (d) return d;
+
+		return xml_node(_root).append_child(node_pcdata).internal_object();
+	}
+
+	PUGI__FN xml_text::xml_text(): _root(0)
+	{
+	}
+
+	PUGI__FN static void unspecified_bool_xml_text(xml_text***)
+	{
+	}
+
+	PUGI__FN xml_text::operator xml_text::unspecified_bool_type() const
+	{
+		return _data() ? unspecified_bool_xml_text : 0;
+	}
+
+	PUGI__FN bool xml_text::operator!() const
+	{
+		return !_data();
+	}
+
+	PUGI__FN bool xml_text::empty() const
+	{
+		return _data() == 0;
+	}
+
+	PUGI__FN const char_t* xml_text::get() const
+	{
+		xml_node_struct* d = _data();
+
+		return (d && d->value) ? d->value + 0 : PUGIXML_TEXT("");
+	}
+
+	PUGI__FN const char_t* xml_text::as_string(const char_t* def) const
+	{
+		xml_node_struct* d = _data();
+
+		return (d && d->value) ? d->value : def;
+	}
+
+	PUGI__FN int xml_text::as_int(int def) const
+	{
+		xml_node_struct* d = _data();
+
+		return (d && d->value) ? impl::get_value_int(d->value) : def;
+	}
+
+	PUGI__FN unsigned int xml_text::as_uint(unsigned int def) const
+	{
+		xml_node_struct* d = _data();
+
+		return (d && d->value) ? impl::get_value_uint(d->value) : def;
+	}
+
+	PUGI__FN double xml_text::as_double(double def) const
+	{
+		xml_node_struct* d = _data();
+
+		return (d && d->value) ? impl::get_value_double(d->value) : def;
+	}
+
+	PUGI__FN float xml_text::as_float(float def) const
+	{
+		xml_node_struct* d = _data();
+
+		return (d && d->value) ? impl::get_value_float(d->value) : def;
+	}
+
+	PUGI__FN bool xml_text::as_bool(bool def) const
+	{
+		xml_node_struct* d = _data();
+
+		return (d && d->value) ? impl::get_value_bool(d->value) : def;
+	}
+
+#ifdef PUGIXML_HAS_LONG_LONG
+	PUGI__FN long long xml_text::as_llong(long long def) const
+	{
+		xml_node_struct* d = _data();
+
+		return (d && d->value) ? impl::get_value_llong(d->value) : def;
+	}
+
+	PUGI__FN unsigned long long xml_text::as_ullong(unsigned long long def) const
+	{
+		xml_node_struct* d = _data();
+
+		return (d && d->value) ? impl::get_value_ullong(d->value) : def;
+	}
+#endif
+
+	PUGI__FN bool xml_text::set(const char_t* rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::strcpy_insitu(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+
+	PUGI__FN bool xml_text::set(int rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::set_value_convert(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+
+	PUGI__FN bool xml_text::set(unsigned int rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::set_value_convert(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+
+	PUGI__FN bool xml_text::set(float rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::set_value_convert(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+
+	PUGI__FN bool xml_text::set(double rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::set_value_convert(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+
+	PUGI__FN bool xml_text::set(bool rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::set_value_convert(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+
+#ifdef PUGIXML_HAS_LONG_LONG
+	PUGI__FN bool xml_text::set(long long rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::set_value_convert(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+
+	PUGI__FN bool xml_text::set(unsigned long long rhs)
+	{
+		xml_node_struct* dn = _data_new();
+
+		return dn ? impl::set_value_convert(dn->value, dn->header, impl::xml_memory_page_value_allocated_mask, rhs) : false;
+	}
+#endif
+
+	PUGI__FN xml_text& xml_text::operator=(const char_t* rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_text& xml_text::operator=(int rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_text& xml_text::operator=(unsigned int rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_text& xml_text::operator=(double rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_text& xml_text::operator=(float rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_text& xml_text::operator=(bool rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+
+#ifdef PUGIXML_HAS_LONG_LONG
+	PUGI__FN xml_text& xml_text::operator=(long long rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+
+	PUGI__FN xml_text& xml_text::operator=(unsigned long long rhs)
+	{
+		set(rhs);
+		return *this;
+	}
+#endif
+
+	PUGI__FN xml_node xml_text::data() const
+	{
+		return xml_node(_data());
+	}
+
+#ifdef __BORLANDC__
+	PUGI__FN bool operator&&(const xml_text& lhs, bool rhs)
+	{
+		return (bool)lhs && rhs;
+	}
+
+	PUGI__FN bool operator||(const xml_text& lhs, bool rhs)
+	{
+		return (bool)lhs || rhs;
+	}
+#endif
+
+	PUGI__FN xml_node_iterator::xml_node_iterator()
+	{
+	}
+
+	PUGI__FN xml_node_iterator::xml_node_iterator(const xml_node& node): _wrap(node), _parent(node.parent())
+	{
+	}
+
+	PUGI__FN xml_node_iterator::xml_node_iterator(xml_node_struct* ref, xml_node_struct* parent): _wrap(ref), _parent(parent)
+	{
+	}
+
+	PUGI__FN bool xml_node_iterator::operator==(const xml_node_iterator& rhs) const
+	{
+		return _wrap._root == rhs._wrap._root && _parent._root == rhs._parent._root;
+	}
+	
+	PUGI__FN bool xml_node_iterator::operator!=(const xml_node_iterator& rhs) const
+	{
+		return _wrap._root != rhs._wrap._root || _parent._root != rhs._parent._root;
+	}
+
+	PUGI__FN xml_node& xml_node_iterator::operator*() const
+	{
+		assert(_wrap._root);
+		return _wrap;
+	}
+
+	PUGI__FN xml_node* xml_node_iterator::operator->() const
+	{
+		assert(_wrap._root);
+		return const_cast<xml_node*>(&_wrap); // BCC32 workaround
+	}
+
+	PUGI__FN const xml_node_iterator& xml_node_iterator::operator++()
+	{
+		assert(_wrap._root);
+		_wrap._root = _wrap._root->next_sibling;
+		return *this;
+	}
+
+	PUGI__FN xml_node_iterator xml_node_iterator::operator++(int)
+	{
+		xml_node_iterator temp = *this;
+		++*this;
+		return temp;
+	}
+
+	PUGI__FN const xml_node_iterator& xml_node_iterator::operator--()
+	{
+		_wrap = _wrap._root ? _wrap.previous_sibling() : _parent.last_child();
+		return *this;
+	}
+
+	PUGI__FN xml_node_iterator xml_node_iterator::operator--(int)
+	{
+		xml_node_iterator temp = *this;
+		--*this;
+		return temp;
+	}
+
+	PUGI__FN xml_attribute_iterator::xml_attribute_iterator()
+	{
+	}
+
+	PUGI__FN xml_attribute_iterator::xml_attribute_iterator(const xml_attribute& attr, const xml_node& parent): _wrap(attr), _parent(parent)
+	{
+	}
+
+	PUGI__FN xml_attribute_iterator::xml_attribute_iterator(xml_attribute_struct* ref, xml_node_struct* parent): _wrap(ref), _parent(parent)
+	{
+	}
+
+	PUGI__FN bool xml_attribute_iterator::operator==(const xml_attribute_iterator& rhs) const
+	{
+		return _wrap._attr == rhs._wrap._attr && _parent._root == rhs._parent._root;
+	}
+	
+	PUGI__FN bool xml_attribute_iterator::operator!=(const xml_attribute_iterator& rhs) const
+	{
+		return _wrap._attr != rhs._wrap._attr || _parent._root != rhs._parent._root;
+	}
+
+	PUGI__FN xml_attribute& xml_attribute_iterator::operator*() const
+	{
+		assert(_wrap._attr);
+		return _wrap;
+	}
+
+	PUGI__FN xml_attribute* xml_attribute_iterator::operator->() const
+	{
+		assert(_wrap._attr);
+		return const_cast<xml_attribute*>(&_wrap); // BCC32 workaround
+	}
+
+	PUGI__FN const xml_attribute_iterator& xml_attribute_iterator::operator++()
+	{
+		assert(_wrap._attr);
+		_wrap._attr = _wrap._attr->next_attribute;
+		return *this;
+	}
+
+	PUGI__FN xml_attribute_iterator xml_attribute_iterator::operator++(int)
+	{
+		xml_attribute_iterator temp = *this;
+		++*this;
+		return temp;
+	}
+
+	PUGI__FN const xml_attribute_iterator& xml_attribute_iterator::operator--()
+	{
+		_wrap = _wrap._attr ? _wrap.previous_attribute() : _parent.last_attribute();
+		return *this;
+	}
+
+	PUGI__FN xml_attribute_iterator xml_attribute_iterator::operator--(int)
+	{
+		xml_attribute_iterator temp = *this;
+		--*this;
+		return temp;
+	}
+
+	PUGI__FN xml_named_node_iterator::xml_named_node_iterator(): _name(0)
+	{
+	}
+
+	PUGI__FN xml_named_node_iterator::xml_named_node_iterator(const xml_node& node, const char_t* name): _wrap(node), _parent(node.parent()), _name(name)
+	{
+	}
+
+	PUGI__FN xml_named_node_iterator::xml_named_node_iterator(xml_node_struct* ref, xml_node_struct* parent, const char_t* name): _wrap(ref), _parent(parent), _name(name)
+	{
+	}
+
+	PUGI__FN bool xml_named_node_iterator::operator==(const xml_named_node_iterator& rhs) const
+	{
+		return _wrap._root == rhs._wrap._root && _parent._root == rhs._parent._root;
+	}
+
+	PUGI__FN bool xml_named_node_iterator::operator!=(const xml_named_node_iterator& rhs) const
+	{
+		return _wrap._root != rhs._wrap._root || _parent._root != rhs._parent._root;
+	}
+
+	PUGI__FN xml_node& xml_named_node_iterator::operator*() const
+	{
+		assert(_wrap._root);
+		return _wrap;
+	}
+
+	PUGI__FN xml_node* xml_named_node_iterator::operator->() const
+	{
+		assert(_wrap._root);
+		return const_cast<xml_node*>(&_wrap); // BCC32 workaround
+	}
+
+	PUGI__FN const xml_named_node_iterator& xml_named_node_iterator::operator++()
+	{
+		assert(_wrap._root);
+		_wrap = _wrap.next_sibling(_name);
+		return *this;
+	}
+
+	PUGI__FN xml_named_node_iterator xml_named_node_iterator::operator++(int)
+	{
+		xml_named_node_iterator temp = *this;
+		++*this;
+		return temp;
+	}
+
+	PUGI__FN const xml_named_node_iterator& xml_named_node_iterator::operator--()
+	{
+		if (_wrap._root)
+			_wrap = _wrap.previous_sibling(_name);
+		else
+		{
+			_wrap = _parent.last_child();
+
+			if (!impl::strequal(_wrap.name(), _name))
+				_wrap = _wrap.previous_sibling(_name);
+		}
+
+		return *this;
+	}
+
+	PUGI__FN xml_named_node_iterator xml_named_node_iterator::operator--(int)
+	{
+		xml_named_node_iterator temp = *this;
+		--*this;
+		return temp;
+	}
+
+	PUGI__FN xml_parse_result::xml_parse_result(): status(status_internal_error), offset(0), encoding(encoding_auto)
+	{
+	}
+
+	PUGI__FN xml_parse_result::operator bool() const
+	{
+		return status == status_ok;
+	}
+
+	PUGI__FN const char* xml_parse_result::description() const
+	{
+		switch (status)
+		{
+		case status_ok: return "No error";
+
+		case status_file_not_found: return "File was not found";
+		case status_io_error: return "Error reading from file/stream";
+		case status_out_of_memory: return "Could not allocate memory";
+		case status_internal_error: return "Internal error occurred";
+
+		case status_unrecognized_tag: return "Could not determine tag type";
+
+		case status_bad_pi: return "Error parsing document declaration/processing instruction";
+		case status_bad_comment: return "Error parsing comment";
+		case status_bad_cdata: return "Error parsing CDATA section";
+		case status_bad_doctype: return "Error parsing document type declaration";
+		case status_bad_pcdata: return "Error parsing PCDATA section";
+		case status_bad_start_element: return "Error parsing start element tag";
+		case status_bad_attribute: return "Error parsing element attribute";
+		case status_bad_end_element: return "Error parsing end element tag";
+		case status_end_element_mismatch: return "Start-end tags mismatch";
+
+		case status_append_invalid_root: return "Unable to append nodes: root is not an element or document";
+
+		case status_no_document_element: return "No document element found";
+
+		default: return "Unknown error";
+		}
+	}
+
+	PUGI__FN xml_document::xml_document(): _buffer(0)
+	{
+		create();
+	}
+
+	PUGI__FN xml_document::~xml_document()
+	{
+		destroy();
+	}
+
+	PUGI__FN void xml_document::reset()
+	{
+		destroy();
+		create();
+	}
+
+	PUGI__FN void xml_document::reset(const xml_document& proto)
+	{
+		reset();
+
+		for (xml_node cur = proto.first_child(); cur; cur = cur.next_sibling())
+			append_copy(cur);
+	}
+
+	PUGI__FN void xml_document::create()
+	{
+		assert(!_root);
+
+	#ifdef PUGIXML_COMPACT
+		const size_t page_offset = sizeof(uint32_t);
+	#else
+		const size_t page_offset = 0;
+	#endif
+
+		// initialize sentinel page
+		PUGI__STATIC_ASSERT(sizeof(impl::xml_memory_page) + sizeof(impl::xml_document_struct) + impl::xml_memory_page_alignment - sizeof(void*) + page_offset <= sizeof(_memory));
+
+		// align upwards to page boundary
+		void* page_memory = reinterpret_cast<void*>((reinterpret_cast<uintptr_t>(_memory) + (impl::xml_memory_page_alignment - 1)) & ~(impl::xml_memory_page_alignment - 1));
+
+		// prepare page structure
+		impl::xml_memory_page* page = impl::xml_memory_page::construct(page_memory);
+		assert(page);
+
+		page->busy_size = impl::xml_memory_page_size;
+
+		// setup first page marker
+	#ifdef PUGIXML_COMPACT
+		page->compact_page_marker = reinterpret_cast<uint32_t*>(reinterpret_cast<char*>(page) + sizeof(impl::xml_memory_page));
+		*page->compact_page_marker = sizeof(impl::xml_memory_page);
+	#endif
+
+		// allocate new root
+		_root = new (reinterpret_cast<char*>(page) + sizeof(impl::xml_memory_page) + page_offset) impl::xml_document_struct(page);
+		_root->prev_sibling_c = _root;
+
+		// setup sentinel page
+		page->allocator = static_cast<impl::xml_document_struct*>(_root);
+
+		// verify the document allocation
+		assert(reinterpret_cast<char*>(_root) + sizeof(impl::xml_document_struct) <= _memory + sizeof(_memory));
+	}
+
+	PUGI__FN void xml_document::destroy()
+	{
+		assert(_root);
+
+		// destroy static storage
+		if (_buffer)
+		{
+			impl::xml_memory::deallocate(_buffer);
+			_buffer = 0;
+		}
+
+		// destroy extra buffers (note: no need to destroy linked list nodes, they're allocated using document allocator)
+		for (impl::xml_extra_buffer* extra = static_cast<impl::xml_document_struct*>(_root)->extra_buffers; extra; extra = extra->next)
+		{
+			if (extra->buffer) impl::xml_memory::deallocate(extra->buffer);
+		}
+
+		// destroy dynamic storage, leave sentinel page (it's in static memory)
+		impl::xml_memory_page* root_page = PUGI__GETPAGE(_root);
+		assert(root_page && !root_page->prev);
+		assert(reinterpret_cast<char*>(root_page) >= _memory && reinterpret_cast<char*>(root_page) < _memory + sizeof(_memory));
+
+		for (impl::xml_memory_page* page = root_page->next; page; )
+		{
+			impl::xml_memory_page* next = page->next;
+
+			impl::xml_allocator::deallocate_page(page);
+
+			page = next;
+		}
+
+	#ifdef PUGIXML_COMPACT
+		// destroy hash table
+		static_cast<impl::xml_document_struct*>(_root)->hash.clear();
+	#endif
+
+		_root = 0;
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN xml_parse_result xml_document::load(std::basic_istream<char, std::char_traits<char> >& stream, unsigned int options, xml_encoding encoding)
+	{
+		reset();
+
+		return impl::load_stream_impl(*this, stream, options, encoding);
+	}
+
+	PUGI__FN xml_parse_result xml_document::load(std::basic_istream<wchar_t, std::char_traits<wchar_t> >& stream, unsigned int options)
+	{
+		reset();
+
+		return impl::load_stream_impl(*this, stream, options, encoding_wchar);
+	}
+#endif
+
+	PUGI__FN xml_parse_result xml_document::load_string(const char_t* contents, unsigned int options)
+	{
+		// Force native encoding (skip autodetection)
+	#ifdef PUGIXML_WCHAR_MODE
+		xml_encoding encoding = encoding_wchar;
+	#else
+		xml_encoding encoding = encoding_utf8;
+	#endif
+
+		return load_buffer(contents, impl::strlength(contents) * sizeof(char_t), options, encoding);
+	}
+
+	PUGI__FN xml_parse_result xml_document::load(const char_t* contents, unsigned int options)
+	{
+		return load_string(contents, options);
+	}
+
+	PUGI__FN xml_parse_result xml_document::load_file(const char* path_, unsigned int options, xml_encoding encoding)
+	{
+		reset();
+
+		using impl::auto_deleter; // MSVC7 workaround
+		auto_deleter<FILE, int(*)(FILE*)> file(fopen(path_, "rb"), fclose);
+
+		return impl::load_file_impl(*this, file.data, options, encoding);
+	}
+
+	PUGI__FN xml_parse_result xml_document::load_file(const wchar_t* path_, unsigned int options, xml_encoding encoding)
+	{
+		reset();
+
+		using impl::auto_deleter; // MSVC7 workaround
+		auto_deleter<FILE, int(*)(FILE*)> file(impl::open_file_wide(path_, L"rb"), fclose);
+
+		return impl::load_file_impl(*this, file.data, options, encoding);
+	}
+
+	PUGI__FN xml_parse_result xml_document::load_buffer(const void* contents, size_t size, unsigned int options, xml_encoding encoding)
+	{
+		reset();
+
+		return impl::load_buffer_impl(static_cast<impl::xml_document_struct*>(_root), _root, const_cast<void*>(contents), size, options, encoding, false, false, &_buffer);
+	}
+
+	PUGI__FN xml_parse_result xml_document::load_buffer_inplace(void* contents, size_t size, unsigned int options, xml_encoding encoding)
+	{
+		reset();
+
+		return impl::load_buffer_impl(static_cast<impl::xml_document_struct*>(_root), _root, contents, size, options, encoding, true, false, &_buffer);
+	}
+
+	PUGI__FN xml_parse_result xml_document::load_buffer_inplace_own(void* contents, size_t size, unsigned int options, xml_encoding encoding)
+	{
+		reset();
+
+		return impl::load_buffer_impl(static_cast<impl::xml_document_struct*>(_root), _root, contents, size, options, encoding, true, true, &_buffer);
+	}
+
+	PUGI__FN void xml_document::save(xml_writer& writer, const char_t* indent, unsigned int flags, xml_encoding encoding) const
+	{
+		impl::xml_buffered_writer buffered_writer(writer, encoding);
+
+		if ((flags & format_write_bom) && encoding != encoding_latin1)
+		{
+			// BOM always represents the codepoint U+FEFF, so just write it in native encoding
+		#ifdef PUGIXML_WCHAR_MODE
+			unsigned int bom = 0xfeff;
+			buffered_writer.write(static_cast<wchar_t>(bom));
+		#else
+			buffered_writer.write('\xef', '\xbb', '\xbf');
+		#endif
+		}
+
+		if (!(flags & format_no_declaration) && !impl::has_declaration(_root))
+		{
+			buffered_writer.write_string(PUGIXML_TEXT("<?xml version=\"1.0\""));
+			if (encoding == encoding_latin1) buffered_writer.write_string(PUGIXML_TEXT(" encoding=\"ISO-8859-1\""));
+			buffered_writer.write('?', '>');
+			if (!(flags & format_raw)) buffered_writer.write('\n');
+		}
+
+		impl::node_output(buffered_writer, _root, indent, flags, 0);
+
+		buffered_writer.flush();
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN void xml_document::save(std::basic_ostream<char, std::char_traits<char> >& stream, const char_t* indent, unsigned int flags, xml_encoding encoding) const
+	{
+		xml_writer_stream writer(stream);
+
+		save(writer, indent, flags, encoding);
+	}
+
+	PUGI__FN void xml_document::save(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >& stream, const char_t* indent, unsigned int flags) const
+	{
+		xml_writer_stream writer(stream);
+
+		save(writer, indent, flags, encoding_wchar);
+	}
+#endif
+
+	PUGI__FN bool xml_document::save_file(const char* path_, const char_t* indent, unsigned int flags, xml_encoding encoding) const
+	{
+		using impl::auto_deleter; // MSVC7 workaround
+		auto_deleter<FILE, int(*)(FILE*)> file(fopen(path_, (flags & format_save_file_text) ? "w" : "wb"), fclose);
+
+		return impl::save_file_impl(*this, file.data, indent, flags, encoding);
+	}
+
+	PUGI__FN bool xml_document::save_file(const wchar_t* path_, const char_t* indent, unsigned int flags, xml_encoding encoding) const
+	{
+		using impl::auto_deleter; // MSVC7 workaround
+		auto_deleter<FILE, int(*)(FILE*)> file(impl::open_file_wide(path_, (flags & format_save_file_text) ? L"w" : L"wb"), fclose);
+
+		return impl::save_file_impl(*this, file.data, indent, flags, encoding);
+	}
+
+	PUGI__FN xml_node xml_document::document_element() const
+	{
+		assert(_root);
+
+		for (xml_node_struct* i = _root->first_child; i; i = i->next_sibling)
+			if (PUGI__NODETYPE(i) == node_element)
+				return xml_node(i);
+
+		return xml_node();
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN std::string PUGIXML_FUNCTION as_utf8(const wchar_t* str)
+	{
+		assert(str);
+
+		return impl::as_utf8_impl(str, impl::strlength_wide(str));
+	}
+
+	PUGI__FN std::string PUGIXML_FUNCTION as_utf8(const std::basic_string<wchar_t>& str)
+	{
+		return impl::as_utf8_impl(str.c_str(), str.size());
+	}
+	
+	PUGI__FN std::basic_string<wchar_t> PUGIXML_FUNCTION as_wide(const char* str)
+	{
+		assert(str);
+
+		return impl::as_wide_impl(str, strlen(str));
+	}
+	
+	PUGI__FN std::basic_string<wchar_t> PUGIXML_FUNCTION as_wide(const std::string& str)
+	{
+		return impl::as_wide_impl(str.c_str(), str.size());
+	}
+#endif
+
+	PUGI__FN void PUGIXML_FUNCTION set_memory_management_functions(allocation_function allocate, deallocation_function deallocate)
+	{
+		impl::xml_memory::allocate = allocate;
+		impl::xml_memory::deallocate = deallocate;
+	}
+
+	PUGI__FN allocation_function PUGIXML_FUNCTION get_memory_allocation_function()
+	{
+		return impl::xml_memory::allocate;
+	}
+
+	PUGI__FN deallocation_function PUGIXML_FUNCTION get_memory_deallocation_function()
+	{
+		return impl::xml_memory::deallocate;
+	}
+}
+
+#if !defined(PUGIXML_NO_STL) && (defined(_MSC_VER) || defined(__ICC))
+namespace std
+{
+	// Workarounds for (non-standard) iterator category detection for older versions (MSVC7/IC8 and earlier)
+	PUGI__FN std::bidirectional_iterator_tag _Iter_cat(const pugi::xml_node_iterator&)
+	{
+		return std::bidirectional_iterator_tag();
+	}
+
+	PUGI__FN std::bidirectional_iterator_tag _Iter_cat(const pugi::xml_attribute_iterator&)
+	{
+		return std::bidirectional_iterator_tag();
+	}
+
+	PUGI__FN std::bidirectional_iterator_tag _Iter_cat(const pugi::xml_named_node_iterator&)
+	{
+		return std::bidirectional_iterator_tag();
+	}
+}
+#endif
+
+#if !defined(PUGIXML_NO_STL) && defined(__SUNPRO_CC)
+namespace std
+{
+	// Workarounds for (non-standard) iterator category detection
+	PUGI__FN std::bidirectional_iterator_tag __iterator_category(const pugi::xml_node_iterator&)
+	{
+		return std::bidirectional_iterator_tag();
+	}
+
+	PUGI__FN std::bidirectional_iterator_tag __iterator_category(const pugi::xml_attribute_iterator&)
+	{
+		return std::bidirectional_iterator_tag();
+	}
+
+	PUGI__FN std::bidirectional_iterator_tag __iterator_category(const pugi::xml_named_node_iterator&)
+	{
+		return std::bidirectional_iterator_tag();
+	}
+}
+#endif
+
+#ifndef PUGIXML_NO_XPATH
+// STL replacements
+PUGI__NS_BEGIN
+	struct equal_to
+	{
+		template <typename T> bool operator()(const T& lhs, const T& rhs) const
+		{
+			return lhs == rhs;
+		}
+	};
+
+	struct not_equal_to
+	{
+		template <typename T> bool operator()(const T& lhs, const T& rhs) const
+		{
+			return lhs != rhs;
+		}
+	};
+
+	struct less
+	{
+		template <typename T> bool operator()(const T& lhs, const T& rhs) const
+		{
+			return lhs < rhs;
+		}
+	};
+
+	struct less_equal
+	{
+		template <typename T> bool operator()(const T& lhs, const T& rhs) const
+		{
+			return lhs <= rhs;
+		}
+	};
+
+	template <typename T> void swap(T& lhs, T& rhs)
+	{
+		T temp = lhs;
+		lhs = rhs;
+		rhs = temp;
+	}
+
+	template <typename I, typename Pred> I min_element(I begin, I end, const Pred& pred)
+	{
+		I result = begin;
+
+		for (I it = begin + 1; it != end; ++it)
+			if (pred(*it, *result))
+				result = it;
+
+		return result;
+	}
+
+	template <typename I> void reverse(I begin, I end)
+	{
+		while (end - begin > 1) swap(*begin++, *--end);
+	}
+
+	template <typename I> I unique(I begin, I end)
+	{
+		// fast skip head
+		while (end - begin > 1 && *begin != *(begin + 1)) begin++;
+
+		if (begin == end) return begin;
+
+		// last written element
+		I write = begin++; 
+
+		// merge unique elements
+		while (begin != end)
+		{
+			if (*begin != *write)
+				*++write = *begin++;
+			else
+				begin++;
+		}
+
+		// past-the-end (write points to live element)
+		return write + 1;
+	}
+
+	template <typename I> void copy_backwards(I begin, I end, I target)
+	{
+		while (begin != end) *--target = *--end;
+	}
+
+	template <typename I, typename Pred, typename T> void insertion_sort(I begin, I end, const Pred& pred, T*)
+	{
+		assert(begin != end);
+
+		for (I it = begin + 1; it != end; ++it)
+		{
+			T val = *it;
+
+			if (pred(val, *begin))
+			{
+				// move to front
+				copy_backwards(begin, it, it + 1);
+				*begin = val;
+			}
+			else
+			{
+				I hole = it;
+
+				// move hole backwards
+				while (pred(val, *(hole - 1)))
+				{
+					*hole = *(hole - 1);
+					hole--;
+				}
+
+				// fill hole with element
+				*hole = val;
+			}
+		}
+	}
+
+	// std variant for elements with ==
+	template <typename I, typename Pred> void partition(I begin, I middle, I end, const Pred& pred, I* out_eqbeg, I* out_eqend)
+	{
+		I eqbeg = middle, eqend = middle + 1;
+
+		// expand equal range
+		while (eqbeg != begin && *(eqbeg - 1) == *eqbeg) --eqbeg;
+		while (eqend != end && *eqend == *eqbeg) ++eqend;
+
+		// process outer elements
+		I ltend = eqbeg, gtbeg = eqend;
+
+		for (;;)
+		{
+			// find the element from the right side that belongs to the left one
+			for (; gtbeg != end; ++gtbeg)
+				if (!pred(*eqbeg, *gtbeg))
+				{
+					if (*gtbeg == *eqbeg) swap(*gtbeg, *eqend++);
+					else break;
+				}
+
+			// find the element from the left side that belongs to the right one
+			for (; ltend != begin; --ltend)
+				if (!pred(*(ltend - 1), *eqbeg))
+				{
+					if (*eqbeg == *(ltend - 1)) swap(*(ltend - 1), *--eqbeg);
+					else break;
+				}
+
+			// scanned all elements
+			if (gtbeg == end && ltend == begin)
+			{
+				*out_eqbeg = eqbeg;
+				*out_eqend = eqend;
+				return;
+			}
+
+			// make room for elements by moving equal area
+			if (gtbeg == end)
+			{
+				if (--ltend != --eqbeg) swap(*ltend, *eqbeg);
+				swap(*eqbeg, *--eqend);
+			}
+			else if (ltend == begin)
+			{
+				if (eqend != gtbeg) swap(*eqbeg, *eqend);
+				++eqend;
+				swap(*gtbeg++, *eqbeg++);
+			}
+			else swap(*gtbeg++, *--ltend);
+		}
+	}
+
+	template <typename I, typename Pred> void median3(I first, I middle, I last, const Pred& pred)
+	{
+		if (pred(*middle, *first)) swap(*middle, *first);
+		if (pred(*last, *middle)) swap(*last, *middle);
+		if (pred(*middle, *first)) swap(*middle, *first);
+	}
+
+	template <typename I, typename Pred> void median(I first, I middle, I last, const Pred& pred)
+	{
+		if (last - first <= 40)
+		{
+			// median of three for small chunks
+			median3(first, middle, last, pred);
+		}
+		else
+		{
+			// median of nine
+			size_t step = (last - first + 1) / 8;
+
+			median3(first, first + step, first + 2 * step, pred);
+			median3(middle - step, middle, middle + step, pred);
+			median3(last - 2 * step, last - step, last, pred);
+			median3(first + step, middle, last - step, pred);
+		}
+	}
+
+	template <typename I, typename Pred> void sort(I begin, I end, const Pred& pred)
+	{
+		// sort large chunks
+		while (end - begin > 32)
+		{
+			// find median element
+			I middle = begin + (end - begin) / 2;
+			median(begin, middle, end - 1, pred);
+
+			// partition in three chunks (< = >)
+			I eqbeg, eqend;
+			partition(begin, middle, end, pred, &eqbeg, &eqend);
+
+			// loop on larger half
+			if (eqbeg - begin > end - eqend)
+			{
+				sort(eqend, end, pred);
+				end = eqbeg;
+			}
+			else
+			{
+				sort(begin, eqbeg, pred);
+				begin = eqend;
+			}
+		}
+
+		// insertion sort small chunk
+		if (begin != end) insertion_sort(begin, end, pred, &*begin);
+	}
+PUGI__NS_END
+
+// Allocator used for AST and evaluation stacks
+PUGI__NS_BEGIN
+	static const size_t xpath_memory_page_size =
+	#ifdef PUGIXML_MEMORY_XPATH_PAGE_SIZE
+		PUGIXML_MEMORY_XPATH_PAGE_SIZE
+	#else
+		4096
+	#endif
+		;
+
+	static const uintptr_t xpath_memory_block_alignment = sizeof(double) > sizeof(void*) ? sizeof(double) : sizeof(void*);
+
+	struct xpath_memory_block
+	{	
+		xpath_memory_block* next;
+		size_t capacity;
+
+		union
+		{
+			char data[xpath_memory_page_size];
+			double alignment;
+		};
+	};
+		
+	class xpath_allocator
+	{
+		xpath_memory_block* _root;
+		size_t _root_size;
+
+	public:
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		jmp_buf* error_handler;
+	#endif
+
+		xpath_allocator(xpath_memory_block* root, size_t root_size = 0): _root(root), _root_size(root_size)
+		{
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			error_handler = 0;
+		#endif
+		}
+		
+		void* allocate_nothrow(size_t size)
+		{
+			// round size up to block alignment boundary
+			size = (size + xpath_memory_block_alignment - 1) & ~(xpath_memory_block_alignment - 1);
+
+			if (_root_size + size <= _root->capacity)
+			{
+				void* buf = &_root->data[0] + _root_size;
+				_root_size += size;
+				return buf;
+			}
+			else
+			{
+				// make sure we have at least 1/4th of the page free after allocation to satisfy subsequent allocation requests
+				size_t block_capacity_base = sizeof(_root->data);
+				size_t block_capacity_req = size + block_capacity_base / 4;
+				size_t block_capacity = (block_capacity_base > block_capacity_req) ? block_capacity_base : block_capacity_req;
+
+				size_t block_size = block_capacity + offsetof(xpath_memory_block, data);
+
+				xpath_memory_block* block = static_cast<xpath_memory_block*>(xml_memory::allocate(block_size));
+				if (!block) return 0;
+				
+				block->next = _root;
+				block->capacity = block_capacity;
+				
+				_root = block;
+				_root_size = size;
+				
+				return block->data;
+			}
+		}
+
+		void* allocate(size_t size)
+		{
+			void* result = allocate_nothrow(size);
+
+			if (!result)
+			{
+			#ifdef PUGIXML_NO_EXCEPTIONS
+				assert(error_handler);
+				longjmp(*error_handler, 1);
+			#else
+				throw std::bad_alloc();
+			#endif
+			}
+
+			return result;
+		}
+
+		void* reallocate(void* ptr, size_t old_size, size_t new_size)
+		{
+			// round size up to block alignment boundary
+			old_size = (old_size + xpath_memory_block_alignment - 1) & ~(xpath_memory_block_alignment - 1);
+			new_size = (new_size + xpath_memory_block_alignment - 1) & ~(xpath_memory_block_alignment - 1);
+
+			// we can only reallocate the last object
+			assert(ptr == 0 || static_cast<char*>(ptr) + old_size == &_root->data[0] + _root_size);
+
+			// adjust root size so that we have not allocated the object at all
+			bool only_object = (_root_size == old_size);
+
+			if (ptr) _root_size -= old_size;
+
+			// allocate a new version (this will obviously reuse the memory if possible)
+			void* result = allocate(new_size);
+			assert(result);
+
+			// we have a new block
+			if (result != ptr && ptr)
+			{
+				// copy old data
+				assert(new_size >= old_size);
+				memcpy(result, ptr, old_size);
+
+				// free the previous page if it had no other objects
+				if (only_object)
+				{
+					assert(_root->data == result);
+					assert(_root->next);
+
+					xpath_memory_block* next = _root->next->next;
+
+					if (next)
+					{
+						// deallocate the whole page, unless it was the first one
+						xml_memory::deallocate(_root->next);
+						_root->next = next;
+					}
+				}
+			}
+
+			return result;
+		}
+
+		void revert(const xpath_allocator& state)
+		{
+			// free all new pages
+			xpath_memory_block* cur = _root;
+
+			while (cur != state._root)
+			{
+				xpath_memory_block* next = cur->next;
+
+				xml_memory::deallocate(cur);
+
+				cur = next;
+			}
+
+			// restore state
+			_root = state._root;
+			_root_size = state._root_size;
+		}
+
+		void release()
+		{
+			xpath_memory_block* cur = _root;
+			assert(cur);
+
+			while (cur->next)
+			{
+				xpath_memory_block* next = cur->next;
+
+				xml_memory::deallocate(cur);
+
+				cur = next;
+			}
+		}
+	};
+
+	struct xpath_allocator_capture
+	{
+		xpath_allocator_capture(xpath_allocator* alloc): _target(alloc), _state(*alloc)
+		{
+		}
+
+		~xpath_allocator_capture()
+		{
+			_target->revert(_state);
+		}
+
+		xpath_allocator* _target;
+		xpath_allocator _state;
+	};
+
+	struct xpath_stack
+	{
+		xpath_allocator* result;
+		xpath_allocator* temp;
+	};
+
+	struct xpath_stack_data
+	{
+		xpath_memory_block blocks[2];
+		xpath_allocator result;
+		xpath_allocator temp;
+		xpath_stack stack;
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		jmp_buf error_handler;
+	#endif
+
+		xpath_stack_data(): result(blocks + 0), temp(blocks + 1)
+		{
+			blocks[0].next = blocks[1].next = 0;
+			blocks[0].capacity = blocks[1].capacity = sizeof(blocks[0].data);
+
+			stack.result = &result;
+			stack.temp = &temp;
+
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			result.error_handler = temp.error_handler = &error_handler;
+		#endif
+		}
+
+		~xpath_stack_data()
+		{
+			result.release();
+			temp.release();
+		}
+	};
+PUGI__NS_END
+
+// String class
+PUGI__NS_BEGIN
+	class xpath_string
+	{
+		const char_t* _buffer;
+		bool _uses_heap;
+		size_t _length_heap;
+
+		static char_t* duplicate_string(const char_t* string, size_t length, xpath_allocator* alloc)
+		{
+			char_t* result = static_cast<char_t*>(alloc->allocate((length + 1) * sizeof(char_t)));
+			assert(result);
+
+			memcpy(result, string, length * sizeof(char_t));
+			result[length] = 0;
+
+			return result;
+		}
+
+		xpath_string(const char_t* buffer, bool uses_heap_, size_t length_heap): _buffer(buffer), _uses_heap(uses_heap_), _length_heap(length_heap)
+		{
+		}
+
+	public:
+		static xpath_string from_const(const char_t* str)
+		{
+			return xpath_string(str, false, 0);
+		}
+
+		static xpath_string from_heap_preallocated(const char_t* begin, const char_t* end)
+		{
+			assert(begin <= end && *end == 0);
+
+			return xpath_string(begin, true, static_cast<size_t>(end - begin));
+		}
+
+		static xpath_string from_heap(const char_t* begin, const char_t* end, xpath_allocator* alloc)
+		{
+			assert(begin <= end);
+
+			size_t length = static_cast<size_t>(end - begin);
+
+			return length == 0 ? xpath_string() : xpath_string(duplicate_string(begin, length, alloc), true, length);
+		}
+
+		xpath_string(): _buffer(PUGIXML_TEXT("")), _uses_heap(false), _length_heap(0)
+		{
+		}
+
+		void append(const xpath_string& o, xpath_allocator* alloc)
+		{
+			// skip empty sources
+			if (!*o._buffer) return;
+
+			// fast append for constant empty target and constant source
+			if (!*_buffer && !_uses_heap && !o._uses_heap)
+			{
+				_buffer = o._buffer;
+			}
+			else
+			{
+				// need to make heap copy
+				size_t target_length = length();
+				size_t source_length = o.length();
+				size_t result_length = target_length + source_length;
+
+				// allocate new buffer
+				char_t* result = static_cast<char_t*>(alloc->reallocate(_uses_heap ? const_cast<char_t*>(_buffer) : 0, (target_length + 1) * sizeof(char_t), (result_length + 1) * sizeof(char_t)));
+				assert(result);
+
+				// append first string to the new buffer in case there was no reallocation
+				if (!_uses_heap) memcpy(result, _buffer, target_length * sizeof(char_t));
+
+				// append second string to the new buffer
+				memcpy(result + target_length, o._buffer, source_length * sizeof(char_t));
+				result[result_length] = 0;
+
+				// finalize
+				_buffer = result;
+				_uses_heap = true;
+				_length_heap = result_length;
+			}
+		}
+
+		const char_t* c_str() const
+		{
+			return _buffer;
+		}
+
+		size_t length() const
+		{
+			return _uses_heap ? _length_heap : strlength(_buffer);
+		}
+		
+		char_t* data(xpath_allocator* alloc)
+		{
+			// make private heap copy
+			if (!_uses_heap)
+			{
+				size_t length_ = strlength(_buffer);
+
+				_buffer = duplicate_string(_buffer, length_, alloc);
+				_uses_heap = true;
+				_length_heap = length_;
+			}
+
+			return const_cast<char_t*>(_buffer);
+		}
+
+		bool empty() const
+		{
+			return *_buffer == 0;
+		}
+
+		bool operator==(const xpath_string& o) const
+		{
+			return strequal(_buffer, o._buffer);
+		}
+
+		bool operator!=(const xpath_string& o) const
+		{
+			return !strequal(_buffer, o._buffer);
+		}
+
+		bool uses_heap() const
+		{
+			return _uses_heap;
+		}
+	};
+PUGI__NS_END
+
+PUGI__NS_BEGIN
+	PUGI__FN bool starts_with(const char_t* string, const char_t* pattern)
+	{
+		while (*pattern && *string == *pattern)
+		{
+			string++;
+			pattern++;
+		}
+
+		return *pattern == 0;
+	}
+
+	PUGI__FN const char_t* find_char(const char_t* s, char_t c)
+	{
+	#ifdef PUGIXML_WCHAR_MODE
+		return wcschr(s, c);
+	#else
+		return strchr(s, c);
+	#endif
+	}
+
+	PUGI__FN const char_t* find_substring(const char_t* s, const char_t* p)
+	{
+	#ifdef PUGIXML_WCHAR_MODE
+		// MSVC6 wcsstr bug workaround (if s is empty it always returns 0)
+		return (*p == 0) ? s : wcsstr(s, p);
+	#else
+		return strstr(s, p);
+	#endif
+	}
+
+	// Converts symbol to lower case, if it is an ASCII one
+	PUGI__FN char_t tolower_ascii(char_t ch)
+	{
+		return static_cast<unsigned int>(ch - 'A') < 26 ? static_cast<char_t>(ch | ' ') : ch;
+	}
+
+	PUGI__FN xpath_string string_value(const xpath_node& na, xpath_allocator* alloc)
+	{
+		if (na.attribute())
+			return xpath_string::from_const(na.attribute().value());
+		else
+		{
+			xml_node n = na.node();
+
+			switch (n.type())
+			{
+			case node_pcdata:
+			case node_cdata:
+			case node_comment:
+			case node_pi:
+				return xpath_string::from_const(n.value());
+			
+			case node_document:
+			case node_element:
+			{
+				xpath_string result;
+
+				xml_node cur = n.first_child();
+				
+				while (cur && cur != n)
+				{
+					if (cur.type() == node_pcdata || cur.type() == node_cdata)
+						result.append(xpath_string::from_const(cur.value()), alloc);
+
+					if (cur.first_child())
+						cur = cur.first_child();
+					else if (cur.next_sibling())
+						cur = cur.next_sibling();
+					else
+					{
+						while (!cur.next_sibling() && cur != n)
+							cur = cur.parent();
+
+						if (cur != n) cur = cur.next_sibling();
+					}
+				}
+				
+				return result;
+			}
+			
+			default:
+				return xpath_string();
+			}
+		}
+	}
+	
+	PUGI__FN bool node_is_before_sibling(xml_node_struct* ln, xml_node_struct* rn)
+	{
+		assert(ln->parent == rn->parent);
+
+		// there is no common ancestor (the shared parent is null), nodes are from different documents
+		if (!ln->parent) return ln < rn;
+
+		// determine sibling order
+		xml_node_struct* ls = ln;
+		xml_node_struct* rs = rn;
+
+		while (ls && rs)
+		{
+			if (ls == rn) return true;
+			if (rs == ln) return false;
+
+			ls = ls->next_sibling;
+			rs = rs->next_sibling;
+		}
+
+		// if rn sibling chain ended ln must be before rn
+		return !rs;
+	}
+	
+	PUGI__FN bool node_is_before(xml_node_struct* ln, xml_node_struct* rn)
+	{
+		// find common ancestor at the same depth, if any
+		xml_node_struct* lp = ln;
+		xml_node_struct* rp = rn;
+
+		while (lp && rp && lp->parent != rp->parent)
+		{
+			lp = lp->parent;
+			rp = rp->parent;
+		}
+
+		// parents are the same!
+		if (lp && rp) return node_is_before_sibling(lp, rp);
+
+		// nodes are at different depths, need to normalize heights
+		bool left_higher = !lp;
+
+		while (lp)
+		{
+			lp = lp->parent;
+			ln = ln->parent;
+		}
+
+		while (rp)
+		{
+			rp = rp->parent;
+			rn = rn->parent;
+		}
+
+		// one node is the ancestor of the other
+		if (ln == rn) return left_higher;
+
+		// find common ancestor... again
+		while (ln->parent != rn->parent)
+		{
+			ln = ln->parent;
+			rn = rn->parent;
+		}
+
+		return node_is_before_sibling(ln, rn);
+	}
+
+	PUGI__FN bool node_is_ancestor(xml_node_struct* parent, xml_node_struct* node)
+	{
+		while (node && node != parent) node = node->parent;
+
+		return parent && node == parent;
+	}
+
+	PUGI__FN const void* document_buffer_order(const xpath_node& xnode)
+	{
+		xml_node_struct* node = xnode.node().internal_object();
+
+		if (node)
+		{
+			if ((get_document(node).header & xml_memory_page_contents_shared_mask) == 0)
+			{
+				if (node->name && (node->header & impl::xml_memory_page_name_allocated_or_shared_mask) == 0) return node->name;
+				if (node->value && (node->header & impl::xml_memory_page_value_allocated_or_shared_mask) == 0) return node->value;
+			}
+
+			return 0;
+		}
+
+		xml_attribute_struct* attr = xnode.attribute().internal_object();
+
+		if (attr)
+		{
+			if ((get_document(attr).header & xml_memory_page_contents_shared_mask) == 0)
+			{
+				if ((attr->header & impl::xml_memory_page_name_allocated_or_shared_mask) == 0) return attr->name;
+				if ((attr->header & impl::xml_memory_page_value_allocated_or_shared_mask) == 0) return attr->value;
+			}
+
+			return 0;
+		}
+
+		return 0;
+	}
+	
+	struct document_order_comparator
+	{
+		bool operator()(const xpath_node& lhs, const xpath_node& rhs) const
+		{
+			// optimized document order based check
+			const void* lo = document_buffer_order(lhs);
+			const void* ro = document_buffer_order(rhs);
+
+			if (lo && ro) return lo < ro;
+
+			// slow comparison
+			xml_node ln = lhs.node(), rn = rhs.node();
+
+			// compare attributes
+			if (lhs.attribute() && rhs.attribute())
+			{
+				// shared parent
+				if (lhs.parent() == rhs.parent())
+				{
+					// determine sibling order
+					for (xml_attribute a = lhs.attribute(); a; a = a.next_attribute())
+						if (a == rhs.attribute())
+							return true;
+					
+					return false;
+				}
+				
+				// compare attribute parents
+				ln = lhs.parent();
+				rn = rhs.parent();
+			}
+			else if (lhs.attribute())
+			{
+				// attributes go after the parent element
+				if (lhs.parent() == rhs.node()) return false;
+				
+				ln = lhs.parent();
+			}
+			else if (rhs.attribute())
+			{
+				// attributes go after the parent element
+				if (rhs.parent() == lhs.node()) return true;
+				
+				rn = rhs.parent();
+			}
+
+			if (ln == rn) return false;
+
+			if (!ln || !rn) return ln < rn;
+			
+			return node_is_before(ln.internal_object(), rn.internal_object());
+		}
+	};
+
+	struct duplicate_comparator
+	{
+		bool operator()(const xpath_node& lhs, const xpath_node& rhs) const
+		{
+			if (lhs.attribute()) return rhs.attribute() ? lhs.attribute() < rhs.attribute() : true;
+			else return rhs.attribute() ? false : lhs.node() < rhs.node();
+		}
+	};
+	
+	PUGI__FN double gen_nan()
+	{
+	#if defined(__STDC_IEC_559__) || ((FLT_RADIX - 0 == 2) && (FLT_MAX_EXP - 0 == 128) && (FLT_MANT_DIG - 0 == 24))
+		union { float f; uint32_t i; } u[sizeof(float) == sizeof(uint32_t) ? 1 : -1];
+		u[0].i = 0x7fc00000;
+		return u[0].f;
+	#else
+		// fallback
+		const volatile double zero = 0.0;
+		return zero / zero;
+	#endif
+	}
+	
+	PUGI__FN bool is_nan(double value)
+	{
+	#if defined(PUGI__MSVC_CRT_VERSION) || defined(__BORLANDC__)
+		return !!_isnan(value);
+	#elif defined(fpclassify) && defined(FP_NAN)
+		return fpclassify(value) == FP_NAN;
+	#else
+		// fallback
+		const volatile double v = value;
+		return v != v;
+	#endif
+	}
+	
+	PUGI__FN const char_t* convert_number_to_string_special(double value)
+	{
+	#if defined(PUGI__MSVC_CRT_VERSION) || defined(__BORLANDC__)
+		if (_finite(value)) return (value == 0) ? PUGIXML_TEXT("0") : 0;
+		if (_isnan(value)) return PUGIXML_TEXT("NaN");
+		return value > 0 ? PUGIXML_TEXT("Infinity") : PUGIXML_TEXT("-Infinity");
+	#elif defined(fpclassify) && defined(FP_NAN) && defined(FP_INFINITE) && defined(FP_ZERO)
+		switch (fpclassify(value))
+		{
+		case FP_NAN:
+			return PUGIXML_TEXT("NaN");
+
+		case FP_INFINITE:
+			return value > 0 ? PUGIXML_TEXT("Infinity") : PUGIXML_TEXT("-Infinity");
+
+		case FP_ZERO:
+			return PUGIXML_TEXT("0");
+
+		default:
+			return 0;
+		}
+	#else
+		// fallback
+		const volatile double v = value;
+
+		if (v == 0) return PUGIXML_TEXT("0");
+		if (v != v) return PUGIXML_TEXT("NaN");
+		if (v * 2 == v) return value > 0 ? PUGIXML_TEXT("Infinity") : PUGIXML_TEXT("-Infinity");
+		return 0;
+	#endif
+	}
+	
+	PUGI__FN bool convert_number_to_boolean(double value)
+	{
+		return (value != 0 && !is_nan(value));
+	}
+	
+	PUGI__FN void truncate_zeros(char* begin, char* end)
+	{
+		while (begin != end && end[-1] == '0') end--;
+
+		*end = 0;
+	}
+
+	// gets mantissa digits in the form of 0.xxxxx with 0. implied and the exponent
+#if defined(PUGI__MSVC_CRT_VERSION) && PUGI__MSVC_CRT_VERSION >= 1400 && !defined(_WIN32_WCE)
+	PUGI__FN void convert_number_to_mantissa_exponent(double value, char* buffer, size_t buffer_size, char** out_mantissa, int* out_exponent)
+	{
+		// get base values
+		int sign, exponent;
+		_ecvt_s(buffer, buffer_size, value, DBL_DIG + 1, &exponent, &sign);
+
+		// truncate redundant zeros
+		truncate_zeros(buffer, buffer + strlen(buffer));
+
+		// fill results
+		*out_mantissa = buffer;
+		*out_exponent = exponent;
+	}
+#else
+	PUGI__FN void convert_number_to_mantissa_exponent(double value, char* buffer, size_t buffer_size, char** out_mantissa, int* out_exponent)
+	{
+		// get a scientific notation value with IEEE DBL_DIG decimals
+		sprintf(buffer, "%.*e", DBL_DIG, value);
+		assert(strlen(buffer) < buffer_size);
+		(void)!buffer_size;
+
+		// get the exponent (possibly negative)
+		char* exponent_string = strchr(buffer, 'e');
+		assert(exponent_string);
+
+		int exponent = atoi(exponent_string + 1);
+
+		// extract mantissa string: skip sign
+		char* mantissa = buffer[0] == '-' ? buffer + 1 : buffer;
+		assert(mantissa[0] != '0' && mantissa[1] == '.');
+
+		// divide mantissa by 10 to eliminate integer part
+		mantissa[1] = mantissa[0];
+		mantissa++;
+		exponent++;
+
+		// remove extra mantissa digits and zero-terminate mantissa
+		truncate_zeros(mantissa, exponent_string);
+
+		// fill results
+		*out_mantissa = mantissa;
+		*out_exponent = exponent;
+	}
+#endif
+
+	PUGI__FN xpath_string convert_number_to_string(double value, xpath_allocator* alloc)
+	{
+		// try special number conversion
+		const char_t* special = convert_number_to_string_special(value);
+		if (special) return xpath_string::from_const(special);
+
+		// get mantissa + exponent form
+		char mantissa_buffer[32];
+
+		char* mantissa;
+		int exponent;
+		convert_number_to_mantissa_exponent(value, mantissa_buffer, sizeof(mantissa_buffer), &mantissa, &exponent);
+
+		// allocate a buffer of suitable length for the number
+		size_t result_size = strlen(mantissa_buffer) + (exponent > 0 ? exponent : -exponent) + 4;
+		char_t* result = static_cast<char_t*>(alloc->allocate(sizeof(char_t) * result_size));
+		assert(result);
+
+		// make the number!
+		char_t* s = result;
+
+		// sign
+		if (value < 0) *s++ = '-';
+
+		// integer part
+		if (exponent <= 0)
+		{
+			*s++ = '0';
+		}
+		else
+		{
+			while (exponent > 0)
+			{
+				assert(*mantissa == 0 || static_cast<unsigned int>(static_cast<unsigned int>(*mantissa) - '0') <= 9);
+				*s++ = *mantissa ? *mantissa++ : '0';
+				exponent--;
+			}
+		}
+
+		// fractional part
+		if (*mantissa)
+		{
+			// decimal point
+			*s++ = '.';
+
+			// extra zeroes from negative exponent
+			while (exponent < 0)
+			{
+				*s++ = '0';
+				exponent++;
+			}
+
+			// extra mantissa digits
+			while (*mantissa)
+			{
+				assert(static_cast<unsigned int>(*mantissa - '0') <= 9);
+				*s++ = *mantissa++;
+			}
+		}
+
+		// zero-terminate
+		assert(s < result + result_size);
+		*s = 0;
+
+		return xpath_string::from_heap_preallocated(result, s);
+	}
+	
+	PUGI__FN bool check_string_to_number_format(const char_t* string)
+	{
+		// parse leading whitespace
+		while (PUGI__IS_CHARTYPE(*string, ct_space)) ++string;
+
+		// parse sign
+		if (*string == '-') ++string;
+
+		if (!*string) return false;
+
+		// if there is no integer part, there should be a decimal part with at least one digit
+		if (!PUGI__IS_CHARTYPEX(string[0], ctx_digit) && (string[0] != '.' || !PUGI__IS_CHARTYPEX(string[1], ctx_digit))) return false;
+
+		// parse integer part
+		while (PUGI__IS_CHARTYPEX(*string, ctx_digit)) ++string;
+
+		// parse decimal part
+		if (*string == '.')
+		{
+			++string;
+
+			while (PUGI__IS_CHARTYPEX(*string, ctx_digit)) ++string;
+		}
+
+		// parse trailing whitespace
+		while (PUGI__IS_CHARTYPE(*string, ct_space)) ++string;
+
+		return *string == 0;
+	}
+
+	PUGI__FN double convert_string_to_number(const char_t* string)
+	{
+		// check string format
+		if (!check_string_to_number_format(string)) return gen_nan();
+
+		// parse string
+	#ifdef PUGIXML_WCHAR_MODE
+		return wcstod(string, 0);
+	#else
+		return strtod(string, 0);
+	#endif
+	}
+
+	PUGI__FN bool convert_string_to_number_scratch(char_t (&buffer)[32], const char_t* begin, const char_t* end, double* out_result)
+	{
+		size_t length = static_cast<size_t>(end - begin);
+		char_t* scratch = buffer;
+
+		if (length >= sizeof(buffer) / sizeof(buffer[0]))
+		{
+			// need to make dummy on-heap copy
+			scratch = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+			if (!scratch) return false;
+		}
+
+		// copy string to zero-terminated buffer and perform conversion
+		memcpy(scratch, begin, length * sizeof(char_t));
+		scratch[length] = 0;
+
+		*out_result = convert_string_to_number(scratch);
+
+		// free dummy buffer
+		if (scratch != buffer) xml_memory::deallocate(scratch);
+
+		return true;
+	}
+	
+	PUGI__FN double round_nearest(double value)
+	{
+		return floor(value + 0.5);
+	}
+
+	PUGI__FN double round_nearest_nzero(double value)
+	{
+		// same as round_nearest, but returns -0 for [-0.5, -0]
+		// ceil is used to differentiate between +0 and -0 (we return -0 for [-0.5, -0] and +0 for +0)
+		return (value >= -0.5 && value <= 0) ? ceil(value) : floor(value + 0.5);
+	}
+	
+	PUGI__FN const char_t* qualified_name(const xpath_node& node)
+	{
+		return node.attribute() ? node.attribute().name() : node.node().name();
+	}
+	
+	PUGI__FN const char_t* local_name(const xpath_node& node)
+	{
+		const char_t* name = qualified_name(node);
+		const char_t* p = find_char(name, ':');
+		
+		return p ? p + 1 : name;
+	}
+
+	struct namespace_uri_predicate
+	{
+		const char_t* prefix;
+		size_t prefix_length;
+
+		namespace_uri_predicate(const char_t* name)
+		{
+			const char_t* pos = find_char(name, ':');
+
+			prefix = pos ? name : 0;
+			prefix_length = pos ? static_cast<size_t>(pos - name) : 0;
+		}
+
+		bool operator()(xml_attribute a) const
+		{
+			const char_t* name = a.name();
+
+			if (!starts_with(name, PUGIXML_TEXT("xmlns"))) return false;
+
+			return prefix ? name[5] == ':' && strequalrange(name + 6, prefix, prefix_length) : name[5] == 0;
+		}
+	};
+
+	PUGI__FN const char_t* namespace_uri(xml_node node)
+	{
+		namespace_uri_predicate pred = node.name();
+		
+		xml_node p = node;
+		
+		while (p)
+		{
+			xml_attribute a = p.find_attribute(pred);
+			
+			if (a) return a.value();
+			
+			p = p.parent();
+		}
+		
+		return PUGIXML_TEXT("");
+	}
+
+	PUGI__FN const char_t* namespace_uri(xml_attribute attr, xml_node parent)
+	{
+		namespace_uri_predicate pred = attr.name();
+		
+		// Default namespace does not apply to attributes
+		if (!pred.prefix) return PUGIXML_TEXT("");
+		
+		xml_node p = parent;
+		
+		while (p)
+		{
+			xml_attribute a = p.find_attribute(pred);
+			
+			if (a) return a.value();
+			
+			p = p.parent();
+		}
+		
+		return PUGIXML_TEXT("");
+	}
+
+	PUGI__FN const char_t* namespace_uri(const xpath_node& node)
+	{
+		return node.attribute() ? namespace_uri(node.attribute(), node.parent()) : namespace_uri(node.node());
+	}
+
+	PUGI__FN char_t* normalize_space(char_t* buffer)
+	{
+		char_t* write = buffer;
+
+		for (char_t* it = buffer; *it; )
+		{
+			char_t ch = *it++;
+
+			if (PUGI__IS_CHARTYPE(ch, ct_space))
+			{
+				// replace whitespace sequence with single space
+				while (PUGI__IS_CHARTYPE(*it, ct_space)) it++;
+
+				// avoid leading spaces
+				if (write != buffer) *write++ = ' ';
+			}
+			else *write++ = ch;
+		}
+
+		// remove trailing space
+		if (write != buffer && PUGI__IS_CHARTYPE(write[-1], ct_space)) write--;
+
+		// zero-terminate
+		*write = 0;
+
+		return write;
+	}
+
+	PUGI__FN char_t* translate(char_t* buffer, const char_t* from, const char_t* to, size_t to_length)
+	{
+		char_t* write = buffer;
+
+		while (*buffer)
+		{
+			PUGI__DMC_VOLATILE char_t ch = *buffer++;
+
+			const char_t* pos = find_char(from, ch);
+
+			if (!pos)
+				*write++ = ch; // do not process
+			else if (static_cast<size_t>(pos - from) < to_length)
+				*write++ = to[pos - from]; // replace
+		}
+
+		// zero-terminate
+		*write = 0;
+
+		return write;
+	}
+
+	PUGI__FN unsigned char* translate_table_generate(xpath_allocator* alloc, const char_t* from, const char_t* to)
+	{
+		unsigned char table[128] = {0};
+
+		while (*from)
+		{
+			unsigned int fc = static_cast<unsigned int>(*from);
+			unsigned int tc = static_cast<unsigned int>(*to);
+
+			if (fc >= 128 || tc >= 128)
+				return 0;
+
+			// code=128 means "skip character"
+			if (!table[fc])
+				table[fc] = static_cast<unsigned char>(tc ? tc : 128);
+
+			from++;
+			if (tc) to++;
+		}
+
+		for (int i = 0; i < 128; ++i)
+			if (!table[i])
+				table[i] = static_cast<unsigned char>(i);
+
+		void* result = alloc->allocate_nothrow(sizeof(table));
+
+		if (result)
+		{
+			memcpy(result, table, sizeof(table));
+		}
+
+		return static_cast<unsigned char*>(result);
+	}
+
+	PUGI__FN char_t* translate_table(char_t* buffer, const unsigned char* table)
+	{
+		char_t* write = buffer;
+
+		while (*buffer)
+		{
+			char_t ch = *buffer++;
+			unsigned int index = static_cast<unsigned int>(ch);
+
+			if (index < 128)
+			{
+				unsigned char code = table[index];
+
+				// code=128 means "skip character" (table size is 128 so 128 can be a special value)
+				// this code skips these characters without extra branches
+				*write = static_cast<char_t>(code);
+				write += 1 - (code >> 7);
+			}
+			else
+			{
+				*write++ = ch;
+			}
+		}
+
+		// zero-terminate
+		*write = 0;
+
+		return write;
+	}
+
+	inline bool is_xpath_attribute(const char_t* name)
+	{
+		return !(starts_with(name, PUGIXML_TEXT("xmlns")) && (name[5] == 0 || name[5] == ':'));
+	}
+
+	struct xpath_variable_boolean: xpath_variable
+	{
+		xpath_variable_boolean(): xpath_variable(xpath_type_boolean), value(false)
+		{
+		}
+
+		bool value;
+		char_t name[1];
+	};
+
+	struct xpath_variable_number: xpath_variable
+	{
+		xpath_variable_number(): xpath_variable(xpath_type_number), value(0)
+		{
+		}
+
+		double value;
+		char_t name[1];
+	};
+
+	struct xpath_variable_string: xpath_variable
+	{
+		xpath_variable_string(): xpath_variable(xpath_type_string), value(0)
+		{
+		}
+
+		~xpath_variable_string()
+		{
+			if (value) xml_memory::deallocate(value);
+		}
+
+		char_t* value;
+		char_t name[1];
+	};
+
+	struct xpath_variable_node_set: xpath_variable
+	{
+		xpath_variable_node_set(): xpath_variable(xpath_type_node_set)
+		{
+		}
+
+		xpath_node_set value;
+		char_t name[1];
+	};
+
+	static const xpath_node_set dummy_node_set;
+
+	PUGI__FN unsigned int hash_string(const char_t* str)
+	{
+		// Jenkins one-at-a-time hash (http://en.wikipedia.org/wiki/Jenkins_hash_function#one-at-a-time)
+		unsigned int result = 0;
+
+		while (*str)
+		{
+			result += static_cast<unsigned int>(*str++);
+			result += result << 10;
+			result ^= result >> 6;
+		}
+	
+		result += result << 3;
+		result ^= result >> 11;
+		result += result << 15;
+	
+		return result;
+	}
+
+	template <typename T> PUGI__FN T* new_xpath_variable(const char_t* name)
+	{
+		size_t length = strlength(name);
+		if (length == 0) return 0; // empty variable names are invalid
+
+		// $$ we can't use offsetof(T, name) because T is non-POD, so we just allocate additional length characters
+		void* memory = xml_memory::allocate(sizeof(T) + length * sizeof(char_t));
+		if (!memory) return 0;
+
+		T* result = new (memory) T();
+
+		memcpy(result->name, name, (length + 1) * sizeof(char_t));
+
+		return result;
+	}
+
+	PUGI__FN xpath_variable* new_xpath_variable(xpath_value_type type, const char_t* name)
+	{
+		switch (type)
+		{
+		case xpath_type_node_set:
+			return new_xpath_variable<xpath_variable_node_set>(name);
+
+		case xpath_type_number:
+			return new_xpath_variable<xpath_variable_number>(name);
+
+		case xpath_type_string:
+			return new_xpath_variable<xpath_variable_string>(name);
+
+		case xpath_type_boolean:
+			return new_xpath_variable<xpath_variable_boolean>(name);
+
+		default:
+			return 0;
+		}
+	}
+
+	template <typename T> PUGI__FN void delete_xpath_variable(T* var)
+	{
+		var->~T();
+		xml_memory::deallocate(var);
+	}
+
+	PUGI__FN void delete_xpath_variable(xpath_value_type type, xpath_variable* var)
+	{
+		switch (type)
+		{
+		case xpath_type_node_set:
+			delete_xpath_variable(static_cast<xpath_variable_node_set*>(var));
+			break;
+
+		case xpath_type_number:
+			delete_xpath_variable(static_cast<xpath_variable_number*>(var));
+			break;
+
+		case xpath_type_string:
+			delete_xpath_variable(static_cast<xpath_variable_string*>(var));
+			break;
+
+		case xpath_type_boolean:
+			delete_xpath_variable(static_cast<xpath_variable_boolean*>(var));
+			break;
+
+		default:
+			assert(!"Invalid variable type");
+		}
+	}
+
+	PUGI__FN bool copy_xpath_variable(xpath_variable* lhs, const xpath_variable* rhs)
+	{
+		switch (rhs->type())
+		{
+		case xpath_type_node_set:
+			return lhs->set(static_cast<const xpath_variable_node_set*>(rhs)->value);
+
+		case xpath_type_number:
+			return lhs->set(static_cast<const xpath_variable_number*>(rhs)->value);
+
+		case xpath_type_string:
+			return lhs->set(static_cast<const xpath_variable_string*>(rhs)->value);
+
+		case xpath_type_boolean:
+			return lhs->set(static_cast<const xpath_variable_boolean*>(rhs)->value);
+
+		default:
+			assert(!"Invalid variable type");
+			return false;
+		}
+	}
+
+	PUGI__FN bool get_variable_scratch(char_t (&buffer)[32], xpath_variable_set* set, const char_t* begin, const char_t* end, xpath_variable** out_result)
+	{
+		size_t length = static_cast<size_t>(end - begin);
+		char_t* scratch = buffer;
+
+		if (length >= sizeof(buffer) / sizeof(buffer[0]))
+		{
+			// need to make dummy on-heap copy
+			scratch = static_cast<char_t*>(xml_memory::allocate((length + 1) * sizeof(char_t)));
+			if (!scratch) return false;
+		}
+
+		// copy string to zero-terminated buffer and perform lookup
+		memcpy(scratch, begin, length * sizeof(char_t));
+		scratch[length] = 0;
+
+		*out_result = set->get(scratch);
+
+		// free dummy buffer
+		if (scratch != buffer) xml_memory::deallocate(scratch);
+
+		return true;
+	}
+PUGI__NS_END
+
+// Internal node set class
+PUGI__NS_BEGIN
+	PUGI__FN xpath_node_set::type_t xpath_get_order(const xpath_node* begin, const xpath_node* end)
+	{
+		if (end - begin < 2)
+			return xpath_node_set::type_sorted;
+
+		document_order_comparator cmp;
+
+		bool first = cmp(begin[0], begin[1]);
+
+		for (const xpath_node* it = begin + 1; it + 1 < end; ++it)
+			if (cmp(it[0], it[1]) != first)
+				return xpath_node_set::type_unsorted;
+
+		return first ? xpath_node_set::type_sorted : xpath_node_set::type_sorted_reverse;
+	}
+
+	PUGI__FN xpath_node_set::type_t xpath_sort(xpath_node* begin, xpath_node* end, xpath_node_set::type_t type, bool rev)
+	{
+		xpath_node_set::type_t order = rev ? xpath_node_set::type_sorted_reverse : xpath_node_set::type_sorted;
+
+		if (type == xpath_node_set::type_unsorted)
+		{
+			xpath_node_set::type_t sorted = xpath_get_order(begin, end);
+
+			if (sorted == xpath_node_set::type_unsorted)
+			{
+				sort(begin, end, document_order_comparator());
+
+				type = xpath_node_set::type_sorted;
+			}
+			else
+				type = sorted;
+		}
+		
+		if (type != order) reverse(begin, end);
+			
+		return order;
+	}
+
+	PUGI__FN xpath_node xpath_first(const xpath_node* begin, const xpath_node* end, xpath_node_set::type_t type)
+	{
+		if (begin == end) return xpath_node();
+
+		switch (type)
+		{
+		case xpath_node_set::type_sorted:
+			return *begin;
+
+		case xpath_node_set::type_sorted_reverse:
+			return *(end - 1);
+
+		case xpath_node_set::type_unsorted:
+			return *min_element(begin, end, document_order_comparator());
+
+		default:
+			assert(!"Invalid node set type");
+			return xpath_node();
+		}
+	}
+
+	class xpath_node_set_raw
+	{
+		xpath_node_set::type_t _type;
+
+		xpath_node* _begin;
+		xpath_node* _end;
+		xpath_node* _eos;
+
+	public:
+		xpath_node_set_raw(): _type(xpath_node_set::type_unsorted), _begin(0), _end(0), _eos(0)
+		{
+		}
+
+		xpath_node* begin() const
+		{
+			return _begin;
+		}
+
+		xpath_node* end() const
+		{
+			return _end;
+		}
+
+		bool empty() const
+		{
+			return _begin == _end;
+		}
+
+		size_t size() const
+		{
+			return static_cast<size_t>(_end - _begin);
+		}
+
+		xpath_node first() const
+		{
+			return xpath_first(_begin, _end, _type);
+		}
+
+		void push_back_grow(const xpath_node& node, xpath_allocator* alloc);
+
+		void push_back(const xpath_node& node, xpath_allocator* alloc)
+		{
+			if (_end != _eos)
+				*_end++ = node;
+			else
+				push_back_grow(node, alloc);
+		}
+
+		void append(const xpath_node* begin_, const xpath_node* end_, xpath_allocator* alloc)
+		{
+			if (begin_ == end_) return;
+
+			size_t size_ = static_cast<size_t>(_end - _begin);
+			size_t capacity = static_cast<size_t>(_eos - _begin);
+			size_t count = static_cast<size_t>(end_ - begin_);
+
+			if (size_ + count > capacity)
+			{
+				// reallocate the old array or allocate a new one
+				xpath_node* data = static_cast<xpath_node*>(alloc->reallocate(_begin, capacity * sizeof(xpath_node), (size_ + count) * sizeof(xpath_node)));
+				assert(data);
+
+				// finalize
+				_begin = data;
+				_end = data + size_;
+				_eos = data + size_ + count;
+			}
+
+			memcpy(_end, begin_, count * sizeof(xpath_node));
+			_end += count;
+		}
+
+		void sort_do()
+		{
+			_type = xpath_sort(_begin, _end, _type, false);
+		}
+
+		void truncate(xpath_node* pos)
+		{
+			assert(_begin <= pos && pos <= _end);
+
+			_end = pos;
+		}
+
+		void remove_duplicates()
+		{
+			if (_type == xpath_node_set::type_unsorted)
+				sort(_begin, _end, duplicate_comparator());
+		
+			_end = unique(_begin, _end);
+		}
+
+		xpath_node_set::type_t type() const
+		{
+			return _type;
+		}
+
+		void set_type(xpath_node_set::type_t value)
+		{
+			_type = value;
+		}
+	};
+
+	PUGI__FN_NO_INLINE void xpath_node_set_raw::push_back_grow(const xpath_node& node, xpath_allocator* alloc)
+	{
+		size_t capacity = static_cast<size_t>(_eos - _begin);
+
+		// get new capacity (1.5x rule)
+		size_t new_capacity = capacity + capacity / 2 + 1;
+
+		// reallocate the old array or allocate a new one
+		xpath_node* data = static_cast<xpath_node*>(alloc->reallocate(_begin, capacity * sizeof(xpath_node), new_capacity * sizeof(xpath_node)));
+		assert(data);
+
+		// finalize
+		_begin = data;
+		_end = data + capacity;
+		_eos = data + new_capacity;
+
+		// push
+		*_end++ = node;
+	}
+PUGI__NS_END
+
+PUGI__NS_BEGIN
+	struct xpath_context
+	{
+		xpath_node n;
+		size_t position, size;
+
+		xpath_context(const xpath_node& n_, size_t position_, size_t size_): n(n_), position(position_), size(size_)
+		{
+		}
+	};
+
+	enum lexeme_t
+	{
+		lex_none = 0,
+		lex_equal,
+		lex_not_equal,
+		lex_less,
+		lex_greater,
+		lex_less_or_equal,
+		lex_greater_or_equal,
+		lex_plus,
+		lex_minus,
+		lex_multiply,
+		lex_union,
+		lex_var_ref,
+		lex_open_brace,
+		lex_close_brace,
+		lex_quoted_string,
+		lex_number,
+		lex_slash,
+		lex_double_slash,
+		lex_open_square_brace,
+		lex_close_square_brace,
+		lex_string,
+		lex_comma,
+		lex_axis_attribute,
+		lex_dot,
+		lex_double_dot,
+		lex_double_colon,
+		lex_eof
+	};
+
+	struct xpath_lexer_string
+	{
+		const char_t* begin;
+		const char_t* end;
+
+		xpath_lexer_string(): begin(0), end(0)
+		{
+		}
+
+		bool operator==(const char_t* other) const
+		{
+			size_t length = static_cast<size_t>(end - begin);
+
+			return strequalrange(other, begin, length);
+		}
+	};
+
+	class xpath_lexer
+	{
+		const char_t* _cur;
+		const char_t* _cur_lexeme_pos;
+		xpath_lexer_string _cur_lexeme_contents;
+
+		lexeme_t _cur_lexeme;
+
+	public:
+		explicit xpath_lexer(const char_t* query): _cur(query)
+		{
+			next();
+		}
+		
+		const char_t* state() const
+		{
+			return _cur;
+		}
+		
+		void next()
+		{
+			const char_t* cur = _cur;
+
+			while (PUGI__IS_CHARTYPE(*cur, ct_space)) ++cur;
+
+			// save lexeme position for error reporting
+			_cur_lexeme_pos = cur;
+
+			switch (*cur)
+			{
+			case 0:
+				_cur_lexeme = lex_eof;
+				break;
+			
+			case '>':
+				if (*(cur+1) == '=')
+				{
+					cur += 2;
+					_cur_lexeme = lex_greater_or_equal;
+				}
+				else
+				{
+					cur += 1;
+					_cur_lexeme = lex_greater;
+				}
+				break;
+
+			case '<':
+				if (*(cur+1) == '=')
+				{
+					cur += 2;
+					_cur_lexeme = lex_less_or_equal;
+				}
+				else
+				{
+					cur += 1;
+					_cur_lexeme = lex_less;
+				}
+				break;
+
+			case '!':
+				if (*(cur+1) == '=')
+				{
+					cur += 2;
+					_cur_lexeme = lex_not_equal;
+				}
+				else
+				{
+					_cur_lexeme = lex_none;
+				}
+				break;
+
+			case '=':
+				cur += 1;
+				_cur_lexeme = lex_equal;
+
+				break;
+			
+			case '+':
+				cur += 1;
+				_cur_lexeme = lex_plus;
+
+				break;
+
+			case '-':
+				cur += 1;
+				_cur_lexeme = lex_minus;
+
+				break;
+
+			case '*':
+				cur += 1;
+				_cur_lexeme = lex_multiply;
+
+				break;
+
+			case '|':
+				cur += 1;
+				_cur_lexeme = lex_union;
+
+				break;
+			
+			case '$':
+				cur += 1;
+
+				if (PUGI__IS_CHARTYPEX(*cur, ctx_start_symbol))
+				{
+					_cur_lexeme_contents.begin = cur;
+
+					while (PUGI__IS_CHARTYPEX(*cur, ctx_symbol)) cur++;
+
+					if (cur[0] == ':' && PUGI__IS_CHARTYPEX(cur[1], ctx_symbol)) // qname
+					{
+						cur++; // :
+
+						while (PUGI__IS_CHARTYPEX(*cur, ctx_symbol)) cur++;
+					}
+
+					_cur_lexeme_contents.end = cur;
+				
+					_cur_lexeme = lex_var_ref;
+				}
+				else
+				{
+					_cur_lexeme = lex_none;
+				}
+
+				break;
+
+			case '(':
+				cur += 1;
+				_cur_lexeme = lex_open_brace;
+
+				break;
+
+			case ')':
+				cur += 1;
+				_cur_lexeme = lex_close_brace;
+
+				break;
+			
+			case '[':
+				cur += 1;
+				_cur_lexeme = lex_open_square_brace;
+
+				break;
+
+			case ']':
+				cur += 1;
+				_cur_lexeme = lex_close_square_brace;
+
+				break;
+
+			case ',':
+				cur += 1;
+				_cur_lexeme = lex_comma;
+
+				break;
+
+			case '/':
+				if (*(cur+1) == '/')
+				{
+					cur += 2;
+					_cur_lexeme = lex_double_slash;
+				}
+				else
+				{
+					cur += 1;
+					_cur_lexeme = lex_slash;
+				}
+				break;
+		
+			case '.':
+				if (*(cur+1) == '.')
+				{
+					cur += 2;
+					_cur_lexeme = lex_double_dot;
+				}
+				else if (PUGI__IS_CHARTYPEX(*(cur+1), ctx_digit))
+				{
+					_cur_lexeme_contents.begin = cur; // .
+
+					++cur;
+
+					while (PUGI__IS_CHARTYPEX(*cur, ctx_digit)) cur++;
+
+					_cur_lexeme_contents.end = cur;
+					
+					_cur_lexeme = lex_number;
+				}
+				else
+				{
+					cur += 1;
+					_cur_lexeme = lex_dot;
+				}
+				break;
+
+			case '@':
+				cur += 1;
+				_cur_lexeme = lex_axis_attribute;
+
+				break;
+
+			case '"':
+			case '\'':
+			{
+				char_t terminator = *cur;
+
+				++cur;
+
+				_cur_lexeme_contents.begin = cur;
+				while (*cur && *cur != terminator) cur++;
+				_cur_lexeme_contents.end = cur;
+				
+				if (!*cur)
+					_cur_lexeme = lex_none;
+				else
+				{
+					cur += 1;
+					_cur_lexeme = lex_quoted_string;
+				}
+
+				break;
+			}
+
+			case ':':
+				if (*(cur+1) == ':')
+				{
+					cur += 2;
+					_cur_lexeme = lex_double_colon;
+				}
+				else
+				{
+					_cur_lexeme = lex_none;
+				}
+				break;
+
+			default:
+				if (PUGI__IS_CHARTYPEX(*cur, ctx_digit))
+				{
+					_cur_lexeme_contents.begin = cur;
+
+					while (PUGI__IS_CHARTYPEX(*cur, ctx_digit)) cur++;
+				
+					if (*cur == '.')
+					{
+						cur++;
+
+						while (PUGI__IS_CHARTYPEX(*cur, ctx_digit)) cur++;
+					}
+
+					_cur_lexeme_contents.end = cur;
+
+					_cur_lexeme = lex_number;
+				}
+				else if (PUGI__IS_CHARTYPEX(*cur, ctx_start_symbol))
+				{
+					_cur_lexeme_contents.begin = cur;
+
+					while (PUGI__IS_CHARTYPEX(*cur, ctx_symbol)) cur++;
+
+					if (cur[0] == ':')
+					{
+						if (cur[1] == '*') // namespace test ncname:*
+						{
+							cur += 2; // :*
+						}
+						else if (PUGI__IS_CHARTYPEX(cur[1], ctx_symbol)) // namespace test qname
+						{
+							cur++; // :
+
+							while (PUGI__IS_CHARTYPEX(*cur, ctx_symbol)) cur++;
+						}
+					}
+
+					_cur_lexeme_contents.end = cur;
+				
+					_cur_lexeme = lex_string;
+				}
+				else
+				{
+					_cur_lexeme = lex_none;
+				}
+			}
+
+			_cur = cur;
+		}
+
+		lexeme_t current() const
+		{
+			return _cur_lexeme;
+		}
+
+		const char_t* current_pos() const
+		{
+			return _cur_lexeme_pos;
+		}
+
+		const xpath_lexer_string& contents() const
+		{
+			assert(_cur_lexeme == lex_var_ref || _cur_lexeme == lex_number || _cur_lexeme == lex_string || _cur_lexeme == lex_quoted_string);
+
+			return _cur_lexeme_contents;
+		}
+	};
+
+	enum ast_type_t
+	{
+		ast_unknown,
+		ast_op_or,						// left or right
+		ast_op_and,						// left and right
+		ast_op_equal,					// left = right
+		ast_op_not_equal,				// left != right
+		ast_op_less,					// left < right
+		ast_op_greater,					// left > right
+		ast_op_less_or_equal,			// left <= right
+		ast_op_greater_or_equal,		// left >= right
+		ast_op_add,						// left + right
+		ast_op_subtract,				// left - right
+		ast_op_multiply,				// left * right
+		ast_op_divide,					// left / right
+		ast_op_mod,						// left % right
+		ast_op_negate,					// left - right
+		ast_op_union,					// left | right
+		ast_predicate,					// apply predicate to set; next points to next predicate
+		ast_filter,						// select * from left where right
+		ast_string_constant,			// string constant
+		ast_number_constant,			// number constant
+		ast_variable,					// variable
+		ast_func_last,					// last()
+		ast_func_position,				// position()
+		ast_func_count,					// count(left)
+		ast_func_id,					// id(left)
+		ast_func_local_name_0,			// local-name()
+		ast_func_local_name_1,			// local-name(left)
+		ast_func_namespace_uri_0,		// namespace-uri()
+		ast_func_namespace_uri_1,		// namespace-uri(left)
+		ast_func_name_0,				// name()
+		ast_func_name_1,				// name(left)
+		ast_func_string_0,				// string()
+		ast_func_string_1,				// string(left)
+		ast_func_concat,				// concat(left, right, siblings)
+		ast_func_starts_with,			// starts_with(left, right)
+		ast_func_contains,				// contains(left, right)
+		ast_func_substring_before,		// substring-before(left, right)
+		ast_func_substring_after,		// substring-after(left, right)
+		ast_func_substring_2,			// substring(left, right)
+		ast_func_substring_3,			// substring(left, right, third)
+		ast_func_string_length_0,		// string-length()
+		ast_func_string_length_1,		// string-length(left)
+		ast_func_normalize_space_0,		// normalize-space()
+		ast_func_normalize_space_1,		// normalize-space(left)
+		ast_func_translate,				// translate(left, right, third)
+		ast_func_boolean,				// boolean(left)
+		ast_func_not,					// not(left)
+		ast_func_true,					// true()
+		ast_func_false,					// false()
+		ast_func_lang,					// lang(left)
+		ast_func_number_0,				// number()
+		ast_func_number_1,				// number(left)
+		ast_func_sum,					// sum(left)
+		ast_func_floor,					// floor(left)
+		ast_func_ceiling,				// ceiling(left)
+		ast_func_round,					// round(left)
+		ast_step,						// process set left with step
+		ast_step_root,					// select root node
+
+		ast_opt_translate_table,		// translate(left, right, third) where right/third are constants
+		ast_opt_compare_attribute		// @name = 'string'
+	};
+
+	enum axis_t
+	{
+		axis_ancestor,
+		axis_ancestor_or_self,
+		axis_attribute,
+		axis_child,
+		axis_descendant,
+		axis_descendant_or_self,
+		axis_following,
+		axis_following_sibling,
+		axis_namespace,
+		axis_parent,
+		axis_preceding,
+		axis_preceding_sibling,
+		axis_self
+	};
+	
+	enum nodetest_t
+	{
+		nodetest_none,
+		nodetest_name,
+		nodetest_type_node,
+		nodetest_type_comment,
+		nodetest_type_pi,
+		nodetest_type_text,
+		nodetest_pi,
+		nodetest_all,
+		nodetest_all_in_namespace
+	};
+
+	enum predicate_t
+	{
+		predicate_default,
+		predicate_posinv,
+		predicate_constant,
+		predicate_constant_one
+	};
+
+	enum nodeset_eval_t
+	{
+		nodeset_eval_all,
+		nodeset_eval_any,
+		nodeset_eval_first
+	};
+
+	template <axis_t N> struct axis_to_type
+	{
+		static const axis_t axis;
+	};
+
+	template <axis_t N> const axis_t axis_to_type<N>::axis = N;
+		
+	class xpath_ast_node
+	{
+	private:
+		// node type
+		char _type;
+		char _rettype;
+
+		// for ast_step
+		char _axis;
+
+		// for ast_step/ast_predicate/ast_filter
+		char _test;
+
+		// tree node structure
+		xpath_ast_node* _left;
+		xpath_ast_node* _right;
+		xpath_ast_node* _next;
+
+		union
+		{
+			// value for ast_string_constant
+			const char_t* string;
+			// value for ast_number_constant
+			double number;
+			// variable for ast_variable
+			xpath_variable* variable;
+			// node test for ast_step (node name/namespace/node type/pi target)
+			const char_t* nodetest;
+			// table for ast_opt_translate_table
+			const unsigned char* table;
+		} _data;
+
+		xpath_ast_node(const xpath_ast_node&);
+		xpath_ast_node& operator=(const xpath_ast_node&);
+
+		template <class Comp> static bool compare_eq(xpath_ast_node* lhs, xpath_ast_node* rhs, const xpath_context& c, const xpath_stack& stack, const Comp& comp)
+		{
+			xpath_value_type lt = lhs->rettype(), rt = rhs->rettype();
+
+			if (lt != xpath_type_node_set && rt != xpath_type_node_set)
+			{
+				if (lt == xpath_type_boolean || rt == xpath_type_boolean)
+					return comp(lhs->eval_boolean(c, stack), rhs->eval_boolean(c, stack));
+				else if (lt == xpath_type_number || rt == xpath_type_number)
+					return comp(lhs->eval_number(c, stack), rhs->eval_number(c, stack));
+				else if (lt == xpath_type_string || rt == xpath_type_string)
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					xpath_string ls = lhs->eval_string(c, stack);
+					xpath_string rs = rhs->eval_string(c, stack);
+
+					return comp(ls, rs);
+				}
+			}
+			else if (lt == xpath_type_node_set && rt == xpath_type_node_set)
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_node_set_raw ls = lhs->eval_node_set(c, stack, nodeset_eval_all);
+				xpath_node_set_raw rs = rhs->eval_node_set(c, stack, nodeset_eval_all);
+
+				for (const xpath_node* li = ls.begin(); li != ls.end(); ++li)
+					for (const xpath_node* ri = rs.begin(); ri != rs.end(); ++ri)
+					{
+						xpath_allocator_capture cri(stack.result);
+
+						if (comp(string_value(*li, stack.result), string_value(*ri, stack.result)))
+							return true;
+					}
+
+				return false;
+			}
+			else
+			{
+				if (lt == xpath_type_node_set)
+				{
+					swap(lhs, rhs);
+					swap(lt, rt);
+				}
+
+				if (lt == xpath_type_boolean)
+					return comp(lhs->eval_boolean(c, stack), rhs->eval_boolean(c, stack));
+				else if (lt == xpath_type_number)
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					double l = lhs->eval_number(c, stack);
+					xpath_node_set_raw rs = rhs->eval_node_set(c, stack, nodeset_eval_all);
+
+					for (const xpath_node* ri = rs.begin(); ri != rs.end(); ++ri)
+					{
+						xpath_allocator_capture cri(stack.result);
+
+						if (comp(l, convert_string_to_number(string_value(*ri, stack.result).c_str())))
+							return true;
+					}
+
+					return false;
+				}
+				else if (lt == xpath_type_string)
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					xpath_string l = lhs->eval_string(c, stack);
+					xpath_node_set_raw rs = rhs->eval_node_set(c, stack, nodeset_eval_all);
+
+					for (const xpath_node* ri = rs.begin(); ri != rs.end(); ++ri)
+					{
+						xpath_allocator_capture cri(stack.result);
+
+						if (comp(l, string_value(*ri, stack.result)))
+							return true;
+					}
+
+					return false;
+				}
+			}
+
+			assert(!"Wrong types");
+			return false;
+		}
+
+		static bool eval_once(xpath_node_set::type_t type, nodeset_eval_t eval)
+		{
+			return type == xpath_node_set::type_sorted ? eval != nodeset_eval_all : eval == nodeset_eval_any;
+		}
+
+		template <class Comp> static bool compare_rel(xpath_ast_node* lhs, xpath_ast_node* rhs, const xpath_context& c, const xpath_stack& stack, const Comp& comp)
+		{
+			xpath_value_type lt = lhs->rettype(), rt = rhs->rettype();
+
+			if (lt != xpath_type_node_set && rt != xpath_type_node_set)
+				return comp(lhs->eval_number(c, stack), rhs->eval_number(c, stack));
+			else if (lt == xpath_type_node_set && rt == xpath_type_node_set)
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_node_set_raw ls = lhs->eval_node_set(c, stack, nodeset_eval_all);
+				xpath_node_set_raw rs = rhs->eval_node_set(c, stack, nodeset_eval_all);
+
+				for (const xpath_node* li = ls.begin(); li != ls.end(); ++li)
+				{
+					xpath_allocator_capture cri(stack.result);
+
+					double l = convert_string_to_number(string_value(*li, stack.result).c_str());
+
+					for (const xpath_node* ri = rs.begin(); ri != rs.end(); ++ri)
+					{
+						xpath_allocator_capture crii(stack.result);
+
+						if (comp(l, convert_string_to_number(string_value(*ri, stack.result).c_str())))
+							return true;
+					}
+				}
+
+				return false;
+			}
+			else if (lt != xpath_type_node_set && rt == xpath_type_node_set)
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				double l = lhs->eval_number(c, stack);
+				xpath_node_set_raw rs = rhs->eval_node_set(c, stack, nodeset_eval_all);
+
+				for (const xpath_node* ri = rs.begin(); ri != rs.end(); ++ri)
+				{
+					xpath_allocator_capture cri(stack.result);
+
+					if (comp(l, convert_string_to_number(string_value(*ri, stack.result).c_str())))
+						return true;
+				}
+
+				return false;
+			}
+			else if (lt == xpath_type_node_set && rt != xpath_type_node_set)
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_node_set_raw ls = lhs->eval_node_set(c, stack, nodeset_eval_all);
+				double r = rhs->eval_number(c, stack);
+
+				for (const xpath_node* li = ls.begin(); li != ls.end(); ++li)
+				{
+					xpath_allocator_capture cri(stack.result);
+
+					if (comp(convert_string_to_number(string_value(*li, stack.result).c_str()), r))
+						return true;
+				}
+
+				return false;
+			}
+			else
+			{
+				assert(!"Wrong types");
+				return false;
+			}
+		}
+
+		static void apply_predicate_boolean(xpath_node_set_raw& ns, size_t first, xpath_ast_node* expr, const xpath_stack& stack, bool once)
+		{
+			assert(ns.size() >= first);
+			assert(expr->rettype() != xpath_type_number);
+
+			size_t i = 1;
+			size_t size = ns.size() - first;
+
+			xpath_node* last = ns.begin() + first;
+
+			// remove_if... or well, sort of
+			for (xpath_node* it = last; it != ns.end(); ++it, ++i)
+			{
+				xpath_context c(*it, i, size);
+
+				if (expr->eval_boolean(c, stack))
+				{
+					*last++ = *it;
+
+					if (once) break;
+				}
+			}
+
+			ns.truncate(last);
+		}
+
+		static void apply_predicate_number(xpath_node_set_raw& ns, size_t first, xpath_ast_node* expr, const xpath_stack& stack, bool once)
+		{
+			assert(ns.size() >= first);
+			assert(expr->rettype() == xpath_type_number);
+
+			size_t i = 1;
+			size_t size = ns.size() - first;
+
+			xpath_node* last = ns.begin() + first;
+
+			// remove_if... or well, sort of
+			for (xpath_node* it = last; it != ns.end(); ++it, ++i)
+			{
+				xpath_context c(*it, i, size);
+
+				if (expr->eval_number(c, stack) == i)
+				{
+					*last++ = *it;
+
+					if (once) break;
+				}
+			}
+
+			ns.truncate(last);
+		}
+
+		static void apply_predicate_number_const(xpath_node_set_raw& ns, size_t first, xpath_ast_node* expr, const xpath_stack& stack)
+		{
+			assert(ns.size() >= first);
+			assert(expr->rettype() == xpath_type_number);
+
+			size_t size = ns.size() - first;
+
+			xpath_node* last = ns.begin() + first;
+
+			xpath_context c(xpath_node(), 1, size);
+
+			double er = expr->eval_number(c, stack);
+
+			if (er >= 1.0 && er <= size)
+			{
+				size_t eri = static_cast<size_t>(er);
+
+				if (er == eri)
+				{
+					xpath_node r = last[eri - 1];
+
+					*last++ = r;
+				}
+			}
+
+			ns.truncate(last);
+		}
+
+		void apply_predicate(xpath_node_set_raw& ns, size_t first, const xpath_stack& stack, bool once)
+		{
+			if (ns.size() == first) return;
+
+			assert(_type == ast_filter || _type == ast_predicate);
+
+			if (_test == predicate_constant || _test == predicate_constant_one)
+				apply_predicate_number_const(ns, first, _right, stack);
+			else if (_right->rettype() == xpath_type_number)
+				apply_predicate_number(ns, first, _right, stack, once);
+			else
+				apply_predicate_boolean(ns, first, _right, stack, once);
+		}
+
+		void apply_predicates(xpath_node_set_raw& ns, size_t first, const xpath_stack& stack, nodeset_eval_t eval)
+		{
+			if (ns.size() == first) return;
+
+			bool last_once = eval_once(ns.type(), eval);
+
+			for (xpath_ast_node* pred = _right; pred; pred = pred->_next)
+				pred->apply_predicate(ns, first, stack, !pred->_next && last_once);
+		}
+
+		bool step_push(xpath_node_set_raw& ns, xml_attribute_struct* a, xml_node_struct* parent, xpath_allocator* alloc)
+		{
+			assert(a);
+
+			const char_t* name = a->name ? a->name + 0 : PUGIXML_TEXT("");
+
+			switch (_test)
+			{
+			case nodetest_name:
+				if (strequal(name, _data.nodetest) && is_xpath_attribute(name))
+				{
+					ns.push_back(xpath_node(xml_attribute(a), xml_node(parent)), alloc);
+					return true;
+				}
+				break;
+				
+			case nodetest_type_node:
+			case nodetest_all:
+				if (is_xpath_attribute(name))
+				{
+					ns.push_back(xpath_node(xml_attribute(a), xml_node(parent)), alloc);
+					return true;
+				}
+				break;
+				
+			case nodetest_all_in_namespace:
+				if (starts_with(name, _data.nodetest) && is_xpath_attribute(name))
+				{
+					ns.push_back(xpath_node(xml_attribute(a), xml_node(parent)), alloc);
+					return true;
+				}
+				break;
+			
+			default:
+				;
+			}
+
+			return false;
+		}
+		
+		bool step_push(xpath_node_set_raw& ns, xml_node_struct* n, xpath_allocator* alloc)
+		{
+			assert(n);
+
+			xml_node_type type = PUGI__NODETYPE(n);
+
+			switch (_test)
+			{
+			case nodetest_name:
+				if (type == node_element && n->name && strequal(n->name, _data.nodetest))
+				{
+					ns.push_back(xml_node(n), alloc);
+					return true;
+				}
+				break;
+				
+			case nodetest_type_node:
+				ns.push_back(xml_node(n), alloc);
+				return true;
+				
+			case nodetest_type_comment:
+				if (type == node_comment)
+				{
+					ns.push_back(xml_node(n), alloc);
+					return true;
+				}
+				break;
+				
+			case nodetest_type_text:
+				if (type == node_pcdata || type == node_cdata)
+				{
+					ns.push_back(xml_node(n), alloc);
+					return true;
+				}
+				break;
+				
+			case nodetest_type_pi:
+				if (type == node_pi)
+				{
+					ns.push_back(xml_node(n), alloc);
+					return true;
+				}
+				break;
+									
+			case nodetest_pi:
+				if (type == node_pi && n->name && strequal(n->name, _data.nodetest))
+				{
+					ns.push_back(xml_node(n), alloc);
+					return true;
+				}
+				break;
+				
+			case nodetest_all:
+				if (type == node_element)
+				{
+					ns.push_back(xml_node(n), alloc);
+					return true;
+				}
+				break;
+				
+			case nodetest_all_in_namespace:
+				if (type == node_element && n->name && starts_with(n->name, _data.nodetest))
+				{
+					ns.push_back(xml_node(n), alloc);
+					return true;
+				}
+				break;
+
+			default:
+				assert(!"Unknown axis");
+			}
+
+			return false;
+		}
+
+		template <class T> void step_fill(xpath_node_set_raw& ns, xml_node_struct* n, xpath_allocator* alloc, bool once, T)
+		{
+			const axis_t axis = T::axis;
+
+			switch (axis)
+			{
+			case axis_attribute:
+			{
+				for (xml_attribute_struct* a = n->first_attribute; a; a = a->next_attribute)
+					if (step_push(ns, a, n, alloc) & once)
+						return;
+				
+				break;
+			}
+			
+			case axis_child:
+			{
+				for (xml_node_struct* c = n->first_child; c; c = c->next_sibling)
+					if (step_push(ns, c, alloc) & once)
+						return;
+					
+				break;
+			}
+			
+			case axis_descendant:
+			case axis_descendant_or_self:
+			{
+				if (axis == axis_descendant_or_self)
+					if (step_push(ns, n, alloc) & once)
+						return;
+					
+				xml_node_struct* cur = n->first_child;
+				
+				while (cur)
+				{
+					if (step_push(ns, cur, alloc) & once)
+						return;
+					
+					if (cur->first_child)
+						cur = cur->first_child;
+					else
+					{
+						while (!cur->next_sibling)
+						{
+							cur = cur->parent;
+
+							if (cur == n) return;
+						}
+					
+						cur = cur->next_sibling;
+					}
+				}
+				
+				break;
+			}
+			
+			case axis_following_sibling:
+			{
+				for (xml_node_struct* c = n->next_sibling; c; c = c->next_sibling)
+					if (step_push(ns, c, alloc) & once)
+						return;
+				
+				break;
+			}
+			
+			case axis_preceding_sibling:
+			{
+				for (xml_node_struct* c = n->prev_sibling_c; c->next_sibling; c = c->prev_sibling_c)
+					if (step_push(ns, c, alloc) & once)
+						return;
+				
+				break;
+			}
+			
+			case axis_following:
+			{
+				xml_node_struct* cur = n;
+
+				// exit from this node so that we don't include descendants
+				while (!cur->next_sibling)
+				{
+					cur = cur->parent;
+
+					if (!cur) return;
+				}
+
+				cur = cur->next_sibling;
+
+				while (cur)
+				{
+					if (step_push(ns, cur, alloc) & once)
+						return;
+
+					if (cur->first_child)
+						cur = cur->first_child;
+					else
+					{
+						while (!cur->next_sibling)
+						{
+							cur = cur->parent;
+
+							if (!cur) return;
+						}
+
+						cur = cur->next_sibling;
+					}
+				}
+
+				break;
+			}
+
+			case axis_preceding:
+			{
+				xml_node_struct* cur = n;
+
+				// exit from this node so that we don't include descendants
+				while (!cur->prev_sibling_c->next_sibling)
+				{
+					cur = cur->parent;
+
+					if (!cur) return;
+				}
+
+				cur = cur->prev_sibling_c;
+
+				while (cur)
+				{
+					if (cur->first_child)
+						cur = cur->first_child->prev_sibling_c;
+					else
+					{
+						// leaf node, can't be ancestor
+						if (step_push(ns, cur, alloc) & once)
+							return;
+
+						while (!cur->prev_sibling_c->next_sibling)
+						{
+							cur = cur->parent;
+
+							if (!cur) return;
+
+							if (!node_is_ancestor(cur, n))
+								if (step_push(ns, cur, alloc) & once)
+									return;
+						}
+
+						cur = cur->prev_sibling_c;
+					}
+				}
+
+				break;
+			}
+			
+			case axis_ancestor:
+			case axis_ancestor_or_self:
+			{
+				if (axis == axis_ancestor_or_self)
+					if (step_push(ns, n, alloc) & once)
+						return;
+
+				xml_node_struct* cur = n->parent;
+				
+				while (cur)
+				{
+					if (step_push(ns, cur, alloc) & once)
+						return;
+					
+					cur = cur->parent;
+				}
+				
+				break;
+			}
+
+			case axis_self:
+			{
+				step_push(ns, n, alloc);
+
+				break;
+			}
+
+			case axis_parent:
+			{
+				if (n->parent)
+					step_push(ns, n->parent, alloc);
+
+				break;
+			}
+				
+			default:
+				assert(!"Unimplemented axis");
+			}
+		}
+		
+		template <class T> void step_fill(xpath_node_set_raw& ns, xml_attribute_struct* a, xml_node_struct* p, xpath_allocator* alloc, bool once, T v)
+		{
+			const axis_t axis = T::axis;
+
+			switch (axis)
+			{
+			case axis_ancestor:
+			case axis_ancestor_or_self:
+			{
+				if (axis == axis_ancestor_or_self && _test == nodetest_type_node) // reject attributes based on principal node type test
+					if (step_push(ns, a, p, alloc) & once)
+						return;
+
+				xml_node_struct* cur = p;
+				
+				while (cur)
+				{
+					if (step_push(ns, cur, alloc) & once)
+						return;
+					
+					cur = cur->parent;
+				}
+				
+				break;
+			}
+
+			case axis_descendant_or_self:
+			case axis_self:
+			{
+				if (_test == nodetest_type_node) // reject attributes based on principal node type test
+					step_push(ns, a, p, alloc);
+
+				break;
+			}
+
+			case axis_following:
+			{
+				xml_node_struct* cur = p;
+				
+				while (cur)
+				{
+					if (cur->first_child)
+						cur = cur->first_child;
+					else
+					{
+						while (!cur->next_sibling)
+						{
+							cur = cur->parent;
+
+							if (!cur) return;
+						}
+
+						cur = cur->next_sibling;
+					}
+
+					if (step_push(ns, cur, alloc) & once)
+						return;
+				}
+
+				break;
+			}
+
+			case axis_parent:
+			{
+				step_push(ns, p, alloc);
+
+				break;
+			}
+
+			case axis_preceding:
+			{
+				// preceding:: axis does not include attribute nodes and attribute ancestors (they are the same as parent's ancestors), so we can reuse node preceding
+				step_fill(ns, p, alloc, once, v);
+				break;
+			}
+			
+			default:
+				assert(!"Unimplemented axis");
+			}
+		}
+
+		template <class T> void step_fill(xpath_node_set_raw& ns, const xpath_node& xn, xpath_allocator* alloc, bool once, T v)
+		{
+			const axis_t axis = T::axis;
+			const bool axis_has_attributes = (axis == axis_ancestor || axis == axis_ancestor_or_self || axis == axis_descendant_or_self || axis == axis_following || axis == axis_parent || axis == axis_preceding || axis == axis_self);
+
+			if (xn.node())
+				step_fill(ns, xn.node().internal_object(), alloc, once, v);
+			else if (axis_has_attributes && xn.attribute() && xn.parent())
+				step_fill(ns, xn.attribute().internal_object(), xn.parent().internal_object(), alloc, once, v);
+		}
+
+		template <class T> xpath_node_set_raw step_do(const xpath_context& c, const xpath_stack& stack, nodeset_eval_t eval, T v)
+		{
+			const axis_t axis = T::axis;
+			const bool axis_reverse = (axis == axis_ancestor || axis == axis_ancestor_or_self || axis == axis_preceding || axis == axis_preceding_sibling);
+			const xpath_node_set::type_t axis_type = axis_reverse ? xpath_node_set::type_sorted_reverse : xpath_node_set::type_sorted;
+
+			bool once =
+				(axis == axis_attribute && _test == nodetest_name) ||
+				(!_right && eval_once(axis_type, eval)) ||
+				(_right && !_right->_next && _right->_test == predicate_constant_one);
+
+			xpath_node_set_raw ns;
+			ns.set_type(axis_type);
+
+			if (_left)
+			{
+				xpath_node_set_raw s = _left->eval_node_set(c, stack, nodeset_eval_all);
+
+				// self axis preserves the original order
+				if (axis == axis_self) ns.set_type(s.type());
+
+				for (const xpath_node* it = s.begin(); it != s.end(); ++it)
+				{
+					size_t size = ns.size();
+
+					// in general, all axes generate elements in a particular order, but there is no order guarantee if axis is applied to two nodes
+					if (axis != axis_self && size != 0) ns.set_type(xpath_node_set::type_unsorted);
+					
+					step_fill(ns, *it, stack.result, once, v);
+					if (_right) apply_predicates(ns, size, stack, eval);
+				}
+			}
+			else
+			{
+				step_fill(ns, c.n, stack.result, once, v);
+				if (_right) apply_predicates(ns, 0, stack, eval);
+			}
+
+			// child, attribute and self axes always generate unique set of nodes
+			// for other axis, if the set stayed sorted, it stayed unique because the traversal algorithms do not visit the same node twice
+			if (axis != axis_child && axis != axis_attribute && axis != axis_self && ns.type() == xpath_node_set::type_unsorted)
+				ns.remove_duplicates();
+
+			return ns;
+		}
+		
+	public:
+		xpath_ast_node(ast_type_t type, xpath_value_type rettype_, const char_t* value):
+			_type(static_cast<char>(type)), _rettype(static_cast<char>(rettype_)), _axis(0), _test(0), _left(0), _right(0), _next(0)
+		{
+			assert(type == ast_string_constant);
+			_data.string = value;
+		}
+
+		xpath_ast_node(ast_type_t type, xpath_value_type rettype_, double value):
+			_type(static_cast<char>(type)), _rettype(static_cast<char>(rettype_)), _axis(0), _test(0), _left(0), _right(0), _next(0)
+		{
+			assert(type == ast_number_constant);
+			_data.number = value;
+		}
+		
+		xpath_ast_node(ast_type_t type, xpath_value_type rettype_, xpath_variable* value):
+			_type(static_cast<char>(type)), _rettype(static_cast<char>(rettype_)), _axis(0), _test(0), _left(0), _right(0), _next(0)
+		{
+			assert(type == ast_variable);
+			_data.variable = value;
+		}
+		
+		xpath_ast_node(ast_type_t type, xpath_value_type rettype_, xpath_ast_node* left = 0, xpath_ast_node* right = 0):
+			_type(static_cast<char>(type)), _rettype(static_cast<char>(rettype_)), _axis(0), _test(0), _left(left), _right(right), _next(0)
+		{
+		}
+
+		xpath_ast_node(ast_type_t type, xpath_ast_node* left, axis_t axis, nodetest_t test, const char_t* contents):
+			_type(static_cast<char>(type)), _rettype(xpath_type_node_set), _axis(static_cast<char>(axis)), _test(static_cast<char>(test)), _left(left), _right(0), _next(0)
+		{
+			assert(type == ast_step);
+			_data.nodetest = contents;
+		}
+
+		xpath_ast_node(ast_type_t type, xpath_ast_node* left, xpath_ast_node* right, predicate_t test):
+			_type(static_cast<char>(type)), _rettype(xpath_type_node_set), _axis(0), _test(static_cast<char>(test)), _left(left), _right(right), _next(0)
+		{
+			assert(type == ast_filter || type == ast_predicate);
+		}
+
+		void set_next(xpath_ast_node* value)
+		{
+			_next = value;
+		}
+
+		void set_right(xpath_ast_node* value)
+		{
+			_right = value;
+		}
+
+		bool eval_boolean(const xpath_context& c, const xpath_stack& stack)
+		{
+			switch (_type)
+			{
+			case ast_op_or:
+				return _left->eval_boolean(c, stack) || _right->eval_boolean(c, stack);
+				
+			case ast_op_and:
+				return _left->eval_boolean(c, stack) && _right->eval_boolean(c, stack);
+				
+			case ast_op_equal:
+				return compare_eq(_left, _right, c, stack, equal_to());
+
+			case ast_op_not_equal:
+				return compare_eq(_left, _right, c, stack, not_equal_to());
+	
+			case ast_op_less:
+				return compare_rel(_left, _right, c, stack, less());
+			
+			case ast_op_greater:
+				return compare_rel(_right, _left, c, stack, less());
+
+			case ast_op_less_or_equal:
+				return compare_rel(_left, _right, c, stack, less_equal());
+			
+			case ast_op_greater_or_equal:
+				return compare_rel(_right, _left, c, stack, less_equal());
+
+			case ast_func_starts_with:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_string lr = _left->eval_string(c, stack);
+				xpath_string rr = _right->eval_string(c, stack);
+
+				return starts_with(lr.c_str(), rr.c_str());
+			}
+
+			case ast_func_contains:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_string lr = _left->eval_string(c, stack);
+				xpath_string rr = _right->eval_string(c, stack);
+
+				return find_substring(lr.c_str(), rr.c_str()) != 0;
+			}
+
+			case ast_func_boolean:
+				return _left->eval_boolean(c, stack);
+				
+			case ast_func_not:
+				return !_left->eval_boolean(c, stack);
+				
+			case ast_func_true:
+				return true;
+				
+			case ast_func_false:
+				return false;
+
+			case ast_func_lang:
+			{
+				if (c.n.attribute()) return false;
+				
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_string lang = _left->eval_string(c, stack);
+				
+				for (xml_node n = c.n.node(); n; n = n.parent())
+				{
+					xml_attribute a = n.attribute(PUGIXML_TEXT("xml:lang"));
+					
+					if (a)
+					{
+						const char_t* value = a.value();
+						
+						// strnicmp / strncasecmp is not portable
+						for (const char_t* lit = lang.c_str(); *lit; ++lit)
+						{
+							if (tolower_ascii(*lit) != tolower_ascii(*value)) return false;
+							++value;
+						}
+						
+						return *value == 0 || *value == '-';
+					}
+				}
+				
+				return false;
+			}
+
+			case ast_opt_compare_attribute:
+			{
+				const char_t* value = (_right->_type == ast_string_constant) ? _right->_data.string : _right->_data.variable->get_string();
+
+				xml_attribute attr = c.n.node().attribute(_left->_data.nodetest);
+
+				return attr && strequal(attr.value(), value) && is_xpath_attribute(attr.name());
+			}
+
+			case ast_variable:
+			{
+				assert(_rettype == _data.variable->type());
+
+				if (_rettype == xpath_type_boolean)
+					return _data.variable->get_boolean();
+
+				// fallthrough to type conversion
+			}
+
+			default:
+			{
+				switch (_rettype)
+				{
+				case xpath_type_number:
+					return convert_number_to_boolean(eval_number(c, stack));
+					
+				case xpath_type_string:
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					return !eval_string(c, stack).empty();
+				}
+					
+				case xpath_type_node_set:				
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					return !eval_node_set(c, stack, nodeset_eval_any).empty();
+				}
+
+				default:
+					assert(!"Wrong expression for return type boolean");
+					return false;
+				}
+			}
+			}
+		}
+
+		double eval_number(const xpath_context& c, const xpath_stack& stack)
+		{
+			switch (_type)
+			{
+			case ast_op_add:
+				return _left->eval_number(c, stack) + _right->eval_number(c, stack);
+				
+			case ast_op_subtract:
+				return _left->eval_number(c, stack) - _right->eval_number(c, stack);
+
+			case ast_op_multiply:
+				return _left->eval_number(c, stack) * _right->eval_number(c, stack);
+
+			case ast_op_divide:
+				return _left->eval_number(c, stack) / _right->eval_number(c, stack);
+
+			case ast_op_mod:
+				return fmod(_left->eval_number(c, stack), _right->eval_number(c, stack));
+
+			case ast_op_negate:
+				return -_left->eval_number(c, stack);
+
+			case ast_number_constant:
+				return _data.number;
+
+			case ast_func_last:
+				return static_cast<double>(c.size);
+			
+			case ast_func_position:
+				return static_cast<double>(c.position);
+
+			case ast_func_count:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				return static_cast<double>(_left->eval_node_set(c, stack, nodeset_eval_all).size());
+			}
+			
+			case ast_func_string_length_0:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				return static_cast<double>(string_value(c.n, stack.result).length());
+			}
+			
+			case ast_func_string_length_1:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				return static_cast<double>(_left->eval_string(c, stack).length());
+			}
+			
+			case ast_func_number_0:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				return convert_string_to_number(string_value(c.n, stack.result).c_str());
+			}
+			
+			case ast_func_number_1:
+				return _left->eval_number(c, stack);
+
+			case ast_func_sum:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				double r = 0;
+				
+				xpath_node_set_raw ns = _left->eval_node_set(c, stack, nodeset_eval_all);
+				
+				for (const xpath_node* it = ns.begin(); it != ns.end(); ++it)
+				{
+					xpath_allocator_capture cri(stack.result);
+
+					r += convert_string_to_number(string_value(*it, stack.result).c_str());
+				}
+			
+				return r;
+			}
+
+			case ast_func_floor:
+			{
+				double r = _left->eval_number(c, stack);
+				
+				return r == r ? floor(r) : r;
+			}
+
+			case ast_func_ceiling:
+			{
+				double r = _left->eval_number(c, stack);
+				
+				return r == r ? ceil(r) : r;
+			}
+
+			case ast_func_round:
+				return round_nearest_nzero(_left->eval_number(c, stack));
+			
+			case ast_variable:
+			{
+				assert(_rettype == _data.variable->type());
+
+				if (_rettype == xpath_type_number)
+					return _data.variable->get_number();
+
+				// fallthrough to type conversion
+			}
+
+			default:
+			{
+				switch (_rettype)
+				{
+				case xpath_type_boolean:
+					return eval_boolean(c, stack) ? 1 : 0;
+					
+				case xpath_type_string:
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					return convert_string_to_number(eval_string(c, stack).c_str());
+				}
+					
+				case xpath_type_node_set:
+				{
+					xpath_allocator_capture cr(stack.result);
+
+					return convert_string_to_number(eval_string(c, stack).c_str());
+				}
+					
+				default:
+					assert(!"Wrong expression for return type number");
+					return 0;
+				}
+				
+			}
+			}
+		}
+		
+		xpath_string eval_string_concat(const xpath_context& c, const xpath_stack& stack)
+		{
+			assert(_type == ast_func_concat);
+
+			xpath_allocator_capture ct(stack.temp);
+
+			// count the string number
+			size_t count = 1;
+			for (xpath_ast_node* nc = _right; nc; nc = nc->_next) count++;
+
+			// gather all strings
+			xpath_string static_buffer[4];
+			xpath_string* buffer = static_buffer;
+
+			// allocate on-heap for large concats
+			if (count > sizeof(static_buffer) / sizeof(static_buffer[0]))
+			{
+				buffer = static_cast<xpath_string*>(stack.temp->allocate(count * sizeof(xpath_string)));
+				assert(buffer);
+			}
+
+			// evaluate all strings to temporary stack
+			xpath_stack swapped_stack = {stack.temp, stack.result};
+
+			buffer[0] = _left->eval_string(c, swapped_stack);
+
+			size_t pos = 1;
+			for (xpath_ast_node* n = _right; n; n = n->_next, ++pos) buffer[pos] = n->eval_string(c, swapped_stack);
+			assert(pos == count);
+
+			// get total length
+			size_t length = 0;
+			for (size_t i = 0; i < count; ++i) length += buffer[i].length();
+
+			// create final string
+			char_t* result = static_cast<char_t*>(stack.result->allocate((length + 1) * sizeof(char_t)));
+			assert(result);
+
+			char_t* ri = result;
+
+			for (size_t j = 0; j < count; ++j)
+				for (const char_t* bi = buffer[j].c_str(); *bi; ++bi)
+					*ri++ = *bi;
+
+			*ri = 0;
+
+			return xpath_string::from_heap_preallocated(result, ri);
+		}
+
+		xpath_string eval_string(const xpath_context& c, const xpath_stack& stack)
+		{
+			switch (_type)
+			{
+			case ast_string_constant:
+				return xpath_string::from_const(_data.string);
+			
+			case ast_func_local_name_0:
+			{
+				xpath_node na = c.n;
+				
+				return xpath_string::from_const(local_name(na));
+			}
+
+			case ast_func_local_name_1:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_node_set_raw ns = _left->eval_node_set(c, stack, nodeset_eval_first);
+				xpath_node na = ns.first();
+				
+				return xpath_string::from_const(local_name(na));
+			}
+
+			case ast_func_name_0:
+			{
+				xpath_node na = c.n;
+				
+				return xpath_string::from_const(qualified_name(na));
+			}
+
+			case ast_func_name_1:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_node_set_raw ns = _left->eval_node_set(c, stack, nodeset_eval_first);
+				xpath_node na = ns.first();
+				
+				return xpath_string::from_const(qualified_name(na));
+			}
+
+			case ast_func_namespace_uri_0:
+			{
+				xpath_node na = c.n;
+				
+				return xpath_string::from_const(namespace_uri(na));
+			}
+
+			case ast_func_namespace_uri_1:
+			{
+				xpath_allocator_capture cr(stack.result);
+
+				xpath_node_set_raw ns = _left->eval_node_set(c, stack, nodeset_eval_first);
+				xpath_node na = ns.first();
+				
+				return xpath_string::from_const(namespace_uri(na));
+			}
+
+			case ast_func_string_0:
+				return string_value(c.n, stack.result);
+
+			case ast_func_string_1:
+				return _left->eval_string(c, stack);
+
+			case ast_func_concat:
+				return eval_string_concat(c, stack);
+
+			case ast_func_substring_before:
+			{
+				xpath_allocator_capture cr(stack.temp);
+
+				xpath_stack swapped_stack = {stack.temp, stack.result};
+
+				xpath_string s = _left->eval_string(c, swapped_stack);
+				xpath_string p = _right->eval_string(c, swapped_stack);
+
+				const char_t* pos = find_substring(s.c_str(), p.c_str());
+				
+				return pos ? xpath_string::from_heap(s.c_str(), pos, stack.result) : xpath_string();
+			}
+			
+			case ast_func_substring_after:
+			{
+				xpath_allocator_capture cr(stack.temp);
+
+				xpath_stack swapped_stack = {stack.temp, stack.result};
+
+				xpath_string s = _left->eval_string(c, swapped_stack);
+				xpath_string p = _right->eval_string(c, swapped_stack);
+				
+				const char_t* pos = find_substring(s.c_str(), p.c_str());
+				if (!pos) return xpath_string();
+
+				const char_t* rbegin = pos + p.length();
+				const char_t* rend = s.c_str() + s.length();
+
+				return s.uses_heap() ? xpath_string::from_heap(rbegin, rend, stack.result) : xpath_string::from_const(rbegin);
+			}
+
+			case ast_func_substring_2:
+			{
+				xpath_allocator_capture cr(stack.temp);
+
+				xpath_stack swapped_stack = {stack.temp, stack.result};
+
+				xpath_string s = _left->eval_string(c, swapped_stack);
+				size_t s_length = s.length();
+
+				double first = round_nearest(_right->eval_number(c, stack));
+				
+				if (is_nan(first)) return xpath_string(); // NaN
+				else if (first >= s_length + 1) return xpath_string();
+				
+				size_t pos = first < 1 ? 1 : static_cast<size_t>(first);
+				assert(1 <= pos && pos <= s_length + 1);
+
+				const char_t* rbegin = s.c_str() + (pos - 1);
+				const char_t* rend = s.c_str() + s.length();
+				
+				return s.uses_heap() ? xpath_string::from_heap(rbegin, rend, stack.result) : xpath_string::from_const(rbegin);
+			}
+			
+			case ast_func_substring_3:
+			{
+				xpath_allocator_capture cr(stack.temp);
+
+				xpath_stack swapped_stack = {stack.temp, stack.result};
+
+				xpath_string s = _left->eval_string(c, swapped_stack);
+				size_t s_length = s.length();
+
+				double first = round_nearest(_right->eval_number(c, stack));
+				double last = first + round_nearest(_right->_next->eval_number(c, stack));
+				
+				if (is_nan(first) || is_nan(last)) return xpath_string();
+				else if (first >= s_length + 1) return xpath_string();
+				else if (first >= last) return xpath_string();
+				else if (last < 1) return xpath_string();
+				
+				size_t pos = first < 1 ? 1 : static_cast<size_t>(first);
+				size_t end = last >= s_length + 1 ? s_length + 1 : static_cast<size_t>(last);
+
+				assert(1 <= pos && pos <= end && end <= s_length + 1);
+				const char_t* rbegin = s.c_str() + (pos - 1);
+				const char_t* rend = s.c_str() + (end - 1);
+
+				return (end == s_length + 1 && !s.uses_heap()) ? xpath_string::from_const(rbegin) : xpath_string::from_heap(rbegin, rend, stack.result);
+			}
+
+			case ast_func_normalize_space_0:
+			{
+				xpath_string s = string_value(c.n, stack.result);
+
+				char_t* begin = s.data(stack.result);
+				char_t* end = normalize_space(begin);
+
+				return xpath_string::from_heap_preallocated(begin, end);
+			}
+
+			case ast_func_normalize_space_1:
+			{
+				xpath_string s = _left->eval_string(c, stack);
+
+				char_t* begin = s.data(stack.result);
+				char_t* end = normalize_space(begin);
+			
+				return xpath_string::from_heap_preallocated(begin, end);
+			}
+
+			case ast_func_translate:
+			{
+				xpath_allocator_capture cr(stack.temp);
+
+				xpath_stack swapped_stack = {stack.temp, stack.result};
+
+				xpath_string s = _left->eval_string(c, stack);
+				xpath_string from = _right->eval_string(c, swapped_stack);
+				xpath_string to = _right->_next->eval_string(c, swapped_stack);
+
+				char_t* begin = s.data(stack.result);
+				char_t* end = translate(begin, from.c_str(), to.c_str(), to.length());
+
+				return xpath_string::from_heap_preallocated(begin, end);
+			}
+
+			case ast_opt_translate_table:
+			{
+				xpath_string s = _left->eval_string(c, stack);
+
+				char_t* begin = s.data(stack.result);
+				char_t* end = translate_table(begin, _data.table);
+
+				return xpath_string::from_heap_preallocated(begin, end);
+			}
+
+			case ast_variable:
+			{
+				assert(_rettype == _data.variable->type());
+
+				if (_rettype == xpath_type_string)
+					return xpath_string::from_const(_data.variable->get_string());
+
+				// fallthrough to type conversion
+			}
+
+			default:
+			{
+				switch (_rettype)
+				{
+				case xpath_type_boolean:
+					return xpath_string::from_const(eval_boolean(c, stack) ? PUGIXML_TEXT("true") : PUGIXML_TEXT("false"));
+					
+				case xpath_type_number:
+					return convert_number_to_string(eval_number(c, stack), stack.result);
+					
+				case xpath_type_node_set:
+				{
+					xpath_allocator_capture cr(stack.temp);
+
+					xpath_stack swapped_stack = {stack.temp, stack.result};
+
+					xpath_node_set_raw ns = eval_node_set(c, swapped_stack, nodeset_eval_first);
+					return ns.empty() ? xpath_string() : string_value(ns.first(), stack.result);
+				}
+				
+				default:
+					assert(!"Wrong expression for return type string");
+					return xpath_string();
+				}
+			}
+			}
+		}
+
+		xpath_node_set_raw eval_node_set(const xpath_context& c, const xpath_stack& stack, nodeset_eval_t eval)
+		{
+			switch (_type)
+			{
+			case ast_op_union:
+			{
+				xpath_allocator_capture cr(stack.temp);
+
+				xpath_stack swapped_stack = {stack.temp, stack.result};
+
+				xpath_node_set_raw ls = _left->eval_node_set(c, swapped_stack, eval);
+				xpath_node_set_raw rs = _right->eval_node_set(c, stack, eval);
+
+				// we can optimize merging two sorted sets, but this is a very rare operation, so don't bother
+				rs.set_type(xpath_node_set::type_unsorted);
+
+				rs.append(ls.begin(), ls.end(), stack.result);
+				rs.remove_duplicates();
+
+				return rs;
+			}
+
+			case ast_filter:
+			{
+				xpath_node_set_raw set = _left->eval_node_set(c, stack, _test == predicate_constant_one ? nodeset_eval_first : nodeset_eval_all);
+
+				// either expression is a number or it contains position() call; sort by document order
+				if (_test != predicate_posinv) set.sort_do();
+
+				bool once = eval_once(set.type(), eval);
+
+				apply_predicate(set, 0, stack, once);
+			
+				return set;
+			}
+			
+			case ast_func_id:
+				return xpath_node_set_raw();
+			
+			case ast_step:
+			{
+				switch (_axis)
+				{
+				case axis_ancestor:
+					return step_do(c, stack, eval, axis_to_type<axis_ancestor>());
+					
+				case axis_ancestor_or_self:
+					return step_do(c, stack, eval, axis_to_type<axis_ancestor_or_self>());
+
+				case axis_attribute:
+					return step_do(c, stack, eval, axis_to_type<axis_attribute>());
+
+				case axis_child:
+					return step_do(c, stack, eval, axis_to_type<axis_child>());
+				
+				case axis_descendant:
+					return step_do(c, stack, eval, axis_to_type<axis_descendant>());
+
+				case axis_descendant_or_self:
+					return step_do(c, stack, eval, axis_to_type<axis_descendant_or_self>());
+
+				case axis_following:
+					return step_do(c, stack, eval, axis_to_type<axis_following>());
+				
+				case axis_following_sibling:
+					return step_do(c, stack, eval, axis_to_type<axis_following_sibling>());
+				
+				case axis_namespace:
+					// namespaced axis is not supported
+					return xpath_node_set_raw();
+				
+				case axis_parent:
+					return step_do(c, stack, eval, axis_to_type<axis_parent>());
+				
+				case axis_preceding:
+					return step_do(c, stack, eval, axis_to_type<axis_preceding>());
+
+				case axis_preceding_sibling:
+					return step_do(c, stack, eval, axis_to_type<axis_preceding_sibling>());
+				
+				case axis_self:
+					return step_do(c, stack, eval, axis_to_type<axis_self>());
+
+				default:
+					assert(!"Unknown axis");
+					return xpath_node_set_raw();
+				}
+			}
+
+			case ast_step_root:
+			{
+				assert(!_right); // root step can't have any predicates
+
+				xpath_node_set_raw ns;
+
+				ns.set_type(xpath_node_set::type_sorted);
+
+				if (c.n.node()) ns.push_back(c.n.node().root(), stack.result);
+				else if (c.n.attribute()) ns.push_back(c.n.parent().root(), stack.result);
+
+				return ns;
+			}
+
+			case ast_variable:
+			{
+				assert(_rettype == _data.variable->type());
+
+				if (_rettype == xpath_type_node_set)
+				{
+					const xpath_node_set& s = _data.variable->get_node_set();
+
+					xpath_node_set_raw ns;
+
+					ns.set_type(s.type());
+					ns.append(s.begin(), s.end(), stack.result);
+
+					return ns;
+				}
+
+				// fallthrough to type conversion
+			}
+
+			default:
+				assert(!"Wrong expression for return type node set");
+				return xpath_node_set_raw();
+			}
+		}
+
+		void optimize(xpath_allocator* alloc)
+		{
+			if (_left) _left->optimize(alloc);
+			if (_right) _right->optimize(alloc);
+			if (_next) _next->optimize(alloc);
+
+			optimize_self(alloc);
+		}
+
+		void optimize_self(xpath_allocator* alloc)
+		{
+			// Rewrite [position()=expr] with [expr]
+			// Note that this step has to go before classification to recognize [position()=1]
+			if ((_type == ast_filter || _type == ast_predicate) &&
+				_right->_type == ast_op_equal && _right->_left->_type == ast_func_position && _right->_right->_rettype == xpath_type_number)
+			{
+				_right = _right->_right;
+			}
+
+			// Classify filter/predicate ops to perform various optimizations during evaluation
+			if (_type == ast_filter || _type == ast_predicate)
+			{
+				assert(_test == predicate_default);
+
+				if (_right->_type == ast_number_constant && _right->_data.number == 1.0)
+					_test = predicate_constant_one;
+				else if (_right->_rettype == xpath_type_number && (_right->_type == ast_number_constant || _right->_type == ast_variable || _right->_type == ast_func_last))
+					_test = predicate_constant;
+				else if (_right->_rettype != xpath_type_number && _right->is_posinv_expr())
+					_test = predicate_posinv;
+			}
+
+			// Rewrite descendant-or-self::node()/child::foo with descendant::foo
+			// The former is a full form of //foo, the latter is much faster since it executes the node test immediately
+			// Do a similar kind of rewrite for self/descendant/descendant-or-self axes
+			// Note that we only rewrite positionally invariant steps (//foo[1] != /descendant::foo[1])
+			if (_type == ast_step && (_axis == axis_child || _axis == axis_self || _axis == axis_descendant || _axis == axis_descendant_or_self) && _left &&
+				_left->_type == ast_step && _left->_axis == axis_descendant_or_self && _left->_test == nodetest_type_node && !_left->_right &&
+				is_posinv_step())
+			{
+				if (_axis == axis_child || _axis == axis_descendant)
+					_axis = axis_descendant;
+				else
+					_axis = axis_descendant_or_self;
+
+				_left = _left->_left;
+			}
+
+			// Use optimized lookup table implementation for translate() with constant arguments
+			if (_type == ast_func_translate && _right->_type == ast_string_constant && _right->_next->_type == ast_string_constant)
+			{
+				unsigned char* table = translate_table_generate(alloc, _right->_data.string, _right->_next->_data.string);
+
+				if (table)
+				{
+					_type = ast_opt_translate_table;
+					_data.table = table;
+				}
+			}
+
+			// Use optimized path for @attr = 'value' or @attr = $value
+			if (_type == ast_op_equal &&
+				_left->_type == ast_step && _left->_axis == axis_attribute && _left->_test == nodetest_name && !_left->_left && !_left->_right &&
+				(_right->_type == ast_string_constant || (_right->_type == ast_variable && _right->_rettype == xpath_type_string)))
+			{
+				_type = ast_opt_compare_attribute;
+			}
+		}
+		
+		bool is_posinv_expr() const
+		{
+			switch (_type)
+			{
+			case ast_func_position:
+			case ast_func_last:
+				return false;
+
+			case ast_string_constant:
+			case ast_number_constant:
+			case ast_variable:
+				return true;
+
+			case ast_step:
+			case ast_step_root:
+				return true;
+
+			case ast_predicate:
+			case ast_filter:
+				return true;
+
+			default:
+				if (_left && !_left->is_posinv_expr()) return false;
+				
+				for (xpath_ast_node* n = _right; n; n = n->_next)
+					if (!n->is_posinv_expr()) return false;
+					
+				return true;
+			}
+		}
+
+		bool is_posinv_step() const
+		{
+			assert(_type == ast_step);
+
+			for (xpath_ast_node* n = _right; n; n = n->_next)
+			{
+				assert(n->_type == ast_predicate);
+
+				if (n->_test != predicate_posinv)
+					return false;
+			}
+
+			return true;
+		}
+
+		xpath_value_type rettype() const
+		{
+			return static_cast<xpath_value_type>(_rettype);
+		}
+	};
+
+	struct xpath_parser
+	{
+		xpath_allocator* _alloc;
+		xpath_lexer _lexer;
+
+		const char_t* _query;
+		xpath_variable_set* _variables;
+
+		xpath_parse_result* _result;
+
+		char_t _scratch[32];
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		jmp_buf _error_handler;
+	#endif
+
+		void throw_error(const char* message)
+		{
+			_result->error = message;
+			_result->offset = _lexer.current_pos() - _query;
+
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			longjmp(_error_handler, 1);
+		#else
+			throw xpath_exception(*_result);
+		#endif
+		}
+
+		void throw_error_oom()
+		{
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			throw_error("Out of memory");
+		#else
+			throw std::bad_alloc();
+		#endif
+		}
+
+		void* alloc_node()
+		{
+			void* result = _alloc->allocate_nothrow(sizeof(xpath_ast_node));
+
+			if (!result) throw_error_oom();
+
+			return result;
+		}
+
+		const char_t* alloc_string(const xpath_lexer_string& value)
+		{
+			if (value.begin)
+			{
+				size_t length = static_cast<size_t>(value.end - value.begin);
+
+				char_t* c = static_cast<char_t*>(_alloc->allocate_nothrow((length + 1) * sizeof(char_t)));
+				if (!c) throw_error_oom();
+				assert(c); // workaround for clang static analysis
+
+				memcpy(c, value.begin, length * sizeof(char_t));
+				c[length] = 0;
+
+				return c;
+			}
+			else return 0;
+		}
+
+		xpath_ast_node* parse_function_helper(ast_type_t type0, ast_type_t type1, size_t argc, xpath_ast_node* args[2])
+		{
+			assert(argc <= 1);
+
+			if (argc == 1 && args[0]->rettype() != xpath_type_node_set) throw_error("Function has to be applied to node set");
+
+			return new (alloc_node()) xpath_ast_node(argc == 0 ? type0 : type1, xpath_type_string, args[0]);
+		}
+
+		xpath_ast_node* parse_function(const xpath_lexer_string& name, size_t argc, xpath_ast_node* args[2])
+		{
+			switch (name.begin[0])
+			{
+			case 'b':
+				if (name == PUGIXML_TEXT("boolean") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_boolean, xpath_type_boolean, args[0]);
+					
+				break;
+			
+			case 'c':
+				if (name == PUGIXML_TEXT("count") && argc == 1)
+				{
+					if (args[0]->rettype() != xpath_type_node_set) throw_error("Function has to be applied to node set");
+					return new (alloc_node()) xpath_ast_node(ast_func_count, xpath_type_number, args[0]);
+				}
+				else if (name == PUGIXML_TEXT("contains") && argc == 2)
+					return new (alloc_node()) xpath_ast_node(ast_func_contains, xpath_type_boolean, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("concat") && argc >= 2)
+					return new (alloc_node()) xpath_ast_node(ast_func_concat, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("ceiling") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_ceiling, xpath_type_number, args[0]);
+					
+				break;
+			
+			case 'f':
+				if (name == PUGIXML_TEXT("false") && argc == 0)
+					return new (alloc_node()) xpath_ast_node(ast_func_false, xpath_type_boolean);
+				else if (name == PUGIXML_TEXT("floor") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_floor, xpath_type_number, args[0]);
+					
+				break;
+			
+			case 'i':
+				if (name == PUGIXML_TEXT("id") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_id, xpath_type_node_set, args[0]);
+					
+				break;
+			
+			case 'l':
+				if (name == PUGIXML_TEXT("last") && argc == 0)
+					return new (alloc_node()) xpath_ast_node(ast_func_last, xpath_type_number);
+				else if (name == PUGIXML_TEXT("lang") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_lang, xpath_type_boolean, args[0]);
+				else if (name == PUGIXML_TEXT("local-name") && argc <= 1)
+					return parse_function_helper(ast_func_local_name_0, ast_func_local_name_1, argc, args);
+			
+				break;
+			
+			case 'n':
+				if (name == PUGIXML_TEXT("name") && argc <= 1)
+					return parse_function_helper(ast_func_name_0, ast_func_name_1, argc, args);
+				else if (name == PUGIXML_TEXT("namespace-uri") && argc <= 1)
+					return parse_function_helper(ast_func_namespace_uri_0, ast_func_namespace_uri_1, argc, args);
+				else if (name == PUGIXML_TEXT("normalize-space") && argc <= 1)
+					return new (alloc_node()) xpath_ast_node(argc == 0 ? ast_func_normalize_space_0 : ast_func_normalize_space_1, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("not") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_not, xpath_type_boolean, args[0]);
+				else if (name == PUGIXML_TEXT("number") && argc <= 1)
+					return new (alloc_node()) xpath_ast_node(argc == 0 ? ast_func_number_0 : ast_func_number_1, xpath_type_number, args[0]);
+			
+				break;
+			
+			case 'p':
+				if (name == PUGIXML_TEXT("position") && argc == 0)
+					return new (alloc_node()) xpath_ast_node(ast_func_position, xpath_type_number);
+				
+				break;
+			
+			case 'r':
+				if (name == PUGIXML_TEXT("round") && argc == 1)
+					return new (alloc_node()) xpath_ast_node(ast_func_round, xpath_type_number, args[0]);
+
+				break;
+			
+			case 's':
+				if (name == PUGIXML_TEXT("string") && argc <= 1)
+					return new (alloc_node()) xpath_ast_node(argc == 0 ? ast_func_string_0 : ast_func_string_1, xpath_type_string, args[0]);
+				else if (name == PUGIXML_TEXT("string-length") && argc <= 1)
+					return new (alloc_node()) xpath_ast_node(argc == 0 ? ast_func_string_length_0 : ast_func_string_length_1, xpath_type_number, args[0]);
+				else if (name == PUGIXML_TEXT("starts-with") && argc == 2)
+					return new (alloc_node()) xpath_ast_node(ast_func_starts_with, xpath_type_boolean, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("substring-before") && argc == 2)
+					return new (alloc_node()) xpath_ast_node(ast_func_substring_before, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("substring-after") && argc == 2)
+					return new (alloc_node()) xpath_ast_node(ast_func_substring_after, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("substring") && (argc == 2 || argc == 3))
+					return new (alloc_node()) xpath_ast_node(argc == 2 ? ast_func_substring_2 : ast_func_substring_3, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("sum") && argc == 1)
+				{
+					if (args[0]->rettype() != xpath_type_node_set) throw_error("Function has to be applied to node set");
+					return new (alloc_node()) xpath_ast_node(ast_func_sum, xpath_type_number, args[0]);
+				}
+
+				break;
+			
+			case 't':
+				if (name == PUGIXML_TEXT("translate") && argc == 3)
+					return new (alloc_node()) xpath_ast_node(ast_func_translate, xpath_type_string, args[0], args[1]);
+				else if (name == PUGIXML_TEXT("true") && argc == 0)
+					return new (alloc_node()) xpath_ast_node(ast_func_true, xpath_type_boolean);
+					
+				break;
+
+			default:
+				break;
+			}
+
+			throw_error("Unrecognized function or wrong parameter count");
+
+			return 0;
+		}
+
+		axis_t parse_axis_name(const xpath_lexer_string& name, bool& specified)
+		{
+			specified = true;
+
+			switch (name.begin[0])
+			{
+			case 'a':
+				if (name == PUGIXML_TEXT("ancestor"))
+					return axis_ancestor;
+				else if (name == PUGIXML_TEXT("ancestor-or-self"))
+					return axis_ancestor_or_self;
+				else if (name == PUGIXML_TEXT("attribute"))
+					return axis_attribute;
+				
+				break;
+			
+			case 'c':
+				if (name == PUGIXML_TEXT("child"))
+					return axis_child;
+				
+				break;
+			
+			case 'd':
+				if (name == PUGIXML_TEXT("descendant"))
+					return axis_descendant;
+				else if (name == PUGIXML_TEXT("descendant-or-self"))
+					return axis_descendant_or_self;
+				
+				break;
+			
+			case 'f':
+				if (name == PUGIXML_TEXT("following"))
+					return axis_following;
+				else if (name == PUGIXML_TEXT("following-sibling"))
+					return axis_following_sibling;
+				
+				break;
+			
+			case 'n':
+				if (name == PUGIXML_TEXT("namespace"))
+					return axis_namespace;
+				
+				break;
+			
+			case 'p':
+				if (name == PUGIXML_TEXT("parent"))
+					return axis_parent;
+				else if (name == PUGIXML_TEXT("preceding"))
+					return axis_preceding;
+				else if (name == PUGIXML_TEXT("preceding-sibling"))
+					return axis_preceding_sibling;
+				
+				break;
+			
+			case 's':
+				if (name == PUGIXML_TEXT("self"))
+					return axis_self;
+				
+				break;
+
+			default:
+				break;
+			}
+
+			specified = false;
+			return axis_child;
+		}
+
+		nodetest_t parse_node_test_type(const xpath_lexer_string& name)
+		{
+			switch (name.begin[0])
+			{
+			case 'c':
+				if (name == PUGIXML_TEXT("comment"))
+					return nodetest_type_comment;
+
+				break;
+
+			case 'n':
+				if (name == PUGIXML_TEXT("node"))
+					return nodetest_type_node;
+
+				break;
+
+			case 'p':
+				if (name == PUGIXML_TEXT("processing-instruction"))
+					return nodetest_type_pi;
+
+				break;
+
+			case 't':
+				if (name == PUGIXML_TEXT("text"))
+					return nodetest_type_text;
+
+				break;
+			
+			default:
+				break;
+			}
+
+			return nodetest_none;
+		}
+
+		// PrimaryExpr ::= VariableReference | '(' Expr ')' | Literal | Number | FunctionCall
+		xpath_ast_node* parse_primary_expression()
+		{
+			switch (_lexer.current())
+			{
+			case lex_var_ref:
+			{
+				xpath_lexer_string name = _lexer.contents();
+
+				if (!_variables)
+					throw_error("Unknown variable: variable set is not provided");
+
+				xpath_variable* var = 0;
+				if (!get_variable_scratch(_scratch, _variables, name.begin, name.end, &var))
+					throw_error_oom();
+
+				if (!var)
+					throw_error("Unknown variable: variable set does not contain the given name");
+
+				_lexer.next();
+
+				return new (alloc_node()) xpath_ast_node(ast_variable, var->type(), var);
+			}
+
+			case lex_open_brace:
+			{
+				_lexer.next();
+
+				xpath_ast_node* n = parse_expression();
+
+				if (_lexer.current() != lex_close_brace)
+					throw_error("Unmatched braces");
+
+				_lexer.next();
+
+				return n;
+			}
+
+			case lex_quoted_string:
+			{
+				const char_t* value = alloc_string(_lexer.contents());
+
+				xpath_ast_node* n = new (alloc_node()) xpath_ast_node(ast_string_constant, xpath_type_string, value);
+				_lexer.next();
+
+				return n;
+			}
+
+			case lex_number:
+			{
+				double value = 0;
+
+				if (!convert_string_to_number_scratch(_scratch, _lexer.contents().begin, _lexer.contents().end, &value))
+					throw_error_oom();
+
+				xpath_ast_node* n = new (alloc_node()) xpath_ast_node(ast_number_constant, xpath_type_number, value);
+				_lexer.next();
+
+				return n;
+			}
+
+			case lex_string:
+			{
+				xpath_ast_node* args[2] = {0};
+				size_t argc = 0;
+				
+				xpath_lexer_string function = _lexer.contents();
+				_lexer.next();
+				
+				xpath_ast_node* last_arg = 0;
+				
+				if (_lexer.current() != lex_open_brace)
+					throw_error("Unrecognized function call");
+				_lexer.next();
+
+				if (_lexer.current() != lex_close_brace)
+					args[argc++] = parse_expression();
+
+				while (_lexer.current() != lex_close_brace)
+				{
+					if (_lexer.current() != lex_comma)
+						throw_error("No comma between function arguments");
+					_lexer.next();
+					
+					xpath_ast_node* n = parse_expression();
+					
+					if (argc < 2) args[argc] = n;
+					else last_arg->set_next(n);
+
+					argc++;
+					last_arg = n;
+				}
+				
+				_lexer.next();
+
+				return parse_function(function, argc, args);
+			}
+
+			default:
+				throw_error("Unrecognizable primary expression");
+
+				return 0;
+			}
+		}
+		
+		// FilterExpr ::= PrimaryExpr | FilterExpr Predicate
+		// Predicate ::= '[' PredicateExpr ']'
+		// PredicateExpr ::= Expr
+		xpath_ast_node* parse_filter_expression()
+		{
+			xpath_ast_node* n = parse_primary_expression();
+
+			while (_lexer.current() == lex_open_square_brace)
+			{
+				_lexer.next();
+
+				xpath_ast_node* expr = parse_expression();
+
+				if (n->rettype() != xpath_type_node_set) throw_error("Predicate has to be applied to node set");
+
+				n = new (alloc_node()) xpath_ast_node(ast_filter, n, expr, predicate_default);
+
+				if (_lexer.current() != lex_close_square_brace)
+					throw_error("Unmatched square brace");
+			
+				_lexer.next();
+			}
+			
+			return n;
+		}
+		
+		// Step ::= AxisSpecifier NodeTest Predicate* | AbbreviatedStep
+		// AxisSpecifier ::= AxisName '::' | '@'?
+		// NodeTest ::= NameTest | NodeType '(' ')' | 'processing-instruction' '(' Literal ')'
+		// NameTest ::= '*' | NCName ':' '*' | QName
+		// AbbreviatedStep ::= '.' | '..'
+		xpath_ast_node* parse_step(xpath_ast_node* set)
+		{
+			if (set && set->rettype() != xpath_type_node_set)
+				throw_error("Step has to be applied to node set");
+
+			bool axis_specified = false;
+			axis_t axis = axis_child; // implied child axis
+
+			if (_lexer.current() == lex_axis_attribute)
+			{
+				axis = axis_attribute;
+				axis_specified = true;
+				
+				_lexer.next();
+			}
+			else if (_lexer.current() == lex_dot)
+			{
+				_lexer.next();
+				
+				return new (alloc_node()) xpath_ast_node(ast_step, set, axis_self, nodetest_type_node, 0);
+			}
+			else if (_lexer.current() == lex_double_dot)
+			{
+				_lexer.next();
+				
+				return new (alloc_node()) xpath_ast_node(ast_step, set, axis_parent, nodetest_type_node, 0);
+			}
+		
+			nodetest_t nt_type = nodetest_none;
+			xpath_lexer_string nt_name;
+			
+			if (_lexer.current() == lex_string)
+			{
+				// node name test
+				nt_name = _lexer.contents();
+				_lexer.next();
+
+				// was it an axis name?
+				if (_lexer.current() == lex_double_colon)
+				{
+					// parse axis name
+					if (axis_specified) throw_error("Two axis specifiers in one step");
+
+					axis = parse_axis_name(nt_name, axis_specified);
+
+					if (!axis_specified) throw_error("Unknown axis");
+
+					// read actual node test
+					_lexer.next();
+
+					if (_lexer.current() == lex_multiply)
+					{
+						nt_type = nodetest_all;
+						nt_name = xpath_lexer_string();
+						_lexer.next();
+					}
+					else if (_lexer.current() == lex_string)
+					{
+						nt_name = _lexer.contents();
+						_lexer.next();
+					}
+					else throw_error("Unrecognized node test");
+				}
+				
+				if (nt_type == nodetest_none)
+				{
+					// node type test or processing-instruction
+					if (_lexer.current() == lex_open_brace)
+					{
+						_lexer.next();
+						
+						if (_lexer.current() == lex_close_brace)
+						{
+							_lexer.next();
+
+							nt_type = parse_node_test_type(nt_name);
+
+							if (nt_type == nodetest_none) throw_error("Unrecognized node type");
+							
+							nt_name = xpath_lexer_string();
+						}
+						else if (nt_name == PUGIXML_TEXT("processing-instruction"))
+						{
+							if (_lexer.current() != lex_quoted_string)
+								throw_error("Only literals are allowed as arguments to processing-instruction()");
+						
+							nt_type = nodetest_pi;
+							nt_name = _lexer.contents();
+							_lexer.next();
+							
+							if (_lexer.current() != lex_close_brace)
+								throw_error("Unmatched brace near processing-instruction()");
+							_lexer.next();
+						}
+						else
+							throw_error("Unmatched brace near node type test");
+
+					}
+					// QName or NCName:*
+					else
+					{
+						if (nt_name.end - nt_name.begin > 2 && nt_name.end[-2] == ':' && nt_name.end[-1] == '*') // NCName:*
+						{
+							nt_name.end--; // erase *
+							
+							nt_type = nodetest_all_in_namespace;
+						}
+						else nt_type = nodetest_name;
+					}
+				}
+			}
+			else if (_lexer.current() == lex_multiply)
+			{
+				nt_type = nodetest_all;
+				_lexer.next();
+			}
+			else throw_error("Unrecognized node test");
+			
+			xpath_ast_node* n = new (alloc_node()) xpath_ast_node(ast_step, set, axis, nt_type, alloc_string(nt_name));
+			
+			xpath_ast_node* last = 0;
+			
+			while (_lexer.current() == lex_open_square_brace)
+			{
+				_lexer.next();
+				
+				xpath_ast_node* expr = parse_expression();
+
+				xpath_ast_node* pred = new (alloc_node()) xpath_ast_node(ast_predicate, 0, expr, predicate_default);
+				
+				if (_lexer.current() != lex_close_square_brace)
+					throw_error("Unmatched square brace");
+				_lexer.next();
+				
+				if (last) last->set_next(pred);
+				else n->set_right(pred);
+				
+				last = pred;
+			}
+
+			return n;
+		}
+		
+		// RelativeLocationPath ::= Step | RelativeLocationPath '/' Step | RelativeLocationPath '//' Step
+		xpath_ast_node* parse_relative_location_path(xpath_ast_node* set)
+		{
+			xpath_ast_node* n = parse_step(set);
+			
+			while (_lexer.current() == lex_slash || _lexer.current() == lex_double_slash)
+			{
+				lexeme_t l = _lexer.current();
+				_lexer.next();
+
+				if (l == lex_double_slash)
+					n = new (alloc_node()) xpath_ast_node(ast_step, n, axis_descendant_or_self, nodetest_type_node, 0);
+				
+				n = parse_step(n);
+			}
+			
+			return n;
+		}
+		
+		// LocationPath ::= RelativeLocationPath | AbsoluteLocationPath
+		// AbsoluteLocationPath ::= '/' RelativeLocationPath? | '//' RelativeLocationPath
+		xpath_ast_node* parse_location_path()
+		{
+			if (_lexer.current() == lex_slash)
+			{
+				_lexer.next();
+				
+				xpath_ast_node* n = new (alloc_node()) xpath_ast_node(ast_step_root, xpath_type_node_set);
+
+				// relative location path can start from axis_attribute, dot, double_dot, multiply and string lexemes; any other lexeme means standalone root path
+				lexeme_t l = _lexer.current();
+
+				if (l == lex_string || l == lex_axis_attribute || l == lex_dot || l == lex_double_dot || l == lex_multiply)
+					return parse_relative_location_path(n);
+				else
+					return n;
+			}
+			else if (_lexer.current() == lex_double_slash)
+			{
+				_lexer.next();
+				
+				xpath_ast_node* n = new (alloc_node()) xpath_ast_node(ast_step_root, xpath_type_node_set);
+				n = new (alloc_node()) xpath_ast_node(ast_step, n, axis_descendant_or_self, nodetest_type_node, 0);
+				
+				return parse_relative_location_path(n);
+			}
+
+			// else clause moved outside of if because of bogus warning 'control may reach end of non-void function being inlined' in gcc 4.0.1
+			return parse_relative_location_path(0);
+		}
+		
+		// PathExpr ::= LocationPath
+		//				| FilterExpr
+		//				| FilterExpr '/' RelativeLocationPath
+		//				| FilterExpr '//' RelativeLocationPath
+		// UnionExpr ::= PathExpr | UnionExpr '|' PathExpr
+		// UnaryExpr ::= UnionExpr | '-' UnaryExpr
+		xpath_ast_node* parse_path_or_unary_expression()
+		{
+			// Clarification.
+			// PathExpr begins with either LocationPath or FilterExpr.
+			// FilterExpr begins with PrimaryExpr
+			// PrimaryExpr begins with '$' in case of it being a variable reference,
+			// '(' in case of it being an expression, string literal, number constant or
+			// function call.
+
+			if (_lexer.current() == lex_var_ref || _lexer.current() == lex_open_brace || 
+				_lexer.current() == lex_quoted_string || _lexer.current() == lex_number ||
+				_lexer.current() == lex_string)
+			{
+				if (_lexer.current() == lex_string)
+				{
+					// This is either a function call, or not - if not, we shall proceed with location path
+					const char_t* state = _lexer.state();
+					
+					while (PUGI__IS_CHARTYPE(*state, ct_space)) ++state;
+					
+					if (*state != '(') return parse_location_path();
+
+					// This looks like a function call; however this still can be a node-test. Check it.
+					if (parse_node_test_type(_lexer.contents()) != nodetest_none) return parse_location_path();
+				}
+				
+				xpath_ast_node* n = parse_filter_expression();
+
+				if (_lexer.current() == lex_slash || _lexer.current() == lex_double_slash)
+				{
+					lexeme_t l = _lexer.current();
+					_lexer.next();
+					
+					if (l == lex_double_slash)
+					{
+						if (n->rettype() != xpath_type_node_set) throw_error("Step has to be applied to node set");
+
+						n = new (alloc_node()) xpath_ast_node(ast_step, n, axis_descendant_or_self, nodetest_type_node, 0);
+					}
+	
+					// select from location path
+					return parse_relative_location_path(n);
+				}
+
+				return n;
+			}
+			else if (_lexer.current() == lex_minus)
+			{
+				_lexer.next();
+
+				// precedence 7+ - only parses union expressions
+				xpath_ast_node* expr = parse_expression_rec(parse_path_or_unary_expression(), 7);
+
+				return new (alloc_node()) xpath_ast_node(ast_op_negate, xpath_type_number, expr);
+			}
+			else
+				return parse_location_path();
+		}
+
+		struct binary_op_t
+		{
+			ast_type_t asttype;
+			xpath_value_type rettype;
+			int precedence;
+
+			binary_op_t(): asttype(ast_unknown), rettype(xpath_type_none), precedence(0)
+			{
+			}
+
+			binary_op_t(ast_type_t asttype_, xpath_value_type rettype_, int precedence_): asttype(asttype_), rettype(rettype_), precedence(precedence_)
+			{
+			}
+
+			static binary_op_t parse(xpath_lexer& lexer)
+			{
+				switch (lexer.current())
+				{
+				case lex_string:
+					if (lexer.contents() == PUGIXML_TEXT("or"))
+						return binary_op_t(ast_op_or, xpath_type_boolean, 1);
+					else if (lexer.contents() == PUGIXML_TEXT("and"))
+						return binary_op_t(ast_op_and, xpath_type_boolean, 2);
+					else if (lexer.contents() == PUGIXML_TEXT("div"))
+						return binary_op_t(ast_op_divide, xpath_type_number, 6);
+					else if (lexer.contents() == PUGIXML_TEXT("mod"))
+						return binary_op_t(ast_op_mod, xpath_type_number, 6);
+					else
+						return binary_op_t();
+
+				case lex_equal:
+					return binary_op_t(ast_op_equal, xpath_type_boolean, 3);
+
+				case lex_not_equal:
+					return binary_op_t(ast_op_not_equal, xpath_type_boolean, 3);
+
+				case lex_less:
+					return binary_op_t(ast_op_less, xpath_type_boolean, 4);
+
+				case lex_greater:
+					return binary_op_t(ast_op_greater, xpath_type_boolean, 4);
+
+				case lex_less_or_equal:
+					return binary_op_t(ast_op_less_or_equal, xpath_type_boolean, 4);
+
+				case lex_greater_or_equal:
+					return binary_op_t(ast_op_greater_or_equal, xpath_type_boolean, 4);
+
+				case lex_plus:
+					return binary_op_t(ast_op_add, xpath_type_number, 5);
+
+				case lex_minus:
+					return binary_op_t(ast_op_subtract, xpath_type_number, 5);
+
+				case lex_multiply:
+					return binary_op_t(ast_op_multiply, xpath_type_number, 6);
+
+				case lex_union:
+					return binary_op_t(ast_op_union, xpath_type_node_set, 7);
+
+				default:
+					return binary_op_t();
+				}
+			}
+		};
+
+		xpath_ast_node* parse_expression_rec(xpath_ast_node* lhs, int limit)
+		{
+			binary_op_t op = binary_op_t::parse(_lexer);
+
+			while (op.asttype != ast_unknown && op.precedence >= limit)
+			{
+				_lexer.next();
+
+				xpath_ast_node* rhs = parse_path_or_unary_expression();
+
+				binary_op_t nextop = binary_op_t::parse(_lexer);
+
+				while (nextop.asttype != ast_unknown && nextop.precedence > op.precedence)
+				{
+					rhs = parse_expression_rec(rhs, nextop.precedence);
+
+					nextop = binary_op_t::parse(_lexer);
+				}
+
+				if (op.asttype == ast_op_union && (lhs->rettype() != xpath_type_node_set || rhs->rettype() != xpath_type_node_set))
+					throw_error("Union operator has to be applied to node sets");
+
+				lhs = new (alloc_node()) xpath_ast_node(op.asttype, op.rettype, lhs, rhs);
+
+				op = binary_op_t::parse(_lexer);
+			}
+
+			return lhs;
+		}
+
+		// Expr ::= OrExpr
+		// OrExpr ::= AndExpr | OrExpr 'or' AndExpr
+		// AndExpr ::= EqualityExpr | AndExpr 'and' EqualityExpr
+		// EqualityExpr ::= RelationalExpr
+		//					| EqualityExpr '=' RelationalExpr
+		//					| EqualityExpr '!=' RelationalExpr
+		// RelationalExpr ::= AdditiveExpr
+		//					 | RelationalExpr '<' AdditiveExpr
+		//					 | RelationalExpr '>' AdditiveExpr
+		//					 | RelationalExpr '<=' AdditiveExpr
+		//					 | RelationalExpr '>=' AdditiveExpr
+		// AdditiveExpr ::= MultiplicativeExpr
+		//					| AdditiveExpr '+' MultiplicativeExpr
+		//					| AdditiveExpr '-' MultiplicativeExpr
+		// MultiplicativeExpr ::= UnaryExpr
+		//						 | MultiplicativeExpr '*' UnaryExpr
+		//						 | MultiplicativeExpr 'div' UnaryExpr
+		//						 | MultiplicativeExpr 'mod' UnaryExpr
+		xpath_ast_node* parse_expression()
+		{
+			return parse_expression_rec(parse_path_or_unary_expression(), 0);
+		}
+
+		xpath_parser(const char_t* query, xpath_variable_set* variables, xpath_allocator* alloc, xpath_parse_result* result): _alloc(alloc), _lexer(query), _query(query), _variables(variables), _result(result)
+		{
+		}
+
+		xpath_ast_node* parse()
+		{
+			xpath_ast_node* result = parse_expression();
+			
+			if (_lexer.current() != lex_eof)
+			{
+				// there are still unparsed tokens left, error
+				throw_error("Incorrect query");
+			}
+			
+			return result;
+		}
+
+		static xpath_ast_node* parse(const char_t* query, xpath_variable_set* variables, xpath_allocator* alloc, xpath_parse_result* result)
+		{
+			xpath_parser parser(query, variables, alloc, result);
+
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			int error = setjmp(parser._error_handler);
+
+			return (error == 0) ? parser.parse() : 0;
+		#else
+			return parser.parse();
+		#endif
+		}
+	};
+
+	struct xpath_query_impl
+	{
+		static xpath_query_impl* create()
+		{
+			void* memory = xml_memory::allocate(sizeof(xpath_query_impl));
+			if (!memory) return 0;
+
+			return new (memory) xpath_query_impl();
+		}
+
+		static void destroy(xpath_query_impl* impl)
+		{
+			// free all allocated pages
+			impl->alloc.release();
+
+			// free allocator memory (with the first page)
+			xml_memory::deallocate(impl);
+		}
+
+		xpath_query_impl(): root(0), alloc(&block)
+		{
+			block.next = 0;
+			block.capacity = sizeof(block.data);
+		}
+
+		xpath_ast_node* root;
+		xpath_allocator alloc;
+		xpath_memory_block block;
+	};
+
+	PUGI__FN xpath_string evaluate_string_impl(xpath_query_impl* impl, const xpath_node& n, xpath_stack_data& sd)
+	{
+		if (!impl) return xpath_string();
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		if (setjmp(sd.error_handler)) return xpath_string();
+	#endif
+
+		xpath_context c(n, 1, 1);
+
+		return impl->root->eval_string(c, sd.stack);
+	}
+
+	PUGI__FN impl::xpath_ast_node* evaluate_node_set_prepare(xpath_query_impl* impl)
+	{
+		if (!impl) return 0;
+
+		if (impl->root->rettype() != xpath_type_node_set)
+		{
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			return 0;
+		#else
+			xpath_parse_result res;
+			res.error = "Expression does not evaluate to node set";
+
+			throw xpath_exception(res);
+		#endif
+		}
+
+		return impl->root;
+	}
+PUGI__NS_END
+
+namespace pugi
+{
+#ifndef PUGIXML_NO_EXCEPTIONS
+	PUGI__FN xpath_exception::xpath_exception(const xpath_parse_result& result_): _result(result_)
+	{
+		assert(_result.error);
+	}
+	
+	PUGI__FN const char* xpath_exception::what() const throw()
+	{
+		return _result.error;
+	}
+
+	PUGI__FN const xpath_parse_result& xpath_exception::result() const
+	{
+		return _result;
+	}
+#endif
+	
+	PUGI__FN xpath_node::xpath_node()
+	{
+	}
+		
+	PUGI__FN xpath_node::xpath_node(const xml_node& node_): _node(node_)
+	{
+	}
+		
+	PUGI__FN xpath_node::xpath_node(const xml_attribute& attribute_, const xml_node& parent_): _node(attribute_ ? parent_ : xml_node()), _attribute(attribute_)
+	{
+	}
+
+	PUGI__FN xml_node xpath_node::node() const
+	{
+		return _attribute ? xml_node() : _node;
+	}
+		
+	PUGI__FN xml_attribute xpath_node::attribute() const
+	{
+		return _attribute;
+	}
+	
+	PUGI__FN xml_node xpath_node::parent() const
+	{
+		return _attribute ? _node : _node.parent();
+	}
+
+	PUGI__FN static void unspecified_bool_xpath_node(xpath_node***)
+	{
+	}
+
+	PUGI__FN xpath_node::operator xpath_node::unspecified_bool_type() const
+	{
+		return (_node || _attribute) ? unspecified_bool_xpath_node : 0;
+	}
+	
+	PUGI__FN bool xpath_node::operator!() const
+	{
+		return !(_node || _attribute);
+	}
+
+	PUGI__FN bool xpath_node::operator==(const xpath_node& n) const
+	{
+		return _node == n._node && _attribute == n._attribute;
+	}
+	
+	PUGI__FN bool xpath_node::operator!=(const xpath_node& n) const
+	{
+		return _node != n._node || _attribute != n._attribute;
+	}
+
+#ifdef __BORLANDC__
+	PUGI__FN bool operator&&(const xpath_node& lhs, bool rhs)
+	{
+		return (bool)lhs && rhs;
+	}
+
+	PUGI__FN bool operator||(const xpath_node& lhs, bool rhs)
+	{
+		return (bool)lhs || rhs;
+	}
+#endif
+
+	PUGI__FN void xpath_node_set::_assign(const_iterator begin_, const_iterator end_, type_t type_)
+	{
+		assert(begin_ <= end_);
+
+		size_t size_ = static_cast<size_t>(end_ - begin_);
+
+		if (size_ <= 1)
+		{
+			// deallocate old buffer
+			if (_begin != &_storage) impl::xml_memory::deallocate(_begin);
+
+			// use internal buffer
+			if (begin_ != end_) _storage = *begin_;
+
+			_begin = &_storage;
+			_end = &_storage + size_;
+			_type = type_;
+		}
+		else
+		{
+			// make heap copy
+			xpath_node* storage = static_cast<xpath_node*>(impl::xml_memory::allocate(size_ * sizeof(xpath_node)));
+
+			if (!storage)
+			{
+			#ifdef PUGIXML_NO_EXCEPTIONS
+				return;
+			#else
+				throw std::bad_alloc();
+			#endif
+			}
+
+			memcpy(storage, begin_, size_ * sizeof(xpath_node));
+			
+			// deallocate old buffer
+			if (_begin != &_storage) impl::xml_memory::deallocate(_begin);
+
+			// finalize
+			_begin = storage;
+			_end = storage + size_;
+			_type = type_;
+		}
+	}
+
+#if __cplusplus >= 201103
+	PUGI__FN void xpath_node_set::_move(xpath_node_set& rhs)
+	{
+		_type = rhs._type;
+		_storage = rhs._storage;
+		_begin = (rhs._begin == &rhs._storage) ? &_storage : rhs._begin;
+		_end = _begin + (rhs._end - rhs._begin);
+
+		rhs._type = type_unsorted;
+		rhs._begin = &rhs._storage;
+		rhs._end = rhs._begin;
+	}
+#endif
+
+	PUGI__FN xpath_node_set::xpath_node_set(): _type(type_unsorted), _begin(&_storage), _end(&_storage)
+	{
+	}
+
+	PUGI__FN xpath_node_set::xpath_node_set(const_iterator begin_, const_iterator end_, type_t type_): _type(type_unsorted), _begin(&_storage), _end(&_storage)
+	{
+		_assign(begin_, end_, type_);
+	}
+
+	PUGI__FN xpath_node_set::~xpath_node_set()
+	{
+		if (_begin != &_storage)
+			impl::xml_memory::deallocate(_begin);
+	}
+		
+	PUGI__FN xpath_node_set::xpath_node_set(const xpath_node_set& ns): _type(type_unsorted), _begin(&_storage), _end(&_storage)
+	{
+		_assign(ns._begin, ns._end, ns._type);
+	}
+	
+	PUGI__FN xpath_node_set& xpath_node_set::operator=(const xpath_node_set& ns)
+	{
+		if (this == &ns) return *this;
+
+		_assign(ns._begin, ns._end, ns._type);
+
+		return *this;
+	}
+
+#if __cplusplus >= 201103
+	PUGI__FN xpath_node_set::xpath_node_set(xpath_node_set&& rhs): _type(type_unsorted), _begin(&_storage), _end(&_storage)
+	{
+		_move(rhs);
+	}
+
+	PUGI__FN xpath_node_set& xpath_node_set::operator=(xpath_node_set&& rhs)
+	{
+		if (this == &rhs) return *this;
+
+		if (_begin != &_storage)
+			impl::xml_memory::deallocate(_begin);
+
+		_move(rhs);
+
+		return *this;
+	}
+#endif
+
+	PUGI__FN xpath_node_set::type_t xpath_node_set::type() const
+	{
+		return _type;
+	}
+		
+	PUGI__FN size_t xpath_node_set::size() const
+	{
+		return _end - _begin;
+	}
+		
+	PUGI__FN bool xpath_node_set::empty() const
+	{
+		return _begin == _end;
+	}
+		
+	PUGI__FN const xpath_node& xpath_node_set::operator[](size_t index) const
+	{
+		assert(index < size());
+		return _begin[index];
+	}
+
+	PUGI__FN xpath_node_set::const_iterator xpath_node_set::begin() const
+	{
+		return _begin;
+	}
+		
+	PUGI__FN xpath_node_set::const_iterator xpath_node_set::end() const
+	{
+		return _end;
+	}
+	
+	PUGI__FN void xpath_node_set::sort(bool reverse)
+	{
+		_type = impl::xpath_sort(_begin, _end, _type, reverse);
+	}
+
+	PUGI__FN xpath_node xpath_node_set::first() const
+	{
+		return impl::xpath_first(_begin, _end, _type);
+	}
+
+	PUGI__FN xpath_parse_result::xpath_parse_result(): error("Internal error"), offset(0)
+	{
+	}
+
+	PUGI__FN xpath_parse_result::operator bool() const
+	{
+		return error == 0;
+	}
+
+	PUGI__FN const char* xpath_parse_result::description() const
+	{
+		return error ? error : "No error";
+	}
+
+	PUGI__FN xpath_variable::xpath_variable(xpath_value_type type_): _type(type_), _next(0)
+	{
+	}
+
+	PUGI__FN const char_t* xpath_variable::name() const
+	{
+		switch (_type)
+		{
+		case xpath_type_node_set:
+			return static_cast<const impl::xpath_variable_node_set*>(this)->name;
+
+		case xpath_type_number:
+			return static_cast<const impl::xpath_variable_number*>(this)->name;
+
+		case xpath_type_string:
+			return static_cast<const impl::xpath_variable_string*>(this)->name;
+
+		case xpath_type_boolean:
+			return static_cast<const impl::xpath_variable_boolean*>(this)->name;
+
+		default:
+			assert(!"Invalid variable type");
+			return 0;
+		}
+	}
+
+	PUGI__FN xpath_value_type xpath_variable::type() const
+	{
+		return _type;
+	}
+
+	PUGI__FN bool xpath_variable::get_boolean() const
+	{
+		return (_type == xpath_type_boolean) ? static_cast<const impl::xpath_variable_boolean*>(this)->value : false;
+	}
+
+	PUGI__FN double xpath_variable::get_number() const
+	{
+		return (_type == xpath_type_number) ? static_cast<const impl::xpath_variable_number*>(this)->value : impl::gen_nan();
+	}
+
+	PUGI__FN const char_t* xpath_variable::get_string() const
+	{
+		const char_t* value = (_type == xpath_type_string) ? static_cast<const impl::xpath_variable_string*>(this)->value : 0;
+		return value ? value : PUGIXML_TEXT("");
+	}
+
+	PUGI__FN const xpath_node_set& xpath_variable::get_node_set() const
+	{
+		return (_type == xpath_type_node_set) ? static_cast<const impl::xpath_variable_node_set*>(this)->value : impl::dummy_node_set;
+	}
+
+	PUGI__FN bool xpath_variable::set(bool value)
+	{
+		if (_type != xpath_type_boolean) return false;
+
+		static_cast<impl::xpath_variable_boolean*>(this)->value = value;
+		return true;
+	}
+
+	PUGI__FN bool xpath_variable::set(double value)
+	{
+		if (_type != xpath_type_number) return false;
+
+		static_cast<impl::xpath_variable_number*>(this)->value = value;
+		return true;
+	}
+
+	PUGI__FN bool xpath_variable::set(const char_t* value)
+	{
+		if (_type != xpath_type_string) return false;
+
+		impl::xpath_variable_string* var = static_cast<impl::xpath_variable_string*>(this);
+
+		// duplicate string
+		size_t size = (impl::strlength(value) + 1) * sizeof(char_t);
+
+		char_t* copy = static_cast<char_t*>(impl::xml_memory::allocate(size));
+		if (!copy) return false;
+
+		memcpy(copy, value, size);
+
+		// replace old string
+		if (var->value) impl::xml_memory::deallocate(var->value);
+		var->value = copy;
+
+		return true;
+	}
+
+	PUGI__FN bool xpath_variable::set(const xpath_node_set& value)
+	{
+		if (_type != xpath_type_node_set) return false;
+
+		static_cast<impl::xpath_variable_node_set*>(this)->value = value;
+		return true;
+	}
+
+	PUGI__FN xpath_variable_set::xpath_variable_set()
+	{
+		for (size_t i = 0; i < sizeof(_data) / sizeof(_data[0]); ++i)
+			_data[i] = 0;
+	}
+
+	PUGI__FN xpath_variable_set::~xpath_variable_set()
+	{
+		for (size_t i = 0; i < sizeof(_data) / sizeof(_data[0]); ++i)
+			_destroy(_data[i]);
+	}
+
+	PUGI__FN xpath_variable_set::xpath_variable_set(const xpath_variable_set& rhs)
+	{
+		for (size_t i = 0; i < sizeof(_data) / sizeof(_data[0]); ++i)
+			_data[i] = 0;
+
+		_assign(rhs);
+	}
+
+	PUGI__FN xpath_variable_set& xpath_variable_set::operator=(const xpath_variable_set& rhs)
+	{
+		if (this == &rhs) return *this;
+
+		_assign(rhs);
+
+		return *this;
+	}
+
+#if __cplusplus >= 201103
+	PUGI__FN xpath_variable_set::xpath_variable_set(xpath_variable_set&& rhs)
+	{
+		for (size_t i = 0; i < sizeof(_data) / sizeof(_data[0]); ++i)
+		{
+			_data[i] = rhs._data[i];
+			rhs._data[i] = 0;
+		}
+	}
+
+	PUGI__FN xpath_variable_set& xpath_variable_set::operator=(xpath_variable_set&& rhs)
+	{
+		for (size_t i = 0; i < sizeof(_data) / sizeof(_data[0]); ++i)
+		{
+			_destroy(_data[i]);
+
+			_data[i] = rhs._data[i];
+			rhs._data[i] = 0;
+		}
+
+		return *this;
+	}
+#endif
+
+	PUGI__FN void xpath_variable_set::_assign(const xpath_variable_set& rhs)
+	{
+		xpath_variable_set temp;
+
+		for (size_t i = 0; i < sizeof(_data) / sizeof(_data[0]); ++i)
+			if (rhs._data[i] && !_clone(rhs._data[i], &temp._data[i]))
+				return;
+
+		_swap(temp);
+	}
+
+	PUGI__FN void xpath_variable_set::_swap(xpath_variable_set& rhs)
+	{
+		for (size_t i = 0; i < sizeof(_data) / sizeof(_data[0]); ++i)
+		{
+			xpath_variable* chain = _data[i];
+
+			_data[i] = rhs._data[i];
+			rhs._data[i] = chain;
+		}
+	}
+
+	PUGI__FN xpath_variable* xpath_variable_set::_find(const char_t* name) const
+	{
+		const size_t hash_size = sizeof(_data) / sizeof(_data[0]);
+		size_t hash = impl::hash_string(name) % hash_size;
+
+		// look for existing variable
+		for (xpath_variable* var = _data[hash]; var; var = var->_next)
+			if (impl::strequal(var->name(), name))
+				return var;
+
+		return 0;
+	}
+
+	PUGI__FN bool xpath_variable_set::_clone(xpath_variable* var, xpath_variable** out_result)
+	{
+		xpath_variable* last = 0;
+
+		while (var)
+		{
+			// allocate storage for new variable
+			xpath_variable* nvar = impl::new_xpath_variable(var->_type, var->name());
+			if (!nvar) return false;
+
+			// link the variable to the result immediately to handle failures gracefully
+			if (last)
+				last->_next = nvar;
+			else
+				*out_result = nvar;
+
+			last = nvar;
+
+			// copy the value; this can fail due to out-of-memory conditions
+			if (!impl::copy_xpath_variable(nvar, var)) return false;
+
+			var = var->_next;
+		}
+
+		return true;
+	}
+
+	PUGI__FN void xpath_variable_set::_destroy(xpath_variable* var)
+	{
+		while (var)
+		{
+			xpath_variable* next = var->_next;
+
+			impl::delete_xpath_variable(var->_type, var);
+
+			var = next;
+		}
+	}
+
+	PUGI__FN xpath_variable* xpath_variable_set::add(const char_t* name, xpath_value_type type)
+	{
+		const size_t hash_size = sizeof(_data) / sizeof(_data[0]);
+		size_t hash = impl::hash_string(name) % hash_size;
+
+		// look for existing variable
+		for (xpath_variable* var = _data[hash]; var; var = var->_next)
+			if (impl::strequal(var->name(), name))
+				return var->type() == type ? var : 0;
+
+		// add new variable
+		xpath_variable* result = impl::new_xpath_variable(type, name);
+
+		if (result)
+		{
+			result->_next = _data[hash];
+
+			_data[hash] = result;
+		}
+
+		return result;
+	}
+
+	PUGI__FN bool xpath_variable_set::set(const char_t* name, bool value)
+	{
+		xpath_variable* var = add(name, xpath_type_boolean);
+		return var ? var->set(value) : false;
+	}
+
+	PUGI__FN bool xpath_variable_set::set(const char_t* name, double value)
+	{
+		xpath_variable* var = add(name, xpath_type_number);
+		return var ? var->set(value) : false;
+	}
+
+	PUGI__FN bool xpath_variable_set::set(const char_t* name, const char_t* value)
+	{
+		xpath_variable* var = add(name, xpath_type_string);
+		return var ? var->set(value) : false;
+	}
+
+	PUGI__FN bool xpath_variable_set::set(const char_t* name, const xpath_node_set& value)
+	{
+		xpath_variable* var = add(name, xpath_type_node_set);
+		return var ? var->set(value) : false;
+	}
+
+	PUGI__FN xpath_variable* xpath_variable_set::get(const char_t* name)
+	{
+		return _find(name);
+	}
+
+	PUGI__FN const xpath_variable* xpath_variable_set::get(const char_t* name) const
+	{
+		return _find(name);
+	}
+
+	PUGI__FN xpath_query::xpath_query(const char_t* query, xpath_variable_set* variables): _impl(0)
+	{
+		impl::xpath_query_impl* qimpl = impl::xpath_query_impl::create();
+
+		if (!qimpl)
+		{
+		#ifdef PUGIXML_NO_EXCEPTIONS
+			_result.error = "Out of memory";
+		#else
+			throw std::bad_alloc();
+		#endif
+		}
+		else
+		{
+			using impl::auto_deleter; // MSVC7 workaround
+			auto_deleter<impl::xpath_query_impl> impl(qimpl, impl::xpath_query_impl::destroy);
+
+			qimpl->root = impl::xpath_parser::parse(query, variables, &qimpl->alloc, &_result);
+
+			if (qimpl->root)
+			{
+				qimpl->root->optimize(&qimpl->alloc);
+
+				_impl = impl.release();
+				_result.error = 0;
+			}
+		}
+	}
+
+	PUGI__FN xpath_query::xpath_query(): _impl(0)
+	{
+	}
+
+	PUGI__FN xpath_query::~xpath_query()
+	{
+		if (_impl)
+			impl::xpath_query_impl::destroy(static_cast<impl::xpath_query_impl*>(_impl));
+	}
+
+#if __cplusplus >= 201103
+	PUGI__FN xpath_query::xpath_query(xpath_query&& rhs)
+	{
+		_impl = rhs._impl;
+		rhs._impl = 0;
+	}
+
+	xpath_query& xpath_query::operator=(xpath_query&& rhs)
+	{
+		if (this == &rhs) return *this;
+
+		if (_impl)
+			impl::xpath_query_impl::destroy(static_cast<impl::xpath_query_impl*>(_impl));
+
+		_impl = rhs._impl;
+		rhs._impl = 0;
+
+		return *this;
+	}
+#endif
+
+	PUGI__FN xpath_value_type xpath_query::return_type() const
+	{
+		if (!_impl) return xpath_type_none;
+
+		return static_cast<impl::xpath_query_impl*>(_impl)->root->rettype();
+	}
+
+	PUGI__FN bool xpath_query::evaluate_boolean(const xpath_node& n) const
+	{
+		if (!_impl) return false;
+		
+		impl::xpath_context c(n, 1, 1);
+		impl::xpath_stack_data sd;
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		if (setjmp(sd.error_handler)) return false;
+	#endif
+		
+		return static_cast<impl::xpath_query_impl*>(_impl)->root->eval_boolean(c, sd.stack);
+	}
+	
+	PUGI__FN double xpath_query::evaluate_number(const xpath_node& n) const
+	{
+		if (!_impl) return impl::gen_nan();
+		
+		impl::xpath_context c(n, 1, 1);
+		impl::xpath_stack_data sd;
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		if (setjmp(sd.error_handler)) return impl::gen_nan();
+	#endif
+
+		return static_cast<impl::xpath_query_impl*>(_impl)->root->eval_number(c, sd.stack);
+	}
+
+#ifndef PUGIXML_NO_STL
+	PUGI__FN string_t xpath_query::evaluate_string(const xpath_node& n) const
+	{
+		impl::xpath_stack_data sd;
+
+		impl::xpath_string r = impl::evaluate_string_impl(static_cast<impl::xpath_query_impl*>(_impl), n, sd);
+
+		return string_t(r.c_str(), r.length());
+	}
+#endif
+
+	PUGI__FN size_t xpath_query::evaluate_string(char_t* buffer, size_t capacity, const xpath_node& n) const
+	{
+		impl::xpath_stack_data sd;
+
+		impl::xpath_string r = impl::evaluate_string_impl(static_cast<impl::xpath_query_impl*>(_impl), n, sd);
+
+		size_t full_size = r.length() + 1;
+		
+		if (capacity > 0)
+		{
+			size_t size = (full_size < capacity) ? full_size : capacity;
+			assert(size > 0);
+
+			memcpy(buffer, r.c_str(), (size - 1) * sizeof(char_t));
+			buffer[size - 1] = 0;
+		}
+		
+		return full_size;
+	}
+
+	PUGI__FN xpath_node_set xpath_query::evaluate_node_set(const xpath_node& n) const
+	{
+		impl::xpath_ast_node* root = impl::evaluate_node_set_prepare(static_cast<impl::xpath_query_impl*>(_impl));
+		if (!root) return xpath_node_set();
+
+		impl::xpath_context c(n, 1, 1);
+		impl::xpath_stack_data sd;
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		if (setjmp(sd.error_handler)) return xpath_node_set();
+	#endif
+
+		impl::xpath_node_set_raw r = root->eval_node_set(c, sd.stack, impl::nodeset_eval_all);
+
+		return xpath_node_set(r.begin(), r.end(), r.type());
+	}
+
+	PUGI__FN xpath_node xpath_query::evaluate_node(const xpath_node& n) const
+	{
+		impl::xpath_ast_node* root = impl::evaluate_node_set_prepare(static_cast<impl::xpath_query_impl*>(_impl));
+		if (!root) return xpath_node();
+
+		impl::xpath_context c(n, 1, 1);
+		impl::xpath_stack_data sd;
+
+	#ifdef PUGIXML_NO_EXCEPTIONS
+		if (setjmp(sd.error_handler)) return xpath_node();
+	#endif
+
+		impl::xpath_node_set_raw r = root->eval_node_set(c, sd.stack, impl::nodeset_eval_first);
+
+		return r.first();
+	}
+
+	PUGI__FN const xpath_parse_result& xpath_query::result() const
+	{
+		return _result;
+	}
+
+	PUGI__FN static void unspecified_bool_xpath_query(xpath_query***)
+	{
+	}
+
+	PUGI__FN xpath_query::operator xpath_query::unspecified_bool_type() const
+	{
+		return _impl ? unspecified_bool_xpath_query : 0;
+	}
+
+	PUGI__FN bool xpath_query::operator!() const
+	{
+		return !_impl;
+	}
+
+	PUGI__FN xpath_node xml_node::select_node(const char_t* query, xpath_variable_set* variables) const
+	{
+		xpath_query q(query, variables);
+		return select_node(q);
+	}
+
+	PUGI__FN xpath_node xml_node::select_node(const xpath_query& query) const
+	{
+		return query.evaluate_node(*this);
+	}
+
+	PUGI__FN xpath_node_set xml_node::select_nodes(const char_t* query, xpath_variable_set* variables) const
+	{
+		xpath_query q(query, variables);
+		return select_nodes(q);
+	}
+
+	PUGI__FN xpath_node_set xml_node::select_nodes(const xpath_query& query) const
+	{
+		return query.evaluate_node_set(*this);
+	}
+
+	PUGI__FN xpath_node xml_node::select_single_node(const char_t* query, xpath_variable_set* variables) const
+	{
+		xpath_query q(query, variables);
+		return select_single_node(q);
+	}
+
+	PUGI__FN xpath_node xml_node::select_single_node(const xpath_query& query) const
+	{
+		return query.evaluate_node(*this);
+	}
+}
+
+#endif
+
+#ifdef __BORLANDC__
+#	pragma option pop
+#endif
+
+// Intel C++ does not properly keep warning state for function templates,
+// so popping warning state at the end of translation unit leads to warnings in the middle.
+#if defined(_MSC_VER) && !defined(__INTEL_COMPILER)
+#	pragma warning(pop)
+#endif
+
+// Undefine all local macros (makes sure we're not leaking macros in header-only mode)
+#undef PUGI__NO_INLINE
+#undef PUGI__UNLIKELY
+#undef PUGI__STATIC_ASSERT
+#undef PUGI__DMC_VOLATILE
+#undef PUGI__MSVC_CRT_VERSION
+#undef PUGI__NS_BEGIN
+#undef PUGI__NS_END
+#undef PUGI__FN
+#undef PUGI__FN_NO_INLINE
+#undef PUGI__GETPAGE_IMPL
+#undef PUGI__GETPAGE
+#undef PUGI__NODETYPE
+#undef PUGI__IS_CHARTYPE_IMPL
+#undef PUGI__IS_CHARTYPE
+#undef PUGI__IS_CHARTYPEX
+#undef PUGI__ENDSWITH
+#undef PUGI__SKIPWS
+#undef PUGI__OPTSET
+#undef PUGI__PUSHNODE
+#undef PUGI__POPNODE
+#undef PUGI__SCANFOR
+#undef PUGI__SCANWHILE
+#undef PUGI__SCANWHILE_UNROLL
+#undef PUGI__ENDSEG
+#undef PUGI__THROW_ERROR
+#undef PUGI__CHECK_ERROR
+
+#endif
+
+/**
+ * Copyright (c) 2006-2015 Arseny Kapoulkine
+ *
+ * Permission is hereby granted, free of charge, to any person
+ * obtaining a copy of this software and associated documentation
+ * files (the "Software"), to deal in the Software without
+ * restriction, including without limitation the rights to use,
+ * copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following
+ * conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ * 
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+ * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+ * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+ * OTHER DEALINGS IN THE SOFTWARE.
+ */

lightspark.tar.xz/src/3rdparty/pugixml/src/pugixml.hpp Added

@@ -0,0 +1,1400 @@
+/**
+ * pugixml parser - version 1.6
+ * --------------------------------------------------------
+ * Copyright (C) 2006-2015, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)
+ * Report bugs and download new versions at http://pugixml.org/
+ *
+ * This library is distributed under the MIT License. See notice at the end
+ * of this file.
+ *
+ * This work is based on the pugxml parser, which is:
+ * Copyright (C) 2003, by Kristen Wegner (kristen@tima.net)
+ */
+
+#ifndef PUGIXML_VERSION
+// Define version macro; evaluates to major * 100 + minor so that it's safe to use in less-than comparisons
+#	define PUGIXML_VERSION 160
+#endif
+
+// Include user configuration file (this can define various configuration macros)
+#include "pugiconfig.hpp"
+
+#ifndef HEADER_PUGIXML_HPP
+#define HEADER_PUGIXML_HPP
+
+// Include stddef.h for size_t and ptrdiff_t
+#include <stddef.h>
+
+// Include exception header for XPath
+#if !defined(PUGIXML_NO_XPATH) && !defined(PUGIXML_NO_EXCEPTIONS)
+#	include <exception>
+#endif
+
+// Include STL headers
+#ifndef PUGIXML_NO_STL
+#	include <iterator>
+#	include <iosfwd>
+#	include <string>
+#endif
+
+// Macro for deprecated features
+#ifndef PUGIXML_DEPRECATED
+#	if defined(__GNUC__)
+#		define PUGIXML_DEPRECATED __attribute__((deprecated))
+#	elif defined(_MSC_VER) && _MSC_VER >= 1300
+#		define PUGIXML_DEPRECATED __declspec(deprecated)
+#	else
+#		define PUGIXML_DEPRECATED
+#	endif
+#endif
+
+// If no API is defined, assume default
+#ifndef PUGIXML_API
+#	define PUGIXML_API
+#endif
+
+// If no API for classes is defined, assume default
+#ifndef PUGIXML_CLASS
+#	define PUGIXML_CLASS PUGIXML_API
+#endif
+
+// If no API for functions is defined, assume default
+#ifndef PUGIXML_FUNCTION
+#	define PUGIXML_FUNCTION PUGIXML_API
+#endif
+
+// If the platform is known to have long long support, enable long long functions
+#ifndef PUGIXML_HAS_LONG_LONG
+#	if __cplusplus >= 201103
+#		define PUGIXML_HAS_LONG_LONG
+#	elif defined(_MSC_VER) && _MSC_VER >= 1400
+#		define PUGIXML_HAS_LONG_LONG
+#	endif
+#endif
+
+// Character interface macros
+#ifdef PUGIXML_WCHAR_MODE
+#	define PUGIXML_TEXT(t) L ## t
+#	define PUGIXML_CHAR wchar_t
+#else
+#	define PUGIXML_TEXT(t) t
+#	define PUGIXML_CHAR char
+#endif
+
+namespace pugi
+{
+	// Character type used for all internal storage and operations; depends on PUGIXML_WCHAR_MODE
+	typedef PUGIXML_CHAR char_t;
+
+#ifndef PUGIXML_NO_STL
+	// String type used for operations that work with STL string; depends on PUGIXML_WCHAR_MODE
+	typedef std::basic_string<PUGIXML_CHAR, std::char_traits<PUGIXML_CHAR>, std::allocator<PUGIXML_CHAR> > string_t;
+#endif
+}
+
+// The PugiXML namespace
+namespace pugi
+{
+	// Tree node types
+	enum xml_node_type
+	{
+		node_null,			// Empty (null) node handle
+		node_document,		// A document tree's absolute root
+		node_element,		// Element tag, i.e. '<node/>'
+		node_pcdata,		// Plain character data, i.e. 'text'
+		node_cdata,			// Character data, i.e. '<![CDATA[text]]>'
+		node_comment,		// Comment tag, i.e. ''
+		node_pi,			// Processing instruction, i.e. '<?name?>'
+		node_declaration,	// Document declaration, i.e. '<?xml version="1.0"?>'
+		node_doctype		// Document type declaration, i.e. '<!DOCTYPE doc>'
+	};
+
+	// Parsing options
+
+	// Minimal parsing mode (equivalent to turning all other flags off).
+	// Only elements and PCDATA sections are added to the DOM tree, no text conversions are performed.
+	const unsigned int parse_minimal = 0x0000;
+
+	// This flag determines if processing instructions (node_pi) are added to the DOM tree. This flag is off by default.
+	const unsigned int parse_pi = 0x0001;
+
+	// This flag determines if comments (node_comment) are added to the DOM tree. This flag is off by default.
+	const unsigned int parse_comments = 0x0002;
+
+	// This flag determines if CDATA sections (node_cdata) are added to the DOM tree. This flag is on by default.
+	const unsigned int parse_cdata = 0x0004;
+
+	// This flag determines if plain character data (node_pcdata) that consist only of whitespace are added to the DOM tree.
+	// This flag is off by default; turning it on usually results in slower parsing and more memory consumption.
+	const unsigned int parse_ws_pcdata = 0x0008;
+
+	// This flag determines if character and entity references are expanded during parsing. This flag is on by default.
+	const unsigned int parse_escapes = 0x0010;
+
+	// This flag determines if EOL characters are normalized (converted to #xA) during parsing. This flag is on by default.
+	const unsigned int parse_eol = 0x0020;
+	
+	// This flag determines if attribute values are normalized using CDATA normalization rules during parsing. This flag is on by default.
+	const unsigned int parse_wconv_attribute = 0x0040;
+
+	// This flag determines if attribute values are normalized using NMTOKENS normalization rules during parsing. This flag is off by default.
+	const unsigned int parse_wnorm_attribute = 0x0080;
+	
+	// This flag determines if document declaration (node_declaration) is added to the DOM tree. This flag is off by default.
+	const unsigned int parse_declaration = 0x0100;
+
+	// This flag determines if document type declaration (node_doctype) is added to the DOM tree. This flag is off by default.
+	const unsigned int parse_doctype = 0x0200;
+
+	// This flag determines if plain character data (node_pcdata) that is the only child of the parent node and that consists only
+	// of whitespace is added to the DOM tree.
+	// This flag is off by default; turning it on may result in slower parsing and more memory consumption.
+	const unsigned int parse_ws_pcdata_single = 0x0400;
+
+	// This flag determines if leading and trailing whitespace is to be removed from plain character data. This flag is off by default.
+	const unsigned int parse_trim_pcdata = 0x0800;
+
+	// This flag determines if plain character data that does not have a parent node is added to the DOM tree, and if an empty document
+	// is a valid document. This flag is off by default.
+	const unsigned int parse_fragment = 0x1000;
+
+	// The default parsing mode.
+	// Elements, PCDATA and CDATA sections are added to the DOM tree, character/reference entities are expanded,
+	// End-of-Line characters are normalized, attribute values are normalized using CDATA normalization rules.
+	const unsigned int parse_default = parse_cdata | parse_escapes | parse_wconv_attribute | parse_eol;
+
+	// The full parsing mode.
+	// Nodes of all types are added to the DOM tree, character/reference entities are expanded,
+	// End-of-Line characters are normalized, attribute values are normalized using CDATA normalization rules.
+	const unsigned int parse_full = parse_default | parse_pi | parse_comments | parse_declaration | parse_doctype;
+
+	// These flags determine the encoding of input data for XML document
+	enum xml_encoding
+	{
+		encoding_auto,		// Auto-detect input encoding using BOM or < / <? detection; use UTF8 if BOM is not found
+		encoding_utf8,		// UTF8 encoding
+		encoding_utf16_le,	// Little-endian UTF16
+		encoding_utf16_be,	// Big-endian UTF16
+		encoding_utf16,		// UTF16 with native endianness
+		encoding_utf32_le,	// Little-endian UTF32
+		encoding_utf32_be,	// Big-endian UTF32
+		encoding_utf32,		// UTF32 with native endianness
+		encoding_wchar,		// The same encoding wchar_t has (either UTF16 or UTF32)
+		encoding_latin1
+	};
+
+	// 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;
+	
+	// Write encoding-specific BOM to the output stream. This flag is off by default.
+	const unsigned int format_write_bom = 0x02;
+
+	// Use raw output mode (no indentation and no line breaks are written). This flag is off by default.
+	const unsigned int format_raw = 0x04;
+	
+	// Omit default XML declaration even if there is no declaration in the document. This flag is off by default.
+	const unsigned int format_no_declaration = 0x08;
+
+	// Don't escape attribute values and PCDATA contents. This flag is off by default.
+	const unsigned int format_no_escapes = 0x10;
+
+	// Open file using text mode in xml_document::save_file. This enables special character (i.e. new-line) conversions on some systems. This flag is off by default.
+	const unsigned int format_save_file_text = 0x20;
+
+	// Write every attribute on a new line with appropriate indentation. This flag is off by default.
+	const unsigned int format_indent_attributes = 0x40;
+
+	// The default set of formatting flags.
+	// Nodes are indented depending on their depth in DOM tree, a default declaration is output if document has none.
+	const unsigned int format_default = format_indent;
+
+	// Forward declarations
+	struct xml_attribute_struct;
+	struct xml_node_struct;
+
+	class xml_node_iterator;
+	class xml_attribute_iterator;
+	class xml_named_node_iterator;
+
+	class xml_tree_walker;
+
+	struct xml_parse_result;
+
+	class xml_node;
+
+	class xml_text;
+	
+	#ifndef PUGIXML_NO_XPATH
+	class xpath_node;
+	class xpath_node_set;
+	class xpath_query;
+	class xpath_variable_set;
+	#endif
+
+	// Range-based for loop support
+	template <typename It> class xml_object_range
+	{
+	public:
+		typedef It const_iterator;
+		typedef It iterator;
+
+		xml_object_range(It b, It e): _begin(b), _end(e)
+		{
+		}
+
+		It begin() const { return _begin; }
+		It end() const { return _end; }
+
+	private:
+		It _begin, _end;
+	};
+
+	// Writer interface for node printing (see xml_node::print)
+	class PUGIXML_CLASS xml_writer
+	{
+	public:
+		virtual ~xml_writer() {}
+
+		// Write memory chunk into stream/file/whatever
+		virtual void write(const void* data, size_t size) = 0;
+	};
+
+	// xml_writer implementation for FILE*
+	class PUGIXML_CLASS xml_writer_file: public xml_writer
+	{
+	public:
+		// Construct writer from a 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
+	class PUGIXML_CLASS xml_writer_stream: public xml_writer
+	{
+	public:
+		// Construct writer from an output stream object
+		xml_writer_stream(std::basic_ostream<char, std::char_traits<char> >& stream);
+		xml_writer_stream(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >& stream);
+
+		virtual void write(const void* data, size_t size);
+
+	private:
+		std::basic_ostream<char, std::char_traits<char> >* narrow_stream;
+		std::basic_ostream<wchar_t, std::char_traits<wchar_t> >* wide_stream;
+	};
+	#endif
+
+	// A light-weight handle for manipulating attributes in DOM tree
+	class PUGIXML_CLASS xml_attribute
+	{
+		friend class xml_attribute_iterator;
+		friend class xml_node;
+
+	private:
+		xml_attribute_struct* _attr;
+	
+		typedef void (*unspecified_bool_type)(xml_attribute***);
+
+	public:
+		// Default constructor. Constructs an empty attribute.
+		xml_attribute();
+		
+		// Constructs attribute from internal pointer
+		explicit xml_attribute(xml_attribute_struct* attr);
+
+		// Safe bool conversion operator
+		operator unspecified_bool_type() const;
+
+		// Borland C++ workaround
+		bool operator!() const;
+
+		// Comparison operators (compares wrapped attribute pointers)
+		bool operator==(const xml_attribute& r) const;
+		bool operator!=(const xml_attribute& r) const;
+		bool operator<(const xml_attribute& r) const;
+		bool operator>(const xml_attribute& r) const;
+		bool operator<=(const xml_attribute& r) const;
+		bool operator>=(const xml_attribute& r) const;
+
+		// Check if attribute is empty
+		bool empty() const;
+
+		// Get attribute name/value, or "" if attribute is empty
+		const char_t* name() const;
+		const char_t* value() const;
+
+		// Get attribute value, or the default value if attribute is empty
+		const char_t* as_string(const char_t* def = PUGIXML_TEXT("")) const;
+
+		// Get attribute value as a number, or the default value if conversion did not succeed or attribute is empty
+		int as_int(int def = 0) const;
+		unsigned int as_uint(unsigned int def = 0) const;
+		double as_double(double def = 0) const;
+		float as_float(float def = 0) const;
+
+	#ifdef PUGIXML_HAS_LONG_LONG
+		long long as_llong(long long def = 0) const;
+		unsigned long long as_ullong(unsigned long long def = 0) const;
+	#endif
+
+		// Get attribute value as bool (returns true if first character is in '1tTyY' set), or the default value if attribute is empty
+		bool as_bool(bool def = false) const;
+
+		// Set attribute name/value (returns false if attribute is empty or there is not enough memory)
+		bool set_name(const char_t* rhs);
+		bool set_value(const char_t* rhs);
+
+		// Set attribute value with type conversion (numbers are converted to strings, boolean is converted to "true"/"false")
+		bool set_value(int rhs);
+		bool set_value(unsigned int rhs);
+		bool set_value(double rhs);
+		bool set_value(float rhs);
+		bool set_value(bool rhs);
+
+	#ifdef PUGIXML_HAS_LONG_LONG
+		bool set_value(long long rhs);
+		bool set_value(unsigned long long rhs);
+	#endif
+
+		// Set attribute value (equivalent to set_value without error checking)
+		xml_attribute& operator=(const char_t* rhs);
+		xml_attribute& operator=(int rhs);
+		xml_attribute& operator=(unsigned int rhs);
+		xml_attribute& operator=(double rhs);
+		xml_attribute& operator=(float rhs);
+		xml_attribute& operator=(bool rhs);
+
+	#ifdef PUGIXML_HAS_LONG_LONG
+		xml_attribute& operator=(long long rhs);
+		xml_attribute& operator=(unsigned long long rhs);
+	#endif
+
+		// Get next/previous attribute in the attribute list of the parent node
+		xml_attribute next_attribute() const;
+		xml_attribute previous_attribute() const;
+
+		// Get hash value (unique for handles to the same object)
+		size_t hash_value() const;
+
+		// Get internal pointer
+		xml_attribute_struct* internal_object() const;
+	};
+
+#ifdef __BORLANDC__
+	// Borland C++ workaround
+	bool PUGIXML_FUNCTION operator&&(const xml_attribute& lhs, bool rhs);
+	bool PUGIXML_FUNCTION operator||(const xml_attribute& lhs, bool rhs);
+#endif
+
+	// A light-weight handle for manipulating nodes in DOM tree
+	class PUGIXML_CLASS xml_node
+	{
+		friend class xml_attribute_iterator;
+		friend class xml_node_iterator;
+		friend class xml_named_node_iterator;
+
+	protected:
+		xml_node_struct* _root;
+
+		typedef void (*unspecified_bool_type)(xml_node***);
+
+	public:
+		// Default constructor. Constructs an empty node.
+		xml_node();
+
+		// Constructs node from internal pointer
+		explicit xml_node(xml_node_struct* p);
+
+		// Safe bool conversion operator
+		operator unspecified_bool_type() const;
+
+		// Borland C++ workaround
+		bool operator!() const;
+	
+		// Comparison operators (compares wrapped node pointers)
+		bool operator==(const xml_node& r) const;
+		bool operator!=(const xml_node& r) const;
+		bool operator<(const xml_node& r) const;
+		bool operator>(const xml_node& r) const;
+		bool operator<=(const xml_node& r) const;
+		bool operator>=(const xml_node& r) const;
+
+		// Check if node is empty.
+		bool empty() const;
+
+		// Get node type
+		xml_node_type type() const;
+
+		// Get node name, or "" if node is empty or it has no name
+		const char_t* name() const;
+
+		// Get node value, or "" if node is empty or it has no value
+		// Note: For <node>text</node> node.value() does not return "text"! Use child_value() or text() methods to access text inside nodes.
+		const char_t* value() const;
+	
+		// Get attribute list
+		xml_attribute first_attribute() const;
+		xml_attribute last_attribute() const;
+
+		// Get children list
+		xml_node first_child() const;
+		xml_node last_child() const;
+
+		// Get next/previous sibling in the children list of the parent node
+		xml_node next_sibling() const;
+		xml_node previous_sibling() const;
+		
+		// Get parent node
+		xml_node parent() const;
+
+		// Get root of DOM tree this node belongs to
+		xml_node root() const;
+
+		// Get text object for the current node
+		xml_text text() const;
+
+		// Get child, attribute or next/previous sibling with the specified name
+		xml_node child(const char_t* name) const;
+		xml_attribute attribute(const char_t* name) const;
+		xml_node next_sibling(const char_t* name) const;
+		xml_node previous_sibling(const char_t* name) const;
+
+		// Get attribute, starting the search from a hint (and updating hint so that searching for a sequence of attributes is fast)
+		xml_attribute attribute(const char_t* name, xml_attribute& hint) const;
+
+		// Get child value of current node; that is, value of the first child node of type PCDATA/CDATA
+		const char_t* child_value() const;
+
+		// Get child value of child with specified name. Equivalent to child(name).child_value().
+		const char_t* child_value(const char_t* name) const;
+
+		// Set node name/value (returns false if node is empty, there is not enough memory, or node can not have name/value)
+		bool set_name(const char_t* rhs);
+		bool set_value(const char_t* rhs);
+		
+		// Add attribute with specified name. Returns added attribute, or empty attribute on errors.
+		xml_attribute append_attribute(const char_t* name);
+		xml_attribute prepend_attribute(const char_t* name);
+		xml_attribute insert_attribute_after(const char_t* name, const xml_attribute& attr);
+		xml_attribute insert_attribute_before(const char_t* name, const xml_attribute& attr);
+
+		// Add a copy of the specified attribute. Returns added attribute, or empty attribute on errors.
+		xml_attribute append_copy(const xml_attribute& proto);
+		xml_attribute prepend_copy(const xml_attribute& proto);
+		xml_attribute insert_copy_after(const xml_attribute& proto, const xml_attribute& attr);
+		xml_attribute insert_copy_before(const xml_attribute& proto, const xml_attribute& attr);
+
+		// Add child node with specified type. Returns added node, or empty node on errors.
+		xml_node append_child(xml_node_type type = node_element);
+		xml_node prepend_child(xml_node_type type = node_element);
+		xml_node insert_child_after(xml_node_type type, const xml_node& node);
+		xml_node insert_child_before(xml_node_type type, const xml_node& node);
+
+		// Add child element with specified name. Returns added node, or empty node on errors.
+		xml_node append_child(const char_t* name);
+		xml_node prepend_child(const char_t* name);
+		xml_node insert_child_after(const char_t* name, const xml_node& node);
+		xml_node insert_child_before(const char_t* name, const xml_node& node);
+
+		// Add a copy of the specified node as a child. Returns added node, or empty node on errors.
+		xml_node append_copy(const xml_node& proto);
+		xml_node prepend_copy(const xml_node& proto);
+		xml_node insert_copy_after(const xml_node& proto, const xml_node& node);
+		xml_node insert_copy_before(const xml_node& proto, const xml_node& node);
+
+		// Move the specified node to become a child of this node. Returns moved node, or empty node on errors.
+		xml_node append_move(const xml_node& moved);
+		xml_node prepend_move(const xml_node& moved);
+		xml_node insert_move_after(const xml_node& moved, const xml_node& node);
+		xml_node insert_move_before(const xml_node& moved, const xml_node& node);
+
+		// Remove specified attribute
+		bool remove_attribute(const xml_attribute& a);
+		bool remove_attribute(const char_t* name);
+
+		// Remove specified child
+		bool remove_child(const xml_node& n);
+		bool remove_child(const char_t* name);
+
+		// Parses buffer as an XML document fragment and appends all nodes as children of the current node.
+		// Copies/converts the buffer, so it may be deleted or changed after the function returns.
+		// Note: append_buffer allocates memory that has the lifetime of the owning document; removing the appended nodes does not immediately reclaim that memory.
+		xml_parse_result append_buffer(const void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+		// Find attribute using predicate. Returns first attribute for which predicate returned true.
+		template <typename Predicate> xml_attribute find_attribute(Predicate pred) const
+		{
+			if (!_root) return xml_attribute();
+			
+			for (xml_attribute attrib = first_attribute(); attrib; attrib = attrib.next_attribute())
+				if (pred(attrib))
+					return attrib;
+		
+			return xml_attribute();
+		}
+
+		// Find child node using predicate. Returns first child for which predicate returned true.
+		template <typename Predicate> xml_node find_child(Predicate pred) const
+		{
+			if (!_root) return xml_node();
+	
+			for (xml_node node = first_child(); node; node = node.next_sibling())
+				if (pred(node))
+					return node;
+		
+			return xml_node();
+		}
+
+		// Find node from subtree using predicate. Returns first node from subtree (depth-first), for which predicate returned true.
+		template <typename Predicate> xml_node find_node(Predicate pred) const
+		{
+			if (!_root) return xml_node();
+
+			xml_node cur = first_child();
+			
+			while (cur._root && cur._root != _root)
+			{
+				if (pred(cur)) return cur;
+
+				if (cur.first_child()) cur = cur.first_child();
+				else if (cur.next_sibling()) cur = cur.next_sibling();
+				else
+				{
+					while (!cur.next_sibling() && cur._root != _root) cur = cur.parent();
+
+					if (cur._root != _root) cur = cur.next_sibling();
+				}
+			}
+
+			return xml_node();
+		}
+
+		// Find child node by attribute name/value
+		xml_node find_child_by_attribute(const char_t* name, const char_t* attr_name, const char_t* attr_value) const;
+		xml_node find_child_by_attribute(const char_t* attr_name, const char_t* attr_value) const;
+
+	#ifndef PUGIXML_NO_STL
+		// Get the absolute node path from root as a text string.
+		string_t path(char_t delimiter = '/') const;
+	#endif
+
+		// Search for a node by path consisting of node names and . or .. elements.
+		xml_node first_element_by_path(const char_t* path, char_t delimiter = '/') const;
+
+		// Recursively traverse subtree with xml_tree_walker
+		bool traverse(xml_tree_walker& walker);
+	
+	#ifndef PUGIXML_NO_XPATH
+		// Select single node by evaluating XPath query. Returns first node from the resulting node set.
+		xpath_node select_node(const char_t* query, xpath_variable_set* variables = 0) const;
+		xpath_node select_node(const xpath_query& query) const;
+
+		// Select node set by evaluating XPath query
+		xpath_node_set select_nodes(const char_t* query, xpath_variable_set* variables = 0) const;
+		xpath_node_set select_nodes(const xpath_query& query) const;
+
+		// (deprecated: use select_node instead) Select single node by evaluating XPath query.
+		xpath_node select_single_node(const char_t* query, xpath_variable_set* variables = 0) const;
+		xpath_node select_single_node(const xpath_query& query) const;
+
+	#endif
+		
+		// Print subtree using a writer object
+		void print(xml_writer& writer, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, xml_encoding encoding = encoding_auto, unsigned int depth = 0) const;
+
+	#ifndef PUGIXML_NO_STL
+		// Print subtree to stream
+		void print(std::basic_ostream<char, std::char_traits<char> >& os, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, xml_encoding encoding = encoding_auto, unsigned int depth = 0) const;
+		void print(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >& os, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, unsigned int depth = 0) const;
+	#endif
+
+		// Child nodes iterators
+		typedef xml_node_iterator iterator;
+
+		iterator begin() const;
+		iterator end() const;
+
+		// Attribute iterators
+		typedef xml_attribute_iterator attribute_iterator;
+
+		attribute_iterator attributes_begin() const;
+		attribute_iterator attributes_end() const;
+
+		// Range-based for support
+		xml_object_range<xml_node_iterator> children() const;
+		xml_object_range<xml_named_node_iterator> children(const char_t* name) const;
+		xml_object_range<xml_attribute_iterator> attributes() const;
+
+		// Get node offset in parsed file/string (in char_t units) for debugging purposes
+		ptrdiff_t offset_debug() const;
+
+		// Get hash value (unique for handles to the same object)
+		size_t hash_value() const;
+
+		// Get internal pointer
+		xml_node_struct* internal_object() const;
+	};
+
+#ifdef __BORLANDC__
+	// Borland C++ workaround
+	bool PUGIXML_FUNCTION operator&&(const xml_node& lhs, bool rhs);
+	bool PUGIXML_FUNCTION operator||(const xml_node& lhs, bool rhs);
+#endif
+
+	// A helper for working with text inside PCDATA nodes
+	class PUGIXML_CLASS xml_text
+	{
+		friend class xml_node;
+
+		xml_node_struct* _root;
+
+		typedef void (*unspecified_bool_type)(xml_text***);
+
+		explicit xml_text(xml_node_struct* root);
+
+		xml_node_struct* _data_new();
+		xml_node_struct* _data() const;
+
+	public:
+		// Default constructor. Constructs an empty object.
+		xml_text();
+
+		// Safe bool conversion operator
+		operator unspecified_bool_type() const;
+
+		// Borland C++ workaround
+		bool operator!() const;
+
+		// Check if text object is empty
+		bool empty() const;
+
+		// Get text, or "" if object is empty
+		const char_t* get() const;
+
+		// Get text, or the default value if object is empty
+		const char_t* as_string(const char_t* def = PUGIXML_TEXT("")) const;
+
+		// Get text as a number, or the default value if conversion did not succeed or object is empty
+		int as_int(int def = 0) const;
+		unsigned int as_uint(unsigned int def = 0) const;
+		double as_double(double def = 0) const;
+		float as_float(float def = 0) const;
+
+	#ifdef PUGIXML_HAS_LONG_LONG
+		long long as_llong(long long def = 0) const;
+		unsigned long long as_ullong(unsigned long long def = 0) const;
+	#endif
+
+		// Get text as bool (returns true if first character is in '1tTyY' set), or the default value if object is empty
+		bool as_bool(bool def = false) const;
+
+		// Set text (returns false if object is empty or there is not enough memory)
+		bool set(const char_t* rhs);
+
+		// Set text with type conversion (numbers are converted to strings, boolean is converted to "true"/"false")
+		bool set(int rhs);
+		bool set(unsigned int rhs);
+		bool set(double rhs);
+		bool set(float rhs);
+		bool set(bool rhs);
+
+	#ifdef PUGIXML_HAS_LONG_LONG
+		bool set(long long rhs);
+		bool set(unsigned long long rhs);
+	#endif
+
+		// Set text (equivalent to set without error checking)
+		xml_text& operator=(const char_t* rhs);
+		xml_text& operator=(int rhs);
+		xml_text& operator=(unsigned int rhs);
+		xml_text& operator=(double rhs);
+		xml_text& operator=(float rhs);
+		xml_text& operator=(bool rhs);
+
+	#ifdef PUGIXML_HAS_LONG_LONG
+		xml_text& operator=(long long rhs);
+		xml_text& operator=(unsigned long long rhs);
+	#endif
+
+		// Get the data node (node_pcdata or node_cdata) for this object
+		xml_node data() const;
+	};
+
+#ifdef __BORLANDC__
+	// Borland C++ workaround
+	bool PUGIXML_FUNCTION operator&&(const xml_text& lhs, bool rhs);
+	bool PUGIXML_FUNCTION operator||(const xml_text& lhs, bool rhs);
+#endif
+
+	// Child node iterator (a bidirectional iterator over a collection of xml_node)
+	class PUGIXML_CLASS xml_node_iterator
+	{
+		friend class xml_node;
+
+	private:
+		mutable xml_node _wrap;
+		xml_node _parent;
+
+		xml_node_iterator(xml_node_struct* ref, xml_node_struct* parent);
+
+	public:
+		// Iterator traits
+		typedef ptrdiff_t difference_type;
+		typedef xml_node value_type;
+		typedef xml_node* pointer;
+		typedef xml_node& reference;
+
+	#ifndef PUGIXML_NO_STL
+		typedef std::bidirectional_iterator_tag iterator_category;
+	#endif
+
+		// Default constructor
+		xml_node_iterator();
+
+		// Construct an iterator which points to the specified node
+		xml_node_iterator(const xml_node& node);
+
+		// Iterator operators
+		bool operator==(const xml_node_iterator& rhs) const;
+		bool operator!=(const xml_node_iterator& rhs) const;
+
+		xml_node& operator*() const;
+		xml_node* operator->() const;
+
+		const xml_node_iterator& operator++();
+		xml_node_iterator operator++(int);
+
+		const xml_node_iterator& operator--();
+		xml_node_iterator operator--(int);
+	};
+
+	// Attribute iterator (a bidirectional iterator over a collection of xml_attribute)
+	class PUGIXML_CLASS xml_attribute_iterator
+	{
+		friend class xml_node;
+
+	private:
+		mutable xml_attribute _wrap;
+		xml_node _parent;
+
+		xml_attribute_iterator(xml_attribute_struct* ref, xml_node_struct* parent);
+
+	public:
+		// Iterator traits
+		typedef ptrdiff_t difference_type;
+		typedef xml_attribute value_type;
+		typedef xml_attribute* pointer;
+		typedef xml_attribute& reference;
+
+	#ifndef PUGIXML_NO_STL
+		typedef std::bidirectional_iterator_tag iterator_category;
+	#endif
+
+		// Default constructor
+		xml_attribute_iterator();
+
+		// Construct an iterator which points to the specified attribute
+		xml_attribute_iterator(const xml_attribute& attr, const xml_node& parent);
+
+		// Iterator operators
+		bool operator==(const xml_attribute_iterator& rhs) const;
+		bool operator!=(const xml_attribute_iterator& rhs) const;
+
+		xml_attribute& operator*() const;
+		xml_attribute* operator->() const;
+
+		const xml_attribute_iterator& operator++();
+		xml_attribute_iterator operator++(int);
+
+		const xml_attribute_iterator& operator--();
+		xml_attribute_iterator operator--(int);
+	};
+
+	// Named node range helper
+	class PUGIXML_CLASS xml_named_node_iterator
+	{
+		friend class xml_node;
+
+	public:
+		// Iterator traits
+		typedef ptrdiff_t difference_type;
+		typedef xml_node value_type;
+		typedef xml_node* pointer;
+		typedef xml_node& reference;
+
+	#ifndef PUGIXML_NO_STL
+		typedef std::bidirectional_iterator_tag iterator_category;
+	#endif
+
+		// Default constructor
+		xml_named_node_iterator();
+
+		// Construct an iterator which points to the specified node
+		xml_named_node_iterator(const xml_node& node, const char_t* name);
+
+		// Iterator operators
+		bool operator==(const xml_named_node_iterator& rhs) const;
+		bool operator!=(const xml_named_node_iterator& rhs) const;
+
+		xml_node& operator*() const;
+		xml_node* operator->() const;
+
+		const xml_named_node_iterator& operator++();
+		xml_named_node_iterator operator++(int);
+
+		const xml_named_node_iterator& operator--();
+		xml_named_node_iterator operator--(int);
+
+	private:
+		mutable xml_node _wrap;
+		xml_node _parent;
+		const char_t* _name;
+
+		xml_named_node_iterator(xml_node_struct* ref, xml_node_struct* parent, const char_t* name);
+	};
+
+	// Abstract tree walker class (see xml_node::traverse)
+	class PUGIXML_CLASS xml_tree_walker
+	{
+		friend class xml_node;
+
+	private:
+		int _depth;
+	
+	protected:
+		// Get current traversal depth
+		int depth() const;
+	
+	public:
+		xml_tree_walker();
+		virtual ~xml_tree_walker();
+
+		// Callback that is called when traversal begins
+		virtual bool begin(xml_node& node);
+
+		// Callback that is called for each node traversed
+		virtual bool for_each(xml_node& node) = 0;
+
+		// Callback that is called when traversal ends
+		virtual bool end(xml_node& node);
+	};
+
+	// Parsing status, returned as part of xml_parse_result object
+	enum xml_parse_status
+	{
+		status_ok = 0,				// No error
+
+		status_file_not_found,		// File was not found during load_file()
+		status_io_error,			// Error reading from file/stream
+		status_out_of_memory,		// Could not allocate memory
+		status_internal_error,		// Internal error occurred
+
+		status_unrecognized_tag,	// Parser could not determine tag type
+
+		status_bad_pi,				// Parsing error occurred while parsing document declaration/processing instruction
+		status_bad_comment,			// Parsing error occurred while parsing comment
+		status_bad_cdata,			// Parsing error occurred while parsing CDATA section
+		status_bad_doctype,			// Parsing error occurred while parsing document type declaration
+		status_bad_pcdata,			// Parsing error occurred while parsing PCDATA section
+		status_bad_start_element,	// Parsing error occurred while parsing start element tag
+		status_bad_attribute,		// Parsing error occurred while parsing element attribute
+		status_bad_end_element,		// Parsing error occurred while parsing end element tag
+		status_end_element_mismatch,// There was a mismatch of start-end tags (closing tag had incorrect name, some tag was not closed or there was an excessive closing tag)
+
+		status_append_invalid_root,	// Unable to append nodes since root type is not node_element or node_document (exclusive to xml_node::append_buffer)
+
+		status_no_document_element	// Parsing resulted in a document without element nodes
+	};
+
+	// Parsing result
+	struct PUGIXML_CLASS xml_parse_result
+	{
+		// Parsing status (see xml_parse_status)
+		xml_parse_status status;
+
+		// Last parsed offset (in char_t units from start of input data)
+		ptrdiff_t offset;
+
+		// Source document encoding
+		xml_encoding encoding;
+
+		// Default constructor, initializes object to failed state
+		xml_parse_result();
+
+		// Cast to bool operator
+		operator bool() const;
+
+		// Get error description
+		const char* description() const;
+	};
+
+	// Document class (DOM tree root)
+	class PUGIXML_CLASS xml_document: public xml_node
+	{
+	private:
+		char_t* _buffer;
+
+		char _memory[192];
+		
+		// Non-copyable semantics
+		xml_document(const xml_document&);
+		const xml_document& operator=(const xml_document&);
+
+		void create();
+		void destroy();
+
+	public:
+		// Default constructor, makes empty document
+		xml_document();
+
+		// Destructor, invalidates all node/attribute handles to this document
+		~xml_document();
+
+		// Removes all nodes, leaving the empty document
+		void reset();
+
+		// Removes all nodes, then copies the entire contents of the specified document
+		void reset(const xml_document& proto);
+
+	#ifndef PUGIXML_NO_STL
+		// Load document from stream.
+		xml_parse_result load(std::basic_istream<char, std::char_traits<char> >& stream, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+		xml_parse_result load(std::basic_istream<wchar_t, std::char_traits<wchar_t> >& stream, unsigned int options = parse_default);
+	#endif
+
+		// (deprecated: use load_string instead) Load document from zero-terminated string. No encoding conversions are applied.
+		xml_parse_result load(const char_t* contents, unsigned int options = parse_default);
+
+		// Load document from zero-terminated string. No encoding conversions are applied.
+		xml_parse_result load_string(const char_t* contents, unsigned int options = parse_default);
+
+		// Load document from file
+		xml_parse_result load_file(const char* path, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+		xml_parse_result load_file(const wchar_t* path, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+		// Load document from buffer. Copies/converts the buffer, so it may be deleted or changed after the function returns.
+		xml_parse_result load_buffer(const void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+		// Load document from buffer, using the buffer for in-place parsing (the buffer is modified and used for storage of document data).
+		// You should ensure that buffer data will persist throughout the document's lifetime, and free the buffer memory manually once document is destroyed.
+		xml_parse_result load_buffer_inplace(void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+		// Load document from buffer, using the buffer for in-place parsing (the buffer is modified and used for storage of document data).
+		// You should allocate the buffer with pugixml allocation function; document will free the buffer when it is no longer needed (you can't use it anymore).
+		xml_parse_result load_buffer_inplace_own(void* contents, size_t size, unsigned int options = parse_default, xml_encoding encoding = encoding_auto);
+
+		// Save XML document to writer (semantics is slightly different from xml_node::print, see documentation for details).
+		void save(xml_writer& writer, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+
+	#ifndef PUGIXML_NO_STL
+		// Save XML document to stream (semantics is slightly different from xml_node::print, see documentation for details).
+		void save(std::basic_ostream<char, std::char_traits<char> >& stream, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+		void save(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >& stream, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default) const;
+	#endif
+
+		// Save XML to file
+		bool save_file(const char* path, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+		bool save_file(const wchar_t* path, const char_t* indent = PUGIXML_TEXT("\t"), unsigned int flags = format_default, xml_encoding encoding = encoding_auto) const;
+
+		// Get document element
+		xml_node document_element() const;
+	};
+
+#ifndef PUGIXML_NO_XPATH
+	// XPath query return type
+	enum xpath_value_type
+	{
+		xpath_type_none,	 // Unknown type (query failed to compile)
+		xpath_type_node_set, // Node set (xpath_node_set)
+		xpath_type_number,	 // Number
+		xpath_type_string,	 // String
+		xpath_type_boolean	 // Boolean
+	};
+
+	// XPath parsing result
+	struct PUGIXML_CLASS xpath_parse_result
+	{
+		// Error message (0 if no error)
+		const char* error;
+
+		// Last parsed offset (in char_t units from string start)
+		ptrdiff_t offset;
+
+		// Default constructor, initializes object to failed state
+		xpath_parse_result();
+
+		// Cast to bool operator
+		operator bool() const;
+
+		// Get error description
+		const char* description() const;
+	};
+
+	// A single XPath variable
+	class PUGIXML_CLASS xpath_variable
+	{
+		friend class xpath_variable_set;
+
+	protected:
+		xpath_value_type _type;
+		xpath_variable* _next;
+
+		xpath_variable(xpath_value_type type);
+
+		// Non-copyable semantics
+		xpath_variable(const xpath_variable&);
+		xpath_variable& operator=(const xpath_variable&);
+		
+	public:
+		// Get variable name
+		const char_t* name() const;
+
+		// Get variable type
+		xpath_value_type type() const;
+
+		// Get variable value; no type conversion is performed, default value (false, NaN, empty string, empty node set) is returned on type mismatch error
+		bool get_boolean() const;
+		double get_number() const;
+		const char_t* get_string() const;
+		const xpath_node_set& get_node_set() const;
+
+		// Set variable value; no type conversion is performed, false is returned on type mismatch error
+		bool set(bool value);
+		bool set(double value);
+		bool set(const char_t* value);
+		bool set(const xpath_node_set& value);
+	};
+
+	// A set of XPath variables
+	class PUGIXML_CLASS xpath_variable_set
+	{
+	private:
+		xpath_variable* _data[64];
+
+		void _assign(const xpath_variable_set& rhs);
+		void _swap(xpath_variable_set& rhs);
+
+		xpath_variable* _find(const char_t* name) const;
+
+		static bool _clone(xpath_variable* var, xpath_variable** out_result);
+		static void _destroy(xpath_variable* var);
+
+	public:
+		// Default constructor/destructor
+		xpath_variable_set();
+		~xpath_variable_set();
+
+		// Copy constructor/assignment operator
+		xpath_variable_set(const xpath_variable_set& rhs);
+		xpath_variable_set& operator=(const xpath_variable_set& rhs);
+
+	#if __cplusplus >= 201103
+		// Move semantics support
+		xpath_variable_set(xpath_variable_set&& rhs);
+		xpath_variable_set& operator=(xpath_variable_set&& rhs);
+	#endif
+
+		// Add a new variable or get the existing one, if the types match
+		xpath_variable* add(const char_t* name, xpath_value_type type);
+
+		// Set value of an existing variable; no type conversion is performed, false is returned if there is no such variable or if types mismatch
+		bool set(const char_t* name, bool value);
+		bool set(const char_t* name, double value);
+		bool set(const char_t* name, const char_t* value);
+		bool set(const char_t* name, const xpath_node_set& value);
+
+		// Get existing variable by name
+		xpath_variable* get(const char_t* name);
+		const xpath_variable* get(const char_t* name) const;
+	};
+
+	// A compiled XPath query object
+	class PUGIXML_CLASS xpath_query
+	{
+	private:
+		void* _impl;
+		xpath_parse_result _result;
+
+		typedef void (*unspecified_bool_type)(xpath_query***);
+
+		// Non-copyable semantics
+		xpath_query(const xpath_query&);
+		xpath_query& operator=(const xpath_query&);
+
+	public:
+		// Construct a compiled object from XPath expression.
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws xpath_exception on compilation errors.
+		explicit xpath_query(const char_t* query, xpath_variable_set* variables = 0);
+
+		// Constructor
+		xpath_query();
+
+		// Destructor
+		~xpath_query();
+
+	#if __cplusplus >= 201103
+		// Move semantics support
+		xpath_query(xpath_query&& rhs);
+		xpath_query& operator=(xpath_query&& rhs);
+	#endif
+
+		// Get query expression return type
+		xpath_value_type return_type() const;
+		
+		// Evaluate expression as boolean value in the specified context; performs type conversion if necessary.
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws std::bad_alloc on out of memory errors.
+		bool evaluate_boolean(const xpath_node& n) const;
+		
+		// Evaluate expression as double value in the specified context; performs type conversion if necessary.
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws std::bad_alloc on out of memory errors.
+		double evaluate_number(const xpath_node& n) const;
+		
+	#ifndef PUGIXML_NO_STL
+		// Evaluate expression as string value in the specified context; performs type conversion if necessary.
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws std::bad_alloc on out of memory errors.
+		string_t evaluate_string(const xpath_node& n) const;
+	#endif
+		
+		// Evaluate expression as string value in the specified context; performs type conversion if necessary.
+		// At most capacity characters are written to the destination buffer, full result size is returned (includes terminating zero).
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws std::bad_alloc on out of memory errors.
+		// If PUGIXML_NO_EXCEPTIONS is defined, returns empty set instead.
+		size_t evaluate_string(char_t* buffer, size_t capacity, const xpath_node& n) const;
+
+		// Evaluate expression as node set in the specified context.
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws xpath_exception on type mismatch and std::bad_alloc on out of memory errors.
+		// If PUGIXML_NO_EXCEPTIONS is defined, returns empty node set instead.
+		xpath_node_set evaluate_node_set(const xpath_node& n) const;
+
+		// Evaluate expression as node set in the specified context.
+		// Return first node in document order, or empty node if node set is empty.
+		// If PUGIXML_NO_EXCEPTIONS is not defined, throws xpath_exception on type mismatch and std::bad_alloc on out of memory errors.
+		// If PUGIXML_NO_EXCEPTIONS is defined, returns empty node instead.
+		xpath_node evaluate_node(const xpath_node& n) const;
+
+		// Get parsing result (used to get compilation errors in PUGIXML_NO_EXCEPTIONS mode)
+		const xpath_parse_result& result() const;
+
+		// Safe bool conversion operator
+		operator unspecified_bool_type() const;
+
+		// Borland C++ workaround
+		bool operator!() const;
+	};
+	
+	#ifndef PUGIXML_NO_EXCEPTIONS
+	// XPath exception class
+	class PUGIXML_CLASS xpath_exception: public std::exception
+	{
+	private:
+		xpath_parse_result _result;
+
+	public:
+		// Construct exception from parse result
+		explicit xpath_exception(const xpath_parse_result& result);
+
+		// Get error message
+		virtual const char* what() const throw();
+
+		// Get parse result
+		const xpath_parse_result& result() const;
+	};
+	#endif
+	
+	// XPath node class (either xml_node or xml_attribute)
+	class PUGIXML_CLASS xpath_node
+	{
+	private:
+		xml_node _node;
+		xml_attribute _attribute;
+	
+		typedef void (*unspecified_bool_type)(xpath_node***);
+
+	public:
+		// Default constructor; constructs empty XPath node
+		xpath_node();
+		
+		// Construct XPath node from XML node/attribute
+		xpath_node(const xml_node& node);
+		xpath_node(const xml_attribute& attribute, const xml_node& parent);
+
+		// Get node/attribute, if any
+		xml_node node() const;
+		xml_attribute attribute() const;
+		
+		// Get parent of contained node/attribute
+		xml_node parent() const;
+
+		// Safe bool conversion operator
+		operator unspecified_bool_type() const;
+		
+		// Borland C++ workaround
+		bool operator!() const;
+
+		// Comparison operators
+		bool operator==(const xpath_node& n) const;
+		bool operator!=(const xpath_node& n) const;
+	};
+
+#ifdef __BORLANDC__
+	// Borland C++ workaround
+	bool PUGIXML_FUNCTION operator&&(const xpath_node& lhs, bool rhs);
+	bool PUGIXML_FUNCTION operator||(const xpath_node& lhs, bool rhs);
+#endif
+
+	// A fixed-size collection of XPath nodes
+	class PUGIXML_CLASS xpath_node_set
+	{
+	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;
+
+		// We define non-constant iterator to be the same as constant iterator so that various generic algorithms (i.e. boost foreach) work
+		typedef const xpath_node* iterator;
+	
+		// Default constructor. Constructs empty set.
+		xpath_node_set();
+
+		// Constructs a set from iterator range; data is not checked for duplicates and is not sorted according to provided type, so be careful
+		xpath_node_set(const_iterator begin, const_iterator end, type_t type = type_unsorted);
+
+		// Destructor
+		~xpath_node_set();
+		
+		// Copy constructor/assignment operator
+		xpath_node_set(const xpath_node_set& ns);
+		xpath_node_set& operator=(const xpath_node_set& ns);
+
+	#if __cplusplus >= 201103
+		// Move semantics support
+		xpath_node_set(xpath_node_set&& rhs);
+		xpath_node_set& operator=(xpath_node_set&& rhs);
+	#endif
+
+		// Get collection type
+		type_t type() const;
+		
+		// Get collection size
+		size_t size() const;
+
+		// Indexing operator
+		const xpath_node& operator[](size_t index) const;
+		
+		// Collection iterators
+		const_iterator begin() const;
+		const_iterator end() const;
+
+		// Sort the collection in ascending/descending order by document order
+		void sort(bool reverse = false);
+		
+		// Get first node in the collection by document order
+		xpath_node first() const;
+		
+		// Check if collection is empty
+		bool empty() const;
+	
+	private:
+		type_t _type;
+		
+		xpath_node _storage;
+		
+		xpath_node* _begin;
+		xpath_node* _end;
+
+		void _assign(const_iterator begin, const_iterator end, type_t type);
+		void _move(xpath_node_set& rhs);
+	};
+#endif
+
+#ifndef PUGIXML_NO_STL
+	// Convert wide string to UTF8
+	std::basic_string<char, std::char_traits<char>, std::allocator<char> > PUGIXML_FUNCTION as_utf8(const wchar_t* str);
+	std::basic_string<char, std::char_traits<char>, std::allocator<char> > PUGIXML_FUNCTION as_utf8(const std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >& str);
+	
+	// Convert UTF8 to wide string
+	std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > PUGIXML_FUNCTION as_wide(const char* str);
+	std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > PUGIXML_FUNCTION as_wide(const std::basic_string<char, std::char_traits<char>, std::allocator<char> >& str);
+#endif
+
+	// Memory allocation function interface; returns pointer to allocated memory or NULL on failure
+	typedef void* (*allocation_function)(size_t size);
+	
+	// Memory deallocation function interface
+	typedef void (*deallocation_function)(void* ptr);
+
+	// Override default memory management functions. All subsequent allocations/deallocations will be performed via supplied functions.
+	void PUGIXML_FUNCTION set_memory_management_functions(allocation_function allocate, deallocation_function deallocate);
+	
+	// Get current memory management functions
+	allocation_function PUGIXML_FUNCTION get_memory_allocation_function();
+	deallocation_function PUGIXML_FUNCTION get_memory_deallocation_function();
+}
+
+#if !defined(PUGIXML_NO_STL) && (defined(_MSC_VER) || defined(__ICC))
+namespace std
+{
+	// Workarounds for (non-standard) iterator category detection for older versions (MSVC7/IC8 and earlier)
+	std::bidirectional_iterator_tag PUGIXML_FUNCTION _Iter_cat(const pugi::xml_node_iterator&);
+	std::bidirectional_iterator_tag PUGIXML_FUNCTION _Iter_cat(const pugi::xml_attribute_iterator&);
+	std::bidirectional_iterator_tag PUGIXML_FUNCTION _Iter_cat(const pugi::xml_named_node_iterator&);
+}
+#endif
+
+#if !defined(PUGIXML_NO_STL) && defined(__SUNPRO_CC)
+namespace std
+{
+	// Workarounds for (non-standard) iterator category detection
+	std::bidirectional_iterator_tag PUGIXML_FUNCTION __iterator_category(const pugi::xml_node_iterator&);
+	std::bidirectional_iterator_tag PUGIXML_FUNCTION __iterator_category(const pugi::xml_attribute_iterator&);
+	std::bidirectional_iterator_tag PUGIXML_FUNCTION __iterator_category(const pugi::xml_named_node_iterator&);
+}
+#endif
+
+#endif
+
+// Make sure implementation is included in header-only mode
+// Use macro expansion in #include to work around QMake (QTBUG-11923)
+#if defined(PUGIXML_HEADER_ONLY) && !defined(PUGIXML_SOURCE)
+#	define PUGIXML_SOURCE "pugixml.cpp"
+#	include PUGIXML_SOURCE
+#endif
+
+/**
+ * Copyright (c) 2006-2015 Arseny Kapoulkine
+ *
+ * Permission is hereby granted, free of charge, to any person
+ * obtaining a copy of this software and associated documentation
+ * files (the "Software"), to deal in the Software without
+ * restriction, including without limitation the rights to use,
+ * copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following
+ * conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ * 
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+ * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+ * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+ * OTHER DEALINGS IN THE SOFTWARE.
+ */

lightspark.tar.xz/src/3rdparty/pugixml/tests Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/allocator.cpp Added

@@ -0,0 +1,171 @@
+#include "allocator.hpp"
+
+#include <string.h>
+#include <assert.h>
+#include <stdlib.h>
+
+// Address sanitizer
+#if defined(__has_feature)
+#	define ADDRESS_SANITIZER __has_feature(address_sanitizer)
+#else
+#	define ADDRESS_SANITIZER defined(__SANITIZE_ADDRESS__)
+#endif
+
+// Low-level allocation functions
+#if defined(_WIN32) || defined(_WIN64)
+#	ifdef __MWERKS__
+#		pragma ANSI_strict off // disable ANSI strictness to include windows.h
+#		pragma cpp_extensions on // enable some extensions to include windows.h
+#	endif
+
+# if defined(_MSC_VER)
+# pragma warning(disable: 4201) // nonstandard extension used: nameless struct/union
+# endif
+
+#	ifdef _XBOX_VER
+#		define NOD3D
+#		include <xtl.h>
+#	else
+#		include <windows.h>
+#	endif
+
+namespace
+{
+	const size_t page_size = 4096;
+
+	size_t align_to_page(size_t value)
+	{
+		return (value + page_size - 1) & ~(page_size - 1);
+	}
+
+	void* allocate_page_aligned(size_t size)
+	{
+		// We can't use VirtualAlloc because it has 64Kb granularity so we run out of address space quickly
+		// We can't use malloc because of occasional problems with CW on CRT termination
+		static HANDLE heap = HeapCreate(0, 0, 0);
+
+		void* result = HeapAlloc(heap, 0, size + page_size);
+
+		return reinterpret_cast<void*>(align_to_page(reinterpret_cast<size_t>(result)));
+	}
+
+	void* allocate(size_t size)
+	{
+		size_t aligned_size = align_to_page(size);
+
+		void* ptr = allocate_page_aligned(aligned_size + page_size);
+		if (!ptr) return 0;
+
+		char* end = static_cast<char*>(ptr) + aligned_size;
+
+		DWORD old_flags;
+		VirtualProtect(end, page_size, PAGE_NOACCESS, &old_flags);
+
+		return end - size;
+	}
+
+	void deallocate(void* ptr, size_t size)
+	{
+		size_t aligned_size = align_to_page(size);
+
+		void* rptr = static_cast<char*>(ptr) + size - aligned_size;
+
+		DWORD old_flags;
+		VirtualProtect(rptr, aligned_size + page_size, PAGE_NOACCESS, &old_flags);
+	}
+}
+#elif (defined(__APPLE__) || defined(__linux__)) && (defined(__i386) || defined(__x86_64)) && !ADDRESS_SANITIZER
+#	include <sys/mman.h>
+
+namespace
+{
+	const size_t page_size = 4096;
+
+	size_t align_to_page(size_t value)
+	{
+		return (value + page_size - 1) & ~(page_size - 1);
+	}
+
+	void* allocate_page_aligned(size_t size)
+	{
+		void* result = malloc(size + page_size);
+
+		return reinterpret_cast<void*>(align_to_page(reinterpret_cast<size_t>(result)));
+	}
+
+	void* allocate(size_t size)
+	{
+		size_t aligned_size = align_to_page(size);
+
+		void* ptr = allocate_page_aligned(aligned_size + page_size);
+		if (!ptr) return 0;
+
+		char* end = static_cast<char*>(ptr) + aligned_size;
+
+		int res = mprotect(end, page_size, PROT_NONE);
+		assert(res == 0);
+		(void)!res;
+
+		return end - size;
+	}
+
+	void deallocate(void* ptr, size_t size)
+	{
+		size_t aligned_size = align_to_page(size);
+
+		void* rptr = static_cast<char*>(ptr) + size - aligned_size;
+
+		int res = mprotect(rptr, aligned_size + page_size, PROT_NONE);
+		assert(res == 0);
+		(void)!res;
+	}
+}
+#else
+namespace
+{
+	void* allocate(size_t size)
+	{
+		return malloc(size);
+	}
+
+	void deallocate(void* ptr, size_t size)
+	{
+		(void)size;
+
+		free(ptr);
+	}
+}
+#endif
+
+// High-level allocation functions
+const size_t memory_alignment = sizeof(double) > sizeof(void*) ? sizeof(double) : sizeof(void*);
+
+void* memory_allocate(size_t size)
+{
+	void* result = allocate(size + memory_alignment);
+	if (!result) return 0;
+
+	memcpy(result, &size, sizeof(size_t));
+
+	return static_cast<char*>(result) + memory_alignment;
+}
+
+size_t memory_size(void* ptr)
+{
+	assert(ptr);
+
+	size_t result;
+	memcpy(&result, static_cast<char*>(ptr) - memory_alignment, sizeof(size_t));
+
+	return result;
+}
+
+void memory_deallocate(void* ptr)
+{
+	if (!ptr) return;
+
+	size_t size = memory_size(ptr);
+
+	deallocate(static_cast<char*>(ptr) - memory_alignment, size + memory_alignment);
+}
+

lightspark.tar.xz/src/3rdparty/pugixml/tests/allocator.hpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/archive.pl Added

@@ -0,0 +1,72 @@
+#!/usr/bin/perl
+
+use Archive::Tar;
+use Archive::Zip;
+use File::Basename;
+
+my $target = shift @ARGV;
+my @sources = @ARGV;
+
+my $basedir = basename($target, ('.zip', '.tar.gz', '.tgz')) . '/';
+
+my $zip = $target =~ /\.zip$/;
+my $arch = $zip ? Archive::Zip->new : Archive::Tar->new;
+
+for $source (sort {$a cmp $b} @sources)
+{
+	my $contents = &readfile_contents($source);
+	my $meta = &readfile_meta($source);
+	my $file = $basedir . $source;
+
+ if (-T $source)
+ {
+ # convert all newlines to Unix format
+ $contents =~ s/\r//g;
+
+ if ($zip)
+ {
+ # convert all newlines to Windows format for .zip distribution
+ $contents =~ s/\n/\r\n/g;
+ }
+ }
+
+	if ($zip)
+	{
+		my $path = $file;
+		$arch->addDirectory($path) if $path =~ s/\/[^\/]+$/\// && !defined($arch->memberNamed($path));
+
+		my $member = $arch->addString($contents, $file);
+
+		$member->desiredCompressionMethod(COMPRESSION_DEFLATED);
+		$member->desiredCompressionLevel(9);
+
+		$member->setLastModFileDateTimeFromUnix($$meta{mtime});
+	}
+	else
+	{
+		$arch->add_data($file, $contents, $meta);
+	}
+}
+
+$zip ? $arch->overwriteAs($target) : $arch->write($target, 9);
+
+sub readfile_contents
+{
+	my $file = shift;
+
+	open FILE, $file or die "Can't open $file: $!";
+	binmode FILE;
+	my @contents = <FILE>;
+	close FILE;
+
+	return join('', @contents);
+}
+
+sub readfile_meta
+{
+	my $file = shift;
+
+ my ($dev, $ino, $mode, $nlink, $uid, $gid, $rdev, $size, $atime, $mtime, $ctime, $blksize, $blocks) = stat($file);
+
+	return {mtime => $mtime};
+}

lightspark.tar.xz/src/3rdparty/pugixml/tests/autotest-appveyor.ps1 Added

@@ -0,0 +1,71 @@
+function Invoke-CmdScript($scriptName)
+{
+	$cmdLine = """$scriptName"" $args & set"
+	& $Env:SystemRoot\system32\cmd.exe /c $cmdLine |
+	select-string '^([^=]*)=(.*)$' | foreach-object {
+		$varName = $_.Matches[0].Groups[1].Value
+		$varValue = $_.Matches[0].Groups[2].Value
+		set-item Env:$varName $varValue
+	}
+}
+
+$sources = @("src/pugixml.cpp") + (Get-ChildItem -Path "tests/*.cpp" -Exclude "fuzz_*.cpp")
+$failed = $FALSE
+
+foreach ($vs in 9,10,11,12,14)
+{
+	foreach ($arch in "x86","x64")
+	{
+		Write-Output "# Setting up VS$vs $arch"
+
+		Invoke-CmdScript "C:\Program Files (x86)\Microsoft Visual Studio $vs.0\VC\vcvarsall.bat" $arch
+		if (! $?) { throw "Error setting up VS$vs $arch" }
+
+		foreach ($defines in "standard", "PUGIXML_WCHAR_MODE", "PUGIXML_COMPACT")
+		{
+			$target = "tests_vs${vs}_${arch}_${defines}"
+			$deflist = if ($defines -eq "standard") { "" } else { "/D$defines" }
+
+			Add-AppveyorTest $target -Outcome Running
+
+			Write-Output "# Building $target.exe"
+			& cmd /c "cl.exe /Fe$target.exe /EHsc /W4 /WX $deflist $sources 2>&1" | Tee-Object -Variable buildOutput
+
+			if ($?)
+			{
+				Write-Output "# Running $target.exe"
+
+				$sw = [Diagnostics.Stopwatch]::StartNew()
+
+				& .\$target | Tee-Object -Variable testOutput
+
+				if ($?)
+				{
+					Write-Output "# Passed"
+
+					Update-AppveyorTest $target -Outcome Passed -StdOut ($testOutput | out-string) -Duration $sw.ElapsedMilliseconds
+				}
+				else
+				{
+					Write-Output "# Failed"
+
+					Update-AppveyorTest $target -Outcome Failed -StdOut ($testOutput | out-string) -ErrorMessage "Running failed"
+
+					$failed = $TRUE
+				}
+			}
+			else
+			{
+				Write-Output "# Failed to build"
+
+				Update-AppveyorTest $target -Outcome Failed -StdOut ($buildOutput | out-string) -ErrorMessage "Compilation failed"
+
+				$failed = $TRUE
+			}
+		}
+	}
+}
+
+if ($failed) { throw "One or more build steps failed" }
+
+Write-Output "# End"

lightspark.tar.xz/src/3rdparty/pugixml/tests/common.hpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/empty.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/large.xml Added

@@ -0,0 +1,1 @@
+<node><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/><node/></node>
\ No newline at end of file

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/latintest_latin1.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/latintest_utf8.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/multiline.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/small.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/truncation.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf16_be.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf16_be_bom.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf16_be_clean.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf16_be_nodecl.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf16_le.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf16_le_bom.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf16_le_clean.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf16_le_nodecl.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf32_be.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf32_be_bom.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf32_be_clean.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf32_be_nodecl.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf32_le.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf32_le_bom.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf32_le_clean.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf32_le_nodecl.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf8.xml Added

@@ -0,0 +1,87 @@
+<?xml version="1.0"?>
+<!DOCTYPE 週報 SYSTEM "weekly-utf-8.dtd">
+
+<週報>
+	<English name="name" value="value">The world has many languages</English>
+ <Russian name="название(имя)" value="ценность">Мир имеет много языков</Russian>
+ <Spanish name="el nombre" value="el valor">el mundo tiene muchos idiomas</Spanish>
+ <SimplifiedChinese name="名字" value="价值">世界有很多语言</SimplifiedChinese>
+ <Русский название="name" ценность="value">&lt;имеет&gt;</Русский>
+ <汉语 名字="name" 价值="value">世界有很多语言𤭢</汉语>
+ <Heavy>&quot;Mëtæl!&quot;</Heavy>
+ <ä>Umlaut Element</ä>
+
+ <年月週>
+ <年度>1997</年度>
+ <月度>1</月度>
+ <週>1</週>
+ </年月週>
+
+ <氏名>
+ <氏>山田</氏>
+ <名>太郎</名>
+ </氏名>
+
+ <業務報告リスト>
+ <業務報告>
+ <業務名>XMLエディターの作成</業務名>
+ <業務コード>X3355-23</業務コード>
+ <工数管理>
+ <見積もり工数>1600</見積もり工数>
+ <実績工数>320</実績工数>
+ <当月見積もり工数>160</当月見積もり工数>
+ <当月実績工数>24</当月実績工数>
+ </工数管理>
+ <予定項目リスト>
+ <予定項目>
+ XMLエディターの基本仕様の作成
+ </予定項目>
+ </予定項目リスト>
+ <実施事項リスト>
+ <実施事項>
+ XMLエディターの基本仕様の作成
+ </実施事項>
+ <実施事項>
+ 競合他社製品の機能調査
+ </実施事項>
+ </実施事項リスト>
+ <上長への要請事項リスト>
+ <上長への要請事項>
+ 特になし
+ </上長への要請事項>
+ </上長への要請事項リスト>
+ <問題点対策>
+ XMLとは何かわからない。
+ </問題点対策>
+ </業務報告>
+
+ <業務報告>
+ <業務名>検索エンジンの開発</業務名>
+ <業務コード>S8821-76</業務コード>
+ <工数管理>
+ <見積もり工数>120</見積もり工数>
+ <実績工数>6</実績工数>
+ <当月見積もり工数>32</当月見積もり工数>
+ <当月実績工数>2</当月実績工数>
+ </工数管理>
+ <予定項目リスト>
+ <予定項目>
+ <A href="http://www.goo.ne.jp">goo</A>の機能を調べてみる
+ </予定項目>
+ </予定項目リスト>
+ <実施事項リスト>
+ <実施事項>
+ 更に、どういう検索エンジンがあるか調査する
+ </実施事項>
+ </実施事項リスト>
+ <上長への要請事項リスト>
+ <上長への要請事項>
+ 開発をするのはめんどうなので、Yahoo!を買収して下さい。
+ </上長への要請事項>
+ </上長への要請事項リスト>
+ <問題点対策>
+ 検索エンジンで車を走らせることができない。（要調査）
+ </問題点対策>
+ </業務報告>
+ </業務報告リスト>
+</週報>

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf8_bom.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf8_clean.xml Added

@@ -0,0 +1,84 @@
+<?xml version="1.0"?><週報>
+	<English name="name" value="value">The world has many languages</English>
+ <Russian name="название(имя)" value="ценность">Мир имеет много языков</Russian>
+ <Spanish name="el nombre" value="el valor">el mundo tiene muchos idiomas</Spanish>
+ <SimplifiedChinese name="名字" value="价值">世界有很多语言</SimplifiedChinese>
+ <Русский название="name" ценность="value">&lt;имеет&gt;</Русский>
+ <汉语 名字="name" 价值="value">世界有很多语言𤭢</汉语>
+ <Heavy>quot;Mëtæl!quot;</Heavy>
+ <ä>Umlaut Element</ä>
+
+ <年月週>
+ <年度>1997</年度>
+ <月度>1</月度>
+ <週>1</週>
+ </年月週>
+
+ <氏名>
+ <氏>山田</氏>
+ <名>太郎</名>
+ </氏名>
+
+ <業務報告リスト>
+ <業務報告>
+ <業務名>XMLエディターの作成</業務名>
+ <業務コード>X3355-23</業務コード>
+ <工数管理>
+ <見積もり工数>1600</見積もり工数>
+ <実績工数>320</実績工数>
+ <当月見積もり工数>160</当月見積もり工数>
+ <当月実績工数>24</当月実績工数>
+ </工数管理>
+ <予定項目リスト>
+ <予定項目>
+ XMLエディターの基本仕様の作成
+ </予定項目>
+ </予定項目リスト>
+ <実施事項リスト>
+ <実施事項>
+ XMLエディターの基本仕様の作成
+ </実施事項>
+ <実施事項>
+ 競合他社製品の機能調査
+ </実施事項>
+ </実施事項リスト>
+ <上長への要請事項リスト>
+ <上長への要請事項>
+ 特になし
+ </上長への要請事項>
+ </上長への要請事項リスト>
+ <問題点対策>
+ XMLとは何かわからない。
+ </問題点対策>
+ </業務報告>
+
+ <業務報告>
+ <業務名>検索エンジンの開発</業務名>
+ <業務コード>S8821-76</業務コード>
+ <工数管理>
+ <見積もり工数>120</見積もり工数>
+ <実績工数>6</実績工数>
+ <当月見積もり工数>32</当月見積もり工数>
+ <当月実績工数>2</当月実績工数>
+ </工数管理>
+ <予定項目リスト>
+ <予定項目>
+ <A href="http://www.goo.ne.jp">goo</A>の機能を調べてみる
+ </予定項目>
+ </予定項目リスト>
+ <実施事項リスト>
+ <実施事項>
+ 更に、どういう検索エンジンがあるか調査する
+ </実施事項>
+ </実施事項リスト>
+ <上長への要請事項リスト>
+ <上長への要請事項>
+ 開発をするのはめんどうなので、Yahoo!を買収して下さい。
+ </上長への要請事項>
+ </上長への要請事項リスト>
+ <問題点対策>
+ 検索エンジンで車を走らせることができない。（要調査）
+ </問題点対策>
+ </業務報告>
+ </業務報告リスト>
+</週報>
\ No newline at end of file

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/utftest_utf8_nodecl.xml Added

@@ -0,0 +1,86 @@
+<!DOCTYPE 週報 SYSTEM "weekly-utf-8.dtd">
+
+<週報>
+	<English name="name" value="value">The world has many languages</English>
+ <Russian name="название(имя)" value="ценность">Мир имеет много языков</Russian>
+ <Spanish name="el nombre" value="el valor">el mundo tiene muchos idiomas</Spanish>
+ <SimplifiedChinese name="名字" value="价值">世界有很多语言</SimplifiedChinese>
+ <Русский название="name" ценность="value">&lt;имеет&gt;</Русский>
+ <汉语 名字="name" 价值="value">世界有很多语言𤭢</汉语>
+ <Heavy>&quot;Mëtæl!&quot;</Heavy>
+ <ä>Umlaut Element</ä>
+
+ <年月週>
+ <年度>1997</年度>
+ <月度>1</月度>
+ <週>1</週>
+ </年月週>
+
+ <氏名>
+ <氏>山田</氏>
+ <名>太郎</名>
+ </氏名>
+
+ <業務報告リスト>
+ <業務報告>
+ <業務名>XMLエディターの作成</業務名>
+ <業務コード>X3355-23</業務コード>
+ <工数管理>
+ <見積もり工数>1600</見積もり工数>
+ <実績工数>320</実績工数>
+ <当月見積もり工数>160</当月見積もり工数>
+ <当月実績工数>24</当月実績工数>
+ </工数管理>
+ <予定項目リスト>
+ <予定項目>
+ XMLエディターの基本仕様の作成
+ </予定項目>
+ </予定項目リスト>
+ <実施事項リスト>
+ <実施事項>
+ XMLエディターの基本仕様の作成
+ </実施事項>
+ <実施事項>
+ 競合他社製品の機能調査
+ </実施事項>
+ </実施事項リスト>
+ <上長への要請事項リスト>
+ <上長への要請事項>
+ 特になし
+ </上長への要請事項>
+ </上長への要請事項リスト>
+ <問題点対策>
+ XMLとは何かわからない。
+ </問題点対策>
+ </業務報告>
+
+ <業務報告>
+ <業務名>検索エンジンの開発</業務名>
+ <業務コード>S8821-76</業務コード>
+ <工数管理>
+ <見積もり工数>120</見積もり工数>
+ <実績工数>6</実績工数>
+ <当月見積もり工数>32</当月見積もり工数>
+ <当月実績工数>2</当月実績工数>
+ </工数管理>
+ <予定項目リスト>
+ <予定項目>
+ <A href="http://www.goo.ne.jp">goo</A>の機能を調べてみる
+ </予定項目>
+ </予定項目リスト>
+ <実施事項リスト>
+ <実施事項>
+ 更に、どういう検索エンジンがあるか調査する
+ </実施事項>
+ </実施事項リスト>
+ <上長への要請事項リスト>
+ <上長への要請事項>
+ 開発をするのはめんどうなので、Yahoo!を買収して下さい。
+ </上長への要請事項>
+ </上長への要請事項リスト>
+ <問題点対策>
+ 検索エンジンで車を走らせることができない。（要調査）
+ </問題点対策>
+ </業務報告>
+ </業務報告リスト>
+</週報>

lightspark.tar.xz/src/3rdparty/pugixml/tests/data/тест.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data_fuzz_parse Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data_fuzz_parse/basic.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data_fuzz_parse/doctype.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data_fuzz_parse/refs.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data_fuzz_parse/types.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data_fuzz_parse/utf16.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/data_fuzz_parse/utf32.xml Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/fuzz_parse.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/helpers.hpp Added

@@ -0,0 +1,114 @@
+#ifndef HEADER_TEST_HELPERS_HPP
+#define HEADER_TEST_HELPERS_HPP
+
+#include "common.hpp"
+
+#include <utility>
+
+template <typename T> static void generic_bool_ops_test(const T& obj)
+{
+	T null;
+
+	CHECK(!null);
+	CHECK(obj);
+	CHECK(!!obj);
+
+#ifdef _MSC_VER
+# pragma warning(push)
+# pragma warning(disable: 4800) // forcing value to bool 'true' or 'false' (performance warning) - we really want to just cast to bool instead of !!
+#endif
+
+	bool b1 = null, b2 = obj;
+
+#ifdef _MSC_VER
+# pragma warning(pop)
+#endif
+
+	CHECK(!b1);
+	CHECK(b2);
+
+	CHECK(obj && b2);
+	CHECK(obj || b2);
+	CHECK(obj && obj);
+	CHECK(obj || obj);
+}
+
+template <typename T> static void generic_eq_ops_test(const T& obj1, const T& obj2)
+{
+	T null = T();
+
+	// operator==
+	CHECK(null == null);
+	CHECK(obj1 == obj1);
+	CHECK(!(null == obj1));
+	CHECK(!(null == obj2));
+	CHECK(T(null) == null);
+	CHECK(T(obj1) == obj1);
+
+	// operator!=
+	CHECK(!(null != null));
+	CHECK(!(obj1 != obj1));
+	CHECK(null != obj1);
+	CHECK(null != obj2);
+	CHECK(!(T(null) != null));
+	CHECK(!(T(obj1) != obj1));
+}
+
+template <typename T> static void generic_rel_ops_test(T obj1, T obj2)
+{
+	T null = T();
+
+	// obj1 < obj2 (we use operator<, but there is no other choice
+	if (obj1 > obj2)
+	{
+		T temp = obj1;
+		obj1 = obj2;
+		obj2 = temp;
+	}
+
+	// operator<
+	CHECK(null < obj1);
+	CHECK(null < obj2);
+	CHECK(obj1 < obj2);
+	CHECK(!(null < null));
+	CHECK(!(obj1 < obj1));
+	CHECK(!(obj1 < null));
+	CHECK(!(obj2 < obj1));
+
+	// operator<=
+	CHECK(null <= obj1);
+	CHECK(null <= obj2);
+	CHECK(obj1 <= obj2);
+	CHECK(null <= null);
+	CHECK(obj1 <= obj1);
+	CHECK(!(obj1 <= null));
+	CHECK(!(obj2 <= obj1));
+
+	// operator>
+	CHECK(obj1 > null);
+	CHECK(obj2 > null);
+	CHECK(obj2 > obj1);
+	CHECK(!(null > null));
+	CHECK(!(obj1 > obj1));
+	CHECK(!(null > obj1));
+	CHECK(!(obj1 > obj2));
+
+	// operator>=
+	CHECK(obj1 >= null);
+	CHECK(obj2 >= null);
+	CHECK(obj2 >= obj1);
+	CHECK(null >= null);
+	CHECK(obj1 >= obj1);
+	CHECK(!(null >= obj1));
+	CHECK(!(obj1 >= obj2));
+}
+
+template <typename T> static void generic_empty_test(const T& obj)
+{
+	T null;
+
+	CHECK(null.empty());
+	CHECK(!obj.empty());
+}
+
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/main.cpp Added

@@ -0,0 +1,217 @@
+#include "test.hpp"
+#include "allocator.hpp"
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <float.h>
+#include <assert.h>
+
+#include <string>
+
+#ifndef PUGIXML_NO_EXCEPTIONS
+# include <exception>
+#endif
+
+#ifdef _WIN32_WCE
+# undef DebugBreak
+# pragma warning(disable: 4201) // nonstandard extension used: nameless struct/union
+# include <windows.h>
+#endif
+
+test_runner* test_runner::_tests = 0;
+size_t test_runner::_memory_fail_threshold = 0;
+bool test_runner::_memory_fail_triggered = false;
+jmp_buf test_runner::_failure_buffer;
+const char* test_runner::_failure_message;
+const char* test_runner::_temp_path;
+
+static size_t g_memory_total_size = 0;
+static size_t g_memory_total_count = 0;
+static size_t g_memory_fail_triggered = false;
+
+static void* custom_allocate(size_t size)
+{
+	if (test_runner::_memory_fail_threshold > 0 && test_runner::_memory_fail_threshold < g_memory_total_size + size)
+	{
+		g_memory_fail_triggered = true;
+		test_runner::_memory_fail_triggered = true;
+
+		return 0;
+	}
+	else
+	{
+		void* ptr = memory_allocate(size);
+		assert(ptr);
+
+		g_memory_total_size += memory_size(ptr);
+		g_memory_total_count++;
+		
+		return ptr;
+	}
+}
+
+#ifndef PUGIXML_NO_EXCEPTIONS
+static void* custom_allocate_throw(size_t size)
+{
+	void* result = custom_allocate(size);
+
+	if (!result)
+		throw std::bad_alloc();
+
+	return result;
+}
+#endif
+
+static void custom_deallocate(void* ptr)
+{
+	assert(ptr);
+
+	g_memory_total_size -= memory_size(ptr);
+	g_memory_total_count--;
+	
+	memory_deallocate(ptr);
+}
+
+static void replace_memory_management()
+{
+	// create some document to touch original functions
+	{
+		pugi::xml_document doc;
+		doc.append_child().set_name(STR("node"));
+	}
+
+	// replace functions
+	pugi::set_memory_management_functions(custom_allocate, custom_deallocate);
+}
+
+#if defined(_MSC_VER) && _MSC_VER > 1200 && _MSC_VER < 1400 && !defined(__INTEL_COMPILER) && !defined(__DMC__)
+#include <exception>
+
+namespace std
+{
+	_CRTIMP2 _Prhand _Raise_handler;
+	_CRTIMP2 void __cdecl _Throw(const exception&) {}
+}
+#endif
+
+static bool run_test(test_runner* test, const char* test_name, pugi::allocation_function allocate)
+{
+#ifndef PUGIXML_NO_EXCEPTIONS
+	try
+	{
+#endif
+		g_memory_total_size = 0;
+		g_memory_total_count = 0;
+		g_memory_fail_triggered = false;
+		test_runner::_memory_fail_threshold = 0;
+		test_runner::_memory_fail_triggered = false;
+	
+		pugi::set_memory_management_functions(allocate, custom_deallocate);
+		
+#ifdef _MSC_VER
+#	pragma warning(push)
+#	pragma warning(disable: 4611) // interaction between _setjmp and C++ object destruction is non-portable
+# pragma warning(disable: 4793) // function compiled as native: presence of '_setjmp' makes a function unmanaged
+#endif
+
+		volatile int result = setjmp(test_runner::_failure_buffer);
+	
+#ifdef _MSC_VER
+#	pragma warning(pop)
+#endif
+
+		if (result)
+		{
+			printf("Test %s failed: %s\n", test_name, test_runner::_failure_message);
+			return false;
+		}
+
+		test->run();
+
+		if (test_runner::_memory_fail_triggered)
+		{
+			printf("Test %s failed: unguarded memory fail triggered\n", test_name);
+			return false;
+		}
+
+		if (g_memory_total_size != 0 || g_memory_total_count != 0)
+		{
+			printf("Test %s failed: memory leaks found (%u bytes in %u allocations)\n", test_name, static_cast<unsigned int>(g_memory_total_size), static_cast<unsigned int>(g_memory_total_count));
+			return false;
+		}
+
+		return true;
+#ifndef PUGIXML_NO_EXCEPTIONS
+	}
+	catch (const std::exception& e)
+	{
+		printf("Test %s failed: exception %s\n", test_name, e.what());
+		return false;
+	}
+	catch (...)
+	{
+		printf("Test %s failed for unknown reason\n", test_name);
+		return false;
+	}
+#endif
+}
+
+#if defined(__CELLOS_LV2__) && defined(PUGIXML_NO_EXCEPTIONS) && !defined(__SNC__)
+#include <exception>
+
+void std::exception::_Raise() const
+{
+	abort();
+}
+#endif
+
+int main(int, char** argv)
+{
+#ifdef __BORLANDC__
+	_control87(MCW_EM | PC_53, MCW_EM | MCW_PC);
+#endif
+
+	// setup temp path as the executable folder
+	std::string temp = argv[0];
+	std::string::size_type slash = temp.find_last_of("\\/");
+	temp.erase((slash != std::string::npos) ? slash + 1 : 0);
+
+	test_runner::_temp_path = temp.c_str();
+	
+	replace_memory_management();
+
+	unsigned int total = 0;
+	unsigned int passed = 0;
+
+	test_runner* test = 0; // gcc3 "variable might be used uninitialized in this function" bug workaround
+
+	for (test = test_runner::_tests; test; test = test->_next)
+	{
+		total++;
+		passed += run_test(test, test->_name, custom_allocate);
+
+	#ifndef PUGIXML_NO_EXCEPTIONS
+		if (g_memory_fail_triggered)
+		{
+			total++;
+			passed += run_test(test, (test->_name + std::string(" (throw)")).c_str(), custom_allocate_throw);
+		}
+	#endif
+	}
+
+	unsigned int failed = total - passed;
+
+	if (failed != 0)
+		printf("FAILURE: %u out of %u tests failed.\n", failed, total);
+	else
+		printf("Success: %u tests passed.\n", total);
+
+	return failed;
+}
+
+#ifdef _WIN32_WCE
+int WINAPI WinMain(HINSTANCE, HINSTANCE, LPSTR, int)
+{
+	return main(0, NULL);
+}
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test.cpp Added

@@ -0,0 +1,220 @@
+#define _SCL_SECURE_NO_WARNINGS
+#define _SCL_SECURE_NO_DEPRECATE
+
+#include "test.hpp"
+
+#include "writer_string.hpp"
+
+#include <math.h>
+#include <float.h>
+#include <string.h>
+#include <wchar.h>
+
+#include <algorithm>
+#include <vector>
+
+#ifndef PUGIXML_NO_XPATH
+static void build_document_order(std::vector<pugi::xpath_node>& result, pugi::xml_node root)
+{
+	result.push_back(pugi::xpath_node());
+
+	pugi::xml_node cur = root;
+
+	for (;;)
+	{
+		result.push_back(cur);
+
+		for (pugi::xml_attribute a = cur.first_attribute(); a; a = a.next_attribute())
+			result.push_back(pugi::xpath_node(a, cur));
+
+		if (cur.first_child())
+			cur = cur.first_child();
+		else if (cur.next_sibling())
+			cur = cur.next_sibling();
+		else
+		{
+			while (cur && !cur.next_sibling()) cur = cur.parent();
+			cur = cur.next_sibling();
+
+			if (!cur) break;
+		}
+	}
+}
+#endif
+
+bool test_string_equal(const pugi::char_t* lhs, const pugi::char_t* rhs)
+{
+	return (!lhs || !rhs) ? lhs == rhs :
+	#ifdef PUGIXML_WCHAR_MODE
+		wcscmp(lhs, rhs) == 0;
+	#else
+		strcmp(lhs, rhs) == 0;
+	#endif
+}
+
+bool test_node(const pugi::xml_node& node, const pugi::char_t* contents, const pugi::char_t* indent, unsigned int flags)
+{
+	xml_writer_string writer;
+
+	node.print(writer, indent, flags, get_native_encoding());
+
+	return writer.as_string() == contents;
+}
+
+bool test_double_nan(double value)
+{
+#if defined(_MSC_VER) || defined(__BORLANDC__)
+	return _isnan(value) != 0;
+#else
+	return value != value;
+#endif
+}
+
+#ifndef PUGIXML_NO_XPATH
+static size_t strlength(const pugi::char_t* s)
+{
+#ifdef PUGIXML_WCHAR_MODE
+	return wcslen(s);
+#else
+	return strlen(s);
+#endif
+}
+
+bool test_xpath_string(const pugi::xpath_node& node, const pugi::char_t* query, pugi::xpath_variable_set* variables, const pugi::char_t* expected)
+{
+	pugi::xpath_query q(query, variables);
+	if (!q) return false;
+
+	const size_t capacity = 64;
+	pugi::char_t result[capacity];
+
+	size_t size = q.evaluate_string(result, capacity, node);
+
+	if (size != strlength(expected) + 1)
+		return false;
+
+	if (size <= capacity)
+		return test_string_equal(result, expected);
+
+	std::basic_string<pugi::char_t> buffer(size, ' ');
+
+	return q.evaluate_string(&buffer[0], size, node) == size && test_string_equal(buffer.c_str(), expected);
+}
+
+bool test_xpath_boolean(const pugi::xpath_node& node, const pugi::char_t* query, pugi::xpath_variable_set* variables, bool expected)
+{
+	pugi::xpath_query q(query, variables);
+	if (!q) return false;
+
+	return q.evaluate_boolean(node) == expected;
+}
+
+bool test_xpath_number(const pugi::xpath_node& node, const pugi::char_t* query, pugi::xpath_variable_set* variables, double expected)
+{
+	pugi::xpath_query q(query, variables);
+	if (!q) return false;
+
+	double value = q.evaluate_number(node);
+	double absolute_error = fabs(value - expected);
+
+	const double tolerance = 1e-15f;
+	return absolute_error < tolerance || absolute_error < fabs(expected) * tolerance;
+}
+
+bool test_xpath_number_nan(const pugi::xpath_node& node, const pugi::char_t* query, pugi::xpath_variable_set* variables)
+{
+	pugi::xpath_query q(query, variables);
+	if (!q) return false;
+
+	return test_double_nan(q.evaluate_number(node));
+}
+
+bool test_xpath_fail_compile(const pugi::char_t* query, pugi::xpath_variable_set* variables)
+{
+#ifdef PUGIXML_NO_EXCEPTIONS
+	return !pugi::xpath_query(query, variables);
+#else
+	try
+	{
+		pugi::xpath_query q(query, variables);
+		return false;
+	}
+	catch (const pugi::xpath_exception&)
+	{
+		return true;
+	}
+#endif
+}
+
+void xpath_node_set_tester::check(bool condition)
+{
+	if (!condition)
+	{
+		test_runner::_failure_message = message;
+		longjmp(test_runner::_failure_buffer, 1);
+	}
+}
+
+xpath_node_set_tester::xpath_node_set_tester(const pugi::xpath_node_set& set, const char* message_): last(0), message(message_)
+{
+	result = set;
+
+	// only sort unsorted sets so that we're able to verify reverse order for some axes
+	if (result.type() == pugi::xpath_node_set::type_unsorted) result.sort();
+
+	if (result.empty())
+	{
+		document_order = 0;
+		document_size = 0;
+	}
+	else
+	{
+		std::vector<pugi::xpath_node> order;
+		build_document_order(order, (result[0].attribute() ? result[0].parent() : result[0].node()).root());
+
+		document_order = new pugi::xpath_node[order.size()];
+		std::copy(order.begin(), order.end(), document_order);
+
+		document_size = order.size();
+	}
+}
+
+xpath_node_set_tester::~xpath_node_set_tester()
+{
+	// check that we processed everything
+	check(last == result.size());
+
+	delete[] document_order;
+}
+
+xpath_node_set_tester& xpath_node_set_tester::operator%(unsigned int expected)
+{
+	// check element count
+	check(last < result.size());
+
+	// check document order
+	check(expected < document_size);
+	check(result.begin()[last] == document_order[expected]);
+
+	// continue to the next element
+	last++;
+
+	return *this;
+}
+
+#endif
+
+bool is_little_endian()
+{
+	unsigned int ui = 1;
+	return *reinterpret_cast<char*>(&ui) == 1;
+}
+
+pugi::xml_encoding get_native_encoding()
+{
+#ifdef PUGIXML_WCHAR_MODE
+	return pugi::encoding_wchar;
+#else
+	return pugi::encoding_utf8;
+#endif
+}

lightspark.tar.xz/src/3rdparty/pugixml/tests/test.hpp Added

@@ -0,0 +1,171 @@
+#ifndef HEADER_TEST_TEST_HPP
+#define HEADER_TEST_TEST_HPP
+
+#include "../src/pugixml.hpp"
+
+#include <setjmp.h>
+
+struct test_runner
+{
+	test_runner(const char* name)
+	{
+		_name = name;
+		_next = _tests;
+		_tests = this;
+	}
+
+	virtual ~test_runner() {}
+
+	virtual void run() = 0;
+
+	const char* _name;
+	test_runner* _next;
+
+	static test_runner* _tests;
+	static size_t _memory_fail_threshold;
+	static bool _memory_fail_triggered;
+	static jmp_buf _failure_buffer;
+	static const char* _failure_message;
+
+	static const char* _temp_path;
+};
+
+bool test_string_equal(const pugi::char_t* lhs, const pugi::char_t* rhs);
+
+template <typename Node> inline bool test_node_name_value(const Node& node, const pugi::char_t* name, const pugi::char_t* value)
+{
+	return test_string_equal(node.name(), name) && test_string_equal(node.value(), value);
+}
+
+bool test_node(const pugi::xml_node& node, const pugi::char_t* contents, const pugi::char_t* indent, unsigned int flags);
+bool test_double_nan(double value);
+
+#ifndef PUGIXML_NO_XPATH
+bool test_xpath_string(const pugi::xpath_node& node, const pugi::char_t* query, pugi::xpath_variable_set* variables, const pugi::char_t* expected);
+bool test_xpath_boolean(const pugi::xpath_node& node, const pugi::char_t* query, pugi::xpath_variable_set* variables, bool expected);
+bool test_xpath_number(const pugi::xpath_node& node, const pugi::char_t* query, pugi::xpath_variable_set* variables, double expected);
+bool test_xpath_number_nan(const pugi::xpath_node& node, const pugi::char_t* query, pugi::xpath_variable_set* variables);
+
+bool test_xpath_fail_compile(const pugi::char_t* query, pugi::xpath_variable_set* variables);
+
+struct xpath_node_set_tester
+{
+	pugi::xpath_node* document_order;
+	size_t document_size;
+
+	pugi::xpath_node_set result;
+	unsigned int last;
+	const char* message;
+
+	void check(bool condition);
+
+	xpath_node_set_tester(const pugi::xpath_node_set& set, const char* message);
+	~xpath_node_set_tester();
+
+	xpath_node_set_tester& operator%(unsigned int expected);
+};
+
+#endif
+
+struct dummy_fixture {};
+
+#define TEST_FIXTURE(name, fixture) \
+	struct test_runner_helper_##name: fixture \
+	{ \
+		void run(); \
+	}; \
+	static struct test_runner_##name: test_runner \
+	{ \
+		test_runner_##name(): test_runner(#name) {} \
+		\
+		virtual void run() \
+		{ \
+			test_runner_helper_##name helper; \
+			helper.run(); \
+		} \
+	} test_runner_instance_##name; \
+	void test_runner_helper_##name::run()
+
+#define TEST(name) TEST_FIXTURE(name, dummy_fixture)
+
+#define TEST_XML_FLAGS(name, xml, flags) \
+	struct test_fixture_##name \
+	{ \
+		pugi::xml_document doc; \
+		\
+		test_fixture_##name() \
+		{ \
+			CHECK(doc.load_string(PUGIXML_TEXT(xml), flags)); \
+		} \
+		\
+	private: \
+		test_fixture_##name(const test_fixture_##name&); \
+		test_fixture_##name& operator=(const test_fixture_##name&); \
+	}; \
+	\
+	TEST_FIXTURE(name, test_fixture_##name)
+
+#define TEST_XML(name, xml) TEST_XML_FLAGS(name, xml, pugi::parse_default)
+
+#define CHECK_JOIN(text, file, line) text " at " file ":" #line
+#define CHECK_JOIN2(text, file, line) CHECK_JOIN(text, file, line)
+#define CHECK_TEXT(condition, text) if (condition) ; else test_runner::_failure_message = CHECK_JOIN2(text, __FILE__, __LINE__), longjmp(test_runner::_failure_buffer, 1)
+#define CHECK_FORCE_FAIL(text) test_runner::_failure_message = CHECK_JOIN2(text, __FILE__, __LINE__), longjmp(test_runner::_failure_buffer, 1)
+
+#if (defined(_MSC_VER) && _MSC_VER == 1200) || defined(__MWERKS__)
+#	define STRINGIZE(value) "??" // MSVC 6.0 and CodeWarrior have troubles stringizing stuff with strings w/escaping inside
+#else
+#	define STRINGIZE(value) #value
+#endif
+
+#define CHECK(condition) CHECK_TEXT(condition, STRINGIZE(condition) " is false")
+#define CHECK_STRING(value, expected) CHECK_TEXT(test_string_equal(value, expected), STRINGIZE(value) " is not equal to " STRINGIZE(expected))
+#define CHECK_DOUBLE(value, expected) CHECK_TEXT((value > expected ? value - expected : expected - value) < 1e-6, STRINGIZE(value) " is not equal to " STRINGIZE(expected))
+#define CHECK_DOUBLE_NAN(value) CHECK_TEXT(test_double_nan(value), STRINGIZE(value) " is not equal to NaN")
+#define CHECK_NAME_VALUE(node, name, value) CHECK_TEXT(test_node_name_value(node, name, value), STRINGIZE(node) " name/value do not match " STRINGIZE(name) " and " STRINGIZE(value))
+#define CHECK_NODE_EX(node, expected, indent, flags) CHECK_TEXT(test_node(node, expected, indent, flags), STRINGIZE(node) " contents does not match " STRINGIZE(expected))
+#define CHECK_NODE(node, expected) CHECK_NODE_EX(node, expected, PUGIXML_TEXT(""), pugi::format_raw)
+
+#ifndef PUGIXML_NO_XPATH
+#define CHECK_XPATH_STRING_VAR(node, query, variables, expected) CHECK_TEXT(test_xpath_string(node, query, variables, expected), STRINGIZE(query) " does not evaluate to " STRINGIZE(expected) " in context " STRINGIZE(node))
+#define CHECK_XPATH_BOOLEAN_VAR(node, query, variables, expected) CHECK_TEXT(test_xpath_boolean(node, query, variables, expected), STRINGIZE(query) " does not evaluate to " STRINGIZE(expected) " in context " STRINGIZE(node))
+#define CHECK_XPATH_NUMBER_VAR(node, query, variables, expected) CHECK_TEXT(test_xpath_number(node, query, variables, expected), STRINGIZE(query) " does not evaluate to " STRINGIZE(expected) " in context " STRINGIZE(node))
+#define CHECK_XPATH_NUMBER_NAN_VAR(node, query, variables) CHECK_TEXT(test_xpath_number_nan(node, query, variables), STRINGIZE(query) " does not evaluate to NaN in context " STRINGIZE(node))
+#define CHECK_XPATH_NODESET_VAR(node, query, variables) xpath_node_set_tester(pugi::xpath_query(query, variables).evaluate_node_set(node), CHECK_JOIN2(STRINGIZE(query) " does not evaluate to expected set in context " STRINGIZE(node), __FILE__, __LINE__))
+#define CHECK_XPATH_FAIL_VAR(query, variables) CHECK_TEXT(test_xpath_fail_compile(query, variables), STRINGIZE(query) " should not compile")
+
+#define CHECK_XPATH_STRING(node, query, expected) CHECK_XPATH_STRING_VAR(node, query, 0, expected)
+#define CHECK_XPATH_BOOLEAN(node, query, expected) CHECK_XPATH_BOOLEAN_VAR(node, query, 0, expected)
+#define CHECK_XPATH_NUMBER(node, query, expected) CHECK_XPATH_NUMBER_VAR(node, query, 0, expected)
+#define CHECK_XPATH_NUMBER_NAN(node, query) CHECK_XPATH_NUMBER_NAN_VAR(node, query, 0)
+#define CHECK_XPATH_NODESET(node, query) CHECK_XPATH_NODESET_VAR(node, query, 0)
+#define CHECK_XPATH_FAIL(query) CHECK_XPATH_FAIL_VAR(query, 0)
+#endif
+
+#ifdef PUGIXML_NO_EXCEPTIONS
+#define CHECK_ALLOC_FAIL(code) do { CHECK(!test_runner::_memory_fail_triggered); code; CHECK(test_runner::_memory_fail_triggered); test_runner::_memory_fail_triggered = false; } while (test_runner::_memory_fail_triggered)
+#else
+#define CHECK_ALLOC_FAIL(code) do { CHECK(!test_runner::_memory_fail_triggered); try { code; } catch (std::bad_alloc&) {} CHECK(test_runner::_memory_fail_triggered); test_runner::_memory_fail_triggered = false; } while (test_runner::_memory_fail_triggered)
+#endif
+
+#define STR(text) PUGIXML_TEXT(text)
+
+#ifdef __DMC__
+#define U_LITERALS // DMC does not understand \x01234 (it parses first three digits), but understands \u01234
+#endif
+
+#if (defined(_MSC_VER) && _MSC_VER == 1200) || (defined(__INTEL_COMPILER) && __INTEL_COMPILER == 800) || defined(__BORLANDC__)
+// NaN comparison on MSVC6 is incorrect, see http://www.nabble.com/assertDoubleEquals,-NaN---Microsoft-Visual-Studio-6-td9137859.html
+// IC8 and BCC are also affected by the same bug
+#	define MSVC6_NAN_BUG 
+#endif
+
+inline wchar_t wchar_cast(unsigned int value)
+{
+	return static_cast<wchar_t>(value); // to avoid C4310 on MSVC
+}
+
+bool is_little_endian();
+pugi::xml_encoding get_native_encoding();
+
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_document.cpp Added

@@ -0,0 +1,1397 @@
+#define _CRT_SECURE_NO_WARNINGS
+#define _SCL_SECURE_NO_WARNINGS
+#define _SCL_SECURE_NO_DEPRECATE
+#define _CRT_NONSTDC_NO_DEPRECATE 0
+
+#include <string.h> // because Borland's STL is braindead, we have to include <string.h> _before_ <string> in order to get memcpy
+
+#include "common.hpp"
+
+#include "writer_string.hpp"
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#include <fstream>
+#include <sstream>
+
+#include <string>
+#include <algorithm>
+
+#ifdef __MINGW32__
+#	include <io.h> // for unlink in C++0x mode
+#endif
+
+#if defined(__CELLOS_LV2__) || defined(ANDROID) || defined(_GLIBCXX_HAVE_UNISTD_H) || defined(__APPLE__)
+#	include <unistd.h> // for unlink
+#endif
+
+static bool load_file_in_memory(const char* path, char*& data, size_t& size)
+{
+	FILE* file = fopen(path, "rb");
+	if (!file) return false;
+
+	fseek(file, 0, SEEK_END);
+	long length = ftell(file);
+	fseek(file, 0, SEEK_SET);
+
+	CHECK(length >= 0);
+	size = static_cast<size_t>(length);
+	data = new char[size];
+
+	CHECK(fread(data, 1, size, file) == size);
+	fclose(file);
+
+	return true;
+}
+
+static bool test_file_contents(const char* path, const char* data, size_t size)
+{
+ char* fdata;
+ size_t fsize;
+ if (!load_file_in_memory(path, fdata, fsize)) return false;
+
+ bool result = (size == fsize && memcmp(data, fdata, size) == 0);
+
+ delete[] fdata;
+
+ return result;
+}
+
+TEST(document_create_empty)
+{
+	pugi::xml_document doc;
+	CHECK_NODE(doc, STR(""));
+}
+
+TEST(document_create)
+{
+	pugi::xml_document doc;
+	doc.append_child().set_name(STR("node"));
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+#ifndef PUGIXML_NO_STL
+TEST(document_load_stream)
+{
+	pugi::xml_document doc;
+
+	std::istringstream iss("<node/>");
+	CHECK(doc.load(iss));
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST(document_load_stream_offset)
+{
+	pugi::xml_document doc;
+
+	std::istringstream iss("<foobar> <node/>");
+
+	std::string s;
+	iss >> s;
+
+	CHECK(doc.load(iss));
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST(document_load_stream_text)
+{
+	pugi::xml_document doc;
+
+	std::ifstream iss("tests/data/multiline.xml");
+	CHECK(doc.load(iss));
+	CHECK_NODE(doc, STR("<node1 /><node2 /><node3 />"));
+}
+
+TEST(document_load_stream_error)
+{
+	pugi::xml_document doc;
+
+	std::ifstream fs("filedoesnotexist");
+	CHECK(doc.load(fs).status == status_io_error);
+	
+	std::istringstream iss("<node/>");
+	test_runner::_memory_fail_threshold = 1;
+	CHECK_ALLOC_FAIL(CHECK(doc.load(iss).status == status_out_of_memory));
+}
+
+TEST(document_load_stream_empty)
+{
+	std::istringstream iss;
+
+	pugi::xml_document doc;
+	doc.load(iss); // parse result depends on STL implementation
+	CHECK(!doc.first_child());
+}
+
+TEST(document_load_stream_wide)
+{
+	pugi::xml_document doc;
+
+	std::basic_istringstream<wchar_t> iss(L"<node/>");
+	CHECK(doc.load(iss));
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+#ifndef PUGIXML_NO_EXCEPTIONS
+TEST(document_load_stream_exceptions)
+{
+	pugi::xml_document doc;
+
+	// Windows has newline translation for text-mode files, so reading from this stream reaches eof and sets fail|eof bits.
+	// This test does not cause stream to throw an exception on Linux - I have no idea how to get read() to fail except
+	// newline translation.
+	std::ifstream iss("tests/data/multiline.xml");
+	iss.exceptions(std::ios::eofbit | std::ios::badbit | std::ios::failbit);
+
+	try
+	{
+		doc.load(iss);
+
+		CHECK(iss.good()); // if the exception was not thrown, stream reading should succeed without errors
+	}
+	catch (const std::ios_base::failure&)
+	{
+		CHECK(!doc.first_child());
+	}
+}
+#endif
+
+TEST(document_load_stream_error_previous)
+{
+	pugi::xml_document doc;
+	CHECK(doc.load_string(STR("<node/>")));
+	CHECK(doc.first_child());
+
+	std::ifstream fs1("filedoesnotexist");
+	CHECK(doc.load(fs1).status == status_io_error);
+	CHECK(!doc.first_child());
+}
+
+TEST(document_load_stream_wide_error_previous)
+{
+	pugi::xml_document doc;
+	CHECK(doc.load_string(STR("<node/>")));
+	CHECK(doc.first_child());
+
+	std::basic_ifstream<wchar_t> fs1("filedoesnotexist");
+	CHECK(doc.load(fs1).status == status_io_error);
+	CHECK(!doc.first_child());
+}
+
+template <typename T> class char_array_buffer: public std::basic_streambuf<T>
+{
+public:
+ char_array_buffer(T* begin, T* end)
+ {
+ this->setg(begin, begin, end);
+ }
+
+ typename std::basic_streambuf<T>::int_type underflow()
+ {
+ return this->gptr() == this->egptr() ? std::basic_streambuf<T>::traits_type::eof() : std::basic_streambuf<T>::traits_type::to_int_type(*this->gptr());
+ }
+};
+
+TEST(document_load_stream_nonseekable)
+{
+ char contents[] = "<node />";
+ char_array_buffer<char> buffer(contents, contents + sizeof(contents) / sizeof(contents[0]));
+ std::istream in(&buffer);
+
+ pugi::xml_document doc;
+ CHECK(doc.load(in));
+ CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST(document_load_stream_wide_nonseekable)
+{
+ wchar_t contents[] = L"<node />";
+ char_array_buffer<wchar_t> buffer(contents, contents + sizeof(contents) / sizeof(contents[0]));
+ std::basic_istream<wchar_t> in(&buffer);
+
+ pugi::xml_document doc;
+ CHECK(doc.load(in));
+ CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST(document_load_stream_nonseekable_large)
+{
+	std::basic_string<pugi::char_t> str;
+	str += STR("<node>");
+	for (int i = 0; i < 10000; ++i) str += STR("<node />");
+	str += STR("</node>");
+
+ char_array_buffer<pugi::char_t> buffer(&str[0], &str[0] + str.length());
+ std::basic_istream<pugi::char_t> in(&buffer);
+
+ pugi::xml_document doc;
+ CHECK(doc.load(in));
+ CHECK_NODE(doc, str.c_str());
+}
+
+TEST(document_load_stream_nonseekable_out_of_memory)
+{
+ char contents[] = "<node />";
+ char_array_buffer<char> buffer(contents, contents + sizeof(contents) / sizeof(contents[0]));
+ std::istream in(&buffer);
+
+ test_runner::_memory_fail_threshold = 1;
+
+ pugi::xml_document doc;
+ CHECK_ALLOC_FAIL(CHECK(doc.load(in).status == status_out_of_memory));
+}
+
+TEST(document_load_stream_nonseekable_out_of_memory_large)
+{
+	std::basic_string<pugi::char_t> str;
+	str += STR("<node>");
+	for (int i = 0; i < 10000; ++i) str += STR("<node />");
+	str += STR("</node>");
+
+ char_array_buffer<pugi::char_t> buffer(&str[0], &str[0] + str.length());
+ std::basic_istream<pugi::char_t> in(&buffer);
+
+ test_runner::_memory_fail_threshold = 10000 * 8 * 3 / 2;
+
+ pugi::xml_document doc;
+ CHECK_ALLOC_FAIL(CHECK(doc.load(in).status == status_out_of_memory));
+}
+#endif
+
+TEST(document_load_string)
+{
+	pugi::xml_document doc;
+
+	CHECK(doc.load_string(STR("<node/>")));
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST(document_load_file)
+{
+	pugi::xml_document doc;
+
+	CHECK(doc.load_file("tests/data/small.xml"));
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST(document_load_file_empty)
+{
+	pugi::xml_document doc;
+
+	CHECK(doc.load_file("tests/data/empty.xml").status == status_no_document_element);
+	CHECK(!doc.first_child());
+}
+
+TEST(document_load_file_large)
+{
+	pugi::xml_document doc;
+
+	CHECK(doc.load_file("tests/data/large.xml"));
+
+	std::basic_string<pugi::char_t> str;
+	str += STR("<node>");
+	for (int i = 0; i < 10000; ++i) str += STR("<node />");
+	str += STR("</node>");
+
+	CHECK_NODE(doc, str.c_str());
+}
+
+TEST(document_load_file_error)
+{
+	pugi::xml_document doc;
+
+	CHECK(doc.load_file("filedoesnotexist").status == status_file_not_found);
+}
+
+TEST(document_load_file_out_of_memory)
+{
+	test_runner::_memory_fail_threshold = 1;
+
+	pugi::xml_document doc;
+	CHECK_ALLOC_FAIL(CHECK(doc.load_file("tests/data/small.xml").status == status_out_of_memory));
+}
+
+TEST(document_load_file_out_of_memory_file_leak)
+{
+	test_runner::_memory_fail_threshold = 1;
+
+	pugi::xml_document doc;
+
+	for (int i = 0; i < 256; ++i)
+		CHECK_ALLOC_FAIL(CHECK(doc.load_file("tests/data/small.xml").status == status_out_of_memory));
+
+	test_runner::_memory_fail_threshold = 0;
+
+	CHECK(doc.load_file("tests/data/small.xml"));
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST(document_load_file_wide_out_of_memory_file_leak)
+{
+	test_runner::_memory_fail_threshold = 256;
+
+	pugi::xml_document doc;
+
+	for (int i = 0; i < 256; ++i)
+		CHECK_ALLOC_FAIL(CHECK(doc.load_file(L"tests/data/small.xml").status == status_out_of_memory));
+
+	test_runner::_memory_fail_threshold = 0;
+
+	CHECK(doc.load_file(L"tests/data/small.xml"));
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST(document_load_file_error_previous)
+{
+	pugi::xml_document doc;
+	CHECK(doc.load_string(STR("<node/>")));
+	CHECK(doc.first_child());
+
+	CHECK(doc.load_file("filedoesnotexist").status == status_file_not_found);
+	CHECK(!doc.first_child());
+}
+
+TEST(document_load_file_wide_ascii)
+{
+	pugi::xml_document doc;
+
+	CHECK(doc.load_file(L"tests/data/small.xml"));
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+#if !defined(__DMC__) && !defined(__MWERKS__) && !(defined(__MINGW32__) && defined(__STRICT_ANSI__) && !defined(__MINGW64_VERSION_MAJOR))
+TEST(document_load_file_wide_unicode)
+{
+	pugi::xml_document doc;
+
+	CHECK(doc.load_file(L"tests/data/\x0442\x0435\x0441\x0442.xml"));
+	CHECK_NODE(doc, STR("<node />"));
+}
+#endif
+
+TEST(document_load_file_wide_out_of_memory)
+{
+	test_runner::_memory_fail_threshold = 1;
+
+	pugi::xml_document doc;
+
+	pugi::xml_parse_result result;
+	result.status = status_out_of_memory;
+	CHECK_ALLOC_FAIL(result = doc.load_file(L"tests/data/small.xml"));
+
+	CHECK(result.status == status_out_of_memory || result.status == status_file_not_found);
+}
+
+TEST_XML(document_save, "<node/>")
+{
+	xml_writer_string writer;
+
+	doc.save(writer, STR(""), pugi::format_no_declaration | pugi::format_raw, get_native_encoding());
+
+	CHECK(writer.as_string() == STR("<node />"));
+}
+
+#ifndef PUGIXML_NO_STL
+TEST_XML(document_save_stream, "<node/>")
+{
+	std::ostringstream oss;
+
+	doc.save(oss, STR(""), pugi::format_no_declaration | pugi::format_raw);
+
+	CHECK(oss.str() == "<node />");
+}
+
+TEST_XML(document_save_stream_wide, "<node/>")
+{
+	std::basic_ostringstream<wchar_t> oss;
+
+	doc.save(oss, STR(""), pugi::format_no_declaration | pugi::format_raw);
+
+	CHECK(oss.str() == L"<node />");
+}
+#endif
+
+TEST_XML(document_save_bom, "<n/>")
+{
+	unsigned int flags = format_no_declaration | format_raw | format_write_bom;
+
+	// specific encodings
+	CHECK(test_save_narrow(doc, flags, encoding_utf8, "\xef\xbb\xbf<n />", 8));
+	CHECK(test_save_narrow(doc, flags, encoding_utf16_be, "\xfe\xff\x00<\x00n\x00 \x00/\x00>", 12));
+	CHECK(test_save_narrow(doc, flags, encoding_utf16_le, "\xff\xfe<\x00n\x00 \x00/\x00>\x00", 12));
+	CHECK(test_save_narrow(doc, flags, encoding_utf32_be, "\x00\x00\xfe\xff\x00\x00\x00<\x00\x00\x00n\x00\x00\x00 \x00\x00\x00/\x00\x00\x00>", 24));
+	CHECK(test_save_narrow(doc, flags, encoding_utf32_le, "\xff\xfe\x00\x00<\x00\x00\x00n\x00\x00\x00 \x00\x00\x00/\x00\x00\x00>\x00\x00\x00", 24));
+	CHECK(test_save_narrow(doc, flags, encoding_latin1, "<n />", 5));
+
+	// encodings synonyms
+	CHECK(save_narrow(doc, flags, encoding_utf16) == save_narrow(doc, flags, (is_little_endian() ? encoding_utf16_le : encoding_utf16_be)));
+	CHECK(save_narrow(doc, flags, encoding_utf32) == save_narrow(doc, flags, (is_little_endian() ? encoding_utf32_le : encoding_utf32_be)));
+
+	size_t wcharsize = sizeof(wchar_t);
+	CHECK(save_narrow(doc, flags, encoding_wchar) == save_narrow(doc, flags, (wcharsize == 2 ? encoding_utf16 : encoding_utf32)));
+}
+
+TEST_XML(document_save_declaration, "<node/>")
+{
+	xml_writer_string writer;
+
+	doc.save(writer, STR(""), pugi::format_default, get_native_encoding());
+
+	CHECK(writer.as_string() == STR("<?xml version=\"1.0\"?>\n<node />\n"));
+}
+
+TEST(document_save_declaration_empty)
+{
+	xml_document doc;
+
+	xml_writer_string writer;
+
+	doc.save(writer, STR(""), pugi::format_default, get_native_encoding());
+
+	CHECK(writer.as_string() == STR("<?xml version=\"1.0\"?>\n"));
+}
+
+TEST_XML(document_save_declaration_present_first, "<node/>")
+{
+	doc.insert_child_before(node_declaration, doc.first_child()).append_attribute(STR("encoding")) = STR("utf8");
+
+	xml_writer_string writer;
+
+	doc.save(writer, STR(""), pugi::format_default, get_native_encoding());
+
+	CHECK(writer.as_string() == STR("<?xml encoding=\"utf8\"?>\n<node />\n"));
+}
+
+TEST_XML(document_save_declaration_present_second, "<node/>")
+{
+	doc.insert_child_before(node_declaration, doc.first_child()).append_attribute(STR("encoding")) = STR("utf8");
+	doc.insert_child_before(node_comment, doc.first_child()).set_value(STR("text"));
+
+	xml_writer_string writer;
+
+	doc.save(writer, STR(""), pugi::format_default, get_native_encoding());
+
+	CHECK(writer.as_string() == STR("\n<?xml encoding=\"utf8\"?>\n<node />\n"));
+}
+
+TEST_XML(document_save_declaration_present_last, "<node/>")
+{
+	doc.append_child(node_declaration).append_attribute(STR("encoding")) = STR("utf8");
+
+	xml_writer_string writer;
+
+	doc.save(writer, STR(""), pugi::format_default, get_native_encoding());
+
+	// node writer only looks for declaration before the first element child
+	CHECK(writer.as_string() == STR("<?xml version=\"1.0\"?>\n<node />\n<?xml encoding=\"utf8\"?>\n"));
+}
+
+TEST_XML(document_save_declaration_latin1, "<node/>")
+{
+	xml_writer_string writer;
+
+	doc.save(writer, STR(""), pugi::format_default, encoding_latin1);
+
+	CHECK(writer.as_narrow() == "<?xml version=\"1.0\" encoding=\"ISO-8859-1\"?>\n<node />\n");
+}
+
+struct temp_file
+{
+	char path[512];
+	
+	temp_file()
+	{
+		static int index = 0;
+		sprintf(path, "%stempfile%d", test_runner::_temp_path, index++);
+	}
+
+	~temp_file()
+	{
+	#ifndef _WIN32_WCE
+		CHECK(unlink(path) == 0);
+	#endif
+	}
+};
+
+TEST_XML(document_save_file, "<node/>")
+{
+	temp_file f;
+
+	CHECK(doc.save_file(f.path));
+
+	CHECK(doc.load_file(f.path, pugi::parse_default | pugi::parse_declaration));
+	CHECK_NODE(doc, STR("<?xml version=\"1.0\"?><node />"));
+}
+
+TEST_XML(document_save_file_wide, "<node/>")
+{
+	temp_file f;
+
+	// widen the path
+	wchar_t wpath[sizeof(f.path)];
+	std::copy(f.path, f.path + strlen(f.path) + 1, wpath + 0);
+
+	CHECK(doc.save_file(wpath));
+
+	CHECK(doc.load_file(f.path, pugi::parse_default | pugi::parse_declaration));
+	CHECK_NODE(doc, STR("<?xml version=\"1.0\"?><node />"));
+}
+
+TEST_XML(document_save_file_error, "<node/>")
+{
+	CHECK(!doc.save_file("tests/data/unknown/output.xml"));
+}
+
+TEST_XML(document_save_file_text, "<node/>")
+{
+	temp_file f;
+
+	CHECK(doc.save_file(f.path, STR(""), pugi::format_no_declaration | pugi::format_save_file_text));
+ CHECK(test_file_contents(f.path, "<node />\n", 9) || test_file_contents(f.path, "<node />\r\n", 10));
+
+	CHECK(doc.save_file(f.path, STR(""), pugi::format_no_declaration));
+ CHECK(test_file_contents(f.path, "<node />\n", 9));
+}
+
+TEST_XML(document_save_file_wide_text, "<node/>")
+{
+	temp_file f;
+
+	// widen the path
+	wchar_t wpath[sizeof(f.path)];
+	std::copy(f.path, f.path + strlen(f.path) + 1, wpath + 0);
+
+	CHECK(doc.save_file(wpath, STR(""), pugi::format_no_declaration | pugi::format_save_file_text));
+ CHECK(test_file_contents(f.path, "<node />\n", 9) || test_file_contents(f.path, "<node />\r\n", 10));
+
+	CHECK(doc.save_file(wpath, STR(""), pugi::format_no_declaration));
+ CHECK(test_file_contents(f.path, "<node />\n", 9));
+}
+
+TEST_XML(document_save_file_leak, "<node/>")
+{
+	temp_file f;
+
+	for (int i = 0; i < 256; ++i)
+		CHECK(doc.save_file(f.path));
+}
+
+TEST_XML(document_save_file_wide_leak, "<node/>")
+{
+	temp_file f;
+
+	// widen the path
+	wchar_t wpath[sizeof(f.path)];
+	std::copy(f.path, f.path + strlen(f.path) + 1, wpath + 0);
+
+	for (int i = 0; i < 256; ++i)
+		CHECK(doc.save_file(wpath));
+}
+
+TEST(document_load_buffer)
+{
+	const pugi::char_t text[] = STR("<?xml?><node/>");
+
+	pugi::xml_document doc;
+
+	CHECK(doc.load_buffer(text, sizeof(text)));
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST(document_load_buffer_inplace)
+{
+	pugi::char_t text[] = STR("<?xml?><node/>");
+
+	pugi::xml_document doc;
+
+	CHECK(doc.load_buffer_inplace(text, sizeof(text)));
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST(document_load_buffer_inplace_own)
+{
+	allocation_function alloc = get_memory_allocation_function();
+
+	size_t size = strlen("<?xml?><node/>") * sizeof(pugi::char_t);
+
+	pugi::char_t* text = static_cast<pugi::char_t*>(alloc(size));
+	CHECK(text);
+
+	memcpy(text, STR("<?xml?><node/>"), size);
+
+	pugi::xml_document doc;
+
+	CHECK(doc.load_buffer_inplace_own(text, size));
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST(document_parse_result_bool)
+{
+	xml_parse_result result;
+
+	result.status = status_ok;
+	CHECK(result);
+	CHECK(!!result);
+	CHECK(result == true);
+
+	for (int i = 1; i < 20; ++i)
+	{
+		result.status = static_cast<xml_parse_status>(i);
+		CHECK(!result);
+		CHECK(result == false);
+	}
+}
+
+TEST(document_parse_result_description)
+{
+	xml_parse_result result;
+
+	for (int i = 0; i < 20; ++i)
+	{
+		result.status = static_cast<xml_parse_status>(i);
+
+		CHECK(result.description() != 0);
+		CHECK(result.description()[0] != 0);
+	}
+}
+
+TEST(document_load_fail)
+{
+	xml_document doc;
+	CHECK(!doc.load_string(STR("<foo><bar/>")));
+	CHECK(doc.child(STR("foo")).child(STR("bar")));
+}
+
+inline void check_utftest_document(const xml_document& doc)
+{
+	// ascii text
+	CHECK_STRING(doc.last_child().first_child().name(), STR("English"));
+
+	// check that we have parsed some non-ascii text
+	CHECK(static_cast<unsigned int>(doc.last_child().last_child().name()[0]) >= 0x80);
+
+	// check magic string
+	const pugi::char_t* v = doc.last_child().child(STR("Heavy")).previous_sibling().child_value();
+
+#ifdef PUGIXML_WCHAR_MODE
+	CHECK(v[0] == 0x4e16 && v[1] == 0x754c && v[2] == 0x6709 && v[3] == 0x5f88 && v[4] == 0x591a && v[5] == wchar_cast(0x8bed) && v[6] == wchar_cast(0x8a00));
+
+	// last character is a surrogate pair
+	size_t wcharsize = sizeof(wchar_t);
+
+	CHECK(wcharsize == 2 ? (v[7] == wchar_cast(0xd852) && v[8] == wchar_cast(0xdf62)) : (v[7] == wchar_cast(0x24b62)));
+#else
+	// unicode string
+	CHECK_STRING(v, "\xe4\xb8\x96\xe7\x95\x8c\xe6\x9c\x89\xe5\xbe\x88\xe5\xa4\x9a\xe8\xaf\xad\xe8\xa8\x80\xf0\xa4\xad\xa2");
+#endif
+}
+
+TEST(document_load_file_convert_auto)
+{
+	const char* files[] =
+	{
+		"tests/data/utftest_utf16_be.xml",
+		"tests/data/utftest_utf16_be_bom.xml",
+		"tests/data/utftest_utf16_be_nodecl.xml",
+		"tests/data/utftest_utf16_le.xml",
+		"tests/data/utftest_utf16_le_bom.xml",
+		"tests/data/utftest_utf16_le_nodecl.xml",
+		"tests/data/utftest_utf32_be.xml",
+		"tests/data/utftest_utf32_be_bom.xml",
+		"tests/data/utftest_utf32_be_nodecl.xml",
+		"tests/data/utftest_utf32_le.xml",
+		"tests/data/utftest_utf32_le_bom.xml",
+		"tests/data/utftest_utf32_le_nodecl.xml",
+		"tests/data/utftest_utf8.xml",
+		"tests/data/utftest_utf8_bom.xml",
+		"tests/data/utftest_utf8_nodecl.xml"
+	};
+
+	xml_encoding encodings[] =
+	{
+		encoding_utf16_be, encoding_utf16_be, encoding_utf16_be,
+		encoding_utf16_le, encoding_utf16_le, encoding_utf16_le,
+		encoding_utf32_be, encoding_utf32_be, encoding_utf32_be,
+		encoding_utf32_le, encoding_utf32_le, encoding_utf32_le,
+		encoding_utf8, encoding_utf8, encoding_utf8
+	};
+
+	for (unsigned int i = 0; i < sizeof(files) / sizeof(files[0]); ++i)
+	{
+		xml_document doc;
+		xml_parse_result res = doc.load_file(files[i]);
+
+		CHECK(res);
+		CHECK(res.encoding == encodings[i]);
+		check_utftest_document(doc);
+	}
+}
+
+TEST(document_load_file_convert_specific)
+{
+	const char* files[] =
+	{
+		"tests/data/utftest_utf16_be.xml",
+		"tests/data/utftest_utf16_be_bom.xml",
+		"tests/data/utftest_utf16_be_nodecl.xml",
+		"tests/data/utftest_utf16_le.xml",
+		"tests/data/utftest_utf16_le_bom.xml",
+		"tests/data/utftest_utf16_le_nodecl.xml",
+		"tests/data/utftest_utf32_be.xml",
+		"tests/data/utftest_utf32_be_bom.xml",
+		"tests/data/utftest_utf32_be_nodecl.xml",
+		"tests/data/utftest_utf32_le.xml",
+		"tests/data/utftest_utf32_le_bom.xml",
+		"tests/data/utftest_utf32_le_nodecl.xml",
+		"tests/data/utftest_utf8.xml",
+		"tests/data/utftest_utf8_bom.xml",
+		"tests/data/utftest_utf8_nodecl.xml"
+	};
+
+	xml_encoding encodings[] =
+	{
+		encoding_utf16_be, encoding_utf16_be, encoding_utf16_be,
+		encoding_utf16_le, encoding_utf16_le, encoding_utf16_le,
+		encoding_utf32_be, encoding_utf32_be, encoding_utf32_be,
+		encoding_utf32_le, encoding_utf32_le, encoding_utf32_le,
+		encoding_utf8, encoding_utf8, encoding_utf8
+	};
+
+	for (unsigned int i = 0; i < sizeof(files) / sizeof(files[0]); ++i)
+	{
+		for (unsigned int j = 0; j < sizeof(files) / sizeof(files[0]); ++j)
+		{
+			xml_encoding encoding = encodings[j];
+
+			xml_document doc;
+			xml_parse_result res = doc.load_file(files[i], parse_default, encoding);
+
+			if (encoding == encodings[i])
+			{
+				CHECK(res);
+				CHECK(res.encoding == encoding);
+				check_utftest_document(doc);
+			}
+			else
+			{
+				// should not get past first tag
+				CHECK(!doc.first_child());
+			}
+		}
+	}
+}
+
+TEST(document_load_file_convert_native_endianness)
+{
+	const char* files[2][6] =
+	{
+		{
+			"tests/data/utftest_utf16_be.xml",
+			"tests/data/utftest_utf16_be_bom.xml",
+			"tests/data/utftest_utf16_be_nodecl.xml",
+			"tests/data/utftest_utf32_be.xml",
+			"tests/data/utftest_utf32_be_bom.xml",
+			"tests/data/utftest_utf32_be_nodecl.xml",
+		},
+		{
+			"tests/data/utftest_utf16_le.xml",
+			"tests/data/utftest_utf16_le_bom.xml",
+			"tests/data/utftest_utf16_le_nodecl.xml",
+			"tests/data/utftest_utf32_le.xml",
+			"tests/data/utftest_utf32_le_bom.xml",
+			"tests/data/utftest_utf32_le_nodecl.xml",
+		}
+	};
+
+	xml_encoding encodings[] =
+	{
+		encoding_utf16, encoding_utf16, encoding_utf16,
+		encoding_utf32, encoding_utf32, encoding_utf32
+	};
+
+	for (unsigned int i = 0; i < sizeof(files[0]) / sizeof(files[0][0]); ++i)
+	{
+		const char* right_file = files[is_little_endian()][i];
+		const char* wrong_file = files[!is_little_endian()][i];
+
+		for (unsigned int j = 0; j < sizeof(encodings) / sizeof(encodings[0]); ++j)
+		{
+			xml_encoding encoding = encodings[j];
+
+			// check file with right endianness
+			{
+				xml_document doc;
+				xml_parse_result res = doc.load_file(right_file, parse_default, encoding);
+
+				if (encoding == encodings[i])
+				{
+					CHECK(res);
+					check_utftest_document(doc);
+				}
+				else
+				{
+					// should not get past first tag
+					CHECK(!doc.first_child());
+				}
+			}
+
+			// check file with wrong endianness
+			{
+				xml_document doc;
+				doc.load_file(wrong_file, parse_default, encoding);
+				CHECK(!doc.first_child());
+			}
+		}
+	}
+}
+
+struct file_data_t
+{
+ const char* path;
+ xml_encoding encoding;
+
+ char* data;
+ size_t size;
+};
+
+
+TEST(document_contents_preserve)
+{
+	file_data_t files[] =
+	{
+		{"tests/data/utftest_utf16_be_clean.xml", encoding_utf16_be, 0, 0},
+		{"tests/data/utftest_utf16_le_clean.xml", encoding_utf16_le, 0, 0},
+		{"tests/data/utftest_utf32_be_clean.xml", encoding_utf32_be, 0, 0},
+		{"tests/data/utftest_utf32_le_clean.xml", encoding_utf32_le, 0, 0},
+		{"tests/data/utftest_utf8_clean.xml", encoding_utf8, 0, 0}
+	};
+
+	// load files in memory
+	for (unsigned int i = 0; i < sizeof(files) / sizeof(files[0]); ++i)
+	{
+		CHECK(load_file_in_memory(files[i].path, files[i].data, files[i].size));
+	}
+
+	// convert each file to each format and compare bitwise
+	for (unsigned int src = 0; src < sizeof(files) / sizeof(files[0]); ++src)
+	{
+		for (unsigned int dst = 0; dst < sizeof(files) / sizeof(files[0]); ++dst)
+		{
+			// parse into document (preserve comments, declaration and whitespace pcdata)
+			xml_document doc;
+			CHECK(doc.load_buffer(files[src].data, files[src].size, parse_default | parse_ws_pcdata | parse_declaration | parse_comments));
+
+			// compare saved document with the original (raw formatting, without extra declaration, write bom if it was in original file)
+			CHECK(test_save_narrow(doc, format_raw | format_no_declaration | format_write_bom, files[dst].encoding, files[dst].data, files[dst].size));
+		}
+	}
+
+	// cleanup
+	for (unsigned int j = 0; j < sizeof(files) / sizeof(files[0]); ++j)
+	{
+		delete[] files[j].data;
+	}
+}
+
+TEST(document_contents_preserve_latin1)
+{
+	file_data_t files[] =
+	{
+		{"tests/data/latintest_utf8.xml", encoding_utf8, 0, 0},
+		{"tests/data/latintest_latin1.xml", encoding_latin1, 0, 0}
+	};
+
+	// load files in memory
+	for (unsigned int i = 0; i < sizeof(files) / sizeof(files[0]); ++i)
+	{
+		CHECK(load_file_in_memory(files[i].path, files[i].data, files[i].size));
+	}
+
+	// convert each file to each format and compare bitwise
+	for (unsigned int src = 0; src < sizeof(files) / sizeof(files[0]); ++src)
+	{
+		for (unsigned int dst = 0; dst < sizeof(files) / sizeof(files[0]); ++dst)
+		{
+			// parse into document (preserve comments, declaration and whitespace pcdata)
+			xml_document doc;
+			CHECK(doc.load_buffer(files[src].data, files[src].size, parse_default | parse_ws_pcdata | parse_declaration | parse_comments, files[src].encoding));
+
+			// compare saved document with the original (raw formatting, without extra declaration, write bom if it was in original file)
+			CHECK(test_save_narrow(doc, format_raw | format_no_declaration | format_write_bom, files[dst].encoding, files[dst].data, files[dst].size));
+		}
+	}
+
+	// cleanup
+	for (unsigned int j = 0; j < sizeof(files) / sizeof(files[0]); ++j)
+	{
+		delete[] files[j].data;
+	}
+}
+
+static bool test_parse_fail(const void* buffer, size_t size, xml_encoding encoding = encoding_utf8)
+{
+	// copy buffer to heap (to enable out-of-bounds checks)
+	void* temp = malloc(size);
+	memcpy(temp, buffer, size);
+
+	// check that this parses without buffer overflows (yielding an error)
+	xml_document doc;
+	bool result = doc.load_buffer_inplace(temp, size, parse_default, encoding);
+
+	free(temp);
+
+	return !result;
+}
+
+TEST(document_convert_invalid_utf8)
+{
+	// invalid 1-byte input
+	CHECK(test_parse_fail("<\xb0", 2));
+
+	// invalid 2-byte input
+	CHECK(test_parse_fail("<\xc0", 2));
+	CHECK(test_parse_fail("<\xd0", 2));
+
+	// invalid 3-byte input
+	CHECK(test_parse_fail("<\xe2\x80", 3));
+	CHECK(test_parse_fail("<\xe2", 2));
+
+	// invalid 4-byte input
+	CHECK(test_parse_fail("<\xf2\x97\x98", 4));
+	CHECK(test_parse_fail("<\xf2\x97", 3));
+	CHECK(test_parse_fail("<\xf2", 2));
+
+	// invalid 5-byte input
+	CHECK(test_parse_fail("<\xf8", 2));
+}
+
+TEST(document_convert_invalid_utf16)
+{
+	// check non-terminated degenerate handling
+	CHECK(test_parse_fail("\x00<\xda\x1d", 4, encoding_utf16_be));
+	CHECK(test_parse_fail("<\x00\x1d\xda", 4, encoding_utf16_le));
+
+	// check incorrect leading code
+	CHECK(test_parse_fail("\x00<\xde\x24", 4, encoding_utf16_be));
+	CHECK(test_parse_fail("<\x00\x24\xde", 4, encoding_utf16_le));
+}
+
+TEST(document_load_buffer_empty)
+{
+	xml_encoding encodings[] =
+	{
+		encoding_auto,
+		encoding_utf8,
+		encoding_utf16_le,
+		encoding_utf16_be,
+		encoding_utf16,
+		encoding_utf32_le,
+		encoding_utf32_be,
+		encoding_utf32,
+		encoding_wchar,
+ encoding_latin1
+	};
+
+	char buffer[1];
+
+	for (unsigned int i = 0; i < sizeof(encodings) / sizeof(encodings[0]); ++i)
+	{
+		xml_encoding encoding = encodings[i];
+
+		xml_document doc;
+		CHECK(doc.load_buffer(buffer, 0, parse_default, encoding).status == status_no_document_element && !doc.first_child());
+		CHECK(doc.load_buffer(0, 0, parse_default, encoding).status == status_no_document_element && !doc.first_child());
+
+		CHECK(doc.load_buffer_inplace(buffer, 0, parse_default, encoding).status == status_no_document_element && !doc.first_child());
+		CHECK(doc.load_buffer_inplace(0, 0, parse_default, encoding).status == status_no_document_element && !doc.first_child());
+
+		void* own_buffer = pugi::get_memory_allocation_function()(1);
+
+		CHECK(doc.load_buffer_inplace_own(own_buffer, 0, parse_default, encoding).status == status_no_document_element && !doc.first_child());
+		CHECK(doc.load_buffer_inplace_own(0, 0, parse_default, encoding).status == status_no_document_element && !doc.first_child());
+	}
+}
+
+TEST(document_load_buffer_empty_fragment)
+{
+	xml_encoding encodings[] =
+	{
+		encoding_auto,
+		encoding_utf8,
+		encoding_utf16_le,
+		encoding_utf16_be,
+		encoding_utf16,
+		encoding_utf32_le,
+		encoding_utf32_be,
+		encoding_utf32,
+		encoding_wchar,
+ encoding_latin1
+	};
+
+	char buffer[1];
+
+	for (unsigned int i = 0; i < sizeof(encodings) / sizeof(encodings[0]); ++i)
+	{
+		xml_encoding encoding = encodings[i];
+
+		xml_document doc;
+		CHECK(doc.load_buffer(buffer, 0, parse_fragment, encoding) && !doc.first_child());
+		CHECK(doc.load_buffer(0, 0, parse_fragment, encoding) && !doc.first_child());
+
+		CHECK(doc.load_buffer_inplace(buffer, 0, parse_fragment, encoding) && !doc.first_child());
+		CHECK(doc.load_buffer_inplace(0, 0, parse_fragment, encoding) && !doc.first_child());
+
+		void* own_buffer = pugi::get_memory_allocation_function()(1);
+
+		CHECK(doc.load_buffer_inplace_own(own_buffer, 0, parse_fragment, encoding) && !doc.first_child());
+		CHECK(doc.load_buffer_inplace_own(0, 0, parse_fragment, encoding) && !doc.first_child());
+	}
+}
+
+TEST(document_load_buffer_null)
+{
+	xml_document doc;
+
+	CHECK(doc.load_buffer(0, 12).status == status_io_error && !doc.first_child());
+	CHECK(doc.load_buffer(0, 12, parse_fragment).status == status_io_error && !doc.first_child());
+
+	CHECK(doc.load_buffer_inplace(0, 12).status == status_io_error && !doc.first_child());
+	CHECK(doc.load_buffer_inplace_own(0, 12).status == status_io_error && !doc.first_child());
+}
+
+TEST(document_progressive_truncation)
+{
+	char* original_data;
+	size_t original_size;
+
+	CHECK(load_file_in_memory("tests/data/truncation.xml", original_data, original_size));
+
+	char* buffer = new char[original_size];
+
+	for (size_t i = 1; i <= original_size; ++i)
+	{
+		char* truncated_data = buffer + original_size - i;
+
+		// default flags
+		{
+			memcpy(truncated_data, original_data, i);
+
+			xml_document doc;
+			bool result = doc.load_buffer_inplace(truncated_data, i);
+
+			// only eof is parseable
+			CHECK((i == original_size) ? result : !result);
+		}
+
+		// fragment mode
+		{
+			memcpy(truncated_data, original_data, i);
+
+			xml_document doc;
+			bool result = doc.load_buffer_inplace(truncated_data, i, parse_default | parse_fragment);
+
+			// some truncate locations are parseable - those that come after declaration, declaration + doctype, declaration + doctype + comment and eof
+			CHECK(((i - 21) < 3 || (i - 66) < 3 || (i - 95) < 3 || i == original_size) ? result : !result);
+		}
+	}
+
+	delete[] buffer;
+	delete[] original_data;
+}
+
+TEST(document_load_buffer_short)
+{
+	char* data = new char[4];
+	memcpy(data, "abcd", 4);
+
+	xml_document doc;
+
+	CHECK(doc.load_buffer(data, 4).status == status_no_document_element);
+	CHECK(doc.load_buffer(data + 1, 3).status == status_no_document_element);
+	CHECK(doc.load_buffer(data + 2, 2).status == status_no_document_element);
+	CHECK(doc.load_buffer(data + 3, 1).status == status_no_document_element);
+	CHECK(doc.load_buffer(data + 4, 0).status == status_no_document_element);
+	CHECK(doc.load_buffer(0, 0).status == status_no_document_element);
+
+	delete[] data;
+}
+
+TEST(document_load_buffer_short_fragment)
+{
+	char* data = new char[4];
+	memcpy(data, "abcd", 4);
+
+	xml_document doc;
+
+	CHECK(doc.load_buffer(data, 4, parse_fragment) && test_string_equal(doc.text().get(), STR("abcd")));
+	CHECK(doc.load_buffer(data + 1, 3, parse_fragment) && test_string_equal(doc.text().get(), STR("bcd")));
+	CHECK(doc.load_buffer(data + 2, 2, parse_fragment) && test_string_equal(doc.text().get(), STR("cd")));
+	CHECK(doc.load_buffer(data + 3, 1, parse_fragment) && test_string_equal(doc.text().get(), STR("d")));
+	CHECK(doc.load_buffer(data + 4, 0, parse_fragment) && !doc.first_child());
+	CHECK(doc.load_buffer(0, 0, parse_fragment) && !doc.first_child());
+
+	delete[] data;
+}
+
+TEST(document_load_buffer_inplace_short)
+{
+	char* data = new char[4];
+	memcpy(data, "abcd", 4);
+
+	xml_document doc;
+
+	CHECK(doc.load_buffer_inplace(data, 4).status == status_no_document_element);
+	CHECK(doc.load_buffer_inplace(data + 1, 3).status == status_no_document_element);
+	CHECK(doc.load_buffer_inplace(data + 2, 2).status == status_no_document_element);
+	CHECK(doc.load_buffer_inplace(data + 3, 1).status == status_no_document_element);
+	CHECK(doc.load_buffer_inplace(data + 4, 0).status == status_no_document_element);
+	CHECK(doc.load_buffer_inplace(0, 0).status == status_no_document_element);
+
+	delete[] data;
+}
+
+#ifndef PUGIXML_NO_EXCEPTIONS
+TEST(document_load_exceptions)
+{
+ bool thrown = false;
+
+ try
+ {
+ pugi::xml_document doc;
+ if (!doc.load_string(STR("<node attribute='value"))) throw std::bad_alloc();
+
+ CHECK_FORCE_FAIL("Expected parsing failure");
+ }
+ catch (const std::bad_alloc&)
+ {
+ thrown = true;
+ }
+
+ CHECK(thrown);
+}
+#endif
+
+TEST_XML_FLAGS(document_element, "<?xml version='1.0'?><node><child/></node>", parse_default | parse_declaration | parse_comments)
+{
+ CHECK(doc.document_element() == doc.child(STR("node")));
+}
+
+TEST_XML_FLAGS(document_element_absent, "", parse_comments | parse_fragment)
+{
+ CHECK(doc.document_element() == xml_node());
+}
+
+TEST_XML(document_reset, "<node><child/></node>")
+{
+ CHECK(doc.first_child());
+
+ doc.reset();
+ CHECK(!doc.first_child());
+ CHECK_NODE(doc, STR(""));
+
+ doc.reset();
+ CHECK(!doc.first_child());
+ CHECK_NODE(doc, STR(""));
+
+ CHECK(doc.load_string(STR("<node/>")));
+ CHECK(doc.first_child());
+ CHECK_NODE(doc, STR("<node />"));
+
+ doc.reset();
+ CHECK(!doc.first_child());
+ CHECK_NODE(doc, STR(""));
+}
+
+TEST(document_reset_empty)
+{
+ xml_document doc;
+
+ doc.reset();
+ CHECK(!doc.first_child());
+ CHECK_NODE(doc, STR(""));
+}
+
+TEST_XML(document_reset_copy, "<node><child/></node>")
+{
+ xml_document doc2;
+
+ CHECK_NODE(doc2, STR(""));
+
+ doc2.reset(doc);
+
+ CHECK_NODE(doc2, STR("<node><child /></node>"));
+ CHECK(doc.first_child() != doc2.first_child());
+
+ doc.reset(doc2);
+
+ CHECK_NODE(doc, STR("<node><child /></node>"));
+ CHECK(doc.first_child() != doc2.first_child());
+
+ CHECK(doc.first_child().offset_debug() == -1);
+}
+
+TEST_XML(document_reset_copy_self, "<node><child/></node>")
+{
+ CHECK_NODE(doc, STR("<node><child /></node>"));
+
+ doc.reset(doc);
+
+ CHECK(!doc.first_child());
+ CHECK_NODE(doc, STR(""));
+}
+
+TEST(document_load_buffer_utf_truncated)
+{
+	const unsigned char utf8[] = {'<', 0xe2, 0x82, 0xac, '/', '>'};
+	const unsigned char utf16_be[] = {0, '<', 0x20, 0xac, 0, '/', 0, '>'};
+	const unsigned char utf16_le[] = {'<', 0, 0xac, 0x20, '/', 0, '>', 0};
+	const unsigned char utf32_be[] = {0, 0, 0, '<', 0, 0, 0x20, 0xac, 0, 0, 0, '/', 0, 0, 0, '>'};
+	const unsigned char utf32_le[] = {'<', 0, 0, 0, 0xac, 0x20, 0, 0, '/', 0, 0, 0, '>', 0, 0, 0};
+
+	struct document_data_t
+	{
+	 xml_encoding encoding;
+
+	 const unsigned char* data;
+	 size_t size;
+	};
+
+	const document_data_t data[] =
+	{
+		{ encoding_utf8, utf8, sizeof(utf8) },
+		{ encoding_utf16_be, utf16_be, sizeof(utf16_be) },
+		{ encoding_utf16_le, utf16_le, sizeof(utf16_le) },
+		{ encoding_utf32_be, utf32_be, sizeof(utf32_be) },
+		{ encoding_utf32_le, utf32_le, sizeof(utf32_le) },
+	};
+
+	for (size_t i = 0; i < sizeof(data) / sizeof(data[0]); ++i)
+	{
+		const document_data_t& d = data[i];
+
+		for (size_t j = 0; j <= d.size; ++j)
+		{
+			char* buffer = new char[j];
+			memcpy(buffer, d.data, j);
+
+			xml_document doc;
+			xml_parse_result res = doc.load_buffer(buffer, j, parse_default, d.encoding);
+
+			if (j == d.size)
+			{
+				CHECK(res);
+
+				const char_t* name = doc.first_child().name();
+
+			#ifdef PUGIXML_WCHAR_MODE
+				CHECK(name[0] == 0x20ac && name[1] == 0);
+			#else
+				CHECK_STRING(name, "\xe2\x82\xac");
+			#endif
+			}
+			else
+			{
+				CHECK(!res || !doc.first_child());
+			}
+
+			delete[] buffer;
+		}
+	}
+}
+
+#ifndef PUGIXML_NO_STL
+TEST(document_load_stream_truncated)
+{
+	const unsigned char utf32_be[] = {0, 0, 0, '<', 0, 0, 0x20, 0xac, 0, 0, 0, '/', 0, 0, 0, '>'};
+
+	for (size_t i = 0; i <= sizeof(utf32_be); ++i)
+	{
+		std::string prefix(reinterpret_cast<const char*>(utf32_be), i);
+		std::istringstream iss(prefix);
+
+		xml_document doc;
+		xml_parse_result res = doc.load(iss);
+
+		if (i == sizeof(utf32_be))
+		{
+			CHECK(res);
+		}
+		else
+		{
+			CHECK(!res || !doc.first_child());
+
+			if (i < 8)
+			{
+				CHECK(!doc.first_child());
+			}
+			else
+			{
+				const char_t* name = doc.first_child().name();
+
+			#ifdef PUGIXML_WCHAR_MODE
+				CHECK(name[0] == 0x20ac && name[1] == 0);
+			#else
+				CHECK_STRING(name, "\xe2\x82\xac");
+			#endif
+			}
+		}
+	}
+}
+#endif
+
+TEST(document_alignment)
+{
+	char buf[256 + sizeof(xml_document)];
+
+	for (size_t offset = 0; offset < 256; offset += sizeof(void*))
+	{
+		xml_document* doc = new (buf + offset) xml_document;
+
+		CHECK(doc->load_string(STR("<node />")));
+		CHECK_NODE(*doc, STR("<node />"));
+
+		doc->~xml_document();
+	}
+}
+
+TEST(document_convert_out_of_memory)
+{
+	file_data_t files[] =
+	{
+		{"tests/data/utftest_utf16_be_clean.xml", encoding_utf16_be, 0, 0},
+		{"tests/data/utftest_utf16_le_clean.xml", encoding_utf16_le, 0, 0},
+		{"tests/data/utftest_utf32_be_clean.xml", encoding_utf32_be, 0, 0},
+		{"tests/data/utftest_utf32_le_clean.xml", encoding_utf32_le, 0, 0},
+		{"tests/data/utftest_utf8_clean.xml", encoding_utf8, 0, 0},
+		{"tests/data/latintest_latin1.xml", encoding_latin1, 0, 0}
+	};
+
+	// load files in memory
+	for (unsigned int i = 0; i < sizeof(files) / sizeof(files[0]); ++i)
+	{
+		CHECK(load_file_in_memory(files[i].path, files[i].data, files[i].size));
+	}
+
+	// disallow allocations
+	test_runner::_memory_fail_threshold = 1;
+
+	for (unsigned int src = 0; src < sizeof(files) / sizeof(files[0]); ++src)
+	{
+		xml_document doc;
+		CHECK_ALLOC_FAIL(CHECK(doc.load_buffer(files[src].data, files[src].size, parse_default, files[src].encoding).status == status_out_of_memory));
+	}
+
+	// cleanup
+	for (unsigned int j = 0; j < sizeof(files) / sizeof(files[0]); ++j)
+	{
+		delete[] files[j].data;
+	}
+}
+
+TEST(document_deprecated_load)
+{
+	xml_document doc;
+	CHECK(doc.load(STR("<node/>")));
+	CHECK_NODE(doc, STR("<node />"));
+}

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_dom_modify.cpp Added

@@ -0,0 +1,1687 @@
+#include "common.hpp"
+
+#include <limits>
+#include <string>
+
+#include <math.h>
+#include <string.h>
+
+#ifdef __BORLANDC__
+using std::ldexpf;
+#endif
+
+TEST_XML(dom_attr_assign, "<node/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	node.append_attribute(STR("attr1")) = STR("v1");
+	xml_attribute() = STR("v1");
+
+	node.append_attribute(STR("attr2")) = -2147483647;
+	node.append_attribute(STR("attr3")) = -2147483647 - 1;
+	xml_attribute() = -2147483647 - 1;
+
+	node.append_attribute(STR("attr4")) = 4294967295u;
+	node.append_attribute(STR("attr5")) = 4294967294u;
+	xml_attribute() = 4294967295u;
+
+	node.append_attribute(STR("attr6")) = 0.5;
+	xml_attribute() = 0.5;
+
+	node.append_attribute(STR("attr7")) = 0.25f;
+	xml_attribute() = 0.25f;
+
+	node.append_attribute(STR("attr8")) = true;
+	xml_attribute() = true;
+
+	CHECK_NODE(node, STR("<node attr1=\"v1\" attr2=\"-2147483647\" attr3=\"-2147483648\" attr4=\"4294967295\" attr5=\"4294967294\" attr6=\"0.5\" attr7=\"0.25\" attr8=\"true\" />"));
+}
+
+TEST_XML(dom_attr_set_name, "<node attr='value' />")
+{
+	xml_attribute attr = doc.child(STR("node")).attribute(STR("attr"));
+
+	CHECK(attr.set_name(STR("n")));
+	CHECK(!xml_attribute().set_name(STR("n")));
+
+	CHECK_NODE(doc, STR("<node n=\"value\" />"));
+}
+
+TEST_XML(dom_attr_set_value, "<node/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.append_attribute(STR("attr1")).set_value(STR("v1")));
+	CHECK(!xml_attribute().set_value(STR("v1")));
+
+	CHECK(node.append_attribute(STR("attr2")).set_value(-2147483647));
+	CHECK(node.append_attribute(STR("attr3")).set_value(-2147483647 - 1));
+	CHECK(!xml_attribute().set_value(-2147483647));
+
+	CHECK(node.append_attribute(STR("attr4")).set_value(4294967295u));
+	CHECK(node.append_attribute(STR("attr5")).set_value(4294967294u));
+	CHECK(!xml_attribute().set_value(4294967295u));
+
+	CHECK(node.append_attribute(STR("attr6")).set_value(0.5));
+	CHECK(!xml_attribute().set_value(0.5));
+
+	CHECK(node.append_attribute(STR("attr7")).set_value(0.25f));
+	CHECK(!xml_attribute().set_value(0.25f));
+
+	CHECK(node.append_attribute(STR("attr8")).set_value(true));
+	CHECK(!xml_attribute().set_value(true));
+
+	CHECK_NODE(node, STR("<node attr1=\"v1\" attr2=\"-2147483647\" attr3=\"-2147483648\" attr4=\"4294967295\" attr5=\"4294967294\" attr6=\"0.5\" attr7=\"0.25\" attr8=\"true\" />"));
+}
+
+#ifdef PUGIXML_HAS_LONG_LONG
+TEST_XML(dom_attr_assign_llong, "<node/>")
+{
+	xml_node node = doc.child(STR("node"));
+	
+	node.append_attribute(STR("attr1")) = -9223372036854775807ll;
+	node.append_attribute(STR("attr2")) = -9223372036854775807ll - 1;
+	xml_attribute() = -9223372036854775807ll - 1;
+
+	node.append_attribute(STR("attr3")) = 18446744073709551615ull;
+	node.append_attribute(STR("attr4")) = 18446744073709551614ull;
+	xml_attribute() = 18446744073709551615ull;
+
+	CHECK_NODE(node, STR("<node attr1=\"-9223372036854775807\" attr2=\"-9223372036854775808\" attr3=\"18446744073709551615\" attr4=\"18446744073709551614\" />"));
+}
+
+TEST_XML(dom_attr_set_value_llong, "<node/>")
+{
+	xml_node node = doc.child(STR("node"));
+	
+	CHECK(node.append_attribute(STR("attr1")).set_value(-9223372036854775807ll));
+	CHECK(node.append_attribute(STR("attr2")).set_value(-9223372036854775807ll - 1));
+	CHECK(!xml_attribute().set_value(-9223372036854775807ll - 1));
+
+	CHECK(node.append_attribute(STR("attr3")).set_value(18446744073709551615ull));
+	CHECK(node.append_attribute(STR("attr4")).set_value(18446744073709551614ull));
+	CHECK(!xml_attribute().set_value(18446744073709551615ull));
+
+	CHECK_NODE(node, STR("<node attr1=\"-9223372036854775807\" attr2=\"-9223372036854775808\" attr3=\"18446744073709551615\" attr4=\"18446744073709551614\" />"));
+}
+#endif
+
+TEST_XML(dom_attr_assign_large_number_float, "<node attr='' />")
+{
+	xml_node node = doc.child(STR("node"));
+
+	node.attribute(STR("attr")) = std::numeric_limits<float>::max();
+
+	CHECK(test_node(node, STR("<node attr=\"3.40282347e+038\" />"), STR(""), pugi::format_raw) ||
+		 test_node(node, STR("<node attr=\"3.40282347e+38\" />"), STR(""), pugi::format_raw));
+}
+
+TEST_XML(dom_attr_assign_large_number_double, "<node attr='' />")
+{
+	xml_node node = doc.child(STR("node"));
+
+	node.attribute(STR("attr")) = std::numeric_limits<double>::max();
+
+	// Borland C does not print double values with enough precision
+#ifdef __BORLANDC__
+	CHECK_NODE(node, STR("<node attr=\"1.7976931348623156e+308\" />"));
+#else
+	CHECK_NODE(node, STR("<node attr=\"1.7976931348623157e+308\" />"));
+#endif
+}
+
+TEST_XML(dom_node_set_name, "<node>text</node>")
+{
+	CHECK(doc.child(STR("node")).set_name(STR("n")));
+	CHECK(!doc.child(STR("node")).first_child().set_name(STR("n")));
+	CHECK(!xml_node().set_name(STR("n")));
+
+	CHECK_NODE(doc, STR("<n>text</n>"));
+}
+
+TEST_XML(dom_node_set_value, "<node>text</node>")
+{
+	CHECK(doc.child(STR("node")).first_child().set_value(STR("no text")));
+	CHECK(!doc.child(STR("node")).set_value(STR("no text")));
+	CHECK(!xml_node().set_value(STR("no text")));
+
+	CHECK_NODE(doc, STR("<node>no text</node>"));
+}
+
+TEST_XML(dom_node_set_value_allocated, "<node>text</node>")
+{
+	CHECK(doc.child(STR("node")).first_child().set_value(STR("no text")));
+	CHECK(!doc.child(STR("node")).set_value(STR("no text")));
+	CHECK(!xml_node().set_value(STR("no text")));
+	CHECK(doc.child(STR("node")).first_child().set_value(STR("no text at all")));
+
+	CHECK_NODE(doc, STR("<node>no text at all</node>"));
+}
+
+TEST_XML(dom_node_prepend_attribute, "<node><child/></node>")
+{
+	CHECK(xml_node().prepend_attribute(STR("a")) == xml_attribute());
+	CHECK(doc.prepend_attribute(STR("a")) == xml_attribute());
+	
+	xml_attribute a1 = doc.child(STR("node")).prepend_attribute(STR("a1"));
+	CHECK(a1);
+	a1 = STR("v1");
+
+	xml_attribute a2 = doc.child(STR("node")).prepend_attribute(STR("a2"));
+	CHECK(a2 && a1 != a2);
+	a2 = STR("v2");
+
+	xml_attribute a3 = doc.child(STR("node")).child(STR("child")).prepend_attribute(STR("a3"));
+	CHECK(a3 && a1 != a3 && a2 != a3);
+	a3 = STR("v3");
+
+	CHECK_NODE(doc, STR("<node a2=\"v2\" a1=\"v1\"><child a3=\"v3\" /></node>"));
+}
+
+TEST_XML(dom_node_append_attribute, "<node><child/></node>")
+{
+	CHECK(xml_node().append_attribute(STR("a")) == xml_attribute());
+	CHECK(doc.append_attribute(STR("a")) == xml_attribute());
+	
+	xml_attribute a1 = doc.child(STR("node")).append_attribute(STR("a1"));
+	CHECK(a1);
+	a1 = STR("v1");
+
+	xml_attribute a2 = doc.child(STR("node")).append_attribute(STR("a2"));
+	CHECK(a2 && a1 != a2);
+	a2 = STR("v2");
+
+	xml_attribute a3 = doc.child(STR("node")).child(STR("child")).append_attribute(STR("a3"));
+	CHECK(a3 && a1 != a3 && a2 != a3);
+	a3 = STR("v3");
+
+	CHECK_NODE(doc, STR("<node a1=\"v1\" a2=\"v2\"><child a3=\"v3\" /></node>"));
+}
+
+TEST_XML(dom_node_insert_attribute_after, "<node a1='v1'><child a2='v2'/></node>")
+{
+	CHECK(xml_node().insert_attribute_after(STR("a"), xml_attribute()) == xml_attribute());
+
+	xml_node node = doc.child(STR("node"));
+	xml_node child = node.child(STR("child"));
+
+	xml_attribute a1 = node.attribute(STR("a1"));
+	xml_attribute a2 = child.attribute(STR("a2"));
+
+	CHECK(node.insert_attribute_after(STR("a"), xml_attribute()) == xml_attribute());
+	CHECK(node.insert_attribute_after(STR("a"), a2) == xml_attribute());
+	
+	xml_attribute a3 = node.insert_attribute_after(STR("a3"), a1);
+	CHECK(a3 && a3 != a2 && a3 != a1);
+	a3 = STR("v3");
+
+	xml_attribute a4 = node.insert_attribute_after(STR("a4"), a1);
+	CHECK(a4 && a4 != a3 && a4 != a2 && a4 != a1);
+	a4 = STR("v4");
+
+	xml_attribute a5 = node.insert_attribute_after(STR("a5"), a3);
+	CHECK(a5 && a5 != a4 && a5 != a3 && a5 != a2 && a5 != a1);
+	a5 = STR("v5");
+
+	CHECK(child.insert_attribute_after(STR("a"), a4) == xml_attribute());
+
+	CHECK_NODE(doc, STR("<node a1=\"v1\" a4=\"v4\" a3=\"v3\" a5=\"v5\"><child a2=\"v2\" /></node>"));
+}
+
+TEST_XML(dom_node_insert_attribute_before, "<node a1='v1'><child a2='v2'/></node>")
+{
+	CHECK(xml_node().insert_attribute_before(STR("a"), xml_attribute()) == xml_attribute());
+
+	xml_node node = doc.child(STR("node"));
+	xml_node child = node.child(STR("child"));
+
+	xml_attribute a1 = node.attribute(STR("a1"));
+	xml_attribute a2 = child.attribute(STR("a2"));
+
+	CHECK(node.insert_attribute_before(STR("a"), xml_attribute()) == xml_attribute());
+	CHECK(node.insert_attribute_before(STR("a"), a2) == xml_attribute());
+	
+	xml_attribute a3 = node.insert_attribute_before(STR("a3"), a1);
+	CHECK(a3 && a3 != a2 && a3 != a1);
+	a3 = STR("v3");
+
+	xml_attribute a4 = node.insert_attribute_before(STR("a4"), a1);
+	CHECK(a4 && a4 != a3 && a4 != a2 && a4 != a1);
+	a4 = STR("v4");
+
+	xml_attribute a5 = node.insert_attribute_before(STR("a5"), a3);
+	CHECK(a5 && a5 != a4 && a5 != a3 && a5 != a2 && a5 != a1);
+	a5 = STR("v5");
+
+	CHECK(child.insert_attribute_before(STR("a"), a4) == xml_attribute());
+
+	CHECK_NODE(doc, STR("<node a5=\"v5\" a3=\"v3\" a4=\"v4\" a1=\"v1\"><child a2=\"v2\" /></node>"));
+}
+
+TEST_XML(dom_node_prepend_copy_attribute, "<node a1='v1'><child a2='v2'/><child/></node>")
+{
+	CHECK(xml_node().prepend_copy(xml_attribute()) == xml_attribute());
+	CHECK(xml_node().prepend_copy(doc.child(STR("node")).attribute(STR("a1"))) == xml_attribute());
+	CHECK(doc.prepend_copy(doc.child(STR("node")).attribute(STR("a1"))) == xml_attribute());
+	CHECK(doc.child(STR("node")).prepend_copy(xml_attribute()) == xml_attribute());
+	
+	xml_node node = doc.child(STR("node"));
+	xml_node child = node.child(STR("child"));
+
+	xml_attribute a1 = node.attribute(STR("a1"));
+	xml_attribute a2 = child.attribute(STR("a2"));
+
+	xml_attribute a3 = node.prepend_copy(a1);
+	CHECK(a3 && a3 != a2 && a3 != a1);
+
+	xml_attribute a4 = node.prepend_copy(a2);
+	CHECK(a4 && a4 != a3 && a4 != a2 && a4 != a1);
+
+	xml_attribute a5 = node.last_child().prepend_copy(a1);
+	CHECK(a5 && a5 != a4 && a5 != a3 && a5 != a2 && a5 != a1);
+
+	CHECK_NODE(doc, STR("<node a2=\"v2\" a1=\"v1\" a1=\"v1\"><child a2=\"v2\" /><child a1=\"v1\" /></node>"));
+
+	a3.set_name(STR("a3"));
+	a3 = STR("v3");
+	
+	a4.set_name(STR("a4"));
+	a4 = STR("v4");
+	
+	a5.set_name(STR("a5"));
+	a5 = STR("v5");
+	
+	CHECK_NODE(doc, STR("<node a4=\"v4\" a3=\"v3\" a1=\"v1\"><child a2=\"v2\" /><child a5=\"v5\" /></node>"));
+}
+
+TEST_XML(dom_node_append_copy_attribute, "<node a1='v1'><child a2='v2'/><child/></node>")
+{
+	CHECK(xml_node().append_copy(xml_attribute()) == xml_attribute());
+	CHECK(xml_node().append_copy(doc.child(STR("node")).attribute(STR("a1"))) == xml_attribute());
+	CHECK(doc.append_copy(doc.child(STR("node")).attribute(STR("a1"))) == xml_attribute());
+	CHECK(doc.child(STR("node")).append_copy(xml_attribute()) == xml_attribute());
+	
+	xml_node node = doc.child(STR("node"));
+	xml_node child = node.child(STR("child"));
+
+	xml_attribute a1 = node.attribute(STR("a1"));
+	xml_attribute a2 = child.attribute(STR("a2"));
+
+	xml_attribute a3 = node.append_copy(a1);
+	CHECK(a3 && a3 != a2 && a3 != a1);
+
+	xml_attribute a4 = node.append_copy(a2);
+	CHECK(a4 && a4 != a3 && a4 != a2 && a4 != a1);
+
+	xml_attribute a5 = node.last_child().append_copy(a1);
+	CHECK(a5 && a5 != a4 && a5 != a3 && a5 != a2 && a5 != a1);
+
+	CHECK_NODE(doc, STR("<node a1=\"v1\" a1=\"v1\" a2=\"v2\"><child a2=\"v2\" /><child a1=\"v1\" /></node>"));
+
+	a3.set_name(STR("a3"));
+	a3 = STR("v3");
+	
+	a4.set_name(STR("a4"));
+	a4 = STR("v4");
+	
+	a5.set_name(STR("a5"));
+	a5 = STR("v5");
+	
+	CHECK_NODE(doc, STR("<node a1=\"v1\" a3=\"v3\" a4=\"v4\"><child a2=\"v2\" /><child a5=\"v5\" /></node>"));
+}
+
+TEST_XML(dom_node_insert_copy_after_attribute, "<node a1='v1'><child a2='v2'/></node>")
+{
+	CHECK(xml_node().insert_copy_after(xml_attribute(), xml_attribute()) == xml_attribute());
+
+	xml_node node = doc.child(STR("node"));
+	xml_node child = node.child(STR("child"));
+
+	xml_attribute a1 = node.attribute(STR("a1"));
+	xml_attribute a2 = child.attribute(STR("a2"));
+
+	CHECK(node.insert_copy_after(a1, xml_attribute()) == xml_attribute());
+	CHECK(node.insert_copy_after(xml_attribute(), a1) == xml_attribute());
+	CHECK(node.insert_copy_after(a2, a2) == xml_attribute());
+	
+	xml_attribute a3 = node.insert_copy_after(a1, a1);
+	CHECK(a3 && a3 != a2 && a3 != a1);
+
+	xml_attribute a4 = node.insert_copy_after(a2, a1);
+	CHECK(a4 && a4 != a3 && a4 != a2 && a4 != a1);
+
+	xml_attribute a5 = node.insert_copy_after(a4, a1);
+	CHECK(a5 && a5 != a4 && a5 != a3 && a5 != a2 && a5 != a1);
+
+	CHECK(child.insert_copy_after(a4, a4) == xml_attribute());
+
+	CHECK_NODE(doc, STR("<node a1=\"v1\" a2=\"v2\" a2=\"v2\" a1=\"v1\"><child a2=\"v2\" /></node>"));
+
+	a3.set_name(STR("a3"));
+	a3 = STR("v3");
+	
+	a4.set_name(STR("a4"));
+	a4 = STR("v4");
+	
+	a5.set_name(STR("a5"));
+	a5 = STR("v5");
+	
+	CHECK_NODE(doc, STR("<node a1=\"v1\" a5=\"v5\" a4=\"v4\" a3=\"v3\"><child a2=\"v2\" /></node>"));
+}
+
+TEST_XML(dom_node_insert_copy_before_attribute, "<node a1='v1'><child a2='v2'/></node>")
+{
+	CHECK(xml_node().insert_copy_before(xml_attribute(), xml_attribute()) == xml_attribute());
+
+	xml_node node = doc.child(STR("node"));
+	xml_node child = node.child(STR("child"));
+
+	xml_attribute a1 = node.attribute(STR("a1"));
+	xml_attribute a2 = child.attribute(STR("a2"));
+
+	CHECK(node.insert_copy_before(a1, xml_attribute()) == xml_attribute());
+	CHECK(node.insert_copy_before(xml_attribute(), a1) == xml_attribute());
+	CHECK(node.insert_copy_before(a2, a2) == xml_attribute());
+	
+	xml_attribute a3 = node.insert_copy_before(a1, a1);
+	CHECK(a3 && a3 != a2 && a3 != a1);
+
+	xml_attribute a4 = node.insert_copy_before(a2, a1);
+	CHECK(a4 && a4 != a3 && a4 != a2 && a4 != a1);
+
+	xml_attribute a5 = node.insert_copy_before(a4, a1);
+	CHECK(a5 && a5 != a4 && a5 != a3 && a5 != a2 && a5 != a1);
+
+	CHECK(child.insert_copy_before(a4, a4) == xml_attribute());
+
+	CHECK_NODE(doc, STR("<node a1=\"v1\" a2=\"v2\" a2=\"v2\" a1=\"v1\"><child a2=\"v2\" /></node>"));
+
+	a3.set_name(STR("a3"));
+	a3 = STR("v3");
+	
+	a4.set_name(STR("a4"));
+	a4 = STR("v4");
+	
+	a5.set_name(STR("a5"));
+	a5 = STR("v5");
+	
+	CHECK_NODE(doc, STR("<node a3=\"v3\" a4=\"v4\" a5=\"v5\" a1=\"v1\"><child a2=\"v2\" /></node>"));
+}
+
+TEST_XML(dom_node_remove_attribute, "<node a1='v1' a2='v2' a3='v3'><child a4='v4'/></node>")
+{
+	CHECK(!xml_node().remove_attribute(STR("a")));
+	CHECK(!xml_node().remove_attribute(xml_attribute()));
+	
+	xml_node node = doc.child(STR("node"));
+	xml_node child = node.child(STR("child"));
+
+	CHECK(!node.remove_attribute(STR("a")));
+	CHECK(!node.remove_attribute(xml_attribute()));
+	CHECK(!node.remove_attribute(child.attribute(STR("a4"))));
+
+	CHECK_NODE(doc, STR("<node a1=\"v1\" a2=\"v2\" a3=\"v3\"><child a4=\"v4\" /></node>"));
+
+	CHECK(node.remove_attribute(STR("a1")));
+	CHECK(node.remove_attribute(node.attribute(STR("a3"))));
+	CHECK(child.remove_attribute(STR("a4")));
+
+	CHECK_NODE(doc, STR("<node a2=\"v2\"><child /></node>"));
+}
+
+TEST_XML(dom_node_prepend_child, "<node>foo<child/></node>")
+{
+	CHECK(xml_node().prepend_child() == xml_node());
+	CHECK(doc.child(STR("node")).first_child().prepend_child() == xml_node());
+	CHECK(doc.prepend_child(node_document) == xml_node());
+	CHECK(doc.prepend_child(node_null) == xml_node());
+	
+	xml_node n1 = doc.child(STR("node")).prepend_child();
+	CHECK(n1);
+	CHECK(n1.set_name(STR("n1")));
+
+	xml_node n2 = doc.child(STR("node")).prepend_child();
+	CHECK(n2 && n1 != n2);
+	CHECK(n2.set_name(STR("n2")));
+
+	xml_node n3 = doc.child(STR("node")).child(STR("child")).prepend_child(node_pcdata);
+	CHECK(n3 && n1 != n3 && n2 != n3);
+	CHECK(n3.set_value(STR("n3")));
+	
+	xml_node n4 = doc.prepend_child(node_comment);
+	CHECK(n4 && n1 != n4 && n2 != n4 && n3 != n4);
+	CHECK(n4.set_value(STR("n4")));
+
+	CHECK_NODE(doc, STR("<node><n2 /><n1 />foo<child>n3</child></node>"));
+}
+
+TEST_XML(dom_node_append_child, "<node>foo<child/></node>")
+{
+	CHECK(xml_node().append_child() == xml_node());
+	CHECK(doc.child(STR("node")).first_child().append_child() == xml_node());
+	CHECK(doc.append_child(node_document) == xml_node());
+	CHECK(doc.append_child(node_null) == xml_node());
+	
+	xml_node n1 = doc.child(STR("node")).append_child();
+	CHECK(n1);
+	CHECK(n1.set_name(STR("n1")));
+
+	xml_node n2 = doc.child(STR("node")).append_child();
+	CHECK(n2 && n1 != n2);
+	CHECK(n2.set_name(STR("n2")));
+
+	xml_node n3 = doc.child(STR("node")).child(STR("child")).append_child(node_pcdata);
+	CHECK(n3 && n1 != n3 && n2 != n3);
+	CHECK(n3.set_value(STR("n3")));
+	
+	xml_node n4 = doc.append_child(node_comment);
+	CHECK(n4 && n1 != n4 && n2 != n4 && n3 != n4);
+	CHECK(n4.set_value(STR("n4")));
+
+	CHECK_NODE(doc, STR("<node>foo<child>n3</child><n1 /><n2 /></node>"));
+}
+
+TEST_XML(dom_node_insert_child_after, "<node>foo<child/></node>")
+{
+	CHECK(xml_node().insert_child_after(node_element, xml_node()) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().insert_child_after(node_element, xml_node()) == xml_node());
+	CHECK(doc.insert_child_after(node_document, xml_node()) == xml_node());
+	CHECK(doc.insert_child_after(node_null, xml_node()) == xml_node());
+
+	xml_node node = doc.child(STR("node"));
+	xml_node child = node.child(STR("child"));
+
+	CHECK(node.insert_child_after(node_element, node) == xml_node());
+	CHECK(child.insert_child_after(node_element, node) == xml_node());
+	
+	xml_node n1 = node.insert_child_after(node_element, child);
+	CHECK(n1 && n1 != node && n1 != child);
+	CHECK(n1.set_name(STR("n1")));
+
+	xml_node n2 = node.insert_child_after(node_element, child);
+	CHECK(n2 && n2 != node && n2 != child && n2 != n1);
+	CHECK(n2.set_name(STR("n2")));
+
+	xml_node n3 = node.insert_child_after(node_pcdata, n2);
+	CHECK(n3 && n3 != node && n3 != child && n3 != n1 && n3 != n2);
+	CHECK(n3.set_value(STR("n3")));
+
+	xml_node n4 = node.insert_child_after(node_pi, node.first_child());
+	CHECK(n4 && n4 != node && n4 != child && n4 != n1 && n4 != n2 && n4 != n3);
+	CHECK(n4.set_name(STR("n4")));
+
+	CHECK(child.insert_child_after(node_element, n3) == xml_node());
+
+	CHECK_NODE(doc, STR("<node>foo<?n4?><child /><n2 />n3<n1 /></node>"));
+}
+
+TEST_XML(dom_node_insert_child_before, "<node>foo<child/></node>")
+{
+	CHECK(xml_node().insert_child_before(node_element, xml_node()) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().insert_child_before(node_element, xml_node()) == xml_node());
+	CHECK(doc.insert_child_before(node_document, xml_node()) == xml_node());
+	CHECK(doc.insert_child_before(node_null, xml_node()) == xml_node());
+
+	xml_node node = doc.child(STR("node"));
+	xml_node child = node.child(STR("child"));
+
+	CHECK(node.insert_child_before(node_element, node) == xml_node());
+	CHECK(child.insert_child_before(node_element, node) == xml_node());
+	
+	xml_node n1 = node.insert_child_before(node_element, child);
+	CHECK(n1 && n1 != node && n1 != child);
+	CHECK(n1.set_name(STR("n1")));
+
+	xml_node n2 = node.insert_child_before(node_element, child);
+	CHECK(n2 && n2 != node && n2 != child && n2 != n1);
+	CHECK(n2.set_name(STR("n2")));
+
+	xml_node n3 = node.insert_child_before(node_pcdata, n2);
+	CHECK(n3 && n3 != node && n3 != child && n3 != n1 && n3 != n2);
+	CHECK(n3.set_value(STR("n3")));
+
+	xml_node n4 = node.insert_child_before(node_pi, node.first_child());
+	CHECK(n4 && n4 != node && n4 != child && n4 != n1 && n4 != n2 && n4 != n3);
+	CHECK(n4.set_name(STR("n4")));
+
+	CHECK(child.insert_child_before(node_element, n3) == xml_node());
+
+	CHECK_NODE(doc, STR("<node><?n4?>foo<n1 />n3<n2 /><child /></node>"));
+}
+
+TEST_XML(dom_node_prepend_child_name, "<node>foo<child/></node>")
+{
+	CHECK(xml_node().prepend_child(STR("")) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().prepend_child(STR("")) == xml_node());
+	
+	xml_node n1 = doc.child(STR("node")).prepend_child(STR("n1"));
+	CHECK(n1);
+
+	xml_node n2 = doc.child(STR("node")).prepend_child(STR("n2"));
+	CHECK(n2 && n1 != n2);
+
+	CHECK_NODE(doc, STR("<node><n2 /><n1 />foo<child /></node>"));
+}
+
+TEST_XML(dom_node_append_child_name, "<node>foo<child/></node>")
+{
+	CHECK(xml_node().append_child(STR("")) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().append_child(STR("")) == xml_node());
+	
+	xml_node n1 = doc.child(STR("node")).append_child(STR("n1"));
+	CHECK(n1);
+
+	xml_node n2 = doc.child(STR("node")).append_child(STR("n2"));
+	CHECK(n2 && n1 != n2);
+
+	CHECK_NODE(doc, STR("<node>foo<child /><n1 /><n2 /></node>"));
+}
+
+TEST_XML(dom_node_insert_child_after_name, "<node>foo<child/></node>")
+{
+	CHECK(xml_node().insert_child_after(STR(""), xml_node()) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().insert_child_after(STR(""), xml_node()) == xml_node());
+
+	xml_node node = doc.child(STR("node"));
+	xml_node child = node.child(STR("child"));
+
+	CHECK(node.insert_child_after(STR(""), node) == xml_node());
+	CHECK(child.insert_child_after(STR(""), node) == xml_node());
+	
+	xml_node n1 = node.insert_child_after(STR("n1"), child);
+	CHECK(n1 && n1 != node && n1 != child);
+
+	xml_node n2 = node.insert_child_after(STR("n2"), child);
+	CHECK(n2 && n2 != node && n2 != child && n2 != n1);
+
+	CHECK(child.insert_child_after(STR(""), n2) == xml_node());
+
+	CHECK_NODE(doc, STR("<node>foo<child /><n2 /><n1 /></node>"));
+}
+
+TEST_XML(dom_node_insert_child_before_name, "<node>foo<child/></node>")
+{
+	CHECK(xml_node().insert_child_before(STR(""), xml_node()) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().insert_child_before(STR(""), xml_node()) == xml_node());
+
+	xml_node node = doc.child(STR("node"));
+	xml_node child = node.child(STR("child"));
+
+	CHECK(node.insert_child_before(STR(""), node) == xml_node());
+	CHECK(child.insert_child_before(STR(""), node) == xml_node());
+	
+	xml_node n1 = node.insert_child_before(STR("n1"), child);
+	CHECK(n1 && n1 != node && n1 != child);
+
+	xml_node n2 = node.insert_child_before(STR("n2"), child);
+	CHECK(n2 && n2 != node && n2 != child && n2 != n1);
+
+	CHECK(child.insert_child_before(STR(""), n2) == xml_node());
+
+	CHECK_NODE(doc, STR("<node>foo<n1 /><n2 /><child /></node>"));
+}
+
+TEST_XML(dom_node_remove_child, "<node><n1/><n2/><n3/><child><n4/></child></node>")
+{
+	CHECK(!xml_node().remove_child(STR("a")));
+	CHECK(!xml_node().remove_child(xml_node()));
+	
+	xml_node node = doc.child(STR("node"));
+	xml_node child = node.child(STR("child"));
+
+	CHECK(!node.remove_child(STR("a")));
+	CHECK(!node.remove_child(xml_node()));
+	CHECK(!node.remove_child(child.child(STR("n4"))));
+
+	CHECK_NODE(doc, STR("<node><n1 /><n2 /><n3 /><child><n4 /></child></node>"));
+
+	CHECK(node.remove_child(STR("n1")));
+	CHECK(node.remove_child(node.child(STR("n3"))));
+	CHECK(child.remove_child(STR("n4")));
+
+	CHECK_NODE(doc, STR("<node><n2 /><child /></node>"));
+}
+
+TEST_XML(dom_node_remove_child_complex, "<node id='1'><n1 id1='1' id2='2'/><n2/><n3/><child><n4/></child></node>")
+{
+	CHECK(doc.child(STR("node")).remove_child(STR("n1")));
+
+	CHECK_NODE(doc, STR("<node id=\"1\"><n2 /><n3 /><child><n4 /></child></node>"));
+
+	CHECK(doc.remove_child(STR("node")));
+
+	CHECK_NODE(doc, STR(""));
+}
+
+TEST_XML(dom_node_remove_child_complex_allocated, "<node id='1'><n1 id1='1' id2='2'/><n2/><n3/><child><n4/></child></node>")
+{
+	doc.append_copy(doc.child(STR("node")));
+
+	CHECK(doc.remove_child(STR("node")));
+	CHECK(doc.remove_child(STR("node")));
+
+	CHECK_NODE(doc, STR(""));
+}
+
+TEST_XML(dom_node_prepend_copy, "<node>foo<child/></node>")
+{
+	CHECK(xml_node().prepend_copy(xml_node()) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().prepend_copy(doc.child(STR("node"))) == xml_node());
+	CHECK(doc.prepend_copy(doc) == xml_node());
+	CHECK(doc.prepend_copy(xml_node()) == xml_node());
+	
+	xml_node n1 = doc.child(STR("node")).prepend_copy(doc.child(STR("node")).first_child());
+	CHECK(n1);
+	CHECK_STRING(n1.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node>foofoo<child /></node>"));
+
+	xml_node n2 = doc.child(STR("node")).prepend_copy(doc.child(STR("node")).child(STR("child")));
+	CHECK(n2 && n2 != n1);
+	CHECK_STRING(n2.name(), STR("child"));
+	CHECK_NODE(doc, STR("<node><child />foofoo<child /></node>"));
+
+	xml_node n3 = doc.child(STR("node")).child(STR("child")).prepend_copy(doc.child(STR("node")).first_child().next_sibling());
+	CHECK(n3 && n3 != n1 && n3 != n2);
+	CHECK_STRING(n3.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node><child>foo</child>foofoo<child /></node>"));
+}
+
+TEST_XML(dom_node_append_copy, "<node>foo<child/></node>")
+{
+	CHECK(xml_node().append_copy(xml_node()) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().append_copy(doc.child(STR("node"))) == xml_node());
+	CHECK(doc.append_copy(doc) == xml_node());
+	CHECK(doc.append_copy(xml_node()) == xml_node());
+	
+	xml_node n1 = doc.child(STR("node")).append_copy(doc.child(STR("node")).first_child());
+	CHECK(n1);
+	CHECK_STRING(n1.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node>foo<child />foo</node>"));
+
+	xml_node n2 = doc.child(STR("node")).append_copy(doc.child(STR("node")).child(STR("child")));
+	CHECK(n2 && n2 != n1);
+	CHECK_STRING(n2.name(), STR("child"));
+	CHECK_NODE(doc, STR("<node>foo<child />foo<child /></node>"));
+
+	xml_node n3 = doc.child(STR("node")).child(STR("child")).append_copy(doc.child(STR("node")).first_child());
+	CHECK(n3 && n3 != n1 && n3 != n2);
+	CHECK_STRING(n3.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node>foo<child>foo</child>foo<child /></node>"));
+}
+
+TEST_XML(dom_node_insert_copy_after, "<node>foo<child/></node>")
+{
+	CHECK(xml_node().insert_copy_after(xml_node(), xml_node()) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().insert_copy_after(doc.child(STR("node")), doc.child(STR("node"))) == xml_node());
+	CHECK(doc.insert_copy_after(doc, doc) == xml_node());
+	CHECK(doc.insert_copy_after(xml_node(), doc.child(STR("node"))) == xml_node());
+	CHECK(doc.insert_copy_after(doc.child(STR("node")), xml_node()) == xml_node());
+	
+	xml_node n1 = doc.child(STR("node")).insert_copy_after(doc.child(STR("node")).child(STR("child")), doc.child(STR("node")).first_child());
+	CHECK(n1);
+	CHECK_STRING(n1.name(), STR("child"));
+	CHECK_NODE(doc, STR("<node>foo<child /><child /></node>"));
+
+	xml_node n2 = doc.child(STR("node")).insert_copy_after(doc.child(STR("node")).first_child(), doc.child(STR("node")).last_child());
+	CHECK(n2 && n2 != n1);
+	CHECK_STRING(n2.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node>foo<child /><child />foo</node>"));
+
+	xml_node n3 = doc.child(STR("node")).insert_copy_after(doc.child(STR("node")).first_child(), doc.child(STR("node")).first_child());
+	CHECK(n3 && n3 != n1 && n3 != n2);
+	CHECK_STRING(n3.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node>foofoo<child /><child />foo</node>"));
+}
+
+TEST_XML(dom_node_insert_copy_before, "<node>foo<child/></node>")
+{
+	CHECK(xml_node().insert_copy_before(xml_node(), xml_node()) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().insert_copy_before(doc.child(STR("node")), doc.child(STR("node"))) == xml_node());
+	CHECK(doc.insert_copy_before(doc, doc) == xml_node());
+	CHECK(doc.insert_copy_before(xml_node(), doc.child(STR("node"))) == xml_node());
+	CHECK(doc.insert_copy_before(doc.child(STR("node")), xml_node()) == xml_node());
+	
+	xml_node n1 = doc.child(STR("node")).insert_copy_before(doc.child(STR("node")).child(STR("child")), doc.child(STR("node")).first_child());
+	CHECK(n1);
+	CHECK_STRING(n1.name(), STR("child"));
+	CHECK_NODE(doc, STR("<node><child />foo<child /></node>"));
+
+	xml_node n2 = doc.child(STR("node")).insert_copy_before(doc.child(STR("node")).first_child(), doc.child(STR("node")).last_child());
+	CHECK(n2 && n2 != n1);
+	CHECK_STRING(n2.name(), STR("child"));
+	CHECK_NODE(doc, STR("<node><child />foo<child /><child /></node>"));
+
+	xml_node n3 = doc.child(STR("node")).insert_copy_before(doc.child(STR("node")).first_child().next_sibling(), doc.child(STR("node")).first_child());
+	CHECK(n3 && n3 != n1 && n3 != n2);
+	CHECK_STRING(n3.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node>foo<child />foo<child /><child /></node>"));
+}
+
+TEST_XML(dom_node_copy_recursive, "<node>foo<child/></node>")
+{
+	doc.child(STR("node")).append_copy(doc.child(STR("node")));
+	CHECK_NODE(doc, STR("<node>foo<child /><node>foo<child /></node></node>"));
+}
+
+TEST_XML(dom_node_copy_crossdoc, "<node/>")
+{
+	xml_document newdoc;
+	newdoc.append_copy(doc.child(STR("node")));
+	CHECK_NODE(doc, STR("<node />"));
+	CHECK_NODE(newdoc, STR("<node />"));
+}
+
+TEST_XML(dom_node_copy_crossdoc_attribute, "<node attr='value'/>")
+{
+	xml_document newdoc;
+	newdoc.append_child(STR("copy")).append_copy(doc.child(STR("node")).attribute(STR("attr")));
+	CHECK_NODE(doc, STR("<node attr=\"value\" />"));
+	CHECK_NODE(newdoc, STR("<copy attr=\"value\" />"));
+}
+
+TEST_XML_FLAGS(dom_node_copy_types, "<?xml version='1.0'?><!DOCTYPE id><root><?pi value?><node id='1'>pcdata<![CDATA[cdata]]></node></root>", parse_full)
+{
+	doc.append_copy(doc.child(STR("root")));
+	CHECK_NODE(doc, STR("<?xml version=\"1.0\"?><!DOCTYPE id><root><?pi value?><node id=\"1\">pcdata<![CDATA[cdata]]></node></root><root><?pi value?><node id=\"1\">pcdata<![CDATA[cdata]]></node></root>"));
+
+	doc.insert_copy_before(doc.first_child(), doc.first_child());
+	CHECK_NODE(doc, STR("<?xml version=\"1.0\"?><?xml version=\"1.0\"?><!DOCTYPE id><root><?pi value?><node id=\"1\">pcdata<![CDATA[cdata]]></node></root><root><?pi value?><node id=\"1\">pcdata<![CDATA[cdata]]></node></root>"));
+
+	doc.insert_copy_after(doc.first_child().next_sibling().next_sibling(), doc.first_child());
+	CHECK_NODE(doc, STR("<?xml version=\"1.0\"?><!DOCTYPE id><?xml version=\"1.0\"?><!DOCTYPE id><root><?pi value?><node id=\"1\">pcdata<![CDATA[cdata]]></node></root><root><?pi value?><node id=\"1\">pcdata<![CDATA[cdata]]></node></root>"));
+}
+
+TEST(dom_node_declaration_name)
+{
+	xml_document doc;
+	doc.append_child(node_declaration);
+
+	// name 'xml' is auto-assigned
+	CHECK(doc.first_child().type() == node_declaration);
+	CHECK_STRING(doc.first_child().name(), STR("xml"));
+
+	doc.insert_child_after(node_declaration, doc.first_child());
+	doc.insert_child_before(node_declaration, doc.first_child());
+	doc.prepend_child(node_declaration);
+
+	CHECK_NODE(doc, STR("<?xml?><?xml?><?xml?><?xml?>"));
+}
+
+TEST(dom_node_declaration_attributes)
+{
+ xml_document doc;
+ xml_node node = doc.append_child(node_declaration);
+ node.append_attribute(STR("version")) = STR("1.0");
+ node.append_attribute(STR("encoding")) = STR("utf-8");
+
+ CHECK_NODE(doc, STR("<?xml version=\"1.0\" encoding=\"utf-8\"?>"));
+}
+
+TEST(dom_node_declaration_top_level)
+{
+	xml_document doc;
+	doc.append_child().set_name(STR("node"));
+
+	xml_node node = doc.first_child();
+	node.append_child(node_pcdata).set_value(STR("text"));
+
+	CHECK(node.insert_child_before(node_declaration, node.first_child()) == xml_node());
+	CHECK(node.insert_child_after(node_declaration, node.first_child()) == xml_node());
+	CHECK(node.append_child(node_declaration) == xml_node());
+
+	CHECK_NODE(doc, STR("<node>text</node>"));
+
+	CHECK(doc.insert_child_before(node_declaration, node));
+	CHECK(doc.insert_child_after(node_declaration, node));
+	CHECK(doc.append_child(node_declaration));
+
+	CHECK_NODE(doc, STR("<?xml?><node>text</node><?xml?><?xml?>"));
+}
+
+TEST(dom_node_declaration_copy)
+{
+	xml_document doc;
+	doc.append_child(node_declaration);
+
+	doc.append_child().set_name(STR("node"));
+
+	doc.last_child().append_copy(doc.first_child());
+
+	CHECK_NODE(doc, STR("<?xml?><node />"));
+}
+
+TEST(dom_string_out_of_memory)
+{
+	const unsigned int length = 65536;
+	static char_t string[length + 1];
+
+	for (unsigned int i = 0; i < length; ++i) string[i] = 'a';
+	string[length] = 0;
+
+	xml_document doc;
+	xml_node node = doc.append_child();
+	xml_attribute attr = node.append_attribute(STR("a"));
+	xml_node text = node.append_child(node_pcdata);
+
+	// no value => long value
+	test_runner::_memory_fail_threshold = 32;
+
+	CHECK_ALLOC_FAIL(CHECK(!node.set_name(string)));
+	CHECK_ALLOC_FAIL(CHECK(!text.set_value(string)));
+	CHECK_ALLOC_FAIL(CHECK(!attr.set_name(string)));
+	CHECK_ALLOC_FAIL(CHECK(!attr.set_value(string)));
+
+	// set some names/values
+	test_runner::_memory_fail_threshold = 0;
+
+	node.set_name(STR("n"));
+	attr.set_value(STR("v"));
+	text.set_value(STR("t"));
+
+	// some value => long value
+	test_runner::_memory_fail_threshold = 32;
+
+	CHECK_ALLOC_FAIL(CHECK(!node.set_name(string)));
+	CHECK_ALLOC_FAIL(CHECK(!text.set_value(string)));
+	CHECK_ALLOC_FAIL(CHECK(!attr.set_name(string)));
+	CHECK_ALLOC_FAIL(CHECK(!attr.set_value(string)));
+
+	// check that original state was preserved
+	test_runner::_memory_fail_threshold = 0;
+
+	CHECK_NODE(doc, STR("<n a=\"v\">t</n>"));
+}
+
+TEST(dom_node_out_of_memory)
+{
+	test_runner::_memory_fail_threshold = 65536;
+
+	// exhaust memory limit
+	xml_document doc;
+
+	xml_node n = doc.append_child();
+	CHECK(n.set_name(STR("n")));
+
+	xml_attribute a = n.append_attribute(STR("a"));
+	CHECK(a);
+
+	CHECK_ALLOC_FAIL(while (n.append_child(node_comment)) { /* nop */ });
+	CHECK_ALLOC_FAIL(while (n.append_attribute(STR("b"))) { /* nop */ });
+
+	// verify all node modification operations
+	CHECK_ALLOC_FAIL(CHECK(!n.append_child()));
+	CHECK_ALLOC_FAIL(CHECK(!n.prepend_child()));
+	CHECK_ALLOC_FAIL(CHECK(!n.insert_child_after(node_element, n.first_child())));
+	CHECK_ALLOC_FAIL(CHECK(!n.insert_child_before(node_element, n.first_child())));
+	CHECK_ALLOC_FAIL(CHECK(!n.append_attribute(STR(""))));
+	CHECK_ALLOC_FAIL(CHECK(!n.prepend_attribute(STR(""))));
+	CHECK_ALLOC_FAIL(CHECK(!n.insert_attribute_after(STR(""), a)));
+	CHECK_ALLOC_FAIL(CHECK(!n.insert_attribute_before(STR(""), a)));
+
+	// verify node copy operations
+	CHECK_ALLOC_FAIL(CHECK(!n.append_copy(n.first_child())));
+	CHECK_ALLOC_FAIL(CHECK(!n.prepend_copy(n.first_child())));
+	CHECK_ALLOC_FAIL(CHECK(!n.insert_copy_after(n.first_child(), n.first_child())));
+	CHECK_ALLOC_FAIL(CHECK(!n.insert_copy_before(n.first_child(), n.first_child())));
+	CHECK_ALLOC_FAIL(CHECK(!n.append_copy(a)));
+	CHECK_ALLOC_FAIL(CHECK(!n.prepend_copy(a)));
+	CHECK_ALLOC_FAIL(CHECK(!n.insert_copy_after(a, a)));
+	CHECK_ALLOC_FAIL(CHECK(!n.insert_copy_before(a, a)));
+}
+
+TEST(dom_node_memory_limit)
+{
+	const unsigned int length = 65536;
+	static char_t string[length + 1];
+
+	for (unsigned int i = 0; i < length; ++i) string[i] = 'a';
+	string[length] = 0;
+
+	test_runner::_memory_fail_threshold = 32768 * 2 + sizeof(string);
+
+	xml_document doc;
+
+	for (int j = 0; j < 32; ++j)
+	{
+		CHECK(doc.append_child().set_name(string));
+		CHECK(doc.remove_child(doc.first_child()));
+	}
+}
+
+TEST(dom_node_memory_limit_pi)
+{
+	const unsigned int length = 65536;
+	static char_t string[length + 1];
+
+	for (unsigned int i = 0; i < length; ++i) string[i] = 'a';
+	string[length] = 0;
+
+	test_runner::_memory_fail_threshold = 32768 * 2 + sizeof(string);
+
+	xml_document doc;
+
+	for (int j = 0; j < 32; ++j)
+	{
+		CHECK(doc.append_child(node_pi).set_value(string));
+		CHECK(doc.remove_child(doc.first_child()));
+	}
+}
+
+TEST(dom_node_doctype_top_level)
+{
+	xml_document doc;
+	doc.append_child().set_name(STR("node"));
+
+	xml_node node = doc.first_child();
+	node.append_child(node_pcdata).set_value(STR("text"));
+
+	CHECK(node.insert_child_before(node_doctype, node.first_child()) == xml_node());
+	CHECK(node.insert_child_after(node_doctype, node.first_child()) == xml_node());
+	CHECK(node.append_child(node_doctype) == xml_node());
+
+	CHECK_NODE(doc, STR("<node>text</node>"));
+
+	CHECK(doc.insert_child_before(node_doctype, node));
+	CHECK(doc.insert_child_after(node_doctype, node));
+	CHECK(doc.append_child(node_doctype));
+
+	CHECK_NODE(doc, STR("<!DOCTYPE><node>text</node><!DOCTYPE><!DOCTYPE>"));
+}
+
+TEST(dom_node_doctype_copy)
+{
+	xml_document doc;
+	doc.append_child(node_doctype);
+
+	doc.append_child().set_name(STR("node"));
+
+	doc.last_child().append_copy(doc.first_child());
+
+	CHECK_NODE(doc, STR("<!DOCTYPE><node />"));
+}
+
+TEST(dom_node_doctype_value)
+{
+ xml_document doc;
+ xml_node node = doc.append_child(node_doctype);
+
+ CHECK(node.type() == node_doctype);
+ CHECK_STRING(node.value(), STR(""));
+ CHECK_NODE(node, STR("<!DOCTYPE>"));
+
+ CHECK(node.set_value(STR("id [ foo ]")));
+ CHECK_NODE(node, STR("<!DOCTYPE id [ foo ]>"));
+}
+
+TEST_XML(dom_node_append_buffer_native, "<node>test</node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	const char_t data1[] = STR("<child1 id='1' /><child2>text</child2>");
+	const char_t data2[] = STR("<child3 />");
+
+	CHECK(node.append_buffer(data1, sizeof(data1)));
+	CHECK(node.append_buffer(data2, sizeof(data2)));
+	CHECK(node.append_buffer(data1, sizeof(data1)));
+	CHECK(node.append_buffer(data2, sizeof(data2)));
+	CHECK(node.append_buffer(data2, sizeof(data2)));
+
+	CHECK_NODE(doc, STR("<node>test<child1 id=\"1\" /><child2>text</child2><child3 /><child1 id=\"1\" /><child2>text</child2><child3 /><child3 /></node>"));
+}
+
+TEST_XML(dom_node_append_buffer_convert, "<node>test</node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	const char data[] = {0, 0, 0, '<', 0, 0, 0, 'n', 0, 0, 0, '/', 0, 0, 0, '>'};
+
+	CHECK(node.append_buffer(data, sizeof(data)));
+	CHECK(node.append_buffer(data, sizeof(data), parse_default, encoding_utf32_be));
+
+	CHECK_NODE(doc, STR("<node>test<n /><n /></node>"));
+}
+
+
+TEST_XML(dom_node_append_buffer_remove, "<node>test</node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	const char data1[] = "<child1 id='1' /><child2>text</child2>";
+	const char data2[] = "<child3 />";
+
+	CHECK(node.append_buffer(data1, sizeof(data1)));
+	CHECK(node.append_buffer(data2, sizeof(data2)));
+	CHECK(node.append_buffer(data1, sizeof(data1)));
+	CHECK(node.append_buffer(data2, sizeof(data2)));
+
+	CHECK_NODE(doc, STR("<node>test<child1 id=\"1\" /><child2>text</child2><child3 /><child1 id=\"1\" /><child2>text</child2><child3 /></node>"));
+
+	while (node.remove_child(STR("child2"))) {}
+
+	CHECK_NODE(doc, STR("<node>test<child1 id=\"1\" /><child3 /><child1 id=\"1\" /><child3 /></node>"));
+
+	while (node.remove_child(STR("child1"))) {}
+
+	CHECK_NODE(doc, STR("<node>test<child3 /><child3 /></node>"));
+
+	while (node.remove_child(STR("child3"))) {}
+
+	CHECK_NODE(doc, STR("<node>test</node>"));
+
+	CHECK(doc.remove_child(STR("node")));
+
+	CHECK(!doc.first_child());
+}
+
+TEST(dom_node_append_buffer_empty_document)
+{
+	xml_document doc;
+
+	const char data[] = "<child1 id='1' /><child2>text</child2>";
+
+	doc.append_buffer(data, sizeof(data));
+
+	CHECK_NODE(doc, STR("<child1 id=\"1\" /><child2>text</child2>"));
+}
+
+TEST_XML(dom_node_append_buffer_invalid_type, "<node>test</node>")
+{
+	const char data[] = "<child1 id='1' /><child2>text</child2>";
+
+	CHECK(xml_node().append_buffer(data, sizeof(data)).status == status_append_invalid_root);
+	CHECK(doc.first_child().first_child().append_buffer(data, sizeof(data)).status == status_append_invalid_root);
+}
+
+TEST_XML(dom_node_append_buffer_close_external, "<node />")
+{
+	xml_node node = doc.child(STR("node"));
+
+	const char data[] = "<child1 /></node><child2 />";
+
+	CHECK(node.append_buffer(data, sizeof(data)).status == status_end_element_mismatch);
+	CHECK_NODE(doc, STR("<node><child1 /></node>"));
+
+	CHECK(node.append_buffer(data, sizeof(data)).status == status_end_element_mismatch);
+	CHECK_NODE(doc, STR("<node><child1 /><child1 /></node>"));
+}
+
+TEST(dom_node_append_buffer_out_of_memory_extra)
+{
+	test_runner::_memory_fail_threshold = 1;
+
+	xml_document doc;
+	CHECK_ALLOC_FAIL(CHECK(doc.append_buffer("<n/>", 4).status == status_out_of_memory));
+	CHECK(!doc.first_child());
+}
+
+TEST(dom_node_append_buffer_out_of_memory_buffer)
+{
+	test_runner::_memory_fail_threshold = 32768 + 128;
+
+	char data[128] = {0};
+
+	xml_document doc;
+	CHECK_ALLOC_FAIL(CHECK(doc.append_buffer(data, sizeof(data)).status == status_out_of_memory));
+	CHECK(!doc.first_child());
+}
+
+TEST(dom_node_append_buffer_out_of_memory_nodes)
+{
+	unsigned int count = 4000;
+	std::basic_string<char_t> data;
+
+	for (unsigned int i = 0; i < count; ++i)
+		data += STR("<a/>");
+
+	test_runner::_memory_fail_threshold = 32768 + 128 + data.length() * sizeof(char_t) + 32;
+
+#ifdef PUGIXML_COMPACT
+	// ... and some space for hash table
+	test_runner::_memory_fail_threshold += 2048;
+#endif
+
+	xml_document doc;
+	CHECK_ALLOC_FAIL(CHECK(doc.append_buffer(data.c_str(), data.length() * sizeof(char_t), parse_fragment).status == status_out_of_memory));
+
+	unsigned int valid = 0;
+
+	for (xml_node n = doc.first_child(); n; n = n.next_sibling())
+	{
+		CHECK_STRING(n.name(), STR("a"));
+		valid++;
+	}
+
+	CHECK(valid > 0 && valid < count);
+}
+
+TEST(dom_node_append_buffer_out_of_memory_name)
+{
+	test_runner::_memory_fail_threshold = 32768 + 4096;
+
+	char data[4096] = {0};
+
+	xml_document doc;
+	CHECK(doc.append_child(STR("root")));
+	CHECK_ALLOC_FAIL(CHECK(doc.first_child().append_buffer(data, sizeof(data)).status == status_out_of_memory));
+	CHECK_STRING(doc.first_child().name(), STR("root"));
+}
+
+TEST_XML(dom_node_append_buffer_fragment, "<node />")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.append_buffer("1", 1).status == status_no_document_element);
+	CHECK_NODE(doc, STR("<node>1</node>"));
+
+	CHECK(node.append_buffer("2", 1, parse_fragment));
+	CHECK_NODE(doc, STR("<node>12</node>"));
+
+	CHECK(node.append_buffer("3", 1).status == status_no_document_element);
+	CHECK_NODE(doc, STR("<node>123</node>"));
+
+	CHECK(node.append_buffer("4", 1, parse_fragment));
+	CHECK_NODE(doc, STR("<node>1234</node>"));
+}
+
+TEST_XML(dom_node_append_buffer_empty, "<node />")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.append_buffer("", 0).status == status_no_document_element);
+	CHECK(node.append_buffer("", 0, parse_fragment).status == status_ok);
+
+	CHECK(node.append_buffer(0, 0).status == status_no_document_element);
+	CHECK(node.append_buffer(0, 0, parse_fragment).status == status_ok);
+
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST_XML(dom_node_prepend_move, "<node>foo<child/></node>")
+{
+	xml_node child = doc.child(STR("node")).child(STR("child"));
+
+	CHECK(xml_node().prepend_move(xml_node()) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().prepend_move(child) == xml_node());
+	CHECK(doc.prepend_move(doc) == xml_node());
+	CHECK(doc.prepend_move(xml_node()) == xml_node());
+
+	xml_node n1 = doc.child(STR("node")).prepend_move(doc.child(STR("node")).first_child());
+	CHECK(n1 && n1 == doc.child(STR("node")).first_child());
+	CHECK_STRING(n1.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node>foo<child /></node>"));
+
+	xml_node n2 = doc.child(STR("node")).prepend_move(doc.child(STR("node")).child(STR("child")));
+	CHECK(n2 && n2 != n1 && n2 == child);
+	CHECK_STRING(n2.name(), STR("child"));
+	CHECK_NODE(doc, STR("<node><child />foo</node>"));
+
+	xml_node n3 = doc.child(STR("node")).child(STR("child")).prepend_move(doc.child(STR("node")).first_child().next_sibling());
+	CHECK(n3 && n3 == n1 && n3 != n2);
+	CHECK_STRING(n3.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node><child>foo</child></node>"));
+}
+
+TEST_XML(dom_node_append_move, "<node>foo<child/></node>")
+{
+	xml_node child = doc.child(STR("node")).child(STR("child"));
+
+	CHECK(xml_node().append_move(xml_node()) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().append_move(child) == xml_node());
+	CHECK(doc.append_move(doc) == xml_node());
+	CHECK(doc.append_move(xml_node()) == xml_node());
+
+	xml_node n1 = doc.child(STR("node")).append_move(doc.child(STR("node")).first_child());
+	CHECK(n1 && n1 == doc.child(STR("node")).last_child());
+	CHECK_STRING(n1.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node><child />foo</node>"));
+
+	xml_node n2 = doc.child(STR("node")).append_move(doc.child(STR("node")).last_child());
+	CHECK(n2 && n2 == n1);
+	CHECK_STRING(n2.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node><child />foo</node>"));
+
+	xml_node n3 = doc.child(STR("node")).child(STR("child")).append_move(doc.child(STR("node")).last_child());
+	CHECK(n3 && n3 == n1 && n3 == n2);
+	CHECK_STRING(n3.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node><child>foo</child></node>"));
+}
+
+TEST_XML(dom_node_insert_move_after, "<node>foo<child>bar</child></node>")
+{
+	xml_node child = doc.child(STR("node")).child(STR("child"));
+
+	CHECK(xml_node().insert_move_after(xml_node(), xml_node()) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().insert_move_after(doc.child(STR("node")), doc.child(STR("node"))) == xml_node());
+	CHECK(doc.insert_move_after(doc, doc) == xml_node());
+	CHECK(doc.insert_move_after(xml_node(), doc.child(STR("node"))) == xml_node());
+	CHECK(doc.insert_move_after(doc.child(STR("node")), xml_node()) == xml_node());
+
+	xml_node n1 = doc.child(STR("node")).insert_move_after(child, doc.child(STR("node")).first_child());
+	CHECK(n1 && n1 == child);
+	CHECK_STRING(n1.name(), STR("child"));
+	CHECK_NODE(doc, STR("<node>foo<child>bar</child></node>"));
+
+	xml_node n2 = doc.child(STR("node")).insert_move_after(doc.child(STR("node")).first_child(), child);
+	CHECK(n2 && n2 != n1);
+	CHECK_STRING(n2.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node><child>bar</child>foo</node>"));
+
+	xml_node n3 = child.insert_move_after(doc.child(STR("node")).last_child(), child.first_child());
+	CHECK(n3 && n3 != n1 && n3 == n2);
+	CHECK_STRING(n3.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node><child>barfoo</child></node>"));
+}
+
+TEST_XML(dom_node_insert_move_before, "<node>foo<child>bar</child></node>")
+{
+	xml_node child = doc.child(STR("node")).child(STR("child"));
+
+	CHECK(xml_node().insert_move_before(xml_node(), xml_node()) == xml_node());
+	CHECK(doc.child(STR("node")).first_child().insert_move_before(doc.child(STR("node")), doc.child(STR("node"))) == xml_node());
+	CHECK(doc.insert_move_before(doc, doc) == xml_node());
+	CHECK(doc.insert_move_before(xml_node(), doc.child(STR("node"))) == xml_node());
+	CHECK(doc.insert_move_before(doc.child(STR("node")), xml_node()) == xml_node());
+
+	xml_node n1 = doc.child(STR("node")).insert_move_before(child, doc.child(STR("node")).first_child());
+	CHECK(n1 && n1 == child);
+	CHECK_STRING(n1.name(), STR("child"));
+	CHECK_NODE(doc, STR("<node><child>bar</child>foo</node>"));
+
+	xml_node n2 = doc.child(STR("node")).insert_move_before(doc.child(STR("node")).last_child(), child);
+	CHECK(n2 && n2 != n1);
+	CHECK_STRING(n2.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node>foo<child>bar</child></node>"));
+
+	xml_node n3 = child.insert_move_before(doc.child(STR("node")).first_child(), child.first_child());
+	CHECK(n3 && n3 != n1 && n3 == n2);
+	CHECK_STRING(n3.value(), STR("foo"));
+	CHECK_NODE(doc, STR("<node><child>foobar</child></node>"));
+}
+
+TEST_XML(dom_node_move_recursive, "<root><node>foo<child/></node></root>")
+{
+	xml_node root = doc.child(STR("root"));
+	xml_node node = root.child(STR("node"));
+	xml_node foo = node.first_child();
+	xml_node child = node.last_child();
+
+	CHECK(node.prepend_move(node) == xml_node());
+	CHECK(node.prepend_move(root) == xml_node());
+
+	CHECK(node.append_move(node) == xml_node());
+	CHECK(node.append_move(root) == xml_node());
+
+	CHECK(node.insert_move_before(node, foo) == xml_node());
+	CHECK(node.insert_move_before(root, foo) == xml_node());
+
+	CHECK(node.insert_move_after(node, foo) == xml_node());
+	CHECK(node.insert_move_after(root, foo) == xml_node());
+
+	CHECK(child.append_move(node) == xml_node());
+
+	CHECK_NODE(doc, STR("<root><node>foo<child /></node></root>"));
+}
+
+TEST_XML(dom_node_move_marker, "<node />")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(doc.insert_move_before(node, node) == xml_node());
+	CHECK(doc.insert_move_after(node, node) == xml_node());
+
+	CHECK_NODE(doc, STR("<node />"));
+}
+
+TEST_XML(dom_node_move_crossdoc, "<node/>")
+{
+	xml_document newdoc;
+	CHECK(newdoc.append_move(doc.child(STR("node"))) == xml_node());
+	CHECK_NODE(newdoc, STR(""));
+}
+
+TEST_XML(dom_node_move_tree, "<root><n1 a1='v1'><c1/>t1</n1><n2 a2='v2'><c2/>t2</n2><n3 a3='v3'><c3/>t3</n3><n4 a4='v4'><c4/>t4</n4></root>")
+{
+	xml_node root = doc.child(STR("root"));
+	xml_node n1 = root.child(STR("n1"));
+	xml_node n2 = root.child(STR("n2"));
+	xml_node n3 = root.child(STR("n3"));
+	xml_node n4 = root.child(STR("n4"));
+
+	// n2 n1 n3 n4
+	CHECK(n2 == root.prepend_move(n2));
+
+	// n2 n3 n4 n1
+	CHECK(n1 == root.append_move(n1));
+
+	// n2 n4 n3 n1
+	CHECK(n4 == root.insert_move_before(n4, n3));
+
+	// n2 n4 n1 + n3
+	CHECK(n3 == doc.insert_move_after(n3, root));
+
+	CHECK_NODE(doc, STR("<root><n2 a2=\"v2\"><c2 />t2</n2><n4 a4=\"v4\"><c4 />t4</n4><n1 a1=\"v1\"><c1 />t1</n1></root><n3 a3=\"v3\"><c3 />t3</n3>"));
+
+	CHECK(n1 == root.child(STR("n1")));
+	CHECK(n2 == root.child(STR("n2")));
+	CHECK(n3 == doc.child(STR("n3")));
+	CHECK(n4 == root.child(STR("n4")));
+}
+
+TEST(dom_node_copy_stackless)
+{
+	unsigned int count = 20000;
+	std::basic_string<char_t> data;
+
+	for (unsigned int i = 0; i < count; ++i)
+		data += STR("<a>");
+
+	data += STR("text");
+
+	for (unsigned int j = 0; j < count; ++j)
+		data += STR("</a>");
+
+	xml_document doc;
+	CHECK(doc.load_string(data.c_str()));
+
+	xml_document copy;
+	CHECK(copy.append_copy(doc.first_child()));
+
+	CHECK_NODE(doc, data.c_str());
+}
+
+TEST(dom_node_copy_copyless)
+{
+	std::basic_string<char_t> data;
+	data += STR("<node>");
+	for (int i = 0; i < 10000; ++i)
+		data += STR("pcdata");
+	data += STR("<?name value?><child attr1=\"\" attr2=\"value2\" /></node>");
+
+	std::basic_string<char_t> datacopy = data;
+
+	// the document is parsed in-place so there should only be 1 page worth of allocations
+	test_runner::_memory_fail_threshold = 32768 + 128;
+
+#ifdef PUGIXML_COMPACT
+	// ... and some space for hash table
+	test_runner::_memory_fail_threshold += 2048;
+#endif
+
+	xml_document doc;
+	CHECK(doc.load_buffer_inplace(&datacopy[0], datacopy.size() * sizeof(char_t), parse_full));
+
+	// this copy should share all string storage; since there are not a lot of nodes we should not have *any* allocations here (everything will fit in the same page in the document)
+	xml_node copy = doc.append_copy(doc.child(STR("node")));
+	xml_node copy2 = doc.append_copy(copy);
+
+	CHECK_NODE(copy, data.c_str());
+	CHECK_NODE(copy2, data.c_str());
+}
+
+TEST(dom_node_copy_copyless_mix)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node>pcdata<?name value?><child attr1=\"\" attr2=\"value2\" /></node>"), parse_full));
+
+	xml_node child = doc.child(STR("node")).child(STR("child"));
+
+	child.set_name(STR("copychild"));
+	child.attribute(STR("attr2")).set_name(STR("copyattr2"));
+	child.attribute(STR("attr1")).set_value(STR("copyvalue1"));
+
+	std::basic_string<char_t> data;
+	for (int i = 0; i < 10000; ++i)
+		data += STR("pcdata");
+
+	doc.child(STR("node")).text().set(data.c_str());
+
+	xml_node copy = doc.append_copy(doc.child(STR("node")));
+	xml_node copy2 = doc.append_copy(copy);
+
+	std::basic_string<char_t> dataxml;
+	dataxml += STR("<node>");
+	dataxml += data;
+	dataxml += STR("<?name value?><copychild attr1=\"copyvalue1\" copyattr2=\"value2\" /></node>");
+
+	CHECK_NODE(copy, dataxml.c_str());
+	CHECK_NODE(copy2, dataxml.c_str());
+}
+
+TEST_XML(dom_node_copy_copyless_taint, "<node attr=\"value\" />")
+{
+	xml_node node = doc.child(STR("node"));
+	xml_node copy = doc.append_copy(node);
+
+	CHECK_NODE(doc, STR("<node attr=\"value\" /><node attr=\"value\" />"));
+
+	node.set_name(STR("nod1"));
+
+	CHECK_NODE(doc, STR("<nod1 attr=\"value\" /><node attr=\"value\" />"));
+
+	xml_node copy2 = doc.append_copy(copy);
+
+	CHECK_NODE(doc, STR("<nod1 attr=\"value\" /><node attr=\"value\" /><node attr=\"value\" />"));
+
+	copy.attribute(STR("attr")).set_value(STR("valu2"));
+
+	CHECK_NODE(doc, STR("<nod1 attr=\"value\" /><node attr=\"valu2\" /><node attr=\"value\" />"));
+
+	copy2.attribute(STR("attr")).set_name(STR("att3"));
+
+	CHECK_NODE(doc, STR("<nod1 attr=\"value\" /><node attr=\"valu2\" /><node att3=\"value\" />"));
+}
+
+TEST(dom_node_copy_attribute_copyless)
+{
+	std::basic_string<char_t> data;
+	data += STR("<node attr=\"");
+	for (int i = 0; i < 10000; ++i)
+		data += STR("data");
+	data += STR("\" />");
+
+	std::basic_string<char_t> datacopy = data;
+
+	// the document is parsed in-place so there should only be 1 page worth of allocations
+	test_runner::_memory_fail_threshold = 32768 + 128;
+
+#ifdef PUGIXML_COMPACT
+	// ... and some space for hash table
+	test_runner::_memory_fail_threshold += 2048;
+#endif
+
+	xml_document doc;
+	CHECK(doc.load_buffer_inplace(&datacopy[0], datacopy.size() * sizeof(char_t), parse_full));
+
+	// this copy should share all string storage; since there are not a lot of nodes we should not have *any* allocations here (everything will fit in the same page in the document)
+	xml_node copy1 = doc.append_child(STR("node"));
+	copy1.append_copy(doc.first_child().first_attribute());
+
+	xml_node copy2 = doc.append_child(STR("node"));
+	copy2.append_copy(copy1.first_attribute());
+
+	CHECK_NODE(copy1, data.c_str());
+	CHECK_NODE(copy2, data.c_str());
+}
+
+TEST_XML(dom_node_copy_attribute_copyless_taint, "<node attr=\"value\" />")
+{
+	xml_node node = doc.child(STR("node"));
+	xml_attribute attr = node.first_attribute();
+
+	xml_node copy1 = doc.append_child(STR("copy1"));
+	xml_node copy2 = doc.append_child(STR("copy2"));
+	xml_node copy3 = doc.append_child(STR("copy3"));
+
+	CHECK_NODE(doc, STR("<node attr=\"value\" /><copy1 /><copy2 /><copy3 />"));
+
+	copy1.append_copy(attr);
+
+	CHECK_NODE(doc, STR("<node attr=\"value\" /><copy1 attr=\"value\" /><copy2 /><copy3 />"));
+
+	attr.set_name(STR("att1"));
+	copy2.append_copy(attr);
+
+	CHECK_NODE(doc, STR("<node att1=\"value\" /><copy1 attr=\"value\" /><copy2 att1=\"value\" /><copy3 />"));
+
+	copy1.first_attribute().set_value(STR("valu2"));
+	copy3.append_copy(copy1.first_attribute());
+
+	CHECK_NODE(doc, STR("<node att1=\"value\" /><copy1 attr=\"valu2\" /><copy2 att1=\"value\" /><copy3 attr=\"valu2\" />"));
+}
+
+TEST_XML(dom_node_copy_out_of_memory_node, "<node><child1 /><child2 /><child3>text1<child4 />text2</child3></node>")
+{
+	test_runner::_memory_fail_threshold = 32768 * 2 + 4096;
+
+	xml_document copy;
+	CHECK_ALLOC_FAIL(for (int i = 0; i < 1000; ++i) copy.append_copy(doc.first_child()));
+}
+
+TEST_XML(dom_node_copy_out_of_memory_attr, "<node attr1='' attr2='' attr3='' attr4='' attr5='' attr6='' attr7='' attr8='' attr9='' attr10='' attr11='' attr12='' attr13='' attr14='' attr15='' />")
+{
+	test_runner::_memory_fail_threshold = 32768 * 2 + 4096;
+
+	xml_document copy;
+	CHECK_ALLOC_FAIL(for (int i = 0; i < 1000; ++i) copy.append_copy(doc.first_child()));
+}
+
+TEST_XML(dom_node_remove_deallocate, "<node attr='value'>text</node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	xml_attribute attr = node.attribute(STR("attr"));
+	attr.set_name(STR("longattr"));
+	attr.set_value(STR("longvalue"));
+
+	node.set_name(STR("longnode"));
+	node.text().set(STR("longtext"));
+
+	node.remove_attribute(attr);
+	doc.remove_child(node);
+
+	CHECK_NODE(doc, STR(""));
+}
+
+TEST_XML(dom_node_set_deallocate, "<node attr='value'>text</node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	xml_attribute attr = node.attribute(STR("attr"));
+
+	attr.set_name(STR("longattr"));
+	attr.set_value(STR("longvalue"));
+	node.set_name(STR("longnode"));
+
+	attr.set_name(STR(""));
+	attr.set_value(STR(""));
+	node.set_name(STR(""));
+	node.text().set(STR(""));
+
+	CHECK_NODE(doc, STR("<:anonymous :anonymous=\"\"></:anonymous>"));
+}
+
+TEST(dom_node_copy_declaration_empty_name)
+{
+	xml_document doc1;
+	xml_node decl1 = doc1.append_child(node_declaration);
+	decl1.set_name(STR(""));
+
+	xml_document doc2;
+	xml_node decl2 = doc2.append_copy(decl1);
+
+	CHECK_STRING(decl2.name(), STR(""));
+}
+
+template <typename T> bool fp_equal(T lhs, T rhs)
+{
+	// Several compilers compare float/double values on x87 stack without proper rounding
+	// This causes roundtrip tests to fail, although they correctly preserve the data.
+#if (defined(_MSC_VER) && _MSC_VER < 1400) || defined(__MWERKS__)
+	return memcmp(&lhs, &rhs, sizeof(T)) == 0;
+#else
+	return lhs == rhs;
+#endif
+}
+
+TEST(dom_fp_roundtrip_min_max_float)
+{
+	xml_document doc;
+	xml_node node = doc.append_child(STR("node"));
+	xml_attribute attr = node.append_attribute(STR("attr"));
+
+	node.text().set(std::numeric_limits<float>::min());
+	CHECK(fp_equal(node.text().as_float(), std::numeric_limits<float>::min()));
+
+	attr.set_value(std::numeric_limits<float>::max());
+	CHECK(fp_equal(attr.as_float(), std::numeric_limits<float>::max()));
+}
+
+TEST(dom_fp_roundtrip_min_max_double)
+{
+	xml_document doc;
+	xml_node node = doc.append_child(STR("node"));
+	xml_attribute attr = node.append_attribute(STR("attr"));
+
+	attr.set_value(std::numeric_limits<double>::min());
+	CHECK(fp_equal(attr.as_double(), std::numeric_limits<double>::min()));
+
+	node.text().set(std::numeric_limits<double>::max());
+	CHECK(fp_equal(node.text().as_double(), std::numeric_limits<double>::max()));
+}
+
+const double fp_roundtrip_base[] =
+{
+	0.31830988618379067154,
+	0.43429448190325182765,
+	0.57721566490153286061,
+	0.69314718055994530942,
+	0.70710678118654752440,
+	0.78539816339744830962,
+};
+
+TEST(dom_fp_roundtrip_float)
+{
+	xml_document doc;
+
+	for (int e = -125; e <= 128; ++e)
+	{
+		for (size_t i = 0; i < sizeof(fp_roundtrip_base) / sizeof(fp_roundtrip_base[0]); ++i)
+		{
+			float value = ldexpf(static_cast<float>(fp_roundtrip_base[i]), e);
+
+			doc.text().set(value);
+			CHECK(fp_equal(doc.text().as_float(), value));
+		}
+	}
+}
+
+// Borland C does not print double values with enough precision
+#ifndef __BORLANDC__
+TEST(dom_fp_roundtrip_double)
+{
+	xml_document doc;
+
+	for (int e = -1021; e <= 1024; ++e)
+	{
+		for (size_t i = 0; i < sizeof(fp_roundtrip_base) / sizeof(fp_roundtrip_base[0]); ++i)
+		{
+		#if (defined(_MSC_VER) && _MSC_VER < 1400) || defined(__MWERKS__)
+			// Not all runtime libraries guarantee roundtripping for denormals
+			if (e == -1021 && fp_roundtrip_base[i] < 0.5)
+				continue;
+		#endif
+
+		#ifdef __DMC__
+			// Digital Mars C does not roundtrip on exactly one combination
+			if (e == -12 && i == 1)
+				continue;
+		#endif
+
+			double value = ldexp(fp_roundtrip_base[i], e);
+
+			doc.text().set(value);
+			CHECK(fp_equal(doc.text().as_double(), value));
+		}
+	}
+}
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_dom_text.cpp Added

@@ -0,0 +1,381 @@
+#include "common.hpp"
+
+#include "helpers.hpp"
+
+TEST_XML_FLAGS(dom_text_empty, "<node><a>foo</a><![CDATA[bar]]><c><?pi value?></c><d/></node>", parse_default | parse_pi)
+{
+ xml_node node = doc.child(STR("node"));
+
+ CHECK(node.child(STR("a")).text());
+ CHECK(node.child(STR("b")).text());
+ CHECK(!node.child(STR("c")).text());
+ CHECK(!node.child(STR("d")).text());
+ CHECK(!xml_node().text());
+ CHECK(!xml_text());
+
+ generic_empty_test(node.child(STR("a")).text());
+}
+
+TEST_XML(dom_text_bool_ops, "<node>foo</node>")
+{
+ generic_bool_ops_test(doc.child(STR("node")).text());
+}
+
+TEST_XML_FLAGS(dom_text_get, "<node><a>foo</a><node/><![CDATA[bar]]><c><?pi value?></c><d/></node>", parse_default | parse_pi)
+{
+ xml_node node = doc.child(STR("node"));
+
+ CHECK_STRING(node.child(STR("a")).text().get(), STR("foo"));
+ CHECK_STRING(node.child(STR("a")).first_child().text().get(), STR("foo"));
+
+ CHECK_STRING(node.child(STR("b")).text().get(), STR("bar"));
+ CHECK_STRING(node.child(STR("b")).last_child().text().get(), STR("bar"));
+
+ CHECK_STRING(node.child(STR("c")).text().get(), STR(""));
+ CHECK_STRING(node.child(STR("c")).first_child().text().get(), STR(""));
+
+ CHECK_STRING(node.child(STR("d")).text().get(), STR(""));
+
+ CHECK_STRING(xml_node().text().get(), STR(""));
+}
+
+TEST_XML_FLAGS(dom_text_as_string, "<node><a>foo</a><node/><![CDATA[bar]]><c><?pi value?></c><d/></node>", parse_default | parse_pi)
+{
+ xml_node node = doc.child(STR("node"));
+
+ CHECK_STRING(node.child(STR("a")).text().as_string(), STR("foo"));
+ CHECK_STRING(node.child(STR("a")).first_child().text().as_string(), STR("foo"));
+
+ CHECK_STRING(node.child(STR("b")).text().as_string(), STR("bar"));
+ CHECK_STRING(node.child(STR("b")).last_child().text().as_string(), STR("bar"));
+
+ CHECK_STRING(node.child(STR("c")).text().as_string(), STR(""));
+ CHECK_STRING(node.child(STR("c")).first_child().text().as_string(), STR(""));
+
+ CHECK_STRING(node.child(STR("d")).text().as_string(), STR(""));
+
+ CHECK_STRING(xml_node().text().as_string(), STR(""));
+}
+
+TEST_XML(dom_text_as_int, "<node><text1>1</text1><text2>-1</text2><text3>-2147483648</text3><text4>2147483647</text4><text5>0</text5></node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(xml_text().as_int() == 0);
+	CHECK(node.child(STR("text1")).text().as_int() == 1);
+	CHECK(node.child(STR("text2")).text().as_int() == -1);
+	CHECK(node.child(STR("text3")).text().as_int() == -2147483647 - 1);
+	CHECK(node.child(STR("text4")).text().as_int() == 2147483647);
+ CHECK(node.child(STR("text5")).text().as_int() == 0);
+}
+
+TEST_XML(dom_text_as_int_hex, "<node><text1>0777</text1><text2>0x5ab</text2><text3>0XFf</text3><text4>-0x20</text4><text5>-0x80000000</text5><text6>0x</text6></node>")
+{
+ xml_node node = doc.child(STR("node"));
+
+ CHECK(node.child(STR("text1")).text().as_int() == 777); // no octal support! intentional
+ CHECK(node.child(STR("text2")).text().as_int() == 1451);
+ CHECK(node.child(STR("text3")).text().as_int() == 255);
+ CHECK(node.child(STR("text4")).text().as_int() == -32);
+ CHECK(node.child(STR("text5")).text().as_int() == -2147483647 - 1);
+ CHECK(node.child(STR("text6")).text().as_int() == 0);
+}
+
+TEST_XML(dom_text_as_uint, "<node><text1>0</text1><text2>1</text2><text3>2147483647</text3><text4>4294967295</text4><text5>0</text5></node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(xml_text().as_uint() == 0);
+	CHECK(node.child(STR("text1")).text().as_uint() == 0);
+	CHECK(node.child(STR("text2")).text().as_uint() == 1);
+	CHECK(node.child(STR("text3")).text().as_uint() == 2147483647);
+	CHECK(node.child(STR("text4")).text().as_uint() == 4294967295u);
+ CHECK(node.child(STR("text5")).text().as_uint() == 0);
+}
+
+TEST_XML(dom_text_as_uint_hex, "<node><text1>0777</text1><text2>0x5ab</text2><text3>0XFf</text3><text4>0x20</text4><text5>0xFFFFFFFF</text5><text6>0x</text6></node>")
+{
+ xml_node node = doc.child(STR("node"));
+
+ CHECK(node.child(STR("text1")).text().as_uint() == 777); // no octal support! intentional
+ CHECK(node.child(STR("text2")).text().as_uint() == 1451);
+ CHECK(node.child(STR("text3")).text().as_uint() == 255);
+ CHECK(node.child(STR("text4")).text().as_uint() == 32);
+ CHECK(node.child(STR("text5")).text().as_uint() == 4294967295u);
+ CHECK(node.child(STR("text6")).text().as_uint() == 0);
+}
+
+TEST_XML(dom_text_as_integer_space, "<node><text1> \t\n1234</text1><text2>\n\t 0x123</text2><text3>- 16</text3><text4>- 0x10</text4></node>")
+{
+ xml_node node = doc.child(STR("node"));
+
+ CHECK(node.child(STR("text1")).text().as_int() == 1234);
+ CHECK(node.child(STR("text2")).text().as_int() == 291);
+ CHECK(node.child(STR("text3")).text().as_int() == 0);
+ CHECK(node.child(STR("text4")).text().as_int() == 0);
+}
+
+TEST_XML(dom_text_as_float, "<node><text1>0</text1><text2>1</text2><text3>0.12</text3><text4>-5.1</text4><text5>3e-4</text5><text6>3.14159265358979323846</text6></node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(xml_text().as_float() == 0);
+	CHECK_DOUBLE(node.child(STR("text1")).text().as_float(), 0);
+	CHECK_DOUBLE(node.child(STR("text2")).text().as_float(), 1);
+	CHECK_DOUBLE(node.child(STR("text3")).text().as_float(), 0.12);
+	CHECK_DOUBLE(node.child(STR("text4")).text().as_float(), -5.1);
+	CHECK_DOUBLE(node.child(STR("text5")).text().as_float(), 3e-4);
+	CHECK_DOUBLE(node.child(STR("text6")).text().as_float(), 3.14159265358979323846);
+}
+
+TEST_XML(dom_text_as_double, "<node><text1>0</text1><text2>1</text2><text3>0.12</text3><text4>-5.1</text4><text5>3e-4</text5><text6>3.14159265358979323846</text6></node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(xml_text().as_double() == 0);
+	CHECK_DOUBLE(node.child(STR("text1")).text().as_double(), 0);
+	CHECK_DOUBLE(node.child(STR("text2")).text().as_double(), 1);
+	CHECK_DOUBLE(node.child(STR("text3")).text().as_double(), 0.12);
+	CHECK_DOUBLE(node.child(STR("text4")).text().as_double(), -5.1);
+	CHECK_DOUBLE(node.child(STR("text5")).text().as_double(), 3e-4);
+	CHECK_DOUBLE(node.child(STR("text6")).text().as_double(), 3.14159265358979323846);
+}
+
+TEST_XML(dom_text_as_bool, "<node><text1>0</text1><text2>1</text2><text3>true</text3><text4>True</text4><text5>Yes</text5><text6>yes</text6><text7>false</text7></node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(!xml_text().as_bool());
+	CHECK(!node.child(STR("text1")).text().as_bool());
+	CHECK(node.child(STR("text2")).text().as_bool());
+	CHECK(node.child(STR("text3")).text().as_bool());
+	CHECK(node.child(STR("text4")).text().as_bool());
+	CHECK(node.child(STR("text5")).text().as_bool());
+	CHECK(node.child(STR("text6")).text().as_bool());
+	CHECK(!node.child(STR("text7")).text().as_bool());
+}
+
+#ifdef PUGIXML_HAS_LONG_LONG
+TEST_XML(dom_text_as_llong, "<node><text1>1</text1><text2>-1</text2><text3>-9223372036854775808</text3><text4>9223372036854775807</text4><text5>0</text5></node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(xml_text().as_llong() == 0);
+	CHECK(node.child(STR("text1")).text().as_llong() == 1);
+	CHECK(node.child(STR("text2")).text().as_llong() == -1);
+	CHECK(node.child(STR("text3")).text().as_llong() == -9223372036854775807ll - 1);
+	CHECK(node.child(STR("text4")).text().as_llong() == 9223372036854775807ll);
+	CHECK(node.child(STR("text5")).text().as_llong() == 0);
+}
+
+TEST_XML(dom_text_as_llong_hex, "<node><text1>0777</text1><text2>0x5ab</text2><text3>0XFf</text3><text4>-0x20</text4><text5>-0x8000000000000000</text5><text6>0x</text6></node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.child(STR("text1")).text().as_llong() == 777); // no octal support! intentional
+	CHECK(node.child(STR("text2")).text().as_llong() == 1451);
+	CHECK(node.child(STR("text3")).text().as_llong() == 255);
+	CHECK(node.child(STR("text4")).text().as_llong() == -32);
+	CHECK(node.child(STR("text5")).text().as_llong() == -9223372036854775807ll - 1);
+	CHECK(node.child(STR("text6")).text().as_llong() == 0);
+}
+
+TEST_XML(dom_text_as_ullong, "<node><text1>0</text1><text2>1</text2><text3>9223372036854775807</text3><text4>18446744073709551615</text4><text5>0</text5></node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(xml_text().as_ullong() == 0);
+	CHECK(node.child(STR("text1")).text().as_ullong() == 0);
+	CHECK(node.child(STR("text2")).text().as_ullong() == 1);
+	CHECK(node.child(STR("text3")).text().as_ullong() == 9223372036854775807ll);
+	CHECK(node.child(STR("text4")).text().as_ullong() == 18446744073709551615ull);
+	CHECK(node.child(STR("text5")).text().as_ullong() == 0);
+}
+
+TEST_XML(dom_text_as_ullong_hex, "<node><text1>0777</text1><text2>0x5ab</text2><text3>0XFf</text3><text4>0x20</text4><text5>0xFFFFFFFFFFFFFFFF</text5><text6>0x</text6></node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.child(STR("text1")).text().as_ullong() == 777); // no octal support! intentional
+	CHECK(node.child(STR("text2")).text().as_ullong() == 1451);
+	CHECK(node.child(STR("text3")).text().as_ullong() == 255);
+	CHECK(node.child(STR("text4")).text().as_ullong() == 32);
+	CHECK(node.child(STR("text5")).text().as_ullong() == 18446744073709551615ull);
+	CHECK(node.child(STR("text6")).text().as_ullong() == 0);
+}
+#endif
+
+TEST_XML(dom_text_get_no_state, "<node/>")
+{
+ xml_node node = doc.child(STR("node"));
+ xml_text t = node.text();
+
+ CHECK(!t);
+ CHECK(t.get() && *t.get() == 0);
+ CHECK(!node.first_child());
+
+ node.append_child(node_pcdata);
+
+ CHECK(t);
+ CHECK_STRING(t.get(), STR(""));
+
+ node.first_child().set_value(STR("test"));
+
+ CHECK(t);
+ CHECK_STRING(t.get(), STR("test"));
+}
+
+TEST_XML(dom_text_set, "<node/>")
+{
+ xml_node node = doc.child(STR("node"));
+ xml_text t = node.text();
+
+ t.set(STR(""));
+ CHECK(node.first_child().type() == node_pcdata);
+ CHECK_NODE(node, STR("<node></node>"));
+
+ t.set(STR("boo"));
+ CHECK(node.first_child().type() == node_pcdata);
+ CHECK(node.first_child() == node.last_child());
+ CHECK_NODE(node, STR("<node>boo</node>"));
+
+ t.set(STR("foobarfoobar"));
+ CHECK(node.first_child().type() == node_pcdata);
+ CHECK(node.first_child() == node.last_child());
+ CHECK_NODE(node, STR("<node>foobarfoobar</node>"));
+}
+
+TEST_XML(dom_text_assign, "<node/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	node.append_child(STR("text1")).text() = STR("v1");
+	xml_text() = STR("v1");
+
+	node.append_child(STR("text2")).text() = -2147483647;
+	node.append_child(STR("text3")).text() = -2147483647 - 1;
+	xml_text() = -2147483647 - 1;
+
+	node.append_child(STR("text4")).text() = 4294967295u;
+	node.append_child(STR("text5")).text() = 4294967294u;
+	xml_text() = 4294967295u;
+
+	node.append_child(STR("text6")).text() = 0.5;
+	xml_text() = 0.5;
+
+	node.append_child(STR("text7")).text() = 0.25f;
+	xml_text() = 0.25f;
+
+	node.append_child(STR("text8")).text() = true;
+	xml_text() = true;
+
+	CHECK_NODE(node, STR("<node><text1>v1</text1><text2>-2147483647</text2><text3>-2147483648</text3><text4>4294967295</text4><text5>4294967294</text5><text6>0.5</text6><text7>0.25</text7><text8>true</text8></node>"));
+}
+
+TEST_XML(dom_text_set_value, "<node/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.append_child(STR("text1")).text().set(STR("v1")));
+	CHECK(!xml_text().set(STR("v1")));
+
+	CHECK(node.append_child(STR("text2")).text().set(-2147483647));
+	CHECK(node.append_child(STR("text3")).text().set(-2147483647 - 1));
+	CHECK(!xml_text().set(-2147483647 - 1));
+
+	CHECK(node.append_child(STR("text4")).text().set(4294967295u));
+	CHECK(node.append_child(STR("text5")).text().set(4294967294u));
+	CHECK(!xml_text().set(4294967295u));
+
+	CHECK(node.append_child(STR("text6")).text().set(0.5));
+	CHECK(!xml_text().set(0.5));
+
+	CHECK(node.append_child(STR("text7")).text().set(0.25f));
+	CHECK(!xml_text().set(0.25f));
+
+	CHECK(node.append_child(STR("text8")).text().set(true));
+	CHECK(!xml_text().set(true));
+
+	CHECK_NODE(node, STR("<node><text1>v1</text1><text2>-2147483647</text2><text3>-2147483648</text3><text4>4294967295</text4><text5>4294967294</text5><text6>0.5</text6><text7>0.25</text7><text8>true</text8></node>"));
+}
+
+#ifdef PUGIXML_HAS_LONG_LONG
+TEST_XML(dom_text_assign_llong, "<node/>")
+{
+	xml_node node = doc.child(STR("node"));
+	
+	node.append_child(STR("text1")).text() = -9223372036854775807ll;
+	node.append_child(STR("text2")).text() = -9223372036854775807ll - 1;
+	xml_text() = -9223372036854775807ll - 1;
+
+	node.append_child(STR("text3")).text() = 18446744073709551615ull;
+	node.append_child(STR("text4")).text() = 18446744073709551614ull;
+	xml_text() = 18446744073709551615ull;
+	
+	CHECK_NODE(node, STR("<node><text1>-9223372036854775807</text1><text2>-9223372036854775808</text2><text3>18446744073709551615</text3><text4>18446744073709551614</text4></node>"));
+}
+
+TEST_XML(dom_text_set_value_llong, "<node/>")
+{
+	xml_node node = doc.child(STR("node"));
+	
+	CHECK(node.append_child(STR("text1")).text().set(-9223372036854775807ll));
+	CHECK(node.append_child(STR("text2")).text().set(-9223372036854775807ll - 1));
+	CHECK(!xml_text().set(-9223372036854775807ll - 1));
+
+	CHECK(node.append_child(STR("text3")).text().set(18446744073709551615ull));
+	CHECK(node.append_child(STR("text4")).text().set(18446744073709551614ull));
+	CHECK(!xml_text().set(18446744073709551615ull));
+
+	CHECK_NODE(node, STR("<node><text1>-9223372036854775807</text1><text2>-9223372036854775808</text2><text3>18446744073709551615</text3><text4>18446744073709551614</text4></node>"));
+}
+#endif
+
+TEST_XML(dom_text_middle, "<node><c1>notthisone</c1>text<c2/></node>")
+{
+ xml_node node = doc.child(STR("node"));
+ xml_text t = node.text();
+
+ CHECK_STRING(t.get(), STR("text"));
+ t.set(STR("notext"));
+
+ CHECK_NODE(node, STR("<node><c1>notthisone</c1>notext<c2 /></node>"));
+ CHECK(node.remove_child(t.data()));
+
+ CHECK(!t);
+ CHECK_NODE(node, STR("<node><c1>notthisone</c1><c2 /></node>"));
+
+ t.set(STR("yestext"));
+
+ CHECK(t);
+ CHECK_NODE(node, STR("<node><c1>notthisone</c1><c2 />yestext</node>"));
+ CHECK(t.data() == node.last_child());
+}
+
+TEST_XML_FLAGS(dom_text_data, "<node><a>foo</a><![CDATA[bar]]><c><?pi value?></c><d/></node>", parse_default | parse_pi)
+{
+ xml_node node = doc.child(STR("node"));
+
+ CHECK(node.child(STR("a")).text().data() == node.child(STR("a")).first_child());
+ CHECK(node.child(STR("b")).text().data() == node.child(STR("b")).first_child());
+ CHECK(!node.child(STR("c")).text().data());
+ CHECK(!node.child(STR("d")).text().data());
+ CHECK(!xml_text().data());
+}
+
+TEST(dom_text_defaults)
+{
+ xml_text text;
+
+ CHECK_STRING(text.as_string(STR("foo")), STR("foo"));
+ CHECK(text.as_int(42) == 42);
+ CHECK(text.as_uint(42) == 42);
+ CHECK(text.as_double(42) == 42);
+ CHECK(text.as_float(42) == 42);
+ CHECK(text.as_bool(true) == true);
+
+#ifdef PUGIXML_HAS_LONG_LONG
+ CHECK(text.as_llong(42) == 42);
+ CHECK(text.as_ullong(42) == 42);
+#endif
+}

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_dom_traverse.cpp Added

@@ -0,0 +1,1153 @@
+#define _CRT_SECURE_NO_WARNINGS
+#define _SCL_SECURE_NO_WARNINGS
+#define _SCL_SECURE_NO_DEPRECATE
+
+#include "common.hpp"
+
+#include <string.h>
+#include <stdio.h>
+#include <wchar.h>
+
+#include <utility>
+#include <vector>
+#include <iterator>
+#include <string>
+
+#include "helpers.hpp"
+
+#ifdef PUGIXML_NO_STL
+template <typename I> static I move_iter(I base, int n)
+{
+	if (n > 0) while (n--) ++base;
+	else while (n++) --base;
+	return base;
+}
+#else
+template <typename I> static I move_iter(I base, int n)
+{
+	std::advance(base, n);
+	return base;
+}
+#endif
+
+TEST_XML(dom_attr_bool_ops, "<node attr='1'/>")
+{
+	generic_bool_ops_test(doc.child(STR("node")).attribute(STR("attr")));
+}
+
+TEST_XML(dom_attr_eq_ops, "<node attr1='1' attr2='2'/>")
+{
+	generic_eq_ops_test(doc.child(STR("node")).attribute(STR("attr1")), doc.child(STR("node")).attribute(STR("attr2")));
+}
+
+TEST_XML(dom_attr_rel_ops, "<node attr1='1' attr2='2'/>")
+{
+	generic_rel_ops_test(doc.child(STR("node")).attribute(STR("attr1")), doc.child(STR("node")).attribute(STR("attr2")));
+}
+
+TEST_XML(dom_attr_empty, "<node attr='1'/>")
+{
+	generic_empty_test(doc.child(STR("node")).attribute(STR("attr")));
+}
+
+TEST_XML(dom_attr_next_previous_attribute, "<node attr1='1' attr2='2' />")
+{
+	xml_attribute attr1 = doc.child(STR("node")).attribute(STR("attr1"));
+	xml_attribute attr2 = doc.child(STR("node")).attribute(STR("attr2"));
+
+	CHECK(attr1.next_attribute() == attr2);
+	CHECK(attr2.next_attribute() == xml_attribute());
+	
+	CHECK(attr1.previous_attribute() == xml_attribute());
+	CHECK(attr2.previous_attribute() == attr1);
+	
+	CHECK(xml_attribute().next_attribute() == xml_attribute());
+	CHECK(xml_attribute().previous_attribute() == xml_attribute());
+}
+
+TEST_XML(dom_attr_name_value, "<node attr='1'/>")
+{
+	xml_attribute attr = doc.child(STR("node")).attribute(STR("attr"));
+
+	CHECK_NAME_VALUE(attr, STR("attr"), STR("1"));
+	CHECK_NAME_VALUE(xml_attribute(), STR(""), STR(""));
+}
+
+TEST_XML(dom_attr_as_string, "<node attr='1'/>")
+{
+	xml_attribute attr = doc.child(STR("node")).attribute(STR("attr"));
+
+	CHECK_STRING(attr.as_string(), STR("1"));
+	CHECK_STRING(xml_attribute().as_string(), STR(""));
+}
+
+TEST_XML(dom_attr_as_int, "<node attr1='1' attr2='-1' attr3='-2147483648' attr4='2147483647' attr5='0'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(xml_attribute().as_int() == 0);
+	CHECK(node.attribute(STR("attr1")).as_int() == 1);
+	CHECK(node.attribute(STR("attr2")).as_int() == -1);
+	CHECK(node.attribute(STR("attr3")).as_int() == -2147483647 - 1);
+	CHECK(node.attribute(STR("attr4")).as_int() == 2147483647);
+	CHECK(node.attribute(STR("attr5")).as_int() == 0);
+}
+
+TEST_XML(dom_attr_as_int_hex, "<node attr1='0777' attr2='0x5ab' attr3='0XFf' attr4='-0x20' attr5='-0x80000000' attr6='0x'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.attribute(STR("attr1")).as_int() == 777); // no octal support! intentional
+	CHECK(node.attribute(STR("attr2")).as_int() == 1451);
+	CHECK(node.attribute(STR("attr3")).as_int() == 255);
+	CHECK(node.attribute(STR("attr4")).as_int() == -32);
+	CHECK(node.attribute(STR("attr5")).as_int() == -2147483647 - 1);
+	CHECK(node.attribute(STR("attr6")).as_int() == 0);
+}
+
+TEST_XML(dom_attr_as_uint, "<node attr1='0' attr2='1' attr3='2147483647' attr4='4294967295' attr5='0'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(xml_attribute().as_uint() == 0);
+	CHECK(node.attribute(STR("attr1")).as_uint() == 0);
+	CHECK(node.attribute(STR("attr2")).as_uint() == 1);
+	CHECK(node.attribute(STR("attr3")).as_uint() == 2147483647);
+	CHECK(node.attribute(STR("attr4")).as_uint() == 4294967295u);
+	CHECK(node.attribute(STR("attr5")).as_uint() == 0);
+}
+
+TEST_XML(dom_attr_as_uint_hex, "<node attr1='0777' attr2='0x5ab' attr3='0XFf' attr4='0x20' attr5='0xFFFFFFFF' attr6='0x'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.attribute(STR("attr1")).as_uint() == 777); // no octal support! intentional
+	CHECK(node.attribute(STR("attr2")).as_uint() == 1451);
+	CHECK(node.attribute(STR("attr3")).as_uint() == 255);
+	CHECK(node.attribute(STR("attr4")).as_uint() == 32);
+	CHECK(node.attribute(STR("attr5")).as_uint() == 4294967295u);
+	CHECK(node.attribute(STR("attr6")).as_uint() == 0);
+}
+
+TEST_XML(dom_attr_as_integer_space, "<node attr1=' \t1234' attr2='\t 0x123' attr3='- 16' attr4='- 0x10'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.attribute(STR("attr1")).as_int() == 1234);
+	CHECK(node.attribute(STR("attr2")).as_int() == 291);
+	CHECK(node.attribute(STR("attr3")).as_int() == 0);
+	CHECK(node.attribute(STR("attr4")).as_int() == 0);
+}
+
+TEST_XML(dom_attr_as_float, "<node attr1='0' attr2='1' attr3='0.12' attr4='-5.1' attr5='3e-4' attr6='3.14159265358979323846'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(xml_attribute().as_float() == 0);
+	CHECK_DOUBLE(node.attribute(STR("attr1")).as_float(), 0);
+	CHECK_DOUBLE(node.attribute(STR("attr2")).as_float(), 1);
+	CHECK_DOUBLE(node.attribute(STR("attr3")).as_float(), 0.12);
+	CHECK_DOUBLE(node.attribute(STR("attr4")).as_float(), -5.1);
+	CHECK_DOUBLE(node.attribute(STR("attr5")).as_float(), 3e-4);
+	CHECK_DOUBLE(node.attribute(STR("attr6")).as_float(), 3.14159265358979323846);
+}
+
+TEST_XML(dom_attr_as_double, "<node attr1='0' attr2='1' attr3='0.12' attr4='-5.1' attr5='3e-4' attr6='3.14159265358979323846'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(xml_attribute().as_double() == 0);
+	CHECK_DOUBLE(node.attribute(STR("attr1")).as_double(), 0);
+	CHECK_DOUBLE(node.attribute(STR("attr2")).as_double(), 1);
+	CHECK_DOUBLE(node.attribute(STR("attr3")).as_double(), 0.12);
+	CHECK_DOUBLE(node.attribute(STR("attr4")).as_double(), -5.1);
+	CHECK_DOUBLE(node.attribute(STR("attr5")).as_double(), 3e-4);
+	CHECK_DOUBLE(node.attribute(STR("attr6")).as_double(), 3.14159265358979323846);
+}
+
+TEST_XML(dom_attr_as_bool, "<node attr1='0' attr2='1' attr3='true' attr4='True' attr5='Yes' attr6='yes' attr7='false'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(!xml_attribute().as_bool());
+	CHECK(!node.attribute(STR("attr1")).as_bool());
+	CHECK(node.attribute(STR("attr2")).as_bool());
+	CHECK(node.attribute(STR("attr3")).as_bool());
+	CHECK(node.attribute(STR("attr4")).as_bool());
+	CHECK(node.attribute(STR("attr5")).as_bool());
+	CHECK(node.attribute(STR("attr6")).as_bool());
+	CHECK(!node.attribute(STR("attr7")).as_bool());
+}
+
+#ifdef PUGIXML_HAS_LONG_LONG
+TEST_XML(dom_attr_as_llong, "<node attr1='1' attr2='-1' attr3='-9223372036854775808' attr4='9223372036854775807' attr5='0'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(xml_attribute().as_llong() == 0);
+	CHECK(node.attribute(STR("attr1")).as_llong() == 1);
+	CHECK(node.attribute(STR("attr2")).as_llong() == -1);
+	CHECK(node.attribute(STR("attr3")).as_llong() == -9223372036854775807ll - 1);
+	CHECK(node.attribute(STR("attr4")).as_llong() == 9223372036854775807ll);
+	CHECK(node.attribute(STR("attr5")).as_llong() == 0);
+}
+
+TEST_XML(dom_attr_as_llong_hex, "<node attr1='0777' attr2='0x5ab' attr3='0XFf' attr4='-0x20' attr5='-0x8000000000000000' attr6='0x'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.attribute(STR("attr1")).as_llong() == 777); // no octal support! intentional
+	CHECK(node.attribute(STR("attr2")).as_llong() == 1451);
+	CHECK(node.attribute(STR("attr3")).as_llong() == 255);
+	CHECK(node.attribute(STR("attr4")).as_llong() == -32);
+	CHECK(node.attribute(STR("attr5")).as_llong() == -9223372036854775807ll - 1);
+	CHECK(node.attribute(STR("attr6")).as_llong() == 0);
+}
+
+TEST_XML(dom_attr_as_ullong, "<node attr1='0' attr2='1' attr3='9223372036854775807' attr4='18446744073709551615' attr5='0'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(xml_attribute().as_ullong() == 0);
+	CHECK(node.attribute(STR("attr1")).as_ullong() == 0);
+	CHECK(node.attribute(STR("attr2")).as_ullong() == 1);
+	CHECK(node.attribute(STR("attr3")).as_ullong() == 9223372036854775807ull);
+	CHECK(node.attribute(STR("attr4")).as_ullong() == 18446744073709551615ull);
+	CHECK(node.attribute(STR("attr5")).as_ullong() == 0);
+}
+
+TEST_XML(dom_attr_as_ullong_hex, "<node attr1='0777' attr2='0x5ab' attr3='0XFf' attr4='0x20' attr5='0xFFFFFFFFFFFFFFFF' attr6='0x'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.attribute(STR("attr1")).as_ullong() == 777); // no octal support! intentional
+	CHECK(node.attribute(STR("attr2")).as_ullong() == 1451);
+	CHECK(node.attribute(STR("attr3")).as_ullong() == 255);
+	CHECK(node.attribute(STR("attr4")).as_ullong() == 32);
+	CHECK(node.attribute(STR("attr5")).as_ullong() == 18446744073709551615ull);
+	CHECK(node.attribute(STR("attr6")).as_ullong() == 0);
+}
+#endif
+
+TEST(dom_attr_defaults)
+{
+ xml_attribute attr;
+
+ CHECK_STRING(attr.as_string(STR("foo")), STR("foo"));
+ CHECK(attr.as_int(42) == 42);
+ CHECK(attr.as_uint(42) == 42);
+ CHECK(attr.as_double(42) == 42);
+ CHECK(attr.as_float(42) == 42);
+ CHECK(attr.as_bool(true) == true);
+
+#ifdef PUGIXML_HAS_LONG_LONG
+ CHECK(attr.as_llong(42) == 42);
+ CHECK(attr.as_ullong(42) == 42);
+#endif
+}
+
+TEST_XML(dom_attr_iterator, "<node><node1 attr1='0'/><node2 attr1='0' attr2='1'/><node3/></node>")
+{
+	xml_node node1 = doc.child(STR("node")).child(STR("node1"));
+	xml_node node2 = doc.child(STR("node")).child(STR("node2"));
+	xml_node node3 = doc.child(STR("node")).child(STR("node3"));
+
+	CHECK(xml_node().attributes_begin() == xml_attribute_iterator());
+	CHECK(xml_node().attributes_end() == xml_attribute_iterator());
+
+	CHECK(node1.attributes_begin() == xml_attribute_iterator(node1.attribute(STR("attr1")), node1));
+	CHECK(move_iter(node1.attributes_begin(), 1) == node1.attributes_end());
+	CHECK(move_iter(node1.attributes_end(), -1) == node1.attributes_begin());
+	CHECK(*node1.attributes_begin() == node1.attribute(STR("attr1")));
+	CHECK_STRING(node1.attributes_begin()->name(), STR("attr1"));
+
+	CHECK(move_iter(node2.attributes_begin(), 2) == node2.attributes_end());
+	CHECK(move_iter(node2.attributes_end(), -2) == node2.attributes_begin());
+
+	CHECK(node3.attributes_begin() != xml_attribute_iterator());
+	CHECK(node3.attributes_begin() == node3.attributes_end());
+
+	xml_attribute_iterator it = xml_attribute_iterator(node2.attribute(STR("attr2")), node2);
+	xml_attribute_iterator itt = it;
+
+	CHECK(itt++ == it);
+	CHECK(itt == node2.attributes_end());
+
+	CHECK(itt-- == node2.attributes_end());
+	CHECK(itt == it);
+
+	CHECK(++itt == node2.attributes_end());
+	CHECK(itt == node2.attributes_end());
+
+	CHECK(--itt == it);
+	CHECK(itt == it);
+
+	CHECK(++itt != it);
+}
+
+TEST_XML(dom_attr_iterator_end, "<node><node1 attr1='0'/><node2 attr1='0' attr2='1'/><node3/></node>")
+{
+	xml_node node1 = doc.child(STR("node")).child(STR("node1"));
+	xml_node node2 = doc.child(STR("node")).child(STR("node2"));
+	xml_node node3 = doc.child(STR("node")).child(STR("node3"));
+
+	CHECK(node1.attributes_end() != node2.attributes_end() && node1.attributes_end() != node3.attributes_end() && node2.attributes_end() != node3.attributes_end());
+	CHECK(node1.attributes_end() != xml_attribute_iterator() && node2.attributes_end() != xml_attribute_iterator() && node3.attributes_end() != xml_attribute_iterator());
+}
+
+TEST_XML(dom_attr_iterator_invalidate, "<node><node1 attr1='0'/><node2 attr1='0' attr2='1'/><node3/></node>")
+{
+	xml_node node2 = doc.child(STR("node")).child(STR("node2"));
+
+	xml_attribute_iterator it1 = node2.attributes_begin();
+	xml_attribute_iterator it2 = move_iter(it1, 1);
+	xml_attribute_iterator it3 = move_iter(it2, 1);
+
+	CHECK(it3 == node2.attributes_end());
+
+	// removing attr2, it2 is invalid now, it3 is still past-the-end
+	node2.remove_attribute(*it2);
+
+	CHECK(node2.attributes_end() == it3);
+	CHECK(move_iter(it1, 1) == it3);
+	CHECK(move_iter(it3, -1) == it1);
+	CHECK_STRING(it1->name(), STR("attr1"));
+
+	// adding attr2 back, it3 is still past-the-end!
+	xml_attribute_iterator it2new = xml_attribute_iterator(node2.append_attribute(STR("attr2-new")), node2);
+
+	CHECK(node2.attributes_end() == it3);
+	CHECK(move_iter(it1, 1) == it2new);
+	CHECK(move_iter(it2new, 1) == it3);
+	CHECK(move_iter(it3, -1) == it2new);
+	CHECK_STRING(it2new->name(), STR("attr2-new"));
+
+	// removing both attributes, it3 is now equal to the begin
+	node2.remove_attribute(*it1);
+	node2.remove_attribute(*it2new);
+	CHECK(!node2.first_attribute());
+
+	CHECK(node2.attributes_begin() == it3);
+	CHECK(node2.attributes_end() == it3);
+}
+
+TEST_XML(dom_attr_iterator_const, "<node attr1='0' attr2='1'/>")
+{
+ pugi::xml_node node = doc.child(STR("node"));
+
+ const pugi::xml_attribute_iterator i1 = node.attributes_begin();
+ const pugi::xml_attribute_iterator i2 = ++xml_attribute_iterator(i1);
+ const pugi::xml_attribute_iterator i3 = ++xml_attribute_iterator(i2);
+
+ CHECK(*i1 == node.attribute(STR("attr1")));
+ CHECK(*i2 == node.attribute(STR("attr2")));
+ CHECK(i3 == node.attributes_end());
+
+ CHECK_STRING(i1->name(), STR("attr1"));
+ CHECK_STRING(i2->name(), STR("attr2"));
+}
+
+TEST_XML(dom_node_bool_ops, "<node/>")
+{
+	generic_bool_ops_test(doc.child(STR("node")));
+}
+
+TEST_XML(dom_node_eq_ops, "<node><node1/><node2/></node>")
+{
+	generic_eq_ops_test(doc.child(STR("node")).child(STR("node1")), doc.child(STR("node")).child(STR("node2")));
+}
+
+TEST_XML(dom_node_rel_ops, "<node><node1/><node2/></node>")
+{
+	generic_rel_ops_test(doc.child(STR("node")).child(STR("node1")), doc.child(STR("node")).child(STR("node2")));
+}
+
+TEST_XML(dom_node_empty, "<node/>")
+{
+	generic_empty_test(doc.child(STR("node")));
+}
+
+TEST_XML(dom_node_iterator, "<node><node1><child1/></node1><node2><child1/><child2/></node2><node3/></node>")
+{
+	xml_node node1 = doc.child(STR("node")).child(STR("node1"));
+	xml_node node2 = doc.child(STR("node")).child(STR("node2"));
+	xml_node node3 = doc.child(STR("node")).child(STR("node3"));
+
+	CHECK(xml_node().begin() == xml_node_iterator());
+	CHECK(xml_node().end() == xml_node_iterator());
+
+	CHECK(node1.begin() == xml_node_iterator(node1.child(STR("child1"))));
+	CHECK(move_iter(node1.begin(), 1) == node1.end());
+	CHECK(move_iter(node1.end(), -1) == node1.begin());
+	CHECK(*node1.begin() == node1.child(STR("child1")));
+	CHECK_STRING(node1.begin()->name(), STR("child1"));
+
+	CHECK(move_iter(node2.begin(), 2) == node2.end());
+	CHECK(move_iter(node2.end(), -2) == node2.begin());
+
+	CHECK(node3.begin() != xml_node_iterator());
+	CHECK(node3.begin() == node3.end());
+
+	xml_node_iterator it = node2.child(STR("child2"));
+	xml_node_iterator itt = it;
+
+	CHECK(itt++ == it);
+	CHECK(itt == node2.end());
+
+	CHECK(itt-- == node2.end());
+	CHECK(itt == it);
+
+	CHECK(++itt == node2.end());
+	CHECK(itt == node2.end());
+
+	CHECK(--itt == it);
+	CHECK(itt == it);
+
+	CHECK(++itt != it);
+}
+
+TEST_XML(dom_node_iterator_end, "<node><node1><child1/></node1><node2><child1/><child2/></node2><node3/></node>")
+{
+	xml_node node1 = doc.child(STR("node")).child(STR("node1"));
+	xml_node node2 = doc.child(STR("node")).child(STR("node2"));
+	xml_node node3 = doc.child(STR("node")).child(STR("node3"));
+
+	CHECK(node1.end() != node2.end() && node1.end() != node3.end() && node2.end() != node3.end());
+	CHECK(node1.end() != xml_node_iterator() && node2.end() != xml_node_iterator() && node3.end() != xml_node_iterator());
+}
+
+TEST_XML(dom_node_iterator_invalidate, "<node><node1><child1/></node1><node2><child1/><child2/></node2><node3/></node>")
+{
+	xml_node node2 = doc.child(STR("node")).child(STR("node2"));
+
+	xml_node_iterator it1 = node2.begin();
+	xml_node_iterator it2 = move_iter(it1, 1);
+	xml_node_iterator it3 = move_iter(it2, 1);
+
+	CHECK(it3 == node2.end());
+
+	// removing child2, it2 is invalid now, it3 is still past-the-end
+	node2.remove_child(*it2);
+
+	CHECK(node2.end() == it3);
+	CHECK(move_iter(it1, 1) == it3);
+	CHECK(move_iter(it3, -1) == it1);
+	CHECK_STRING(it1->name(), STR("child1"));
+
+	// adding attr2 back, it3 is still past-the-end!
+	xml_node_iterator it2new = node2.append_child();
+	it2new->set_name(STR("child2-new"));
+
+	CHECK(node2.end() == it3);
+	CHECK(move_iter(it1, 1) == it2new);
+	CHECK(move_iter(it2new, 1) == it3);
+	CHECK(move_iter(it3, -1) == it2new);
+	CHECK_STRING(it2new->name(), STR("child2-new"));
+
+	// removing both nodes, it3 is now equal to the begin
+	node2.remove_child(*it1);
+	node2.remove_child(*it2new);
+	CHECK(!node2.first_child());
+
+	CHECK(node2.begin() == it3);
+	CHECK(node2.end() == it3);
+}
+
+TEST_XML(dom_node_iterator_const, "<node><child1/><child2/></node>")
+{
+ pugi::xml_node node = doc.child(STR("node"));
+
+ const pugi::xml_node_iterator i1 = node.begin();
+ const pugi::xml_node_iterator i2 = ++xml_node_iterator(i1);
+ const pugi::xml_node_iterator i3 = ++xml_node_iterator(i2);
+
+ CHECK(*i1 == node.child(STR("child1")));
+ CHECK(*i2 == node.child(STR("child2")));
+ CHECK(i3 == node.end());
+
+ CHECK_STRING(i1->name(), STR("child1"));
+ CHECK_STRING(i2->name(), STR("child2"));
+}
+
+TEST_XML(dom_node_parent, "<node><child/></node>")
+{
+	CHECK(xml_node().parent() == xml_node());
+	CHECK(doc.child(STR("node")).child(STR("child")).parent() == doc.child(STR("node")));
+	CHECK(doc.child(STR("node")).parent() == doc);
+}
+
+TEST_XML(dom_node_root, "<node><child/></node>")
+{
+	CHECK(xml_node().root() == xml_node());
+	CHECK(doc.child(STR("node")).child(STR("child")).root() == doc);
+	CHECK(doc.child(STR("node")).root() == doc);
+}
+
+TEST_XML_FLAGS(dom_node_type, "<?xml?><!DOCTYPE><?pi?><node>pcdata<![CDATA[cdata]]></node>", parse_default | parse_pi | parse_comments | parse_declaration | parse_doctype)
+{
+	CHECK(xml_node().type() == node_null);
+	CHECK(doc.type() == node_document);
+
+	xml_node_iterator it = doc.begin();
+
+	CHECK((it++)->type() == node_declaration);
+	CHECK((it++)->type() == node_doctype);
+	CHECK((it++)->type() == node_pi);
+	CHECK((it++)->type() == node_comment);
+	CHECK((it++)->type() == node_element);
+
+	xml_node_iterator cit = doc.child(STR("node")).begin();
+	
+	CHECK((cit++)->type() == node_pcdata);
+	CHECK((cit++)->type() == node_cdata);
+}
+
+TEST_XML_FLAGS(dom_node_name_value, "<?xml?><!DOCTYPE id><?pi?><node>pcdata<![CDATA[cdata]]></node>", parse_default | parse_pi | parse_comments | parse_declaration | parse_doctype)
+{
+	CHECK_NAME_VALUE(xml_node(), STR(""), STR(""));
+	CHECK_NAME_VALUE(doc, STR(""), STR(""));
+
+	xml_node_iterator it = doc.begin();
+
+	CHECK_NAME_VALUE(*it++, STR("xml"), STR(""));
+	CHECK_NAME_VALUE(*it++, STR(""), STR("id"));
+	CHECK_NAME_VALUE(*it++, STR("pi"), STR(""));
+	CHECK_NAME_VALUE(*it++, STR(""), STR("comment"));
+	CHECK_NAME_VALUE(*it++, STR("node"), STR(""));
+
+	xml_node_iterator cit = doc.child(STR("node")).begin();
+	
+	CHECK_NAME_VALUE(*cit++, STR(""), STR("pcdata"));
+	CHECK_NAME_VALUE(*cit++, STR(""), STR("cdata"));
+}
+
+TEST_XML(dom_node_child, "<node><child1/><child2/></node>")
+{
+	CHECK(xml_node().child(STR("n")) == xml_node());
+
+	CHECK(doc.child(STR("n")) == xml_node());
+	CHECK_NAME_VALUE(doc.child(STR("node")), STR("node"), STR(""));
+	CHECK(doc.child(STR("node")).child(STR("child2")) == doc.child(STR("node")).last_child());
+}
+
+TEST_XML(dom_node_attribute, "<node attr1='0' attr2='1'/>")
+{
+	CHECK(xml_node().attribute(STR("a")) == xml_attribute());
+
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.attribute(STR("n")) == xml_attribute());
+	CHECK_NAME_VALUE(node.attribute(STR("attr1")), STR("attr1"), STR("0"));
+	CHECK(node.attribute(STR("attr2")) == node.last_attribute());
+}
+
+TEST_XML(dom_node_next_previous_sibling, "<node><child1/><child2/><child3/></node>")
+{
+	CHECK(xml_node().next_sibling() == xml_node());
+	CHECK(xml_node().next_sibling(STR("n")) == xml_node());
+
+	CHECK(xml_node().previous_sibling() == xml_node());
+	CHECK(xml_node().previous_sibling(STR("n")) == xml_node());
+
+	xml_node child1 = doc.child(STR("node")).child(STR("child1"));
+	xml_node child2 = doc.child(STR("node")).child(STR("child2"));
+	xml_node child3 = doc.child(STR("node")).child(STR("child3"));
+
+	CHECK(child1.next_sibling() == child2);
+	CHECK(child3.next_sibling() == xml_node());
+	
+	CHECK(child1.previous_sibling() == xml_node());
+	CHECK(child3.previous_sibling() == child2);
+	
+	CHECK(child1.next_sibling(STR("child3")) == child3);
+	CHECK(child1.next_sibling(STR("child")) == xml_node());
+
+	CHECK(child3.previous_sibling(STR("child1")) == child1);
+	CHECK(child3.previous_sibling(STR("child")) == xml_node());
+}
+
+TEST_XML(dom_node_child_value, "<node><novalue/><child1>value1</child1><child2>value2<n/></child2><child3><![CDATA[value3]]></child3>value4</node>")
+{
+	CHECK_STRING(xml_node().child_value(), STR(""));
+	CHECK_STRING(xml_node().child_value(STR("n")), STR(""));
+
+	xml_node node = doc.child(STR("node"));
+
+	CHECK_STRING(node.child_value(), STR("value4"));
+	CHECK_STRING(node.child(STR("child1")).child_value(), STR("value1"));
+	CHECK_STRING(node.child(STR("child2")).child_value(), STR("value2"));
+	CHECK_STRING(node.child(STR("child3")).child_value(), STR("value3"));
+	CHECK_STRING(node.child_value(STR("child3")), STR("value3"));
+	CHECK_STRING(node.child_value(STR("novalue")), STR(""));
+}
+
+TEST_XML(dom_node_first_last_attribute, "<node attr1='0' attr2='1'/>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.first_attribute() == node.attribute(STR("attr1")));
+	CHECK(node.last_attribute() == node.attribute(STR("attr2")));
+
+	CHECK(xml_node().first_attribute() == xml_attribute());
+	CHECK(xml_node().last_attribute() == xml_attribute());
+
+	CHECK(doc.first_attribute() == xml_attribute());
+	CHECK(doc.last_attribute() == xml_attribute());
+}
+
+TEST_XML(dom_node_first_last_child, "<node><child1/><child2/></node>")
+{
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.first_child() == node.child(STR("child1")));
+	CHECK(node.last_child() == node.child(STR("child2")));
+
+	CHECK(xml_node().first_child() == xml_node());
+	CHECK(xml_node().last_child() == xml_node());
+
+	CHECK(doc.first_child() == node);
+	CHECK(doc.last_child() == node);
+}
+
+TEST_XML(dom_node_find_child_by_attribute, "<node><stub attr='value3' /><child1 attr='value1'/><child2 attr='value2'/><child2 attr='value3'/></node>")
+{
+	CHECK(xml_node().find_child_by_attribute(STR("name"), STR("attr"), STR("value")) == xml_node());
+	CHECK(xml_node().find_child_by_attribute(STR("attr"), STR("value")) == xml_node());
+
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.find_child_by_attribute(STR("child2"), STR("attr"), STR("value3")) == node.last_child());
+	CHECK(node.find_child_by_attribute(STR("child2"), STR("attr3"), STR("value3")) == xml_node());
+	CHECK(node.find_child_by_attribute(STR("attr"), STR("value2")) == node.child(STR("child2")));
+	CHECK(node.find_child_by_attribute(STR("attr3"), STR("value")) == xml_node());
+}
+
+TEST(dom_node_find_child_by_attribute_null)
+{
+	xml_document doc;
+	xml_node node0 = doc.append_child();
+	xml_node node1 = doc.append_child(STR("a"));
+	xml_node node2 = doc.append_child(STR("a"));
+	xml_node node3 = doc.append_child(STR("a"));
+
+	(void)node0;
+
+	// this adds an attribute with null name and/or value in the internal representation
+	node1.append_attribute(STR(""));
+	node2.append_attribute(STR("id"));
+	node3.append_attribute(STR("id")) = STR("1");
+
+	// make sure find_child_by_attribute works if name/value is null
+	CHECK(doc.find_child_by_attribute(STR("unknown"), STR("wrong")) == xml_node());
+	CHECK(doc.find_child_by_attribute(STR("id"), STR("wrong")) == xml_node());
+	CHECK(doc.find_child_by_attribute(STR("id"), STR("")) == node2);
+	CHECK(doc.find_child_by_attribute(STR("id"), STR("1")) == node3);
+
+	CHECK(doc.find_child_by_attribute(STR("a"), STR("unknown"), STR("wrong")) == xml_node());
+	CHECK(doc.find_child_by_attribute(STR("a"), STR("id"), STR("wrong")) == xml_node());
+	CHECK(doc.find_child_by_attribute(STR("a"), STR("id"), STR("")) == node2);
+	CHECK(doc.find_child_by_attribute(STR("a"), STR("id"), STR("1")) == node3);
+}
+
+struct find_predicate_const
+{
+	bool result;
+
+	find_predicate_const(bool result_): result(result_)
+	{
+	}
+
+	template <typename T> bool operator()(const T&) const
+	{
+		return result;
+	}
+};
+
+struct find_predicate_prefix
+{
+	const pugi::char_t* prefix;
+
+	find_predicate_prefix(const pugi::char_t* prefix_): prefix(prefix_)
+	{
+	}
+
+	template <typename T> bool operator()(const T& obj) const
+	{
+	#ifdef PUGIXML_WCHAR_MODE
+		// can't use wcsncmp here because of a bug in DMC
+		return std::basic_string<pugi::char_t>(obj.name()).compare(0, wcslen(prefix), prefix) == 0;
+	#else
+		return strncmp(obj.name(), prefix, strlen(prefix)) == 0;
+	#endif
+	}
+};
+
+TEST_XML(dom_node_find_attribute, "<node attr1='0' attr2='1'/>")
+{
+	CHECK(xml_node().find_attribute(find_predicate_const(true)) == xml_attribute());
+
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(doc.find_attribute(find_predicate_const(true)) == xml_attribute());
+	CHECK(node.find_attribute(find_predicate_const(true)) == node.first_attribute());
+	CHECK(node.find_attribute(find_predicate_const(false)) == xml_attribute());
+	CHECK(node.find_attribute(find_predicate_prefix(STR("attr2"))) == node.last_attribute());
+	CHECK(node.find_attribute(find_predicate_prefix(STR("attr"))) == node.first_attribute());
+}
+
+TEST_XML(dom_node_find_child, "<node><child1/><child2/></node>")
+{
+	CHECK(xml_node().find_child(find_predicate_const(true)) == xml_node());
+
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.child(STR("node")).child(STR("child1")).find_child(find_predicate_const(true)) == xml_node());
+	CHECK(node.find_child(find_predicate_const(true)) == node.first_child());
+	CHECK(node.find_child(find_predicate_const(false)) == xml_node());
+	CHECK(node.find_child(find_predicate_prefix(STR("child2"))) == node.last_child());
+	CHECK(node.find_child(find_predicate_prefix(STR("child"))) == node.first_child());
+}
+
+TEST_XML(dom_node_find_node, "<node><child1/><child2/></node>")
+{
+	CHECK(xml_node().find_node(find_predicate_const(true)) == xml_node());
+
+	xml_node node = doc.child(STR("node"));
+
+	CHECK(node.child(STR("node")).child(STR("child1")).find_node(find_predicate_const(true)) == xml_node());
+	CHECK(node.find_node(find_predicate_const(true)) == node.first_child());
+	CHECK(node.find_node(find_predicate_const(false)) == xml_node());
+	CHECK(node.find_node(find_predicate_prefix(STR("child2"))) == node.last_child());
+	CHECK(node.find_node(find_predicate_prefix(STR("child"))) == node.first_child());
+	CHECK(doc.find_node(find_predicate_prefix(STR("child"))) == node.first_child());
+	CHECK(doc.find_node(find_predicate_prefix(STR("child2"))) == node.last_child());
+	CHECK(doc.find_node(find_predicate_prefix(STR("child3"))) == xml_node());
+}
+
+#ifndef PUGIXML_NO_STL
+TEST_XML(dom_node_path, "<node><child1>text<child2/></child1></node>")
+{
+	CHECK(xml_node().path() == STR(""));
+	
+	CHECK(doc.path() == STR(""));
+	CHECK(doc.child(STR("node")).path() == STR("/node"));
+	CHECK(doc.child(STR("node")).child(STR("child1")).path() == STR("/node/child1"));
+	CHECK(doc.child(STR("node")).child(STR("child1")).child(STR("child2")).path() == STR("/node/child1/child2"));
+	CHECK(doc.child(STR("node")).child(STR("child1")).first_child().path() == STR("/node/child1/"));
+	
+	CHECK(doc.child(STR("node")).child(STR("child1")).path('\\') == STR("\\node\\child1"));
+}
+#endif
+
+TEST_XML(dom_node_first_element_by_path, "<node><child1>text<child2/></child1></node>")
+{
+	CHECK(xml_node().first_element_by_path(STR("/")) == xml_node());
+	CHECK(xml_node().first_element_by_path(STR("a")) == xml_node());
+	
+	CHECK(doc.first_element_by_path(STR("")) == doc);
+	CHECK(doc.first_element_by_path(STR("/")) == doc);
+
+	CHECK(doc.first_element_by_path(STR("/node/")) == doc.child(STR("node")));
+	CHECK(doc.first_element_by_path(STR("node/")) == doc.child(STR("node")));
+	CHECK(doc.first_element_by_path(STR("node")) == doc.child(STR("node")));
+	CHECK(doc.first_element_by_path(STR("/node")) == doc.child(STR("node")));
+
+#ifndef PUGIXML_NO_STL
+	CHECK(doc.first_element_by_path(STR("/node/child1/child2")).path() == STR("/node/child1/child2"));
+#endif
+
+	CHECK(doc.first_element_by_path(STR("/node/child2")) == xml_node());
+	
+	CHECK(doc.first_element_by_path(STR("\\node\\child1"), '\\') == doc.child(STR("node")).child(STR("child1")));
+
+	CHECK(doc.child(STR("node")).first_element_by_path(STR("..")) == doc);
+	CHECK(doc.child(STR("node")).first_element_by_path(STR(".")) == doc.child(STR("node")));
+
+	CHECK(doc.child(STR("node")).first_element_by_path(STR("../node/./child1/../.")) == doc.child(STR("node")));
+
+	CHECK(doc.child(STR("node")).first_element_by_path(STR("child1")) == doc.child(STR("node")).child(STR("child1")));
+	CHECK(doc.child(STR("node")).first_element_by_path(STR("child1/")) == doc.child(STR("node")).child(STR("child1")));
+	CHECK(doc.child(STR("node")).first_element_by_path(STR("child")) == xml_node());
+	CHECK(doc.child(STR("node")).first_element_by_path(STR("child11")) == xml_node());
+
+	CHECK(doc.first_element_by_path(STR("//node")) == doc.child(STR("node")));
+}
+
+struct test_walker: xml_tree_walker
+{
+	std::basic_string<pugi::char_t> log;
+	unsigned int call_count;
+	unsigned int stop_count;
+
+	test_walker(unsigned int stop_count_ = 0): call_count(0), stop_count(stop_count_)
+	{
+	}
+
+	std::basic_string<pugi::char_t> depthstr() const
+	{
+		char buf[32];
+		sprintf(buf, "%d", depth());
+
+	#ifdef PUGIXML_WCHAR_MODE
+		wchar_t wbuf[32];
+		std::copy(buf, buf + strlen(buf) + 1, &wbuf[0]);
+
+		return std::basic_string<pugi::char_t>(wbuf);
+	#else
+		return std::basic_string<pugi::char_t>(buf);
+	#endif
+	}
+
+	virtual bool begin(xml_node& node)
+	{
+		log += STR("|");
+		log += depthstr();
+		log += STR(" <");
+		log += node.name();
+		log += STR("=");
+		log += node.value();
+
+		return ++call_count != stop_count && xml_tree_walker::begin(node);
+	}
+
+	virtual bool for_each(xml_node& node)
+	{
+		log += STR("|");
+		log += depthstr();
+		log += STR(" !");
+		log += node.name();
+		log += STR("=");
+		log += node.value();
+
+		return ++call_count != stop_count && xml_tree_walker::end(node);
+	}
+
+	virtual bool end(xml_node& node)
+	{
+		log += STR("|");
+		log += depthstr();
+		log += STR(" >");
+		log += node.name();
+		log += STR("=");
+		log += node.value();
+
+		return ++call_count != stop_count;
+	}
+};
+
+TEST_XML(dom_node_traverse, "<node><child>text</child></node>")
+{
+	test_walker walker;
+
+	CHECK(doc.traverse(walker));
+
+	CHECK(walker.call_count == 5);
+	CHECK(walker.log == STR("|-1 <=|0 !node=|1 !child=|2 !=text|-1 >="));
+}
+
+TEST_XML(dom_node_traverse_siblings, "<node><child/><child>text</child><child/></node>")
+{
+	test_walker walker;
+
+	CHECK(doc.traverse(walker));
+
+	CHECK(walker.call_count == 7);
+	CHECK(walker.log == STR("|-1 <=|0 !node=|1 !child=|1 !child=|2 !=text|1 !child=|-1 >="));
+}
+
+TEST(dom_node_traverse_empty)
+{
+	test_walker walker;
+
+	CHECK(xml_node().traverse(walker));
+
+	CHECK(walker.call_count == 2);
+	CHECK(walker.log == STR("|-1 <=|-1 >="));
+}
+
+TEST_XML(dom_node_traverse_child, "<node><child>text</child></node><another>node</another>")
+{
+	test_walker walker;
+
+	CHECK(doc.child(STR("node")).traverse(walker));
+
+	CHECK(walker.call_count == 4);
+	CHECK(walker.log == STR("|-1 <node=|0 !child=|1 !=text|-1 >node="));
+}
+
+TEST_XML(dom_node_traverse_stop_begin, "<node><child>text</child></node>")
+{
+	test_walker walker(1);
+
+	CHECK(!doc.traverse(walker));
+
+	CHECK(walker.call_count == 1);
+	CHECK(walker.log == STR("|-1 <="));
+}
+
+TEST_XML(dom_node_traverse_stop_for_each, "<node><child>text</child></node>")
+{
+	test_walker walker(3);
+
+	CHECK(!doc.traverse(walker));
+
+	CHECK(walker.call_count == 3);
+	CHECK(walker.log == STR("|-1 <=|0 !node=|1 !child="));
+}
+
+TEST_XML(dom_node_traverse_stop_end, "<node><child>text</child></node>")
+{
+	test_walker walker(5);
+
+	CHECK(!doc.traverse(walker));
+
+	CHECK(walker.call_count == 5);
+	CHECK(walker.log == STR("|-1 <=|0 !node=|1 !child=|2 !=text|-1 >="));
+}
+
+TEST_XML_FLAGS(dom_offset_debug, "<?xml?><!DOCTYPE><?pi?><node>pcdata<![CDATA[cdata]]></node>", parse_default | parse_pi | parse_comments | parse_declaration | parse_doctype)
+{
+	CHECK(xml_node().offset_debug() == -1);
+	CHECK(doc.offset_debug() == 0);
+
+	xml_node_iterator it = doc.begin();
+
+	CHECK((it++)->offset_debug() == 2);
+	CHECK((it++)->offset_debug() == 16);
+	CHECK((it++)->offset_debug() == 19);
+	CHECK((it++)->offset_debug() == 27);
+	CHECK((it++)->offset_debug() == 38);
+
+	xml_node_iterator cit = doc.child(STR("node")).begin();
+	
+	CHECK((cit++)->offset_debug() == 43);
+	CHECK((cit++)->offset_debug() == 58);
+}
+
+TEST(dom_offset_debug_encoding)
+{
+	char buf[] = { 0, '<', 0, 'n', 0, '/', 0, '>' };
+
+	xml_document doc;
+	CHECK(doc.load_buffer(buf, sizeof(buf)));
+
+	CHECK(doc.offset_debug() == 0);
+	CHECK(doc.first_child().offset_debug() == 1);
+}
+
+TEST_XML(dom_offset_debug_append, "<node/>")
+{
+	xml_node c1 = doc.first_child();
+	xml_node c2 = doc.append_child(STR("node"));
+	xml_node c3 = doc.append_child(node_pcdata);
+
+	CHECK(doc.offset_debug() == 0);
+	CHECK(c1.offset_debug() == 1);
+	CHECK(c2.offset_debug() == -1);
+	CHECK(c3.offset_debug() == -1);
+
+	c1.set_name(STR("nodenode"));
+	CHECK(c1.offset_debug() == -1);
+}
+
+TEST_XML(dom_offset_debug_append_buffer, "<node/>")
+{
+	CHECK(doc.offset_debug() == 0);
+	CHECK(doc.first_child().offset_debug() == 1);
+
+	CHECK(doc.append_buffer("<node/>", 7));
+	CHECK(doc.offset_debug() == -1);
+	CHECK(doc.first_child().offset_debug() == -1);
+	CHECK(doc.last_child().offset_debug() == -1);
+}
+
+TEST_XML(dom_internal_object, "<node attr='value'>value</node>")
+{
+	xml_node node = doc.child(STR("node"));
+	xml_attribute attr = node.first_attribute();
+	xml_node value = node.first_child();
+	
+	CHECK(xml_node().internal_object() == 0);
+	CHECK(xml_attribute().internal_object() == 0);
+
+ CHECK(node.internal_object() != 0);
+ CHECK(value.internal_object() != 0);
+ CHECK(node.internal_object() != value.internal_object());
+
+ CHECK(attr.internal_object() != 0);
+
+ xml_node node_copy = node;
+ CHECK(node_copy.internal_object() == node.internal_object());
+
+ xml_attribute attr_copy = attr;
+ CHECK(attr_copy.internal_object() == attr.internal_object());
+}
+
+TEST_XML(dom_hash_value, "<node attr='value'>value</node>")
+{
+	xml_node node = doc.child(STR("node"));
+	xml_attribute attr = node.first_attribute();
+	xml_node value = node.first_child();
+	
+	CHECK(xml_node().hash_value() == 0);
+	CHECK(xml_attribute().hash_value() == 0);
+
+ CHECK(node.hash_value() != 0);
+ CHECK(value.hash_value() != 0);
+ CHECK(node.hash_value() != value.hash_value());
+
+ CHECK(attr.hash_value() != 0);
+
+ xml_node node_copy = node;
+ CHECK(node_copy.hash_value() == node.hash_value());
+
+ xml_attribute attr_copy = attr;
+ CHECK(attr_copy.hash_value() == attr.hash_value());
+}
+
+TEST_XML(dom_node_named_iterator, "<node><node1><child/></node1><node2><child/><child/></node2><node3/><node4><child/><x/></node4></node>")
+{
+	xml_node node1 = doc.child(STR("node")).child(STR("node1"));
+	xml_node node2 = doc.child(STR("node")).child(STR("node2"));
+	xml_node node3 = doc.child(STR("node")).child(STR("node3"));
+	xml_node node4 = doc.child(STR("node")).child(STR("node4"));
+
+	CHECK(xml_named_node_iterator(xml_node(), STR("child")) == xml_named_node_iterator());
+
+	xml_object_range<xml_named_node_iterator> r1 = node1.children(STR("child"));
+	xml_object_range<xml_named_node_iterator> r2 = node2.children(STR("child"));
+	xml_object_range<xml_named_node_iterator> r3 = node3.children(STR("child"));
+	xml_object_range<xml_named_node_iterator> r4 = node4.children(STR("child"));
+
+	CHECK(r1.begin() != r1.end());
+	CHECK(*r1.begin() == node1.first_child());
+	CHECK(r1.begin() == move_iter(r1.end(), -1));
+	CHECK(move_iter(r1.begin(), 1) == r1.end());
+
+	CHECK(r2.begin() != r2.end());
+	CHECK(*r2.begin() == node2.first_child());
+	CHECK(*move_iter(r2.begin(), 1) == node2.last_child());
+	CHECK(r2.begin() == move_iter(r2.end(), -2));
+	CHECK(move_iter(r2.begin(), 1) == move_iter(r2.end(), -1));
+	CHECK(move_iter(r2.begin(), 2) == r2.end());
+
+	CHECK(r3.begin() == r3.end());
+	CHECK(!(r3.begin() != r3.end()));
+
+	CHECK(r4.begin() != r4.end());
+	CHECK(*r4.begin() == node4.first_child());
+	CHECK(r4.begin() == move_iter(r4.end(), -1));
+	CHECK(move_iter(r4.begin(), 1) == r4.end());
+
+	xml_named_node_iterator it = r1.begin();
+	xml_named_node_iterator itt = it;
+
+	CHECK(itt == it);
+
+	CHECK(itt++ == it);
+	CHECK(itt == r1.end());
+
+	CHECK(itt != it);
+	CHECK(itt == ++it);
+
+	CHECK(itt-- == r1.end());
+	CHECK(itt == r1.begin());
+
+	CHECK(itt->offset_debug() == 14);
+}
+
+TEST_XML(dom_node_children_attributes, "<node1 attr1='value1' attr2='value2' /><node2 />")
+{
+	xml_object_range<xml_node_iterator> r1 = doc.children();
+
+	CHECK(r1.begin() == doc.begin());
+	CHECK(r1.end() == doc.end());
+
+	xml_object_range<xml_node_iterator> r2 = xml_node().children();
+
+	CHECK(r2.begin() == xml_node_iterator());
+	CHECK(r2.end() == xml_node_iterator());
+
+	xml_node node = doc.child(STR("node1"));
+
+	xml_object_range<xml_attribute_iterator> r3 = node.attributes();
+
+	CHECK(r3.begin() == node.attributes_begin());
+	CHECK(r3.end() == node.attributes_end());
+
+	xml_object_range<xml_attribute_iterator> r4 = xml_node().attributes();
+
+	CHECK(r4.begin() == xml_attribute_iterator());
+	CHECK(r4.end() == xml_attribute_iterator());
+}
+
+TEST_XML(dom_unspecified_bool_coverage, "<node attr='value'>text</node>")
+{
+	xml_node node = doc.first_child();
+
+	CHECK(node);
+	static_cast<void (*)(xml_node***)>(node)(0);
+
+	CHECK(node.first_attribute());
+	static_cast<void (*)(xml_attribute***)>(node.first_attribute())(0);
+
+	CHECK(node.text());
+	static_cast<void (*)(xml_text***)>(node.text())(0);
+
+#ifndef PUGIXML_NO_XPATH
+	xpath_query q(STR("/node"));
+
+	CHECK(q);
+	static_cast<void (*)(xpath_query***)>(q)(0);
+
+	xpath_node qn = q.evaluate_node(doc);
+
+	CHECK(qn);
+	static_cast<void (*)(xpath_node***)>(qn)(0);
+#endif
+}
+
+#if __cplusplus >= 201103
+TEST_XML(dom_ranged_for, "<node attr1='1' attr2='2'><test>3</test><fake>5</fake><test>4</test></node>")
+{
+	int index = 1;
+
+	for (xml_node n: doc.children())
+	{
+		for (xml_attribute a: n.attributes())
+		{
+			CHECK(a.as_int() == index);
+			index++;
+		}
+
+		for (xml_node c: n.children(STR("test")))
+		{
+			CHECK(c.text().as_int() == index);
+			index++;
+		}
+	}
+
+	CHECK(index == 5);
+}
+#endif
+
+TEST_XML(dom_node_attribute_hinted, "<node attr1='1' attr2='2' attr3='3' />")
+{
+	xml_node node = doc.first_child();
+	xml_attribute attr1 = node.attribute(STR("attr1"));
+	xml_attribute attr2 = node.attribute(STR("attr2"));
+	xml_attribute attr3 = node.attribute(STR("attr3"));
+
+	xml_attribute hint;
+	CHECK(!xml_node().attribute(STR("test"), hint) && !hint);
+
+	CHECK(node.attribute(STR("attr2"), hint) == attr2 && hint == attr3);
+	CHECK(node.attribute(STR("attr3"), hint) == attr3 && !hint);
+
+	CHECK(node.attribute(STR("attr1"), hint) == attr1 && hint == attr2);
+	CHECK(node.attribute(STR("attr2"), hint) == attr2 && hint == attr3);
+	CHECK(node.attribute(STR("attr1"), hint) == attr1 && hint == attr2);
+	CHECK(node.attribute(STR("attr1"), hint) == attr1 && hint == attr2);
+
+	CHECK(!node.attribute(STR("attr"), hint) && hint == attr2);
+}

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_header_guard.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_header_iosfwd_1.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_header_iosfwd_2.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_header_iostream_1.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_header_iostream_2.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_header_only.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_header_string_1.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_header_string_2.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_header_string_iostream.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_memory.cpp Added

@@ -0,0 +1,301 @@
+#include "common.hpp"
+
+#include "writer_string.hpp"
+#include "allocator.hpp"
+
+#include <string>
+#include <vector>
+
+namespace
+{
+	int page_allocs = 0;
+	int page_deallocs = 0;
+
+	bool is_page(size_t size)
+	{
+		return size >= 16384;
+	}
+
+	void* allocate(size_t size)
+	{
+		void* ptr = memory_allocate(size);
+		page_allocs += is_page(memory_size(ptr));
+		return ptr;
+	}
+
+	void deallocate(void* ptr)
+	{
+		page_deallocs += is_page(memory_size(ptr));
+		memory_deallocate(ptr);
+	}
+}
+
+TEST(memory_custom_memory_management)
+{
+	page_allocs = page_deallocs = 0;
+
+	// remember old functions
+	allocation_function old_allocate = get_memory_allocation_function();
+	deallocation_function old_deallocate = get_memory_deallocation_function();
+
+	// replace functions
+	set_memory_management_functions(allocate, deallocate);
+
+	{
+		// parse document
+		xml_document doc;
+
+		CHECK(page_allocs == 0 && page_deallocs == 0);
+
+		CHECK(doc.load_string(STR("<node />")));
+	
+		CHECK(page_allocs == 1 && page_deallocs == 0);
+
+		// modify document (no new page)
+		CHECK(doc.first_child().set_name(STR("foobars")));
+		CHECK(page_allocs == 1 && page_deallocs == 0);
+
+		// modify document (new page)
+		std::basic_string<pugi::char_t> s(65536, 'x');
+
+		CHECK(doc.first_child().set_name(s.c_str()));
+		CHECK(page_allocs == 2 && page_deallocs == 0);
+
+		// modify document (new page, old one should die)
+		s += s;
+
+		CHECK(doc.first_child().set_name(s.c_str()));
+		CHECK(page_allocs == 3 && page_deallocs == 1);
+	}
+
+	CHECK(page_allocs == 3 && page_deallocs == 3);
+
+	// restore old functions
+	set_memory_management_functions(old_allocate, old_deallocate);
+}
+
+TEST(memory_large_allocations)
+{
+	page_allocs = page_deallocs = 0;
+
+	// remember old functions
+	allocation_function old_allocate = get_memory_allocation_function();
+	deallocation_function old_deallocate = get_memory_deallocation_function();
+
+	// replace functions
+	set_memory_management_functions(allocate, deallocate);
+
+	{
+		xml_document doc;
+
+		CHECK(page_allocs == 0 && page_deallocs == 0);
+
+		// initial fill
+		for (size_t i = 0; i < 128; ++i)
+		{
+			std::basic_string<pugi::char_t> s(i * 128, 'x');
+
+			CHECK(doc.append_child(node_pcdata).set_value(s.c_str()));
+		}
+
+		CHECK(page_allocs > 0 && page_deallocs == 0);
+
+		// grow-prune loop
+		while (doc.first_child())
+		{
+			pugi::xml_node node;
+
+			// grow
+			for (node = doc.first_child(); node; node = node.next_sibling())
+			{
+				std::basic_string<pugi::char_t> s = node.value();
+
+				CHECK(node.set_value((s + s).c_str()));
+			}
+
+			// prune
+			for (node = doc.first_child(); node; )
+			{
+				pugi::xml_node next = node.next_sibling().next_sibling();
+
+				node.parent().remove_child(node);
+
+				node = next;
+			}
+		}
+
+		CHECK(page_allocs == page_deallocs + 1); // only one live page left (it waits for new allocations)
+
+		char buffer;
+		CHECK(doc.load_buffer_inplace(&buffer, 0, parse_fragment, get_native_encoding()));
+
+		CHECK(page_allocs == page_deallocs); // no live pages left
+	}
+
+	CHECK(page_allocs == page_deallocs); // everything is freed
+
+	// restore old functions
+	set_memory_management_functions(old_allocate, old_deallocate);
+}
+
+TEST(memory_page_management)
+{
+	page_allocs = page_deallocs = 0;
+
+	// remember old functions
+	allocation_function old_allocate = get_memory_allocation_function();
+	deallocation_function old_deallocate = get_memory_deallocation_function();
+
+	// replace functions
+	set_memory_management_functions(allocate, deallocate);
+
+	{
+		xml_document doc;
+
+		CHECK(page_allocs == 0 && page_deallocs == 0);
+
+		// initial fill
+		std::vector<xml_node> nodes;
+
+		for (size_t i = 0; i < 4000; ++i)
+		{
+			xml_node node = doc.append_child(STR("node"));
+			CHECK(node);
+
+			nodes.push_back(node);
+		}
+
+		CHECK(page_allocs > 0 && page_deallocs == 0);
+
+		// grow-prune loop
+		size_t offset = 0;
+		size_t prime = 15485863;
+
+		while (nodes.size() > 0)
+		{
+			offset = (offset + prime) % nodes.size();
+
+			doc.remove_child(nodes[offset]);
+
+			nodes[offset] = nodes.back();
+			nodes.pop_back();
+		}
+
+		CHECK(page_allocs == page_deallocs + 1); // only one live page left (it waits for new allocations)
+
+		char buffer;
+		CHECK(doc.load_buffer_inplace(&buffer, 0, parse_fragment, get_native_encoding()));
+
+		CHECK(page_allocs == page_deallocs); // no live pages left
+	}
+
+	CHECK(page_allocs == page_deallocs); // everything is freed
+
+	// restore old functions
+	set_memory_management_functions(old_allocate, old_deallocate);
+}
+
+TEST(memory_string_allocate_increasing)
+{
+	xml_document doc;
+
+	doc.append_child(node_pcdata).set_value(STR("x"));
+
+	std::basic_string<char_t> s = STR("ab");
+
+	for (int i = 0; i < 17; ++i)
+	{
+		doc.append_child(node_pcdata).set_value(s.c_str());
+
+		s += s;
+	}
+
+	std::string result = save_narrow(doc, format_no_declaration | format_raw, encoding_utf8);
+
+	CHECK(result.size() == 262143);
+	CHECK(result[0] == 'x');
+
+	for (size_t j = 1; j < result.size(); ++j)
+	{
+		CHECK(result[j] == (j % 2 ? 'a' : 'b'));
+	}
+}
+
+TEST(memory_string_allocate_decreasing)
+{
+	xml_document doc;
+
+	std::basic_string<char_t> s = STR("ab");
+
+	for (int i = 0; i < 17; ++i) s += s;
+
+	for (int j = 0; j < 17; ++j)
+	{
+		s.resize(s.size() / 2);
+
+		doc.append_child(node_pcdata).set_value(s.c_str());
+	}
+
+	doc.append_child(node_pcdata).set_value(STR("x"));
+
+	std::string result = save_narrow(doc, format_no_declaration | format_raw, encoding_utf8);
+
+	CHECK(result.size() == 262143);
+	CHECK(result[result.size() - 1] == 'x');
+
+	for (size_t k = 0; k + 1 < result.size(); ++k)
+	{
+		CHECK(result[k] == (k % 2 ? 'b' : 'a'));
+	}
+}
+
+TEST(memory_string_allocate_increasing_inplace)
+{
+	xml_document doc;
+
+	xml_node node = doc.append_child(node_pcdata);
+
+	node.set_value(STR("x"));
+
+	std::basic_string<char_t> s = STR("ab");
+
+	for (int i = 0; i < 17; ++i)
+	{
+		node.set_value(s.c_str());
+
+		s += s;
+	}
+
+	std::string result = save_narrow(doc, format_no_declaration | format_raw, encoding_utf8);
+
+	CHECK(result.size() == 131072);
+
+	for (size_t j = 0; j < result.size(); ++j)
+	{
+		CHECK(result[j] == (j % 2 ? 'b' : 'a'));
+	}
+}
+
+TEST(memory_string_allocate_decreasing_inplace)
+{
+	xml_document doc;
+
+	xml_node node = doc.append_child(node_pcdata);
+
+	std::basic_string<char_t> s = STR("ab");
+
+	for (int i = 0; i < 17; ++i) s += s;
+
+	for (int j = 0; j < 17; ++j)
+	{
+		s.resize(s.size() / 2);
+
+		node.set_value(s.c_str());
+	}
+
+	node.set_value(STR("x"));
+
+	std::string result = save_narrow(doc, format_no_declaration | format_raw, encoding_utf8);
+
+	CHECK(result == "x");
+}

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_parse.cpp Added

@@ -0,0 +1,1141 @@
+#include "common.hpp"
+
+#include "writer_string.hpp"
+
+TEST(parse_pi_skip)
+{
+	xml_document doc;
+
+	unsigned int flag_sets[] = {parse_fragment, parse_fragment | parse_declaration};
+
+	for (unsigned int i = 0; i < sizeof(flag_sets) / sizeof(flag_sets[0]); ++i)
+	{
+		unsigned int flags = flag_sets[i];
+
+		CHECK(doc.load_string(STR("<?pi?><?pi value?>"), flags));
+		CHECK(!doc.first_child());
+
+		CHECK(doc.load_string(STR("<?pi <tag/> value?>"), flags));
+		CHECK(!doc.first_child());
+	}
+}
+
+TEST(parse_pi_parse)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<?pi1?><?pi2 value?>"), parse_fragment | parse_pi));
+
+	xml_node pi1 = doc.first_child();
+	xml_node pi2 = doc.last_child();
+
+	CHECK(pi1 != pi2);
+	CHECK(pi1.type() == node_pi);
+	CHECK_STRING(pi1.name(), STR("pi1"));
+	CHECK_STRING(pi1.value(), STR(""));
+	CHECK(pi2.type() == node_pi);
+	CHECK_STRING(pi2.name(), STR("pi2"));
+	CHECK_STRING(pi2.value(), STR("value"));
+}
+
+TEST(parse_pi_parse_spaces)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<?target \r\n\t value ?>"), parse_fragment | parse_pi));
+
+	xml_node pi = doc.first_child();
+
+	CHECK(pi.type() == node_pi);
+	CHECK_STRING(pi.name(), STR("target"));
+	CHECK_STRING(pi.value(), STR("value "));
+}
+
+TEST(parse_pi_error)
+{
+	xml_document doc;
+
+	unsigned int flag_sets[] = {parse_fragment, parse_fragment | parse_pi};
+
+	for (unsigned int i = 0; i < sizeof(flag_sets) / sizeof(flag_sets[0]); ++i)
+	{
+		unsigned int flags = flag_sets[i];
+
+		CHECK(doc.load_string(STR("<?"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<??"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?>"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?#?>"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name>"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name ?"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name?"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name? "), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name? "), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name "), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name "), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name "), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name value"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name value "), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name value "), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name value ?"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name value ? "), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name value ? >"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name value ? > "), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name&"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?name&?"), flags).status == status_bad_pi);
+	}
+	
+	CHECK(doc.load_string(STR("<?xx#?>"), parse_fragment | parse_pi).status == status_bad_pi);
+	CHECK(doc.load_string(STR("<?name&?>"), parse_fragment | parse_pi).status == status_bad_pi);
+	CHECK(doc.load_string(STR("<?name& x?>"), parse_fragment | parse_pi).status == status_bad_pi);
+}
+
+TEST(parse_comments_skip)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR(""), parse_fragment));
+	CHECK(!doc.first_child());
+}
+
+TEST(parse_comments_parse)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR(""), parse_fragment | parse_comments));
+
+	xml_node c1 = doc.first_child();
+	xml_node c2 = doc.last_child();
+
+	CHECK(c1 != c2);
+	CHECK(c1.type() == node_comment);
+	CHECK_STRING(c1.name(), STR(""));
+	CHECK_STRING(c1.value(), STR(""));
+	CHECK(c2.type() == node_comment);
+	CHECK_STRING(c2.name(), STR(""));
+	CHECK_STRING(c2.value(), STR("value"));
+}
+
+TEST(parse_comments_parse_no_eol)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR(""), parse_fragment | parse_comments));
+
+	xml_node c = doc.first_child();
+	CHECK(c.type() == node_comment);
+	CHECK_STRING(c.value(), STR("\r\rval1\rval2\r\nval3\nval4\r\r"));
+}
+
+TEST(parse_comments_parse_eol)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR(""), parse_fragment | parse_comments | parse_eol));
+
+	xml_node c = doc.first_child();
+	CHECK(c.type() == node_comment);
+	CHECK_STRING(c.value(), STR("\n\nval1\nval2\nval3\nval4\n\n"));
+}
+
+TEST(parse_comments_error)
+{
+	xml_document doc;
+
+	unsigned int flag_sets[] = {parse_fragment, parse_fragment | parse_comments, parse_fragment | parse_comments | parse_eol};
+
+	for (unsigned int i = 0; i < sizeof(flag_sets) / sizeof(flag_sets[0]); ++i)
+	{
+		unsigned int flags = flag_sets[i];
+
+		CHECK(doc.load_string(STR("<!-"), flags).status == status_bad_comment);
+		CHECK(doc.load_string(STR(""), flags).status == status_bad_comment);
+		CHECK(doc.load_string(STR("<!- -->"), flags).status == status_bad_comment);
+	}
+}
+
+TEST(parse_cdata_skip)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<![CDATA[]]><![CDATA[value]]>"), parse_fragment));
+	CHECK(!doc.first_child());
+}
+
+TEST(parse_cdata_skip_contents)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node><![CDATA[]]>hello<![CDATA[value]]>, world!</node>"), parse_fragment));
+	CHECK_NODE(doc, STR("<node>hello, world!</node>"));
+}
+
+TEST(parse_cdata_parse)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<![CDATA[]]><![CDATA[value]]>"), parse_fragment | parse_cdata));
+
+	xml_node c1 = doc.first_child();
+	xml_node c2 = doc.last_child();
+
+	CHECK(c1 != c2);
+	CHECK(c1.type() == node_cdata);
+	CHECK_STRING(c1.name(), STR(""));
+	CHECK_STRING(c1.value(), STR(""));
+	CHECK(c2.type() == node_cdata);
+	CHECK_STRING(c2.name(), STR(""));
+	CHECK_STRING(c2.value(), STR("value"));
+}
+
+TEST(parse_cdata_parse_no_eol)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<![CDATA[\r\rval1\rval2\r\nval3\nval4\r\r]]>"), parse_fragment | parse_cdata));
+
+	xml_node c = doc.first_child();
+	CHECK(c.type() == node_cdata);
+	CHECK_STRING(c.value(), STR("\r\rval1\rval2\r\nval3\nval4\r\r"));
+}
+
+TEST(parse_cdata_parse_eol)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<![CDATA[\r\rval1\rval2\r\nval3\nval4\r\r]]>"), parse_fragment | parse_cdata | parse_eol));
+
+	xml_node c = doc.first_child();
+	CHECK(c.type() == node_cdata);
+	CHECK_STRING(c.value(), STR("\n\nval1\nval2\nval3\nval4\n\n"));
+}
+
+TEST(parse_cdata_error)
+{
+	xml_document doc;
+
+	unsigned int flag_sets[] = {parse_fragment, parse_fragment | parse_cdata, parse_fragment | parse_cdata | parse_eol};
+
+	for (unsigned int i = 0; i < sizeof(flag_sets) / sizeof(flag_sets[0]); ++i)
+	{
+		unsigned int flags = flag_sets[i];
+
+		CHECK(doc.load_string(STR("<!["), flags).status == status_bad_cdata);
+		CHECK(doc.load_string(STR("<![C"), flags).status == status_bad_cdata);
+		CHECK(doc.load_string(STR("<![CD"), flags).status == status_bad_cdata);
+		CHECK(doc.load_string(STR("<![CDA"), flags).status == status_bad_cdata);
+		CHECK(doc.load_string(STR("<![CDAT"), flags).status == status_bad_cdata);
+		CHECK(doc.load_string(STR("<![CDATA"), flags).status == status_bad_cdata);
+		CHECK(doc.load_string(STR("<![CDATA["), flags).status == status_bad_cdata);
+		CHECK(doc.load_string(STR("<![CDATA[]"), flags).status == status_bad_cdata);
+		CHECK(doc.load_string(STR("<![CDATA[data"), flags).status == status_bad_cdata);
+		CHECK(doc.load_string(STR("<![CDATA[data]"), flags).status == status_bad_cdata);
+		CHECK(doc.load_string(STR("<![CDATA[data]]"), flags).status == status_bad_cdata);
+		CHECK(doc.load_string(STR("<![CDATA[>"), flags).status == status_bad_cdata);
+		CHECK(doc.load_string(STR("<![CDATA[ <![CDATA[]]><![CDATA ]]>"), flags).status == status_bad_cdata);
+	}
+}
+
+TEST(parse_ws_pcdata_skip)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR(" "), parse_fragment));
+	CHECK(!doc.first_child());
+
+	CHECK(doc.load_string(STR("<root> <node> </node> </root>"), parse_minimal));
+	
+	xml_node root = doc.child(STR("root"));
+	
+	CHECK(root.first_child() == root.last_child());
+	CHECK(!root.first_child().first_child());
+}
+
+TEST(parse_ws_pcdata_parse)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<root> <node> </node> </root>"), parse_minimal | parse_ws_pcdata));
+
+	xml_node root = doc.child(STR("root"));
+
+	xml_node c1 = root.first_child();
+	xml_node c2 = c1.next_sibling();
+	xml_node c3 = c2.next_sibling();
+
+	CHECK(c3 == root.last_child());
+
+	CHECK(c1.type() == node_pcdata);
+	CHECK_STRING(c1.value(), STR(" "));
+	CHECK(c3.type() == node_pcdata);
+	CHECK_STRING(c3.value(), STR(" "));
+
+	CHECK(c2.first_child() == c2.last_child());
+	CHECK(c2.first_child().type() == node_pcdata);
+	CHECK_STRING(c2.first_child().value(), STR(" "));
+}
+
+static int get_tree_node_count(xml_node n)
+{
+ int result = 1;
+
+ for (xml_node c = n.first_child(); c; c = c.next_sibling())
+ result += get_tree_node_count(c);
+
+ return result;
+}
+
+TEST(parse_ws_pcdata_permutations)
+{
+ struct test_data_t
+ {
+ unsigned int mask; // 1 = default flags, 2 = parse_ws_pcdata, 4 = parse_ws_pcdata_single
+ const pugi::char_t* source;
+ const pugi::char_t* result;
+ int nodes; // negative if parsing should fail
+ };
+
+ test_data_t test_data[] =
+ {
+ // external pcdata should be discarded (whitespace or not)
+ {7, STR("ext1<node/>"), STR("<node />"), 2},
+ {7, STR("ext1<node/>ext2"), STR("<node />"), 2},
+ {7, STR(" <node/>"), STR("<node />"), 2},
+ {7, STR("<node/> "), STR("<node />"), 2},
+ {7, STR(" <node/> "), STR("<node />"), 2},
+ // inner pcdata should be preserved
+ {7, STR("<node>inner</node>"), STR("<node>inner</node>"), 3},
+ {7, STR("<node>inner1<child/>inner2</node>"), STR("<node>inner1<child />inner2</node>"), 5},
+ {7, STR("<node>inner1<child>deep</child>inner2</node>"), STR("<node>inner1<child>deep</child>inner2</node>"), 6},
+ // empty pcdata nodes should never be created
+ {7, STR("<node>inner1<child></child>inner2</node>"), STR("<node>inner1<child />inner2</node>"), 5},
+ {7, STR("<node><child></child>inner2</node>"), STR("<node><child />inner2</node>"), 4},
+ {7, STR("<node>inner1<child></child></node>"), STR("<node>inner1<child /></node>"), 4},
+ {7, STR("<node><child></child></node>"), STR("<node><child /></node>"), 3},
+ // comments, pi or other nodes should not cause pcdata creation either
+ {7, STR("<node><child><?pi?></child><![CDATA[x]]></node>"), STR("<node><child /><![CDATA[x]]></node>"), 4},
+ // leading/trailing pcdata whitespace should be preserved (note: this will change if parse_ws_pcdata_trim is introduced)
+ {7, STR("<node>\t \tinner1<child> deep </child>\t\ninner2\n\t</node>"), STR("<node>\t \tinner1<child> deep </child>\t\ninner2\n\t</node>"), 6},
+ // whitespace-only pcdata preservation depends on the parsing mode
+ {1, STR("<node>\n\t<child> </child>\n\t<child> <deep> </deep> </child>\n\t\n\t</node>"), STR("<node><child /><child><deep /></child></node>"), 5},
+ {2, STR("<node>\n\t<child> </child>\n\t<child> <deep> </deep> </child>\n\t\n\t</node>"), STR("<node>\n\t<child> </child>\n\t<child> <deep> </deep> </child>\n\t\n\t</node>"), 13},
+ {4, STR("<node>\n\t<child> </child>\n\t<child> <deep> </deep> </child>\n\t\n\t</node>"), STR("<node><child> </child><child><deep> </deep></child></node>"), 7},
+ // current implementation of parse_ws_pcdata_single has an unfortunate bug; reproduce it here
+ {4, STR("<node>\t\t\n\n</node>"), STR("<node>\n\n</node>"), 3},
+ // error case: terminate PCDATA in the middle
+ {7, STR("<node>abcdef"), STR("<node>abcdef</node>"), -3},
+ {5, STR("<node> "), STR("<node />"), -2},
+ {2, STR("<node> "), STR("<node> </node>"), -3},
+ // error case: terminate PCDATA as early as possible
+ {7, STR("<node>"), STR("<node />"), -2},
+ {7, STR("<node>a"), STR("<node>a</node>"), -3},
+ {5, STR("<node> "), STR("<node />"), -2},
+ {2, STR("<node> "), STR("<node> </node>"), -3},
+ };
+
+ for (size_t i = 0; i < sizeof(test_data) / sizeof(test_data[0]); ++i)
+ {
+ const test_data_t& td = test_data[i];
+
+ for (int flag = 0; flag < 3; ++flag)
+ {
+ if (td.mask & (1 << flag))
+ {
+ unsigned int flags[] = {parse_default, parse_default | parse_ws_pcdata, parse_default | parse_ws_pcdata_single};
+
+ xml_document doc;
+ CHECK((td.nodes > 0) == doc.load_string(td.source, flags[flag]));
+ CHECK_NODE(doc, td.result);
+
+ int nodes = get_tree_node_count(doc);
+ CHECK((td.nodes < 0 ? -td.nodes : td.nodes) == nodes);
+ }
+ }
+ }
+}
+
+TEST(parse_ws_pcdata_fragment_permutations)
+{
+ struct test_data_t
+ {
+ unsigned int mask; // 1 = default flags, 2 = parse_ws_pcdata, 4 = parse_ws_pcdata_single
+ const pugi::char_t* source;
+ const pugi::char_t* result;
+ int nodes; // negative if parsing should fail
+ };
+
+ test_data_t test_data[] =
+ {
+ // external pcdata should be preserved
+ {7, STR("ext1"), STR("ext1"), 2},
+ {5, STR(" "), STR(""), 1},
+ {2, STR(" "), STR(" "), 2},
+ {7, STR("ext1<node/>"), STR("ext1<node />"), 3},
+ {7, STR("<node/>ext2"), STR("<node />ext2"), 3},
+ {7, STR("ext1<node/>ext2"), STR("ext1<node />ext2"), 4},
+ {7, STR("ext1<node1/>ext2<node2/>ext3"), STR("ext1<node1 />ext2<node2 />ext3"), 6},
+ {5, STR(" <node/>"), STR("<node />"), 2},
+ {2, STR(" <node/>"), STR(" <node />"), 3},
+ {5, STR("<node/> "), STR("<node />"), 2},
+ {2, STR("<node/> "), STR("<node /> "), 3},
+ {5, STR(" <node/> "), STR("<node />"), 2},
+ {2, STR(" <node/> "), STR(" <node /> "), 4},
+ {5, STR(" <node1/> <node2/> "), STR("<node1 /><node2 />"), 3},
+ {2, STR(" <node1/> <node2/> "), STR(" <node1 /> <node2 /> "), 6},
+ };
+
+ for (size_t i = 0; i < sizeof(test_data) / sizeof(test_data[0]); ++i)
+ {
+ const test_data_t& td = test_data[i];
+
+ for (int flag = 0; flag < 3; ++flag)
+ {
+ if (td.mask & (1 << flag))
+ {
+ unsigned int flags[] = {parse_default, parse_default | parse_ws_pcdata, parse_default | parse_ws_pcdata_single};
+
+ xml_document doc;
+ CHECK((td.nodes > 0) == doc.load_string(td.source, flags[flag] | parse_fragment));
+ CHECK_NODE(doc, td.result);
+
+ int nodes = get_tree_node_count(doc);
+ CHECK((td.nodes < 0 ? -td.nodes : td.nodes) == nodes);
+ }
+ }
+ }
+}
+
+TEST(parse_pcdata_no_eol)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<root>\r\rval1\rval2\r\nval3\nval4\r\r</root>"), parse_minimal));
+
+	CHECK_STRING(doc.child_value(STR("root")), STR("\r\rval1\rval2\r\nval3\nval4\r\r"));
+}
+
+TEST(parse_pcdata_eol)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<root>\r\rval1\rval2\r\nval3\nval4\r\r</root>"), parse_minimal | parse_eol));
+
+	CHECK_STRING(doc.child_value(STR("root")), STR("\n\nval1\nval2\nval3\nval4\n\n"));
+}
+
+TEST(parse_pcdata_skip_ext)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("pre<root/>post"), parse_minimal));
+	CHECK(doc.first_child() == doc.last_child());
+	CHECK(doc.first_child().type() == node_element);
+}
+
+TEST(parse_pcdata_error)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<root>pcdata"), parse_minimal).status == status_end_element_mismatch);
+}
+
+TEST(parse_pcdata_trim)
+{
+ struct test_data_t
+ {
+ const pugi::char_t* source;
+ const pugi::char_t* result;
+ unsigned int flags;
+ };
+
+ test_data_t test_data[] =
+ {
+ 	{ STR("<node> text</node>"), STR("text"), 0 },
+ 	{ STR("<node>\t\n text</node>"), STR("text"), 0 },
+ 	{ STR("<node>text </node>"), STR("text"), 0 },
+ 	{ STR("<node>text \t\n</node>"), STR("text"), 0 },
+ 	{ STR("<node>\r\n\t text \t\n\r</node>"), STR("text"), 0 },
+ 	{ STR(" text"), STR("text"), parse_fragment },
+ 	{ STR("\t\n text"), STR("text"), parse_fragment },
+ 	{ STR("text "), STR("text"), parse_fragment },
+ 	{ STR("text \t\n"), STR("text"), parse_fragment },
+ 	{ STR("\r\n\t text \t\n\r"), STR("text"), parse_fragment },
+ 	{ STR("<node>\r\n\t text \t\n\r more \r\n\t</node>"), STR("text \t\n\r more"), 0 },
+ 	{ STR("<node>\r\n\t text \t\n\r more \r\n\t</node>"), STR("text \t\n\n more"), parse_eol },
+ 	{ STR("<node>\r\n\t text \r\n\r\n\r\n\r\n\r\n\r\n\r\n more \r\n\t</node>"), STR("text \n\n\n\n\n\n\n more"), parse_eol },
+ 	{ STR("<node> test&amp;&amp;&amp;&amp;&amp;&amp;&amp; </node>"), STR("test&amp;&amp;&amp;&amp;&amp;&amp;&amp;"), 0 },
+ 	{ STR("<node> test&amp;&amp;&amp;&amp;&amp;&amp;&amp; </node>"), STR("test&&&&&&&"), parse_escapes },
+ { STR(" test&amp;&amp;&amp;&amp;&amp;&amp;&amp; "), STR("test&&&&&&&"), parse_fragment | parse_escapes },
+ { STR("<node>\r\n\t text \t\n\r m&amp;&amp;e \r\n\t</node>"), STR("text \t\n\n m&&e"), parse_eol | parse_escapes }
+ };
+
+ for (size_t i = 0; i < sizeof(test_data) / sizeof(test_data[0]); ++i)
+ {
+ const test_data_t& td = test_data[i];
+
+ xml_document doc;
+ CHECK(doc.load_string(td.source, td.flags | parse_trim_pcdata));
+
+ const pugi::char_t* value = doc.child(STR("node")) ? doc.child_value(STR("node")) : doc.text().get();
+ CHECK_STRING(value, td.result);
+ }
+}
+
+TEST(parse_pcdata_trim_empty)
+{
+	unsigned int flags[] = { 0, parse_ws_pcdata, parse_ws_pcdata_single, parse_ws_pcdata | parse_ws_pcdata_single };
+
+	for (size_t i = 0; i < sizeof(flags) / sizeof(flags[0]); ++i)
+	{
+		xml_document doc;
+		CHECK(doc.load_string(STR("<node> </node>"), flags[i] | parse_trim_pcdata));
+
+		xml_node node = doc.child(STR("node"));
+		CHECK(node);
+		CHECK(!node.first_child());
+	}
+}
+
+TEST(parse_escapes_skip)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node id='&lt;&gt;&amp;&apos;&quot;'>&lt;&gt;&amp;&apos;&quot;</node>"), parse_minimal));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id")).value(), STR("&lt;&gt;&amp;&apos;&quot;"));
+}
+
+TEST(parse_escapes_parse)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node id='&lt;&gt;&amp;&apos;&quot;'>&lt;&gt;&amp;&apos;&quot;</node>"), parse_minimal | parse_escapes));
+	CHECK_STRING(doc.child_value(STR("node")), STR("<>&'\""));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id")).value(), STR("<>&'\""));
+}
+
+TEST(parse_escapes_code)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node>&#1;&#32;&#x20;</node>"), parse_minimal | parse_escapes));
+	CHECK_STRING(doc.child_value(STR("node")), STR("\01 "));
+}
+
+TEST(parse_escapes_code_exhaustive_dec)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node>&#/;&#01;&#2;&#3;&#4;&#5;&#6;&#7;&#8;&#9;&#:;&#a;&#A;&#XA;</node>"), parse_minimal | parse_escapes));
+	CHECK_STRING(doc.child_value(STR("node")), STR("&#/;\x1\x2\x3\x4\x5\x6\x7\x8\x9&#:;&#a;&#A;&#XA;"));
+}
+
+TEST(parse_escapes_code_exhaustive_hex)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node>&#x/;&#x01;&#x2;&#x3;&#x4;&#x5;&#x6;&#x7;&#x8;&#x9;&#x:;&#x@;&#xA;&#xB;&#xC;&#xD;&#xE;&#xF;&#xG;&#x`;&#xa;&#xb;&#xc;&#xd;&#xe;&#xf;&#xg;</node>"), parse_minimal | parse_escapes));
+	CHECK_STRING(doc.child_value(STR("node")), STR("&#x/;\x1\x2\x3\x4\x5\x6\x7\x8\x9&#x:;&#x@;\xa\xb\xc\xd\xe\xf&#xG;&#x`;\xa\xb\xc\xd\xe\xf&#xg;"));
+}
+
+TEST(parse_escapes_code_restore)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node>&#1&#32;&#x1&#32;&#1-&#32;&#x1-&#32;</node>"), parse_minimal | parse_escapes));
+	CHECK_STRING(doc.child_value(STR("node")), STR("&#1 &#x1 &#1- &#x1- "));
+}
+
+TEST(parse_escapes_char_restore)
+{
+	xml_document doc;
+
+	CHECK(doc.load_string(STR("<node>&q&#32;&qu&#32;&quo&#32;&quot&#32;</node>"), parse_minimal | parse_escapes));
+	CHECK_STRING(doc.child_value(STR("node")), STR("&q &qu &quo &quot "));
+
+	CHECK(doc.load_string(STR("<node>&a&#32;&ap&#32;&apo&#32;&apos&#32;</node>"), parse_minimal | parse_escapes));
+	CHECK_STRING(doc.child_value(STR("node")), STR("&a &ap &apo &apos "));
+
+	CHECK(doc.load_string(STR("<node>&a&#32;&am&#32;&amp&#32;</node>"), parse_minimal | parse_escapes));
+	CHECK_STRING(doc.child_value(STR("node")), STR("&a &am &amp "));
+
+	CHECK(doc.load_string(STR("<node>&l&#32;&lt&#32;</node>"), parse_minimal | parse_escapes));
+	CHECK_STRING(doc.child_value(STR("node")), STR("&l &lt "));
+
+	CHECK(doc.load_string(STR("<node>&g&#32;&gt&#32;</node>"), parse_minimal | parse_escapes));
+	CHECK_STRING(doc.child_value(STR("node")), STR("&g &gt "));
+}
+
+TEST(parse_escapes_unicode)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node>&#x03B3;&#x03b3;&#x24B62;</node>"), parse_minimal | parse_escapes));
+
+#ifdef PUGIXML_WCHAR_MODE
+	const pugi::char_t* v = doc.child_value(STR("node"));
+
+	size_t wcharsize = sizeof(wchar_t);
+
+	CHECK(v[0] == 0x3b3 && v[1] == 0x3b3 && (wcharsize == 2 ? v[2] == wchar_cast(0xd852) && v[3] == wchar_cast(0xdf62) : v[2] == wchar_cast(0x24b62)));
+#else
+	CHECK_STRING(doc.child_value(STR("node")), "\xce\xb3\xce\xb3\xf0\xa4\xad\xa2");
+#endif
+}
+
+TEST(parse_escapes_error)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node>&#x03g;&#ab;&quot</node>"), parse_minimal | parse_escapes));
+	CHECK_STRING(doc.child_value(STR("node")), STR("&#x03g;&#ab;&quot"));
+
+	CHECK(!doc.load_string(STR("<node id='&#x12")));
+	CHECK(!doc.load_string(STR("<node id='&g")));
+	CHECK(!doc.load_string(STR("<node id='&gt")));
+	CHECK(!doc.load_string(STR("<node id='&l")));
+	CHECK(!doc.load_string(STR("<node id='&lt")));
+	CHECK(!doc.load_string(STR("<node id='&a")));
+	CHECK(!doc.load_string(STR("<node id='&amp")));
+	CHECK(!doc.load_string(STR("<node id='&apos")));
+}
+
+TEST(parse_escapes_code_invalid)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node>&#;&#x;&;&#x-;&#-;</node>"), parse_minimal | parse_escapes));
+	CHECK_STRING(doc.child_value(STR("node")), STR("&#;&#x;&;&#x-;&#-;"));
+}
+
+TEST(parse_escapes_attribute)
+{
+	xml_document doc;
+
+	for (int wnorm = 0; wnorm < 2; ++wnorm)
+		for (int eol = 0; eol < 2; ++eol)
+			for (int wconv = 0; wconv < 2; ++wconv)
+			{
+				unsigned int flags = parse_escapes;
+
+				flags |= (wnorm ? parse_wnorm_attribute : 0);
+				flags |= (eol ? parse_eol : 0);
+				flags |= (wconv ? parse_wconv_attribute : 0);
+
+				CHECK(doc.load_string(STR("<node id='&quot;'/>"), flags));
+				CHECK_STRING(doc.child(STR("node")).attribute(STR("id")).value(), STR("\""));
+			}
+}
+
+TEST(parse_attribute_spaces)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node id1='v1' id2 ='v2' id3= 'v3' id4 = 'v4' id5 \n\r\t = \r\t\n 'v5' />"), parse_minimal));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id1")).value(), STR("v1"));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id2")).value(), STR("v2"));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id3")).value(), STR("v3"));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id4")).value(), STR("v4"));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id5")).value(), STR("v5"));
+}
+
+TEST(parse_attribute_quot)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node id1='v1' id2=\"v2\"/>"), parse_minimal));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id1")).value(), STR("v1"));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id2")).value(), STR("v2"));
+}
+
+TEST(parse_attribute_no_eol_no_wconv)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node id=' \t\r\rval1 \rval2\r\nval3\nval4\r\r'/>"), parse_minimal));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id")).value(), STR(" \t\r\rval1 \rval2\r\nval3\nval4\r\r"));
+}
+
+TEST(parse_attribute_eol_no_wconv)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node id=' \t\r\rval1 \rval2\r\nval3\nval4\r\r'/>"), parse_minimal | parse_eol));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id")).value(), STR(" \t\n\nval1 \nval2\nval3\nval4\n\n"));
+}
+
+TEST(parse_attribute_no_eol_wconv)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node id=' \t\r\rval1 \rval2\r\nval3\nval4\r\r'/>"), parse_minimal | parse_wconv_attribute));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id")).value(), STR(" val1 val2 val3 val4 "));
+}
+
+TEST(parse_attribute_eol_wconv)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node id=' \t\r\rval1 \rval2\r\nval3\nval4\r\r'/>"), parse_minimal | parse_eol | parse_wconv_attribute));
+	CHECK_STRING(doc.child(STR("node")).attribute(STR("id")).value(), STR(" val1 val2 val3 val4 "));
+}
+
+TEST(parse_attribute_wnorm)
+{
+	xml_document doc;
+
+	for (int eol = 0; eol < 2; ++eol)
+		for (int wconv = 0; wconv < 2; ++wconv)
+		{
+			unsigned int flags = parse_minimal | parse_wnorm_attribute | (eol ? parse_eol : 0) | (wconv ? parse_wconv_attribute : 0);
+			CHECK(doc.load_string(STR("<node id=' \t\r\rval1 \rval2\r\nval3\nval4\r\r'/>"), flags));
+			CHECK_STRING(doc.child(STR("node")).attribute(STR("id")).value(), STR("val1 val2 val3 val4"));
+		}
+}
+
+TEST(parse_attribute_variations)
+{
+	xml_document doc;
+
+	for (int wnorm = 0; wnorm < 2; ++wnorm)
+		for (int eol = 0; eol < 2; ++eol)
+			for (int wconv = 0; wconv < 2; ++wconv)
+				for (int escapes = 0; escapes < 2; ++escapes)
+				{
+					unsigned int flags = parse_minimal;
+
+					flags |= (wnorm ? parse_wnorm_attribute : 0);
+					flags |= (eol ? parse_eol : 0);
+					flags |= (wconv ? parse_wconv_attribute : 0);
+					flags |= (escapes ? parse_escapes : 0);
+
+					CHECK(doc.load_string(STR("<node id='1'/>"), flags));
+					CHECK_STRING(doc.child(STR("node")).attribute(STR("id")).value(), STR("1"));
+				}
+}
+
+
+TEST(parse_attribute_error)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node id"), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id "), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id "), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id "), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id/"), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id/>"), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id?/>"), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id=/>"), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id='/>"), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id=\"/>"), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id=\"'/>"), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id='\"/>"), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id='\"/>"), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node #/>"), parse_minimal).status == status_bad_start_element);
+	CHECK(doc.load_string(STR("<node#/>"), parse_minimal).status == status_bad_start_element);
+	CHECK(doc.load_string(STR("<node id1='1'id2='2'/>"), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node id&='1'/>"), parse_minimal).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<node &='1'/>"), parse_minimal).status == status_bad_start_element);
+}
+
+TEST(parse_attribute_termination_error)
+{
+	xml_document doc;
+
+	for (int wnorm = 0; wnorm < 2; ++wnorm)
+		for (int eol = 0; eol < 2; ++eol)
+			for (int wconv = 0; wconv < 2; ++wconv)
+			{
+				unsigned int flags = parse_minimal;
+
+				flags |= (wnorm ? parse_wnorm_attribute : 0);
+				flags |= (eol ? parse_eol : 0);
+				flags |= (wconv ? parse_wconv_attribute : 0);
+
+				CHECK(doc.load_string(STR("<node id='value"), flags).status == status_bad_attribute);
+			}
+}
+
+TEST(parse_attribute_quot_inside)
+{
+	xml_document doc;
+
+	for (int wnorm = 0; wnorm < 2; ++wnorm)
+		for (int eol = 0; eol < 2; ++eol)
+			for (int wconv = 0; wconv < 2; ++wconv)
+			{
+				unsigned int flags = parse_escapes;
+
+				flags |= (wnorm ? parse_wnorm_attribute : 0);
+				flags |= (eol ? parse_eol : 0);
+				flags |= (wconv ? parse_wconv_attribute : 0);
+
+				CHECK(doc.load_string(STR("<node id1='\"' id2=\"'\"/>"), flags));
+				CHECK_STRING(doc.child(STR("node")).attribute(STR("id1")).value(), STR("\""));
+				CHECK_STRING(doc.child(STR("node")).attribute(STR("id2")).value(), STR("'"));
+			}
+}
+
+TEST(parse_tag_single)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node/><node /><node\n/>"), parse_minimal));
+	CHECK_NODE(doc, STR("<node /><node /><node />"));
+}
+
+TEST(parse_tag_hierarchy)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<node><n1><n2/></n1><n3><n4><n5></n5></n4></n3 \r\n></node>"), parse_minimal));
+	CHECK_NODE(doc, STR("<node><n1><n2 /></n1><n3><n4><n5 /></n4></n3></node>"));
+}
+
+TEST(parse_tag_error)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<"), parse_minimal).status == status_unrecognized_tag);
+	CHECK(doc.load_string(STR("<!"), parse_minimal).status == status_unrecognized_tag);
+	CHECK(doc.load_string(STR("<!D"), parse_minimal).status == status_unrecognized_tag);
+	CHECK(doc.load_string(STR("<#"), parse_minimal).status == status_unrecognized_tag);
+	CHECK(doc.load_string(STR("<node#"), parse_minimal).status == status_bad_start_element);
+	CHECK(doc.load_string(STR("<node"), parse_minimal).status == status_bad_start_element);
+	CHECK(doc.load_string(STR("<node/"), parse_minimal).status == status_bad_start_element);
+	CHECK(doc.load_string(STR("<node /"), parse_minimal).status == status_bad_start_element);
+	CHECK(doc.load_string(STR("<node / "), parse_minimal).status == status_bad_start_element);
+	CHECK(doc.load_string(STR("<node / >"), parse_minimal).status == status_bad_start_element);
+	CHECK(doc.load_string(STR("<node/ >"), parse_minimal).status == status_bad_start_element);
+	CHECK(doc.load_string(STR("</ node>"), parse_minimal).status == status_end_element_mismatch);
+	CHECK(doc.load_string(STR("</node"), parse_minimal).status == status_end_element_mismatch);
+	CHECK(doc.load_string(STR("</node "), parse_minimal).status == status_end_element_mismatch);
+	CHECK(doc.load_string(STR("<node></ node>"), parse_minimal).status == status_end_element_mismatch);
+	CHECK(doc.load_string(STR("<node></node"), parse_minimal).status == status_bad_end_element);
+	CHECK(doc.load_string(STR("<node></node "), parse_minimal).status == status_bad_end_element);
+	CHECK(doc.load_string(STR("<node></nodes>"), parse_minimal).status == status_end_element_mismatch);
+	CHECK(doc.load_string(STR("<node>"), parse_minimal).status == status_end_element_mismatch);
+	CHECK(doc.load_string(STR("<node/><"), parse_minimal).status == status_unrecognized_tag);
+	CHECK(doc.load_string(STR("<node attr='value'>"), parse_minimal).status == status_end_element_mismatch);
+	CHECK(doc.load_string(STR("</></node>"), parse_minimal).status == status_end_element_mismatch);
+	CHECK(doc.load_string(STR("</node>"), parse_minimal).status == status_end_element_mismatch);
+	CHECK(doc.load_string(STR("</>"), parse_minimal).status == status_end_element_mismatch);
+	CHECK(doc.load_string(STR("<node></node v>"), parse_minimal).status == status_bad_end_element);
+	CHECK(doc.load_string(STR("<node&/>"), parse_minimal).status == status_bad_start_element);
+	CHECK(doc.load_string(STR("<node& v='1'/>"), parse_minimal).status == status_bad_start_element);
+}
+
+TEST(parse_declaration_cases)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<?xml?><?xmL?><?xMl?><?xML?><?Xml?><?XmL?><?XMl?><?XML?>"), parse_fragment | parse_pi));
+	CHECK(!doc.first_child());
+}
+
+TEST(parse_declaration_attr_cases)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<?xml ?><?xmL ?><?xMl ?><?xML ?><?Xml ?><?XmL ?><?XMl ?><?XML ?>"), parse_fragment | parse_pi));
+	CHECK(!doc.first_child());
+}
+
+TEST(parse_declaration_skip)
+{
+	xml_document doc;
+
+	unsigned int flag_sets[] = {parse_fragment, parse_fragment | parse_pi};
+
+	for (unsigned int i = 0; i < sizeof(flag_sets) / sizeof(flag_sets[0]); ++i)
+	{
+		unsigned int flags = flag_sets[i];
+
+		CHECK(doc.load_string(STR("<?xml?><?xml version='1.0'?>"), flags));
+		CHECK(!doc.first_child());
+
+		CHECK(doc.load_string(STR("<?xml <tag/> ?>"), flags));
+		CHECK(!doc.first_child());
+	}
+}
+
+TEST(parse_declaration_parse)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("<?xml?><?xml version='1.0'?>"), parse_fragment | parse_declaration));
+
+	xml_node d1 = doc.first_child();
+	xml_node d2 = doc.last_child();
+
+	CHECK(d1 != d2);
+	CHECK(d1.type() == node_declaration);
+	CHECK_STRING(d1.name(), STR("xml"));
+	CHECK(d2.type() == node_declaration);
+	CHECK_STRING(d2.name(), STR("xml"));
+	CHECK_STRING(d2.attribute(STR("version")).value(), STR("1.0"));
+}
+
+TEST(parse_declaration_error)
+{
+	xml_document doc;
+
+	unsigned int flag_sets[] = {parse_fragment, parse_fragment | parse_declaration};
+
+	for (unsigned int i = 0; i < sizeof(flag_sets) / sizeof(flag_sets[0]); ++i)
+	{
+		unsigned int flags = flag_sets[i];
+
+		CHECK(doc.load_string(STR("<?xml"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?xml?"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?xml>"), flags).status == status_bad_pi);
+		CHECK(doc.load_string(STR("<?xml version='1>"), flags).status == status_bad_pi);
+	}
+	
+	CHECK(doc.load_string(STR("<?xml version='1?>"), parse_fragment | parse_declaration).status == status_bad_attribute);
+	CHECK(doc.load_string(STR("<foo><?xml version='1'?></foo>"), parse_fragment | parse_declaration).status == status_bad_pi);
+}
+
+TEST(parse_empty)
+{
+	xml_document doc;
+
+	CHECK(doc.load_string(STR("")).status == status_no_document_element && !doc.first_child());
+	CHECK(doc.load_string(STR(""), parse_fragment) && !doc.first_child());
+}
+
+TEST(parse_out_of_memory)
+{
+	test_runner::_memory_fail_threshold = 256;
+
+	xml_document doc;
+	CHECK_ALLOC_FAIL(CHECK(doc.load_string(STR("<foo a='1'/>")).status == status_out_of_memory));
+	CHECK(!doc.first_child());
+}
+
+TEST(parse_out_of_memory_halfway_node)
+{
+	const unsigned int count = 10000;
+	static char_t text[count * 4];
+
+	for (unsigned int i = 0; i < count; ++i)
+	{
+		text[4*i + 0] = '<';
+		text[4*i + 1] = 'n';
+		text[4*i + 2] = '/';
+		text[4*i + 3] = '>';
+	}
+
+	test_runner::_memory_fail_threshold = 65536;
+
+	xml_document doc;
+	CHECK_ALLOC_FAIL(CHECK(doc.load_buffer_inplace(text, count * 4).status == status_out_of_memory));
+	CHECK_NODE(doc.first_child(), STR("<n />"));
+}
+
+TEST(parse_out_of_memory_halfway_attr)
+{
+	const unsigned int count = 10000;
+	static char_t text[count * 5 + 4];
+
+	text[0] = '<';
+	text[1] = 'n';
+
+	for (unsigned int i = 0; i < count; ++i)
+	{
+		text[5*i + 2] = ' ';
+		text[5*i + 3] = 'a';
+		text[5*i + 4] = '=';
+		text[5*i + 5] = '"';
+		text[5*i + 6] = '"';
+	}
+
+	text[5 * count + 2] = '/';
+	text[5 * count + 3] = '>';
+
+	test_runner::_memory_fail_threshold = 65536;
+
+	xml_document doc;
+	CHECK_ALLOC_FAIL(CHECK(doc.load_buffer_inplace(text, count * 5 + 4).status == status_out_of_memory));
+	CHECK_STRING(doc.first_child().name(), STR("n"));
+	CHECK_STRING(doc.first_child().first_attribute().name(), STR("a"));
+	CHECK_STRING(doc.first_child().last_attribute().name(), STR("a"));
+}
+
+TEST(parse_out_of_memory_conversion)
+{
+	test_runner::_memory_fail_threshold = 256;
+
+	xml_document doc;
+	CHECK_ALLOC_FAIL(CHECK(doc.load_buffer("<foo\x90/>", 7, parse_default, encoding_latin1).status == status_out_of_memory));
+	CHECK(!doc.first_child());
+}
+
+TEST(parse_out_of_memory_allocator_state_sync)
+{
+	const unsigned int count = 10000;
+	static char_t text[count * 4];
+
+	for (unsigned int i = 0; i < count; ++i)
+	{
+		text[4*i + 0] = '<';
+		text[4*i + 1] = 'n';
+		text[4*i + 2] = '/';
+		text[4*i + 3] = '>';
+	}
+
+	test_runner::_memory_fail_threshold = 65536;
+
+	xml_document doc;
+	CHECK_ALLOC_FAIL(CHECK(doc.load_buffer_inplace(text, count * 4).status == status_out_of_memory));
+	CHECK_NODE(doc.first_child(), STR("<n />"));
+
+	test_runner::_memory_fail_threshold = 0;
+
+	for (unsigned int j = 0; j < count; ++j)
+		CHECK(doc.append_child(STR("n")));
+}
+
+static bool test_offset(const char_t* contents, unsigned int options, pugi::xml_parse_status status, ptrdiff_t offset)
+{
+	xml_document doc;
+	xml_parse_result res = doc.load_string(contents, options);
+
+	return res.status == status && res.offset == offset;
+}
+
+#define CHECK_OFFSET(contents, options, status, offset) CHECK(test_offset(STR(contents), options, status, offset))
+
+TEST(parse_error_offset)
+{
+	CHECK_OFFSET("<node/>", parse_default, status_ok, 0);
+
+	test_runner::_memory_fail_threshold = 1;
+	CHECK_ALLOC_FAIL(CHECK_OFFSET("<node/>", parse_default, status_out_of_memory, 0));
+	test_runner::_memory_fail_threshold = 0;
+
+	CHECK_OFFSET("<3d/>", parse_default, status_unrecognized_tag, 1);
+	CHECK_OFFSET(" <3d/>", parse_default, status_unrecognized_tag, 2);
+	CHECK_OFFSET(" <", parse_default, status_unrecognized_tag, 1);
+
+	CHECK_OFFSET("<?pi", parse_default, status_bad_pi, 3);
+	CHECK_OFFSET("<?pi", parse_default | parse_pi, status_bad_pi, 3);
+	CHECK_OFFSET("<?xml", parse_default | parse_declaration, status_bad_pi, 4);
+
+	CHECK_OFFSET("<!----", parse_default, status_bad_comment, 5);
+	CHECK_OFFSET("<!----", parse_default | parse_comments, status_bad_comment, 4);
+
+	CHECK_OFFSET("<![CDA", parse_default, status_bad_cdata, 5);
+	CHECK_OFFSET("<![CDATA[non-terminated]]", parse_default, status_bad_cdata, 9);
+
+	CHECK_OFFSET("<!DOCTYPE doc", parse_default, status_bad_doctype, 12);
+	CHECK_OFFSET("<!DOCTYPE greeting [ <!ATTLIST list type (bullets|ordered|glossary) \"orde", parse_default, status_bad_doctype, 76);
+
+	CHECK_OFFSET("<node", parse_default, status_bad_start_element, 4);
+	CHECK_OFFSET("<node ", parse_default, status_bad_start_element, 5);
+	CHECK_OFFSET("<nod%>", parse_default, status_bad_start_element, 5);
+
+	CHECK_OFFSET("<node a=2>", parse_default, status_bad_attribute, 8);
+	CHECK_OFFSET("<node a='2>", parse_default, status_bad_attribute, 9);
+
+	CHECK_OFFSET("<n></n $>", parse_default, status_bad_end_element, 7);
+	CHECK_OFFSET("<n></n", parse_default, status_bad_end_element, 5);
+
+	CHECK_OFFSET("<no></na>", parse_default, status_end_element_mismatch, 8);
+	CHECK_OFFSET("<no></nod>", parse_default, status_end_element_mismatch, 9);
+}
+
+TEST(parse_result_default)
+{
+	xml_parse_result result;
+
+	CHECK(!result);
+	CHECK(result.status == status_internal_error);
+	CHECK(result.offset == 0);
+	CHECK(result.encoding == encoding_auto);
+}
+
+TEST(parse_bom_fragment)
+{
+	struct test_data_t
+	{
+		xml_encoding encoding;
+		const char* data;
+		size_t size;
+		const char_t* text;
+	};
+
+	const test_data_t data[] =
+	{
+		{ encoding_utf8, "\xef\xbb\xbf", 3, STR("") },
+		{ encoding_utf8, "\xef\xbb\xbftest", 7, STR("test") },
+		{ encoding_utf16_be, "\xfe\xff", 2, STR("") },
+		{ encoding_utf16_be, "\xfe\xff\x00t\x00o\x00s\x00t", 10, STR("tost") },
+		{ encoding_utf16_le, "\xff\xfe", 2, STR("") },
+		{ encoding_utf16_le, "\xff\xfet\x00o\x00s\x00t\x00", 10, STR("tost") },
+		{ encoding_utf32_be, "\x00\x00\xfe\xff", 4, STR("") },
+		{ encoding_utf32_be, "\x00\x00\xfe\xff\x00\x00\x00t\x00\x00\x00o\x00\x00\x00s\x00\x00\x00t", 20, STR("tost") },
+		{ encoding_utf32_le, "\xff\xfe\x00\x00", 4, STR("") },
+		{ encoding_utf32_le, "\xff\xfe\x00\x00t\x00\x00\x00o\x00\x00\x00s\x00\x00\x00t\x00\x00\x00", 20, STR("tost") },
+	};
+
+	for (size_t i = 0; i < sizeof(data) / sizeof(data[0]); ++i)
+	{
+		xml_document doc;
+		CHECK(doc.load_buffer(data[i].data, data[i].size, parse_fragment, data[i].encoding));
+		CHECK_STRING(doc.text().get(), data[i].text);
+		CHECK(save_narrow(doc, format_no_declaration | format_raw | format_write_bom, data[i].encoding) == std::string(data[i].data, data[i].size));
+	}
+}
+
+TEST(parse_bom_fragment_invalid_utf8)
+{
+	xml_document doc;
+
+	CHECK(doc.load_buffer("\xef\xbb\xbb", 3, parse_fragment, encoding_utf8));
+
+	const char_t* value = doc.text().get();
+
+#ifdef PUGIXML_WCHAR_MODE
+	CHECK(value[0] == wchar_cast(0xfefb) && value[1] == 0);
+#else
+	CHECK_STRING(value, "\xef\xbb\xbb");
+#endif
+}
+
+TEST(parse_bom_fragment_invalid_utf16)
+{
+	xml_document doc;
+
+	CHECK(doc.load_buffer("\xff\xfe", 2, parse_fragment, encoding_utf16_be));
+
+	const char_t* value = doc.text().get();
+
+#ifdef PUGIXML_WCHAR_MODE
+	CHECK(value[0] == wchar_cast(0xfffe) && value[1] == 0);
+#else
+	CHECK_STRING(value, "\xef\xbf\xbe");
+#endif
+}
+
+TEST(parse_bom_fragment_invalid_utf32)
+{
+	xml_document doc;
+
+	CHECK(doc.load_buffer("\xff\xff\x00\x00", 4, parse_fragment, encoding_utf32_le));
+
+	const char_t* value = doc.text().get();
+
+#ifdef PUGIXML_WCHAR_MODE
+	CHECK(value[0] == wchar_cast(0xffff) && value[1] == 0);
+#else
+	CHECK_STRING(value, "\xef\xbf\xbf");
+#endif
+}
+
+TEST(parse_pcdata_gap_fragment)
+{
+	xml_document doc;
+	CHECK(doc.load_string(STR("a&amp;b"), parse_fragment | parse_escapes));
+	CHECK_STRING(doc.text().get(), STR("a&b"));
+}
+
+TEST(parse_name_end_eof)
+{
+	char_t test[] = STR("<node>");
+
+	xml_document doc;
+	CHECK(doc.load_buffer_inplace(test, 6 * sizeof(char_t)).status == status_end_element_mismatch);
+	CHECK_STRING(doc.first_child().name(), STR("node"));
+}
+
+TEST(parse_close_tag_eof)
+{
+	char_t test1[] = STR("<node></node");
+	char_t test2[] = STR("<node></nodx");
+
+	xml_document doc;
+	CHECK(doc.load_buffer_inplace(test1, 12 * sizeof(char_t)).status == status_bad_end_element);
+	CHECK_STRING(doc.first_child().name(), STR("node"));
+
+	CHECK(doc.load_buffer_inplace(test2, 12 * sizeof(char_t)).status == status_end_element_mismatch);
+	CHECK_STRING(doc.first_child().name(), STR("node"));
+}
+
+TEST(parse_fuzz_doctype)
+{
+	unsigned char data[] =
+	{
+		0x3b, 0x3c, 0x21, 0x44, 0x4f, 0x43, 0x54, 0x59, 0x50, 0x45, 0xef, 0xbb, 0xbf, 0x3c, 0x3f, 0x78,
+		0x6d, 0x6c, 0x20, 0x76, 0x65, 0x72, 0x73, 0x69, 0x6f, 0x6e, 0x3d, 0x22, 0x31, 0x2e, 0x30, 0x22,
+		0x3f, 0x3e, 0x3c, 0x21, 0x2d, 0x2d, 0x20, 0xe9, 0x80, 0xb1, 0xe5, 0xa0, 0xb1, 0xe3, 0x82, 0xb4,
+		0xe3, 0x83, 0xb3, 0x20, 0xef, 0x83, 0x97, 0xe3, 0xa9, 0x2a, 0x20, 0x2d, 0x2d, 0x3e
+	};
+
+	xml_document doc;
+	CHECK(doc.load_buffer(data, sizeof(data)).status == status_bad_doctype);
+}

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_parse_doctype.cpp Added

@@ -0,0 +1,364 @@
+#define _CRT_SECURE_NO_WARNINGS
+
+#include "common.hpp"
+
+#include <string.h>
+#include <wchar.h>
+#include <string>
+
+static xml_parse_result load_concat(xml_document& doc, const char_t* a, const char_t* b = STR(""), const char_t* c = STR(""))
+{
+	char_t buffer[768];
+
+#ifdef PUGIXML_WCHAR_MODE
+	wcscpy(buffer, a);
+	wcscat(buffer, b);
+	wcscat(buffer, c);
+#else
+	strcpy(buffer, a);
+	strcat(buffer, b);
+	strcat(buffer, c);
+#endif
+
+	return doc.load_string(buffer, parse_fragment);
+}
+
+static bool test_doctype_wf(const char_t* decl)
+{
+	xml_document doc;
+
+	// standalone
+	if (!load_concat(doc, decl) || !doc.first_child().empty()) return false;
+
+	// pcdata pre/postfix
+	if (!load_concat(doc, STR("a"), decl) || !test_node(doc, STR("a"), STR(""), format_raw)) return false;
+	if (!load_concat(doc, decl, STR("b")) || !test_node(doc, STR("b"), STR(""), format_raw)) return false;
+	if (!load_concat(doc, STR("a"), decl, STR("b")) || !test_node(doc, STR("ab"), STR(""), format_raw)) return false;
+
+	// node pre/postfix
+	if (!load_concat(doc, STR("<nodea/>"), decl) || !test_node(doc, STR("<nodea />"), STR(""), format_raw)) return false;
+	if (!load_concat(doc, decl, STR("<nodeb/>")) || !test_node(doc, STR("<nodeb />"), STR(""), format_raw)) return false;
+	if (!load_concat(doc, STR("<nodea/>"), decl, STR("<nodeb/>")) || !test_node(doc, STR("<nodea /><nodeb />"), STR(""), format_raw)) return false;
+
+ // check load-store contents preservation
+ CHECK(doc.load_string(decl, parse_doctype | parse_fragment));
+ CHECK_NODE(doc, decl);
+
+	return true;
+}
+
+static bool test_doctype_nwf(const char_t* decl)
+{
+	xml_document doc;
+
+	// standalone
+	if (load_concat(doc, decl).status != status_bad_doctype) return false;
+
+	// pcdata postfix
+	if (load_concat(doc, decl, STR("b")).status != status_bad_doctype) return false;
+
+	// node postfix
+	if (load_concat(doc, decl, STR("<nodeb/>")).status != status_bad_doctype) return false;
+
+	return true;
+}
+
+#define TEST_DOCTYPE_WF(contents) CHECK(test_doctype_wf(STR(contents)))
+#define TEST_DOCTYPE_NWF(contents) CHECK(test_doctype_nwf(STR(contents)))
+
+TEST(parse_doctype_skip)
+{
+	TEST_DOCTYPE_WF("<!DOCTYPE doc>");
+	TEST_DOCTYPE_WF("<!DOCTYPE doc SYSTEM 'foo'>");
+	TEST_DOCTYPE_WF("<!DOCTYPE doc SYSTEM \"foo\">");
+	TEST_DOCTYPE_WF("<!DOCTYPE doc PUBLIC \"foo\" 'bar'>");
+	TEST_DOCTYPE_WF("<!DOCTYPE doc PUBLIC \"foo'\">");
+	TEST_DOCTYPE_WF("<!DOCTYPE doc SYSTEM 'foo' [<!ELEMENT foo 'ANY'>]>");
+}
+
+TEST(parse_doctype_error)
+{
+	TEST_DOCTYPE_NWF("<!DOCTYPE");
+	TEST_DOCTYPE_NWF("<!DOCTYPE doc");
+	TEST_DOCTYPE_NWF("<!DOCTYPE doc SYSTEM 'foo");
+	TEST_DOCTYPE_NWF("<!DOCTYPE doc SYSTEM \"foo");
+	TEST_DOCTYPE_NWF("<!DOCTYPE doc PUBLIC \"foo\" 'bar");
+	TEST_DOCTYPE_NWF("<!DOCTYPE doc PUBLIC \"foo'\"");
+	TEST_DOCTYPE_NWF("<!DOCTYPE doc SYSTEM 'foo' [<!ELEMENT foo 'ANY");
+	TEST_DOCTYPE_NWF("<!DOCTYPE doc SYSTEM 'foo' [<!ELEMENT foo 'ANY'>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE doc SYSTEM 'foo' [<!ELEMENT foo 'ANY'>]");
+	TEST_DOCTYPE_NWF("<!DOCTYPE doc SYSTEM 'foo' [<!ELEMENT foo 'ANY'>] ");
+}
+
+// Examples from W3C recommendations
+TEST(parse_doctype_w3c_wf)
+{
+	TEST_DOCTYPE_WF("<!DOCTYPE greeting SYSTEM \"hello.dtd\">");
+	TEST_DOCTYPE_WF("<!DOCTYPE greeting [ <!ELEMENT greeting (#PCDATA)> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE greeting [ <!ATTLIST list type (bullets|ordered|glossary) \"ordered\"> <!ATTLIST form method CDATA #FIXED \"POST\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE greeting [ <!ENTITY % draft 'INCLUDE' > <!ENTITY % final 'IGNORE' > <![%draft;[ <!ELEMENT book (comments*, title, body, supplements?)> ]]> <![%final;[ <!ELEMENT book (title, body, supplements?)> ]]>]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE greeting [ <!ENTITY open-hatch PUBLIC \"-//Textuality//TEXT Standard open-hatch boilerplate//EN\" \"http://www.textuality.com/boilerplate/OpenHatch.xml\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE greeting [ <!ENTITY EndAttr \"27'\" > ]>");
+}
+
+TEST(parse_doctype_w3c_nwf)
+{
+	TEST_DOCTYPE_NWF("<!DOCTYPE greeting SYSTEM \"hello.dtd>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE greeting SYSTEM");
+	TEST_DOCTYPE_NWF("<!DOCTYPE greeting [ <!ELEMENT greeting (#PCDATA)> ]");
+	TEST_DOCTYPE_NWF("<!DOCTYPE greeting [ <!ELEMENT greeting (#PCDATA)>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE greeting [ <!ELEMENT greeting (#PCDATA");
+	TEST_DOCTYPE_NWF("<!DOCTYPE greeting [ ");
+	TEST_DOCTYPE_NWF("<!DOCTYPE greeting [ <!ATTLIST list type (bullets|ordered|glossary) \"ordered\"> ]");
+	TEST_DOCTYPE_NWF("<!DOCTYPE greeting [ <!ATTLIST list type (bullets|ordered|glossary) \"ordered\">");
+	TEST_DOCTYPE_NWF("<!DOCTYPE greeting [ <!ATTLIST list type (bullets|ordered|glossary) \"orde");
+	TEST_DOCTYPE_NWF("<!DOCTYPE greeting [ <!ATTLIST list type (bullets|ordered|glossary) ");
+	TEST_DOCTYPE_NWF("<!DOCTYPE greeting [ <!ENTITY open-hatch PUBLIC \"-//Textuality//TEXT Standard open-hatch boilerplate//EN\" \"http://www.textuality.com/boilerplate/OpenHatch.x");
+}
+
+// Examples from xmlsuite
+TEST(parse_doctype_xmlconf_eduni_1)
+{
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!NOTATION gif SYSTEM \"file:///usr/X11R6/bin/xv\"> <!ENTITY declared SYSTEM \"xyzzy\" NDATA gif> <!ATTLIST foo bar ENTITY \"7\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!NOTATION gif SYSTEM \"file:///usr/X11R6/bin/xv\"> <!ENTITY declared SYSTEM \"xyzzy\" NDATA gif> <!ATTLIST foo bar ENTITY \"undeclared\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ENTITY % e SYSTEM \"E60.ent\"> %e; ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ENTITY e \"an &unparsed; entity\"> <!NOTATION gif SYSTEM \"file:///usr/X11R6/bin/xv\"> <!ENTITY unparsed SYSTEM \"xyzzy\" NDATA gif> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ATTLIST foo bar CDATA #IMPLIED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ATTLIST foo xml:lang CDATA #IMPLIED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ENTITY e SYSTEM \"E38.ent\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo SYSTEM \"E36.dtd\">");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ELEMENT bar (foo|foo)> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!NOTATION one SYSTEM \"file:///usr/bin/awk\"> <!ATTLIST foo bar NOTATION (one|one) #IMPLIED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ATTLIST foo bar (one|one) #IMPLIED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ATTLIST foo xml:lang NMTOKEN #IMPLIED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ENTITY gt \">\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ATTLIST foo bar NMTOKENS #IMPLIED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ENTITY % pe SYSTEM \"subdir1/E18-pe\"> %pe; %intpe; ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo (PCDATA|foo)*> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo (foo*)> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo (foo*)> <!ENTITY space \"&#38;#32;\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo (foo*)> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo (foo*)> <!ENTITY space \" \"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo EMPTY> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo EMPTY> <!ENTITY empty \"\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <![INCLUDE[<!ATTLIST foo bar CDATA #IMPLIED>]]> <![IGNORE[some junk]]> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ENTITY % pe \"hello\">  <!ENTITY ent \"%pe; &#33; &forward;\"> <!ENTITY forward \"goodbye\"> ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ENTITY % e \"bar CDATA #IMPLIED>\"> <!ATTLIST foo %e;");
+	TEST_DOCTYPE_NWF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ENTITY % e \"bar CDATA #IMPLIED>\"> <!ATTLIST foo %e; ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ENTITY ent SYSTEM 'E18-ent'> ]>");
+}
+
+TEST(parse_doctype_xmlconf_eduni_2)
+{
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ENTITY % pe \"<!ENTITY ent1 'text'>\"> %pe; <!ELEMENT foo ANY> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ENTITY ent SYSTEM \"ent\"> <!ELEMENT foo ANY> <!ATTLIST foo a CDATA \"contains &ent; reference\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ATTLIST foo id ID #IMPLIED> <!ATTLIST foo ref IDREF \"undef\"> <!ATTLIST foo ent ENTITY \"undef\">  <!ENTITY ent SYSTEM \"foo\" NDATA not> <!NOTATION not SYSTEM \"not\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo EMPTY> <!ATTLIST foo a (one|two|three) \"four\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ATTLIST foo a NOTATION (not) \"not2\"> <!NOTATION not SYSTEM \"not\"> <!NOTATION not2 SYSTEM \"not2\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo EMPTY> <!ATTLIST foo a NMTOKENS \"34+\"> ]>");
+}
+
+TEST(parse_doctype_xmlconf_eduni_3)
+{
+	TEST_DOCTYPE_WF("<!DOCTYPE animal [ <!ELEMENT animal ANY> <?_\xd9\x9f an only legal per 5th edition extender #x65f in PITarget ?> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT root ANY> <!ELEMENT \xc2\xb7_BadName EMPTY> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE doc [ <!ENTITY e \"<X&#xe5c;></X&#xe5c;>\"> ]>");
+}
+
+TEST(parse_doctype_xmlconf_eduni_4)
+{
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ENTITY a:b \"bogus\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ATTLIST foo xmlns:a CDATA #IMPLIED xmlns:b NMTOKEN #IMPLIED xmlns:c CDATA #IMPLIED> <!ELEMENT bar ANY> <!ATTLIST bar a:attr CDATA #IMPLIED b:attr CDATA #IMPLIED c:attr CDATA #IMPLIED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ATTLIST foo xmlns:a CDATA #IMPLIED xmlns:b CDATA #IMPLIED xmlns:c CDATA #IMPLIED> <!ELEMENT bar ANY> <!ATTLIST bar a:attr CDATA #IMPLIED b:attr CDATA #IMPLIED c:attr CDATA #IMPLIED> <!ENTITY tilde \"~\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT xmlns:foo EMPTY> ]>");
+}
+
+TEST(parse_doctype_xmlconf_eduni_5)
+{
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ENTITY e \"&#x0c;\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo (foo*)> <!ENTITY e \"abc&#x85;def\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE foo [ <!ELEMENT foo ANY> <!ATTLIST foo bar NMTOKENS #IMPLIED> <!ENTITY val \"abc&#x85;def\"> ]>");
+}
+
+TEST(parse_doctype_xmlconf_ibm_1)
+{
+	TEST_DOCTYPE_WF("<!DOCTYPE animal SYSTEM \"ibm32i04.dtd\" [ <!ATTLIST animal xml:space (default|preserve) 'preserve'> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT root (a,b)> <!ELEMENT a EMPTY> <!ELEMENT b (#PCDATA|c)* > <!ELEMENT c ANY> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT root (PCDATA|b)* > <!ELEMENT b (#PCDATA) > <!ATTLIST b attr1 CDATA #REQUIRED> <!ATTLIST b attr2 (abc|def) \"abc\"> <!ATTLIST b attr3 CDATA #FIXED \"fixed\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE test [ <!ELEMENT test ANY> <!ELEMENT landscape EMPTY> <!ENTITY parsedentity1 SYSTEM \"ibm56iv01.xml\"> <!ENTITY parsedentity2 SYSTEM \"ibm56iv02.xml\"> <!ATTLIST landscape sun ENTITIES #IMPLIED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE test [ <!ELEMENT test ANY> <!ELEMENT landscape EMPTY> <!ENTITY image1 SYSTEM \"d:\\testspec\\images\\sunset.gif\" NDATA gif> <!ENTITY image2 SYSTEM \"d:\\testspec\\images\\frontpag.gif\" NDATA gif> <!ATTLIST landscape sun ENTITIES #IMPLIED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE tokenizer [ <!ELEMENT tokenizer ANY> <!ATTLIST tokenizer UniqueName ID #FIXED \"AC1999\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE test [ <!ELEMENT test ANY> <!ELEMENT blob (#PCDATA)> <!NOTATION base64 SYSTEM \"mimecode\"> <!NOTATION uuencode SYSTEM \"uudecode\"> <!ATTLIST blob content-encoding NOTATION (base64|uuencode|raw|ascii) #REQUIRED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE test [ <!ELEMENT test ANY> <!ELEMENT a EMPTY> <!ELEMENT nametoken EMPTY> <!ATTLIST nametoken namevalue NMTOKEN \"@#$\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT root (#PCDATA)* > <!ENTITY % pe1 SYSTEM \"ibm68i04.ent\"> %pe1; ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT a EMPTY> <!ATTLIST a attr1 CDATA \"&ge1;\">  <!ENTITY ge1 \"abcdef\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ENTITY ge1 \"abcdef\"> <!ELEMENT a EMPTY> <!ATTLIST a attr1 CDATA \"&ge1;\"> <!ENTITY % pe2 \"<!ATTLIST a attr2 CDATA #IMPLIED>\"> %pe3;  ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT root (#PCDATA)> <!ATTLIST root att CDATA #IMPLIED> <!ENTITY % pe1 '<!ATTLIST root att2 CDATA \"&ge1;\">'> <!ENTITY ge1 \"attdefaultvalue\" > %pe1;  <!ENTITY ge2 SYSTEM \"image.jpg\" NDATA JPGformat> ]>");
+}
+
+TEST(parse_doctype_xmlconf_ibm_2)
+{
+	TEST_DOCTYPE_WF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)> <!ENTITY gewithElemnetDecl \"<!ELEMENT bogus ANY>\"> <!ATTLIST student att1 CDATA #REQUIRED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)> <!ENTITY gewithlt \"abcd&#x26;&#x23;x3c;\"> <!ATTLIST student att1 CDATA #REQUIRED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)> <!ENTITY gewithlt \"abcd&#x3c;\"> <!ATTLIST student att1 CDATA #REQUIRED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE 5A_name_starts_with_digit [ <!ELEMENT 5A_name_starts_with_digit EMPTY> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)> <!ENTITY FullName \"Snow&Man\"> ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)> <!ENTITY FullName \"Snow\"Man\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)> <!ATTLIST student first CDATA #REQUIRED middle CDATA #IMPLIED last CDATA #IMPLIED > <!ENTITY myfirst \"Snow\"> <!ENTITY mymiddle \"I\"> <!ENTITY mylast \"Man\"> ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE student SYSTEM 'student.DTD [ <!ELEMENT student (#PCDATA)> ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)> <!ENTITY info PUBLIC '..\\info.dtd> ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)> <!ENTITY info PUBLIC '..\\info'.dtd'> ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)> <!ENTITY info PUBLIC \"..\\info.dtd> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student [ <!ENTITY info PUBLIC \"This is a {test} \" \"student.dtd\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE aniaml [ <!ELEMENT animal ANY> <!ENTITY generalE \"leopard\"> &generalE; <!ENTITY % parameterE \"<!ELEMENT leopard EMPTY>\"> %parameterE; ] animal>");
+	TEST_DOCTYPE_WF("<!DOCTYPE animal SYSTEM \"ibm28an01.dtd\" [ <!ELEMENT animal (cat|tiger|leopard)+> <!NOTATION animal_class SYSTEM \"ibm29v01.txt\"> <!ELEMENT cat ANY> <!ENTITY forcat \"This is a small cat\"> <!ELEMENT tiger (#PCDATA)> <!ELEMENT small EMPTY> <!ELEMENT big EMPTY> <!ATTLIST tiger color CDATA #REQUIRED> <?sound \"This is a PI\" ?>  ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE animal [ <!ELEMENT animal ANY> <!ENTITY % parameterE \"cat SYSTEM\"> <!NOTATION %parameterE; \"cat.txt\"> ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE animal [ <!ELEMENT animal ANY> <!ENTITY % parameterE \"A music file -->\">   <!ELEMENT > ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT root (#PCDATA)> <!ELEMENT a ANY> <!ELEMENT b ANY>  <!ELEMENT aElement ((a|b),,a)? > ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT root (#PCDATA)> <!ELEMENT a ANY>  <!ATTLIST a attr1 CDATA \"default\"attr2 ID #required> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE test [ <!ELEMENT test ANY> <!ELEMENT one EMPTY> <!ELEMENT two EMPTY> <!NOTATION this SYSTEM \"alpha\"> <!ATTLIST three attr NOTATION (\"this\") #IMPLIED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [  <![ include [ <!ELEMENT tiger EMPTY> <!ELEMENT animal ANY> ]]>   ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <![[INCLUDE[ <!ELEMENT tiger EMPTY> <!ELEMENT animal ANY> ]]> ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE root [ <?[INCLUDE[ <!ELEMENT tiger EMPTY> <!ELEMENT animal ANY> ]]> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <![[ <!ELEMENT tiger EMPTY> <!ELEMENT animal ANY> ]]> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <![INCLUDE <!ELEMENT tiger EMPTY> <!ELEMENT animal ANY> ]]> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <![ <!ELEMENT tiger EMPTY> <!ELEMENT animal ANY> [INCLUDE ]]> ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE root [ <![ INCLUDE [ <!ELEMENT tiger EMPTY> <!ELEMENT animal ANY> ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE root [ <![INCLUDE[ ]> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT root (#PCDATA)>  %paaa; <!ENTITY % paaa \"<!ATTLIST root att CDATA #IMPLIED>\"> <!ENTITY aaa \"aString\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT root (#PCDATA)> <!ATTLIST root att CDATA #IMPLIED>  <!ENTITY% paaa \"\"> %paaa; ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE root [ <!ELEMENT root (#PCDATA)> <!ATTLIST root att CDATA #IMPLIED>  <!ENTITY % paaa \"\" %paaa; ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root PUBLIC \"-//W3C//DTD//EN\"\"empty.dtd\" [ <!ELEMENT root (#PCDATA)> <!ATTLIST root att CDATA #IMPLIED> ]>");
+}
+
+TEST(parse_doctype_xmlconf_ibm_3)
+{
+	TEST_DOCTYPE_WF("<!DOCTYPE animal [ <!ELEMENT animal (cat|tiger|leopard)+> <!ELEMENT cat EMPTY> <!ELEMENT tiger (#PCDATA)> <!ELEMENT leopard ANY> <!ELEMENT small EMPTY> <!ELEMENT big EMPTY> <!ATTLIST tiger color CDATA #REQUIRED> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE book [ <!ELEMENT book ANY>  <?NAME target ?> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)> <!ATTLIST student first CDATA #REQUIRED middle CDATA #IMPLIED last CDATA #REQUIRED > <!ENTITY myfirst \"Snow\"> <!ENTITY mymiddle \"I\"> <!ENTITY mylast 'Man &myfirst; and &myfirst; mymiddle;.'> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student SYSTEM 'student.dtd'[ ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)> <!ENTITY unref SYSTEM \"\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student PUBLIC \"\" \"student.dtd\"[ ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student PUBLIC '' 'student.dtd'[ ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student PUBLIC \"The big ' in it\" \"student.dtd\"[ ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student PUBLIC 'The latest version' 'student.dtd'[ ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student PUBLIC \"#x20 #xD #xA abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ -'()+,./:=?;!*#@$_% \" \"student.dtd\"[ ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)>  ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE student [ <!ELEMENT student (#PCDATA)>  ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE animal [ <![INCLUDE[ <!ENTITY % rootElement \"<!ELEMENT animal ANY>\"> ]]> %rootElement;  <!ENTITY % make_tiger_element \"<!ELEMENT tiger EMPTY>\"> %make_tiger_element; <![IGNORE[ <!ELEMENT animal EMPTY> ]]> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT root (a,b)> <!ELEMENT a EMPTY> <!ELEMENT b (#PCDATA|c)* > <!ELEMENT c ANY> <!ENTITY inContent \"General entity reference in element content\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT a EMPTY> <!ELEMENT b (#PCDATA|c)* > <!ELEMENT c ANY>  <!ENTITY % seq1 \"(a,b,c)\"> <!ELEMENT child1 %seq1; >  <!ENTITY % seq2 \"a,b\"> <!ELEMENT child2 (%seq2;,c) > ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <![IGNORE[ Everything is ignored within an ignored section, except the sub-section delimiters '<![' and ']]>'. These must be balanced <!ok ]]> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <![IGNORE[ Everything is ignored within an ignored section, except the sub-section delimiters '<![' and ']]>'. These must be balanced <![ <!ELEMENT animal EMPTY> ]]> ]]> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <![IGNORE[ begin Everything is ignored within an ignored section, except the sub-section delimiters '<![' and ']]>'. These must be balanced <![ <!ELEMENT animal EMPTY> ]]> nesting <![ <!ELEMENT tiger (#PCDATA)> ]]> nesting again <![ <!ELEMENT abc ANY> ]]> end ]]> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!DOCTYPE root SYSTEM \"ibm69v01.dtd\" [ <!ELEMENT root (#PCDATA|a)* > <!ENTITY % pe1 \"\"> %pe1; ]> ]>");
+}
+
+TEST(parse_doctype_xmlconf_oasis_1)
+{
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT doc EMPTY> <!ENTITY % ent1 \"\"> <!ENTITY ent2 \"text2\"> <!ENTITY % ent3 \" "), parse_full | parse_fragment) && doc.first_child().type() == node_comment && doc.last_child().type() == node_comment && doc.first_child().next_sibling() == doc.last_child());
+	CHECK(doc.load_string(STR("<?xmla <!DOCTYPE <[ CDATA [</doc> &a%b&#c?>"), parse_full | parse_fragment) && doc.first_child().type() == node_pi && doc.first_child() == doc.last_child());
+}
+
+TEST(parse_doctype_xmlconf_xmltest_1)
+{
+	TEST_DOCTYPE_NWF("<!DOCTYPE root [ <![ INCLUDE [ <!ELEMENT doc (#PCDATA)> ]> ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE root [ <!ELEMENT doc (#PCDATA)> <![ IGNORE [");
+	TEST_DOCTYPE_NWF("<!DOCTYPE root [ <!ELEMENT doc (#PCDATA)> <![ IGNORE [ ]>");
+	TEST_DOCTYPE_NWF("<!DOCTYPE root [ <!ELEMENT doc (#PCDATA)> <![ INCLUDE [");
+	TEST_DOCTYPE_NWF("<!DOCTYPE root [ <!ELEMENT doc (#PCDATA)> <![ INCLUDE [ ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE root [ <!ELEMENT doc EMPTY> <!ENTITY % e \"");
+	TEST_DOCTYPE_WF("<!DOCTYPE doc [ <!NOTATION foo PUBLIC \"[\" \"null.ent\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE doc [ <!ELEMENT doc (#PCDATA)> <!ATTLIST doc a CDATA #IMPLIED> <!ENTITY e '\"'> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE doc [ <!ENTITY e \"<foo a='&#38;'></foo>\"> ]>");
+	TEST_DOCTYPE_WF("<!DOCTYPE doc [ <!ELEMENT doc (#PCDATA)> <!ENTITY e \"<![CDATA[Tim & Michael]]>\"> ]>");
+}
+
+TEST_XML_FLAGS(parse_doctype_value, "<!DOCTYPE doc [ <!ELEMENT doc (#PCDATA)> <!ENTITY e \"<![CDATA[Tim & Michael]]>\"> ]>", parse_fragment | parse_doctype)
+{
+ xml_node n = doc.first_child();
+
+ CHECK(n.type() == node_doctype);
+ CHECK_STRING(n.value(), STR("doc [ <!ELEMENT doc (#PCDATA)> <!ENTITY e \"<![CDATA[Tim & Michael]]>\"> ]"));
+}
+
+TEST(parse_doctype_error_toplevel)
+{
+ xml_document doc;
+ CHECK(doc.load_string(STR("<node><!DOCTYPE></node>")).status == status_bad_doctype);
+ CHECK(doc.load_string(STR("<node><!DOCTYPE></node>"), parse_doctype).status == status_bad_doctype);
+}
+
+TEST(parse_doctype_error_ignore)
+{
+ xml_document doc;
+	CHECK(doc.load_string(STR("<!DOCTYPE root [ <![IGNORE[ ")).status == status_bad_doctype);
+	CHECK(doc.load_string(STR("<!DOCTYPE root [ <![IGNORE[ "), parse_doctype).status == status_bad_doctype);
+	CHECK(doc.load_string(STR("<!DOCTYPE root [ <![IGNORE[ <![INCLUDE[")).status == status_bad_doctype);
+	CHECK(doc.load_string(STR("<!DOCTYPE root [ <![IGNORE[ <![INCLUDE["), parse_doctype).status == status_bad_doctype);
+}
+
+TEST(parse_doctype_stackless_group)
+{
+	std::basic_string<char_t> str;
+
+	int count = 100000;
+
+	str += STR("<!DOCTYPE ");
+
+	for (int i = 0; i < count; ++i)
+		str += STR("<!G ");
+
+	for (int j = 0; j < count; ++j)
+		str += STR(">");
+
+	str += STR(">");
+
+	xml_document doc;
+	CHECK(doc.load_string(str.c_str(), parse_fragment));
+}
+
+TEST(parse_doctype_stackless_ignore)
+{
+	std::basic_string<char_t> str;
+
+	int count = 100000;
+
+	str += STR("<!DOCTYPE ");
+
+	for (int i = 0; i < count; ++i)
+		str += STR("<![IGNORE[ ");
+
+	for (int j = 0; j < count; ++j)
+		str += STR("]]>");
+
+	str += STR(">");
+
+	xml_document doc;
+	CHECK(doc.load_string(str.c_str(), parse_fragment));
+}

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_unicode.cpp Added

@@ -0,0 +1,151 @@
+#ifndef PUGIXML_NO_STL
+
+#include "common.hpp"
+
+#include <string>
+
+// letters taken from http://www.utf8-chartable.de/
+
+TEST(as_wide_empty)
+{
+	CHECK(as_wide("") == L"");
+}
+
+TEST(as_wide_valid_basic)
+{
+	// valid 1-byte, 2-byte and 3-byte inputs
+#ifdef U_LITERALS
+	CHECK(as_wide("?\xd0\x80\xe2\x80\xbd") == L"?\u0400\u203D");
+#else
+	CHECK(as_wide("?\xd0\x80\xe2\x80\xbd") == L"?\x0400\x203D");
+#endif
+}
+
+TEST(as_wide_valid_astral)
+{
+	// valid 4-byte input
+	std::basic_string<wchar_t> b4 = as_wide("\xf2\x97\x98\xa4 \xf4\x80\x8f\xbf");
+
+	size_t wcharsize = sizeof(wchar_t);
+
+	if (wcharsize == 4)
+	{
+		CHECK(b4.size() == 3 && b4[0] == wchar_cast(0x97624) && b4[1] == L' ' && b4[2] == wchar_cast(0x1003ff));
+	}
+	else
+	{
+		CHECK(b4.size() == 5 && b4[0] == wchar_cast(0xda1d) && b4[1] == wchar_cast(0xde24) && b4[2] == L' ' && b4[3] == wchar_cast(0xdbc0) && b4[4] == wchar_cast(0xdfff));
+	}
+}
+
+TEST(as_wide_invalid)
+{
+	// invalid 1-byte input
+	CHECK(as_wide("a\xb0") == L"a");
+	CHECK(as_wide("a\xb0_") == L"a_");
+
+	// invalid 2-byte input
+	CHECK(as_wide("a\xc0") == L"a");
+	CHECK(as_wide("a\xd0") == L"a");
+	CHECK(as_wide("a\xc0_") == L"a_");
+	CHECK(as_wide("a\xd0_") == L"a_");
+
+	// invalid 3-byte input
+	CHECK(as_wide("a\xe2\x80") == L"a");
+	CHECK(as_wide("a\xe2") == L"a");
+	CHECK(as_wide("a\xe2\x80_") == L"a_");
+	CHECK(as_wide("a\xe2_") == L"a_");
+
+	// invalid 4-byte input
+	CHECK(as_wide("a\xf2\x97\x98") == L"a");
+	CHECK(as_wide("a\xf2\x97") == L"a");
+	CHECK(as_wide("a\xf2") == L"a");
+	CHECK(as_wide("a\xf2\x97\x98_") == L"a_");
+	CHECK(as_wide("a\xf2\x97_") == L"a_");
+	CHECK(as_wide("a\xf2_") == L"a_");
+
+	// invalid 5-byte input
+	std::basic_string<wchar_t> b5 = as_wide("\xf8\nbcd");
+	CHECK(b5 == L"\nbcd");
+}
+
+TEST(as_wide_string)
+{
+ std::string s = "abcd";
+
+ CHECK(as_wide(s) == L"abcd");
+}
+
+TEST(as_utf8_empty)
+{
+	CHECK(as_utf8(L"") == "");
+}
+
+TEST(as_utf8_valid_basic)
+{
+	// valid 1-byte, 2-byte and 3-byte outputs
+#ifdef U_LITERALS
+	CHECK(as_utf8(L"?\u0400\u203D") == "?\xd0\x80\xe2\x80\xbd");
+#else
+	CHECK(as_utf8(L"?\x0400\x203D") == "?\xd0\x80\xe2\x80\xbd");
+#endif
+}
+
+TEST(as_utf8_valid_astral)
+{
+	// valid 4-byte output
+	size_t wcharsize = sizeof(wchar_t);
+
+	if (wcharsize == 4)
+	{
+		std::basic_string<wchar_t> s;
+		s.resize(3);
+		s[0] = wchar_cast(0x97624);
+		s[1] = ' ';
+		s[2] = wchar_cast(0x1003ff);
+
+		CHECK(as_utf8(s.c_str()) == "\xf2\x97\x98\xa4 \xf4\x80\x8f\xbf");
+	}
+	else
+	{
+	#ifdef U_LITERALS
+		CHECK(as_utf8(L"\uda1d\ude24 \udbc0\udfff") == "\xf2\x97\x98\xa4 \xf4\x80\x8f\xbf");
+	#else
+		CHECK(as_utf8(L"\xda1d\xde24 \xdbc0\xdfff") == "\xf2\x97\x98\xa4 \xf4\x80\x8f\xbf");
+	#endif
+	}
+}
+
+TEST(as_utf8_invalid)
+{
+	size_t wcharsize = sizeof(wchar_t);
+
+	if (wcharsize == 2)
+	{
+		// check non-terminated degenerate handling
+	#ifdef U_LITERALS
+		CHECK(as_utf8(L"a\uda1d") == "a");
+		CHECK(as_utf8(L"a\uda1d_") == "a_");
+	#else
+		CHECK(as_utf8(L"a\xda1d") == "a");
+		CHECK(as_utf8(L"a\xda1d_") == "a_");
+	#endif
+
+		// check incorrect leading code
+	#ifdef U_LITERALS
+		CHECK(as_utf8(L"a\ude24") == "a");
+		CHECK(as_utf8(L"a\ude24_") == "a_");
+	#else
+		CHECK(as_utf8(L"a\xde24") == "a");
+		CHECK(as_utf8(L"a\xde24_") == "a_");
+	#endif
+	}
+}
+
+TEST(as_utf8_string)
+{
+ std::basic_string<wchar_t> s = L"abcd";
+
+ CHECK(as_utf8(s) == "abcd");
+}
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_version.cpp Added

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_write.cpp Added

@@ -0,0 +1,640 @@
+#include "common.hpp"
+
+#include "writer_string.hpp"
+
+#include <string>
+#include <sstream>
+#include <stdexcept>
+
+TEST_XML(write_simple, "<node attr='1'><child>text</child></node>")
+{
+	CHECK_NODE_EX(doc, STR("<node attr=\"1\">\n<child>text</child>\n</node>\n"), STR(""), 0);
+}
+
+TEST_XML(write_raw, "<node attr='1'><child>text</child></node>")
+{
+	CHECK_NODE_EX(doc, STR("<node attr=\"1\"><child>text</child></node>"), STR(""), format_raw);
+}
+
+TEST_XML(write_indent, "<node attr='1'><child>text</child></node>")
+{
+	CHECK_NODE_EX(doc, STR("<node attr=\"1\">\n\t<child>\n\t\ttext\n\t</child>\n</node>\n"), STR("\t"), format_indent);
+}
+
+TEST_XML(write_indent_attributes, "<node attr='1' other='2'><child>text</child></node>")
+{
+	CHECK_NODE_EX(doc, STR("<node\n\tattr=\"1\"\n\tother=\"2\">\n\t<child>\n\t\ttext\n\t</child>\n</node>\n"), STR("\t"), format_indent_attributes);
+}
+
+TEST_XML(write_indent_attributes_empty_element, "<node attr='1' other='2' />")
+{
+	CHECK_NODE_EX(doc, STR("<node\n\tattr=\"1\"\n\tother=\"2\" />\n"), STR("\t"), format_indent_attributes);
+}
+
+TEST_XML_FLAGS(write_indent_attributes_declaration, "<?xml version=\"1.0\" encoding=\"UTF-8\"?><node attr='1' other='2' />", parse_full)
+{
+	CHECK_NODE_EX(doc, STR("<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<node\n\tattr=\"1\"\n\tother=\"2\" />\n"), STR("\t"), format_indent_attributes);
+}
+
+TEST_XML(write_indent_attributes_raw, "<node attr='1' other='2'><child>text</child></node>")
+{
+	CHECK_NODE_EX(doc, STR("<node attr=\"1\" other=\"2\"><child>text</child></node>"), STR("\t"), format_indent_attributes | format_raw);
+}
+
+TEST_XML(write_indent_attributes_empty_indent, "<node attr='1' other='2'><child>text</child></node>")
+{
+	CHECK_NODE_EX(doc, STR("<node\nattr=\"1\"\nother=\"2\">\n<child>\ntext\n</child>\n</node>\n"), STR(""), format_indent_attributes);
+}
+
+TEST_XML(write_pcdata, "<node attr='1'><child>text</child></node>")
+{
+	CHECK_NODE_EX(doc, STR("<node attr=\"1\">\n\t<child>\n\t\ttext</child>\n</node>\n"), STR("\t"), format_indent);
+}
+
+TEST_XML_FLAGS(write_cdata, "<![CDATA[value]]>", parse_cdata | parse_fragment)
+{
+	CHECK_NODE(doc, STR("<![CDATA[value]]>"));
+	CHECK_NODE_EX(doc, STR("<![CDATA[value]]>"), STR(""), 0);
+}
+
+TEST_XML_FLAGS(write_cdata_empty, "<![CDATA[]]>", parse_cdata | parse_fragment)
+{
+	CHECK_NODE(doc, STR("<![CDATA[]]>"));
+	CHECK_NODE_EX(doc, STR("<![CDATA[]]>"), STR(""), 0);
+}
+
+TEST_XML_FLAGS(write_cdata_escape, "<![CDATA[value]]>", parse_cdata | parse_fragment)
+{
+	CHECK_NODE(doc, STR("<![CDATA[value]]>"));
+
+	doc.first_child().set_value(STR("1]]>2]]>3"));
+	CHECK_NODE(doc, STR("<![CDATA[1]]]]><![CDATA[>2]]]]><![CDATA[>3]]>"));
+}
+
+TEST_XML(write_cdata_inner, "<node><![CDATA[value]]></node>")
+{
+	CHECK_NODE(doc, STR("<node><![CDATA[value]]></node>"));
+	CHECK_NODE_EX(doc, STR("<node><![CDATA[value]]></node>\n"), STR(""), 0);
+}
+
+TEST(write_cdata_null)
+{
+	xml_document doc;
+	doc.append_child(node_cdata);
+	doc.append_child(STR("node")).append_child(node_cdata);
+
+	CHECK_NODE(doc, STR("<![CDATA[]]><node><![CDATA[]]></node>"));
+}
+
+TEST_XML_FLAGS(write_comment, "", parse_comments | parse_fragment)
+{
+	CHECK_NODE(doc, STR(""));
+	CHECK_NODE_EX(doc, STR("\n"), STR(""), 0);
+}
+
+TEST(write_comment_invalid)
+{
+	xml_document doc;
+	xml_node child = doc.append_child(node_comment);
+
+	CHECK_NODE(doc, STR(""));
+
+	child.set_value(STR("-"));
+	CHECK_NODE(doc, STR(""));
+
+	child.set_value(STR("--"));
+	CHECK_NODE(doc, STR(""));
+
+	child.set_value(STR("---"));
+	CHECK_NODE(doc, STR(""));
+
+	child.set_value(STR("-->"));
+	CHECK_NODE(doc, STR(""));
+
+	child.set_value(STR("-->-"));
+	CHECK_NODE(doc, STR(""));
+}
+
+TEST(write_comment_null)
+{
+	xml_document doc;
+	doc.append_child(node_comment);
+
+	CHECK_NODE(doc, STR(""));
+}
+
+TEST_XML_FLAGS(write_pi, "<?name value?>", parse_pi | parse_fragment)
+{
+	CHECK_NODE(doc, STR("<?name value?>"));
+	CHECK_NODE_EX(doc, STR("<?name value?>\n"), STR(""), 0);
+}
+
+TEST(write_pi_null)
+{
+	xml_document doc;
+	xml_node node = doc.append_child(node_pi);
+
+	CHECK_NODE(doc, STR("<?:anonymous?>"));
+
+	node.set_value(STR("value"));
+
+	CHECK_NODE(doc, STR("<?:anonymous value?>"));
+}
+
+TEST(write_pi_invalid)
+{
+	xml_document doc;
+	xml_node node = doc.append_child(node_pi);
+
+	node.set_name(STR("test"));
+	node.set_value(STR("?"));
+
+	CHECK_NODE(doc, STR("<?test ?") STR("?>"));
+
+	node.set_value(STR("?>"));
+
+	CHECK_NODE(doc, STR("<?test ? >?>"));
+
+	node.set_value(STR("<?foo?>"));
+
+	CHECK_NODE(doc, STR("<?test <?foo? >?>"));
+}
+
+TEST_XML_FLAGS(write_declaration, "<?xml version='2.0'?>", parse_declaration | parse_fragment)
+{
+	CHECK_NODE(doc, STR("<?xml version=\"2.0\"?>"));
+	CHECK_NODE_EX(doc, STR("<?xml version=\"2.0\"?>\n"), STR(""), 0);
+}
+
+TEST_XML_FLAGS(write_doctype, "<!DOCTYPE id [ foo ]>", parse_doctype | parse_fragment)
+{
+	CHECK_NODE(doc, STR("<!DOCTYPE id [ foo ]>"));
+	CHECK_NODE_EX(doc, STR("<!DOCTYPE id [ foo ]>\n"), STR(""), 0);
+}
+
+TEST(write_doctype_null)
+{
+	xml_document doc;
+	doc.append_child(node_doctype);
+
+	CHECK_NODE(doc, STR("<!DOCTYPE>"));
+}
+
+TEST_XML(write_escape, "<node attr=''>text</node>")
+{
+	doc.child(STR("node")).attribute(STR("attr")) = STR("<>'\"&\x04\r\n\t");
+	doc.child(STR("node")).first_child().set_value(STR("<>'\"&\x04\r\n\t"));
+
+	CHECK_NODE(doc, STR("<node attr=\"&lt;&gt;'&quot;&amp;&#04;&#13;&#10;\t\">&lt;&gt;'\"&amp;&#04;\r\n\t</node>"));
+}
+
+TEST_XML(write_escape_unicode, "<node attr='&#x3c00;'/>")
+{
+#ifdef PUGIXML_WCHAR_MODE
+	#ifdef U_LITERALS
+		CHECK_NODE(doc, STR("<node attr=\"\u3c00\" />"));
+	#else
+		CHECK_NODE(doc, STR("<node attr=\"\x3c00\" />"));
+	#endif
+#else
+	CHECK_NODE(doc, STR("<node attr=\"\xe3\xb0\x80\" />"));
+#endif
+}
+
+TEST_XML(write_no_escapes, "<node attr=''>text</node>")
+{
+	doc.child(STR("node")).attribute(STR("attr")) = STR("<>'\"&\x04\r\n\t");
+	doc.child(STR("node")).first_child().set_value(STR("<>'\"&\x04\r\n\t"));
+
+	CHECK_NODE_EX(doc, STR("<node attr=\"<>'\"&\x04\r\n\t\"><>'\"&\x04\r\n\t</node>"), STR(""), format_raw | format_no_escapes);
+}
+
+struct test_writer: xml_writer
+{
+	std::basic_string<pugi::char_t> contents;
+
+	virtual void write(const void* data, size_t size)
+	{
+		CHECK(size % sizeof(pugi::char_t) == 0);
+		contents.append(static_cast<const pugi::char_t*>(data), size / sizeof(pugi::char_t));
+	}
+};
+
+TEST_XML(write_print_writer, "<node/>")
+{
+	test_writer writer;
+	doc.print(writer, STR(""), format_default, get_native_encoding());
+
+	CHECK(writer.contents == STR("<node />\n"));
+}
+
+#ifndef PUGIXML_NO_STL
+TEST_XML(write_print_stream, "<node/>")
+{
+	std::ostringstream oss;
+	doc.print(oss, STR(""), format_default, encoding_utf8);
+
+	CHECK(oss.str() == "<node />\n");
+}
+
+TEST_XML(write_print_stream_encode, "<n/>")
+{
+	std::ostringstream oss;
+	doc.print(oss, STR(""), format_default, encoding_utf16_be);
+
+	CHECK(oss.str() == std::string("\x00<\x00n\x00 \x00/\x00>\x00\n", 12));
+}
+
+TEST_XML(write_print_stream_wide, "<node/>")
+{
+	std::basic_ostringstream<wchar_t> oss;
+	doc.print(oss, STR(""), format_default, encoding_utf8);
+
+	CHECK(oss.str() == L"<node />\n");
+}
+#endif
+
+TEST_XML(write_huge_chunk, "<node/>")
+{
+	std::basic_string<pugi::char_t> name(10000, STR('n'));
+	doc.child(STR("node")).set_name(name.c_str());
+
+	test_writer writer;
+	doc.print(writer, STR(""), format_default, get_native_encoding());
+
+	CHECK(writer.contents == STR("<") + name + STR(" />\n"));
+}
+
+TEST(write_encodings)
+{
+	static char s_utf8[] = "<\x54\xC2\xA2\xE2\x82\xAC\xF0\xA4\xAD\xA2/>";
+
+	xml_document doc;
+	CHECK(doc.load_buffer(s_utf8, sizeof(s_utf8), parse_default, encoding_utf8));
+
+	CHECK(write_narrow(doc, format_default, encoding_utf8) == "<\x54\xC2\xA2\xE2\x82\xAC\xF0\xA4\xAD\xA2 />\n");
+
+	CHECK(test_write_narrow(doc, format_default, encoding_utf32_le, "<\x00\x00\x00\x54\x00\x00\x00\xA2\x00\x00\x00\xAC\x20\x00\x00\x62\x4B\x02\x00 \x00\x00\x00/\x00\x00\x00>\x00\x00\x00\n\x00\x00\x00", 36));
+	CHECK(test_write_narrow(doc, format_default, encoding_utf32_be, "\x00\x00\x00<\x00\x00\x00\x54\x00\x00\x00\xA2\x00\x00\x20\xAC\x00\x02\x4B\x62\x00\x00\x00 \x00\x00\x00/\x00\x00\x00>\x00\x00\x00\n", 36));
+	CHECK(write_narrow(doc, format_default, encoding_utf32) == write_narrow(doc, format_default, is_little_endian() ? encoding_utf32_le : encoding_utf32_be));
+
+	CHECK(test_write_narrow(doc, format_default, encoding_utf16_le, "<\x00\x54\x00\xA2\x00\xAC\x20\x52\xd8\x62\xdf \x00/\x00>\x00\n\x00", 20));
+	CHECK(test_write_narrow(doc, format_default, encoding_utf16_be, "\x00<\x00\x54\x00\xA2\x20\xAC\xd8\x52\xdf\x62\x00 \x00/\x00>\x00\n", 20));
+	CHECK(write_narrow(doc, format_default, encoding_utf16) == write_narrow(doc, format_default, is_little_endian() ? encoding_utf16_le : encoding_utf16_be));
+
+	size_t wcharsize = sizeof(wchar_t);
+	std::basic_string<wchar_t> v = write_wide(doc, format_default, encoding_wchar);
+
+	if (wcharsize == 4)
+	{
+		CHECK(v.size() == 9 && v[0] == '<' && v[1] == 0x54 && v[2] == 0xA2 && v[3] == 0x20AC && v[4] == wchar_cast(0x24B62) && v[5] == ' ' && v[6] == '/' && v[7] == '>' && v[8] == '\n');
+	}
+	else
+	{
+		CHECK(v.size() == 10 && v[0] == '<' && v[1] == 0x54 && v[2] == 0xA2 && v[3] == 0x20AC && v[4] == wchar_cast(0xd852) && v[5] == wchar_cast(0xdf62) && v[6] == ' ' && v[7] == '/' && v[8] == '>' && v[9] == '\n');
+	}
+
+ CHECK(test_write_narrow(doc, format_default, encoding_latin1, "<\x54\xA2?? />\n", 9));
+}
+
+#ifdef PUGIXML_WCHAR_MODE
+TEST(write_encoding_huge)
+{
+	const unsigned int N = 16000;
+
+	// make a large utf16 name consisting of 6-byte char pairs (6 does not divide internal buffer size, so will need split correction)
+	std::string s_utf16 = std::string("\x00<", 2);
+
+	for (unsigned int i = 0; i < N; ++i) s_utf16 += "\x20\xAC\xd8\x52\xdf\x62";
+
+	s_utf16 += std::string("\x00/\x00>", 4);
+
+	xml_document doc;
+	CHECK(doc.load_buffer(&s_utf16[0], s_utf16.length(), parse_default, encoding_utf16_be));
+
+	std::string s_utf8 = "<";
+
+	for (unsigned int j = 0; j < N; ++j) s_utf8 += "\xE2\x82\xAC\xF0\xA4\xAD\xA2";
+
+	s_utf8 += " />\n";
+
+	CHECK(test_write_narrow(doc, format_default, encoding_utf8, s_utf8.c_str(), s_utf8.length()));
+}
+
+TEST(write_encoding_huge_invalid)
+{
+	size_t wcharsize = sizeof(wchar_t);
+
+	if (wcharsize == 2)
+	{
+		const unsigned int N = 16000;
+
+		// make a large utf16 name consisting of leading surrogate chars
+		std::basic_string<wchar_t> s_utf16;
+
+		for (unsigned int i = 0; i < N; ++i) s_utf16 += static_cast<wchar_t>(0xd852);
+
+		xml_document doc;
+		doc.append_child().set_name(s_utf16.c_str());
+
+		CHECK(test_write_narrow(doc, format_default, encoding_utf8, "< />\n", 5));
+	}
+}
+#else
+TEST(write_encoding_huge)
+{
+	const unsigned int N = 16000;
+
+	// make a large utf8 name consisting of 3-byte chars (3 does not divide internal buffer size, so will need split correction)
+	std::string s_utf8 = "<";
+
+	for (unsigned int i = 0; i < N; ++i) s_utf8 += "\xE2\x82\xAC";
+
+	s_utf8 += "/>";
+
+	xml_document doc;
+	CHECK(doc.load_buffer(&s_utf8[0], s_utf8.length(), parse_default, encoding_utf8));
+
+	std::string s_utf16 = std::string("\x00<", 2);
+
+	for (unsigned int j = 0; j < N; ++j) s_utf16 += "\x20\xAC";
+
+	s_utf16 += std::string("\x00 \x00/\x00>\x00\n", 8);
+
+	CHECK(test_write_narrow(doc, format_default, encoding_utf16_be, s_utf16.c_str(), s_utf16.length()));
+}
+
+TEST(write_encoding_huge_invalid)
+{
+	const unsigned int N = 16000;
+
+	// make a large utf8 name consisting of non-leading chars
+	std::string s_utf8;
+
+	for (unsigned int i = 0; i < N; ++i) s_utf8 += "\x82";
+
+	xml_document doc;
+	doc.append_child().set_name(s_utf8.c_str());
+
+	std::string s_utf16 = std::string("\x00<\x00 \x00/\x00>\x00\n", 10);
+
+	CHECK(test_write_narrow(doc, format_default, encoding_utf16_be, s_utf16.c_str(), s_utf16.length()));
+}
+#endif
+
+TEST(write_unicode_escape)
+{
+	char s_utf8[] = "<\xE2\x82\xAC \xC2\xA2='\"\xF0\xA4\xAD\xA2&#x0a;\"'>&amp;\x14\xF0\xA4\xAD\xA2&lt;</\xE2\x82\xAC>";
+
+	xml_document doc;
+	CHECK(doc.load_buffer(s_utf8, sizeof(s_utf8), parse_default, encoding_utf8));
+
+	CHECK(write_narrow(doc, format_default, encoding_utf8) == "<\xE2\x82\xAC \xC2\xA2=\"&quot;\xF0\xA4\xAD\xA2&#10;&quot;\">&amp;&#20;\xF0\xA4\xAD\xA2&lt;</\xE2\x82\xAC>\n");
+}
+
+#ifdef PUGIXML_WCHAR_MODE
+static bool test_write_unicode_invalid(const wchar_t* name, const char* expected)
+{
+	xml_document doc;
+	doc.append_child(node_pcdata).set_value(name);
+
+	return write_narrow(doc, format_raw, encoding_utf8) == expected;
+}
+
+TEST(write_unicode_invalid_utf16)
+{
+	size_t wcharsize = sizeof(wchar_t);
+
+	if (wcharsize == 2)
+	{
+		// check non-terminated degenerate handling
+	#ifdef U_LITERALS
+		CHECK(test_write_unicode_invalid(L"a\uda1d", "a"));
+		CHECK(test_write_unicode_invalid(L"a\uda1d_", "a_"));
+	#else
+		CHECK(test_write_unicode_invalid(L"a\xda1d", "a"));
+		CHECK(test_write_unicode_invalid(L"a\xda1d_", "a_"));
+	#endif
+
+		// check incorrect leading code
+	#ifdef U_LITERALS
+		CHECK(test_write_unicode_invalid(L"a\ude24", "a"));
+		CHECK(test_write_unicode_invalid(L"a\ude24_", "a_"));
+	#else
+		CHECK(test_write_unicode_invalid(L"a\xde24", "a"));
+		CHECK(test_write_unicode_invalid(L"a\xde24_", "a_"));
+	#endif
+	}
+}
+#else
+static bool test_write_unicode_invalid(const char* name, const wchar_t* expected)
+{
+	xml_document doc;
+	doc.append_child(node_pcdata).set_value(name);
+
+	return write_wide(doc, format_raw, encoding_wchar) == expected;
+}
+
+TEST(write_unicode_invalid_utf8)
+{
+	// invalid 1-byte input
+	CHECK(test_write_unicode_invalid("a\xb0", L"a"));
+	CHECK(test_write_unicode_invalid("a\xb0_", L"a_"));
+
+	// invalid 2-byte input
+	CHECK(test_write_unicode_invalid("a\xc0", L"a"));
+	CHECK(test_write_unicode_invalid("a\xd0", L"a"));
+	CHECK(test_write_unicode_invalid("a\xc0_", L"a_"));
+	CHECK(test_write_unicode_invalid("a\xd0_", L"a_"));
+
+	// invalid 3-byte input
+	CHECK(test_write_unicode_invalid("a\xe2\x80", L"a"));
+	CHECK(test_write_unicode_invalid("a\xe2", L"a"));
+	CHECK(test_write_unicode_invalid("a\xe2\x80_", L"a_"));
+	CHECK(test_write_unicode_invalid("a\xe2_", L"a_"));
+
+	// invalid 4-byte input
+	CHECK(test_write_unicode_invalid("a\xf2\x97\x98", L"a"));
+	CHECK(test_write_unicode_invalid("a\xf2\x97", L"a"));
+	CHECK(test_write_unicode_invalid("a\xf2", L"a"));
+	CHECK(test_write_unicode_invalid("a\xf2\x97\x98_", L"a_"));
+	CHECK(test_write_unicode_invalid("a\xf2\x97_", L"a_"));
+	CHECK(test_write_unicode_invalid("a\xf2_", L"a_"));
+
+	// invalid 5-byte input
+	CHECK(test_write_unicode_invalid("a\xf8_", L"a_"));
+}
+#endif
+
+TEST(write_no_name_element)
+{
+	xml_document doc;
+	xml_node root = doc.append_child();
+	root.append_child();
+	root.append_child().append_child(node_pcdata).set_value(STR("text"));
+
+	CHECK_NODE(doc, STR("<:anonymous><:anonymous /><:anonymous>text</:anonymous></:anonymous>"));
+	CHECK_NODE_EX(doc, STR("<:anonymous>\n\t<:anonymous />\n\t<:anonymous>text</:anonymous>\n</:anonymous>\n"), STR("\t"), format_default);
+}
+
+TEST(write_no_name_pi)
+{
+	xml_document doc;
+	doc.append_child(node_pi);
+
+	CHECK_NODE(doc, STR("<?:anonymous?>"));
+}
+
+TEST(write_no_name_attribute)
+{
+	xml_document doc;
+	doc.append_child().set_name(STR("root"));
+	doc.child(STR("root")).append_attribute(STR(""));
+
+	CHECK_NODE(doc, STR("<root :anonymous=\"\" />"));
+}
+
+TEST(write_print_empty)
+{
+	test_writer writer;
+	xml_node().print(writer);
+}
+
+#ifndef PUGIXML_NO_STL
+TEST(write_print_stream_empty)
+{
+	std::ostringstream oss;
+	xml_node().print(oss);
+}
+
+TEST(write_print_stream_empty_wide)
+{
+	std::basic_ostringstream<wchar_t> oss;
+	xml_node().print(oss);
+}
+#endif
+
+TEST(write_stackless)
+{
+	unsigned int count = 20000;
+	std::basic_string<pugi::char_t> data;
+
+	for (unsigned int i = 0; i < count; ++i)
+		data += STR("<a>");
+
+	data += STR("text");
+
+	for (unsigned int j = 0; j < count; ++j)
+		data += STR("</a>");
+
+	xml_document doc;
+	CHECK(doc.load_string(data.c_str()));
+
+	CHECK_NODE(doc, data.c_str());
+}
+
+TEST_XML(write_indent_custom, "<node attr='1'><child>text</child></node>")
+{
+	CHECK_NODE_EX(doc, STR("<node attr=\"1\">\n<child>\ntext\n</child>\n</node>\n"), STR(""), format_indent);
+	CHECK_NODE_EX(doc, STR("<node attr=\"1\">\nA<child>\nAAtext\nA</child>\n</node>\n"), STR("A"), format_indent);
+	CHECK_NODE_EX(doc, STR("<node attr=\"1\">\nAB<child>\nABABtext\nAB</child>\n</node>\n"), STR("AB"), format_indent);
+	CHECK_NODE_EX(doc, STR("<node attr=\"1\">\nABC<child>\nABCABCtext\nABC</child>\n</node>\n"), STR("ABC"), format_indent);
+	CHECK_NODE_EX(doc, STR("<node attr=\"1\">\nABCD<child>\nABCDABCDtext\nABCD</child>\n</node>\n"), STR("ABCD"), format_indent);
+	CHECK_NODE_EX(doc, STR("<node attr=\"1\">\nABCDE<child>\nABCDEABCDEtext\nABCDE</child>\n</node>\n"), STR("ABCDE"), format_indent);
+}
+
+TEST(write_pcdata_null)
+{
+	xml_document doc;
+	doc.append_child(STR("node")).append_child(node_pcdata);
+
+	CHECK_NODE(doc, STR("<node></node>"));
+	CHECK_NODE_EX(doc, STR("<node></node>\n"), STR("\t"), format_indent);
+
+	doc.first_child().append_child(node_pcdata);
+
+	CHECK_NODE_EX(doc, STR("<node></node>\n"), STR("\t"), format_indent);
+}
+
+TEST(write_pcdata_whitespace_fixedpoint)
+{
+	const char_t* data = STR("<node> test <child>\n \n </child>\n</node>");
+
+	static const unsigned int flags_parse[] =
+	{
+		0,
+		parse_ws_pcdata,
+		parse_ws_pcdata_single,
+		parse_trim_pcdata
+	};
+
+	static const unsigned int flags_format[] =
+	{
+		0,
+		format_raw,
+		format_indent
+	};
+
+	for (unsigned int i = 0; i < sizeof(flags_parse) / sizeof(flags_parse[0]); ++i)
+	{
+		xml_document doc;
+		CHECK(doc.load_string(data, flags_parse[i]));
+
+		for (unsigned int j = 0; j < sizeof(flags_format) / sizeof(flags_format[0]); ++j)
+		{
+			std::string saved = write_narrow(doc, flags_format[j], encoding_auto);
+
+			xml_document rdoc;
+			CHECK(rdoc.load_buffer(&saved[0], saved.size(), flags_parse[i]));
+
+			std::string rsaved = write_narrow(rdoc, flags_format[j], encoding_auto);
+
+			CHECK(saved == rsaved);
+		}
+	}
+}
+
+TEST_XML_FLAGS(write_mixed, "<node><child1/><child2>pre<![CDATA[data]]>mid<test/>post<?pi value?>fin</child2><child3/></node>", parse_full)
+{
+	CHECK_NODE(doc, STR("<node><child1 /><child2>pre<![CDATA[data]]>mid<test />post<?pi value?>fin</child2><child3 /></node>"));
+	CHECK_NODE_EX(doc, STR("<node>\n<child1 />\n<child2>pre<![CDATA[data]]>mid\n<test />post<?pi value?>fin</child2>\n<child3 />\n</node>\n"), STR("\t"), 0);
+	CHECK_NODE_EX(doc, STR("<node>\n\t<child1 />\n\t<child2>pre<![CDATA[data]]>mid\n\t\t<test />post<?pi value?>fin</child2>\n\t<child3 />\n</node>\n"), STR("\t"), format_indent);
+}
+
+#ifndef PUGIXML_NO_EXCEPTIONS
+struct throwing_writer: pugi::xml_writer
+{
+	virtual void write(const void*, size_t)
+	{
+		throw std::runtime_error("write failed");
+	}
+};
+
+TEST_XML(write_throw_simple, "<node><child/></node>")
+{
+	try
+	{
+		throwing_writer w;
+		doc.print(w);
+
+		CHECK_FORCE_FAIL("Expected exception");
+	}
+	catch (std::runtime_error&)
+	{
+	}
+}
+
+TEST_XML(write_throw_encoding, "<node><child/></node>")
+{
+	try
+	{
+		throwing_writer w;
+		doc.print(w, STR("\t"), format_default, encoding_utf32_be);
+
+		CHECK_FORCE_FAIL("Expected exception");
+	}
+	catch (std::runtime_error&)
+	{
+	}
+}
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath.cpp Added

@@ -0,0 +1,615 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+#include <string.h>
+#include <wchar.h>
+
+#include <string>
+#include <vector>
+#include <algorithm>
+#include <limits>
+
+static void load_document_copy(xml_document& doc, const char_t* text)
+{
+	xml_document source;
+	CHECK(source.load_string(text));
+
+	doc.append_copy(source.first_child());
+}
+
+TEST(xpath_allocator_many_pages)
+{
+	std::basic_string<char_t> query = STR("0");
+
+	for (int i = 0; i < 128; ++i) query += STR("+string-length('abcdefgh')");
+
+	CHECK_XPATH_NUMBER(xml_node(), query.c_str(), 1024);
+}
+
+TEST(xpath_allocator_large_page)
+{
+	std::basic_string<char_t> query;
+
+	for (int i = 0; i < 1024; ++i) query += STR("abcdefgh");
+
+	CHECK_XPATH_NUMBER(xml_node(), (STR("string-length('") + query + STR("')")).c_str(), 8192);
+}
+
+TEST_XML(xpath_sort_complex, "<node><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2></node>")
+{
+	// just some random union order, it should not matter probably?
+	xpath_node_set ns = doc.child(STR("node")).select_nodes(STR("child1 | child2 | child1/@* | . | child2/@* | child2/text()"));
+
+	ns.sort(false);
+	xpath_node_set sorted = ns;
+
+	ns.sort(true);
+	xpath_node_set reverse_sorted = ns;
+
+	xpath_node_set_tester(sorted, "sorted order failed") % 2 % 3 % 4 % 5 % 6 % 7 % 8;
+	xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 8 % 7 % 6 % 5 % 4 % 3 % 2;
+}
+
+TEST(xpath_sort_complex_copy) // copy the document so that document order optimization does not work
+{
+	xml_document doc;
+	load_document_copy(doc, STR("<node><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2></node>"));
+
+	// just some random union order, it should not matter probably?
+	xpath_node_set ns = doc.child(STR("node")).select_nodes(STR("child1 | child2 | child1/@* | . | child2/@* | child2/text()"));
+
+	ns.sort(false);
+	xpath_node_set sorted = ns;
+
+	ns.sort(true);
+	xpath_node_set reverse_sorted = ns;
+
+	xpath_node_set_tester(sorted, "sorted order failed") % 2 % 3 % 4 % 5 % 6 % 7 % 8;
+	xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 8 % 7 % 6 % 5 % 4 % 3 % 2;
+}
+
+TEST_XML(xpath_sort_children, "<node><child><subchild id='1'/></child><child><subchild id='2'/></child></node>")
+{
+	xpath_node_set ns = doc.child(STR("node")).select_nodes(STR("child/subchild[@id=1] | child/subchild[@id=2]"));
+
+	ns.sort(false);
+	xpath_node_set sorted = ns;
+
+	ns.sort(true);
+	xpath_node_set reverse_sorted = ns;
+
+	xpath_node_set_tester(sorted, "sorted order failed") % 4 % 7;
+	xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 7 % 4;
+}
+
+TEST(xpath_sort_children_copy) // copy the document so that document order optimization does not work
+{
+	xml_document doc;
+	load_document_copy(doc, STR("<node><child><subchild id='1'/></child><child><subchild id='2'/></child></node>"));
+
+	xpath_node_set ns = doc.child(STR("node")).select_nodes(STR("child/subchild[@id=1] | child/subchild[@id=2]"));
+
+	ns.sort(false);
+	xpath_node_set sorted = ns;
+
+	ns.sort(true);
+	xpath_node_set reverse_sorted = ns;
+
+	xpath_node_set_tester(sorted, "sorted order failed") % 4 % 7;
+	xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 7 % 4;
+}
+
+TEST_XML(xpath_sort_attributes, "<node/>")
+{
+	xml_node n = doc.child(STR("node"));
+
+	// we need to insert attributes manually since unsorted node sets are (always?) sorted via pointers because of remove_duplicates,
+	// so we need to have different document and pointer order to cover all comparator cases
+	n.append_attribute(STR("attr2"));
+	n.append_attribute(STR("attr3"));
+	n.insert_attribute_before(STR("attr1"), n.attribute(STR("attr2")));
+
+	xpath_node_set ns = n.select_nodes(STR("@* | @*"));
+
+	ns.sort(true);
+	xpath_node_set reverse_sorted = ns;
+
+	ns.sort(false);
+	xpath_node_set sorted = ns;
+
+	xpath_node_set_tester(sorted, "sorted order failed") % 3 % 4 % 5;
+	xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 5 % 4 % 3;
+}
+
+TEST_XML(xpath_sort_attributes_docorder, "<node attr1='' attr2='value' attr4='value' />")
+{
+	xml_node n = doc.child(STR("node"));
+
+	n.first_attribute().set_name(STR("attribute1"));
+	n.insert_attribute_after(STR("attr3"), n.attribute(STR("attr2")));
+
+	xpath_node_set ns = n.select_nodes(STR("@* | @*"));
+
+	ns.sort(true);
+	xpath_node_set reverse_sorted = ns;
+
+	ns.sort(false);
+	xpath_node_set sorted = ns;
+
+	xpath_node_set_tester(sorted, "sorted order failed") % 3 % 4 % 5 % 6;
+	xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 6 % 5 % 4 % 3;
+}
+
+TEST(xpath_sort_random_medium)
+{
+	xml_document doc;
+	load_document_copy(doc, STR("<node>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("</node>"));
+
+	xpath_node_set ns = doc.select_nodes(STR("//node() | //@*"));
+
+	std::vector<xpath_node> nsv(ns.begin(), ns.end());
+	std::random_shuffle(nsv.begin(), nsv.end());
+
+	xpath_node_set copy(&nsv[0], &nsv[0] + nsv.size());
+	copy.sort();
+
+	xpath_node_set_tester tester(copy, "sorted order failed");
+
+	for (unsigned int i = 2; i < 39; ++i) tester % i;
+}
+
+TEST(xpath_sort_random_large)
+{
+	xml_document doc;
+	load_document_copy(doc, STR("<node>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2>")
+		STR("<child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2></node>"));
+
+	xpath_node_set ns = doc.select_nodes(STR("//node() | //@*"));
+
+	std::vector<xpath_node> nsv(ns.begin(), ns.end());
+	std::random_shuffle(nsv.begin(), nsv.end());
+
+	xpath_node_set copy(&nsv[0], &nsv[0] + nsv.size());
+	copy.sort();
+
+	xpath_node_set_tester tester(copy, "sorted order failed");
+
+	for (unsigned int i = 2; i < 129; ++i) tester % i;
+}
+
+TEST(xpath_long_numbers_parse)
+{
+	const pugi::char_t* str_flt_max = STR("340282346638528860000000000000000000000");
+	const pugi::char_t* str_flt_max_dec = STR("340282346638528860000000000000000000000.000000");
+	
+	const pugi::char_t* str_dbl_max = STR("179769313486231570000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000");
+	const pugi::char_t* str_dbl_max_dec = STR("179769313486231570000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.000000");
+
+	xml_node c;
+
+	// check parsing
+	CHECK_XPATH_NUMBER(c, str_flt_max, std::numeric_limits<float>::max());
+	CHECK_XPATH_NUMBER(c, str_flt_max_dec, std::numeric_limits<float>::max());
+	CHECK_XPATH_NUMBER(c, str_dbl_max, std::numeric_limits<double>::max());
+	CHECK_XPATH_NUMBER(c, str_dbl_max_dec, std::numeric_limits<double>::max());
+}
+
+static bool test_xpath_string_prefix(const pugi::xml_node& node, const pugi::char_t* query, const pugi::char_t* expected, size_t match_length)
+{
+	pugi::xpath_query q(query);
+
+	pugi::char_t result[32];
+	size_t size = q.evaluate_string(result, sizeof(result) / sizeof(result[0]), node);
+
+	size_t expected_length = std::char_traits<pugi::char_t>::length(expected);
+
+	return size == expected_length + 1 && std::char_traits<pugi::char_t>::compare(result, expected, match_length) == 0;
+}
+
+TEST(xpath_long_numbers_stringize)
+{
+	const pugi::char_t* str_flt_max = STR("340282346638528860000000000000000000000");
+	const pugi::char_t* str_flt_max_dec = STR("340282346638528860000000000000000000000.000000");
+	
+	const pugi::char_t* str_dbl_max = STR("179769313486231570000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000");
+	const pugi::char_t* str_dbl_max_dec = STR("179769313486231570000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.000000");
+
+	xml_node c;
+
+	CHECK(test_xpath_string_prefix(c, str_flt_max, str_flt_max, 15));
+	CHECK(test_xpath_string_prefix(c, str_flt_max_dec, str_flt_max, 15));
+
+	CHECK(test_xpath_string_prefix(c, str_dbl_max, str_dbl_max, 15));
+	CHECK(test_xpath_string_prefix(c, str_dbl_max_dec, str_dbl_max, 15));
+}
+
+TEST(xpath_denorm_numbers)
+{
+	std::basic_string<pugi::char_t> query;
+
+	// 10^-318 - double denormal
+	for (int i = 0; i < 106; ++i)
+	{
+		if (i != 0) query += STR(" * ");
+		query += STR("0.001");
+	}
+
+	CHECK_XPATH_STRING(xml_node(), query.c_str(), STR("0.0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009999987484955998"));
+}
+
+TEST_XML(xpath_rexml_1, "<a><c id='a'/><c id='b'/></a>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//*[local-name()='c' and @id='b']")) % 6;
+	CHECK_XPATH_NODESET(doc, STR("//*[ local-name()='c' and @id='b' ]")) % 6;
+	CHECK_XPATH_NODESET(doc, STR("/a/c[@id]")) % 6;
+	CHECK_XPATH_NODESET(doc, STR("/a/c[(@id)]")) % 6;
+	CHECK_XPATH_NODESET(doc, STR("/a/c[ @id ]")) % 6;
+	CHECK_XPATH_NODESET(doc, STR("/a/c[ (@id) ]")) % 6;
+	CHECK_XPATH_NODESET(doc, STR("/a/c[( @id )]")) % 6;
+	CHECK_XPATH_NODESET(doc, STR("/a/c[ ( @id ) ]")) % 6;
+	CHECK_XPATH_NODESET(doc, STR("/a/c [ ( @id ) ] ")) % 6;
+	CHECK_XPATH_NODESET(doc, STR(" / a / c [ ( @id ) ] ")) % 6;
+}
+
+TEST_XML(xpath_rexml_2, "<a:x xmlns:a='1'><a:y p='p' q='q'><a:z>zzz</a:z></a:y></a:x>")
+{
+	CHECK_XPATH_NODESET(doc, STR("a:x/a:y[@p='p' and @q='q']/a:z/text()")) % 8;
+}
+
+TEST_XML(xpath_rexml_3, "<article><section role='subdivision' id='1'><para>free flowing text.</para></section><section role='division'><section role='subdivision' id='2'><para>free flowing text.</para></section><section role='division'><para>free flowing text.</para></section></section></article>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//section[../self::section[@role=\"division\"]]")) % 10 % 15;
+ CHECK_XPATH_NODESET(doc, STR("//section[@role=\"subdivision\" and not(../self::section[@role=\"division\"])]")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("//section[@role=\"subdivision\"][not(../self::section[@role=\"division\"])]")) % 3;
+}
+
+TEST_XML_FLAGS(xpath_rexml_4, "<a>TEXT1<c number='1'/><c number='2' str='def'><d number='1' str='abc'>TEXT2</d></c></a>", parse_default | parse_comments)
+{
+	CHECK_XPATH_NODESET(doc, STR("/descendant-or-self::node()[count(child::node()|following-sibling::node()|preceding-sibling::node())=0]")) % 6 % 17 % 20;
+}
+
+TEST_XML(xpath_rexml_5, "<a><c id='a'/><c id='b'/></a>")
+{
+	CHECK_XPATH_FAIL(STR(".//[@id]"));
+	CHECK_XPATH_NODESET(doc, STR(".//self::*[@id]")) % 4 % 6;
+	CHECK_XPATH_NODESET(doc, STR(".//node()[@id]")) % 4 % 6;
+}
+
+TEST_XML(xpath_rexml_6, "<div>ab</div>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//em|//strong")) % 4 % 6;
+	CHECK_XPATH_NODESET(doc, STR("//*[self::em | self::strong]")) % 4 % 6;
+	CHECK_XPATH_NODESET(doc, STR("//*[name()=\"em\" or name()=\"strong\"]")) % 4 % 6;
+	CHECK_XPATH_NODESET(doc, STR("//*[self::em or self::strong]")) % 4 % 6;
+}
+
+TEST_XML(xpath_xsl_list_1, "<input><type>whatever</type></input><input><type>text</type></input><input><type>select</type></input><input><type>something</type></input>")
+{
+	// if I'm not last, and the next input/type isn't select
+	CHECK_XPATH_NODESET(doc, STR("input[type[parent::input/following-sibling::input[1]/type != 'select']]")) % 2 % 8;
+	CHECK_XPATH_NODESET(doc, STR("input[type[../following-sibling::input[1]/type != 'select']]")) % 2 % 8;
+
+	CHECK_XPATH_NODESET(doc, STR("input[position()+1]"));
+}
+
+TEST_XML(xpath_xsl_list_2, "<TR><TD id='1'>text1</TD><TD id='2'>text2</TD><TD id='3'>text3</TD><TD id='4'>text4</TD></TR>")
+{
+	CHECK_XPATH_FAIL(STR(".[not(.=ancestor::TR/TD[15]/node())]"));
+
+	CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("1")).first_child(), STR("self::node()[not(.=ancestor::TR/TD[3]/node())]")) % 5;
+	CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("2")).first_child(), STR("self::node()[not(.=ancestor::TR/TD[3]/node())]")) % 8;
+	CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("3")).first_child(), STR("self::node()[not(.=ancestor::TR/TD[3]/node())]"));
+	CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("4")).first_child(), STR("self::node()[not(.=ancestor::TR/TD[3]/node())]")) % 14;
+
+	CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("1")), STR("node()[not(.=ancestor::TR/TD[3]/node())]")) % 5;
+	CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("2")), STR("node()[not(.=ancestor::TR/TD[3]/node())]")) % 8;
+	CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("3")), STR("node()[not(.=ancestor::TR/TD[3]/node())]"));
+	CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("4")), STR("node()[not(.=ancestor::TR/TD[3]/node())]")) % 14;
+}
+
+TEST_XML(xpath_star_token, "<node>0.5<section><child/><child/><child/><child/></section><section/></node>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//*[/* * 4]")) % 6 % 9;
+	CHECK_XPATH_NODESET(doc, STR("//*[/**4]")) % 6 % 9;
+	CHECK_XPATH_FAIL(STR("//*[/***4]"));
+}
+
+TEST(xpath_miscellaneous)
+{
+	CHECK_XPATH_FAIL(STR("/root/child[a=3]/substring(child::text())"));
+	CHECK_XPATH_NODESET(xml_node(), STR("foo/@FOO/@bar"));
+}
+
+TEST_XML(xpath_context_node, "<node>5</node>")
+{
+	CHECK_XPATH_NODESET(doc, STR("node")) % 2;
+	CHECK_XPATH_BOOLEAN(doc, STR("node"), true);
+	CHECK_XPATH_NUMBER(doc, STR("node"), 5);
+	CHECK_XPATH_STRING(doc, STR("node"), STR("5"));
+}
+
+TEST_XML(xpath_context_position, "<node>5</node>")
+{
+	CHECK_XPATH_NODESET(doc, STR("id(position() + last())"));
+	CHECK_XPATH_BOOLEAN(doc, STR("position() + last() = 2"), true);
+	CHECK_XPATH_NUMBER(doc, STR("position() + last()"), 2);
+	CHECK_XPATH_STRING(doc, STR("position() + last()"), STR("2"));
+}
+
+TEST(xpath_lexer_unknown_lexeme)
+{
+	CHECK_XPATH_FAIL(STR("(^3))"));
+	CHECK_XPATH_FAIL(STR("(!3))"));
+}
+
+TEST(xpath_large_node_set)
+{
+	xml_document doc;
+	CHECK(doc.load_file("tests/data/large.xml"));
+
+	xpath_node_set ns = doc.select_nodes(STR("//*"));
+
+	CHECK(ns.size() == 10001);
+}
+
+TEST(xpath_out_of_memory_evaluate_concat)
+{
+	test_runner::_memory_fail_threshold = 4196 * sizeof(char_t) + 4096 * 2;
+
+	std::basic_string<char_t> query = STR("concat(\"a\", \"");
+
+	query.resize(4196, 'a');
+	query += STR("\")");
+
+	pugi::xpath_query q(query.c_str());
+
+	CHECK_ALLOC_FAIL(CHECK(q.evaluate_string(0, 0, xml_node()) == 1));
+}
+
+TEST(xpath_out_of_memory_evaluate_substring)
+{
+	test_runner::_memory_fail_threshold = 4196 * sizeof(char_t) + 4096 * 2;
+
+	std::basic_string<char_t> query = STR("substring(\"");
+
+	query.resize(4196, 'a');
+	query += STR("\", 1, 4097)");
+
+	pugi::xpath_query q(query.c_str());
+
+	CHECK_ALLOC_FAIL(CHECK(q.evaluate_string(0, 0, xml_node()) == 1));
+}
+
+TEST_XML(xpath_out_of_memory_evaluate_union, "<node><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/></node>")
+{
+	test_runner::_memory_fail_threshold = 32768 + 4096 * 2;
+
+	pugi::xpath_query q(STR("a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|a)))))))))))))))))))"));
+
+	CHECK_ALLOC_FAIL(CHECK(q.evaluate_node_set(doc.child(STR("node"))).empty()));
+}
+
+TEST_XML(xpath_out_of_memory_evaluate_predicate, "<node><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/><a/></node>")
+{
+	test_runner::_memory_fail_threshold = 32768 + 4096 * 2;
+
+	pugi::xpath_query q(STR("//a[//a[//a[//a[//a[//a[//a[//a[//a[//a[//a[//a[//a[//a[true()]]]]]]]]]]]]]]"));
+
+	CHECK_ALLOC_FAIL(CHECK(q.evaluate_node_set(doc).empty()));
+}
+
+TEST(xpath_memory_concat_massive)
+{
+	pugi::xml_document doc;
+	pugi::xml_node node = doc.append_child(STR("node"));
+
+	for (int i = 0; i < 5000; ++i)
+		node.append_child(STR("c")).text().set(i % 10);
+
+	pugi::xpath_query q(STR("/"));
+	size_t size = q.evaluate_string(0, 0, node);
+
+	CHECK(size == 5001);
+}
+
+TEST_XML(xpath_sort_copy_share, "<node><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2></node>")
+{
+	// copy sharing shares the name/value data for nodes that can potentially make document order optimization invalid (silently)
+	xml_node node = doc.child(STR("node"));
+	xml_node child1 = node.child(STR("child1"));
+	xml_node child2 = node.child(STR("child2"));
+
+	// swap child1 & child2
+	node.prepend_copy(child2);
+	node.append_copy(child1);
+
+	node.remove_child(child1);
+	node.remove_child(child2);
+
+	// just some random union order, it should not matter probably?
+	xpath_node_set ns = doc.child(STR("node")).select_nodes(STR("child1 | child2 | child1/@* | . | child2/@* | child2/text()"));
+
+	ns.sort(false);
+	xpath_node_set sorted = ns;
+
+	ns.sort(true);
+	xpath_node_set reverse_sorted = ns;
+
+	xpath_node_set_tester(sorted, "sorted order failed") % 2 % 3 % 4 % 5 % 6 % 7 % 8;
+	xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 8 % 7 % 6 % 5 % 4 % 3 % 2;
+}
+
+TEST_XML(xpath_sort_move_share, "<node><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2></node>")
+{
+	// moving changes the relation between name/value data and document order, this can potentially make document order optimization invalid (silently)
+	xml_node node = doc.child(STR("node"));
+	xml_node child1 = node.child(STR("child1"));
+	xml_node child2 = node.child(STR("child2"));
+
+	// swap child1 & child2
+	node.prepend_move(child2);
+	node.append_move(child1);
+
+	// just some random union order, it should not matter probably?
+	xpath_node_set ns = doc.child(STR("node")).select_nodes(STR("child1 | child2 | child1/@* | . | child2/@* | child2/text()"));
+
+	ns.sort(false);
+	xpath_node_set sorted = ns;
+
+	ns.sort(true);
+	xpath_node_set reverse_sorted = ns;
+
+	xpath_node_set_tester(sorted, "sorted order failed") % 2 % 3 % 4 % 5 % 6 % 7 % 8;
+	xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 8 % 7 % 6 % 5 % 4 % 3 % 2;
+}
+
+TEST_XML(xpath_sort_append_buffer, "<node /><node />")
+{
+	// append_buffer changes the relation between name/value data and document order, this can potentially make document order optimization invalid (silently)
+	const char* child1 = "<child1 attr1='value1' attr2='value2'/>";
+	const char* child2 = "<child2 attr1='value1'>test </child2>";
+
+	doc.last_child().append_buffer(child2, strlen(child2));
+	doc.first_child().append_buffer(child1, strlen(child1));
+
+	// just some random union order, it should not matter probably?
+	xpath_node_set ns = doc.select_nodes(STR("node/child1 | node/child2 | node/child1/@* | node/. | node/child2/@* | node/child2/text()"));
+
+	ns.sort(false);
+	xpath_node_set sorted = ns;
+
+	ns.sort(true);
+	xpath_node_set reverse_sorted = ns;
+
+	xpath_node_set_tester(sorted, "sorted order failed") % 2 % 3 % 4 % 5 % 6 % 7 % 8 % 9;
+	xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 9 % 8 % 7 % 6 % 5 % 4 % 3 % 2;
+}
+
+TEST(xpath_sort_crossdoc)
+{
+	xml_document doc1;
+	CHECK(doc1.load_string(STR("<node />")));
+
+	xml_document doc2;
+	CHECK(doc2.load_string(STR("<node />")));
+
+	xpath_node_set ns1 = doc1.select_nodes(STR("*"));
+	CHECK(ns1.size() == 1);
+
+	xpath_node_set ns2 = doc2.select_nodes(STR("*"));
+	CHECK(ns2.size() == 1);
+
+	xpath_variable_set set;
+	set.set(STR("ns1"), ns1);
+	set.set(STR("ns2"), ns2);
+
+	xpath_node_set ns = xpath_query(STR("$ns1 | $ns2"), &set).evaluate_node_set(xpath_node());
+
+	ns.sort();
+
+	CHECK(ns.size() == 2);
+	CHECK((ns[0] == ns1[0] && ns[1] == ns2[0]) || (ns[0] == ns2[0] && ns[1] == ns1[0]));
+}
+
+TEST(xpath_sort_crossdoc_dynamic)
+{
+	xml_document doc1;
+	doc1.append_child(STR("node"));
+
+	xml_document doc2;
+	doc2.append_child(STR("node"));
+
+	xpath_node_set ns1 = doc1.select_nodes(STR("*"));
+	CHECK(ns1.size() == 1);
+
+	xpath_node_set ns2 = doc2.select_nodes(STR("*"));
+	CHECK(ns2.size() == 1);
+
+	xpath_variable_set set;
+	set.set(STR("ns1"), ns1);
+	set.set(STR("ns2"), ns2);
+
+	xpath_node_set ns = xpath_query(STR("$ns1 | $ns2"), &set).evaluate_node_set(xpath_node());
+
+	ns.sort();
+
+	CHECK(ns.size() == 2);
+	CHECK((ns[0] == ns1[0] && ns[1] == ns2[0]) || (ns[0] == ns2[0] && ns[1] == ns1[0]));
+}
+
+TEST(xpath_sort_crossdoc_different_depth)
+{
+	xml_document doc1;
+	doc1.append_child(STR("node"));
+
+	xml_document doc2;
+	doc2.append_child(STR("node")).append_child(STR("node"));
+
+	xpath_node_set ns1 = doc1.select_nodes(STR("*"));
+	CHECK(ns1.size() == 1);
+
+	xpath_node_set ns2 = doc2.select_nodes(STR("*/*"));
+	CHECK(ns2.size() == 1);
+
+	xpath_variable_set set;
+	set.set(STR("ns1"), ns1);
+	set.set(STR("ns2"), ns2);
+
+	xpath_node_set ns = xpath_query(STR("$ns1 | $ns2"), &set).evaluate_node_set(xpath_node());
+
+	ns.sort();
+
+	CHECK(ns.size() == 2);
+	CHECK((ns[0] == ns1[0] && ns[1] == ns2[0]) || (ns[0] == ns2[0] && ns[1] == ns1[0]));
+}
+
+TEST(xpath_allocate_string_out_of_memory)
+{
+	std::basic_string<char_t> query;
+
+	for (int i = 0; i < 1024; ++i) query += STR("abcdefgh");
+
+	test_runner::_memory_fail_threshold = 8*1024;
+
+#ifndef __DMC__ // DigitalMars exception handling crashes instead of catching the exception...
+	CHECK_ALLOC_FAIL(CHECK(!xpath_query(query.c_str())));
+#endif
+}
+
+TEST(xpath_remove_duplicates)
+{
+	xml_document doc;
+
+	for (int i = 0; i < 20; ++i)
+	{
+		doc.append_child(STR("node2"));
+		doc.prepend_child(STR("node1"));
+	}
+
+	xpath_node_set ns = doc.select_nodes(STR("/node2/preceding::* | //node1 | /node() | /* | /node1/following-sibling::*"));
+
+	ns.sort();
+
+	{
+		xpath_node_set_tester tester(ns, "sorted order failed");
+
+		for (int i = 0; i < 40; ++i)
+			tester % (2 + i);
+	}
+}
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_api.cpp Added

@@ -0,0 +1,631 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include <string.h> // because Borland's STL is braindead, we have to include <string.h> _before_ <string> in order to get memcmp
+
+#include "common.hpp"
+
+#include "helpers.hpp"
+
+#include <string>
+#include <vector>
+
+TEST_XML(xpath_api_select_nodes, "<node><head/><foo/><foo/><tail/></node>")
+{
+	xpath_node_set ns1 = doc.select_nodes(STR("node/foo"));
+
+	xpath_query q(STR("node/foo"));
+	xpath_node_set ns2 = doc.select_nodes(q);
+
+	xpath_node_set_tester(ns1, "ns1") % 4 % 5;
+	xpath_node_set_tester(ns2, "ns2") % 4 % 5;
+}
+
+TEST_XML(xpath_api_select_node, "<node><head/><foo id='1'/><foo/><tail/></node>")
+{
+	xpath_node n1 = doc.select_node(STR("node/foo"));
+
+	xpath_query q(STR("node/foo"));
+	xpath_node n2 = doc.select_node(q);
+
+	CHECK(n1.node().attribute(STR("id")).as_int() == 1);
+	CHECK(n2.node().attribute(STR("id")).as_int() == 1);
+
+	xpath_node n3 = doc.select_node(STR("node/bar"));
+	
+	CHECK(!n3);
+
+	xpath_node n4 = doc.select_node(STR("node/head/following-sibling::foo"));
+	xpath_node n5 = doc.select_node(STR("node/tail/preceding-sibling::foo"));
+	
+	CHECK(n4.node().attribute(STR("id")).as_int() == 1);
+	CHECK(n5.node().attribute(STR("id")).as_int() == 1);
+}
+
+TEST_XML(xpath_api_node_bool_ops, "<node attr='value'/>")
+{
+	generic_bool_ops_test(doc.select_node(STR("node")));
+	generic_bool_ops_test(doc.select_node(STR("node/@attr")));
+}
+
+TEST_XML(xpath_api_node_eq_ops, "<node attr='value'/>")
+{
+	generic_eq_ops_test(doc.select_node(STR("node")), doc.select_node(STR("node/@attr")));
+}
+
+TEST_XML(xpath_api_node_accessors, "<node attr='value'/>")
+{
+	xpath_node null;
+	xpath_node node = doc.select_node(STR("node"));
+	xpath_node attr = doc.select_node(STR("node/@attr"));
+
+	CHECK(!null.node());
+	CHECK(!null.attribute());
+	CHECK(!null.parent());
+
+	CHECK(node.node() == doc.child(STR("node")));
+	CHECK(!node.attribute());
+	CHECK(node.parent() == doc);
+
+	CHECK(!attr.node());
+	CHECK(attr.attribute() == doc.child(STR("node")).attribute(STR("attr")));
+	CHECK(attr.parent() == doc.child(STR("node")));
+}
+
+inline void xpath_api_node_accessors_helper(const xpath_node_set& set)
+{
+	CHECK(set.size() == 2);
+	CHECK(set.type() == xpath_node_set::type_sorted);
+	CHECK(!set.empty());
+	CHECK_STRING(set[0].node().name(), STR("foo"));
+	CHECK_STRING(set[1].node().name(), STR("foo"));
+	CHECK(set.first() == set[0]);
+	CHECK(set.begin() + 2 == set.end());
+	CHECK(set.begin()[0] == set[0] && set.begin()[1] == set[1]);
+}
+
+TEST_XML(xpath_api_nodeset_accessors, "<node><foo/><foo/></node>")
+{
+	xpath_node_set null;
+	CHECK(null.size() == 0);
+	CHECK(null.type() == xpath_node_set::type_unsorted);
+	CHECK(null.empty());
+	CHECK(!null.first());
+	CHECK(null.begin() == null.end());
+
+	xpath_node_set set = doc.select_nodes(STR("node/foo"));
+	xpath_api_node_accessors_helper(set);
+
+	xpath_node_set copy = set;
+	xpath_api_node_accessors_helper(copy);
+
+	xpath_node_set assigned;
+	assigned = set;
+	xpath_api_node_accessors_helper(assigned);
+
+	xpath_node_set nullcopy = null;
+}
+
+TEST_XML(xpath_api_nodeset_copy, "<node><foo/><foo/></node>")
+{
+	xpath_node_set set = doc.select_nodes(STR("node/foo"));
+
+	xpath_node_set copy1 = set;
+	CHECK(copy1.size() == 2);
+	CHECK_STRING(copy1[0].node().name(), STR("foo"));
+
+	xpath_node_set copy2;
+	copy2 = set;
+	CHECK(copy2.size() == 2);
+	CHECK_STRING(copy2[0].node().name(), STR("foo"));
+
+	xpath_node_set copy3;
+	copy3 = set;
+	copy3 = copy3;
+	CHECK(copy3.size() == 2);
+	CHECK_STRING(copy3[0].node().name(), STR("foo"));
+
+	xpath_node_set copy4;
+	copy4 = set;
+	copy4 = copy1;
+	CHECK(copy4.size() == 2);
+	CHECK_STRING(copy4[0].node().name(), STR("foo"));
+
+	xpath_node_set copy5;
+	copy5 = set;
+	copy5 = xpath_node_set();
+	CHECK(copy5.size() == 0);
+}
+
+TEST(xpath_api_nodeset_copy_empty)
+{
+ xpath_node_set set;
+ xpath_node_set set2 = set;
+ xpath_node_set set3;
+ set3 = set;
+}
+
+TEST_XML(xpath_api_evaluate, "<node attr='3'/>")
+{
+	xpath_query q(STR("node/@attr"));
+
+	CHECK(q.evaluate_boolean(doc));
+	CHECK(q.evaluate_number(doc) == 3);
+
+	char_t string[3];
+	CHECK(q.evaluate_string(string, 3, doc) == 2 && string[0] == '3' && string[1] == 0);
+
+#ifndef PUGIXML_NO_STL
+	CHECK(q.evaluate_string(doc) == STR("3"));
+#endif
+
+	xpath_node_set ns = q.evaluate_node_set(doc);
+	CHECK(ns.size() == 1 && ns[0].attribute() == doc.child(STR("node")).attribute(STR("attr")));
+
+	xpath_node nr = q.evaluate_node(doc);
+	CHECK(nr.attribute() == doc.child(STR("node")).attribute(STR("attr")));
+}
+
+TEST_XML(xpath_api_evaluate_attr, "<node attr='3'/>")
+{
+	xpath_query q(STR("."));
+	xpath_node n(doc.child(STR("node")).attribute(STR("attr")), doc.child(STR("node")));
+
+	CHECK(q.evaluate_boolean(n));
+	CHECK(q.evaluate_number(n) == 3);
+
+	char_t string[3];
+	CHECK(q.evaluate_string(string, 3, n) == 2 && string[0] == '3' && string[1] == 0);
+
+#ifndef PUGIXML_NO_STL
+	CHECK(q.evaluate_string(n) == STR("3"));
+#endif
+
+	xpath_node_set ns = q.evaluate_node_set(n);
+	CHECK(ns.size() == 1 && ns[0] == n);
+
+	xpath_node nr = q.evaluate_node(n);
+	CHECK(nr == n);
+}
+
+#ifdef PUGIXML_NO_EXCEPTIONS
+TEST_XML(xpath_api_evaluate_fail, "<node attr='3'/>")
+{
+	xpath_query q(STR(""));
+
+	CHECK(q.evaluate_boolean(doc) == false);
+	CHECK_DOUBLE_NAN(q.evaluate_number(doc));
+
+	CHECK(q.evaluate_string(0, 0, doc) == 1); // null terminator
+
+#ifndef PUGIXML_NO_STL
+	CHECK(q.evaluate_string(doc).empty());
+#endif
+
+	CHECK(q.evaluate_node_set(doc).empty());
+
+	CHECK(!q.evaluate_node(doc));
+}
+#endif
+
+TEST(xpath_api_evaluate_node_set_fail)
+{
+	xpath_query q(STR("1"));
+
+#ifdef PUGIXML_NO_EXCEPTIONS
+	CHECK(q.evaluate_node_set(xml_node()).empty());
+#else
+	try
+	{
+		q.evaluate_node_set(xml_node());
+
+		CHECK_FORCE_FAIL("Expected exception");
+	}
+	catch (const xpath_exception&)
+	{
+	}
+#endif
+}
+
+TEST(xpath_api_evaluate_node_fail)
+{
+	xpath_query q(STR("1"));
+
+#ifdef PUGIXML_NO_EXCEPTIONS
+	CHECK(!q.evaluate_node(xml_node()));
+#else
+	try
+	{
+		q.evaluate_node(xml_node());
+
+		CHECK_FORCE_FAIL("Expected exception");
+	}
+	catch (const xpath_exception&)
+	{
+	}
+#endif
+}
+
+TEST(xpath_api_evaluate_string)
+{
+	xpath_query q(STR("\"0123456789\""));
+
+	std::basic_string<char_t> base = STR("xxxxxxxxxxxxxxxx");
+
+	// test for enough space
+	std::basic_string<char_t> s0 = base;
+	CHECK(q.evaluate_string(&s0[0], 16, xml_node()) == 11 && memcmp(&s0[0], STR("0123456789\0xxxxx"), 16 * sizeof(char_t)) == 0);
+
+	// test for just enough space
+	std::basic_string<char_t> s1 = base;
+	CHECK(q.evaluate_string(&s1[0], 11, xml_node()) == 11 && memcmp(&s1[0], STR("0123456789\0xxxxx"), 16 * sizeof(char_t)) == 0);
+	
+	// test for just not enough space
+	std::basic_string<char_t> s2 = base;
+	CHECK(q.evaluate_string(&s2[0], 10, xml_node()) == 11 && memcmp(&s2[0], STR("012345678\0xxxxxx"), 16 * sizeof(char_t)) == 0);
+
+	// test for not enough space
+	std::basic_string<char_t> s3 = base;
+	CHECK(q.evaluate_string(&s3[0], 5, xml_node()) == 11 && memcmp(&s3[0], STR("0123\0xxxxxxxxxxx"), 16 * sizeof(char_t)) == 0);
+
+	// test for single character buffer
+	std::basic_string<char_t> s4 = base;
+	CHECK(q.evaluate_string(&s4[0], 1, xml_node()) == 11 && memcmp(&s4[0], STR("\0xxxxxxxxxxxxxxx"), 16 * sizeof(char_t)) == 0);
+
+	// test for empty buffer
+	std::basic_string<char_t> s5 = base;
+	CHECK(q.evaluate_string(&s5[0], 0, xml_node()) == 11 && memcmp(&s5[0], STR("xxxxxxxxxxxxxxxx"), 16 * sizeof(char_t)) == 0);
+	CHECK(q.evaluate_string(0, 0, xml_node()) == 11);
+}
+
+TEST(xpath_api_return_type)
+{
+#ifdef PUGIXML_NO_EXCEPTIONS
+	CHECK(xpath_query(STR("")).return_type() == xpath_type_none);
+#endif
+
+	CHECK(xpath_query(STR("node")).return_type() == xpath_type_node_set);
+	CHECK(xpath_query(STR("1")).return_type() == xpath_type_number);
+	CHECK(xpath_query(STR("'s'")).return_type() == xpath_type_string);
+	CHECK(xpath_query(STR("true()")).return_type() == xpath_type_boolean);
+}
+
+TEST(xpath_api_query_bool)
+{
+	xpath_query q(STR("node"));
+	
+	CHECK(q);
+	CHECK((!q) == false);
+}
+
+#ifdef PUGIXML_NO_EXCEPTIONS
+TEST(xpath_api_query_bool_fail)
+{
+	xpath_query q(STR(""));
+	
+	CHECK((q ? true : false) == false);
+	CHECK((!q) == true);
+}
+#endif
+
+TEST(xpath_api_query_result)
+{
+	xpath_query q(STR("node"));
+
+	CHECK(q.result());
+	CHECK(q.result().error == 0);
+	CHECK(q.result().offset == 0);
+	CHECK(strcmp(q.result().description(), "No error") == 0);
+}
+
+TEST(xpath_api_query_result_fail)
+{
+#ifndef PUGIXML_NO_EXCEPTIONS
+	try
+	{
+#endif
+		xpath_query q(STR("//foo/child::/bar"));
+
+#ifndef PUGIXML_NO_EXCEPTIONS
+		CHECK_FORCE_FAIL("Expected exception");
+	}
+	catch (const xpath_exception& q)
+	{
+#endif
+		xpath_parse_result result = q.result();
+
+		CHECK(!result);
+		CHECK(result.error != 0 && result.error[0] != 0);
+		CHECK(result.description() == result.error);
+		CHECK(result.offset == 13);
+
+#ifndef PUGIXML_NO_EXCEPTIONS
+	}
+#endif
+}
+
+#ifndef PUGIXML_NO_EXCEPTIONS
+TEST(xpath_api_exception_what)
+{
+	try
+	{
+		xpath_query q(STR(""));
+
+		CHECK_FORCE_FAIL("Expected exception");
+	}
+	catch (const xpath_exception& e)
+	{
+		CHECK(e.what()[0] != 0);
+	}
+}
+#endif
+
+TEST(xpath_api_node_set_ctor_out_of_memory)
+{
+	test_runner::_memory_fail_threshold = 1;
+
+	xpath_node data[2];
+
+	CHECK_ALLOC_FAIL(xpath_node_set ns(data, data + 2));
+}
+
+TEST(xpath_api_node_set_copy_ctor_out_of_memory)
+{
+	xpath_node data[2];
+	xpath_node_set ns(data, data + 2);
+
+	test_runner::_memory_fail_threshold = 1;
+
+	CHECK_ALLOC_FAIL(xpath_node_set copy = ns);
+}
+
+TEST_XML(xpath_api_node_set_assign_out_of_memory_preserve, "<node><a/></node>")
+{
+	xpath_node_set ns = doc.select_nodes(STR("node/*"));
+	CHECK(ns.size() == 2);
+	CHECK(ns.type() == xpath_node_set::type_sorted);
+
+	xpath_node_set nsall = doc.select_nodes(STR("//*"));
+	nsall.sort(true);
+	CHECK(nsall.size() == 3);
+	CHECK(nsall.type() == xpath_node_set::type_sorted_reverse);
+
+	test_runner::_memory_fail_threshold = 1;
+
+	CHECK_ALLOC_FAIL(ns = nsall);
+
+	CHECK(ns.size() == 2);
+	CHECK(ns.type() == xpath_node_set::type_sorted);
+	CHECK(ns[0] == doc.child(STR("node")).child(STR("a")) && ns[1] == doc.child(STR("node")).child(STR("b")));
+}
+
+TEST_XML(xpath_api_deprecated_select_single_node, "<node><head/><foo id='1'/><foo/><tail/></node>")
+{
+	xpath_node n1 = doc.select_single_node(STR("node/foo"));
+
+	xpath_query q(STR("node/foo"));
+	xpath_node n2 = doc.select_single_node(q);
+
+	CHECK(n1.node().attribute(STR("id")).as_int() == 1);
+	CHECK(n2.node().attribute(STR("id")).as_int() == 1);
+}
+
+#if __cplusplus >= 201103
+TEST_XML(xpath_api_nodeset_move_ctor, "<node><foo/><foo/><bar/></node>")
+{
+	xpath_node_set set = doc.select_nodes(STR("node/bar/preceding::*"));
+
+	CHECK(set.size() == 2);
+	CHECK(set.type() == xpath_node_set::type_sorted_reverse);
+
+	test_runner::_memory_fail_threshold = 1;
+
+	xpath_node_set move = std::move(set);
+
+	CHECK(set.size() == 0);
+	CHECK(set.type() == xpath_node_set::type_unsorted);
+
+	CHECK(move.size() == 2);
+	CHECK(move.type() == xpath_node_set::type_sorted_reverse);
+	CHECK(move[1] == doc.first_child().first_child());
+}
+
+
+TEST_XML(xpath_api_nodeset_move_ctor_single, "<node><foo/><foo/><bar/></node>")
+{
+	xpath_node_set set = doc.select_nodes(STR("node/bar"));
+
+	CHECK(set.size() == 1);
+	CHECK(set.type() == xpath_node_set::type_sorted);
+
+	test_runner::_memory_fail_threshold = 1;
+
+	xpath_node_set move = std::move(set);
+
+	CHECK(set.size() == 0);
+	CHECK(set.type() == xpath_node_set::type_unsorted);
+
+	CHECK(move.size() == 1);
+	CHECK(move.type() == xpath_node_set::type_sorted);
+	CHECK(move[0] == doc.first_child().last_child());
+}
+
+TEST(xpath_api_nodeset_move_ctor_empty)
+{
+	xpath_node_set set;
+	set.sort();
+
+	CHECK(set.size() == 0);
+	CHECK(set.type() == xpath_node_set::type_sorted);
+
+	test_runner::_memory_fail_threshold = 1;
+
+	xpath_node_set move = std::move(set);
+
+	CHECK(set.size() == 0);
+	CHECK(set.type() == xpath_node_set::type_unsorted);
+
+	CHECK(move.size() == 0);
+	CHECK(move.type() == xpath_node_set::type_sorted);
+}
+
+TEST_XML(xpath_api_nodeset_move_assign, "<node><foo/><foo/><bar/></node>")
+{
+	xpath_node_set set = doc.select_nodes(STR("node/bar/preceding::*"));
+
+	CHECK(set.size() == 2);
+	CHECK(set.type() == xpath_node_set::type_sorted_reverse);
+
+	test_runner::_memory_fail_threshold = 1;
+
+	xpath_node_set move;
+
+	CHECK(move.size() == 0);
+	CHECK(move.type() == xpath_node_set::type_unsorted);
+
+	move = std::move(set);
+
+	CHECK(set.size() == 0);
+	CHECK(set.type() == xpath_node_set::type_unsorted);
+
+	CHECK(move.size() == 2);
+	CHECK(move.type() == xpath_node_set::type_sorted_reverse);
+	CHECK(move[1] == doc.first_child().first_child());
+}
+
+TEST_XML(xpath_api_nodeset_move_assign_destroy, "<node><foo/><foo/><bar/></node>")
+{
+	xpath_node_set set = doc.select_nodes(STR("node/bar/preceding::*"));
+
+	CHECK(set.size() == 2);
+	CHECK(set.type() == xpath_node_set::type_sorted_reverse);
+
+	xpath_node_set all = doc.select_nodes(STR("//*"));
+
+	CHECK(all.size() == 4);
+
+	test_runner::_memory_fail_threshold = 1;
+
+	all = std::move(set);
+
+	CHECK(set.size() == 0);
+	CHECK(set.type() == xpath_node_set::type_unsorted);
+
+	CHECK(all.size() == 2);
+	CHECK(all.type() == xpath_node_set::type_sorted_reverse);
+	CHECK(all[1] == doc.first_child().first_child());
+}
+
+TEST_XML(xpath_api_nodeset_move_assign_single, "<node><foo/><foo/><bar/></node>")
+{
+	xpath_node_set set = doc.select_nodes(STR("node/bar"));
+
+	CHECK(set.size() == 1);
+	CHECK(set.type() == xpath_node_set::type_sorted);
+
+	test_runner::_memory_fail_threshold = 1;
+
+	xpath_node_set move;
+
+	CHECK(move.size() == 0);
+	CHECK(move.type() == xpath_node_set::type_unsorted);
+
+	move = std::move(set);
+
+	CHECK(set.size() == 0);
+	CHECK(set.type() == xpath_node_set::type_unsorted);
+
+	CHECK(move.size() == 1);
+	CHECK(move.type() == xpath_node_set::type_sorted);
+	CHECK(move[0] == doc.first_child().last_child());
+}
+
+TEST(xpath_api_nodeset_move_assign_empty)
+{
+	xpath_node_set set;
+	set.sort();
+
+	CHECK(set.size() == 0);
+	CHECK(set.type() == xpath_node_set::type_sorted);
+
+	test_runner::_memory_fail_threshold = 1;
+
+	xpath_node_set move;
+
+	CHECK(move.size() == 0);
+	CHECK(move.type() == xpath_node_set::type_unsorted);
+
+	move = std::move(set);
+
+	CHECK(set.size() == 0);
+	CHECK(set.type() == xpath_node_set::type_unsorted);
+
+	CHECK(move.size() == 0);
+	CHECK(move.type() == xpath_node_set::type_sorted);
+}
+
+TEST(xpath_api_query_move)
+{
+	xml_node c;
+
+	xpath_query q1(STR("true()"));
+	xpath_query q4(STR("true() and false()"));
+
+	test_runner::_memory_fail_threshold = 1;
+
+	CHECK(q1);
+	CHECK(q1.evaluate_boolean(c));
+
+	xpath_query q2 = std::move(q1);
+	CHECK(!q1);
+	CHECK(!q1.evaluate_boolean(c));
+	CHECK(q2);
+	CHECK(q2.evaluate_boolean(c));
+
+	xpath_query q3;
+	CHECK(!q3);
+	CHECK(!q3.evaluate_boolean(c));
+
+	q3 = std::move(q2);
+	CHECK(!q2);
+	CHECK(!q2.evaluate_boolean(c));
+	CHECK(q3);
+	CHECK(q3.evaluate_boolean(c));
+
+	CHECK(q4);
+	CHECK(!q4.evaluate_boolean(c));
+
+	q4 = std::move(q3);
+
+	CHECK(!q3);
+	CHECK(!q3.evaluate_boolean(c));
+	CHECK(q4);
+	CHECK(q4.evaluate_boolean(c));
+
+	q4 = std::move(*&q4);
+
+	CHECK(q4);
+	CHECK(q4.evaluate_boolean(c));
+}
+
+TEST(xpath_api_query_vector)
+{
+	std::vector<xpath_query> qv;
+
+	for (int i = 0; i < 10; ++i)
+	{
+		char_t expr[2];
+		expr[0] = char_t('0' + i);
+		expr[1] = 0;
+
+		qv.push_back(xpath_query(expr));
+	}
+
+	double result = 0;
+
+	for (auto& q: qv)
+		result += q.evaluate_number(xml_node());
+
+	CHECK(result == 45);
+}
+#endif
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_functions.cpp Added

@@ -0,0 +1,802 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+TEST_XML(xpath_number_number, "<node>123</node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node")).first_child();
+	
+	// number with 0 arguments
+	CHECK_XPATH_NUMBER_NAN(c, STR("number()"));
+	CHECK_XPATH_NUMBER(n, STR("number()"), 123);
+
+	// number with 1 string argument
+	CHECK_XPATH_NUMBER(c, STR("number(' -123.456 ')"), -123.456);
+	CHECK_XPATH_NUMBER(c, STR("number(' -123.')"), -123);
+	CHECK_XPATH_NUMBER(c, STR("number('123.')"), 123);
+	CHECK_XPATH_NUMBER(c, STR("number('.56')"), 0.56);
+	CHECK_XPATH_NUMBER(c, STR("number('123 ')"), 123);
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('foobar')"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('f1')"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('1f')"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('1.f')"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('1.0f')"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('123 f')"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('')"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('.')"));
+
+	// number with 1 bool argument
+	CHECK_XPATH_NUMBER(c, STR("number(true())"), 1);
+	CHECK_XPATH_NUMBER(c, STR("number(false())"), 0);
+
+	// number with 1 node set argument
+	CHECK_XPATH_NUMBER(n, STR("number(.)"), 123);
+
+	// number with 1 number argument
+	CHECK_XPATH_NUMBER(c, STR("number(1)"), 1);
+	
+	// number with 2 arguments
+	CHECK_XPATH_FAIL(STR("number(1, 2)"));
+}
+
+TEST_XML(xpath_number_sum, "<node>123<child>789</child></node><node/>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	
+	// sum with 0 arguments
+	CHECK_XPATH_FAIL(STR("sum()"));
+
+	// sum with 1 argument
+	CHECK_XPATH_NUMBER(c, STR("sum(.)"), 0);
+	CHECK_XPATH_NUMBER(n, STR("sum(.)"), 123789); // 123 .. 789
+	
+	CHECK_XPATH_NUMBER(n, STR("sum(./descendant-or-self::node())"), 125490); // node + 123 + child + 789 = 123789 + 123 + 789 + 789 = 125490
+	CHECK_XPATH_NUMBER(n, STR("sum(.//node())"), 1701); // 123 + child + 789 = 123 + 789 + 789
+	CHECK_XPATH_NUMBER_NAN(doc.last_child(), STR("sum(.)"));
+
+	// sum with 2 arguments
+	CHECK_XPATH_FAIL(STR("sum(1, 2)"));
+	
+	// sum with 1 non-node-set argument
+	CHECK_XPATH_FAIL(STR("sum(1)"));
+}
+
+TEST(xpath_number_floor)
+{
+	xml_node c;
+
+	// floor with 0 arguments
+	CHECK_XPATH_FAIL(STR("floor()"));
+
+	// floor with 1 argument
+	CHECK_XPATH_NUMBER(c, STR("floor(0)"), 0);
+	CHECK_XPATH_NUMBER(c, STR("floor(1.2)"), 1);
+	CHECK_XPATH_NUMBER(c, STR("floor(1)"), 1);
+	CHECK_XPATH_NUMBER(c, STR("floor(-1.2)"), -2);
+	CHECK_XPATH_NUMBER_NAN(c, STR("floor(string('nan'))"));
+	CHECK_XPATH_STRING(c, STR("string(floor(1 div 0))"), STR("Infinity"));
+	CHECK_XPATH_STRING(c, STR("string(floor(-1 div 0))"), STR("-Infinity"));
+
+	// floor with 2 arguments
+	CHECK_XPATH_FAIL(STR("floor(1, 2)"));
+
+	// floor with argument 0 should return 0
+	CHECK_XPATH_STRING(c, STR("string(1 div floor(0))"), STR("Infinity"));
+
+	// floor with argument -0 should return -0
+#if !(defined(__APPLE__) && defined(__MACH__)) // MacOS X gcc 4.0.1 implements floor incorrectly (floor never returns -0)
+	CHECK_XPATH_STRING(c, STR("string(1 div floor(-0))"), STR("-Infinity"));
+#endif
+}
+
+TEST(xpath_number_ceiling)
+{
+	xml_node c;
+
+	// ceiling with 0 arguments
+	CHECK_XPATH_FAIL(STR("ceiling()"));
+
+	// ceiling with 1 argument
+	CHECK_XPATH_NUMBER(c, STR("ceiling(0)"), 0);
+	CHECK_XPATH_NUMBER(c, STR("ceiling(1.2)"), 2);
+	CHECK_XPATH_NUMBER(c, STR("ceiling(1)"), 1);
+	CHECK_XPATH_NUMBER(c, STR("ceiling(-1.2)"), -1);
+	CHECK_XPATH_NUMBER_NAN(c, STR("ceiling(string('nan'))"));
+	CHECK_XPATH_STRING(c, STR("string(ceiling(1 div 0))"), STR("Infinity"));
+	CHECK_XPATH_STRING(c, STR("string(ceiling(-1 div 0))"), STR("-Infinity"));
+
+	// ceiling with 2 arguments
+	CHECK_XPATH_FAIL(STR("ceiling(1, 2)"));
+
+	// ceiling with argument 0 should return 0
+	CHECK_XPATH_STRING(c, STR("string(1 div ceiling(0))"), STR("Infinity"));
+
+	// ceiling with argument in range (-1, -0] should result in minus zero
+#if !(defined(__APPLE__) && defined(__MACH__)) && !defined(__CLR_VER) // MacOS X gcc 4.0.1 and x64 CLR implement ceil incorrectly (ceil never returns -0)
+	CHECK_XPATH_STRING(c, STR("string(1 div ceiling(-0))"), STR("-Infinity"));
+	CHECK_XPATH_STRING(c, STR("string(1 div ceiling(-0.1))"), STR("-Infinity"));
+#endif
+}
+
+TEST(xpath_number_round)
+{
+	xml_node c;
+
+	// round with 0 arguments
+	CHECK_XPATH_FAIL(STR("round()"));
+
+	// round with 1 argument
+	CHECK_XPATH_NUMBER(c, STR("round(1.2)"), 1);
+	CHECK_XPATH_NUMBER(c, STR("round(1.5)"), 2);
+	CHECK_XPATH_NUMBER(c, STR("round(1.8)"), 2);
+	CHECK_XPATH_NUMBER(c, STR("round(1)"), 1);
+	CHECK_XPATH_NUMBER(c, STR("round(-1.2)"), -1);
+	CHECK_XPATH_NUMBER(c, STR("round(-1.5)"), -1);
+	CHECK_XPATH_NUMBER(c, STR("round(-1.6)"), -2);
+	CHECK_XPATH_NUMBER_NAN(c, STR("round(string('nan'))"));
+	CHECK_XPATH_STRING(c, STR("string(round(1 div 0))"), STR("Infinity"));
+	CHECK_XPATH_STRING(c, STR("string(round(-1 div 0))"), STR("-Infinity"));
+
+	// round with 2 arguments
+	CHECK_XPATH_FAIL(STR("round(1, 2)"));
+
+	// round with argument in range [-0.5, -0] should result in minus zero
+	CHECK_XPATH_STRING(c, STR("string(1 div round(0))"), STR("Infinity"));
+
+#if !(defined(__APPLE__) && defined(__MACH__)) && !defined(__CLR_VER) // MacOS X gcc 4.0.1 and x64 CLR implement ceil incorrectly (ceil never returns -0)
+	CHECK_XPATH_STRING(c, STR("string(1 div round(-0.5))"), STR("-Infinity"));
+	CHECK_XPATH_STRING(c, STR("string(1 div round(-0))"), STR("-Infinity"));
+	CHECK_XPATH_STRING(c, STR("string(1 div round(-0.1))"), STR("-Infinity"));
+#endif
+}
+
+TEST_XML(xpath_boolean_boolean, "<node />")
+{
+	xml_node c;
+	
+	// boolean with 0 arguments
+	CHECK_XPATH_FAIL(STR("boolean()"));
+
+	// boolean with 1 number argument
+	CHECK_XPATH_BOOLEAN(c, STR("boolean(0)"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("boolean(1)"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("boolean(-1)"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("boolean(0.1)"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("boolean(number('nan'))"), false);
+
+	// boolean with 1 string argument
+	CHECK_XPATH_BOOLEAN(c, STR("boolean('x')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("boolean('')"), false);
+
+	// boolean with 1 node set argument
+	CHECK_XPATH_BOOLEAN(c, STR("boolean(.)"), false);
+	CHECK_XPATH_BOOLEAN(doc, STR("boolean(.)"), true);
+	CHECK_XPATH_BOOLEAN(doc, STR("boolean(foo)"), false);
+
+	// boolean with 2 arguments
+	CHECK_XPATH_FAIL(STR("boolean(1, 2)"));
+}
+
+TEST(xpath_boolean_not)
+{
+	xml_node c;
+	
+	// not with 0 arguments
+	CHECK_XPATH_FAIL(STR("not()"));
+
+	// not with 1 argument
+	CHECK_XPATH_BOOLEAN(c, STR("not(true())"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("not(false())"), true);
+	
+	// boolean with 2 arguments
+	CHECK_XPATH_FAIL(STR("not(1, 2)"));
+}
+
+TEST(xpath_boolean_true)
+{
+	xml_node c;
+	
+	// true with 0 arguments
+	CHECK_XPATH_BOOLEAN(c, STR("true()"), true);
+
+	// true with 1 argument
+	CHECK_XPATH_FAIL(STR("true(1)"));
+}
+
+TEST(xpath_boolean_false)
+{
+	xml_node c;
+	
+	// false with 0 arguments
+	CHECK_XPATH_BOOLEAN(c, STR("false()"), false);
+
+	// false with 1 argument
+	CHECK_XPATH_FAIL(STR("false(1)"));
+}
+
+TEST_XML(xpath_boolean_lang, "<node xml:lang='en'><child xml:lang='zh-UK'><subchild attr=''/></child></node><foo><bar/></foo>")
+{
+	xml_node c;
+	
+	// lang with 0 arguments
+	CHECK_XPATH_FAIL(STR("lang()"));
+
+	// lang with 1 argument, no language
+	CHECK_XPATH_BOOLEAN(c, STR("lang('en')"), false);
+	CHECK_XPATH_BOOLEAN(doc.child(STR("foo")), STR("lang('en')"), false);
+	CHECK_XPATH_BOOLEAN(doc.child(STR("foo")), STR("lang('')"), false);
+	CHECK_XPATH_BOOLEAN(doc.child(STR("foo")).child(STR("bar")), STR("lang('en')"), false);
+	
+	// lang with 1 argument, same language/prefix
+	CHECK_XPATH_BOOLEAN(doc.child(STR("node")), STR("lang('en')"), true);
+	CHECK_XPATH_BOOLEAN(doc.child(STR("node")).child(STR("child")), STR("lang('zh-uk')"), true);
+	CHECK_XPATH_BOOLEAN(doc.child(STR("node")).child(STR("child")), STR("lang('zh')"), true);
+	CHECK_XPATH_BOOLEAN(doc.child(STR("node")).child(STR("child")).child(STR("subchild")), STR("lang('zh')"), true);
+	CHECK_XPATH_BOOLEAN(doc.child(STR("node")).child(STR("child")).child(STR("subchild")), STR("lang('ZH')"), true);
+
+	// lang with 1 argument, different language/prefix
+	CHECK_XPATH_BOOLEAN(doc.child(STR("node")), STR("lang('')"), false);
+	CHECK_XPATH_BOOLEAN(doc.child(STR("node")), STR("lang('e')"), false);
+	CHECK_XPATH_BOOLEAN(doc.child(STR("node")).child(STR("child")), STR("lang('en')"), false);
+	CHECK_XPATH_BOOLEAN(doc.child(STR("node")).child(STR("child")), STR("lang('zh-gb')"), false);
+	CHECK_XPATH_BOOLEAN(doc.child(STR("node")).child(STR("child")), STR("lang('r')"), false);
+	CHECK_XPATH_BOOLEAN(doc.child(STR("node")).child(STR("child")).child(STR("subchild")), STR("lang('en')"), false);
+
+	// lang with 1 attribute argument
+	CHECK_XPATH_NODESET(doc, STR("//@*[lang('en')]"));
+
+	// lang with 2 arguments
+	CHECK_XPATH_FAIL(STR("lang(1, 2)"));
+}
+
+TEST_XML(xpath_string_string, "<node>123<child id='1'>789</child><child><subchild><![CDATA[200]]></subchild></child>100</node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// string with 0 arguments
+	CHECK_XPATH_STRING(c, STR("string()"), STR(""));
+	CHECK_XPATH_STRING(n.child(STR("child")), STR("string()"), STR("789"));
+
+	// string with 1 node-set argument
+	CHECK_XPATH_STRING(n, STR("string(child)"), STR("789"));
+	CHECK_XPATH_STRING(n, STR("string(child/@id)"), STR("1"));
+	CHECK_XPATH_STRING(n, STR("string(.)"), STR("123789200100"));
+
+	// string with 1 number argument
+	CHECK_XPATH_STRING(c, STR("string(0 div 0)"), STR("NaN"));
+	CHECK_XPATH_STRING(c, STR("string(0)"), STR("0"));
+	CHECK_XPATH_STRING(c, STR("string(-0)"), STR("0"));
+	CHECK_XPATH_STRING(c, STR("string(1 div 0)"), STR("Infinity"));
+	CHECK_XPATH_STRING(c, STR("string(-1 div -0)"), STR("Infinity"));
+	CHECK_XPATH_STRING(c, STR("string(-1 div 0)"), STR("-Infinity"));
+	CHECK_XPATH_STRING(c, STR("string(1 div -0)"), STR("-Infinity"));
+	CHECK_XPATH_STRING(c, STR("string(1234567)"), STR("1234567"));
+	CHECK_XPATH_STRING(c, STR("string(-1234567)"), STR("-1234567"));
+	CHECK_XPATH_STRING(c, STR("string(1234.5678)"), STR("1234.5678"));
+	CHECK_XPATH_STRING(c, STR("string(-1234.5678)"), STR("-1234.5678"));
+	CHECK_XPATH_STRING(c, STR("string(0.5678)"), STR("0.5678"));
+	CHECK_XPATH_STRING(c, STR("string(-0.5678)"), STR("-0.5678"));
+	CHECK_XPATH_STRING(c, STR("string(0.0)"), STR("0"));
+	CHECK_XPATH_STRING(c, STR("string(-0.0)"), STR("0"));
+
+	// string with 1 boolean argument
+	CHECK_XPATH_STRING(c, STR("string(true())"), STR("true"));
+	CHECK_XPATH_STRING(c, STR("string(false())"), STR("false"));
+
+	// string with 1 string argument
+	CHECK_XPATH_STRING(c, STR("string('abc')"), STR("abc"));
+
+	// string with 2 arguments
+	CHECK_XPATH_FAIL(STR("string(1, 2)"));
+}
+
+TEST(xpath_string_concat)
+{
+	xml_node c;
+
+	// concat with 0 arguments
+	CHECK_XPATH_FAIL(STR("concat()"));
+
+	// concat with 1 argument
+	CHECK_XPATH_FAIL(STR("concat('')"));
+
+	// concat with exactly 2 arguments
+	CHECK_XPATH_STRING(c, STR("concat('prev','next')"), STR("prevnext"));
+	CHECK_XPATH_STRING(c, STR("concat('','next')"), STR("next"));
+	CHECK_XPATH_STRING(c, STR("concat('prev','')"), STR("prev"));
+
+	// concat with 3 or more arguments
+	CHECK_XPATH_STRING(c, STR("concat('a', 'b', 'c')"), STR("abc"));
+	CHECK_XPATH_STRING(c, STR("concat('a', 'b', 'c', 'd')"), STR("abcd"));
+	CHECK_XPATH_STRING(c, STR("concat('a', 'b', 'c', 'd', 'e')"), STR("abcde"));
+	CHECK_XPATH_STRING(c, STR("concat('a', 'b', 'c', 'd', 'e', 'f')"), STR("abcdef"));
+	CHECK_XPATH_STRING(c, STR("concat('a', 'b', 'c', 'd', 'e', 'f', 'g')"), STR("abcdefg"));
+	CHECK_XPATH_STRING(c, STR("concat(1, 2, 3, 4, 5, 6, 7, 8)"), STR("12345678"));
+}
+
+TEST(xpath_string_starts_with)
+{
+	xml_node c;
+
+	// starts-with with 0 arguments
+	CHECK_XPATH_FAIL(STR("starts-with()"));
+
+	// starts-with with 1 argument
+	CHECK_XPATH_FAIL(STR("starts-with('a')"));
+
+	// starts-with with 2 arguments
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('abc', '')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('abc', 'a')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('abc', 'abc')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('abc', 'abcd')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('bc', 'c')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('', 'c')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('', '')"), true);
+
+	// starts-with with 3 arguments
+	CHECK_XPATH_FAIL(STR("starts-with('a', 'b', 'c')"));
+}
+
+TEST(xpath_string_contains)
+{
+	xml_node c;
+
+	// contains with 0 arguments
+	CHECK_XPATH_FAIL(STR("contains()"));
+
+	// contains with 1 argument
+	CHECK_XPATH_FAIL(STR("contains('a')"));
+
+	// contains with 2 arguments
+	CHECK_XPATH_BOOLEAN(c, STR("contains('abc', '')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('abc', 'a')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('abc', 'abc')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('abcd', 'bc')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('abc', 'abcd')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('b', 'bc')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('', 'c')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('', '')"), true);
+
+	// contains with 3 arguments
+	CHECK_XPATH_FAIL(STR("contains('a', 'b', 'c')"));
+}
+
+TEST(xpath_string_substring_before)
+{
+	xml_node c;
+
+	// substring-before with 0 arguments
+	CHECK_XPATH_FAIL(STR("substring-before()"));
+
+	// substring-before with 1 argument
+	CHECK_XPATH_FAIL(STR("substring-before('a')"));
+	
+	// substring-before with 2 arguments
+	CHECK_XPATH_STRING(c, STR("substring-before('abc', 'abc')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring-before('abc', 'a')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring-before('abc', 'cd')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring-before('abc', 'b')"), STR("a"));
+	CHECK_XPATH_STRING(c, STR("substring-before('abc', 'c')"), STR("ab"));
+	CHECK_XPATH_STRING(c, STR("substring-before('abc', '')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring-before('', '')"), STR(""));
+	
+	// substring-before with 2 arguments, from W3C standard
+	CHECK_XPATH_STRING(c, STR("substring-before(\"1999/04/01\",\"/\")"), STR("1999"));
+
+	// substring-before with 3 arguments
+	CHECK_XPATH_FAIL(STR("substring-before('a', 'b', 'c')"));
+}
+
+TEST(xpath_string_substring_after)
+{
+	xml_node c;
+
+	// substring-after with 0 arguments
+	CHECK_XPATH_FAIL(STR("substring-after()"));
+
+	// substring-after with 1 argument
+	CHECK_XPATH_FAIL(STR("substring-after('a')"));
+	
+	// substring-after with 2 arguments
+	CHECK_XPATH_STRING(c, STR("substring-after('abc', 'abc')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring-after('abc', 'a')"), STR("bc"));
+	CHECK_XPATH_STRING(c, STR("substring-after('abc', 'cd')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring-after('abc', 'b')"), STR("c"));
+	CHECK_XPATH_STRING(c, STR("substring-after('abc', 'c')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring-after('abc', '')"), STR("abc"));
+	CHECK_XPATH_STRING(c, STR("substring-after('', '')"), STR(""));
+
+	// substring-before with 2 arguments, from W3C standard
+	CHECK_XPATH_STRING(c, STR("substring-after(\"1999/04/01\",\"/\")"), STR("04/01"));
+	CHECK_XPATH_STRING(c, STR("substring-after(\"1999/04/01\",\"19\")"), STR("99/04/01"));
+
+	// substring-after with 3 arguments
+	CHECK_XPATH_FAIL(STR("substring-after('a', 'b', 'c')"));
+}
+
+TEST_XML(xpath_string_substring_after_heap, "<node>foo<child/>bar</node>")
+{
+ CHECK_XPATH_STRING(doc, STR("substring-after(node, 'fo')"), STR("obar"));
+ CHECK_XPATH_STRING(doc, STR("substring-after(node, 'fooba')"), STR("r"));
+ CHECK_XPATH_STRING(doc, STR("substring-after(node, 'foobar')"), STR(""));
+}
+
+TEST(xpath_string_substring)
+{
+	xml_node c;
+
+	// substring with 0 arguments
+	CHECK_XPATH_FAIL(STR("substring()"));
+	
+	// substring with 1 argument
+	CHECK_XPATH_FAIL(STR("substring('')"));
+	
+	// substring with 2 arguments
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 2)"), STR("bcd"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 1)"), STR("abcd"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 1.1)"), STR("abcd"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 1.5)"), STR("bcd"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 1.8)"), STR("bcd"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 10)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 0)"), STR("abcd"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', -100)"), STR("abcd"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', -1 div 0)"), STR("abcd"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 1 div 0)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 0 div 0)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('', 1)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('', 0)"), STR(""));
+ CHECK_XPATH_STRING(c, STR("substring(substring('internalexternalcorrect substring',9),9)"), STR("correct substring"));
+
+	// substring with 3 arguments
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 2, 1)"), STR("b"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 2, 2)"), STR("bc"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 1, 0)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 1, 0.4)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 1, 0.5)"), STR("a"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 10, -5)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 0, -1)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', -100, 100)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', -100, 101)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', -100, 102)"), STR("a"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', -100, 103)"), STR("ab"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', -100, 104)"), STR("abc"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', -100, 105)"), STR("abcd"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', -100, 106)"), STR("abcd"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', -100, 1 div 0)"), STR("abcd"));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', -1 div 0, 4)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 1 div 0, 0 div 0)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('abcd', 0 div 0, 1)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('', 1, 2)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('', 0, 0)"), STR(""));
+
+	// substring with 3 arguments, from W3C standard
+	CHECK_XPATH_STRING(c, STR("substring('12345', 1.5, 2.6)"), STR("234"));
+	CHECK_XPATH_STRING(c, STR("substring('12345', 0, 3)"), STR("12"));
+	CHECK_XPATH_STRING(c, STR("substring('12345', 0 div 0, 3)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('12345', 1, 0 div 0)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('12345', -42, 1 div 0)"), STR("12345"));
+	CHECK_XPATH_STRING(c, STR("substring('12345', -1 div 0, 1 div 0)"), STR(""));
+
+	// substring with 4 arguments
+	CHECK_XPATH_FAIL(STR("substring('', 1, 2, 3)"));
+}
+
+TEST_XML(xpath_string_substring_heap, "<node>foo<child/>bar</node>")
+{
+ CHECK_XPATH_STRING(doc, STR("substring(node, 3)"), STR("obar"));
+ CHECK_XPATH_STRING(doc, STR("substring(node, 6)"), STR("r"));
+ CHECK_XPATH_STRING(doc, STR("substring(node, 7)"), STR(""));
+}
+
+TEST_XML(xpath_string_string_length, "<node>123</node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// string-length with 0 arguments
+	CHECK_XPATH_NUMBER(c, STR("string-length()"), 0);
+	CHECK_XPATH_NUMBER(n, STR("string-length()"), 3);
+
+	// string-length with 1 argument
+	CHECK_XPATH_NUMBER(c, STR("string-length('')"), 0);
+	CHECK_XPATH_NUMBER(c, STR("string-length('a')"), 1);
+	CHECK_XPATH_NUMBER(c, STR("string-length('abcdef')"), 6);
+
+	// string-length with 2 arguments
+	CHECK_XPATH_FAIL(STR("string-length(1, 2)"));
+}
+
+TEST_XML_FLAGS(xpath_string_normalize_space, "<node> \t\r\rval1 \rval2\r\nval3\nval4\r\r</node>", parse_minimal)
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// normalize-space with 0 arguments
+	CHECK_XPATH_STRING(c, STR("normalize-space()"), STR(""));
+	CHECK_XPATH_STRING(n, STR("normalize-space()"), STR("val1 val2 val3 val4"));
+	
+	// normalize-space with 1 argument
+	CHECK_XPATH_STRING(c, STR("normalize-space('')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("normalize-space('abcd')"), STR("abcd"));
+	CHECK_XPATH_STRING(c, STR("normalize-space(' \r\nabcd')"), STR("abcd"));
+	CHECK_XPATH_STRING(c, STR("normalize-space('abcd \n\r')"), STR("abcd"));
+	CHECK_XPATH_STRING(c, STR("normalize-space('ab\r\n\tcd')"), STR("ab cd"));
+	CHECK_XPATH_STRING(c, STR("normalize-space('ab cd')"), STR("ab cd"));
+	CHECK_XPATH_STRING(c, STR("normalize-space('\07')"), STR("\07"));
+	
+	// normalize-space with 2 arguments
+	CHECK_XPATH_FAIL(STR("normalize-space(1, 2)"));
+}
+
+TEST(xpath_string_translate)
+{
+	xml_node c;
+
+	// translate with 0 arguments
+	CHECK_XPATH_FAIL(STR("translate()"));
+	
+	// translate with 1 argument
+	CHECK_XPATH_FAIL(STR("translate('a')"));
+
+	// translate with 2 arguments
+	CHECK_XPATH_FAIL(STR("translate('a', 'b')"));
+	
+	// translate with 3 arguments
+	CHECK_XPATH_STRING(c, STR("translate('abc', '', '')"), STR("abc"));
+	CHECK_XPATH_STRING(c, STR("translate('abc', '', 'foo')"), STR("abc"));
+	CHECK_XPATH_STRING(c, STR("translate('abc', 'ab', 'ba')"), STR("bac"));
+	CHECK_XPATH_STRING(c, STR("translate('abc', 'ab', 'f')"), STR("fc"));
+	CHECK_XPATH_STRING(c, STR("translate('abc', 'aabb', '1234')"), STR("13c"));
+	CHECK_XPATH_STRING(c, STR("translate('', 'abc', 'bac')"), STR(""));
+
+	// translate with 3 arguments, from W3C standard
+	CHECK_XPATH_STRING(c, STR("translate('bar','abc','ABC')"), STR("BAr"));
+	CHECK_XPATH_STRING(c, STR("translate('--aaa--','abc-','ABC')"), STR("AAA"));
+
+	// translate with 4 arguments
+	CHECK_XPATH_FAIL(STR("translate('a', 'b', 'c', 'd')"));
+}
+
+TEST(xpath_string_translate_table)
+{
+	xml_node c;
+
+	CHECK_XPATH_STRING(c, STR("translate('abcd\xe9 ', 'abc', 'ABC')"), STR("ABCd\xe9 "));
+	CHECK_XPATH_STRING(c, STR("translate('abcd\xe9 ', 'abc\xe9', 'ABC!')"), STR("ABCd! "));
+	CHECK_XPATH_STRING(c, STR("translate('abcde', concat('abc', 'd'), 'ABCD')"), STR("ABCDe"));
+	CHECK_XPATH_STRING(c, STR("translate('abcde', 'abcd', concat('ABC', 'D'))"), STR("ABCDe"));
+}
+
+TEST(xpath_string_translate_remove)
+{
+	xml_node c;
+
+	CHECK_XPATH_STRING(c, STR("translate('000000755', '0', '')"), STR("755"));
+	CHECK_XPATH_STRING(c, STR("translate('000000755', concat('0', ''), '')"), STR("755"));
+}
+
+TEST_XML(xpath_nodeset_last, "<node><c1/><c1/><c2/><c3/><c3/><c3/><c3/></node>")
+{
+	xml_node n = doc.child(STR("node"));
+
+	// last with 0 arguments
+	CHECK_XPATH_NUMBER(n, STR("last()"), 1);
+	CHECK_XPATH_NODESET(n, STR("c1[last() = 1]"));
+	CHECK_XPATH_NODESET(n, STR("c1[last() = 2]")) % 3 % 4; // c1, c1
+	CHECK_XPATH_NODESET(n, STR("c2/preceding-sibling::node()[last() = 2]")) % 4 % 3; // c1, c1
+
+	// last with 1 argument
+	CHECK_XPATH_FAIL(STR("last(c)"));
+}
+
+TEST_XML(xpath_nodeset_position, "<node><c1/><c1/><c2/><c3/><c3/><c3/><c3/></node>")
+{
+	xml_node n = doc.child(STR("node"));
+
+	// position with 0 arguments
+	CHECK_XPATH_NUMBER(n, STR("position()"), 1);
+	CHECK_XPATH_NODESET(n, STR("c1[position() = 0]"));
+	CHECK_XPATH_NODESET(n, STR("c1[position() = 1]")) % 3;
+	CHECK_XPATH_NODESET(n, STR("c1[position() = 2]")) % 4;
+	CHECK_XPATH_NODESET(n, STR("c1[position() = 3]"));
+	CHECK_XPATH_NODESET(n, STR("c2/preceding-sibling::node()[position() = 1]")) % 4;
+	CHECK_XPATH_NODESET(n, STR("c2/preceding-sibling::node()[position() = 2]")) % 3;
+	
+	// position with 1 argument
+	CHECK_XPATH_FAIL(STR("position(c)"));
+}
+
+TEST_XML(xpath_nodeset_count, "<node><c1/><c1/><c2/><c3/><c3/><c3/><c3/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// count with 0 arguments
+	CHECK_XPATH_FAIL(STR("count()"));
+
+	// count with 1 non-node-set argument
+	CHECK_XPATH_FAIL(STR("count(1)"));
+	CHECK_XPATH_FAIL(STR("count(true())"));
+	CHECK_XPATH_FAIL(STR("count('')"));
+
+	// count with 1 node-set argument
+	CHECK_XPATH_NUMBER(c, STR("count(.)"), 0);
+	CHECK_XPATH_NUMBER(n, STR("count(.)"), 1);
+	CHECK_XPATH_NUMBER(n, STR("count(c1)"), 2);
+	CHECK_XPATH_NUMBER(n, STR("count(c2)"), 1);
+	CHECK_XPATH_NUMBER(n, STR("count(c3)"), 4);
+	CHECK_XPATH_NUMBER(n, STR("count(c4)"), 0);
+
+	// count with 2 arguments
+	CHECK_XPATH_FAIL(STR("count(x, y)"));
+}
+
+TEST_XML(xpath_nodeset_id, "<node id='foo'/>")
+{
+	xml_node n = doc.child(STR("node"));
+
+	// id with 0 arguments
+	CHECK_XPATH_FAIL(STR("id()"));
+	
+	// id with 1 argument - no DTD => no id
+	CHECK_XPATH_NODESET(n, STR("id('foo')"));
+
+	// id with 2 arguments
+	CHECK_XPATH_FAIL(STR("id(1, 2)"));
+}
+
+TEST_XML_FLAGS(xpath_nodeset_local_name, "<node xmlns:foo='http://foo'><c1>text</c1><c2 xmlns:foo='http://foo2' foo:attr='value'><foo:child/></c2><c3 xmlns='http://def' attr='value'><child/></c3><c4><?target stuff?></c4></node>", parse_default | parse_pi)
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// local-name with 0 arguments
+	CHECK_XPATH_STRING(c, STR("local-name()"), STR(""));
+	CHECK_XPATH_STRING(n, STR("local-name()"), STR("node"));
+	
+	// local-name with 1 non-node-set argument
+	CHECK_XPATH_FAIL(STR("local-name(1)"));
+
+	// local-name with 1 node-set argument
+	CHECK_XPATH_STRING(n, STR("local-name(c1)"), STR("c1"));
+	CHECK_XPATH_STRING(n, STR("local-name(c2/node())"), STR("child"));
+	CHECK_XPATH_STRING(n, STR("local-name(c2/attribute::node())"), STR("attr"));
+	CHECK_XPATH_STRING(n, STR("local-name(c1/node())"), STR(""));
+	CHECK_XPATH_STRING(n, STR("local-name(c4/node())"), STR("target"));
+	CHECK_XPATH_STRING(n, STR("local-name(c1/following-sibling::node())"), STR("c2"));
+	CHECK_XPATH_STRING(n, STR("local-name(c4/preceding-sibling::node())"), STR("c1"));
+
+	// local-name with 2 arguments
+	CHECK_XPATH_FAIL(STR("local-name(c1, c2)"));
+}
+
+TEST_XML_FLAGS(xpath_nodeset_namespace_uri, "<node xmlns:foo='http://foo'><c1>text</c1><c2 xmlns:foo='http://foo2' foo:attr='value'><foo:child/></c2><c3 xmlns='http://def' attr='value'><child/></c3><c4><?target stuff?></c4><c5><foo:child/></c5><c6 bar:attr=''/><c7><node foo:attr=''/></c7></node>", parse_default | parse_pi)
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// namespace-uri with 0 arguments
+	CHECK_XPATH_STRING(c, STR("namespace-uri()"), STR(""));
+	CHECK_XPATH_STRING(n.child(STR("c2")).child(STR("foo:child")), STR("namespace-uri()"), STR("http://foo2"));
+	
+	// namespace-uri with 1 non-node-set argument
+	CHECK_XPATH_FAIL(STR("namespace-uri(1)"));
+
+	// namespace-uri with 1 node-set argument
+	CHECK_XPATH_STRING(n, STR("namespace-uri(c1)"), STR(""));
+	CHECK_XPATH_STRING(n, STR("namespace-uri(c5/child::node())"), STR("http://foo"));
+	CHECK_XPATH_STRING(n, STR("namespace-uri(c2/attribute::node())"), STR("http://foo2"));
+	CHECK_XPATH_STRING(n, STR("namespace-uri(c2/child::node())"), STR("http://foo2"));
+	CHECK_XPATH_STRING(n, STR("namespace-uri(c1/child::node())"), STR(""));
+	CHECK_XPATH_STRING(n, STR("namespace-uri(c4/child::node())"), STR(""));
+	CHECK_XPATH_STRING(n, STR("namespace-uri(c3)"), STR("http://def"));
+	CHECK_XPATH_STRING(n, STR("namespace-uri(c3/@attr)"), STR("")); // the namespace name for an unprefixed attribute name always has no value (Namespaces in XML 1.0)
+	CHECK_XPATH_STRING(n, STR("namespace-uri(c3/child::node())"), STR("http://def"));
+	CHECK_XPATH_STRING(n, STR("namespace-uri(c6/@bar:attr)"), STR(""));
+	CHECK_XPATH_STRING(n, STR("namespace-uri(c7/node/@foo:attr)"), STR("http://foo"));
+
+	// namespace-uri with 2 arguments
+	CHECK_XPATH_FAIL(STR("namespace-uri(c1, c2)"));
+}
+
+TEST_XML_FLAGS(xpath_nodeset_name, "<node xmlns:foo='http://foo'><c1>text</c1><c2 xmlns:foo='http://foo2' foo:attr='value'><foo:child/></c2><c3 xmlns='http://def' attr='value'><child/></c3><c4><?target stuff?></c4></node>", parse_default | parse_pi)
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// name with 0 arguments
+	CHECK_XPATH_STRING(c, STR("name()"), STR(""));
+	CHECK_XPATH_STRING(n, STR("name()"), STR("node"));
+	
+	// name with 1 non-node-set argument
+	CHECK_XPATH_FAIL(STR("name(1)"));
+
+	// name with 1 node-set argument
+	CHECK_XPATH_STRING(n, STR("name(c1)"), STR("c1"));
+	CHECK_XPATH_STRING(n, STR("name(c2/node())"), STR("foo:child"));
+	CHECK_XPATH_STRING(n, STR("name(c2/attribute::node())"), STR("foo:attr"));
+	CHECK_XPATH_STRING(n, STR("name(c1/node())"), STR(""));
+	CHECK_XPATH_STRING(n, STR("name(c4/node())"), STR("target"));
+	CHECK_XPATH_STRING(n, STR("name(c1/following-sibling::node())"), STR("c2"));
+	CHECK_XPATH_STRING(n, STR("name(c4/preceding-sibling::node())"), STR("c1"));
+
+	// name with 2 arguments
+	CHECK_XPATH_FAIL(STR("name(c1, c2)"));
+}
+
+TEST(xpath_function_arguments)
+{
+	xml_node c;
+
+	// conversion to string
+	CHECK_XPATH_NUMBER(c, STR("string-length(12)"), 2);
+	
+	// conversion to number
+	CHECK_XPATH_NUMBER(c, STR("round('1.2')"), 1);
+	CHECK_XPATH_NUMBER(c, STR("round('1.7')"), 2);
+
+	// conversion to boolean
+	CHECK_XPATH_BOOLEAN(c, STR("not('1')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("not('')"), true);
+	
+	// conversion to node set
+	CHECK_XPATH_FAIL(STR("sum(1)"));
+
+	// expression evaluation
+	CHECK_XPATH_NUMBER(c, STR("round((2 + 2 * 2) div 4)"), 2);
+	
+	// empty expressions
+	CHECK_XPATH_FAIL(STR("round(,)"));
+	CHECK_XPATH_FAIL(STR("substring(,)"));
+	CHECK_XPATH_FAIL(STR("substring('a',)"));
+	CHECK_XPATH_FAIL(STR("substring(,'a')"));
+
+	// extra commas
+	CHECK_XPATH_FAIL(STR("round(,1)"));
+	CHECK_XPATH_FAIL(STR("round(1,)"));
+
+	// lack of commas
+	CHECK_XPATH_FAIL(STR("substring(1 2)"));
+
+	// whitespace after function name
+	CHECK_XPATH_BOOLEAN(c, STR("true ()"), true);
+
+	// too many arguments
+	CHECK_XPATH_FAIL(STR("round(1, 2, 3, 4, 5, 6)"));
+}
+
+TEST_XML_FLAGS(xpath_string_value, "<node><c1>pcdata</c1><c2><child/></c2><c3 attr='avalue'/><c4><?target pivalue?></c4><c5></c5><c6><![CDATA[cdata]]></c6></node>", parse_default | parse_pi | parse_comments)
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_STRING(c, STR("string()"), STR(""));
+	CHECK_XPATH_STRING(doc, STR("string()"), STR("pcdatacdata"));
+	CHECK_XPATH_STRING(n, STR("string()"), STR("pcdatacdata"));
+	CHECK_XPATH_STRING(n, STR("string(c1/node())"), STR("pcdata"));
+	CHECK_XPATH_STRING(n, STR("string(c2/node())"), STR(""));
+	CHECK_XPATH_STRING(n, STR("string(c3/@attr)"), STR("avalue"));
+	CHECK_XPATH_STRING(n, STR("string(c4/node())"), STR("pivalue"));
+	CHECK_XPATH_STRING(n, STR("string(c5/node())"), STR("comment"));
+	CHECK_XPATH_STRING(n, STR("string(c6/node())"), STR("cdata"));
+}
+
+TEST(xpath_string_value_empty)
+{
+	xml_document doc;
+	doc.append_child(node_pcdata).set_value(STR("head"));
+	doc.append_child(node_pcdata);
+	doc.append_child(node_pcdata).set_value(STR("tail"));
+
+	CHECK_XPATH_STRING(doc, STR("string()"), STR("headtail"));
+}
+
+TEST_XML(xpath_string_concat_translate, "<node>foobar</node>")
+{
+	CHECK_XPATH_STRING(doc, STR("concat('a', 'b', 'c', translate(node, 'o', 'a'), 'd')"), STR("abcfaabard"));
+}
+
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_operators.cpp Added

@@ -0,0 +1,536 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+TEST(xpath_operators_arithmetic)
+{
+	xml_node c;
+
+	// incorrect unary operator
+	CHECK_XPATH_FAIL(STR("-"));
+
+	// correct unary operator
+	CHECK_XPATH_NUMBER(c, STR("-1"), -1);
+	CHECK_XPATH_NUMBER(c, STR("--1"), 1);
+	CHECK_XPATH_NUMBER(c, STR("---1"), -1);
+
+	// incorrect binary operators
+	CHECK_XPATH_FAIL(STR("5+"));
+	CHECK_XPATH_FAIL(STR("5-"));
+	CHECK_XPATH_FAIL(STR("5*"));
+	CHECK_XPATH_FAIL(STR("+5"));
+	CHECK_XPATH_FAIL(STR("*5"));
+	CHECK_XPATH_FAIL(STR("1div2"));
+	CHECK_XPATH_FAIL(STR("1mod"));
+	CHECK_XPATH_FAIL(STR("1div"));
+
+	// correct trivial binary operators
+	CHECK_XPATH_NUMBER(c, STR("1 + 2"), 3);
+	CHECK_XPATH_NUMBER(c, STR("1+2"), 3);
+	CHECK_XPATH_NUMBER(c, STR("1 * 2"), 2);
+	CHECK_XPATH_NUMBER(c, STR("1*2"), 2);
+	CHECK_XPATH_NUMBER(c, STR("1 div 2"), 0.5);
+
+	// operator precedence
+	CHECK_XPATH_NUMBER(c, STR("2 + 2 * 2 div 1 mod 3"), 3);
+	CHECK_XPATH_NUMBER(c, STR("2 + 2 * 2 div (1 mod 3)"), 6);
+	CHECK_XPATH_NUMBER(c, STR("(2 + 2) * 2 div (1 mod 3)"), 8);
+	CHECK_XPATH_NUMBER(c, STR("(2 + 2) * (2 div 1) mod 3"), 2);
+	CHECK_XPATH_NUMBER(c, STR("2 - -2"), 4);
+	CHECK_XPATH_NUMBER(c, STR("2 + -2"), 0);
+	CHECK_XPATH_NUMBER(c, STR("2--2"), 4);
+	CHECK_XPATH_NUMBER(c, STR("2+-2"), 0);
+	CHECK_XPATH_NUMBER(c, STR("1-2-3"), -4);
+
+	// mod, from W3C standard
+	CHECK_XPATH_NUMBER(c, STR("5 mod 2"), 1);
+	CHECK_XPATH_NUMBER(c, STR("5 mod -2"), 1);
+	CHECK_XPATH_NUMBER(c, STR("-5 mod 2"), -1);
+	CHECK_XPATH_NUMBER(c, STR("-5 mod -2"), -1);
+}
+
+TEST(xpath_operators_arithmetic_specials)
+{
+	xml_node c;
+
+	// infinity/nan
+	CHECK_XPATH_STRING(c, STR("1 div 0"), STR("Infinity"));
+	CHECK_XPATH_STRING(c, STR("-1 div 0"), STR("-Infinity"));
+	CHECK_XPATH_STRING(c, STR("-1 div 0 + 1 div 0"), STR("NaN"));
+	CHECK_XPATH_STRING(c, STR("0 div 0"), STR("NaN"));
+	CHECK_XPATH_STRING(c, STR("1 div 0 + 1 div 0"), STR("Infinity"));
+	CHECK_XPATH_STRING(c, STR("-1 div 0 + -1 div 0"), STR("-Infinity"));
+	CHECK_XPATH_STRING(c, STR("1 div 0 + 100"), STR("Infinity"));
+	CHECK_XPATH_STRING(c, STR("-1 div 0 + 100"), STR("-Infinity"));
+	CHECK_XPATH_STRING(c, STR("0 div 0 + 100"), STR("NaN"));
+	
+	// unary - and multiplication clarifications from recommendations errata
+	CHECK_XPATH_STRING(c, STR("1 div -0"), STR("-Infinity"));
+	CHECK_XPATH_STRING(c, STR("-1 div -0"), STR("Infinity"));
+	CHECK_XPATH_STRING(c, STR("1 div (-0 * 1)"), STR("-Infinity"));
+	CHECK_XPATH_STRING(c, STR("-1 div (0 * -1)"), STR("Infinity"));
+	CHECK_XPATH_STRING(c, STR("1 div (-0 div 1)"), STR("-Infinity"));
+	CHECK_XPATH_STRING(c, STR("-1 div (0 div -1)"), STR("Infinity"));
+}
+
+TEST_XML(xpath_operators_arithmetic_subtraction_parse, "<node><foo-bar>10</foo-bar><foo>2</foo><bar>3</bar></node>")
+{
+	xml_node n = doc.child(STR("node"));
+
+	// correct subtraction parsing, from W3C standard
+	CHECK_XPATH_NUMBER(n, STR("foo-bar"), 10);
+	CHECK_XPATH_NUMBER(n, STR("foo -bar"), -1);
+	CHECK_XPATH_NUMBER(n, STR("foo - bar"), -1);
+	CHECK_XPATH_NUMBER(n, STR("-foo-bar"), -10);
+	CHECK_XPATH_NUMBER(n, STR("-foo -bar"), -5);
+}
+
+TEST(xpath_operators_logical)
+{
+	xml_node c;
+
+	// boolean arithmetic
+	CHECK_XPATH_BOOLEAN(c, STR("true() or true()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("true() or false()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("false() or false()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("false() or true()"), true);
+
+	CHECK_XPATH_BOOLEAN(c, STR("true() and true()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("true() and false()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("false() and false()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("false() and true()"), false);
+	
+	// boolean conversion
+	CHECK_XPATH_BOOLEAN(c, STR("1 or ''"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 and ''"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("0 or ''"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("0 or 'a'"), true);
+}
+
+TEST(xpath_operators_equality_primitive_boolean)
+{
+	xml_node c;
+
+	// boolean vs boolan
+	CHECK_XPATH_BOOLEAN(c, STR("true() = true()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("false() = false()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("true() != false()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("false() != false()"), false);
+
+	// upcast to boolean
+	CHECK_XPATH_BOOLEAN(c, STR("true() = 2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("true() != 2"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("false() = 2"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("false() != 2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("false() = 0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("false() != 0"), false);
+
+	CHECK_XPATH_BOOLEAN(c, STR("2 = true()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2 != true()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("2 = false()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("2 != false()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("0 = false()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("0 != false()"), false);
+}
+
+TEST(xpath_operators_equality_primitive_number)
+{
+	xml_node c;
+
+	// number vs number
+	CHECK_XPATH_BOOLEAN(c, STR("1 = 1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("0.5 = 0.5"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 != 2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 = -1"), false);
+
+	// infinity/nan
+	CHECK_XPATH_BOOLEAN(c, STR("1 div 0 = 2 div 0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("-1 div 0 != 2 div 0"), true);
+
+#ifndef MSVC6_NAN_BUG
+	CHECK_XPATH_BOOLEAN(c, STR("0 div 0 = 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("0 div 0 != 1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("0 div 0 = 0 div 0"), false);
+#endif
+
+	// upcast to number
+	CHECK_XPATH_BOOLEAN(c, STR("2 = '2'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2 != '2'"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("'1' != 2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("'1' = 2"), false);
+}
+
+TEST(xpath_operators_equality_primitive_string)
+{
+	xml_node c;
+
+	// string vs string
+	CHECK_XPATH_BOOLEAN(c, STR("'a' = 'a'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("'a' = 'b'"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("'ab' != 'a'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("'' != 'a'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("'a' != ''"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("'' != ''"), false);
+}
+
+TEST_XML(xpath_operators_equality_node_set_node_set, "<node><c1><v>a</v><v>b</v></c1><c2><v>a</v><v>c</v></c2><c3><v>b</v></c3><c4><v>d</v></c4><c5><v>a</v><v>b</v></c5><c6><v>b</v></c6></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// node set vs node set
+	CHECK_XPATH_BOOLEAN(c, STR("x = x"), false); // empty node set compares as false with any other object via any comparison operator, as per XPath spec
+	CHECK_XPATH_BOOLEAN(c, STR("x != x"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = c2/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = c3/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c2/v = c3/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = c4/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = x"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("x = c1"), false);
+
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v != c2/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v != c3/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c2/v != c3/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v != c4/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v != c5/v"), true); // (a, b) != (a, b), since a != b, as per XPath spec (comparison operators are so not intutive)
+	CHECK_XPATH_BOOLEAN(n, STR("c3/v != c6/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v != x"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("x != c1/v"), false);
+}
+
+TEST_XML(xpath_operators_equality_node_set_primitive, "<node><c1><v>1</v><v>-1</v><v>100</v></c1><c2><v>1</v><v>nan</v></c2></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// node set vs number
+	CHECK_XPATH_BOOLEAN(c, STR("x = 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("x != 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1 = x"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1 != x"), false);
+
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = 1"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = -1"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v != 1"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = 5"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c2/v = 1"), true);
+
+	CHECK_XPATH_BOOLEAN(n, STR("1 = c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("-1 = c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("1 != c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("5 = c1/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("1 = c2/v"), true);
+
+#ifndef MSVC6_NAN_BUG
+	CHECK_XPATH_BOOLEAN(n, STR("c2/v != 1"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("1 != c2/v"), true);
+#endif
+	
+	// node set vs string
+	CHECK_XPATH_BOOLEAN(c, STR("x = '1'"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("x != '1'"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("'1' = x"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("'1' != x"), false);
+
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = '1'"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = '-1'"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v != '1'"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = '5'"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c2/v = '1'"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c2/v != '1'"), true);
+
+	CHECK_XPATH_BOOLEAN(n, STR("'1' = c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("'-1' = c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("'1' != c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("'5' = c1/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("'1' = c2/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("'1' != c2/v"), true);
+
+	// node set vs almost-numeric string just in case
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = '1.0'"), false);
+
+	// node set vs boolean - special rules! empty sets are equal to true()
+	CHECK_XPATH_BOOLEAN(n, STR("x = true()"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("x != true()"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("x = false()"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = true()"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v != true()"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v = false()"), false);
+
+	CHECK_XPATH_BOOLEAN(n, STR("true() = x"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("true() != x"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("false() = x"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("true() = c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("true() != c1/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("false() = c1/v"), false);
+}
+
+TEST(xpath_operators_inequality_primitive)
+{
+	xml_node c;
+
+	// number vs number
+	CHECK_XPATH_BOOLEAN(c, STR("1 < 2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 <= 2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 > 2"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1 >= 2"), false);
+
+	CHECK_XPATH_BOOLEAN(c, STR("1 < 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1 <= 1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 > 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1 >= 1"), true);
+
+	// infinity/nan
+	CHECK_XPATH_BOOLEAN(c, STR("1 div 0 <= 2 div 0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 div 0 < 2 div 0"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("-1 div 0 < 2 div 0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("-1 div 0 > 2 div 0"), false);
+
+#ifndef MSVC6_NAN_BUG
+	CHECK_XPATH_BOOLEAN(c, STR("0 div 0 < 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("0 div 0 <= 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("0 div 0 > 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("0 div 0 >= 1"), false);
+#endif
+
+	// upcast to number
+	CHECK_XPATH_BOOLEAN(c, STR("2 < '2'"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1 < '2'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2 <= '2'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("3 <= '2'"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("2 > '2'"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("3 > '2'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2 >= '2'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("3 >= '2'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 >= true()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 > true()"), false);
+}
+
+TEST_XML(xpath_operators_inequality_node_set_node_set, "<node><c1><v>1</v><v>-1</v><v>-100</v></c1><c2><v>1</v><v>nan</v></c2><c3><v>1</v><v>-4</v></c3></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// node set vs node set
+	CHECK_XPATH_BOOLEAN(c, STR("x < x"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("x > x"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("x <= x"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("x >= x"), false);
+
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v > x"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v < x"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v >= x"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v <= x"), false);
+
+	CHECK_XPATH_BOOLEAN(n, STR("x > c1/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("x < c1/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("x >= c1/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("x <= c1/v"), false);
+
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v > c3/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v >= c3/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v < c3/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v <= c3/v"), true);
+
+#ifndef MSVC6_NAN_BUG
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v > c2/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v >= c2/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v < c2/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v <= c2/v"), true);
+#endif
+}
+
+TEST_XML(xpath_operators_inequality_node_set_primitive, "<node><c1><v>1</v><v>-1</v><v>-100</v></c1><c2><v>1</v><v>nan</v></c2></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// node set vs number
+	CHECK_XPATH_BOOLEAN(c, STR("x < 0"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("x > 0"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("x <= 0"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("x >= 0"), false);
+
+	CHECK_XPATH_BOOLEAN(c, STR("0 < x"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("0 > x"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("0 <= x"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("0 >= x"), false);
+
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v > 0"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v > 1"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v >= 0"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v < 0"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v <= 0"), true);
+
+	CHECK_XPATH_BOOLEAN(n, STR("0 < c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("1 < c1/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("0 <= c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("0 > c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("0 >= c1/v"), true);
+
+	// node set vs string
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v > '0'"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v > '1'"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v >= '0'"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v < '0'"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v <= '0'"), true);
+
+	CHECK_XPATH_BOOLEAN(n, STR("'0' < c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("'1' < c1/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("'0' <= c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("'0' > c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("'0' >= c1/v"), true);
+
+	// node set vs boolean
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v > false()"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v > true()"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v >= false()"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v < false()"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("c1/v <= false()"), true);
+
+	CHECK_XPATH_BOOLEAN(n, STR("false() < c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("true() < c1/v"), false);
+	CHECK_XPATH_BOOLEAN(n, STR("false() <= c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("false() > c1/v"), true);
+	CHECK_XPATH_BOOLEAN(n, STR("false() >= c1/v"), true);
+}
+
+TEST(xpath_operators_boolean_precedence)
+{
+	xml_node c;
+
+	CHECK_XPATH_BOOLEAN(c, STR("1 = 0 or 2 = 2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 = (0 or 2) = false()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1 < 0 or 2 > 2"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("2 < 1 = false()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2 < (1 = false())"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("3 > 2 > 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("(3 > 2) > 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("3 > (2 > 1)"), true);
+}
+
+TEST_XML(xpath_operators_union, "<node><employee/><employee secretary=''/><employee assistant=''/><employee secretary='' assistant=''/><employee assistant='' secretary=''/><tail/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(n, STR("employee | .")) % 2 % 3 % 4 % 6 % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR("employee[@secretary] | employee[@assistant]")) % 4 % 6 % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR("employee[@assistant] | employee[@secretary]")) % 4 % 6 % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR("employee[@secretary] | employee[@nobody]")) % 4 % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR("employee[@nobody] | employee[@secretary]")) % 4 % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR("tail/preceding-sibling::employee | .")) % 2 % 3 % 4 % 6 % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR(". | tail/preceding-sibling::employee | .")) % 2 % 3 % 4 % 6 % 8 % 11;
+}
+
+TEST(xpath_operators_union_error)
+{
+	CHECK_XPATH_FAIL(STR(". | true()"));
+	CHECK_XPATH_FAIL(STR(". | 1"));
+	CHECK_XPATH_FAIL(STR(". | '1'"));
+	CHECK_XPATH_FAIL(STR(". | count(.)"));
+	CHECK_XPATH_FAIL(STR("true() | ."));
+	CHECK_XPATH_FAIL(STR("1 | ."));
+	CHECK_XPATH_FAIL(STR("'1' | ."));
+	CHECK_XPATH_FAIL(STR("count(.) | ."));
+}
+
+TEST_XML(xpath_operators_union_minus, "<node1>3</node1><node2>4</node2>")
+{
+	CHECK_XPATH_FAIL(STR("(-node1) | node2"));
+	CHECK_XPATH_FAIL(STR("node1 | -node2"));
+	CHECK_XPATH_NUMBER(doc, STR("-(node1 | node2)"), -3);
+	CHECK_XPATH_NUMBER(doc, STR("-node1 | node2"), -3);
+	CHECK_XPATH_NUMBER(doc, STR("--node1 | node2"), 3);
+	CHECK_XPATH_NUMBER(doc, STR("-(-node1 | node2)"), 3);
+	CHECK_XPATH_NUMBER(doc, STR("--(-node1 | node2)"), -3);
+}
+
+TEST(xpath_operators_associativity_boolean)
+{
+	xml_node c;
+
+	CHECK_XPATH_BOOLEAN(c, STR("false() or true() and true() and false()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("3 > 2 > 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("4 > 3 > 2 > 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("5 > 4 > 3 > 2 > 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1 < 2 < 3 < 4 < 5"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 <= 2 <= 3 <= 4 <= 5"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("5 >= 4 >= 3 >= 2 >= 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("3 >= 2 >= 1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2 >= 1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("4 >= 3 >= 2 >= 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("((((5 > 4) > 3) > 2) > 1)"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("2 != 3 != 1 != 4 != 0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("(((2 != 3) != 1) != 4) != 0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2 != 3 != 1 != 4 != 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("(((2 != 3) != 1) != 4) != 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("2 = 3 = 1 = 4 = 0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("(((2 = 3) = 1) = 4) = 0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2 = 3 = 1 = 4 = 1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("(((2 = 3) = 1) = 4) = 1"), false);
+}
+
+TEST(xpath_operators_associativity_arithmetic)
+{
+	xml_node c;
+
+	CHECK_XPATH_NUMBER(c, STR("2+1-1+1"), 3);
+	CHECK_XPATH_NUMBER(c, STR("1+2+1-1+1"), 4);
+	CHECK_XPATH_NUMBER(c, STR("1+1+2+1-1+1"), 5);
+	CHECK_XPATH_NUMBER(c, STR("1-1+1"), 1);
+}
+
+TEST(xpath_operators_mod)
+{
+	// Check that mod operator conforms to Java spec (since this is the only concrete source of information about XPath mod)
+	xml_node c;
+
+	// Basic tests from spec
+	CHECK_XPATH_NUMBER(c, STR("5 mod 3"), 2);
+	CHECK_XPATH_NUMBER(c, STR("5 mod -3"), 2);
+	CHECK_XPATH_NUMBER(c, STR("-5 mod 3"), -2);
+	CHECK_XPATH_NUMBER(c, STR("-5 mod -3"), -2);
+
+#if !defined(__BORLANDC__)
+	// If either operand is NaN, the result is NaN
+	CHECK_XPATH_NUMBER_NAN(c, STR("(0 div 0) mod 3"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("3 mod (0 div 0)"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("(0 div 0) mod (0 div 0)"));
+
+	// If the dividend is an infinity, or the divisor is a zero, or both, the result is NaN
+	CHECK_XPATH_NUMBER_NAN(c, STR("(1 div 0) mod 3"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("(1 div 0) mod -3"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("(-1 div 0) mod 3"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("1 mod 0"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("-1 mod 0"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("(1 div 0) mod 0"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("(-1 div 0) mod 0"));
+#endif
+
+	// If the dividend is finite and the divisor is an infinity, the result equals the dividend
+#if !defined(_MSC_VER) && !defined(__MINGW32__)
+	CHECK_XPATH_NUMBER(c, STR("1 mod (1 div 0)"), 1);
+	CHECK_XPATH_NUMBER(c, STR("1 mod (-1 div 0)"), 1);
+	CHECK_XPATH_NUMBER(c, STR("-1 mod (1 div 0)"), -1);
+	CHECK_XPATH_NUMBER(c, STR("0 mod (1 div 0)"), 0);
+	CHECK_XPATH_NUMBER(c, STR("0 mod (-1 div 0)"), 0);
+	CHECK_XPATH_NUMBER(c, STR("100000 mod (1 div 0)"), 100000);
+#endif
+
+	// If the dividend is a zero and the divisor is finite, the result equals the dividend.
+	CHECK_XPATH_NUMBER(c, STR("0 mod 1000000"), 0);
+	CHECK_XPATH_NUMBER(c, STR("0 mod -1000000"), 0);
+
+	// In the remaining cases ... the floating-point remainder r from the division of a dividend n by a divisor d
+	// is defined by the mathematical relation r = n - (d * q) where q is an integer that is negative only if n/d is
+	// negative and positive only if n/d is positive, and whose magnitude is as large as possible without exceeding the magnitude of the true
+	// mathematical quotient of n and d.
+	CHECK_XPATH_NUMBER(c, STR("9007199254740991 mod 2"), 1);
+	CHECK_XPATH_NUMBER(c, STR("9007199254740991 mod 3"), 1);
+	CHECK_XPATH_NUMBER(c, STR("18446744073709551615 mod 2"), 0);
+	CHECK_XPATH_NUMBER(c, STR("18446744073709551615 mod 3"), 1);
+	CHECK_XPATH_NUMBER(c, STR("115792089237316195423570985008687907853269984665640564039457584007913129639935 mod 2"), 0);
+	CHECK_XPATH_NUMBER(c, STR("115792089237316195423570985008687907853269984665640564039457584007913129639935 mod 3"), 1);
+}
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_parse.cpp Added

@@ -0,0 +1,316 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+#include <string>
+
+TEST(xpath_literal_parse)
+{
+	xml_node c;
+	CHECK_XPATH_STRING(c, STR("'a\"b'"), STR("a\"b"));
+	CHECK_XPATH_STRING(c, STR("\"a'b\""), STR("a'b"));
+	CHECK_XPATH_STRING(c, STR("\"\""), STR(""));
+	CHECK_XPATH_STRING(c, STR("\'\'"), STR(""));
+}
+
+TEST(xpath_literal_error)
+{
+	CHECK_XPATH_FAIL(STR("\""));
+	CHECK_XPATH_FAIL(STR("\"foo"));
+	CHECK_XPATH_FAIL(STR("\'"));
+	CHECK_XPATH_FAIL(STR("\'bar"));
+}
+
+TEST(xpath_number_parse)
+{
+	xml_node c;
+	CHECK_XPATH_NUMBER(c, STR("0"), 0);
+	CHECK_XPATH_NUMBER(c, STR("123"), 123);
+	CHECK_XPATH_NUMBER(c, STR("123.456"), 123.456);
+	CHECK_XPATH_NUMBER(c, STR(".123"), 0.123);
+	CHECK_XPATH_NUMBER(c, STR("123.4567890123456789012345"), 123.4567890123456789012345);
+	CHECK_XPATH_NUMBER(c, STR("123."), 123);
+}
+
+TEST(xpath_number_error)
+{
+	CHECK_XPATH_FAIL(STR("123a"));
+	CHECK_XPATH_FAIL(STR("123.a"));
+	CHECK_XPATH_FAIL(STR(".123a"));
+}
+
+TEST(xpath_variables)
+{
+	CHECK_XPATH_FAIL(STR("$var")); // no variable var
+	CHECK_XPATH_FAIL(STR("$1"));
+	CHECK_XPATH_FAIL(STR("$"));
+}
+
+TEST(xpath_empty_expression)
+{
+	CHECK_XPATH_FAIL(STR(""));
+}
+
+TEST(xpath_lexer_error)
+{
+	CHECK_XPATH_FAIL(STR("!"));
+	CHECK_XPATH_FAIL(STR("&"));
+}
+
+TEST(xpath_unmatched_braces)
+{
+	CHECK_XPATH_FAIL(STR("node["));
+	CHECK_XPATH_FAIL(STR("node[1"));
+	CHECK_XPATH_FAIL(STR("node[]]"));
+	CHECK_XPATH_FAIL(STR("node("));
+	CHECK_XPATH_FAIL(STR("node(()"));
+	CHECK_XPATH_FAIL(STR("(node)[1"));
+	CHECK_XPATH_FAIL(STR("(1"));
+}
+
+TEST(xpath_incorrect_step)
+{
+	CHECK_XPATH_FAIL(STR("child::1"));
+	CHECK_XPATH_FAIL(STR("something::*"));
+	CHECK_XPATH_FAIL(STR("a::*"));
+	CHECK_XPATH_FAIL(STR("c::*"));
+	CHECK_XPATH_FAIL(STR("d::*"));
+	CHECK_XPATH_FAIL(STR("f::*"));
+	CHECK_XPATH_FAIL(STR("n::*"));
+	CHECK_XPATH_FAIL(STR("p::*"));
+}
+
+TEST(xpath_semantics_error)
+{
+	CHECK_XPATH_FAIL(STR("1[1]"));
+	CHECK_XPATH_FAIL(STR("1 | 1"));
+}
+
+TEST(xpath_semantics_posinv) // coverage for contains()
+{
+	xpath_query(STR("(node)[substring(1, 2, 3)]"));
+	xpath_query(STR("(node)[concat(1, 2, 3, 4)]"));
+	xpath_query(STR("(node)[count(foo)]"));
+	xpath_query(STR("(node)[local-name()]"));
+	xpath_query(STR("(node)[(node)[1]]"));
+}
+
+TEST(xpath_parse_paths_valid)
+{
+ const char_t* paths[] =
+	{
+		// From Jaxen tests
+		STR("foo[.='bar']"), STR("foo[.!='bar']"), STR("/"), STR("*"), STR("//foo"), STR("/*"), STR("/."), STR("/foo[/bar[/baz]]"),
+		STR("/foo/bar/baz[(1 or 2) + 3 * 4 + 8 and 9]"), STR("/foo/bar/baz"), STR("(.)[1]"), STR("self::node()"), STR("."), STR("count(/)"),
+		STR("foo[1]"), STR("/baz[(1 or 2) + 3 * 4 + 8 and 9]"), STR("foo/bar[/baz[(1 or 2) - 3 mod 4 + 8 and 9 div 8]]"),
+		STR("foo/bar/yeah:baz[a/b/c and toast]"), STR("/foo/bar[../x='123']"), STR("/foo[@bar='1234']"), STR("foo|bar"),
+		STR("/foo|/bar[@id='1234']"), STR("count(//author/attribute::*)"), STR("/child::node()/child::node()[@id='_13563275']"),
+		STR("10 + (count(descendant::author) * 5)"), STR("10 + count(descendant::author) * 5"), STR("2 + (2 * 5)"), STR("//foo:bar"),
+		STR("count(//author)+5"), STR("count(//author)+count(//author/attribute::*)"), STR("/foo/bar[@a='1' and @c!='2']"),
+		STR("12 + (count(//author)+count(//author/attribute::*)) div 2"), STR("text()[.='foo']"), STR("/*/*[@id='123']")
+ STR("/foo/bar[@a='1' and @b='2']"), STR("/foo/bar[@a='1' and @b!='2']"), STR("//attribute::*[.!='crunchy']"),
+ STR("'//*[contains(string(text()),\"yada yada\")]'"),
+
+		// From ajaxslt tests
+		STR("@*"), STR("@*|node()"), STR("/descendant-or-self::div"), STR("/div"), STR("//div"), STR("/descendant-or-self::node()/child::para"),
+		STR("substring('12345', 0, 3)"), STR("//title | //link"), STR("x//title"), STR("x/title"), STR("id('a')//title"), STR("//*[@about]"),
+		STR("count(descendant::*)"), STR("count(descendant::*) + count(ancestor::*)"), STR("@*|text()"), STR("*|/"), STR("source|destination"),
+		STR("page != 'to' and page != 'from'"), STR("substring-after(icon/@image, '/mapfiles/marker')"), STR("substring-before(str, c)"), STR("page = 'from'"),
+		STR("segments/@time"), STR("child::para"), STR("child::*"), STR("child::text()"), STR("child::node()"), STR("attribute::name"), STR("attribute::*"),
+		STR("descendant::para"), STR("ancestor::div"), STR("ancestor-or-self::div"), STR("descendant-or-self::para"), STR("self::para"), STR("child::*/child::para"),
+		STR("concat(substring-before(@image,'marker'),'icon',substring-after(@image,'marker'))"), STR("/"), STR("/descendant::para"), STR("/descendant::olist/child::item"),
+		STR("child::para[position()=1]"), STR("child::para[position()=last()]"), STR("child::para[position()=last()-1]"), STR("child::para[position()>1]"),
+		STR("following-sibling::chapter[position()=1]"), STR("preceding-sibling::chapter[position()=1]"), STR("/descendant::figure[position()=42]"),
+		STR("/child::doc/child::chapter[position()=5]/child::section[position()=2]"), STR("child::chapter/descendant::para"), STR("child::para[attribute::type='warning']"),
+		STR("child::para[attribute::type='warning'][position()=5]"), STR("child::para[position()=5][attribute::type='warning']"), STR("child::chapter[child::title='Introduction']"),
+		STR("child::chapter[child::title]"), STR("child::*[self::chapter or self::appendix]"), STR("child::*[self::chapter or self::appendix][position()=last()]"),
+		STR("count(//*[id='u1']|//*[id='u2'])"), STR("count(//*[id='u1']|//*[class='u'])"), STR("count(//*[class='u']|//*[class='u'])"), STR("count(//*[class='u']|//*[id='u1'])"),
+		STR("count(//*[@id='self']/ancestor-or-self::*)"), STR("count(//*[@id='self']/ancestor::*)"), STR("count(//*[@id='self']/attribute::*)"), STR("count(//*[@id='self']/child::*)"),
+		STR("count(//*[@id='self']/descendant-or-self::*)"), STR("count(//*[@id='self']/descendant::*)"), STR("count(//*[@id='self']/following-sibling::*)"),
+		STR("count(//*[@id='self']/following::*)"), STR("//*[@id='self']/parent::*/@id"), STR("count(//*[@id='self']/preceding-sibling::*)"),
+		STR("count(//*[@id='self']/preceding::*)"), STR("//*[@id='self']/self::*/@id"), STR("id('nested1')/div[1]//input[2]"), STR("id('foo')//div[contains(@id, 'useful')]//input"),
+		STR("(//table[@class='stylee'])//th[text()='theHeaderText']/../td"), STR("address"), STR("address=string(/page/user/defaultlocation)"), STR("count-of-snippet-of-url = 0"),
+		STR("daddr"), STR("form"), STR("form = 'from'"), STR("form = 'to'"), STR("form='near'"), STR("home"), STR("i"), STR("i > page and i < page + range"),
+		STR("i < page and i >= page - range"), STR("i < @max"), STR("i <= page"), STR("i + 1"), STR("i = page"), STR("i = 1"), STR("info = position() or (not(info) and position() = 1)"),
+		STR("is-first-order"), STR("is-first-order and snippets-exist"), STR("more"), STR("more > 0"), STR("near-point"), STR("page"), STR("page != 'from'"), STR("page != 'to'"),
+		STR("page != 'to' and page != 'from'"), STR("page > 1"), STR("page = 'basics'"), STR("page = 'details'"), STR("page = 'from'"), STR("page = 'to'"), STR("page='from'"),
+		STR("page='to'"), STR("r >= 0.5"), STR("r >= 1"), STR("r - 0"), STR("r - 1"), STR("r - 2"), STR("r - 3"), STR("r - 4"), STR("saddr"), STR("sources"), STR("sources[position() < details]"),
+		STR("src"), STR("str"), STR("\"'\""), STR("(//location[string(info/references/reference[1]/url)=string(current-url)]/info/references/reference[1])[1]"),
+		STR("(not(count-of-snippet-of-url = 0) and (position() = 1) or not(current-url = //locations/location[position() = last-pos]//reference[1]/url))"),
+		STR("(not(info) and position() = 1) or info = position()"), STR("."), STR("../@arg0"), STR("../@filterpng"), STR("/page/@filterpng"), STR("4"), STR("@attribution"),
+		STR("@id"), STR("@max > @num"), STR("@meters > 16093"), STR("@name"), STR("@start div @num + 1"), STR("@url"), STR("ad"), STR("address/line"), STR("adsmessage"),
+		STR("attr"), STR("boolean(location[@id='near'][icon/@image])"), STR("bubble/node()"), STR("calltoaction/node()"), STR("category"), STR("contains(str, c)"),
+		STR("count(//location[string(info/references/reference[1]/url)=string(current-url)]//snippet)"), STR("count(//snippet)"), STR("count(attr)"), STR("count(location)"),
+		STR("count(structured/source) > 1"), STR("description/node()"), STR("destination"), STR("destinationAddress"), STR("domain"), STR("false()"), STR("icon/@class != 'noicon'"),
+		STR("icon/@image"), STR("info"), STR("info/address/line"), STR("info/distance"), STR("info/distance and near-point"), STR("info/distance and info/phone and near-point"),
+		STR("info/distance or info/phone"), STR("info/panel/node()"), STR("info/phone"), STR("info/references/reference[1]"), STR("info/references/reference[1]/snippet"),
+		STR("info/references/reference[1]/url"), STR("info/title"), STR("info/title/node()"), STR("line"), STR("location"), STR("location[@id!='near']"), STR("location[@id='near'][icon/@image]"),
+		STR("location[position() > umlocations div 2]"), STR("location[position() <= numlocations div 2]"), STR("locations"), STR("locations/location"), STR("near"), STR("node()"),
+		STR("not(count-of-snippets = 0)"), STR("not(form = 'from')"), STR("not(form = 'near')"), STR("not(form = 'to')"), STR("not(../@page)"), STR("not(structured/source)"), STR("notice"),
+		STR("number(../@info)"), STR("number(../@items)"), STR("number(/page/@linewidth)"), STR("page/ads"), STR("page/directions"), STR("page/error"), STR("page/overlay"),
+		STR("page/overlay/locations/location"), STR("page/refinements"), STR("page/request/canonicalnear"), STR("page/request/near"), STR("page/request/query"), STR("page/spelling/suggestion"),
+		STR("page/user/defaultlocation"), STR("phone"), STR("position()"), STR("position() != 1"), STR("position() != last()"), STR("position() > 1"), STR("position() < details"),
+		STR("position()-1"), STR("query"), STR("references/@total"), STR("references/reference"), STR("references/reference/domain"), STR("references/reference/url"),
+		STR("reviews/@positive div (reviews/@positive + reviews/@negative) * 5"), STR("reviews/@positive div (reviews/@positive + reviews/@negative) * (5)"), STR("reviews/@total"),
+		STR("reviews/@total > 1"), STR("reviews/@total > 5"), STR("reviews/@total = 1"), STR("segments/@distance"), STR("segments/@time"), STR("segments/segment"), STR("shorttitle/node()"),
+		STR("snippet"), STR("snippet/node()"), STR("source"), STR("sourceAddress"), STR("sourceAddress and destinationAddress"), STR("string(../@daddr)"), STR("string(../@form)"),
+		STR("string(../@page)"), STR("string(../@saddr)"), STR("string(info/title)"), STR("string(page/request/canonicalnear) != ''"), STR("string(page/request/near) != ''"),
+		STR("string-length(address) > linewidth"), STR("structured/@total - details"), STR("structured/source"), STR("structured/source[@name]"), STR("substring(address, 1, linewidth - 3)"),
+		STR("substring-after(str, c)"), STR("substring-after(icon/@image, '/mapfiles/marker')"), STR("substring-before(str, c)"), STR("tagline/node()"), STR("targetedlocation"),
+		STR("title"), STR("title/node()"), STR("true()"), STR("url"), STR("visibleurl"), STR("id(\"level10\")/ancestor::SPAN"), STR("id(\"level10\")/ancestor-or-self::SPAN"), STR("//attribute::*"),
+ STR("child::HTML/child::BODY/child::H1"), STR("descendant::node()"), STR("descendant-or-self::SPAN"), STR("id(\"first\")/following::text()"), STR("id(\"first\")/following-sibling::node()"),
+ STR("id(\"level10\")/parent::node()"), STR("id(\"last\")/preceding::text()"), STR("id(\"last\")/preceding-sibling::node()"), STR("/HTML/BODY/H1/self::node()"), STR("//*[@name]"),
+ STR("id(\"pet\")/SELECT[@name=\"species\"]/OPTION[@selected]/@value"), STR("descendant::INPUT[@name=\"name\"]/@value"), STR("id(\"pet\")/INPUT[@name=\"gender\" and @checked]/@value"),
+ STR("//TEXTAREA[@name=\"description\"]/text()"), STR("id(\"div1\")|id(\"div2\")|id(\"div3 div4 div5\")"), STR("//LI[1]"), STR("//LI[last()]/text()"), STR("//LI[position() mod 2]/@class"),
+ STR("//text()[.=\"foo\"]"), STR("descendant-or-self::SPAN[position() > 2]"), STR("descendant::*[contains(@class,\" fruit \")]"),
+
+		// ajaxslt considers this path invalid, however I believe it's valid as per spec
+		STR("***"),
+
+		// Oasis MSFT considers this path invalid, however I believe it's valid as per spec
+		STR("**..**"),
+
+		// Miscellaneous
+		STR("..***..***.***.***..***..***..")
+ };
+
+	for (size_t i = 0; i < sizeof(paths) / sizeof(paths[0]); ++i)
+	{
+		xpath_query q(paths[i]);
+	}
+}
+
+#if defined(PUGIXML_WCHAR_MODE) || !defined(PUGIXML_NO_STL)
+TEST(xpath_parse_paths_valid_unicode)
+{
+ // From ajaxslt
+	const wchar_t* paths[] =
+	{
+	#ifdef U_LITERALS
+		L"/descendant-or-self::\u90e8\u5206", L"//\u90e8\u5206", L"substring('\uff11\uff12\uff13\uff14\uff15', 0, 3)", L"//\u30bf\u30a4\u30c8\u30eb | //\u30ea\u30f3\u30af",
+		L"\u8b0e//\u30bf\u30a4\u30c8\u30eb", L"//*[@\u30c7\u30b9\u30c6\u30a3\u30cd\u30a4\u30b7\u30e7\u30f3]", L"\u30da\u30fc\u30b8 = '\u304b\u3089'",
+		L"concat(substring-before(@\u30a4\u30e1\u30fc\u30b8,'\u76ee\u5370'),'\u30a2\u30a4\u30b3\u30f3',substring-after(@\u30a4\u30e1\u30fc\u30b8,'\u76ee\u5370'))",
+		L"\u30bd\u30fc\u30b9|\u30c7\u30b9\u30c6\u30a3\u30cd\u30a4\u30b7\u30e7\u30f3", L"\u30da\u30fc\u30b8 != '\u307e\u3067' and \u30da\u30fc\u30b8 != '\u304b\u3089'",
+		L"substring-after(\u30a2\u30a4\u30b3\u30f3/@\u30a4\u30e1\u30fc\u30b8, '/\u5730\u56f3\u30d5\u30a1\u30a4\u30eb/\u76ee\u5370')", L"child::\u6bb5\u843d",
+		L"substring-before(\u6587\u5b57\u5217, \u6587\u5b57)", L"\u30bb\u30b0\u30e1\u30f3\u30c8/@\u6642\u523b", L"attribute::\u540d\u524d", L"descendant::\u6bb5\u843d",
+		L"ancestor::\u90e8\u5206", L"ancestor-or-self::\u90e8\u5206", L"descendant-or-self::\u6bb5\u843d", L"self::\u6bb5\u843d", L"child::\u7ae0/descendant::\u6bb5\u843d",
+		L"child::*/child::\u6bb5\u843d", L"/descendant::\u6bb5\u843d", L"/descendant::\u9806\u5e8f\u30ea\u30b9\u30c8/child::\u9805\u76ee", L"child::\u6bb5\u843d[position()=1]",
+		L"child::\u6bb5\u843d[position()=last()]", L"child::\u6bb5\u843d[position()=last()-1]", L"child::\u6bb5\u843d[position()>1]", L"following-sibling::\u7ae0[position()=1]",
+		L"preceding-sibling::\u7ae0[position()=1]", L"/descendant::\u56f3\u8868[position()=42]", L"/child::\u6587\u66f8/child::\u7ae0[position()=5]/child::\u7bc0[position()=2]",
+		L"child::\u6bb5\u843d[attribute::\u30bf\u30a4\u30d7='\u8b66\u544a']", L"child::\u6bb5\u843d[attribute::\u30bf\u30a4\u30d7='\u8b66\u544a'][position()=5]",
+		L"child::\u6bb5\u843d[position()=5][attribute::\u30bf\u30a4\u30d7='\u8b66\u544a']", L"child::\u7ae0[child::\u30bf\u30a4\u30c8\u30eb='\u306f\u3058\u3081\u306b']",
+		L"child::\u7ae0[child::\u30bf\u30a4\u30c8\u30eb]", L"child::*[self::\u7ae0 or self::\u4ed8\u9332]", L"child::*[self::\u7ae0 or self::\u4ed8\u9332][position()=last()]",
+	#else
+		L"/descendant-or-self::\x90e8\x5206", L"//\x90e8\x5206", L"substring('\xff11\xff12\xff13\xff14\xff15', 0, 3)", L"//\x30bf\x30a4\x30c8\x30eb | //\x30ea\x30f3\x30af",
+		L"\x8b0e//\x30bf\x30a4\x30c8\x30eb", L"//*[@\x30c7\x30b9\x30c6\x30a3\x30cd\x30a4\x30b7\x30e7\x30f3]", L"\x30da\x30fc\x30b8 = '\x304b\x3089'",
+		L"concat(substring-before(@\x30a4\x30e1\x30fc\x30b8,'\x76ee\x5370'),'\x30a2\x30a4\x30b3\x30f3',substring-after(@\x30a4\x30e1\x30fc\x30b8,'\x76ee\x5370'))",
+		L"\x30bd\x30fc\x30b9|\x30c7\x30b9\x30c6\x30a3\x30cd\x30a4\x30b7\x30e7\x30f3", L"\x30da\x30fc\x30b8 != '\x307e\x3067' and \x30da\x30fc\x30b8 != '\x304b\x3089'",
+		L"substring-after(\x30a2\x30a4\x30b3\x30f3/@\x30a4\x30e1\x30fc\x30b8, '/\x5730\x56f3\x30d5\x30a1\x30a4\x30eb/\x76ee\x5370')", L"child::\x6bb5\x843d",
+		L"substring-before(\x6587\x5b57\x5217, \x6587\x5b57)", L"\x30bb\x30b0\x30e1\x30f3\x30c8/@\x6642\x523b", L"attribute::\x540d\x524d", L"descendant::\x6bb5\x843d",
+		L"ancestor::\x90e8\x5206", L"ancestor-or-self::\x90e8\x5206", L"descendant-or-self::\x6bb5\x843d", L"self::\x6bb5\x843d", L"child::\x7ae0/descendant::\x6bb5\x843d",
+		L"child::*/child::\x6bb5\x843d", L"/descendant::\x6bb5\x843d", L"/descendant::\x9806\x5e8f\x30ea\x30b9\x30c8/child::\x9805\x76ee", L"child::\x6bb5\x843d[position()=1]",
+		L"child::\x6bb5\x843d[position()=last()]", L"child::\x6bb5\x843d[position()=last()-1]", L"child::\x6bb5\x843d[position()>1]", L"following-sibling::\x7ae0[position()=1]",
+		L"preceding-sibling::\x7ae0[position()=1]", L"/descendant::\x56f3\x8868[position()=42]", L"/child::\x6587\x66f8/child::\x7ae0[position()=5]/child::\x7bc0[position()=2]",
+		L"child::\x6bb5\x843d[attribute::\x30bf\x30a4\x30d7='\x8b66\x544a']", L"child::\x6bb5\x843d[attribute::\x30bf\x30a4\x30d7='\x8b66\x544a'][position()=5]",
+		L"child::\x6bb5\x843d[position()=5][attribute::\x30bf\x30a4\x30d7='\x8b66\x544a']", L"child::\x7ae0[child::\x30bf\x30a4\x30c8\x30eb='\x306f\x3058\x3081\x306b']",
+		L"child::\x7ae0[child::\x30bf\x30a4\x30c8\x30eb]", L"child::*[self::\x7ae0 or self::\x4ed8\x9332]", L"child::*[self::\x7ae0 or self::\x4ed8\x9332][position()=last()]",
+	#endif
+	};
+
+	for (size_t i = 0; i < sizeof(paths) / sizeof(paths[0]); ++i)
+	{
+	#if defined(PUGIXML_WCHAR_MODE)
+		xpath_query q(paths[i]);
+	#elif !defined(PUGIXML_NO_STL)
+		std::basic_string<char> path_utf8 = pugi::as_utf8(paths[i]);
+		xpath_query q(path_utf8.c_str());
+	#endif
+	}
+}
+#endif
+
+TEST(xpath_parse_invalid)
+{
+ const char_t* paths[] =
+	{
+		// From Jaxen tests
+		STR("//:p"), STR("/foo/bar/"), STR("12 + (count(//author)+count(//author/attribute::*)) / 2"), STR("id()/2"), STR("+"),
+		STR("///triple slash"), STR("/numbers numbers"), STR("/a/b[c > d]efg"), STR("/inv/child::"), STR("/invoice/@test[abcd"),
+		STR("/invoice/@test[abcd > x"), STR("string-length('a"), STR("/descendant::()"), STR("(1 + 1"), STR("!false()"),
+		STR("$author"), STR("10 + $foo"), STR("$foo:bar"), STR("$varname[@a='1']"), STR("foo/$variable/foo"),
+		STR(".[1]"), STR("chyld::foo"), STR("foo/tacos()"), STR("foo/tacos()"), STR("/foo/bar[baz"), STR("//"), STR("*:foo"),
+ STR("/cracker/cheese[(mold > 1) and (sense/taste"),
+
+		// From xpath-as3 tests
+		STR("a b"), STR("//self::node())"), STR("/x/y[contains(self::node())"), STR("/x/y[contains(self::node()]"), STR("///"), STR("text::a"),
+
+		// From haXe-xpath tests
+		STR("|/gjs"), STR("+3"), STR("/html/body/p != ---'div'/a"), STR(""), STR("@"), STR("#akf"), STR(",")
+
+		// Miscellaneous
+		STR("..."), STR("...."), STR("**"), STR("****"), STR("******"), STR("..***..***.***.***..***..***..*"), STR("/[1]")
+	};
+
+	for (size_t i = 0; i < sizeof(paths) / sizeof(paths[0]); ++i)
+	{
+		CHECK_XPATH_FAIL(paths[i]);
+	}
+}
+
+TEST_XML(xpath_parse_absolute, "<div><s/></div>")
+{
+	CHECK_XPATH_NODESET(doc, STR("/")) % 1;
+
+	CHECK_XPATH_NODESET(doc, STR("/div/s")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("/ div /s")) % 3;
+	CHECK_XPATH_FAIL(STR("/ div 5"));
+
+	CHECK_XPATH_NODESET(doc, STR("/*/s")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("/ * /s")) % 3;
+	CHECK_XPATH_FAIL(STR("/ * 5"));
+
+	CHECK_XPATH_NODESET(doc, STR("/*[/]")) % 2;
+}
+
+TEST(xpath_parse_out_of_memory_first_page)
+{
+	test_runner::_memory_fail_threshold = 1;
+
+	CHECK_ALLOC_FAIL(CHECK_XPATH_FAIL(STR("1")));
+}
+
+TEST(xpath_parse_out_of_memory_second_page_node)
+{
+	test_runner::_memory_fail_threshold = 8192;
+
+	CHECK_ALLOC_FAIL(CHECK_XPATH_FAIL(STR("1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1")));
+}
+
+TEST(xpath_parse_out_of_memory_string_to_number)
+{
+	test_runner::_memory_fail_threshold = 4096 + 128;
+
+	CHECK_ALLOC_FAIL(CHECK_XPATH_FAIL(STR("0.11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111")));
+}
+
+TEST(xpath_parse_qname_error)
+{
+	CHECK_XPATH_FAIL(STR("foo: bar"));
+	CHECK_XPATH_FAIL(STR("foo :bar"));
+	CHECK_XPATH_FAIL(STR("foo: *"));
+	CHECK_XPATH_FAIL(STR("foo :*"));
+	CHECK_XPATH_FAIL(STR(":*"));
+	CHECK_XPATH_FAIL(STR(":bar"));
+	CHECK_XPATH_FAIL(STR(":"));
+}
+
+TEST(xpath_parse_result_default)
+{
+	xpath_parse_result result;
+
+	CHECK(!result);
+	CHECK(result.error != 0);
+	CHECK(result.offset == 0);
+}
+
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_paths.cpp Added

@@ -0,0 +1,699 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+TEST_XML(xpath_paths_axes_child, "<node attr='value'><child attr='value'><subchild/></child><another/><last/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.attribute(STR("attr")), n);
+
+	CHECK_XPATH_NODESET(c, STR("child:: node()"));
+
+	CHECK_XPATH_NODESET(n, STR("child:: node()")) % 4 % 7 % 8; // child, another, last
+	CHECK_XPATH_NODESET(n, STR("another/child:: node()"));
+
+	CHECK_XPATH_NODESET(n, STR("@attr/child::node()"));
+	CHECK_XPATH_NODESET(na, STR("child::node()"));
+}
+
+TEST_XML(xpath_paths_axes_descendant, "<node attr='value'><child attr='value'><subchild/></child><another><subchild/></another><last/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.attribute(STR("attr")), n);
+
+	CHECK_XPATH_NODESET(c, STR("descendant:: node()"));
+
+	CHECK_XPATH_NODESET(n, STR("descendant:: node()")) % 4 % 6 % 7 % 8 % 9; // child, subchild, another, subchild, last
+	CHECK_XPATH_NODESET(doc, STR("descendant:: node()")) % 2 % 4 % 6 % 7 % 8 % 9; // node, child, subchild, another, subchild, last
+	CHECK_XPATH_NODESET(n, STR("another/descendant:: node()")) % 8; // subchild
+	CHECK_XPATH_NODESET(n, STR("last/descendant:: node()"));
+
+	CHECK_XPATH_NODESET(n, STR("@attr/descendant::node()"));
+	CHECK_XPATH_NODESET(na, STR("descendant::node()"));
+}
+
+TEST_XML(xpath_paths_axes_parent, "<node attr='value'><child attr='value'><subchild/></child><another><subchild/></another><last/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.attribute(STR("attr")), n);
+
+	CHECK_XPATH_NODESET(c, STR("parent:: node()"));
+
+	CHECK_XPATH_NODESET(n.child(STR("child")), STR("parent:: node()")) % 2; // node
+	CHECK_XPATH_NODESET(n, STR("child/subchild/parent:: node()")) % 4; // child
+	CHECK_XPATH_NODESET(n, STR("@attr/parent:: node()")) % 2; // node
+	CHECK_XPATH_NODESET(n, STR("parent:: node()")) % 1; // root
+	CHECK_XPATH_NODESET(doc, STR("parent:: node()"));
+
+	CHECK_XPATH_NODESET(na, STR("parent:: node()")) % 2; // node
+}
+
+TEST_XML(xpath_paths_axes_ancestor, "<node attr='value'><child attr='value'><subchild/></child><another><subchild/></another><last/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.child(STR("child")).attribute(STR("attr")), n.child(STR("child")));
+
+	CHECK_XPATH_NODESET(c, STR("ancestor:: node()"));
+
+	CHECK_XPATH_NODESET(n.child(STR("child")), STR("ancestor:: node()")) % 2 % 1; // node, root
+	CHECK_XPATH_NODESET(n, STR("child/subchild/ancestor:: node()")) % 4 % 2 % 1; // child, node, root
+	CHECK_XPATH_NODESET(n, STR("child/@attr/ancestor:: node()")) % 4 % 2 % 1; // child, node, root
+	CHECK_XPATH_NODESET(n, STR("ancestor:: node()")) % 1; // root
+	CHECK_XPATH_NODESET(doc, STR("ancestor:: node()"));
+
+	CHECK_XPATH_NODESET(na, STR("ancestor:: node()")) % 4 % 2 % 1; // child, node, root
+}
+
+TEST_XML(xpath_paths_axes_following_sibling, "<node attr1='value' attr2='value'><child attr='value'><subchild/></child><another><subchild/></another><last/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.attribute(STR("attr1")), n);
+
+	CHECK_XPATH_NODESET(c, STR("following-sibling:: node()"));
+
+	CHECK_XPATH_NODESET(n.child(STR("child")), STR("following-sibling:: node()")) % 8 % 10; // another, last
+	CHECK_XPATH_NODESET(n.child(STR("last")), STR("following-sibling:: node()"));
+
+	CHECK_XPATH_NODESET(n, STR("@attr1/following-sibling:: node()")); // attributes are not siblings
+	CHECK_XPATH_NODESET(na, STR("following-sibling:: node()")); // attributes are not siblings
+}
+
+TEST_XML(xpath_paths_axes_preceding_sibling, "<node attr1='value' attr2='value'><child attr='value'><subchild/></child><another><subchild/></another><last/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.attribute(STR("attr2")), n);
+
+	CHECK_XPATH_NODESET(c, STR("preceding-sibling:: node()"));
+
+	CHECK_XPATH_NODESET(n.child(STR("child")), STR("preceding-sibling:: node()"));
+	CHECK_XPATH_NODESET(n.child(STR("last")), STR("preceding-sibling:: node()")) % 8 % 5; // another, child
+
+	CHECK_XPATH_NODESET(n, STR("@attr2/following-sibling:: node()")); // attributes are not siblings
+	CHECK_XPATH_NODESET(na, STR("following-sibling:: node()")); // attributes are not siblings
+}
+
+TEST_XML(xpath_paths_axes_following, "<node attr1='value' attr2='value'><child attr='value'><subchild/></child><another><subchild/></another><almost/><last/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.attribute(STR("attr1")), n);
+
+	CHECK_XPATH_NODESET(c, STR("following:: node()"));
+
+	CHECK_XPATH_NODESET(n, STR("following:: node()")); // no descendants
+	CHECK_XPATH_NODESET(n.child(STR("child")), STR("following:: node()")) % 8 % 9 % 10 % 11; // another, subchild, almost, last
+	CHECK_XPATH_NODESET(n.child(STR("child")).child(STR("subchild")), STR("following:: node()")) % 8 % 9 % 10 % 11; // another, subchild, almost, last
+	CHECK_XPATH_NODESET(n.child(STR("last")), STR("following:: node()"));
+
+	CHECK_XPATH_NODESET(n, STR("@attr1/following::node()")) % 5 % 7 % 8 % 9 % 10 % 11; // child, subchild, another, subchild, almost, last - because @/following
+	CHECK_XPATH_NODESET(n, STR("child/@attr/following::node()")) % 7 % 8 % 9 % 10 % 11; // subchild, another, subchild, almost, last
+	CHECK_XPATH_NODESET(na, STR("following::node()")) % 5 % 7 % 8 % 9 % 10 % 11; // child, subchild, another, subchild, almost, last - because @/following
+}
+
+TEST_XML(xpath_paths_axes_preceding, "<node attr1='value' attr2='value'><child attr='value'><subchild/></child><another><subchild id='1'/></another><almost/><last/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.child(STR("child")).attribute(STR("attr")), n.child(STR("child")));
+
+	CHECK_XPATH_NODESET(c, STR("preceding:: node()"));
+
+	CHECK_XPATH_NODESET(n.child(STR("child")), STR("preceding:: node()")); // no ancestors
+	CHECK_XPATH_NODESET(n.child(STR("last")), STR("preceding:: node()")) % 11 % 9 % 8 % 7 % 5; // almost, subchild, another, subchild, child
+	CHECK_XPATH_NODESET(n.child(STR("another")).child(STR("subchild")), STR("preceding:: node()")) % 7 % 5; // subchild, child
+	CHECK_XPATH_NODESET(n, STR("preceding:: node()"));
+
+	CHECK_XPATH_NODESET(n, STR("child/@attr/preceding::node()")); // no ancestors
+	CHECK_XPATH_NODESET(n, STR("//subchild[@id]/@id/preceding::node()")) % 7 % 5; // subchild, child
+	CHECK_XPATH_NODESET(na, STR("preceding::node()")); // no ancestors
+}
+
+TEST_XML(xpath_paths_axes_attribute, "<node attr1='value' attr2='value'><child attr='value'><subchild/></child><another xmlns:foo='bar'><subchild/></another><last/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.attribute(STR("attr1")), n);
+
+	CHECK_XPATH_NODESET(c, STR("attribute:: node()"));
+
+	CHECK_XPATH_NODESET(n.child(STR("child")), STR("attribute:: node()")) % 6; // child/@attr
+	CHECK_XPATH_NODESET(n.child(STR("last")), STR("attribute:: node()"));
+	CHECK_XPATH_NODESET(n, STR("attribute:: node()")) % 3 % 4; // node/@attr1 node/@attr2
+	CHECK_XPATH_NODESET(doc, STR("descendant-or-self:: node()/attribute:: node()")) % 3 % 4 % 6; // all attributes
+	CHECK_XPATH_NODESET(n.child(STR("another")), STR("attribute:: node()")); // namespace nodes are not attributes
+
+	CHECK_XPATH_NODESET(n, STR("@attr1/attribute::node()"));
+	CHECK_XPATH_NODESET(na, STR("attribute::node()"));
+}
+
+TEST_XML(xpath_paths_axes_namespace, "<node xmlns:foo='bar' attr='value'/>")
+{
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.attribute(STR("attr")), n);
+
+	// namespace nodes are not supported
+	CHECK_XPATH_NODESET(n, STR("namespace:: node()"));
+	CHECK_XPATH_NODESET(n, STR("@attr/attribute::node()"));
+	CHECK_XPATH_NODESET(na, STR("attribute::node()"));
+}
+
+TEST_XML(xpath_paths_axes_self, "<node attr='value'><child attr='value'><subchild/></child><another><subchild/></another><last/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.attribute(STR("attr")), n);
+
+	CHECK_XPATH_NODESET(c, STR("self:: node()"));
+
+	CHECK_XPATH_NODESET(n.child(STR("child")), STR("self:: node()")) % 4; // child
+	CHECK_XPATH_NODESET(n, STR("self:: node()")) % 2; // node
+	CHECK_XPATH_NODESET(n, STR("child/self:: node()")) % 4; // child
+	CHECK_XPATH_NODESET(n, STR("child/@attr/self:: node()")) % 5; // @attr
+	CHECK_XPATH_NODESET(doc, STR("self:: node()")) % 1; // root
+	CHECK_XPATH_NODESET(na, STR("self:: node()")) % 3; // @attr
+}
+
+TEST_XML(xpath_paths_axes_descendant_or_self, "<node attr='value'><child attr='value'><subchild/></child><another><subchild/></another><last/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.child(STR("child")).attribute(STR("attr")), n.child(STR("child")));
+
+	CHECK_XPATH_NODESET(c, STR("descendant-or-self:: node()"));
+
+	CHECK_XPATH_NODESET(n, STR("descendant-or-self:: node()")) % 2 % 4 % 6 % 7 % 8 % 9; // node, child, subchild, another, subchild, last
+	CHECK_XPATH_NODESET(doc, STR("descendant-or-self:: node()")) % 1 % 2 % 4 % 6 % 7 % 8 % 9; // root, node, child, subchild, another, subchild, last
+	CHECK_XPATH_NODESET(n, STR("another/descendant-or-self:: node()")) % 7 % 8; // another, subchild
+	CHECK_XPATH_NODESET(n, STR("last/descendant-or-self:: node()")) % 9; // last
+
+	CHECK_XPATH_NODESET(n, STR("child/@attr/descendant-or-self::node()")) % 5; // @attr
+	CHECK_XPATH_NODESET(na, STR("descendant-or-self::node()")) % 5; // @attr
+}
+
+TEST_XML(xpath_paths_axes_ancestor_or_self, "<node attr='value'><child attr='value'><subchild/></child><another><subchild/></another><last/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.child(STR("child")).attribute(STR("attr")), n.child(STR("child")));
+
+	CHECK_XPATH_NODESET(c, STR("ancestor-or-self:: node()"));
+
+	CHECK_XPATH_NODESET(n.child(STR("child")), STR("ancestor-or-self:: node()")) % 4 % 2 % 1; // child, node, root
+	CHECK_XPATH_NODESET(n, STR("child/subchild/ancestor-or-self:: node()")) % 6 % 4 % 2 % 1; // subchild, child, node, root
+	CHECK_XPATH_NODESET(n, STR("child/@attr/ancestor-or-self:: node()")) % 5 % 4 % 2 % 1; // @attr, child, node, root
+	CHECK_XPATH_NODESET(n, STR("ancestor-or-self:: node()")) % 2 % 1; // root, node
+	CHECK_XPATH_NODESET(doc, STR("ancestor-or-self:: node()")) % 1; // root
+	CHECK_XPATH_NODESET(n, STR("ancestor-or-self:: node()")) % 2 % 1; // root, node
+	CHECK_XPATH_NODESET(n, STR("last/ancestor-or-self::node()")) % 9 % 2 % 1; // root, node, last
+	CHECK_XPATH_NODESET(na, STR("ancestor-or-self:: node()")) % 5 % 4 % 2 % 1; // @attr, child, node, root
+}
+
+TEST_XML(xpath_paths_axes_abbrev, "<node attr='value'><foo/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// @ axis
+	CHECK_XPATH_NODESET(c, STR("@attr"));
+	CHECK_XPATH_NODESET(n, STR("@attr")) % 3;
+
+	// no axis - child implied
+	CHECK_XPATH_NODESET(c, STR("foo"));
+	CHECK_XPATH_NODESET(n, STR("foo")) % 4;
+	CHECK_XPATH_NODESET(doc, STR("node()")) % 2;
+
+	// @ axis should disable all other axis specifiers
+	CHECK_XPATH_FAIL(STR("@child::foo"));
+	CHECK_XPATH_FAIL(STR("@attribute::foo"));
+}
+
+TEST_XML(xpath_paths_nodetest_all, "<node a1='v1' x:a2='v2'><c1/><x:c2/><c3/><x:c4/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("*"));
+	CHECK_XPATH_NODESET(c, STR("child::*"));
+
+	CHECK_XPATH_NODESET(n, STR("*")) % 5 % 6 % 7 % 8;
+	CHECK_XPATH_NODESET(n, STR("child::*")) % 5 % 6 % 7 % 8;
+	CHECK_XPATH_NODESET(n, STR("attribute::*")) % 3 % 4;
+}
+
+TEST_XML_FLAGS(xpath_paths_nodetest_name, "<node a1='v1' x:a2='v2'><c1/><x:c2/><c3/><x:c4/><?c1?></node>", parse_default | parse_pi)
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("c1"));
+	CHECK_XPATH_NODESET(c, STR("child::c1"));
+
+	CHECK_XPATH_NODESET(n, STR("c1")) % 5;
+	CHECK_XPATH_NODESET(n, STR("x:c2")) % 6;
+
+	CHECK_XPATH_NODESET(n, STR("child::c1")) % 5;
+	CHECK_XPATH_NODESET(n, STR("child::x:c2")) % 6;
+
+	CHECK_XPATH_NODESET(n, STR("attribute::a1")) % 3;
+	CHECK_XPATH_NODESET(n, STR("attribute::x:a2")) % 4;
+	CHECK_XPATH_NODESET(n, STR("@x:a2")) % 4;
+}
+
+TEST_XML(xpath_paths_nodetest_all_in_namespace, "<node a1='v1' x:a2='v2'><c1/><x:c2/><c3/><x:c4/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("x:*"));
+	CHECK_XPATH_NODESET(c, STR("child::x:*"));
+
+	CHECK_XPATH_NODESET(n, STR("x:*")) % 6 % 8;
+	CHECK_XPATH_NODESET(n, STR("child::x:*")) % 6 % 8;
+
+	CHECK_XPATH_NODESET(n, STR("attribute::x:*")) % 4;
+	CHECK_XPATH_NODESET(n, STR("@x:*")) % 4;
+
+	CHECK_XPATH_FAIL(STR(":*"));
+	CHECK_XPATH_FAIL(STR("@:*"));
+}
+
+TEST_XML_FLAGS(xpath_paths_nodetest_type, "<node attr='value'>pcdata<child/><?pi1 value?><?pi2 value?><![CDATA[cdata]]></node>", parse_default | parse_pi | parse_comments)
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	// check on empty nodes
+	CHECK_XPATH_NODESET(c, STR("node()"));
+	CHECK_XPATH_NODESET(c, STR("text()"));
+	CHECK_XPATH_NODESET(c, STR("comment()"));
+	CHECK_XPATH_NODESET(c, STR("processing-instruction()"));
+	CHECK_XPATH_NODESET(c, STR("processing-instruction('foobar')"));
+
+	// child axis
+	CHECK_XPATH_NODESET(n, STR("node()")) % 4 % 5 % 6 % 7 % 8 % 9;
+	CHECK_XPATH_NODESET(n, STR("text()")) % 4 % 9;
+	CHECK_XPATH_NODESET(n, STR("comment()")) % 8;
+	CHECK_XPATH_NODESET(n, STR("processing-instruction()")) % 6 % 7;
+	CHECK_XPATH_NODESET(n, STR("processing-instruction('pi2')")) % 7;
+
+	// attribute axis
+	CHECK_XPATH_NODESET(n, STR("@node()")) % 3;
+	CHECK_XPATH_NODESET(n, STR("@text()"));
+	CHECK_XPATH_NODESET(n, STR("@comment()"));
+	CHECK_XPATH_NODESET(n, STR("@processing-instruction()"));
+	CHECK_XPATH_NODESET(n, STR("@processing-instruction('pi2')"));
+
+	// incorrect 'argument' number
+	CHECK_XPATH_FAIL(STR("node('')"));
+	CHECK_XPATH_FAIL(STR("text('')"));
+	CHECK_XPATH_FAIL(STR("comment('')"));
+	CHECK_XPATH_FAIL(STR("processing-instruction(1)"));
+	CHECK_XPATH_FAIL(STR("processing-instruction('', '')"));
+	CHECK_XPATH_FAIL(STR("processing-instruction(concat('a', 'b'))"));
+}
+
+TEST_XML_FLAGS(xpath_paths_nodetest_principal, "<node attr='value'>pcdata<child/><?pi1 value?><?pi2 value?><![CDATA[cdata]]></node><abra:cadabra abra:arba=''/>", parse_default | parse_pi | parse_comments)
+{
+	// node() test is true for any node type
+	CHECK_XPATH_NODESET(doc, STR("//node()")) % 2 % 4 % 5 % 6 % 7 % 8 % 9 % 10;
+	CHECK_XPATH_NODESET(doc, STR("//attribute::node()")) % 3 % 11;
+	CHECK_XPATH_NODESET(doc, STR("//attribute::node()/ancestor-or-self::node()")) % 1 % 2 % 3 % 10 % 11;
+
+	// name test is true only for node with principal node type (depends on axis)
+	CHECK_XPATH_NODESET(doc, STR("node/child::child")) % 5;
+	CHECK_XPATH_NODESET(doc, STR("node/attribute::attr")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("node/child::pi1"));
+	CHECK_XPATH_NODESET(doc, STR("node/child::attr"));
+	CHECK_XPATH_NODESET(doc, STR("node/child::child/self::child")) % 5;
+	CHECK_XPATH_NODESET(doc, STR("node/attribute::attr/self::attr")); // attribute is not of element type
+	CHECK_XPATH_NODESET(doc, STR("node/child::child/ancestor-or-self::child")) % 5;
+	CHECK_XPATH_NODESET(doc, STR("node/attribute::attr/ancestor-or-self::attr")); // attribute is not of element type
+	CHECK_XPATH_NODESET(doc, STR("node/child::child/descendant-or-self::child")) % 5;
+	CHECK_XPATH_NODESET(doc, STR("node/attribute::attr/descendant-or-self::attr")); // attribute is not of element type
+
+	// any name test is true only for node with principal node type (depends on axis)
+	CHECK_XPATH_NODESET(doc, STR("node/child::*")) % 5;
+	CHECK_XPATH_NODESET(doc, STR("node/attribute::*")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("node/child::*/self::*")) % 5;
+	CHECK_XPATH_NODESET(doc, STR("node/attribute::*/self::*")); // attribute is not of element type
+	CHECK_XPATH_NODESET(doc, STR("node/child::*/ancestor-or-self::*")) % 5 % 2;
+	CHECK_XPATH_NODESET(doc, STR("node/attribute::*/ancestor-or-self::*")) % 2; // attribute is not of element type
+	CHECK_XPATH_NODESET(doc, STR("node/child::*/descendant-or-self::*")) % 5;
+	CHECK_XPATH_NODESET(doc, STR("node/attribute::*/descendant-or-self::*")); // attribute is not of element type
+
+	// namespace test is true only for node with principal node type (depends on axis)
+	CHECK_XPATH_NODESET(doc, STR("child::abra:*")) % 10;
+	CHECK_XPATH_NODESET(doc, STR("child::abra:*/attribute::abra:*")) % 11;
+	CHECK_XPATH_NODESET(doc, STR("child::abra:*/self::abra:*")) % 10;
+	CHECK_XPATH_NODESET(doc, STR("child::abra:*/attribute::abra:*/self::abra:*")); // attribute is not of element type
+	CHECK_XPATH_NODESET(doc, STR("child::abra:*/ancestor-or-self::abra:*")) % 10;
+	CHECK_XPATH_NODESET(doc, STR("child::abra:*/attribute::abra:*/ancestor-or-self::abra:*")) % 10; // attribute is not of element type
+	CHECK_XPATH_NODESET(doc, STR("child::abra:*/descendant-or-self::abra:*")) % 10;
+	CHECK_XPATH_NODESET(doc, STR("child::abra:*/attribute::abra:*/descendant-or-self::abra:*")); // attribute is not of element type
+}
+
+TEST_XML(xpath_paths_absolute, "<node attr='value'><foo><foo/><foo/></foo></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+	xpath_node na(n.attribute(STR("attr")), n);
+
+	CHECK_XPATH_NODESET(c, STR("/foo"));
+	CHECK_XPATH_NODESET(n, STR("/foo"));
+	CHECK_XPATH_NODESET(n, STR("/node/foo")) % 4;
+	CHECK_XPATH_NODESET(n.child(STR("foo")), STR("/node/foo")) % 4;
+	CHECK_XPATH_NODESET(na, STR("/node/foo")) % 4;
+
+	CHECK_XPATH_NODESET(c, STR("/"));
+	CHECK_XPATH_NODESET(n, STR("/")) % 1;
+	CHECK_XPATH_NODESET(n.child(STR("foo")), STR("/")) % 1;
+	CHECK_XPATH_NODESET(na, STR("/")) % 1;
+}
+
+TEST_XML(xpath_paths_step_abbrev, "<node><foo/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("."));
+	CHECK_XPATH_NODESET(c, STR(".."));
+
+	CHECK_XPATH_NODESET(n, STR(".")) % 2;
+	CHECK_XPATH_NODESET(n, STR("..")) % 1;
+	CHECK_XPATH_NODESET(n, STR("../node")) % 2;
+	CHECK_XPATH_NODESET(n.child(STR("foo")), STR("..")) % 2;
+
+	CHECK_XPATH_FAIL(STR(".node"));
+	CHECK_XPATH_FAIL(STR("..node"));
+}
+
+TEST_XML(xpath_paths_relative_abbrev, "<node><foo><foo/><foo/></foo></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("foo//bar"));
+
+	CHECK_XPATH_NODESET(n, STR("foo/foo")) % 4 % 5;
+	CHECK_XPATH_NODESET(n, STR("foo//foo")) % 4 % 5;
+	CHECK_XPATH_NODESET(n, STR(".//foo")) % 3 % 4 % 5;
+}
+
+TEST_XML(xpath_paths_absolute_abbrev, "<node><foo><foo/><foo/></foo></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("//bar"));
+
+	CHECK_XPATH_NODESET(n, STR("//foo")) % 3 % 4 % 5;
+	CHECK_XPATH_NODESET(n.child(STR("foo")), STR("//foo")) % 3 % 4 % 5;
+	CHECK_XPATH_NODESET(doc, STR("//foo")) % 3 % 4 % 5;
+}
+
+TEST_XML(xpath_paths_predicate_boolean, "<node><chapter/><chapter/><chapter/><chapter/><chapter/></node>")
+{
+	xml_node n = doc.child(STR("node")).child(STR("chapter")).next_sibling().next_sibling();
+
+	CHECK_XPATH_NODESET(n, STR("following-sibling::chapter[position()=1]")) % 6;
+	CHECK_XPATH_NODESET(n, STR("following-sibling::chapter[position()=2]")) % 7;
+	CHECK_XPATH_NODESET(n, STR("preceding-sibling::chapter[position()=1]")) % 4;
+	CHECK_XPATH_NODESET(n, STR("preceding-sibling::chapter[position()=2]")) % 3;
+}
+
+TEST_XML(xpath_paths_predicate_number, "<node><chapter/><chapter/><chapter/><chapter/><chapter/></node>")
+{
+	xml_node n = doc.child(STR("node")).child(STR("chapter")).next_sibling().next_sibling();
+
+	CHECK_XPATH_NODESET(n, STR("following-sibling::chapter[1]")) % 6;
+	CHECK_XPATH_NODESET(n, STR("following-sibling::chapter[2]")) % 7;
+	CHECK_XPATH_NODESET(n, STR("preceding-sibling::chapter[1]")) % 4;
+	CHECK_XPATH_NODESET(n, STR("preceding-sibling::chapter[2]")) % 3;
+}
+
+TEST_XML(xpath_paths_predicate_number_boundary, "<node><chapter/><chapter/><chapter/><chapter/><chapter/></node>")
+{
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[0.999999999999999]"));
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[1]")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[1.000000000000001]"));
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[1.999999999999999]"));
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[2]")) % 4;
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[2.000000000000001]"));
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[4.999999999999999]"));
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[5]")) % 7;
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[5.000000000000001]"));
+}
+
+TEST_XML(xpath_paths_predicate_number_out_of_range, "<node><chapter/><chapter/><chapter/><chapter/><chapter/></node>")
+{
+	xml_node n = doc.child(STR("node")).child(STR("chapter")).next_sibling().next_sibling();
+
+	CHECK_XPATH_NODESET(n, STR("following-sibling::chapter[0]"));
+	CHECK_XPATH_NODESET(n, STR("following-sibling::chapter[-1]"));
+	CHECK_XPATH_NODESET(n, STR("following-sibling::chapter[-1000000000000]"));
+	CHECK_XPATH_NODESET(n, STR("following-sibling::chapter[-1 div 0]"));
+	CHECK_XPATH_NODESET(n, STR("following-sibling::chapter[1000000000000]"));
+	CHECK_XPATH_NODESET(n, STR("following-sibling::chapter[1 div 0]"));
+
+#ifndef MSVC6_NAN_BUG
+	CHECK_XPATH_NODESET(n, STR("following-sibling::chapter[0 div 0]"));
+#endif
+}
+
+TEST_XML(xpath_paths_predicate_constant_boolean, "<node><chapter/><chapter/><chapter/><chapter/><chapter/></node>")
+{
+	xml_node n = doc.child(STR("node")).child(STR("chapter")).next_sibling().next_sibling();
+
+	xpath_variable_set set;
+	set.set(STR("true"), true);
+	set.set(STR("false"), false);
+
+	CHECK_XPATH_NODESET_VAR(n, STR("following-sibling::chapter[$false]"), &set);
+	CHECK_XPATH_NODESET_VAR(n, STR("following-sibling::chapter[$true]"), &set) % 6 % 7;
+}
+
+TEST_XML(xpath_paths_predicate_position_eq, "<node><chapter/><chapter/><chapter>3</chapter><chapter/><chapter/></node>")
+{
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[position()=1]")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[position()=2+2]")) % 7;
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[position()=last()]")) % 8;
+
+#ifndef MSVC6_NAN_BUG
+	CHECK_XPATH_NODESET(doc, STR("node/chapter[position()=string()]")) % 5;
+#endif
+}
+
+TEST_XML(xpath_paths_predicate_several, "<node><employee/><employee secretary=''/><employee assistant=''/><employee secretary='' assistant=''/><employee assistant='' secretary=''/></node>")
+{
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(n, STR("employee")) % 3 % 4 % 6 % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR("employee[@secretary]")) % 4 % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR("employee[@assistant]")) % 6 % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR("employee[@secretary][@assistant]")) % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR("employee[@assistant][@secretary]")) % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR("employee[@secretary and @assistant]")) % 8 % 11;
+}
+
+TEST_XML(xpath_paths_predicate_filter_boolean, "<node><chapter/><chapter/><chapter/><chapter/><chapter/></node>")
+{
+	xml_node n = doc.child(STR("node")).child(STR("chapter")).next_sibling().next_sibling();
+
+	CHECK_XPATH_NODESET(n, STR("(following-sibling::chapter)[position()=1]")) % 6;
+	CHECK_XPATH_NODESET(n, STR("(following-sibling::chapter)[position()=2]")) % 7;
+	CHECK_XPATH_NODESET(n, STR("(preceding-sibling::chapter)[position()=1]")) % 3;
+	CHECK_XPATH_NODESET(n, STR("(preceding-sibling::chapter)[position()=2]")) % 4;
+}
+
+TEST_XML(xpath_paths_predicate_filter_number, "<node><chapter/><chapter/><chapter/><chapter/><chapter/></node>")
+{
+	xml_node n = doc.child(STR("node")).child(STR("chapter")).next_sibling().next_sibling();
+
+	CHECK_XPATH_NODESET(n, STR("(following-sibling::chapter)[1]")) % 6;
+	CHECK_XPATH_NODESET(n, STR("(following-sibling::chapter)[2]")) % 7;
+	CHECK_XPATH_NODESET(n, STR("(preceding-sibling::chapter)[1]")) % 3;
+	CHECK_XPATH_NODESET(n, STR("(preceding-sibling::chapter)[2]")) % 4;
+}
+
+TEST_XML(xpath_paths_predicate_filter_posinv, "<node><employee/><employee secretary=''/><employee assistant=''/><employee secretary='' assistant=''/><employee assistant='' secretary=''/></node>")
+{
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(n, STR("employee")) % 3 % 4 % 6 % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR("(employee[@secretary])[@assistant]")) % 8 % 11;
+	CHECK_XPATH_NODESET(n, STR("((employee)[@assistant])[@secretary]")) % 8 % 11;
+}
+
+TEST_XML(xpath_paths_step_compose, "<node><foo><foo/><foo/></foo><foo/></node>")
+{
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(n, STR("(.)/foo")) % 3 % 6;
+	CHECK_XPATH_NODESET(n, STR("(.)//foo")) % 3 % 4 % 5 % 6;
+	CHECK_XPATH_NODESET(n, STR("(./..)//*")) % 2 % 3 % 4 % 5 % 6;
+
+	CHECK_XPATH_FAIL(STR("(1)/foo"));
+	CHECK_XPATH_FAIL(STR("(1)//foo"));
+}
+
+TEST_XML(xpath_paths_descendant_double_slash_w3c, "<node><para><para/><para/><para><para/></para></para><para/></node>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//para")) % 3 % 4 % 5 % 6 % 7 % 8;
+	CHECK_XPATH_NODESET(doc, STR("/descendant::para")) % 3 % 4 % 5 % 6 % 7 % 8;
+	CHECK_XPATH_NODESET(doc, STR("//para[1]")) % 3 % 4 % 7;
+	CHECK_XPATH_NODESET(doc, STR("/descendant::para[1]")) % 3;
+}
+
+TEST_XML(xpath_paths_needs_sorting, "<node><child/><child/><child><subchild/><subchild/></child></node>")
+{
+ CHECK_XPATH_NODESET(doc, STR("(node/child/subchild)[2]")) % 7;
+}
+
+TEST_XML(xpath_paths_descendant_filters, "<node><para><para/><para/><para><para/></para></para><para/></node>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//para[1]")) % 3 % 4 % 7;
+	CHECK_XPATH_NODESET(doc, STR("/descendant::para[1]")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("//para[true()][1]")) % 3 % 4 % 7;
+	CHECK_XPATH_NODESET(doc, STR("/descendant::para[true()][1]")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("//para[1][true()]")) % 3 % 4 % 7;
+	CHECK_XPATH_NODESET(doc, STR("/descendant::para[1][true()]")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("//para[1][2]"));
+	CHECK_XPATH_NODESET(doc, STR("/descendant::para[1][2]"));
+	CHECK_XPATH_NODESET(doc, STR("//para[true()]")) % 3 % 4 % 5 % 6 % 7 % 8;
+	CHECK_XPATH_NODESET(doc, STR("/descendant::para[true()]")) % 3 % 4 % 5 % 6 % 7 % 8;
+	CHECK_XPATH_NODESET(doc, STR("//para[position()=1][true()]")) % 3 % 4 % 7;
+	CHECK_XPATH_NODESET(doc, STR("/descendant::para[position()=1][true()]")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("//para[true()][position()=1]")) % 3 % 4 % 7;
+	CHECK_XPATH_NODESET(doc, STR("/descendant::para[true()][position()=1]")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("//node()[self::para]")) % 3 % 4 % 5 % 6 % 7 % 8;
+}
+
+TEST_XML(xpath_paths_descendant_optimize, "<node><para><para/><para/><para><para/></para></para><para/></node>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//para")) % 3 % 4 % 5 % 6 % 7 % 8;
+	CHECK_XPATH_NODESET(doc, STR("/descendant-or-self::node()/child::para")) % 3 % 4 % 5 % 6 % 7 % 8;
+	CHECK_XPATH_NODESET(doc, STR("/descendant-or-self::node()[name()='para']/child::para")) % 4 % 5 % 6 % 7;
+	CHECK_XPATH_NODESET(doc, STR("/descendant-or-self::node()[name()='para']/child::para[1]")) % 4 % 7;
+	CHECK_XPATH_NODESET(doc, STR("/descendant-or-self::node()[3]/child::para")) % 4 % 5 % 6;
+}
+
+TEST_XML(xpath_paths_descendant_optimize_axes, "<node><para><para/><para/><para><para/></para></para><para/></node>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//.")) % 1 % 2 % 3 % 4 % 5 % 6 % 7 % 8;
+	CHECK_XPATH_NODESET(doc, STR("//descendant::*")) % 2 % 3 % 4 % 5 % 6 % 7 % 8;
+	CHECK_XPATH_NODESET(doc, STR("//descendant-or-self::*")) % 2 % 3 % 4 % 5 % 6 % 7 % 8;
+
+	CHECK_XPATH_NODESET(doc, STR("//..")) % 1 % 2 % 3 % 6;
+	CHECK_XPATH_NODESET(doc, STR("//ancestor::*")) % 2 % 3 % 6;
+	CHECK_XPATH_NODESET(doc, STR("//ancestor-or-self::*")) % 2 % 3 % 4 % 5 % 6 % 7 % 8;
+	CHECK_XPATH_NODESET(doc, STR("//preceding-sibling::*")) % 3 % 4 % 5;
+	CHECK_XPATH_NODESET(doc, STR("//following-sibling::*")) % 5 % 6 % 8;
+	CHECK_XPATH_NODESET(doc, STR("//preceding::*")) % 3 % 4 % 5 % 6 % 7;
+	CHECK_XPATH_NODESET(doc, STR("//following::*")) % 5 % 6 % 7 % 8;
+}
+
+TEST_XML(xpath_paths_descendant_optimize_last, "<node><para><para/><para/><para><para/></para></para><para/></node>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//para[last()]")) % 6 % 7 % 8;
+	CHECK_XPATH_NODESET(doc, STR("//para[last() = 1]")) % 7;
+}
+
+TEST_XML(xpath_paths_precision, "<node><para/><para/><para/><para/><para/></node>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//para[1]")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("//para[3 div 3]")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("//para[6 div 3 - 1]")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("//para[6 * (1 div 3) - 1]")) % 3;
+}
+
+TEST_XML(xpath_paths_unsorted_child, "<node><foo><bar/></foo><node><foo><bar/></foo></node><foo><bar/></foo></node>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//node/foo")) % 3 % 6 % 8;
+	CHECK_XPATH_NODESET(doc, STR("//node/foo/bar")) % 4 % 7 % 9;
+
+	xpath_node_set ns = doc.select_nodes(STR("//node/foo/bar"));
+	CHECK(ns.type() == xpath_node_set::type_unsorted);
+
+	xpath_node_set nss = ns;
+	nss.sort();
+
+	CHECK(ns[0] == nss[0]);
+	CHECK(ns[1] == nss[2]);
+	CHECK(ns[2] == nss[1]);
+}
+
+TEST_XML(xpath_paths_optimize_compare_attribute, "<node id='1' /><node id='2' /><node xmlns='3' />")
+{
+	CHECK_XPATH_NODESET(doc, STR("node[@id = '1']")) % 2;
+	CHECK_XPATH_NODESET(doc, STR("node[@id = '2']")) % 4;
+	CHECK_XPATH_NODESET(doc, STR("node[@id = 2]")) % 4;
+	CHECK_XPATH_NODESET(doc, STR("node[@id[. > 3] = '2']"));
+	CHECK_XPATH_NODESET(doc, STR("node['1' = @id]")) % 2;
+
+	xpath_variable_set set;
+	set.set(STR("var1"), STR("2"));
+	set.set(STR("var2"), 2.0);
+
+	CHECK_XPATH_NODESET_VAR(doc, STR("node[@id = $var1]"), &set) % 4;
+	CHECK_XPATH_NODESET_VAR(doc, STR("node[@id = $var2]"), &set) % 4;
+
+	CHECK_XPATH_NODESET(doc, STR("node[@xmlns = '3']"));
+}
+
+TEST_XML(xpath_paths_optimize_step_once, "<node><para1><para2/><para3/><para4><para5 attr5=''/></para4></para1><para6/></node>")
+{
+ CHECK_XPATH_BOOLEAN(doc, STR("node//para2/following::*"), true);
+ CHECK_XPATH_BOOLEAN(doc, STR("node//para6/following::*"), false);
+
+ CHECK_XPATH_STRING(doc, STR("name(node//para2/following::*)"), STR("para3"));
+ CHECK_XPATH_STRING(doc, STR("name(node//para6/following::*)"), STR(""));
+
+ CHECK_XPATH_BOOLEAN(doc, STR("node//para1/preceding::*"), false);
+ CHECK_XPATH_BOOLEAN(doc, STR("node//para6/preceding::*"), true);
+
+ CHECK_XPATH_STRING(doc, STR("name(node//para1/preceding::*)"), STR(""));
+ CHECK_XPATH_STRING(doc, STR("name(node//para6/preceding::*)"), STR("para1"));
+
+ CHECK_XPATH_BOOLEAN(doc, STR("node//para6/preceding::para4"), true);
+
+ CHECK_XPATH_BOOLEAN(doc, STR("//@attr5/ancestor-or-self::*"), true);
+ CHECK_XPATH_BOOLEAN(doc, STR("//@attr5/ancestor::*"), true);
+
+ CHECK_XPATH_BOOLEAN(doc, STR("//@attr5/following::para6"), true);
+ CHECK_XPATH_STRING(doc, STR("name(//@attr5/following::para6)"), STR("para6"));
+
+ CHECK_XPATH_BOOLEAN(doc, STR("//para5/ancestor-or-self::*"), true);
+ CHECK_XPATH_BOOLEAN(doc, STR("//para5/ancestor::*"), true);
+
+ CHECK_XPATH_BOOLEAN(doc, STR("//@attr5/ancestor-or-self::node()"), true);
+}
+
+TEST_XML(xpath_paths_null_nodeset_entries, "<node attr='value'/>")
+{
+ xpath_node nodes[] =
+ {
+ xpath_node(doc.first_child()),
+ xpath_node(xml_node()),
+ xpath_node(doc.first_child().first_attribute(), doc.first_child()),
+ xpath_node(xml_attribute(), doc.first_child()),
+ xpath_node(xml_attribute(), xml_node()),
+ };
+
+ xpath_node_set ns(nodes, nodes + sizeof(nodes) / sizeof(nodes[0]));
+
+ xpath_variable_set vars;
+ vars.set(STR("x"), ns);
+
+ xpath_node_set rs = xpath_query(STR("$x/."), &vars).evaluate_node_set(xml_node());
+
+ CHECK(rs.size() == 2);
+ CHECK(rs[0] == nodes[0]);
+ CHECK(rs[1] == nodes[2]);
+}
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_paths_abbrev_w3c.cpp Added

@@ -0,0 +1,217 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+TEST_XML(xpath_paths_abbrev_w3c_1, "<node><para/><foo/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("para"));
+	CHECK_XPATH_NODESET(n, STR("para")) % 3 % 5;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_2, "<node><para/><foo/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("*"));
+	CHECK_XPATH_NODESET(n, STR("*")) % 3 % 4 % 5;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_3, "<node>pcdata<child/><![CDATA[cdata]]></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("text()"));
+	CHECK_XPATH_NODESET(n, STR("text()")) % 3 % 5;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_4, "<node name='value' foo='bar' />")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("@name"));
+	CHECK_XPATH_NODESET(n, STR("@name")) % 3;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_5, "<node name='value' foo='bar' />")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("@*"));
+	CHECK_XPATH_NODESET(n, STR("@*")) % 3 % 4;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_6, "<node><para/><para/><para/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("para[1]"));
+	CHECK_XPATH_NODESET(n, STR("para[1]")) % 3;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_7, "<node><para/><para/><para/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("para[last()]"));
+	CHECK_XPATH_NODESET(n, STR("para[last()]")) % 6;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_8, "<node><para><para/><para/><foo><para/></foo></para><foo/><para/></node>")
+{
+	xml_node c;
+
+	CHECK_XPATH_NODESET(c, STR("*/para"));
+	CHECK_XPATH_NODESET(doc, STR("*/para")) % 3 % 9;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_9, "<doc><chapter/><chapter/><chapter/><chapter/><chapter><section/><section/><section/></chapter><chapter/></doc>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("doc")).child(STR("chapter"));
+
+	CHECK_XPATH_NODESET(c, STR("/doc/chapter[5]/section[2]"));
+	CHECK_XPATH_NODESET(n, STR("/doc/chapter[5]/section[2]")) % 9;
+	CHECK_XPATH_NODESET(doc, STR("/doc/chapter[5]/section[2]")) % 9;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_10, "<chapter><para><para/><para/><foo><para/></foo></para><foo/><para/></chapter>")
+{
+	xml_node c;
+
+	CHECK_XPATH_NODESET(c, STR("chapter//para"));
+	CHECK_XPATH_NODESET(doc, STR("chapter//para")) % 3 % 4 % 5 % 7 % 9;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_11, "<node><para><para/><para/><foo><para/></foo></para><foo/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("//para"));
+	CHECK_XPATH_NODESET(n, STR("//para")) % 3 % 4 % 5 % 7 % 9;
+	CHECK_XPATH_NODESET(n.child(STR("para")), STR("//para")) % 3 % 4 % 5 % 7 % 9;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_12, "<node><olist><item/></olist><item/><olist><olist><item/><item/></olist></olist></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("//olist/item"));
+	CHECK_XPATH_NODESET(n, STR("//olist/item")) % 4 % 8 % 9;
+	CHECK_XPATH_NODESET(n.child(STR("olist")), STR("//olist/item")) % 4 % 8 % 9;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_13, "<node><child/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("."));
+	CHECK_XPATH_NODESET(n, STR(".")) % 2;
+	CHECK_XPATH_NODESET(n.child(STR("child")), STR(".")) % 3;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_14, "<node><para><para/><para/><foo><para/></foo></para><foo/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR(".//para"));
+	CHECK_XPATH_NODESET(n, STR(".//para")) % 3 % 4 % 5 % 7 % 9;
+	CHECK_XPATH_NODESET(n.child(STR("para")), STR(".//para")) % 4 % 5 % 7;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_15, "<node lang='en'><child/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR(".."));
+	CHECK_XPATH_NODESET(n, STR("..")) % 1;
+	CHECK_XPATH_NODESET(n.child(STR("child")), STR("..")) % 2;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_16, "<node lang='en'><child/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("../@lang"));
+	CHECK_XPATH_NODESET(n, STR("../@lang"));
+	CHECK_XPATH_NODESET(n.child(STR("child")), STR("../@lang")) % 3;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_17, "<node><para/><para type='warning'/><para type='warning'/><para/><para type='error'/><para type='warning'/><para type='warning'/><para type='warning'/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("para[@type=\"warning\"]"));
+	CHECK_XPATH_NODESET(n, STR("para[@type=\"warning\"]")) % 4 % 6 % 11 % 13 % 15;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_18, "<node><para/><para type='warning'/><para type='warning'/><para/><para type='error'/><para type='warning'/><para type='warning'/><para type='warning'/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("para[@type=\"warning\"][5]"));
+	CHECK_XPATH_NODESET(n, STR("para[@type=\"warning\"][5]")) % 15;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_19a, "<node><para/><para type='warning'/><para type='warning'/><para/><para type='error'/><para type='warning'/><para type='warning'/><para type='warning'/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("para[5][@type=\"warning\"]"));
+	CHECK_XPATH_NODESET(n, STR("para[5][@type=\"warning\"]"));
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_19b, "<node><para/><para type='warning'/><para type='warning'/><para/><para type='warning'/><para type='warning'/><para type='warning'/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("para[5][@type=\"warning\"]"));
+	CHECK_XPATH_NODESET(n, STR("para[5][@type=\"warning\"]")) % 9;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_20, "<node><chapter><title>foo</title></chapter><chapter><title>Introduction</title></chapter><chapter><title>introduction</title></chapter><chapter/><chapter><title>Introduction</title><title>foo</title></chapter></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("chapter[title=\"Introduction\"]"));
+	CHECK_XPATH_NODESET(n, STR("chapter[title=\"Introduction\"]")) % 6 % 13;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_21, "<node><chapter><title>foo</title></chapter><chapter><title>Introduction</title></chapter><chapter><title>introduction</title></chapter><chapter/><chapter><title>Introduction</title><title>foo</title></chapter></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("chapter[title]"));
+	CHECK_XPATH_NODESET(n, STR("chapter[title]")) % 3 % 6 % 9 % 13;
+}
+
+TEST_XML(xpath_paths_abbrev_w3c_22, "<node><employee/><employee secretary=''/><employee assistant=''/><employee secretary='' assistant=''/><employee assistant='' secretary=''/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("employee[@secretary and @assistant]"));
+	CHECK_XPATH_NODESET(n, STR("employee[@secretary and @assistant]")) % 8 % 11;
+}
+
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_paths_w3c.cpp Added

@@ -0,0 +1,310 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+TEST_XML(xpath_paths_w3c_1, "<node><para/><foo/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::para"));
+	CHECK_XPATH_NODESET(n, STR("child::para")) % 3 % 5;
+}
+
+TEST_XML(xpath_paths_w3c_2, "<node><para/><foo/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::*"));
+	CHECK_XPATH_NODESET(n, STR("child::*")) % 3 % 4 % 5;
+}
+
+TEST_XML(xpath_paths_w3c_3, "<node>pcdata<child/><![CDATA[cdata]]></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::text()"));
+	CHECK_XPATH_NODESET(n, STR("child::text()")) % 3 % 5;
+}
+
+TEST_XML(xpath_paths_w3c_4, "<node>pcdata<child/><![CDATA[cdata]]></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::node()"));
+	CHECK_XPATH_NODESET(n, STR("child::node()")) % 3 % 4 % 5;
+}
+
+TEST_XML(xpath_paths_w3c_5, "<node name='value' foo='bar' />")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("attribute::name"));
+	CHECK_XPATH_NODESET(n, STR("attribute::name")) % 3;
+}
+
+TEST_XML(xpath_paths_w3c_6, "<node name='value' foo='bar' />")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("attribute::*"));
+	CHECK_XPATH_NODESET(n, STR("attribute::*")) % 3 % 4;
+}
+
+TEST_XML(xpath_paths_w3c_7, "<node><para><para/><para/><foo><para/></foo></para><foo/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("descendant::para"));
+	CHECK_XPATH_NODESET(n, STR("descendant::para")) % 3 % 4 % 5 % 7 % 9;
+	CHECK_XPATH_NODESET(n.child(STR("para")), STR("descendant::para")) % 4 % 5 % 7;
+}
+
+TEST_XML(xpath_paths_w3c_8, "<node><div><div><div/></div></div></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("ancestor::div"));
+	CHECK_XPATH_NODESET(n.child(STR("div")).child(STR("font")).child(STR("div")).child(STR("div")), STR("ancestor::div")) % 5 % 3;
+}
+
+TEST_XML(xpath_paths_w3c_9, "<node><div><div><div/></div></div></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("ancestor-or-self::div"));
+	CHECK_XPATH_NODESET(n.child(STR("div")).child(STR("font")).child(STR("div")).child(STR("div")), STR("ancestor-or-self::div")) % 6 % 5 % 3;
+}
+
+TEST_XML(xpath_paths_w3c_10, "<node><para><para/><para/><foo><para/></foo></para><foo/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("descendant-or-self::para"));
+	CHECK_XPATH_NODESET(n, STR("descendant-or-self::para")) % 3 % 4 % 5 % 7 % 9;
+	CHECK_XPATH_NODESET(n.child(STR("para")), STR("descendant-or-self::para")) % 3 % 4 % 5 % 7;
+}
+
+TEST_XML(xpath_paths_w3c_11, "<node><para><para/><para/><foo><para/></foo></para><foo/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("self::para"));
+	CHECK_XPATH_NODESET(n, STR("self::para"));
+	CHECK_XPATH_NODESET(n.child(STR("para")), STR("self::para")) % 3;
+}
+
+TEST_XML(xpath_paths_w3c_12, "<chapter><para><para/><para/><foo><para/></foo></para><foo/><para/></chapter>")
+{
+	xml_node c;
+
+	CHECK_XPATH_NODESET(c, STR("child::chapter/descendant::para"));
+	CHECK_XPATH_NODESET(doc, STR("child::chapter/descendant::para")) % 3 % 4 % 5 % 7 % 9;
+}
+
+TEST_XML(xpath_paths_w3c_13, "<node><para><para/><para/><foo><para/></foo></para><foo/><para/></node>")
+{
+	xml_node c;
+
+	CHECK_XPATH_NODESET(c, STR("child::*/child::para"));
+	CHECK_XPATH_NODESET(doc, STR("child::*/child::para")) % 3 % 9;
+}
+
+TEST_XML(xpath_paths_w3c_14, "<node><para><para/><para/><foo><para/></foo></para><foo/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("/"));
+
+	CHECK_XPATH_NODESET(doc, STR("/")) % 1;
+	CHECK_XPATH_NODESET(n, STR("/")) % 1;
+	CHECK_XPATH_NODESET(n.child(STR("para")), STR("/")) % 1;
+}
+
+TEST_XML(xpath_paths_w3c_15, "<node><para><para/><para/><foo><para/></foo></para><foo/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("/descendant::para"));
+	CHECK_XPATH_NODESET(n, STR("/descendant::para")) % 3 % 4 % 5 % 7 % 9;
+	CHECK_XPATH_NODESET(n.child(STR("para")), STR("/descendant::para")) % 3 % 4 % 5 % 7 % 9;
+}
+
+TEST_XML(xpath_paths_w3c_16, "<node><olist><item/></olist><item/><olist><olist><item/><item/></olist></olist></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("/descendant::olist/child::item"));
+	CHECK_XPATH_NODESET(n, STR("/descendant::olist/child::item")) % 4 % 8 % 9;
+	CHECK_XPATH_NODESET(n.child(STR("olist")), STR("/descendant::olist/child::item")) % 4 % 8 % 9;
+}
+
+TEST_XML(xpath_paths_w3c_17, "<node><para/><para/><para/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::para[position()=1]"));
+	CHECK_XPATH_NODESET(n, STR("child::para[position()=1]")) % 3;
+}
+
+TEST_XML(xpath_paths_w3c_18, "<node><para/><para/><para/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::para[position()=last()]"));
+	CHECK_XPATH_NODESET(n, STR("child::para[position()=last()]")) % 6;
+}
+
+TEST_XML(xpath_paths_w3c_19, "<node><para/><para/><para/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::para[position()=last()-1]"));
+	CHECK_XPATH_NODESET(n, STR("child::para[position()=last()-1]")) % 5;
+}
+
+TEST_XML(xpath_paths_w3c_20, "<node><para/><para/><para/><para/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::para[position()>1]"));
+	CHECK_XPATH_NODESET(n, STR("child::para[position()>1]")) % 4 % 5 % 6;
+}
+
+TEST_XML(xpath_paths_w3c_21, "<node><chapter/><chapter/><chapter/><chapter/><chapter/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node")).child(STR("chapter")).next_sibling().next_sibling();
+
+	CHECK_XPATH_NODESET(c, STR("following-sibling::chapter[position()=1]"));
+	CHECK_XPATH_NODESET(n, STR("following-sibling::chapter[position()=1]")) % 6;
+}
+
+TEST_XML(xpath_paths_w3c_22, "<node><chapter/><chapter/><chapter/><chapter/><chapter/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node")).child(STR("chapter")).next_sibling().next_sibling();
+
+	CHECK_XPATH_NODESET(c, STR("preceding-sibling::chapter[position()=1]"));
+	CHECK_XPATH_NODESET(n, STR("preceding-sibling::chapter[position()=1]")) % 4;
+}
+
+TEST_XML(xpath_paths_w3c_23, "<node><figure><figure/><figure/><foo><figure/></foo></figure><foo/><figure/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("/descendant::figure[position()=4]"));
+	CHECK_XPATH_NODESET(n, STR("/descendant::figure[position()=4]")) % 7;
+	CHECK_XPATH_NODESET(n.child(STR("figure")), STR("/descendant::figure[position()=4]")) % 7;
+}
+
+TEST_XML(xpath_paths_w3c_24, "<doc><chapter/><chapter/><chapter/><chapter/><chapter><section/><section/><section/></chapter><chapter/></doc>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("doc")).child(STR("chapter"));
+
+	CHECK_XPATH_NODESET(c, STR("/child::doc/child::chapter[position()=5]/child::section[position()=2]"));
+	CHECK_XPATH_NODESET(n, STR("/child::doc/child::chapter[position()=5]/child::section[position()=2]")) % 9;
+	CHECK_XPATH_NODESET(doc, STR("/child::doc/child::chapter[position()=5]/child::section[position()=2]")) % 9;
+}
+
+TEST_XML(xpath_paths_w3c_25, "<node><para/><para type='warning'/><para type='warning'/><para/><para type='error'/><para type='warning'/><para type='warning'/><para type='warning'/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::para[attribute::type=\"warning\"]"));
+	CHECK_XPATH_NODESET(n, STR("child::para[attribute::type=\"warning\"]")) % 4 % 6 % 11 % 13 % 15;
+}
+
+TEST_XML(xpath_paths_w3c_26, "<node><para/><para type='warning'/><para type='warning'/><para/><para type='error'/><para type='warning'/><para type='warning'/><para type='warning'/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::para[attribute::type=\"warning\"][position()=5]"));
+	CHECK_XPATH_NODESET(n, STR("child::para[attribute::type=\"warning\"][position()=5]")) % 15;
+}
+
+TEST_XML(xpath_paths_w3c_27a, "<node><para/><para type='warning'/><para type='warning'/><para/><para type='error'/><para type='warning'/><para type='warning'/><para type='warning'/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::para[position()=5][attribute::type=\"warning\"]"));
+	CHECK_XPATH_NODESET(n, STR("child::para[position()=5][attribute::type=\"warning\"]"));
+}
+
+TEST_XML(xpath_paths_w3c_27b, "<node><para/><para type='warning'/><para type='warning'/><para/><para type='warning'/><para type='warning'/><para type='warning'/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::para[position()=5][attribute::type=\"warning\"]"));
+	CHECK_XPATH_NODESET(n, STR("child::para[position()=5][attribute::type=\"warning\"]")) % 9;
+}
+
+TEST_XML(xpath_paths_w3c_28, "<node><chapter><title>foo</title></chapter><chapter><title>Introduction</title></chapter><chapter><title>introduction</title></chapter><chapter/><chapter><title>Introduction</title><title>foo</title></chapter></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::chapter[child::title='Introduction']"));
+	CHECK_XPATH_NODESET(n, STR("child::chapter[child::title='Introduction']")) % 6 % 13;
+}
+
+TEST_XML(xpath_paths_w3c_29, "<node><chapter><title>foo</title></chapter><chapter><title>Introduction</title></chapter><chapter><title>introduction</title></chapter><chapter/><chapter><title>Introduction</title><title>foo</title></chapter></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::chapter[child::title]"));
+	CHECK_XPATH_NODESET(n, STR("child::chapter[child::title]")) % 3 % 6 % 9 % 13;
+}
+
+TEST_XML(xpath_paths_w3c_30, "<node><abstract/><chapter/><chapter/><references/><appendix/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::*[self::chapter or self::appendix]"));
+	CHECK_XPATH_NODESET(n, STR("child::*[self::chapter or self::appendix]")) % 4 % 5 % 7;
+}
+
+TEST_XML(xpath_paths_w3c_31a, "<node><abstract/><chapter/><chapter/><references/><appendix/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::*[self::chapter or self::appendix][position()=last()]"));
+	CHECK_XPATH_NODESET(n, STR("child::*[self::chapter or self::appendix][position()=last()]")) % 7;
+}
+
+TEST_XML(xpath_paths_w3c_31b, "<node><abstract/><chapter/><chapter/><references/><appendix/><chapter/></node>")
+{
+	xml_node c;
+	xml_node n = doc.child(STR("node"));
+
+	CHECK_XPATH_NODESET(c, STR("child::*[self::chapter or self::appendix][position()=last()]"));
+	CHECK_XPATH_NODESET(n, STR("child::*[self::chapter or self::appendix][position()=last()]")) % 8;
+}
+
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_variables.cpp Added

@@ -0,0 +1,582 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+#include <string>
+
+TEST(xpath_variables_type_none)
+{
+	xpath_variable_set set;
+
+	xpath_variable* var = set.add(STR("target"), xpath_type_none);
+	CHECK(!var);
+}
+
+TEST(xpath_variables_type_boolean)
+{
+	xpath_variable_set set;
+
+	xpath_variable* var = set.add(STR("target"), xpath_type_boolean);
+	CHECK(var);
+
+	CHECK(var->type() == xpath_type_boolean);
+	CHECK_STRING(var->name(), STR("target"));
+
+	CHECK(var->get_boolean() == false);
+	CHECK_DOUBLE_NAN(var->get_number());
+	CHECK_STRING(var->get_string(), STR(""));
+	CHECK(var->get_node_set().empty());
+
+	CHECK(var->set(true));
+	CHECK(!var->set(1.0));
+	CHECK(!var->set(STR("abc")));
+	CHECK(!var->set(xpath_node_set()));
+
+	CHECK(var->get_boolean() == true);
+	CHECK_DOUBLE_NAN(var->get_number());
+	CHECK_STRING(var->get_string(), STR(""));
+	CHECK(var->get_node_set().empty());
+}
+
+TEST(xpath_variables_type_number)
+{
+	xpath_variable_set set;
+
+	xpath_variable* var = set.add(STR("target"), xpath_type_number);
+	CHECK(var);
+
+	CHECK(var->type() == xpath_type_number);
+	CHECK_STRING(var->name(), STR("target"));
+
+	CHECK(var->get_boolean() == false);
+	CHECK_DOUBLE(var->get_number(), 0);
+	CHECK_STRING(var->get_string(), STR(""));
+	CHECK(var->get_node_set().empty());
+
+	CHECK(!var->set(true));
+	CHECK(var->set(1.0));
+	CHECK(!var->set(STR("abc")));
+	CHECK(!var->set(xpath_node_set()));
+
+	CHECK(var->get_boolean() == false);
+	CHECK_DOUBLE(var->get_number(), 1);
+	CHECK_STRING(var->get_string(), STR(""));
+	CHECK(var->get_node_set().empty());
+}
+
+TEST(xpath_variables_type_string)
+{
+	xpath_variable_set set;
+
+	xpath_variable* var = set.add(STR("target"), xpath_type_string);
+	CHECK(var);
+
+	CHECK(var->type() == xpath_type_string);
+	CHECK_STRING(var->name(), STR("target"));
+
+	CHECK(var->get_boolean() == false);
+	CHECK_DOUBLE_NAN(var->get_number());
+	CHECK_STRING(var->get_string(), STR(""));
+	CHECK(var->get_node_set().empty());
+
+	CHECK(!var->set(true));
+	CHECK(!var->set(1.0));
+	CHECK(var->set(STR("abc")));
+	CHECK(!var->set(xpath_node_set()));
+
+	CHECK(var->get_boolean() == false);
+	CHECK_DOUBLE_NAN(var->get_number());
+	CHECK_STRING(var->get_string(), STR("abc"));
+	CHECK(var->get_node_set().empty());
+
+	CHECK(var->set(STR("abcdef")));
+	CHECK_STRING(var->get_string(), STR("abcdef"));
+}
+
+TEST_XML(xpath_variables_type_node_set, "<node/>")
+{
+	xpath_variable_set set;
+
+	xpath_variable* var = set.add(STR("target"), xpath_type_node_set);
+	CHECK(var);
+
+	CHECK(var->type() == xpath_type_node_set);
+	CHECK_STRING(var->name(), STR("target"));
+
+	CHECK(var->get_boolean() == false);
+	CHECK_DOUBLE_NAN(var->get_number());
+	CHECK_STRING(var->get_string(), STR(""));
+	CHECK(var->get_node_set().empty());
+
+	CHECK(!var->set(true));
+	CHECK(!var->set(1.0));
+	CHECK(!var->set(STR("abc")));
+	CHECK(var->set(doc.select_nodes(STR("*"))));
+
+	CHECK(var->get_boolean() == false);
+	CHECK_DOUBLE_NAN(var->get_number());
+	CHECK_STRING(var->get_string(), STR(""));
+	CHECK(var->get_node_set().size() == 1 && var->get_node_set()[0] == doc.first_child());
+}
+
+TEST(xpath_variables_set_operations)
+{
+	xpath_variable_set set;
+
+	xpath_variable* v1 = set.add(STR("var1"), xpath_type_number);
+	CHECK(v1);
+
+	xpath_variable* v2 = set.add(STR("var2"), xpath_type_string);
+	CHECK(v2);
+
+	CHECK(v1 != v2);
+
+	CHECK(set.add(STR("var1"), xpath_type_number) == v1);
+	CHECK(set.add(STR("var2"), xpath_type_string) == v2);
+	CHECK(set.add(STR("var2"), xpath_type_node_set) == 0);
+
+	CHECK(set.get(STR("var1")) == v1);
+	CHECK(set.get(STR("var2")) == v2);
+	CHECK(set.get(STR("var")) == 0);
+	CHECK(set.get(STR("var11")) == 0);
+
+	CHECK(static_cast<const xpath_variable_set&>(set).get(STR("var1")) == v1);
+	CHECK(static_cast<const xpath_variable_set&>(set).get(STR("var3")) == 0);
+}
+
+TEST_XML(xpath_variables_set_operations_set, "<node/>")
+{
+	xpath_variable_set set;
+
+	xpath_variable* v1 = set.add(STR("var1"), xpath_type_number);
+	CHECK(v1);
+
+	xpath_variable* v2 = set.add(STR("var2"), xpath_type_string);
+	CHECK(v2);
+
+	CHECK(set.set(STR("var1"), 1.0));
+	CHECK_DOUBLE(v1->get_number(), 1.0);
+
+	CHECK(set.set(STR("var2"), STR("value")));
+	CHECK_STRING(v2->get_string(), STR("value"));
+
+	CHECK(!set.set(STR("var1"), true));
+
+	CHECK(set.set(STR("var3"), doc.select_nodes(STR("*"))));
+
+	xpath_variable* v3 = set.get(STR("var3"));
+
+	CHECK(v3);
+	CHECK(v3->type() == xpath_type_node_set);
+	CHECK(v3->get_node_set().size() == 1);
+}
+
+TEST(xpath_variables_set_out_of_memory)
+{
+	test_runner::_memory_fail_threshold = 1;
+
+	xpath_variable_set set;
+
+	xpath_variable* var = 0;
+	CHECK_ALLOC_FAIL(var = set.add(STR("target"), xpath_type_number));
+	CHECK(!var);
+}
+
+TEST(xpath_variables_out_of_memory)
+{
+	test_runner::_memory_fail_threshold = 64;
+
+	xpath_variable_set set;
+
+	xpath_variable* var = set.add(STR("target"), xpath_type_string);
+	CHECK(var);
+
+	CHECK_ALLOC_FAIL(CHECK(!var->set(STR("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"))));
+}
+
+TEST_XML(xpath_variables_evaluate, "<node/>")
+{
+	xpath_variable_set set;
+	set.set(STR("var1"), true);
+	set.set(STR("var2"), 0.5);
+	set.set(STR("var3"), STR("value"));
+	set.set(STR("var4"), doc.select_nodes(STR("*")));
+
+	CHECK_XPATH_BOOLEAN_VAR(doc, STR("$var1"), &set, true);
+	CHECK_XPATH_NUMBER_VAR(doc, STR("$var2"), &set, 0.5);
+	CHECK_XPATH_STRING_VAR(doc, STR("$var3"), &set, STR("value"));
+	CHECK_XPATH_NODESET_VAR(doc, STR("$var4"), &set) % 2;
+}
+
+TEST_XML(xpath_variables_evaluate_conversion, "<node>3</node>")
+{
+	xpath_variable_set set;
+	set.set(STR("var"), doc.select_nodes(STR("*")));
+
+	CHECK_XPATH_BOOLEAN_VAR(doc, STR("$var"), &set, true);
+	CHECK_XPATH_NUMBER_VAR(doc, STR("$var"), &set, 3);
+	CHECK_XPATH_STRING_VAR(doc, STR("$var"), &set, STR("3"));
+	CHECK_XPATH_NODESET_VAR(doc, STR("$var"), &set) % 2;
+}
+
+TEST(xpath_variables_evaluate_node_set_fail)
+{
+	xpath_variable_set set;
+	set.set(STR("var"), false);
+
+	xpath_query q(STR("$var"), &set);
+
+#ifdef PUGIXML_NO_EXCEPTIONS
+	CHECK(q.evaluate_node_set(xml_node()).empty());
+#else
+	try
+	{
+		q.evaluate_node_set(xml_node());
+
+		CHECK_FORCE_FAIL("Expected exception");
+	}
+	catch (const xpath_exception&)
+	{
+	}
+#endif
+}
+
+TEST(xpath_variables_multiple_documents)
+{
+	xml_document doc;
+	doc.append_child().set_name(STR("node"));
+
+	xml_document doc1;
+	doc1.append_child().set_name(STR("node"));
+
+	xml_document doc2;
+	doc2.append_child().set_name(STR("node"));
+
+	xpath_variable_set set;
+	set.set(STR("var1"), doc1.select_nodes(STR("*")));
+	set.set(STR("var2"), doc2.select_nodes(STR("*")));
+
+	xpath_node_set ns = doc.select_nodes(STR("$var1 | $var2 | node"), &set);
+	ns.sort();
+
+	CHECK(ns.size() == 3);
+	CHECK(ns[0] != ns[1] && ns[0] != ns[2]);
+	
+	xml_node n0 = doc.child(STR("node")), n1 = doc1.child(STR("node")), n2 = doc2.child(STR("node"));
+
+	CHECK(n0 == ns[0].node() || n0 == ns[1].node() || n0 == ns[2].node());
+	CHECK(n1 == ns[0].node() || n1 == ns[1].node() || n1 == ns[2].node());
+	CHECK(n2 == ns[0].node() || n2 == ns[1].node() || n2 == ns[2].node());
+}
+
+TEST(xpath_variables_long_name)
+{
+	xpath_variable_set set;
+	set.set(STR("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"), true);
+
+	CHECK_XPATH_BOOLEAN_VAR(xml_node(), STR("$abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"), &set, true);
+}
+
+TEST(xpath_variables_long_name_out_of_memory)
+{
+	xpath_variable_set set;
+	set.set(STR("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"), true);
+
+	test_runner::_memory_fail_threshold = 4096 + 64 + 52 * sizeof(char_t);
+
+	CHECK_ALLOC_FAIL(CHECK(!xpath_query(STR("$abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"), &set)));
+}
+
+TEST_XML(xpath_variables_select, "<node attr='1'/><node attr='2'/>")
+{
+	xpath_variable_set set;
+	set.set(STR("one"), 1.0);
+
+	xpath_node_set ns = doc.select_nodes(STR("node[@attr=$one+1]"), &set);
+	CHECK(ns.size() == 1 && ns[0].node() == doc.last_child());
+
+	xpath_node n = doc.select_node(STR("node[@attr=$one+1]"), &set);
+	CHECK(n == ns[0]);
+}
+
+TEST(xpath_variables_empty_name)
+{
+	xpath_variable_set set;
+	CHECK(!set.add(STR(""), xpath_type_number));
+}
+
+TEST_XML(xpath_variables_inside_filter, "<node key='1' value='2'/><node key='2' value='1'/><node key='1' value='1'/>")
+{
+	xpath_variable_set set;
+	set.set(STR("one"), 1.0);
+
+	xpath_node_set ns = doc.select_nodes(STR("(node[@key = $one])[@value = $one]"), &set);
+	CHECK(ns.size() == 1 && ns[0].node() == doc.last_child());
+}
+
+TEST_XML(xpath_variables_step, "<node><child/><child/><child><child/></child></node>")
+{
+	xpath_variable_set set;
+	set.set(STR("root"), doc.select_nodes(STR("node")));
+
+	CHECK_XPATH_NODESET_VAR(xml_node(), STR("$root/child"), &set) % 3 % 4 % 5;
+	CHECK_XPATH_NODESET_VAR(xml_node(), STR("$root//child"), &set) % 3 % 4 % 5 % 6;
+}
+
+TEST_XML(xpath_variables_index, "<node><child/><child/><child><child/></child></node>")
+{
+	xpath_variable_set set;
+	set.set(STR("index"), 2.0);
+
+	CHECK_XPATH_NODESET_VAR(doc, STR("node/child[$index]"), &set) % 4;
+	CHECK_XPATH_NODESET_VAR(doc, STR("node/child[position()=$index]"), &set) % 4;
+}
+
+TEST(xpath_variables_qname)
+{
+	xpath_variable_set set;
+	set.set(STR("foo:bar"), true);
+
+	CHECK_XPATH_BOOLEAN_VAR(xml_node(), STR("$foo:bar"), &set, true);
+}
+
+TEST(xpath_variables_name_error)
+{
+	xpath_variable_set set;
+	set.set(STR("foo:"), true);
+	set.set(STR(":bar"), true);
+	set.set(STR("foo:*"), true);
+	set.set(STR("foo"), true);
+	set.set(STR("3"), true);
+
+	CHECK_XPATH_FAIL_VAR(STR("$foo:"), &set);
+	CHECK_XPATH_FAIL_VAR(STR("$:bar"), &set);
+	CHECK_XPATH_FAIL_VAR(STR("$foo:*"), &set);
+	CHECK_XPATH_FAIL_VAR(STR("$foo:bar:baz"), &set);
+	CHECK_XPATH_FAIL_VAR(STR("$ foo"), &set);
+
+	CHECK_XPATH_FAIL_VAR(STR("$3"), &set);
+}
+
+TEST(xpath_variables_empty_string)
+{
+	xpath_variable_set set;
+	set.add(STR("empty"), xpath_type_string);
+
+	CHECK_XPATH_BOOLEAN_VAR(xml_node(), STR("$empty = substring-before('a', 'z')"), &set, true);
+}
+
+TEST(xpath_variables_name_underscore)
+{
+	xpath_variable_set set;
+	set.set(STR("_foo_bar"), true);
+
+	CHECK_XPATH_BOOLEAN_VAR(xml_node(), STR("$_foo_bar"), &set, true);
+}
+
+TEST(xpath_variables_name_case)
+{
+	xpath_variable_set set;
+	set.set(STR("i"), 5.0);
+	set.set(STR("I"), 2.0);
+
+	CHECK_XPATH_NUMBER_VAR(xml_node(), STR("$i div $I"), &set, 2.5);
+}
+
+TEST(xpath_variables_name_unicode)
+{
+#ifdef PUGIXML_WCHAR_MODE
+	#ifdef U_LITERALS
+		const char_t* name = L"\u0400\u203D";
+	#else
+		const char_t* name = L"\x0400\x203D";
+	#endif
+#else
+	const char_t* name = "\xd0\x80\xe2\x80\xbd";
+#endif
+
+	xpath_variable_set set;
+	set.set(name, STR("value"));
+
+	std::basic_string<char_t> var = STR("$");
+	var += name;
+
+	CHECK_XPATH_STRING_VAR(xml_node(), var.c_str(), &set, STR("value"));
+}
+
+TEST_XML(xpath_variables_count_sum, "<node><c1>12</c1><c2>23</c2><c3>34</c3></node>")
+{
+	xpath_variable_set set;
+	set.set(STR("c12"), doc.select_nodes(STR("node/c1 | node/c2")));
+	set.set(STR("c3"), doc.select_nodes(STR("node/c3")));
+	set.set(STR("c"), doc.select_nodes(STR("node/*")));
+
+	CHECK_XPATH_NUMBER_VAR(xml_node(), STR("sum($c12) * count($c) - sum($c3)"), &set, 71);
+}
+
+TEST_XML(xpath_variables_copy, "<node />")
+{
+	xpath_variable_set set1;
+	set1.set(STR("a"), true);
+	set1.set(STR("b"), 2.0);
+	set1.set(STR("c"), STR("string"));
+	set1.set(STR("d"), doc.select_nodes(STR("//*")));
+
+	CHECK_XPATH_STRING_VAR(xml_node(), STR("substring($c, count($d[$a]) + $b)"), &set1, STR("ring"));
+
+	xpath_variable_set set2 = set1;
+
+	CHECK_XPATH_STRING_VAR(xml_node(), STR("substring($c, count($d[$a]) + $b)"), &set2, STR("ring"));
+
+	xpath_variable_set set3;
+
+	CHECK(!set3.get(STR("a")));
+
+	set3 = set1;
+
+	CHECK_XPATH_STRING_VAR(xml_node(), STR("substring($c, count($d[$a]) + $b)"), &set2, STR("ring"));
+
+	set3 = set3;
+
+	CHECK_XPATH_STRING_VAR(xml_node(), STR("substring($c, count($d[$a]) + $b)"), &set2, STR("ring"));
+
+	set3 = xpath_variable_set();
+
+	CHECK(!set3.get(STR("a")));
+}
+
+TEST_XML(xpath_variables_copy_out_of_memory, "<node1 /><node2 />")
+{
+	xpath_variable_set set1;
+	set1.set(STR("a"), true);
+	set1.set(STR("b"), 2.0);
+	set1.set(STR("c"), STR("string"));
+	set1.set(STR("d"), doc.select_nodes(STR("//*")));
+
+	xpath_variable_set set2 = set1;
+
+	test_runner::_memory_fail_threshold = 32768 + 75 * sizeof(void*);
+
+	CHECK_ALLOC_FAIL(xpath_variable_set set3 = set1);
+
+	xpath_variable_set set4;
+
+	CHECK_ALLOC_FAIL(set4 = set1);
+	CHECK(!set4.get(STR("a")) && !set4.get(STR("b")) && !set4.get(STR("c")) && !set4.get(STR("d")));
+
+	CHECK_ALLOC_FAIL(set2 = set1);
+
+	CHECK(set2.get(STR("a")) && set2.get(STR("b")) && set2.get(STR("c")) && set2.get(STR("d")));
+
+	CHECK(set2.get(STR("a"))->get_boolean() == true);
+	CHECK(set2.get(STR("b"))->get_number() == 2.0);
+	CHECK_STRING(set2.get(STR("c"))->get_string(), STR("string"));
+	CHECK(set2.get(STR("d"))->get_node_set().size() == 2);
+}
+
+#if __cplusplus >= 201103
+TEST_XML(xpath_variables_move, "<node />")
+{
+	xpath_variable_set set;
+	set.set(STR("a"), true);
+	set.set(STR("b"), 2.0);
+	set.set(STR("c"), STR("string"));
+	set.set(STR("d"), doc.select_nodes(STR("//*")));
+
+	xpath_variable_set copy = set;
+	copy.set(STR("e"), 42.0);
+
+	test_runner::_memory_fail_threshold = 1;
+
+	xpath_variable_set move1 = std::move(set);
+
+	CHECK(!set.get(STR("a")) && !set.get(STR("b")) && !set.get(STR("c")) && !set.get(STR("d")));
+	CHECK(move1.get(STR("a")) && move1.get(STR("b")) && move1.get(STR("c")) && move1.get(STR("d")));
+
+	CHECK(move1.get(STR("a"))->get_boolean() == true);
+	CHECK(move1.get(STR("b"))->get_number() == 2.0);
+	CHECK_STRING(move1.get(STR("c"))->get_string(), STR("string"));
+	CHECK(move1.get(STR("d"))->get_node_set().size() == 1);
+
+	xpath_variable_set move2;
+	move2 = std::move(move1);
+
+	CHECK(!move1.get(STR("a")) && !move1.get(STR("b")) && !move1.get(STR("c")) && !move1.get(STR("d")));
+	CHECK(move2.get(STR("a")) && move2.get(STR("b")) && move2.get(STR("c")) && move2.get(STR("d")));
+
+	CHECK(copy.get(STR("e")));
+
+	copy = std::move(move2);
+
+	CHECK(!move2.get(STR("a")) && !move2.get(STR("b")) && !move2.get(STR("c")) && !move2.get(STR("d")));
+	CHECK(copy.get(STR("a")) && copy.get(STR("b")) && copy.get(STR("c")) && copy.get(STR("d")));
+	CHECK(!copy.get(STR("e")));
+
+	CHECK(copy.get(STR("a"))->get_boolean() == true);
+	CHECK(copy.get(STR("b"))->get_number() == 2.0);
+	CHECK_STRING(copy.get(STR("c"))->get_string(), STR("string"));
+	CHECK(copy.get(STR("d"))->get_node_set().size() == 1);
+}
+#endif
+
+TEST(xpath_variables_copy_big)
+{
+	xpath_variable_set set;
+
+	for (int i = 0; i < 100; ++i)
+	{
+		char_t name[4];
+		name[0] = 'a';
+		name[1] = char_t('0' + i / 10);
+		name[2] = char_t('0' + i % 10);
+		name[3] = 0;
+
+		set.set(name, double(i));
+	}
+
+	xpath_variable_set copy = set;
+
+	for (int j = 0; j < 100; ++j)
+	{
+		char_t name[4];
+		name[0] = 'a';
+		name[1] = char_t('0' + j / 10);
+		name[2] = char_t('0' + j % 10);
+		name[3] = 0;
+
+		CHECK(copy.get(name) && copy.get(name)->get_number() == j);
+	}
+}
+
+TEST(xpath_variables_copy_big_out_of_memory)
+{
+	xpath_variable_set set;
+
+	for (int i = 0; i < 100; ++i)
+	{
+		char_t name[4];
+		name[0] = 'a';
+		name[1] = char_t('0' + i / 10);
+		name[2] = char_t('0' + i % 10);
+		name[3] = 0;
+
+		set.set(name, double(i));
+	}
+
+	test_runner::_memory_fail_threshold = 1;
+
+	xpath_variable_set copy;
+	CHECK_ALLOC_FAIL(copy = set);
+
+	for (int j = 0; j < 100; ++j)
+	{
+		char_t name[4];
+		name[0] = 'a';
+		name[1] = char_t('0' + j / 10);
+		name[2] = char_t('0' + j % 10);
+		name[3] = 0;
+
+		CHECK(!copy.get(name));
+	}
+}
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_xalan_1.cpp Added

@@ -0,0 +1,409 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+TEST(xpath_xalan_boolean_1)
+{
+	xml_node c;
+
+	CHECK_XPATH_BOOLEAN(c, STR("true()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("true() and true()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("true() or true()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("not(true())"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("boolean('')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1>2"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1>=2"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("false()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1=1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1=2"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1 = 1.00"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("0 = -0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 = '001'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("true()='0'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("false()=''"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("true()=2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("false()=0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("false() and false()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("'foo' and 'fop'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("true() and false()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("false() and true()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("'1' and '0'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("true() or false()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("false() or true()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("false() or false()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("0 or ''"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("not(false())"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("not(false() = false())"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("not(true() = false())"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("not('')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("not('0')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("boolean('0')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("boolean(0)"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("boolean(-0)"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("boolean(1)"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("boolean(1 div 0)"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("boolean(0 div 0)"), false);
+}
+
+TEST_XML(xpath_xalan_boolean_2, "<doc/>")
+{
+	CHECK_XPATH_BOOLEAN(doc, STR("boolean(doc)"), true);
+	CHECK_XPATH_BOOLEAN(doc, STR("boolean(foo)"), false);
+}
+
+TEST(xpath_xalan_boolean_3)
+{
+	xml_node c;
+
+	CHECK_XPATH_BOOLEAN(c, STR("1>1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("2>1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1<2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1<1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("2<1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("'2'>'1'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("0 > -0"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("2>=2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2>=1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1<=2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1<=1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2<=1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("false() and 1 div 0"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("true() or 1 div 0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1!=1"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1!=2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1!=1.00"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("false()!=true()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("true()!=false()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("false()!=false()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("'ace' != 'ace'"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("'ace' != 'abc'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("'H' != ' H'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("'H' != 'H '"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1.9999999 < 2.0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2.0000001 < 2.0"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1.9999999 < 2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2 < 2.0"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("'001' = 1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("0=false()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("'0'=true()"), true);
+}
+
+TEST_XML(xpath_xalan_boolean_4, "<avj><a>foo</a>bar<c>foobar</c><d>foo</d></avj>")
+{
+	CHECK_XPATH_BOOLEAN(doc, STR("avj/*='foo'"), true);
+	CHECK_XPATH_BOOLEAN(doc, STR("not(avj/*='foo')"), false);
+	CHECK_XPATH_BOOLEAN(doc, STR("avj/*!='foo'"), true);
+	CHECK_XPATH_BOOLEAN(doc, STR("not(avj/*!='foo')"), false);
+
+	CHECK_XPATH_BOOLEAN(doc, STR("avj/k='foo'"), false);
+	CHECK_XPATH_BOOLEAN(doc, STR("not(avj/k='foo')"), true);
+	CHECK_XPATH_BOOLEAN(doc, STR("avj/k!='foo'"), false);
+	CHECK_XPATH_BOOLEAN(doc, STR("not(avj/k!='foo')"), true);
+}
+
+TEST_XML(xpath_xalan_boolean_5, "<doc><j l='12' w='33'>first</j><j l='17' w='45'>second</j><j l='16' w='78'>third</j><j l='12' w='33'>fourth</j></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_BOOLEAN(c, STR("j[@l='12'] = j[@w='33']"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("j[@l='12'] = j[@l='17']"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("j[@l='12'] = j[.='first' or @w='45']"), true);
+
+	CHECK_XPATH_BOOLEAN(c, STR("j[@l='12'] != j[@w='33']"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("j[@l='12'] != j[@l='17']"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("j[@l='12'] != j[.='first' or @w='45']"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("j[@l='16'] != j[@w='78']"), false);
+}
+
+TEST_XML(xpath_xalan_boolean_6, "<doc><avj><good>12<c>34</c><d>56</d><e>78</e></good></avj></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_BOOLEAN(c, STR("avj/good/*=34"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("not(avj/good/*=34)"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("avj/good/*!=34"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("not(avj/good/*!=34)"), false);
+
+	CHECK_XPATH_BOOLEAN(c, STR("34=avj/good/*"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("not(34=avj/good/*)"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("34!=avj/good/*"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("not(34!=avj/good/*)"), false);
+}
+
+TEST_XML(xpath_xalan_boolean_7, "<doc><avj><bool>true<c></c><d>false?</d><e>1</e><f>0</f></bool></avj></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_BOOLEAN(c, STR("avj/bool/*=true()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("not(avj/bool/*=true())"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("avj/bool/*!=true()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("not(avj/bool/*!=true())"), true);
+
+	CHECK_XPATH_BOOLEAN(c, STR("true()=avj/bool/*"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("not(true()=avj/bool/*)"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("true()!=avj/bool/*"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("not(true()!=avj/bool/*)"), true);
+
+	CHECK_XPATH_BOOLEAN(c, STR("avj/none/*=true()"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("not(avj/none/*=true())"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("avj/none/*!=true()"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("not(avj/none/*!=true())"), false);
+
+	CHECK_XPATH_BOOLEAN(c, STR("true()=avj/none/*"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("not(true()=avj/none/*)"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("true()!=avj/none/*"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("not(true()!=avj/none/*)"), false);
+}
+
+TEST_XML(xpath_xalan_conditional, "<letters>b</letters>")
+{
+	xml_node c;
+
+	CHECK_XPATH_BOOLEAN(c, STR("(round(3.7) > 3)"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2 > 1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("9 mod 3 = 0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("'a'='a'"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("2+2=4"), true);
+
+	xml_node b = doc.child(STR("letters")).first_child();
+
+	CHECK_XPATH_BOOLEAN(b, STR(".='b'"), true);
+	CHECK_XPATH_BOOLEAN(b, STR("name(..)='letters'"), true);
+}
+
+TEST_XML(xpath_xalan_math_1, "<a>3</a>")
+{
+	xml_node c;
+
+	CHECK_XPATH_NUMBER(c, STR("number('1')"), 1);
+	CHECK_XPATH_NUMBER(c, STR("floor(0.0)"), 0);
+	CHECK_XPATH_NUMBER(c, STR("ceiling(0.0)"), 0);
+	CHECK_XPATH_NUMBER(c, STR("round(0.0)"), 0);
+	CHECK_XPATH_NUMBER(c, STR("2*3"), 6);
+	CHECK_XPATH_NUMBER(c, STR("3+6"), 9);
+	CHECK_XPATH_NUMBER(c, STR("3-1"), 2);
+	CHECK_XPATH_NUMBER_NAN(doc, STR("a-1")); // a-1 is a name test, not arithmetic expression
+	CHECK_XPATH_NUMBER(doc, STR("a -1"), 2);
+	CHECK_XPATH_NUMBER(c, STR("6 div 2"), 3);
+	CHECK_XPATH_NUMBER(c, STR("5 mod 2"), 1);
+	CHECK_XPATH_NUMBER_NAN(c, STR("number(n)"));
+	CHECK_XPATH_NUMBER(c, STR("number(2)"), 2);
+	CHECK_XPATH_NUMBER(c, STR("number('3')"), 3);
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('')"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('abc')"));
+	CHECK_XPATH_BOOLEAN(c, STR("number(string(1.0))=1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("number(true())=1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("number(false())=0"), true);
+
+#ifndef MSVC6_NAN_BUG
+	CHECK_XPATH_BOOLEAN(c, STR("number('xxx')=number('xxx')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("number('xxx')=0"), false);
+#endif
+
+	CHECK_XPATH_NUMBER(doc, STR("floor(a)"), 3);
+	CHECK_XPATH_NUMBER(c, STR("floor(1.9)"), 1);
+	CHECK_XPATH_NUMBER(c, STR("floor(2.999999)"), 2);
+	CHECK_XPATH_NUMBER(c, STR("floor(-1.5)"), -2);
+	CHECK_XPATH_BOOLEAN(c, STR("floor(1)=1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("floor(1.9)=1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("floor(-1.5)=-2"), true);
+	CHECK_XPATH_NUMBER(doc, STR("ceiling(a)"), 3);
+	CHECK_XPATH_NUMBER(c, STR("ceiling(1.54)"), 2);
+	CHECK_XPATH_NUMBER(c, STR("ceiling(2.999999)"), 3);
+	CHECK_XPATH_NUMBER(c, STR("ceiling(3.000001)"), 4);
+	CHECK_XPATH_BOOLEAN(c, STR("ceiling(1)=1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("ceiling(1.1)=2"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("ceiling(-1.5)=-1"), true);
+}
+
+TEST_XML(xpath_xalan_math_2, "<a>3</a>")
+{
+	xml_node c;
+
+	CHECK_XPATH_NUMBER(doc, STR("round(a)"), 3);
+	CHECK_XPATH_NUMBER(c, STR("round(1.24)"), 1);
+	CHECK_XPATH_NUMBER(c, STR("round(2.999999)"), 3);
+	CHECK_XPATH_NUMBER(c, STR("round(3.000001)"), 3);
+	CHECK_XPATH_NUMBER(c, STR("round(1.1)"), 1);
+	CHECK_XPATH_NUMBER(c, STR("round(-1.1)"), -1);
+	CHECK_XPATH_NUMBER(c, STR("round(1.9)"), 2);
+	CHECK_XPATH_NUMBER(c, STR("round(-1.9)"), -2);
+	CHECK_XPATH_NUMBER(c, STR("round(1.5)"), 2);
+	CHECK_XPATH_NUMBER(c, STR("round(-1.5)"), -1);
+	CHECK_XPATH_NUMBER(c, STR("round(1.4999999)"), 1);
+	CHECK_XPATH_NUMBER(c, STR("round(-1.4999999)"), -1);
+	CHECK_XPATH_NUMBER(c, STR("round(1.5000001)"), 2);
+	CHECK_XPATH_NUMBER(c, STR("round(-1.5000001)"), -2);
+}
+
+TEST_XML(xpath_xalan_math_3, "<doc><n v='1'/><n>2</n><n v='3'/><n>4</n><n v='5'>5</n><e>17</e><e>-5</e><e>8</e><e>-37</e></doc>")
+{
+	CHECK_XPATH_NUMBER(doc, STR("sum(doc/x)"), 0);
+	CHECK_XPATH_NUMBER_NAN(doc, STR("sum(doc/n)"));
+	CHECK_XPATH_NUMBER(doc, STR("sum(doc/n[text()])"), 11);
+	CHECK_XPATH_NUMBER(doc, STR("sum(doc/n/@v)"), 9);
+	CHECK_XPATH_NUMBER(doc, STR("sum(doc/e)"), -17);
+}
+
+TEST_XML(xpath_xalan_math_4, "<doc><n1 a='1'>2</n1><n2 a='2'>3</n2><n1-n2>123</n1-n2><n-1>72</n-1><n-2>12</n-2><div a='2'>5</div><mod a='5'>2</mod></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NUMBER(c, STR("n1*n2"), 6);
+	CHECK_XPATH_NUMBER(c, STR("n1/@a*n2/@a"), 2);
+	CHECK_XPATH_NUMBER(c, STR("(n1/@a)*(n2/@a)"), 2);
+	CHECK_XPATH_NUMBER(c, STR("n1+n2"), 5);
+	CHECK_XPATH_NUMBER(c, STR("n1/@a+n2/@a"), 3);
+	CHECK_XPATH_NUMBER(c, STR("(n1/@a)+(n2/@a)"), 3);
+	CHECK_XPATH_NUMBER(c, STR("1-2"), -1);
+	CHECK_XPATH_NUMBER(c, STR("n1 - n2"), -1);
+	CHECK_XPATH_NUMBER(c, STR("n1-n2"), 123);
+	CHECK_XPATH_NUMBER(c, STR("n-1 - n-2"), 60);
+	CHECK_XPATH_NUMBER(c, STR("n-1 -n-2"), 60);
+	CHECK_XPATH_NUMBER(c, STR("7+-3"), 4);
+	CHECK_XPATH_NUMBER(c, STR("n-1+-n-2"), 60);
+	CHECK_XPATH_NUMBER(c, STR("7 - -3"), 10);
+	CHECK_XPATH_NUMBER(c, STR("n-1 - -n-2"), 84);
+	CHECK_XPATH_NUMBER(c, STR("-7 --3"), -4);
+	CHECK_XPATH_NUMBER(c, STR("-n-1 --n-2"), -60);
+
+	CHECK_XPATH_FAIL(STR("+7"));
+	CHECK_XPATH_FAIL(STR("7++3"));
+	CHECK_XPATH_FAIL(STR("7-+3"));
+
+	CHECK_XPATH_NUMBER(c, STR("6 div -2"), -3);
+	CHECK_XPATH_NUMBER(c, STR("n1 div n2"), 2.0 / 3.0);
+	CHECK_XPATH_NUMBER(c, STR("div div mod"), 2.5);
+	CHECK_XPATH_NUMBER(c, STR("div/@a div mod/@a"), 0.4);
+
+	CHECK_XPATH_BOOLEAN(c, STR("1 div -0 = 2 div -0"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("1 div -0 = 1 div 0"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("1 div -0 = -1 div 0"), true);
+
+#ifndef MSVC6_NAN_BUG
+	CHECK_XPATH_BOOLEAN(c, STR("0 div 0 >= 0"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("0 div 0 < 0"), false);
+#endif
+
+	CHECK_XPATH_NUMBER(c, STR("n1 mod n2"), 2);
+	CHECK_XPATH_NUMBER(c, STR("div mod mod"), 1);
+	CHECK_XPATH_NUMBER(c, STR("div/@a mod mod/@a"), 2);
+
+	CHECK_XPATH_BOOLEAN(c, STR("(5 mod 2 = 1) and (5 mod -2 = 1) and (-5 mod 2 = -1) and (-5 mod -2 = -1)"), true);
+}
+
+TEST(xpath_xalan_math_5)
+{
+	xml_node c;
+
+	CHECK_XPATH_NUMBER(c, STR("(((((('3'+5)*(3)+((('2')+2)*('1' - 6)))-('4' - '2'))+(-(4-6)))))"), 4);
+	CHECK_XPATH_NUMBER(c, STR("1*1*2*2*2*3*3*1*1*1*0.5*0.5"), 18);
+	CHECK_XPATH_NUMBER(c, STR("1440 div 2 div 2 div 6"), 60);
+	CHECK_XPATH_NUMBER(c, STR("1440 div 2 div 2 div 6 div 10"), 6);
+	CHECK_XPATH_NUMBER(c, STR("1440 div 2 div 2 div 6 div 10 div 3"), 2);
+	CHECK_XPATH_NUMBER(c, STR("(1*2*3*4*5*6)div 2 div 6 div 10 div 3"), 2);
+	CHECK_XPATH_NUMBER_NAN(c, STR("(2 + number('xxx'))"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("2 * -number('xxx')"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("2 - number('xxx')"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('xxx') - 3"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("2 div number('xxx')"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('xxx') div 3"));
+
+#ifndef __BORLANDC__ // BCC fmod does not propagate NaN correctly
+	CHECK_XPATH_NUMBER_NAN(c, STR("2 mod number('xxx')"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("number('xxx') mod 3"));
+#endif
+
+	CHECK_XPATH_NUMBER_NAN(c, STR("floor(number('xxx'))"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("ceiling(number('xxx'))"));
+	CHECK_XPATH_NUMBER_NAN(c, STR("round(number('xxx'))"));
+	CHECK_XPATH_NUMBER(c, STR("10+5+25+20+15+50+35+40"), 200);
+	CHECK_XPATH_NUMBER(c, STR("100-9-7-4-17-18-5"), 40);
+	CHECK_XPATH_NUMBER(c, STR("3*2+5*4-4*2-1"), 17);
+ CHECK_XPATH_NUMBER(c, STR("6*5-8*2+5*2"), 24);
+ CHECK_XPATH_NUMBER(c, STR("10*5-4*2+6*1 -3*3"), 39);
+
+ CHECK_XPATH_NUMBER(c, STR("(24 div 3 +2) div (40 div 8 -3)"), 5);
+ CHECK_XPATH_NUMBER(c, STR("80 div 2 + 12 div 2 - 4 div 2"), 44);
+ CHECK_XPATH_NUMBER(c, STR("70 div 10 - 18 div 6 + 10 div 2"), 9);
+
+ CHECK_XPATH_NUMBER(c, STR("48 mod 17 - 2 mod 9 + 13 mod 5"), 15);
+ CHECK_XPATH_NUMBER(c, STR("56 mod round(5*2+1.444) - 6 mod 4 + 7 mod 4"), 2);
+ CHECK_XPATH_NUMBER(c, STR("(77 mod 10 + 5 mod 8) mod 10"), 2);
+}
+
+TEST_XML(xpath_xalan_math_6, "<doc><n1>3</n1><n2>7</n2><n3>x</n3></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NUMBER(c, STR("-(n1|n2)"), -3);
+	CHECK_XPATH_NUMBER(c, STR("-(n2|n1)"), -3);
+	CHECK_XPATH_BOOLEAN(c, STR("contains(number(n1), 'NaN')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("contains(number(n3), 'NaN')"), true);
+}
+
+TEST_XML(xpath_xalan_math_7, "<doc><n1>3</n1><n2>7</n2><n3>x</n3></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NUMBER(c, STR("-(n1|n2)"), -3);
+	CHECK_XPATH_NUMBER(c, STR("-(n2|n1)"), -3);
+	CHECK_XPATH_BOOLEAN(c, STR("contains(number(n1), 'NaN')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("contains(number(n3), 'NaN')"), true);
+}
+
+TEST_XML(xpath_xalan_math_8, "<k>0.0004</k>")
+{
+	CHECK_XPATH_NUMBER(doc, STR("number(1.75)"), 1.75);
+	CHECK_XPATH_NUMBER(doc, STR("number(7 div 4)"), 1.75);
+	CHECK_XPATH_BOOLEAN(doc, STR("(number(1.75) = (7 div 4))"), true);
+	CHECK_XPATH_NUMBER(doc, STR("number(0.109375 * 16)"), 1.75);
+	CHECK_XPATH_BOOLEAN(doc, STR("(number(1.75) = (0.109375 * 16))"), true);
+	CHECK_XPATH_NUMBER(doc, STR("number(k)"), 0.0004);
+	CHECK_XPATH_NUMBER(doc, STR("number(4 div 10000)"), 0.0004);
+
+	// +0 works around extended precision in div on x86 (this is needed for some configurations in MinGW 3.4)
+	CHECK_XPATH_BOOLEAN(doc, STR("(number(k) = (4 div 10000 + 0))"), true); 
+	CHECK_XPATH_NUMBER(doc, STR("number(0.0001 * 4)"), 0.0004);
+	CHECK_XPATH_BOOLEAN(doc, STR("(number(k) = (0.0001 * 4))"), true);
+}
+
+TEST(xpath_xalan_math_9)
+{
+	xml_node c;
+
+	CHECK_XPATH_STRING(c, STR("string(number('0.0'))"), STR("0"));
+	CHECK_XPATH_STRING(c, STR("string(-1 * number('0.0'))"), STR("0"));
+
+	CHECK_XPATH_STRING(c, STR("string(number('0.4'))"), STR("0.4"));
+	CHECK_XPATH_STRING(c, STR("string(-1 * number('0.4'))"), STR("-0.4"));
+
+	CHECK_XPATH_STRING(c, STR("string(number('4.0'))"), STR("4"));
+	CHECK_XPATH_STRING(c, STR("string(-1 * number('4.0'))"), STR("-4"));
+
+	CHECK_XPATH_STRING(c, STR("string(number('0.04'))"), STR("0.04"));
+	CHECK_XPATH_STRING(c, STR("string(-1 * number('0.04'))"), STR("-0.04"));
+
+	CHECK_XPATH_STRING(c, STR("string(number('0.004'))"), STR("0.004"));
+	CHECK_XPATH_STRING(c, STR("string(-1 * number('0.004'))"), STR("-0.004"));
+
+	CHECK_XPATH_STRING(c, STR("string(number('0.0004'))"), STR("0.0004"));
+	CHECK_XPATH_STRING(c, STR("string(-1 * number('0.0004'))"), STR("-0.0004"));
+
+	CHECK_XPATH_STRING(c, STR("string(number('0.0000000000001'))"), STR("0.0000000000001"));
+	CHECK_XPATH_STRING(c, STR("string(-1 * number('0.0000000000001'))"), STR("-0.0000000000001"));
+
+	CHECK_XPATH_STRING(c, STR("string(number('0.0000000000000000000000000001'))"), STR("0.0000000000000000000000000001"));
+	CHECK_XPATH_STRING(c, STR("string(-1 * number('0.0000000000000000000000000001'))"), STR("-0.0000000000000000000000000001"));
+
+	CHECK_XPATH_STRING(c, STR("string(number('0.0000000000001000000000000001'))"), STR("0.0000000000001000000000000001"));
+	CHECK_XPATH_STRING(c, STR("string(-1 * number('0.0000000000001000000000000001'))"), STR("-0.0000000000001000000000000001"));
+
+	CHECK_XPATH_STRING(c, STR("string(number('0.0012'))"), STR("0.0012"));
+	CHECK_XPATH_STRING(c, STR("string(-1 * number('0.0012'))"), STR("-0.0012"));
+
+	CHECK_XPATH_STRING(c, STR("string(number('0.012'))"), STR("0.012"));
+	CHECK_XPATH_STRING(c, STR("string(-1 * number('0.012'))"), STR("-0.012"));
+}
+
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_xalan_2.cpp Added

@@ -0,0 +1,415 @@
+#define _CRT_SECURE_NO_WARNINGS
+
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+#include <string>
+#include <algorithm>
+
+TEST_XML(xpath_xalan_string_1, "<doc a='test'>ENCYCLOPEDIA</doc>")
+{
+	xml_node c;
+
+	CHECK_XPATH_NUMBER(c, STR("string-length('This is a test')"), 14);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('ENCYCLOPEDIA', 'ENCY')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('ENCYCLOPEDIA', 'CYCL')"), true);
+	CHECK_XPATH_STRING(c, STR("substring-before('1999/04/01', '/')"), STR("1999"));
+	CHECK_XPATH_STRING(c, STR("substring-after('1999/04/01', '/')"), STR("04/01"));
+	CHECK_XPATH_STRING(c, STR("normalize-space('\t\n\r\n ab\n cd\t\n\r\n ef\t\n\r ')"), STR("ab cd ef"));
+	CHECK_XPATH_STRING(c, STR("translate(\"bar\",\"abc\",\"ABC\")"), STR("BAr"));
+	CHECK_XPATH_STRING(c, STR("concat(\"x\",\"yz\")"), STR("xyz"));
+	CHECK_XPATH_STRING(c, STR("substring('1999/04/01', 1, 4)"), STR("1999"));
+	CHECK_XPATH_STRING(c, STR("substring('12345', 1.5, 2.6)"), STR("234"));
+	CHECK_XPATH_STRING(c, STR("substring('12345', 0, 3)"), STR("12"));
+	CHECK_XPATH_STRING(c, STR("substring('12345', 0 div 0, 3)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('12345', 1, 0 div 0)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('12345', -42, 1 div 0)"), STR("12345"));
+	CHECK_XPATH_STRING(c, STR("substring('12345', -1 div 0, 1 div 0)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring(foo, 12, 3)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("string(foo)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("string(0)"), STR("0"));
+	CHECK_XPATH_STRING(c, STR("string(2)"), STR("2"));
+	CHECK_XPATH_STRING(c, STR("string('test')"), STR("test"));
+	CHECK_XPATH_STRING(c, STR("string('')"), STR(""));
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('ENCYCLOPEDIA', 'EN')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('ENCYCLOPEDIA', 'en')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('ab', 'abc')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('abc', 'bc')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('abc', '')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('', '')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('', 'abc')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with('true()', 'tr')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("starts-with(foo, 'EN')"), false);
+	CHECK_XPATH_BOOLEAN(doc, STR("starts-with(doc, 'EN')"), true);
+	CHECK_XPATH_BOOLEAN(doc, STR("starts-with(doc/@a, 'EN')"), false);
+	CHECK_XPATH_BOOLEAN(doc, STR("starts-with(doc/@a, 'te')"), true);
+}
+
+TEST_XML_FLAGS(xpath_xalan_string_2, "<doc>\n <av>\n <a>\n b\n <c>c</c>\n <d>d</d>\n <e>e</e>\n </a>\n <v>\n <w>w</w>\n <x>x</x>\n <y>y</y>\n <z>z</z>\n </v>\n </av>\n</doc>", parse_default | parse_ws_pcdata)
+{
+	CHECK_XPATH_STRING(doc, STR("string(doc/av//*)"), STR("\n b\n c\n d\n e\n "));
+	CHECK_XPATH_STRING(doc, STR("normalize-space(string(doc/av//*))"), STR("b c d e"));
+	CHECK_XPATH_STRING(doc, STR("normalize-space('This is a test')"), STR("This is a test"));
+}
+
+TEST_XML(xpath_xalan_string_3, "<doc a='test'>ENCYCLOPEDIA</doc>")
+{
+	xml_node c;
+
+	CHECK_XPATH_BOOLEAN(c, STR("contains('ENCYCLOPEDIA', 'TEST')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('ENCYCLOPEDIA', 'CYCL')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('ENCYCLOPEDIA', 'cycl')"), false);
+	CHECK_XPATH_BOOLEAN(doc, STR("contains(concat(.,'BC'),concat('A','B','C'))"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('ab', 'abc')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('abc', 'bc')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('abc', 'bcd')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('abc', '')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('', '')"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('', 'abc')"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("contains('true()', 'e')"), true);
+	CHECK_XPATH_BOOLEAN(doc, STR("contains(., 'CYCL')"), true);
+	CHECK_XPATH_BOOLEAN(doc, STR("contains(., 'TEST')"), false);
+	CHECK_XPATH_BOOLEAN(doc, STR("contains(doc/@a, 'es')"), true);
+	CHECK_XPATH_BOOLEAN(doc, STR("contains(doc/@a, 'T')"), false);
+	CHECK_XPATH_STRING(c, STR("substring-before('ENCYCLOPEDIA', '/')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring-before('ENCYCLOPEDIA', 'C')"), STR("EN"));
+	CHECK_XPATH_STRING(c, STR("substring-before('ENCYCLOPEDIA', 'c')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring-before('ENCYCLOPEDIA', '')"), STR(""));
+	CHECK_XPATH_STRING(doc, STR("substring-before(., '/')"), STR(""));
+	CHECK_XPATH_STRING(doc, STR("substring-before(., 'C')"), STR("EN"));
+	CHECK_XPATH_STRING(doc, STR("substring-before(foo, '')"), STR(""));
+	CHECK_XPATH_STRING(doc, STR("substring-before(doc/@a, '/')"), STR(""));
+	CHECK_XPATH_STRING(doc, STR("substring-before(doc/@a, 'e')"), STR("t"));
+	CHECK_XPATH_STRING(doc, STR("substring-before(doc/@a, 't')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring-after('ENCYCLOPEDIA', '/')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring-after('ENCYCLOPEDIA', 'C')"), STR("YCLOPEDIA"));
+	CHECK_XPATH_STRING(c, STR("substring-after('ENCYCLOPEDIA', 'c')"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring-after('ENCYCLOPEDIA', '')"), STR("ENCYCLOPEDIA"));
+	CHECK_XPATH_STRING(doc, STR("substring-after(., '/')"), STR(""));
+	CHECK_XPATH_STRING(doc, STR("substring-after(., 'C')"), STR("YCLOPEDIA"));
+	CHECK_XPATH_STRING(doc, STR("substring-after(foo, '')"), STR(""));
+	CHECK_XPATH_STRING(doc, STR("substring-after(doc/@a, '/')"), STR(""));
+	CHECK_XPATH_STRING(doc, STR("substring-after(doc/@a, 'e')"), STR("st"));
+	CHECK_XPATH_STRING(doc, STR("substring-after(doc/@a, 't')"), STR("est"));
+	CHECK_XPATH_STRING(doc, STR("substring-after(doc/@a, 'st')"), STR(""));
+}
+
+TEST_XML(xpath_xalan_string_4, "<doc><a>a</a>b<c>c</c><d>d</d><e>ef</e><f attr='whatsup'>what's up</f></doc><cd><![CDATA[qua'lit\"y]]></cd>")
+{
+	xml_node c;
+
+	CHECK_XPATH_STRING(c, STR("translate('BAR','abc','ABC')"), STR("BAR"));
+	CHECK_XPATH_STRING(c, STR("translate('bar','RAB','xyz')"), STR("bar"));
+	CHECK_XPATH_STRING(c, STR("translate('BAR','Rab','TxX')"), STR("BAT"));
+	CHECK_XPATH_STRING(c, STR("translate('zzaaazzz','abcz','ABC')"), STR("AAA"));
+	CHECK_XPATH_STRING(c, STR("translate('ddaaadddd','abcd','ABCxy')"), STR("xxAAAxxxx"));
+	CHECK_XPATH_STRING(c, STR("concat('a','b','c','d','ef')"), STR("abcdef"));
+	CHECK_XPATH_STRING(c, STR("concat(a, b)"), STR(""));
+	CHECK_XPATH_STRING(doc.child(STR("doc")), STR("concat(a, b)"), STR("ab"));
+	CHECK_XPATH_STRING(doc.child(STR("doc")), STR("concat(a, b, c, d, e)"), STR("abcdef"));
+	CHECK_XPATH_STRING(c, STR("concat('cd','34')"), STR("cd34"));
+	CHECK_XPATH_STRING(c, STR("concat('cd',34)"), STR("cd34"));
+	CHECK_XPATH_STRING(c, STR("concat('bc',string(23))"), STR("bc23"));
+	CHECK_XPATH_STRING(c, STR("concat(a,34)"), STR("34"));
+	CHECK_XPATH_STRING(doc.child(STR("doc")), STR("concat(a,34)"), STR("a34"));
+	CHECK_XPATH_STRING(c, STR("concat(false(),'ly')"), STR("falsely"));
+	CHECK_XPATH_FAIL(STR("concat(/*)"));
+	CHECK_XPATH_STRING(doc.child(STR("doc")), STR("concat(/*, '')"), STR("abcdefwhat's up"));
+	CHECK_XPATH_STRING(doc.child(STR("doc")), STR("concat(/*, /*[@attr='whatsup'])"), STR("abcdefwhat's up"));
+	CHECK_XPATH_STRING(doc.child(STR("doc")), STR("concat(/*, //*[@attr='whatsup'])"), STR("abcdefwhat's upwhat's up"));
+	CHECK_XPATH_STRING(c, STR("substring('ENCYCLOPEDIA', 8, 3)"), STR("PED"));
+	CHECK_XPATH_STRING(c, STR("substring('ENCYCLOPEDIA', 8)"), STR("PEDIA"));
+	CHECK_XPATH_STRING(c, STR("substring('abcdefghijk',0 div 0, 5)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("substring('abcdefghijk',4, 6)"), STR("defghi"));
+	CHECK_XPATH_STRING(c, STR("substring('1999/04/01', 1, 0)"), STR(""));
+	CHECK_XPATH_STRING(c, STR("translate(normalize-space(' bar fly '), ' ', '_')"), STR("bar_fly"));
+	CHECK_XPATH_STRING(c, STR("translate('barter','abe','bao')"), STR("abrtor"));
+	CHECK_XPATH_STRING(c, STR("translate('barbarity', 'aeiouy', '******')"), STR("b*rb*r*t*"));
+	CHECK_XPATH_STRING(doc, STR("translate(cd, concat(\"aqu'\", '\"eos'), 'AQU-+EOS')"), STR("QUA-lit+y"));
+	CHECK_XPATH_STRING(c, STR("translate('quan+ti-ty', 'AQU-+EOS', concat(\"aqu'\", '\"eos'))"), STR("quan\"ti'ty"));
+}
+
+static const char_t* number_to_string_unsafe(int number)
+{
+	static char_t buffer[16];
+
+	// construct number in reverse
+	char_t* it = buffer;
+
+	while (number)
+	{
+		*it++ = static_cast<char_t>('0' + number % 10);
+		number /= 10;
+	}
+
+	// zero terminate
+	*it = 0;
+
+	// reverse to get final result
+	std::reverse(buffer, it);
+
+	return buffer;
+}
+
+TEST(xpath_xalan_string_5)
+{
+	const int count = 1000;
+
+	std::basic_string<char_t> query;
+	query.reserve(17 * count);
+
+	query += STR("concat(");
+
+	for (int i = 1; i < count; ++i)
+	{
+		query += STR("concat('t',");
+		query += number_to_string_unsafe(i);
+		query += STR("), ");
+	}
+
+	query += STR("'')");
+
+	std::basic_string<char_t> expected;
+	expected.reserve(4 * count);
+
+	for (int j = 1; j < count; ++j)
+	{
+		expected += STR("t");
+		expected += number_to_string_unsafe(j);
+	}
+
+	CHECK_XPATH_STRING(xml_node(), query.c_str(), expected.c_str());
+}
+
+TEST(xpath_xalan_string_6)
+{
+	xml_node c;
+
+	CHECK_XPATH_STRING(c, STR("string(1)"), STR("1"));
+	CHECK_XPATH_STRING(c, STR("string(12)"), STR("12"));
+	CHECK_XPATH_STRING(c, STR("string(123)"), STR("123"));
+	CHECK_XPATH_STRING(c, STR("string(1234)"), STR("1234"));
+	CHECK_XPATH_STRING(c, STR("string(12345)"), STR("12345"));
+	CHECK_XPATH_STRING(c, STR("string(123456)"), STR("123456"));
+	CHECK_XPATH_STRING(c, STR("string(1234567)"), STR("1234567"));
+	CHECK_XPATH_STRING(c, STR("string(12345678)"), STR("12345678"));
+	CHECK_XPATH_STRING(c, STR("string(123456789)"), STR("123456789"));
+	CHECK_XPATH_STRING(c, STR("string(1234567890)"), STR("1234567890"));
+	CHECK_XPATH_STRING(c, STR("string(12345678901)"), STR("12345678901"));
+	CHECK_XPATH_STRING(c, STR("string(123456789012)"), STR("123456789012"));
+	CHECK_XPATH_STRING(c, STR("string(1234567890123)"), STR("1234567890123"));
+	CHECK_XPATH_STRING(c, STR("string(12345678901234)"), STR("12345678901234"));
+	CHECK_XPATH_STRING(c, STR("string(123456789012345)"), STR("123456789012345"));
+	CHECK_XPATH_STRING(c, STR("string(1234567890123456)"), STR("1234567890123456"));
+	CHECK_XPATH_STRING(c, STR("string(-1)"), STR("-1"));
+	CHECK_XPATH_STRING(c, STR("string(-12)"), STR("-12"));
+	CHECK_XPATH_STRING(c, STR("string(-123)"), STR("-123"));
+	CHECK_XPATH_STRING(c, STR("string(-1234)"), STR("-1234"));
+	CHECK_XPATH_STRING(c, STR("string(-12345)"), STR("-12345"));
+	CHECK_XPATH_STRING(c, STR("string(-123456)"), STR("-123456"));
+	CHECK_XPATH_STRING(c, STR("string(-1234567)"), STR("-1234567"));
+	CHECK_XPATH_STRING(c, STR("string(-12345678)"), STR("-12345678"));
+	CHECK_XPATH_STRING(c, STR("string(-123456789)"), STR("-123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-1234567890)"), STR("-1234567890"));
+	CHECK_XPATH_STRING(c, STR("string(-12345678901)"), STR("-12345678901"));
+	CHECK_XPATH_STRING(c, STR("string(-123456789012)"), STR("-123456789012"));
+	CHECK_XPATH_STRING(c, STR("string(-1234567890123)"), STR("-1234567890123"));
+	CHECK_XPATH_STRING(c, STR("string(-12345678901234)"), STR("-12345678901234"));
+	CHECK_XPATH_STRING(c, STR("string(-123456789012345)"), STR("-123456789012345"));
+	CHECK_XPATH_STRING(c, STR("string(-1234567890123456)"), STR("-1234567890123456"));
+}
+
+#if 0 // $ this test requires round-to-nearest behavior in string->number conversion during parsing; atof gives us truncation
+TEST(xpath_xalan_string_6_rounding)
+{
+	xml_node c;
+
+	CHECK_XPATH_STRING(c, STR("string(12345678901234567)"), STR("12345678901234568"));
+	CHECK_XPATH_STRING(c, STR("string(123456789012345678)"), STR("123456789012345680"));
+	CHECK_XPATH_STRING(c, STR("string(-12345678901234567)"), STR("-12345678901234568"));
+	CHECK_XPATH_STRING(c, STR("string(-123456789012345678)"), STR("-123456789012345680"));
+}
+#endif
+
+TEST(xpath_xalan_string_7)
+{
+	xml_node c;
+
+	CHECK_XPATH_STRING(c, STR("string(.1)"), STR("0.1"));
+	CHECK_XPATH_STRING(c, STR("string(.01)"), STR("0.01"));
+	CHECK_XPATH_STRING(c, STR("string(.012)"), STR("0.012"));
+	CHECK_XPATH_STRING(c, STR("string(.0123)"), STR("0.0123"));
+	CHECK_XPATH_STRING(c, STR("string(.01234)"), STR("0.01234"));
+	CHECK_XPATH_STRING(c, STR("string(.012345)"), STR("0.012345"));
+	CHECK_XPATH_STRING(c, STR("string(.0123456)"), STR("0.0123456"));
+	CHECK_XPATH_STRING(c, STR("string(.01234567)"), STR("0.01234567"));
+	CHECK_XPATH_STRING(c, STR("string(.012345678)"), STR("0.012345678"));
+	CHECK_XPATH_STRING(c, STR("string(.0123456789)"), STR("0.0123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.10123456789)"), STR("0.10123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.101234567892)"), STR("0.101234567892"));
+	CHECK_XPATH_STRING(c, STR("string(.1012345678923)"), STR("0.1012345678923"));
+	CHECK_XPATH_STRING(c, STR("string(.10123456789234)"), STR("0.10123456789234"));
+	CHECK_XPATH_STRING(c, STR("string(.101234567892345)"), STR("0.101234567892345"));
+	CHECK_XPATH_STRING(c, STR("string(.1012345678923456)"), STR("0.1012345678923456"));
+	CHECK_XPATH_STRING(c, STR("string(-.1)"), STR("-0.1"));
+	CHECK_XPATH_STRING(c, STR("string(-.01)"), STR("-0.01"));
+	CHECK_XPATH_STRING(c, STR("string(-.012)"), STR("-0.012"));
+	CHECK_XPATH_STRING(c, STR("string(-.0123)"), STR("-0.0123"));
+	CHECK_XPATH_STRING(c, STR("string(-.01234)"), STR("-0.01234"));
+	CHECK_XPATH_STRING(c, STR("string(-.012345)"), STR("-0.012345"));
+	CHECK_XPATH_STRING(c, STR("string(-.0123456)"), STR("-0.0123456"));
+	CHECK_XPATH_STRING(c, STR("string(-.01234567)"), STR("-0.01234567"));
+	CHECK_XPATH_STRING(c, STR("string(-.012345678)"), STR("-0.012345678"));
+	CHECK_XPATH_STRING(c, STR("string(-.0123456789)"), STR("-0.0123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.10123456789)"), STR("-0.10123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.101234567892)"), STR("-0.101234567892"));
+	CHECK_XPATH_STRING(c, STR("string(-.1012345678923)"), STR("-0.1012345678923"));
+	CHECK_XPATH_STRING(c, STR("string(-.10123456789234)"), STR("-0.10123456789234"));
+	CHECK_XPATH_STRING(c, STR("string(-.101234567892345)"), STR("-0.101234567892345"));
+	CHECK_XPATH_STRING(c, STR("string(-.1012345678923456)"), STR("-0.1012345678923456"));
+}
+
+#if 0 // $ this test requires 16 decimal digits of mantissa in number->string conversion; we have 15 since only 15 is guaranteed, and 16 introduces 'garbage' digits in common cases like 0.4
+TEST(xpath_xalan_string_7_precision)
+{
+	xml_node c;
+
+	CHECK_XPATH_STRING(c, STR("string(.10123456789234567)"), STR("0.10123456789234567"));
+	CHECK_XPATH_STRING(c, STR("string(.101234567892345678)"), STR("0.10123456789234568"));
+	CHECK_XPATH_STRING(c, STR("string(.1012345678923456789)"), STR("0.10123456789234568"));
+	CHECK_XPATH_STRING(c, STR("string(.10123456789234567893)"), STR("0.10123456789234568"));
+	CHECK_XPATH_STRING(c, STR("string(-.10123456789234567)"), STR("-0.10123456789234567"));
+	CHECK_XPATH_STRING(c, STR("string(-.101234567892345678)"), STR("-0.10123456789234568"));
+	CHECK_XPATH_STRING(c, STR("string(-.1012345678923456789)"), STR("-0.10123456789234568"));
+	CHECK_XPATH_STRING(c, STR("string(-.10123456789234567893)"), STR("-0.10123456789234568"));
+}
+#endif
+
+TEST(xpath_xalan_string_8)
+{
+	xml_node c;
+
+	// $ originally all last digits were 5's; a fully compliant implementation should correctly convert those as well,
+	// however some of these failed because of atof truncation
+	CHECK_XPATH_STRING(c, STR("string(9.87654321012344)"), STR("9.87654321012344"));
+	CHECK_XPATH_STRING(c, STR("string(98.7654321012345)"), STR("98.7654321012345"));
+	CHECK_XPATH_STRING(c, STR("string(987.654321012345)"), STR("987.654321012345"));
+	CHECK_XPATH_STRING(c, STR("string(9876.54321012344)"), STR("9876.54321012344"));
+	CHECK_XPATH_STRING(c, STR("string(98765.4321012345)"), STR("98765.4321012345"));
+	CHECK_XPATH_STRING(c, STR("string(987654.321012345)"), STR("987654.321012345"));
+	CHECK_XPATH_STRING(c, STR("string(9876543.21012345)"), STR("9876543.21012345"));
+	CHECK_XPATH_STRING(c, STR("string(98765432.1012345)"), STR("98765432.1012345"));
+	CHECK_XPATH_STRING(c, STR("string(987654321.012345)"), STR("987654321.012345"));
+	CHECK_XPATH_STRING(c, STR("string(9876543210.12344)"), STR("9876543210.12344"));
+	CHECK_XPATH_STRING(c, STR("string(98765432101.2345)"), STR("98765432101.2345"));
+	CHECK_XPATH_STRING(c, STR("string(987654321012.345)"), STR("987654321012.345"));
+	CHECK_XPATH_STRING(c, STR("string(9876543210123.43)"), STR("9876543210123.43"));
+	CHECK_XPATH_STRING(c, STR("string(98765432101234.5)"), STR("98765432101234.5"));
+
+	CHECK_XPATH_STRING(c, STR("string(-9.87654321012344)"), STR("-9.87654321012344"));
+	CHECK_XPATH_STRING(c, STR("string(-98.7654321012345)"), STR("-98.7654321012345"));
+	CHECK_XPATH_STRING(c, STR("string(-987.654321012345)"), STR("-987.654321012345"));
+	CHECK_XPATH_STRING(c, STR("string(-9876.54321012344)"), STR("-9876.54321012344"));
+	CHECK_XPATH_STRING(c, STR("string(-98765.4321012345)"), STR("-98765.4321012345"));
+	CHECK_XPATH_STRING(c, STR("string(-987654.321012345)"), STR("-987654.321012345"));
+	CHECK_XPATH_STRING(c, STR("string(-9876543.21012345)"), STR("-9876543.21012345"));
+	CHECK_XPATH_STRING(c, STR("string(-98765432.1012345)"), STR("-98765432.1012345"));
+	CHECK_XPATH_STRING(c, STR("string(-987654321.012345)"), STR("-987654321.012345"));
+	CHECK_XPATH_STRING(c, STR("string(-9876543210.12344)"), STR("-9876543210.12344"));
+	CHECK_XPATH_STRING(c, STR("string(-98765432101.2345)"), STR("-98765432101.2345"));
+	CHECK_XPATH_STRING(c, STR("string(-987654321012.345)"), STR("-987654321012.345"));
+	CHECK_XPATH_STRING(c, STR("string(-9876543210123.43)"), STR("-9876543210123.43"));
+	CHECK_XPATH_STRING(c, STR("string(-98765432101234.5)"), STR("-98765432101234.5"));
+}
+
+TEST(xpath_xalan_string_9)
+{
+	xml_node c;
+
+	CHECK_XPATH_STRING(c, STR("string(.123456789)"), STR("0.123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0123456789)"), STR("0.0123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00123456789)"), STR("0.00123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000123456789)"), STR("0.000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000123456789)"), STR("0.0000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00000123456789)"), STR("0.00000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000000123456789)"), STR("0.000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000000123456789)"), STR("0.0000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00000000123456789)"), STR("0.00000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000000000123456789)"), STR("0.000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000000000123456789)"), STR("0.0000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00000000000123456789)"), STR("0.00000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000000000000123456789)"), STR("0.000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000000000000123456789)"), STR("0.0000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00000000000000123456789)"), STR("0.00000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000000000000000123456789)"), STR("0.000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000000000000000123456789)"), STR("0.0000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00000000000000000123456789)"), STR("0.00000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000000000000000000123456789)"), STR("0.000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000000000000000000123456789)"), STR("0.0000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00000000000000000000123456789)"), STR("0.00000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000000000000000000000123456789)"), STR("0.000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000000000000000000000123456789)"), STR("0.0000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00000000000000000000000123456789)"), STR("0.00000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000000000000000000000000123456789)"), STR("0.000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000000000000000000000000123456789)"), STR("0.0000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00000000000000000000000000123456789)"), STR("0.00000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000000000000000000000000000123456789)"), STR("0.000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000000000000000000000000000123456789)"), STR("0.0000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00000000000000000000000000000123456789)"), STR("0.00000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000000000000000000000000000000123456789)"), STR("0.000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000000000000000000000000000000123456789)"), STR("0.0000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00000000000000000000000000000000123456789)"), STR("0.00000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000000000000000000000000000000000123456789)"), STR("0.000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000000000000000000000000000000000123456789)"), STR("0.0000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00000000000000000000000000000000000123456789)"), STR("0.00000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000000000000000000000000000000000000123456789)"), STR("0.000000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000000000000000000000000000000000000123456789)"), STR("0.0000000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.00000000000000000000000000000000000000123456789)"), STR("0.00000000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.000000000000000000000000000000000000000123456789)"), STR("0.000000000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(.0000000000000000000000000000000000000000123456789)"), STR("0.0000000000000000000000000000000000000000123456789"));
+
+	CHECK_XPATH_STRING(c, STR("string(-.123456789)"), STR("-0.123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0123456789)"), STR("-0.0123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00123456789)"), STR("-0.00123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000123456789)"), STR("-0.000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000123456789)"), STR("-0.0000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00000123456789)"), STR("-0.00000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000000123456789)"), STR("-0.000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000000123456789)"), STR("-0.0000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00000000123456789)"), STR("-0.00000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000000000123456789)"), STR("-0.000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000000000123456789)"), STR("-0.0000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00000000000123456789)"), STR("-0.00000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000000000000123456789)"), STR("-0.000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000000000000123456789)"), STR("-0.0000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00000000000000123456789)"), STR("-0.00000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000000000000000123456789)"), STR("-0.000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000000000000000123456789)"), STR("-0.0000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00000000000000000123456789)"), STR("-0.00000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000000000000000000123456789)"), STR("-0.000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000000000000000000123456789)"), STR("-0.0000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00000000000000000000123456789)"), STR("-0.00000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000000000000000000000123456789)"), STR("-0.000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000000000000000000000123456789)"), STR("-0.0000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00000000000000000000000123456789)"), STR("-0.00000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000000000000000000000000123456789)"), STR("-0.000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000000000000000000000000123456789)"), STR("-0.0000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00000000000000000000000000123456789)"), STR("-0.00000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000000000000000000000000000123456789)"), STR("-0.000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000000000000000000000000000123456789)"), STR("-0.0000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00000000000000000000000000000123456789)"), STR("-0.00000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000000000000000000000000000000123456789)"), STR("-0.000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000000000000000000000000000000123456789)"), STR("-0.0000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00000000000000000000000000000000123456789)"), STR("-0.00000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000000000000000000000000000000000123456789)"), STR("-0.000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000000000000000000000000000000000123456789)"), STR("-0.0000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00000000000000000000000000000000000123456789)"), STR("-0.00000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000000000000000000000000000000000000123456789)"), STR("-0.000000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000000000000000000000000000000000000123456789)"), STR("-0.0000000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.00000000000000000000000000000000000000123456789)"), STR("-0.00000000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.000000000000000000000000000000000000000123456789)"), STR("-0.000000000000000000000000000000000000000123456789"));
+	CHECK_XPATH_STRING(c, STR("string(-.0000000000000000000000000000000000000000123456789)"), STR("-0.0000000000000000000000000000000000000000123456789"));
+}
+
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_xalan_3.cpp Added

@@ -0,0 +1,319 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+TEST_XML(xpath_xalan_axes_1, "<far-north><north-north-west1/><north-north-west2/><north><near-north><far-west/><west/><near-west/><center center-attr-1='c1' center-attr-2='c2' center-attr-3='c3'><near-south-west/><near-south><south><far-south/></south></near-south><near-south-east/></center><near-east/><east/><far-east/></near-north></north><north-north-east1/><north-north-east2/></far-north>")
+{
+	xml_node center = doc.select_node(STR("//center")).node();
+
+	CHECK_XPATH_NODESET(center, STR("self::*[near-south]")) % 10;
+	CHECK_XPATH_NODESET(center, STR("self::*[@center-attr-2]")) % 10;
+	CHECK_XPATH_NODESET(center, STR("preceding-sibling::*")) % 9 % 8 % 7;
+	CHECK_XPATH_NODESET(center, STR("preceding-sibling::*/following-sibling::*")) % 8 % 9 % 10 % 19 % 20 % 21;
+	CHECK_XPATH_NODESET(center, STR("preceding-sibling::*[2]/following-sibling::*")) % 9 % 10 % 19 % 20 % 21;
+	CHECK_XPATH_NODESET(center, STR("preceding-sibling::*[2]/following-sibling::*[4]")) % 20;
+	CHECK_XPATH_NODESET(center, STR("preceding-sibling::*[2]/following-sibling::*[4]/preceding-sibling::*[5]/following-sibling::*[4]/following-sibling::*[2]")) % 21;
+	CHECK_XPATH_NODESET(center, STR("following-sibling::*")) % 19 % 20 % 21;
+	CHECK_XPATH_NODESET(center, STR("following-sibling::*/preceding-sibling::*")) % 7 % 8 % 9 % 10 % 19 % 20;
+	CHECK_XPATH_NODESET(center, STR("following-sibling::*[2]/preceding-sibling::*")) % 19 % 10 % 9 % 8 % 7;
+	CHECK_XPATH_NODESET(center, STR("following-sibling::*[2]/preceding-sibling::*[4]")) % 8;
+	CHECK_XPATH_NODESET(center, STR("following-sibling::*[2]/preceding-sibling::*[4]/following-sibling::*[5]/preceding-sibling::*[4]/preceding-sibling::*[2]")) % 7;
+	CHECK_XPATH_NODESET(center, STR("following::*[4]/../*[2]")) % 4;
+	CHECK_XPATH_NODESET(center, STR("preceding::*[2]/../following::*")) % 22 % 23;
+	CHECK_XPATH_NODESET(center, STR("preceding::*[2]/../descendant::*[10]/following-sibling::east")) % 20;
+	CHECK_XPATH_NODESET(center, STR("//*")) % 2 % 3 % 4 % 5 % 6 % 7 % 8 % 9 % 10 % 14 % 15 % 16 % 17 % 18 % 19 % 20 % 21 % 22 % 23;
+	CHECK_XPATH_NODESET(center, STR("//ancestor::*")) % 2 % 5 % 6 % 10 % 15 % 16;
+	CHECK_XPATH_NODESET(center, STR("//*[count(ancestor::*) >= 2]/../parent::*")) % 2 % 5 % 6 % 10 % 15;
+	CHECK_XPATH_NODESET(center, STR("//*[count(./*/*) > 0]")) % 2 % 5 % 6 % 10 % 15;
+	CHECK_XPATH_NODESET(center, STR("@*/ancestor::*")) % 2 % 5 % 6 % 10;
+	CHECK_XPATH_NODESET(center, STR("@*/following::*")) % 14 % 15 % 16 % 17 % 18 % 19 % 20 % 21 % 22 % 23;
+	CHECK_XPATH_NODESET(center, STR("@*/preceding::*")) % 3 % 4 % 7 % 8 % 9;
+	CHECK_XPATH_NODESET(center, STR("preceding-sibling::*|following-sibling::*")) % 7 % 8 % 9 % 19 % 20 % 21;
+	CHECK_XPATH_NODESET(center, STR("(preceding-sibling::*|following-sibling::*)/ancestor::*[last()]/*[last()]")) % 23;
+	CHECK_XPATH_NODESET(center, STR(".//near-south/preceding-sibling::*|following-sibling::east/ancestor-or-self::*[2]")) % 6 % 14;
+}
+
+TEST_XML_FLAGS(xpath_xalan_axes_2, "<far-north> Level-1<north-north-west1/><north-north-west2/> Level-2<?a-pi pi-2?><north> Level-3<?a-pi pi-3?><near-north><far-west/><west/><near-west/> Level-4<?a-pi pi-4?><center center-attr-1='c1' center-attr-2='c2' center-attr-3='c3'><near-south-west/> Level-5<?a-pi pi-5?><near-south> Level-6<?a-pi pi-6?><south attr1='First' attr2='Last'> <far-south/></south></near-south><near-south-east/></center><near-east/><east/><far-east/></near-north></north><north-north-east1/><north-north-east2/></far-north>", parse_default | parse_comments | parse_pi)
+{
+	xml_node center = doc.select_node(STR("//center")).node();
+
+	CHECK_XPATH_NODESET(center, STR("@*")) % 21 % 22 % 23;
+	CHECK_XPATH_NODESET(center, STR("@*/child::*"));
+	CHECK_XPATH_NODESET(center, STR("@*/descendant::node()"));
+	CHECK_XPATH_NODESET(center, STR("@*/parent::node()")) % 20;
+	CHECK_XPATH_NODESET(center, STR("@*/ancestor::node()")) % 1 % 2 % 9 % 13 % 20;
+	CHECK_XPATH_NODESET(center, STR("@*/self::node()")) % 21 % 22 % 23;
+	CHECK_XPATH_NODESET(center, STR("@*/.")) % 21 % 22 % 23;
+	CHECK_XPATH_NODESET(center, STR("@*/descendant-or-self::node()")) % 21 % 22 % 23;
+	CHECK_XPATH_NODESET(center, STR("@*/ancestor-or-self::node()")) % 1 % 2 % 9 % 13 % 20 % 21 % 22 % 23;
+	CHECK_XPATH_NODESET(center, STR("@*/ancestor-or-self::*")) % 2 % 9 % 13 % 20;
+	CHECK_XPATH_NODESET(center, STR("@*/preceding-sibling::node()"));
+	CHECK_XPATH_NODESET(center, STR("@*/following-sibling::*"));
+	CHECK_XPATH_NODESET(center, STR("@*/ancestor::*/near-north/*[4]/@*/preceding::*")) % 4 % 5 % 14 % 15 % 16;
+	CHECK_XPATH_NODESET(center, STR("@*/ancestor::*/near-north/*[4]/@*/preceding::comment()")) % 6 % 10 % 17;
+	CHECK_XPATH_NODESET(center, STR("@*/ancestor::*/near-north/*[4]/@*/preceding::text()")) % 3 % 7 % 11 % 18;
+	CHECK_XPATH_NODESET(center, STR("@*/ancestor::*/near-north/*[4]/@*/preceding::processing-instruction()")) % 8 % 12 % 19;
+	CHECK_XPATH_NODESET(center, STR("@*/following::comment()")) % 25 % 29;
+	CHECK_XPATH_NODESET(center, STR("@*/following::processing-instruction()")) % 27 % 31;
+	CHECK_XPATH_NODESET(center, STR("@*/following::text()")) % 26 % 30;
+	CHECK_XPATH_NODESET(center, STR("@*/ancestor::*/near-north/*[4]/@*/preceding::node()")) % 3 % 4 % 5 % 6 % 7 % 8 % 10 % 11 % 12 % 14 % 15 % 16 % 17 % 18 % 19;
+	CHECK_XPATH_NODESET(center, STR("@*/ancestor::*/near-north/*[4]/@*/following::node()")) % 24 % 25 % 26 % 27 % 28 % 29 % 30 % 31 % 32 % 35 % 36 % 37 % 38 % 39 % 40 % 41;
+
+	CHECK_XPATH_NODESET(center, STR("(//comment())[1]/..")) % 2;
+	CHECK_XPATH_NODESET(center, STR("(//attribute::*)[1]/../..")) % 13;
+}
+
+TEST_XML(xpath_xalan_axes_3, "<far-north><north><near-north><far-west/><west/><near-west/><center><near-south><south><far-south/></south></near-south></center><near-east/><east/><far-east/></near-north></north></far-north>")
+{
+	xml_node center = doc.select_node(STR("//center")).node();
+
+	CHECK_XPATH_NODESET(center, STR("ancestor-or-self::*")) % 8 % 4 % 3 % 2;
+	CHECK_XPATH_NODESET(center, STR("ancestor::*[3]")) % 2;
+	CHECK_XPATH_NODESET(center, STR("ancestor-or-self::*[1]")) % 8;
+	CHECK_XPATH_NODESET(center, STR("@*[2]"));
+	CHECK_XPATH_NODESET(center, STR("child::*[2]"));
+	CHECK_XPATH_NODESET(center, STR("child::near-south-west"));
+	CHECK_XPATH_NODESET(center, STR("descendant::*[3]")) % 11;
+	CHECK_XPATH_NODESET(center, STR("descendant::far-south")) % 11;
+	CHECK_XPATH_NODESET(center, STR("descendant-or-self::*[3]")) % 10;
+	CHECK_XPATH_NODESET(center, STR("descendant-or-self::far-south")) % 11;
+	CHECK_XPATH_NODESET(center, STR("descendant-or-self::center")) % 8;
+	CHECK_XPATH_NODESET(center, STR("following::*[4]"));
+	CHECK_XPATH_NODESET(center, STR("following::out-yonder-east"));
+	CHECK_XPATH_NODESET(center, STR("preceding::*[4]"));
+	CHECK_XPATH_NODESET(center, STR("preceding::out-yonder-west"));
+	CHECK_XPATH_NODESET(center, STR("following-sibling::*[2]")) % 13;
+	CHECK_XPATH_NODESET(center, STR("following-sibling::east")) % 13;
+	CHECK_XPATH_NODESET(center, STR("preceding-sibling::*[2]")) % 6;
+	CHECK_XPATH_NODESET(center, STR("preceding-sibling::west")) % 6;
+	CHECK_XPATH_NODESET(center, STR("parent::near-north")) % 4;
+	CHECK_XPATH_NODESET(center, STR("parent::*[1]")) % 4;
+	CHECK_XPATH_NODESET(center, STR("parent::foo"));
+	CHECK_XPATH_NODESET(center, STR("..")) % 4;
+	CHECK_XPATH_NODESET(center, STR("self::center")) % 8;
+	CHECK_XPATH_NODESET(center, STR("self::*[1]")) % 8;
+	CHECK_XPATH_NODESET(center, STR("self::foo"));
+	CHECK_XPATH_NODESET(center, STR(".")) % 8;
+	CHECK_XPATH_NODESET(center, STR("/far-north/north/near-north/center/ancestor-or-self::*")) % 8 % 4 % 3 % 2;
+}
+
+TEST_XML(xpath_xalan_axes_4, "<far-north><north><near-north><far-west/><west/><near-west/><center><near-south><south><far-south/></south></near-south></center><near-east/><east/><far-east/></near-north></north></far-north>")
+{
+	xml_node north = doc.select_node(STR("//north")).node();
+
+	CHECK_XPATH_STRING(north, STR("name(/descendant-or-self::north)"), STR("north"));
+	CHECK_XPATH_STRING(north, STR("name(/descendant::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(self::node()/descendant-or-self::north)"), STR("north"));
+	CHECK_XPATH_STRING(north, STR("name(self::node()/descendant::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::north/descendant-or-self::north)"), STR("north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::north/descendant::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::north/child::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant::near-north/descendant-or-self::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant::near-north/descendant::far-west)"), STR("far-west"));
+
+	CHECK_XPATH_STRING(north, STR("name(/descendant-or-self::north/descendant-or-self::north)"), STR("north"));
+	CHECK_XPATH_STRING(north, STR("name(/descendant-or-self::north/child::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(/descendant::near-north/descendant-or-self::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(self::node()/descendant-or-self::north/descendant-or-self::north)"), STR("north"));
+	CHECK_XPATH_STRING(north, STR("name(self::node()/descendant-or-self::north/child::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(self::node()/descendant::near-north/descendant-or-self::far-west)"), STR("far-west"));
+	CHECK_XPATH_STRING(north, STR("name(self::node()/descendant::near-north/child::far-west)"), STR("far-west"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::north/descendant-or-self::north/descendant-or-self::north)"), STR("north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::north/descendant-or-self::north/child::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::north/descendant::near-north/descendant-or-self::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::north/descendant::near-north/child::far-west)"), STR("far-west"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::north/child::near-north/descendant-or-self::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::north/child::near-north/child::far-west)"), STR("far-west"));
+	CHECK_XPATH_STRING(north, STR("name(descendant::near-north/descendant-or-self::near-north/descendant-or-self::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant::near-north/descendant-or-self::near-north/child::far-west)"), STR("far-west"));
+	CHECK_XPATH_STRING(north, STR("name(descendant::near-north/descendant::far-west/descendant-or-self::far-west)"), STR("far-west"));
+
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::node()/descendant-or-self::north)"), STR("north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::node()/descendant::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::node()/child::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant::node()/descendant-or-self::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant::node()/descendant::far-west)"), STR("far-west"));
+
+	CHECK_XPATH_STRING(north, STR("name(/descendant-or-self::node()/descendant-or-self::north)"), STR("north"));
+	CHECK_XPATH_STRING(north, STR("name(/descendant-or-self::node()/child::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(/descendant::node()/descendant-or-self::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(self::node()/descendant-or-self::node()/descendant-or-self::north)"), STR("north"));
+	CHECK_XPATH_STRING(north, STR("name(self::node()/descendant-or-self::node()/child::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(self::node()/descendant::node()/descendant-or-self::far-west)"), STR("far-west"));
+	CHECK_XPATH_STRING(north, STR("name(self::node()/descendant::node()/child::far-west)"), STR("far-west"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::node()/descendant-or-self::node()/descendant-or-self::north)"), STR("north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::node()/descendant-or-self::node()/child::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::node()/descendant::node()/descendant-or-self::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::node()/descendant::node()/child::far-west)"), STR("far-west"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::node()/child::node()/descendant-or-self::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant-or-self::node()/child::node()/child::far-west)"), STR("far-west"));
+	CHECK_XPATH_STRING(north, STR("name(descendant::node()/descendant-or-self::node()/descendant-or-self::near-north)"), STR("near-north"));
+	CHECK_XPATH_STRING(north, STR("name(descendant::node()/descendant-or-self::node()/child::far-west)"), STR("far-west"));
+	CHECK_XPATH_STRING(north, STR("name(descendant::node()/descendant::node()/descendant-or-self::far-west)"), STR("far-west"));
+}
+
+TEST_XML_FLAGS(xpath_xalan_axes_5, "<text>text</text><comment></comment><pi><?pi?></pi>", parse_default | parse_comments | parse_pi)
+{
+	CHECK_XPATH_NODESET(doc, STR("text/self::text()"));
+	CHECK_XPATH_NODESET(doc, STR("comment/self::comment()"));
+	CHECK_XPATH_NODESET(doc, STR("pi/self::processing-instruction()"));
+}
+
+TEST_XML(xpath_xalan_axes_6, "<doc><T>Test for source tree depth</T><a><T>A</T><T>B</T><c><T>C</T><d><T>D</T><e><T>E</T><f><T>F</T><g><T>G</T><h><T>H</T><T>I</T><j><T>J</T><k><T>K</T><l><T>L</T><m><T>M</T><n><T>N</T><o><T>O</T></o></n></m></l></k></j></h></g></f></e></d></c></a></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//T")) % 3 % 6 % 9 % 12 % 15 % 18 % 21 % 24 % 27 % 30 % 33 % 36 % 39 % 42 % 45 % 48;
+}
+
+TEST_XML(xpath_xalan_axes_7, "<far-north><north><near-north><far-west/><west/><near-west/><center center-attr-1='c1' center-attr-2='c2' center-attr-3='c3'><near-south><south><far-south/></south></near-south></center><near-east/><east/><far-east/></near-north></north></far-north>")
+{
+	xml_node center = doc.select_node(STR("//center")).node();
+
+	CHECK_XPATH_NODESET(center, STR("attribute::*[2]")) % 10;
+	CHECK_XPATH_NODESET(center, STR("@*")) % 9 % 10 % 11;
+	CHECK_XPATH_NODESET(center, STR("child::*/child::*")) % 13;
+	CHECK_XPATH_NODESET(center, STR("child::*/descendant::*")) % 13 % 14;
+	CHECK_XPATH_NODESET(center, STR("descendant::*/child::*")) % 13 % 14;
+}
+
+TEST_XML(xpath_xalan_axes_8, "<far-north><north><near-north><far-west/><west/><near-west/><center center-attr-1='c1' center-attr-2='c2' center-attr-3='c3'><near-south-east/><near-south><south><far-south/></south></near-south><near-south-west/></center><near-east/><east/><far-east/></near-north></north></far-north>")
+{
+	xml_node near_north = doc.select_node(STR("//near-north")).node();
+
+	CHECK_XPATH_NODESET(near_north, STR("center//child::*")) % 12 % 13 % 14 % 15 % 16;
+	CHECK_XPATH_NODESET(near_north, STR("center//descendant::*")) % 12 % 13 % 14 % 15 % 16;
+	CHECK_XPATH_NODESET(near_north, STR("center/descendant::*")) % 12 % 13 % 14 % 15 % 16;
+	CHECK_XPATH_NODESET(near_north, STR("center/child::*")) % 12 % 13 % 16;
+	CHECK_XPATH_NODESET(near_north, STR("center//*")) % 12 % 13 % 14 % 15 % 16;
+}
+
+TEST_XML(xpath_xalan_axes_9, "<doc><foo att1='c'><foo att1='b'><foo att1='a'><baz/></foo></foo></foo><bar/></doc>")
+{
+	xml_node baz = doc.select_node(STR("//baz")).node();
+
+	CHECK_XPATH_NODESET(baz, STR("ancestor-or-self::*[@att1][1]/@att1")) % 8;
+ CHECK_XPATH_NODESET(baz, STR("(ancestor-or-self::*)[@att1][1]/@att1")) % 4;
+
+	CHECK_XPATH_NODESET(baz, STR("ancestor::foo[1]/@att1")) % 8;
+	CHECK_XPATH_NODESET(baz, STR("(ancestor::foo[1])/@att1")) % 8;
+	CHECK_XPATH_NODESET(baz, STR("(ancestor::foo)[1]/@att1")) % 4;
+	CHECK_XPATH_NODESET(baz, STR("((ancestor::foo))[1]/@att1")) % 4;
+	CHECK_XPATH_NODESET(baz, STR("(((ancestor::foo)[1])/@att1)")) % 4;
+
+	xml_node bar = doc.child(STR("doc")).child(STR("bar"));
+
+ CHECK_XPATH_NODESET(bar, STR("preceding::foo[1]/@att1")) % 8;
+	CHECK_XPATH_NODESET(bar, STR("(preceding::foo)[1]/@att1")) % 4;
+}
+
+TEST_XML(xpath_xalan_axes_10, "<doc><foo att1='c'/><foo att1='b'/><foo att1='a'/><baz/></doc>")
+{
+	xml_node baz = doc.child(STR("doc")).child(STR("baz"));
+
+ CHECK_XPATH_NODESET(baz, STR("preceding-sibling::foo[1]/@att1")) % 8;
+	CHECK_XPATH_NODESET(baz, STR("(preceding-sibling::foo)[1]/@att1")) % 4;
+}
+
+TEST_XML(xpath_xalan_axes_11, "<chapter title='A' x='0'><section title='A1' x='1'><subsection title='A1a' x='2'>hello</subsection><subsection title='A1b'>ahoy</subsection></section><section title='A2'><subsection title='A2a'>goodbye</subsection><subsection title='A2b'>sayonara</subsection><subsection title='A2c'>adios</subsection></section><section title='A3'><subsection title='A3a'>aloha</subsection><subsection title='A3b'><footnote x='3'>A3b-1</footnote><footnote>A3b-2</footnote></subsection><subsection title='A3c'>shalom</subsection></section></chapter>")
+{
+	xml_node chapter = doc.child(STR("chapter"));
+
+ CHECK_XPATH_NUMBER(doc, STR("count(//@*)"), 16);
+ CHECK_XPATH_NUMBER(doc, STR("count(//@title)"), 12);
+ CHECK_XPATH_NUMBER(doc, STR("count(//section//@*)"), 14);
+ CHECK_XPATH_NUMBER(doc, STR("count(//section//@title)"), 11);
+
+	CHECK_XPATH_NUMBER(chapter, STR("count(.//@*)"), 16);
+	CHECK_XPATH_NUMBER(chapter, STR("count(.//@title)"), 12);
+	CHECK_XPATH_NUMBER(chapter, STR("count(section[1]//@*)"), 5);
+	CHECK_XPATH_NUMBER(chapter, STR("count(section[1]//@title)"), 3);
+	CHECK_XPATH_NUMBER(chapter, STR("count(section[2]//@*)"), 4);
+	CHECK_XPATH_NUMBER(chapter, STR("count(section[2]//@title)"), 4);
+	CHECK_XPATH_NUMBER(chapter, STR("count(section[3]//@*)"), 5);
+	CHECK_XPATH_NUMBER(chapter, STR("count(section[3]//@title)"), 4);
+}
+
+TEST_XML_FLAGS(xpath_xalan_axes_12, "<far-north><north>north-text1<near-north><far-west/><west></west><near-west/><center>center-text1<near-south><south>south-text</south></near-south><near-south-west/>center-text2</center><near-east/><east></east><far-east/></near-north>north-text2</north></far-north>", parse_default | parse_comments)
+{
+	CHECK_XPATH_NODESET(doc, STR("/descendant::*")) % 2 % 3 % 5 % 6 % 7 % 9 % 10 % 12 % 13 % 15 % 17 % 18 % 20;
+	CHECK_XPATH_NODESET(doc, STR("far-north/..//*")) % 2 % 3 % 5 % 6 % 7 % 9 % 10 % 12 % 13 % 15 % 17 % 18 % 20;
+	CHECK_XPATH_NODESET(doc, STR("far-north/north/..//*")) % 3 % 5 % 6 % 7 % 9 % 10 % 12 % 13 % 15 % 17 % 18 % 20;
+	CHECK_XPATH_NODESET(doc, STR("far-north/north-yonder/..//*"));
+}
+
+TEST_XML(xpath_xalan_axes_13, "<doc att1='e'><foo att1='d'><foo att1='c'><foo att1='b'><baz att1='a'/></foo></foo></foo></doc>")
+{
+	xml_node d = doc.child(STR("doc"));
+	xml_node baz = doc.select_node(STR("//baz")).node();
+
+	CHECK_XPATH_NUMBER(d, STR("count(descendant-or-self::*/@att1)"), 5);
+	CHECK_XPATH_NODESET(d, STR("descendant-or-self::*/@att1[last()]")) % 3 % 5 % 7 % 9 % 11;
+	CHECK_XPATH_STRING(d, STR("string(descendant-or-self::*/@att1[last()])"), STR("e"));
+	CHECK_XPATH_NODESET(d, STR("descendant-or-self::*[last()]/@att1")) % 11;
+	CHECK_XPATH_NODESET(d, STR("(descendant-or-self::*/@att1)[last()]")) % 11;
+
+	CHECK_XPATH_NUMBER(baz, STR("count(ancestor-or-self::*/@att1)"), 5);
+ CHECK_XPATH_NODESET(baz, STR("ancestor-or-self::*/@att1[last()]")) % 3 % 5 % 7 % 9 % 11;
+ CHECK_XPATH_STRING(baz, STR("string(ancestor-or-self::*/@att1[last()])"), STR("e"));
+ CHECK_XPATH_NODESET(baz, STR("(ancestor-or-self::*)/@att1[last()]")) % 3 % 5 % 7 % 9 % 11;
+ CHECK_XPATH_STRING(baz, STR("string((ancestor-or-self::*)/@att1[last()])"), STR("e"));
+ CHECK_XPATH_NODESET(baz, STR("(ancestor-or-self::*/@att1)[last()]")) % 11;
+ CHECK_XPATH_NODESET(baz, STR("(ancestor::*|self::*)/@att1[last()]")) % 3 % 5 % 7 % 9 % 11;
+ CHECK_XPATH_STRING(baz, STR("string((ancestor::*|self::*)/@att1[last()])"), STR("e"));
+	CHECK_XPATH_NODESET(baz, STR("((ancestor::*|self::*)/@att1)[last()]")) % 11;
+}
+
+TEST_XML_FLAGS(xpath_xalan_axes_14, "<doc><n a='v'/><?pi?>text<center/>text<?pi?><n a='v'/></doc>", parse_default | parse_comments | parse_pi)
+{
+	CHECK_XPATH_NODESET(doc, STR("//center/preceding::node()")) % 7 % 6 % 5 % 3;
+	CHECK_XPATH_NODESET(doc, STR("//center/following::node()")) % 9 % 10 % 11 % 12;
+}
+
+TEST_XML(xpath_xalan_axes_15, "<doc><foo new='true'><baz>is new</baz></foo><foo new='true'>xyz<baz>is new but has text</baz></foo><foo new='false'><baz>is not new</baz></foo></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//text()[ancestor::*[@new='true'][not(text())]]")) % 6;
+	CHECK_XPATH_NODESET(doc, STR("//text()[ancestor::*[2][@new]]")) % 6 % 11 % 15;
+
+	xml_node foo = doc.child(STR("doc")).child(STR("foo")).child(STR("baz")).first_child();
+
+	CHECK_XPATH_STRING(foo, STR("name(ancestor::*[3])"), STR("doc"));
+	CHECK_XPATH_STRING(foo, STR("name(ancestor::*[2])"), STR("foo"));
+	CHECK_XPATH_STRING(foo, STR("name(ancestor::*[1])"), STR("baz"));
+}
+
+TEST_XML(xpath_xalan_axes_16, "<doc><child><grandchild><greatgrandchild/></grandchild><grandchild><greatgrandchild><greatgreatgreatgrandchild/></greatgrandchild><greatgrandchild/></grandchild></child><child><grandchild><greatgrandchild/><greatgrandchild/><greatgrandchild/></grandchild></child><child><grandchild><greatgrandchild/></grandchild></child><child><grandchild/></child><child><grandchild/><grandchild/></child><child/></doc>")
+{
+	xml_node c1 = doc.child(STR("doc")).child(STR("child")), c2 = c1.next_sibling(), c3 = c2.next_sibling(), c4 = c3.next_sibling(), c5 = c4.next_sibling(), c6 = c5.next_sibling();
+
+	CHECK_XPATH_STRING(c1.first_child(), STR("concat(count(descendant::*), ',', count(descendant-or-self::*))"), STR("1,2"));
+	CHECK_XPATH_STRING(c1.last_child(), STR("concat(count(descendant::*), ',', count(descendant-or-self::*))"), STR("3,4"));
+
+	CHECK_XPATH_STRING(c2.first_child(), STR("concat(count(descendant::*), ',', count(descendant-or-self::*))"), STR("3,4"));
+
+	CHECK_XPATH_STRING(c3.first_child(), STR("concat(count(descendant::*), ',', count(descendant-or-self::*))"), STR("1,2"));
+
+	CHECK_XPATH_STRING(c4.first_child(), STR("concat(count(descendant::*), ',', count(descendant-or-self::*))"), STR("0,1"));
+
+	CHECK_XPATH_STRING(c5.first_child(), STR("concat(count(descendant::*), ',', count(descendant-or-self::*))"), STR("0,1"));
+	CHECK_XPATH_STRING(c5.last_child(), STR("concat(count(descendant::*), ',', count(descendant-or-self::*))"), STR("0,1"));
+
+	CHECK_XPATH_STRING(c6, STR("concat(count(descendant::*), ',', count(descendant-or-self::*))"), STR("0,1"));
+
+	CHECK_XPATH_STRING(xml_node(), STR("concat(count(descendant::*), ',', count(descendant-or-self::*))"), STR("0,0"));
+}
+
+TEST_XML(xpath_xalan_axes_17, "<doc><a><asub><asubsub><yy/></asubsub></asub></a><bsub><xx><xxchild/></xx></bsub><xx>here</xx><d><dsub><dsubsub><xx/></dsubsub></dsub></d><e><esub><xx><xxchild/></xx></esub><esubsib><sibchild/></esubsib></e><xx><childofxx/></xx><xx><xxsub><xxsubsub/></xxsub></xx></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//xx/descendant::*")) % 10 % 20 % 24 % 26 % 27;
+}
+
+TEST_XML(xpath_xalan_axes_18, "<north><center center-attr='here'><south/></center></north>")
+{
+	xml_node center = doc.child(STR("north")).child(STR("center"));
+
+	CHECK_XPATH_NODESET(center, STR("@*/self::node()")) % 4;
+	CHECK_XPATH_NODESET(center, STR("@*/self::*")); // * tests for principal node type
+	CHECK_XPATH_NODESET(center, STR("@*/self::text()"));
+	CHECK_XPATH_NODESET(center, STR("@*/self::center-attr")); // * tests for principal node type
+}
+
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_xalan_4.cpp Added

@@ -0,0 +1,298 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+TEST_XML(xpath_xalan_position_1, "<doc><a>1</a><a>2</a><a>3</a><a>4</a></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_BOOLEAN(c, STR("position()=1"), true);
+	CHECK_XPATH_NODESET(c, STR("*[position()=4]")) % 9;
+}
+
+TEST_XML_FLAGS(xpath_xalan_position_2, "<doc><a test='true'><num>1</num></a><a><num>1191</num></a><a><num>263</num></a><a test='true'><num>2</num></a><a><num>827</num></a><a><num>256</num></a><a test='true'><num>3</num></a><a test='true'><num>4<x/>5</num></a><?pi?><?pi?></doc>", parse_default | parse_comments | parse_pi)
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NODESET(c, STR("*[@test and position()=8]")) % 27;
+	CHECK_XPATH_NODESET(c, STR("*[@test][position()=4]/num")) % 29;
+	CHECK_XPATH_NUMBER(c, STR("count(*)"), 8);
+	CHECK_XPATH_NODESET(c, STR("*[last()=position()]")) % 27;
+	CHECK_XPATH_NODESET(c, STR("a[position()=2]")) % 7;
+	CHECK_XPATH_NODESET(c, STR("a[3]/../a[position()=4]/num/../@test")) % 14;
+	CHECK_XPATH_BOOLEAN(c, STR("not(position()=last())"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("position()=2"), false);
+	CHECK_XPATH_BOOLEAN(c, STR("last()=1"), true);
+	CHECK_XPATH_BOOLEAN(c, STR("last()+2=3"), true);
+	CHECK_XPATH_NODESET(c, STR("a[position()=5 mod 3]")) % 7;
+	CHECK_XPATH_NODESET(c, STR("a/num/text()[position()=1]")) % 6 % 9 % 12 % 16 % 19 % 22 % 26 % 30;
+	CHECK_XPATH_NODESET(c, STR("a/num/text()[position()=2]")) % 32;
+	CHECK_XPATH_NODESET(c, STR("a/num/text()[position()=last()]")) % 6 % 9 % 12 % 16 % 19 % 22 % 26 % 32;
+	CHECK_XPATH_NODESET(c, STR("a/num/text()[1]")) % 6 % 9 % 12 % 16 % 19 % 22 % 26 % 30;
+	CHECK_XPATH_NODESET(c, STR("a/num/text()[2]")) % 32;
+	CHECK_XPATH_NODESET(c, STR("a/num/text()[last()]")) % 6 % 9 % 12 % 16 % 19 % 22 % 26 % 32;
+	CHECK_XPATH_NODESET(c, STR("a[floor(last() div 3)]")) % 7;
+	CHECK_XPATH_NODESET(c, STR("a[ceiling(last() div 3)]")) % 10;
+	CHECK_XPATH_NODESET(c, STR("a[round(last() div 3)]")) % 10;
+	CHECK_XPATH_NODESET(c, STR("a[last() div 3]"));
+	CHECK_XPATH_NODESET(c, STR("a[last() div 2]")) % 13;
+	CHECK_XPATH_NODESET(c, STR("a[3]/../a[position()>=2 and position()<=4]")) % 7 % 10 % 13;
+	CHECK_XPATH_NUMBER(c, STR("count(a[position()>=2 and position()<=4]/num)"), 3);
+	CHECK_XPATH_NUMBER(c, STR("count(a/@*)"), 4);
+	CHECK_XPATH_NUMBER(c, STR("count(a/attribute::*)"), 4);
+	CHECK_XPATH_NODESET(c, STR("*[not(@test)][position()=last()]")) % 20;
+	CHECK_XPATH_NODESET(c, STR("*[not(@test)][last()]")) % 20;
+	CHECK_XPATH_NODESET(c, STR("a[3-2]")) % 3;
+	CHECK_XPATH_NODESET(c, STR("a[0]"));
+	CHECK_XPATH_NODESET(c, STR("a[9]"));
+	CHECK_XPATH_NODESET(c, STR("a['3']")) % 3 % 7 % 10 % 13 % 17 % 20 % 23 % 27;
+	CHECK_XPATH_NODESET(c, STR("a[number('3')]")) % 10;
+	CHECK_XPATH_NODESET(c, STR("processing-instruction()[2]")) % 34;
+	CHECK_XPATH_NODESET(c, STR("processing-instruction('pi')[2]")) % 34;
+	CHECK_XPATH_NODESET(c, STR("comment()[2]")) % 36;
+ CHECK_XPATH_NODESET(c, STR("a/*[last()]")) % 5 % 8 % 11 % 15 % 18 % 21 % 25 % 29;
+ CHECK_XPATH_NODESET(c, STR("a/child::*[last()]")) % 5 % 8 % 11 % 15 % 18 % 21 % 25 % 29;
+ CHECK_XPATH_NODESET(c, STR("a/descendant::*[last()]")) % 5 % 8 % 11 % 15 % 18 % 21 % 25 % 31;
+ CHECK_XPATH_NODESET(c, STR("a/child::node()[last()]")) % 5 % 8 % 11 % 15 % 18 % 21 % 25 % 29;
+ CHECK_XPATH_NODESET(c, STR("a/descendant::text()[last()]")) % 6 % 9 % 12 % 16 % 19 % 22 % 26 % 32;
+ CHECK_XPATH_NODESET(c, STR("child::comment()[last()]")) % 36;
+}
+
+TEST_XML(xpath_xalan_position_3, "<article class='whitepaper' status='Note'><articleinfo><title>AAA</title><section id='info'><title>BBB</title><para>About this article</para><section revisionflag='added'><title>CCC</title><para>This is the section titled 'ZZZ'.</para><ednote who='KKK'><title>DDD</title><para>Don't worry.</para><section revisionflag='added'><title>EEE</title><para>This is the deep subsection.</para></section></ednote></section></section></articleinfo></article>")
+{
+	CHECK_XPATH_NODESET(doc, STR("(article//section/title|/articleinfo/title|article/section/para)[last()]")) % 28;
+	CHECK_XPATH_NODESET(doc, STR("(article//section/title|/articleinfo/title|article/section/para)[1]")) % 10;
+	CHECK_XPATH_NUMBER(doc, STR("count(article/articleinfo/section[last()])"), 1);
+	CHECK_XPATH_NUMBER(doc, STR("count(article/articleinfo/section[last()][title='BBB'])"), 1);
+}
+
+TEST_XML(xpath_xalan_position_4, "<chapter><section><footnote>hello</footnote></section><section><footnote>goodbye</footnote><footnote>sayonara</footnote></section><section><footnote>aloha</footnote></section></chapter>")
+{
+	CHECK_XPATH_NODESET(doc, STR("chapter//footnote[1]")) % 4 % 7 % 12;
+}
+
+TEST_XML(xpath_xalan_position_5, "<chapter><section><footnote>hello</footnote><footnote>ahoy</footnote></section><section><footnote>goodbye</footnote><footnote>sayonara</footnote><footnote>adios</footnote></section><section><footnote>aloha</footnote><subsection><footnote>shalom</footnote><footnote>yo</footnote></subsection><footnote>ciao</footnote></section></chapter>")
+{
+	CHECK_XPATH_NODESET(doc, STR("chapter//footnote[2]")) % 6 % 11 % 21 % 23;
+	CHECK_XPATH_NODESET(doc, STR("(chapter//footnote)[2]")) % 6;
+	CHECK_XPATH_NODESET(doc, STR("(child::chapter/descendant-or-self::node())/footnote[2]")) % 6 % 11 % 21 % 23;
+	CHECK_XPATH_NODESET(doc, STR("chapter/descendant::footnote[6]")) % 16;
+	CHECK_XPATH_NODESET(doc, STR("chapter/descendant::footnote[6][1][last()]")) % 16;
+}
+
+TEST_XML_FLAGS(xpath_xalan_position_6, "<node attr='value'>pcdata<child/><?pi1 value?><?pi2 value?><![CDATA[cdata]]></node>", parse_default | parse_pi | parse_comments)
+{
+	CHECK_XPATH_NUMBER(doc, STR("count(/node/@attr/ancestor-or-self::node())"), 3);
+	CHECK_XPATH_NUMBER(doc, STR("count(/node/text()/ancestor-or-self::node())"), 4);
+	CHECK_XPATH_NUMBER(doc, STR("count(/node/processing-instruction()/ancestor-or-self::node())"), 4);
+	CHECK_XPATH_NUMBER(doc, STR("count(/node/processing-instruction('pi1')/ancestor-or-self::node())"), 3);
+	CHECK_XPATH_NUMBER(doc, STR("count(/node/comment()/ancestor-or-self::node())"), 3);
+}
+
+TEST_XML(xpath_xalan_position_7, "<chapter title='A'><section title='A1'><subsection title='A1a'>hello</subsection><subsection title='A1b'>ahoy</subsection></section><section title='A2'><subsection title='A2a'>goodbye</subsection><subsection title='A2b'>sayonara</subsection><subsection title='A2c'>adios</subsection></section><section title='A3'><subsection title='A3a'>aloha</subsection><subsection title='A3b'><footnote>A3b-1</footnote><footnote>A3b-2</footnote></subsection><subsection title='A3c'>shalom</subsection></section></chapter>")
+{
+	CHECK_XPATH_NODESET(doc, STR("chapter/section//@title[7]"));
+	CHECK_XPATH_NODESET(doc, STR("(chapter/section//@title)[7]")) % 21;
+}
+
+TEST_XML(xpath_xalan_match_1, "<root><x spot='a' num='1'/><x spot='b' num='2'/><x spot='c' num='3'/><x spot='d' num='4'/><x spot='e' num='5'/><x spot='f' num='6'/><x spot='g' num='7'/><x spot='h' num='8'/><x spot='i' num='9'/><x spot='j' num='10'/><x spot='k' num='11'/><x spot='l' num='12'/></root>")
+{
+	xml_node c = doc.child(STR("root"));
+
+	CHECK_XPATH_NODESET(c, STR("x[(position() mod 2)=1][position() > 3]")) % 21 % 27 % 33;
+	CHECK_XPATH_NODESET(c, STR("x[(position() mod 2)=1][position() > 3][position()=2]")) % 27;
+	CHECK_XPATH_NODESET(c, STR("x[(position() mod 2) > 0][position() > 3][2]")) % 27;
+	CHECK_XPATH_NODESET(c, STR("x[(position() mod 2)=1][position() > 3][last()]")) % 33;
+	CHECK_XPATH_NODESET(c, STR("x[(position() mod 2)=1][@num > 5][last()]")) % 33;
+	CHECK_XPATH_NODESET(c, STR("x[(@num mod 3)=2][position() > 2][last()]")) % 33;
+	CHECK_XPATH_NODESET(c, STR("x[(position() mod 2)=1][2][@num < 10]")) % 9;
+	CHECK_XPATH_NODESET(c, STR("x[(((((2*10)-4)+9) div 5) mod 3)]")) % 6;
+}
+
+
+TEST_XML(xpath_xalan_match_2, "<doc><l1><v2>doc-l1-v2</v2><x2>doc-l1-x2</x2><l2><v3>doc-l1-l2-v3</v3><w3>doc-l1-l2-w3</w3><x3>doc-l1-l2-x3</x3><y3>doc-l1-l2-y3</y3><l3><v4>doc-l1-l2-l3-v4</v4><x4>doc-l1-l2-l3-x4</x4></l3></l2></l1></doc>")
+{
+	CHECK_XPATH_STRING(doc, STR("doc/l1/v2"), STR("doc-l1-v2"));
+	CHECK_XPATH_STRING(doc, STR("doc/child::l1/x2"), STR("doc-l1-x2"));
+	CHECK_XPATH_STRING(doc, STR("doc/l1//v3"), STR("doc-l1-l2-v3"));
+	CHECK_XPATH_STRING(doc, STR("doc//l2/w3"), STR("doc-l1-l2-w3"));
+	CHECK_XPATH_STRING(doc, STR("doc/child::l1//x3"), STR("doc-l1-l2-x3"));
+	CHECK_XPATH_STRING(doc, STR("doc//child::l2/y3"), STR("doc-l1-l2-y3"));
+	CHECK_XPATH_STRING(doc, STR("doc//l2//v4"), STR("doc-l1-l2-l3-v4"));
+	CHECK_XPATH_STRING(doc, STR("doc//child::l2//x4"), STR("doc-l1-l2-l3-x4"));
+
+	CHECK_XPATH_STRING(doc, STR("doc/l1/v2"), STR("doc-l1-v2"));
+	CHECK_XPATH_STRING(doc, STR("doc/l1/child::x2"), STR("doc-l1-x2"));
+	CHECK_XPATH_STRING(doc, STR("doc/l1//v3"), STR("doc-l1-l2-v3"));
+	CHECK_XPATH_STRING(doc, STR("doc//l2/w3"), STR("doc-l1-l2-w3"));
+	CHECK_XPATH_STRING(doc, STR("doc/l1//child::x3"), STR("doc-l1-l2-x3"));
+	CHECK_XPATH_STRING(doc, STR("doc//l2/child::y3"), STR("doc-l1-l2-y3"));
+	CHECK_XPATH_STRING(doc, STR("doc//l2//v4"), STR("doc-l1-l2-l3-v4"));
+	CHECK_XPATH_STRING(doc, STR("doc//l2//child::x4"), STR("doc-l1-l2-l3-x4"));
+
+	CHECK_XPATH_STRING(doc, STR("doc/l1/v2"), STR("doc-l1-v2"));
+	CHECK_XPATH_STRING(doc, STR("doc/child::l1/child::x2"), STR("doc-l1-x2"));
+	CHECK_XPATH_STRING(doc, STR("doc/l1//v3"), STR("doc-l1-l2-v3"));
+	CHECK_XPATH_STRING(doc, STR("doc//l2/w3"), STR("doc-l1-l2-w3"));
+	CHECK_XPATH_STRING(doc, STR("doc/child::l1//child::x3"), STR("doc-l1-l2-x3"));
+	CHECK_XPATH_STRING(doc, STR("doc//child::l2/child::y3"), STR("doc-l1-l2-y3"));
+	CHECK_XPATH_STRING(doc, STR("doc//l2//v4"), STR("doc-l1-l2-l3-v4"));
+	CHECK_XPATH_STRING(doc, STR("doc//child::l2//child::x4"), STR("doc-l1-l2-l3-x4"));
+}
+
+TEST_XML(xpath_xalan_match_3, "<doc><child><child-foo><name id='1'>John Doe</name><child><name id='2'>Jane Doe</name></child></child-foo></child></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("doc/child/*[starts-with(name(),'child-')]//name")) % 5 % 9;
+	CHECK_XPATH_NODESET(doc, STR("//@*")) % 6 % 10;
+}
+
+TEST_XML(xpath_xalan_expression_1, "<doc><para id='1' xml:lang='en'>en</para><div xml:lang='en'><para>en</para></div><para id='3' xml:lang='EN'>EN</para><para id='4' xml:lang='en-us'>en-us</para></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("doc/para[@id='1' and lang('en')]")) % 3;
+	CHECK_XPATH_NODESET(doc, STR("doc/para[@id='4' and lang('en')]")) % 15;
+	CHECK_XPATH_NODESET(doc, STR("doc/div/para[lang('en')]")) % 9;
+	CHECK_XPATH_NODESET(doc, STR("doc/para[@id='3' and lang('en')]")) % 11;
+	CHECK_XPATH_NODESET(doc, STR("//para[lang('en')]/ancestor-or-self::*[@xml:lang]/@xml:lang")) % 5 % 8 % 13 % 17;
+}
+
+TEST_XML(xpath_xalan_predicate_1, "<doc><a>1</a><a>2</a><a>3</a><a>4</a></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NODESET(c, STR("a[true()=4]")) % 3 % 5 % 7 % 9;
+	CHECK_XPATH_NODESET(c, STR("a[true()='stringwithchars']")) % 3 % 5 % 7 % 9;
+	CHECK_XPATH_NODESET(c, STR("a[true()=following-sibling::*]")) % 3 % 5 % 7;
+	CHECK_XPATH_NODESET(c, STR("a[true()=preceding-sibling::*]")) % 5 % 7 % 9;
+	CHECK_XPATH_NODESET(c, STR("a[3=following-sibling::*]")) % 3 % 5;
+	CHECK_XPATH_NODESET(c, STR("a[0 < true()]")) % 3 % 5 % 7 % 9;
+	CHECK_XPATH_NODESET(c, STR("a['3.5' < 4]")) % 3 % 5 % 7 % 9;
+	CHECK_XPATH_NODESET(c, STR("a[3 < following-sibling::*]")) % 3 % 5 % 7;
+	CHECK_XPATH_NODESET(c, STR("a[following-sibling::*>3]")) % 3 % 5 % 7;
+	CHECK_XPATH_NODESET(c, STR("a[3 > following-sibling::*]")) % 3;
+	CHECK_XPATH_NODESET(c, STR("a[following-sibling::*<3]")) % 3;
+	CHECK_XPATH_NODESET(c, STR("a[1 < 2 < 3]")) % 3 % 5 % 7 % 9;
+	CHECK_XPATH_NODESET(c, STR("a[1 < 3 < 2]")) % 3 % 5 % 7 % 9;
+	CHECK_XPATH_NODESET(c, STR("a[following-sibling::*=true()]")) % 3 % 5 % 7;
+	CHECK_XPATH_NODESET(c, STR("a[false()!=following-sibling::*]")) % 3 % 5 % 7;
+	CHECK_XPATH_NODESET(c, STR("a[following-sibling::*!=false()]")) % 3 % 5 % 7;
+	CHECK_XPATH_NODESET(c, STR("a[following-sibling::*=3]")) % 3 % 5;
+	CHECK_XPATH_NODESET(c, STR("a[3=following-sibling::*]")) % 3 % 5;
+	CHECK_XPATH_NODESET(c, STR("a[4!=following-sibling::*]")) % 3 % 5;
+	CHECK_XPATH_NODESET(c, STR("a[following-sibling::*!=4]")) % 3 % 5;
+	CHECK_XPATH_NODESET(c, STR("a[3>=following-sibling::*]")) % 3 % 5;
+	CHECK_XPATH_NODESET(c, STR("a[3<=following-sibling::*]")) % 3 % 5 % 7;
+	CHECK_XPATH_NODESET(c, STR("a[following-sibling::*<=3]")) % 3 % 5;
+	CHECK_XPATH_NODESET(c, STR("a[following-sibling::*>=3]")) % 3 % 5 % 7;
+}
+
+TEST_XML(xpath_xalan_predicate_2, "<foo><bar a='0' b='0' c='0' d='0' seq='0'/><bar a='0' b='0' c='0' d='1' seq='1'/><bar a='0' b='0' c='1' d='0' seq='2'/><bar a='0' b='0' c='1' d='1' seq='3'/><bar a='0' b='1' c='0' d='0' seq='4'/><bar a='0' b='1' c='0' d='1' seq='5'/><bar a='0' b='1' c='1' d='0' seq='6'/><bar a='0' b='1' c='1' d='1' seq='7'/><bar a='1' b='0' c='0' d='0' seq='8'/><bar a='1' b='0' c='0' d='1' seq='9'/><bar a='1' b='0' c='1' d='0' seq='a'/><bar a='1' b='0' c='1' d='1' seq='b'/><bar a='1' b='1' c='0' d='0' seq='c'/><bar a='1' b='1' c='0' d='1' seq='d'/><bar a='1' b='1' c='1' d='0' seq='e'/><bar a='1' b='1' c='1' d='1' seq='f'/></foo>")
+{
+	xml_node c = doc.child(STR("foo"));
+
+	CHECK_XPATH_NODESET(c, STR("bar[@a='1' and @b='1']")) % 75 % 81 % 87 % 93;
+	CHECK_XPATH_NODESET(c, STR("bar[(@a='1' or @b='1') and @c='1']")) % 39 % 45 % 63 % 69 % 87 % 93;
+	CHECK_XPATH_NODESET(c, STR("bar[@a='1' and (@b='1' or @c='1') and @d='1']")) % 69 % 81 % 93;
+	CHECK_XPATH_NODESET(c, STR("bar[@a='1' and @b='1' or @c='1' and @d='1']")) % 21 % 45 % 69 % 75 % 81 % 87 % 93;
+	CHECK_XPATH_NODESET(c, STR("bar[(@a='1' and @b='1') or (@c='1' and @d='1')]")) % 21 % 45 % 69 % 75 % 81 % 87 % 93;
+	CHECK_XPATH_NODESET(c, STR("bar[@a='1' or (@b='1' and @c='1') or @d='1']")) % 9 % 21 % 33 % 39 % 45 % 51 % 57 % 63 % 69 % 75 % 81 % 87 % 93;
+	CHECK_XPATH_NODESET(c, STR("bar[(@a='1' or @b='1') and (@c='1' or @d='1')]")) % 33 % 39 % 45 % 57 % 63 % 69 % 81 % 87 % 93;
+	CHECK_XPATH_NODESET(c, STR("bar[@a='1' or @b='1' and @c='1' or @d='1']")) % 9 % 21 % 33 % 39 % 45 % 51 % 57 % 63 % 69 % 75 % 81 % 87 % 93;
+	CHECK_XPATH_NODESET(c, STR("bar[@a='1' or @b='1' or @c='1']")) % 15 % 21 % 27 % 33 % 39 % 45 % 51 % 57 % 63 % 69 % 75 % 81 % 87 % 93;
+}
+
+TEST_XML(xpath_xalan_predicate_3, "<doc><a>1</a><a ex=''>2</a><a ex='value'>3</a><a why=''>4</a><a why='value'>5</a></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NUMBER(c, STR("count(a[@ex])"), 2);
+	CHECK_XPATH_NUMBER(c, STR("count(a[@ex=''])"), 1);
+	CHECK_XPATH_NUMBER(c, STR("count(a[string-length(@ex)=0])"), 4);
+	CHECK_XPATH_NUMBER(c, STR("count(a[@ex!=''])"), 1);
+	CHECK_XPATH_NUMBER(c, STR("count(a[string-length(@ex) > 0])"), 1);
+	CHECK_XPATH_NUMBER(c, STR("count(a[not(@ex)])"), 3);
+	CHECK_XPATH_NUMBER(c, STR("count(a[not(@ex='')])"), 4);
+	CHECK_XPATH_NUMBER(c, STR("count(a[not(string-length(@ex)=0)])"), 1);
+	CHECK_XPATH_NUMBER(c, STR("count(a[@why='value'])"), 1);
+	CHECK_XPATH_NUMBER(c, STR("count(a[@why!='value'])"), 1);
+}
+
+TEST_XML(xpath_xalan_predicate_4, "<table><tr><td>1.1</td><td>1.2</td></tr><tr><td>2.1</td><td>2.2</td><td>2.3</td></tr><tr><td>3.1</td><td>3.2<td>3.2.1</td></td></tr><tr><td>4<td>4.1<td>4.1.1</td></td></td></tr><tr><td>5.1</td><td>5.2</td><td>5.3</td><td>5.4</td></tr><tr><ta/><td>6.1</td><td>6.2</td></tr><tr><ta/><td>7.1</td><td>7.2</td><td>7.3</td></tr><tr><ta/><td>8.1</td><td>8.2</td><td>8.3</td><td>8.4</td></tr></table>")
+{
+	CHECK_XPATH_NUMBER(doc, STR("count(//tr)"), 8);
+	CHECK_XPATH_NUMBER(doc, STR("count(//tr[count(./td)=3])"), 2);
+}
+
+TEST_XML(xpath_xalan_predicate_5, "<doc><element1>Wrong node selected!!</element1><element1>Test executed successfully</element1><element1>Wrong node selected!!</element1></doc>")
+{
+	CHECK_XPATH_STRING(doc, STR("doc/element1[(((((2*10)-4)+9) div 5) mod 3 )]"), STR("Test executed successfully"));
+	CHECK_XPATH_STRING(doc, STR("doc/element1[(((((2*10)-4)+9) div 5) mod floor(3))]"), STR("Test executed successfully"));
+	CHECK_XPATH_STRING(doc, STR("doc/element1[floor(2)]"), STR("Test executed successfully"));
+}
+
+TEST_XML(xpath_xalan_predicate_6, "<doc><a>1</a><a>2<achild>target</achild></a><a>3</a><a>4</a></doc>")
+{
+	CHECK_XPATH_STRING(doc, STR("doc/a['target'=descendant::*]"), STR("2target"));
+	CHECK_XPATH_STRING(doc, STR("doc/a[descendant::*='target']"), STR("2target"));
+}
+
+TEST_XML(xpath_xalan_predicate_7, "<doc><a>1</a><a>2<achild>target</achild></a><a>3</a><a>4<achild>missed</achild></a></doc>")
+{
+	CHECK_XPATH_STRING(doc, STR("doc/a['target'!=descendant::*]"), STR("4missed"));
+	CHECK_XPATH_STRING(doc, STR("doc/a[descendant::*!='target']"), STR("4missed"));
+}
+
+TEST_XML(xpath_xalan_predicate_8, "<doc><foo><bar attr='1'>this</bar><bar attr='2'>2</bar><bar attr='3'>3</bar></foo><foo><bar attr='4'>this</bar><bar attr='5'>this</bar><bar1 attr='6'>that</bar1></foo><foo><bar attr='7'><baz attr='a'>hello</baz><baz attr='b'>goodbye</baz></bar><bar2 attr='8'>this</bar2><bar2 attr='9'>that</bar2></foo><foo><bar attr='10'>this</bar><bar attr='11'><baz attr='a'>hello</baz><baz attr='b'>goodbye</baz></bar><bar attr='12'>other</bar></foo></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NODESET(c, STR("foo[(bar[2])='this']")) % 13;
+	CHECK_XPATH_NODESET(c, STR("foo[(bar[(baz[2])='goodbye'])]")) % 23 % 38;
+	CHECK_XPATH_NODESET(c, STR("foo[(bar[2][(baz[2])='goodbye'])]")) % 38;
+}
+
+TEST_XML(xpath_xalan_predicate_9, "<doc><a><asub><asubsub/></asub></a><bsub><foo><child/></foo></bsub><c>f-inside</c><d><dsub><dsubsub><foundnode/></dsubsub></dsub></d><e>f-inside<esub>f-inside</esub><esubsib>f-inside</esubsib>f-inside</e><f><fsub/></f></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("doc/*[starts-with(name(.),'f')]")) % 23;
+	CHECK_XPATH_NODESET(doc, STR("//*[starts-with(name(.),'f')]")) % 8 % 15 % 23 % 24;
+}
+
+TEST_XML(xpath_xalan_predicate_10, "<doc><element1>Text from first element<child1>Text from child1 of first element</child1><child2>Text from child2 of first element</child2></element1><element2>Text from second element<child1>Text from child1 of second element</child1><child2 attr1='yes'>Text from child2 of second element (correct execution)</child2></element2></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_STRING(c, STR("//child2[ancestor::element2]"), STR("Text from child2 of second element (correct execution)"));
+	CHECK_XPATH_STRING(c, STR("//child2[ancestor-or-self::element2]"), STR("Text from child2 of second element (correct execution)"));
+	CHECK_XPATH_STRING(c, STR("//child2[attribute::attr1]"), STR("Text from child2 of second element (correct execution)"));
+}
+
+TEST_XML(xpath_xalan_predicate_11, "<doc><a squish='heavy' squash='butternut'>1</a><a squish='heavy' squeesh='virus'>2</a><a squash='butternut' squeesh='virus'>3</a><a squish='heavy'>4</a><a squeesh='virus'>5</a><a squash='butternut'>6</a></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NODESET(c, STR("a[@squeesh or (@squish and @squash)]")) % 3 % 7 % 11 % 18;
+	CHECK_XPATH_NODESET(c, STR("a[(@squeesh or @squish) and @squash]")) % 3 % 11;
+	CHECK_XPATH_NODESET(c, STR("a[@squeesh or @squish and @squash]")) % 3 % 7 % 11 % 18;
+}
+
+TEST_XML(xpath_xalan_predicate_12, "<doc><a>1</a><a>2<achild>target</achild></a><a>3</a><a>target</a></doc>")
+{
+	CHECK_XPATH_STRING(doc, STR("doc/a[following-sibling::*=descendant::*]"), STR("2target"));
+}
+
+TEST_XML(xpath_xalan_predicate_13, "<doc><a squish='heavy'>1</a><a>2<achild>target</achild></a><a>3</a></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("doc/a[('target'=descendant::*) or @squish]")) % 3 % 6;
+	CHECK_XPATH_NODESET(doc, STR("doc/a[not(('target'=descendant::*) or @squish)]")) % 10;
+}
+
+TEST_XML(xpath_xalan_predicate_14, "<doc><a squish='heavy'>1</a><a>2<achild size='large'>child2</achild></a><a>3</a><a attrib='present'>4<achild>child4</achild></a></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("doc/a[not(@*)]")) % 6 % 11;
+}
+
+TEST_XML(xpath_xalan_predicate_15, "<doc><a><asub><asubsub/></asub></a><bsub>x</bsub><c>inside</c><d><dsub><q><foundnode/></q></dsub></d></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("doc/descendant::*[string-length(name(.))=1]")) % 3 % 6 % 9 % 11 % 13;
+}
+
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/test_xpath_xalan_5.cpp Added

@@ -0,0 +1,293 @@
+#ifndef PUGIXML_NO_XPATH
+
+#include "common.hpp"
+
+TEST_XML(xpath_xalan_select_1, "<doc><a></a><c><d><e/></d></c></doc>")
+{
+	CHECK_XPATH_STRING(doc, STR("/doc/a/b/@attr"), STR("test"));
+}
+
+TEST_XML(xpath_xalan_select_2, "<doc><do do='-do-'>do</do><re>re</re><mi mi1='-mi1-' mi2='mi2'>mi</mi><fa fa='-fa-'>fa<so so='-so-'>so<la>la<ti>ti</ti>do</la></so></fa><Gsharp so='so+'>G#</Gsharp><Aflat><natural><la>A</la></natural>Ab</Aflat><Bflat>Bb</Bflat><Csharp><natural>C</natural>C#<doublesharp>D</doublesharp></Csharp></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	// This should come out fasolatido:
+	CHECK_XPATH_NODESET(c, STR("fa")) % 12;
+	// This should come out doremifasolatido:
+	CHECK_XPATH_NODESET(c, STR("mi | do | fa | re")) % 3 % 6 % 8 % 12;
+	// This should come out do-do-remi-mi1-mi2fasolatido-fa--so-:
+	CHECK_XPATH_NODESET(c, STR("mi[@mi2='mi2'] | do | fa/so/@so | fa | mi/@* | re | fa/@fa | do/@do")) % 3 % 4 % 6 % 8 % 9 % 10 % 12 % 13 % 16;
+	// This should come out solatidoG#:
+	CHECK_XPATH_NODESET(c, STR(".//*[@so]")) % 15 % 23;
+	// This should come out relatidoABb:
+	CHECK_XPATH_NODESET(c, STR("*//la | //Bflat | re")) % 6 % 18 % 28 % 31;
+	// This should come out domitiACD:
+	CHECK_XPATH_NODESET(c, STR("fa/../mi | Aflat/natural/la | Csharp//* | /doc/do | *//ti")) % 3 % 8 % 20 % 28 % 34 % 37;
+}
+
+TEST_XML(xpath_xalan_select_3, "<doc><sub1><child1>preceding sibling number 1</child1><child2>current node</child2><child3>following sibling number 3</child3></sub1><sub2><c>cousin 1</c><c>cousin 2</c><child3>cousin 3</child3></sub2></doc>")
+{
+	CHECK_XPATH_NODESET(doc.child(STR("doc")).child(STR("sub1")).child(STR("child2")), STR("preceding-sibling::child1|//child3")) % 4 % 8 % 15;
+}
+
+TEST_XML(xpath_xalan_select_4, "<doc><child>bad1bad2</child><c>bad3bad4</c>OK<nogo>bad5</nogo></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NODESET(c, STR("child::sub")) % 11;
+	CHECK_XPATH_NODESET(c, STR("child ::sub")) % 11;
+	CHECK_XPATH_NODESET(c, STR("child:: sub")) % 11;
+	CHECK_XPATH_NODESET(c, STR("child :: sub")) % 11;
+}
+
+TEST_XML_FLAGS(xpath_xalan_select_5, "<doc>bad0<comment>bad1bad2</comment></doc>", parse_default | parse_comments)
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NODESET(c, STR("comment()")) % 4;
+	CHECK_XPATH_NODESET(c, STR("comment ()")) % 4;
+	CHECK_XPATH_NODESET(c, STR("comment ( ) ")) % 4;
+	CHECK_XPATH_NUMBER(c, STR("string-length()"), 12);
+	CHECK_XPATH_NUMBER(c, STR("string-length ()"), 12);
+	CHECK_XPATH_NUMBER(c, STR("string-length ( ) "), 12);
+}
+
+TEST_XML(xpath_xalan_select_6, "<div div='20' div-5='12'>9</div>")
+{
+	xml_node c = doc.child(STR("div"));
+
+	CHECK_XPATH_NUMBER(doc, STR("div +3"), 12);
+	CHECK_XPATH_NUMBER(doc, STR("* +3"), 12);
+	CHECK_XPATH_NUMBER(c, STR("@div - 5"), 15);
+	CHECK_XPATH_NUMBER(c, STR("@div -5"), 15);
+	CHECK_XPATH_NUMBER(c, STR("@div-5"), 12);
+	CHECK_XPATH_NUMBER(c, STR("@*-5"), 15);
+	CHECK_XPATH_NUMBER(doc, STR("16-div"), 7);
+	CHECK_XPATH_NUMBER(doc, STR("25-*"), 16);
+	CHECK_XPATH_NUMBER(doc, STR("54 div*"), 6);
+	CHECK_XPATH_NUMBER(doc, STR("(* - 4) div 2"), 2.5);
+	CHECK_XPATH_NUMBER(doc, STR("' 6 ' div 2"), 3);
+	CHECK_XPATH_NUMBER(doc, STR("' 6 '*div"), 54);
+	CHECK_XPATH_NUMBER(doc, STR("5.*."), 45);
+	CHECK_XPATH_NUMBER(doc, STR("5.+."), 14);
+}
+
+TEST_XML(xpath_xalan_select_7, "<doc div='20'><div>9</div><attribute>8</attribute></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NUMBER(c, STR("attribute :: div"), 20);
+	CHECK_XPATH_NUMBER(c, STR("attribute :: *"), 20);
+	CHECK_XPATH_NUMBER(c, STR("attribute*(div - 4)"), 40);
+	CHECK_XPATH_NUMBER(c, STR("(* - 4)**"), 45);
+}
+
+TEST_XML(xpath_xalan_select_8, "<doc><a>x<div>7</div></a><a>y<div>9</div></a><a>z<div>5</div></a></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("doc/a[div=9]")) % 7;
+}
+
+TEST_XML(xpath_xalan_select_9, "<doc><a s='v'>7<c>3</c></a><a s='w'>7<c>9</c></a><a s='x'>9<c>2</c></a><a s='y'>9<c>9</c></a><a s='z'>2<c>0</c></a></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("doc/a[*=9]")) % 9 % 15 % 21;
+}
+
+TEST_XML(xpath_xalan_select_10, "<doc><sub1><child1>child1</child1></sub1><sub2><child2>child2</child2></sub2><sub3><child3/></sub3></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("/doc/sub1/child1|/doc/sub2/child2")) % 4 % 7;
+	CHECK_XPATH_NODESET(doc.child(STR("doc")), STR("sub1/child1|/doc/sub2/child2")) % 4 % 7;
+	CHECK_XPATH_NODESET(doc.child(STR("doc")), STR("sub1/child1|sub2/child2")) % 4 % 7;
+	CHECK_XPATH_NODESET(doc, STR("//self::child1|//self::child2")) % 4 % 7;
+	CHECK_XPATH_NODESET(doc, STR("//child1|//child2")) % 4 % 7;
+	CHECK_XPATH_NODESET(doc, STR("//child1|//child2|//child3")) % 4 % 7 % 10;
+}
+
+TEST_XML(xpath_xalan_select_11, "<doc><sub1 pos='1'><child1>descendant number 1</child1></sub1><sub2 pos='2'><child1>descendant number 2</child1></sub2></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("//child1/ancestor::sub1|//child1/ancestor::sub2")) % 3 % 7;
+}
+
+TEST_XML(xpath_xalan_select_12, "<doc><child>child number 1</child><sub-sub pos='1sub'><child>grandchild number 1</child></sub-sub><sub0 pos='2-no'><child>child number 2</child><child>grandchild number 2</child></sub0><child>child number 3</child><subno pos='3.5-no'><child>grandchild number 3</child></subno><sub0 pos='4-no'><child>child number 4</child><sub-sub pos='4sub'><child>grandchild number 4</child></sub-sub></sub0></doc>")
+{
+ CHECK_XPATH_NODESET(doc, STR("//child/ancestor-or-self::sub | //child/ancestor-or-self::sub-sub")) % 3 % 7 % 15 % 19 % 31;
+}
+
+TEST_XML(xpath_xalan_select_13, "<doc><book><author><name real='no'>Carmelo Montanez</name><chapters>Nine</chapters><bibliography></bibliography></author></book><book><author><name real='na'>David Marston</name><chapters>Seven</chapters><bibliography></bibliography></author></book><book><author><name real='yes'>Mary Brady</name><chapters>Ten</chapters><bibliography><author><name>Lynne Rosenthal</name><chapters>Five</chapters></author></bibliography></author></book></doc>")
+{
+	CHECK_XPATH_NODESET(doc, STR("doc/book/author[name/@real='no']|doc/book/author[name/@real='yes']")) % 4 % 20;
+	CHECK_XPATH_NODESET(doc, STR("doc/book/author[(name/@real='no' and position()=1)]|doc/book/author[(name/@real='yes' and position()=last())]")) % 4 % 20;
+	CHECK_XPATH_NODESET(doc, STR("doc/book/author[name='Mary Brady']|doc/book/author[name/@real='no']")) % 4 % 20;
+	CHECK_XPATH_NODESET(doc, STR("doc/book/author/name|doc/book/author/bibliography/author/name")) % 5 % 13 % 21 % 28;
+	CHECK_XPATH_NODESET(doc, STR("doc/book/author/name|doc/book/author/bibliography/author/chapters")) % 5 % 13 % 21 % 30;
+	CHECK_XPATH_NODESET(doc, STR("doc/book/author/name|doc/book/author/noElement")) % 5 % 13 % 21;
+	CHECK_XPATH_NODESET(doc, STR("//noChild1|//noChild2"));
+}
+
+TEST_XML(xpath_xalan_select_14, "<doc><sub1 pos='1'><child1>child number 1</child1></sub1><sub2 pos='2'><child2>child number 2</child2></sub2><sub3/></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NODESET(c, STR("child::sub1|child::sub2")) % 3 % 7;
+	CHECK_XPATH_NODESET(c, STR("descendant::child1|descendant::child2")) % 5 % 9;
+	CHECK_XPATH_NODESET(c, STR("descendant-or-self::sub1|descendant-or-self::sub2")) % 3 % 7;
+	CHECK_XPATH_NODESET(c.child(STR("sub2")), STR("preceding-sibling::sub1|following-sibling::sub3")) % 3 % 11;
+}
+
+TEST_XML(xpath_xalan_select_15, "<doc><child>Selection of this child is an error.</child><child high='3'>Selection of this child is an error.</child><child wide='4'>Selection of this child is an error.</child><child wide='4' high='3'>Selection of this child is an error.</child><child wide='3'>E</child><child wide='3' high='3'>F</child><child wide='3' deep='3'>G</child><child wide='4' deep='2'>Selection of this child is an error.</child><child wide='4' deep='2' high='3'>Selection of this child is an error.</child><child wide='3' deep='2'>J</child><child wide='3' deep='3' high='3'>K</child><child deep='2'>Selection of this child is an error.</child><child deep='2' high='3'>Selection of this child is an error.</child><child deep='3'>N</child><child deep='3' high='3'>O</child><child wide='4' deep='3'>P</child></doc>")
+{
+	xml_node c = doc.child(STR("doc"));
+
+	CHECK_XPATH_NODESET(c, STR("child[@wide='3']|child[@deep='3']")) % 15 % 18 % 22 % 35 % 39 % 51 % 54 % 58;
+	CHECK_XPATH_NODESET(c, STR("child[@deep='3']|child[@wide='3']")) % 15 % 18 % 22 % 35 % 39 % 51 % 54 % 58;
+}
+
+TEST_XML(xpath_xalan_select_16, "<doc><a squish='light' squash='butternut'>1</a><a squeesh='' squish='extreme'>2</a><a squash='butternut' squeesh=''>3</a><a squish='heavy' squash='sport' squeesh=''>4</a></doc>")
+{
+	CHECK_XPATH_NUMBER(doc, STR("count(doc/a/attribute::*)"), 9);
+	CHECK_XPATH_NUMBER(doc, STR("count(//@*)"), 9);
+	CHECK_XPATH_NUMBER(doc, STR("count(//@squish)"), 3);
+}
+
+TEST_XML(xpath_xalan_select_17, "<directions><north><dup1/><dup2/><south/><east/><west/></north><north1/><north2><dup1/><dup2/><dup3/><dup4/></north2><north3><dup1/><dup2/><south-north/><east-north/><west-north/></north3><south/><east><dup1/><dup2/><north-east/><south-east/><west-east/></east><west/></directions>")
+{
+	xml_node c = doc.child(STR("directions"));
+
+ CHECK_XPATH_NODESET(c, STR("north/* | north/dup1 | north/dup2")) % 4 % 5 % 6 % 7 % 8;
+ CHECK_XPATH_NODESET(c, STR("north/dup2 | north/dup1 | north/*")) % 4 % 5 % 6 % 7 % 8;
+ CHECK_XPATH_NODESET(c, STR("//north/dup2 | south/preceding-sibling::*[4]/* | north/dup1 | north/*")) % 4 % 5 % 6 % 7 % 8;
+ CHECK_XPATH_NODESET(c, STR("north/dup2 | south/preceding-sibling::*[4]/* | north/*")) % 4 % 5 % 6 % 7 % 8;
+}
+
+TEST_XML(xpath_xalan_select_18, "<para>HelloThereWorld</para>")
+{
+ CHECK_XPATH_NODESET(doc, STR("/para/font[@color='green']")) % 6;
+ CHECK_XPATH_NODESET(doc.child(STR("para")), STR("/para/font[@color='green']")) % 6;
+ CHECK_XPATH_NODESET(doc.child(STR("para")).last_child(), STR("/para/font[@color='green']")) % 6;
+}
+
+TEST_XML_FLAGS(xpath_xalan_select_19, "<doc>1<a>in-a</a>23<bb>4<bbb>5</bbb>6</bb>78<c>in-c</c>9<?pi?></doc>", parse_default | parse_comments | parse_pi)
+{
+	CHECK_XPATH_NODESET(doc, STR("//*")) % 2 % 4 % 8 % 10 % 12 % 18;
+	CHECK_XPATH_NODESET(doc, STR("//node()")) % 2 % 3 % 4 % 5 % 6 % 7 % 8 % 9 % 10 % 11 % 12 % 13 % 14 % 15 % 16 % 17 % 18 % 19 % 20 % 21;
+	CHECK_XPATH_NODESET(doc, STR("//text()")) % 3 % 5 % 6 % 9 % 11 % 13 % 14 % 15 % 17 % 19 % 20;
+	CHECK_XPATH_NODESET(doc, STR("//comment()")) % 7 % 16;
+	CHECK_XPATH_NODESET(doc, STR("//processing-instruction()")) % 21;
+}
+
+TEST_XML(xpath_xalan_bugzilla_1, "<report><colData colId='F'>1</colData><colData colId='L'>5</colData><colData colId='F'>1</colData><colData colId='L'>5</colData><colData colId='L'>2</colData><colData colId='F'>2</colData><colData colId='L'>5</colData><colData colId='F'>2</colData></report>")
+{
+	CHECK_XPATH_NODESET(doc, STR("/report/colData[@colId='F' and not(.=preceding::colData)]")) % 3;
+}
+
+TEST(xpath_xalan_error_boolean)
+{
+	CHECK_XPATH_FAIL(STR("nt(true())"));
+	CHECK_XPATH_FAIL(STR("not(troo())"));
+	CHECK_XPATH_FAIL(STR("troo() and (2 = 2)"));
+	CHECK_XPATH_FAIL(STR("troo() or (2 = 2)"));
+	CHECK_XPATH_FAIL(STR("2 = troo()"));
+	CHECK_XPATH_FAIL(STR("boolean(troo())"));
+	CHECK_XPATH_FAIL(STR("true(doc)"));
+	CHECK_XPATH_FAIL(STR("false(doc)"));
+	CHECK_XPATH_FAIL(STR("not()"));
+	CHECK_XPATH_FAIL(STR("not(false(), doc)"));
+	CHECK_XPATH_FAIL(STR("boolean()"));
+	CHECK_XPATH_FAIL(STR("boolean(false(), doc)"));
+	CHECK_XPATH_FAIL(STR("lang()"));
+	CHECK_XPATH_FAIL(STR("lang('en','us')"));
+}
+
+TEST(xpath_xalan_error_conditional)
+{
+	CHECK_XPATH_FAIL(STR(""));
+	CHECK_XPATH_FAIL(STR("@name='John' | @name='Joe'"));
+	CHECK_XPATH_FAIL(STR("\x95not(name(.)='')"));
+}
+
+TEST(xpath_xalan_error_match)
+{
+	CHECK_XPATH_FAIL(STR("//"));
+	CHECK_XPATH_FAIL(STR("section1|"));
+	CHECK_XPATH_FAIL(STR("|section1"));
+}
+
+TEST(xpath_xalan_error_math)
+{
+	CHECK_XPATH_FAIL(STR("6 quo 4"));
+	CHECK_XPATH_FAIL(STR("-troo()"));
+	CHECK_XPATH_FAIL(STR("number(troo())"));
+	CHECK_XPATH_FAIL(STR("5 * troo()"));
+	CHECK_XPATH_FAIL(STR("12 div troo()"));
+	CHECK_XPATH_FAIL(STR("number(8,doc)"));
+	CHECK_XPATH_FAIL(STR("sum(doc, 8)"));
+	CHECK_XPATH_FAIL(STR("sum()"));
+	CHECK_XPATH_FAIL(STR("floor(8,7)"));
+	CHECK_XPATH_FAIL(STR("floor()"));
+	CHECK_XPATH_FAIL(STR("ceiling(8,7)"));
+	CHECK_XPATH_FAIL(STR("ceiling()"));
+	CHECK_XPATH_FAIL(STR("round(8,7)"));
+	CHECK_XPATH_FAIL(STR("round()"));
+}
+
+TEST(xpath_xalan_error_namespace)
+{
+	CHECK_XPATH_FAIL(STR("local-name(baz2:b,..)"));
+	CHECK_XPATH_FAIL(STR("namespace-uri(baz2:b,..)"));
+	CHECK_XPATH_FAIL(STR("name(a,b)"));
+	CHECK_XPATH_FAIL(STR(":foo"));
+	CHECK_XPATH_FAIL(STR("*:foo"));
+}
+
+TEST(xpath_xalan_error_position)
+{
+	CHECK_XPATH_FAIL(STR("*[last(*,2)]"));
+	CHECK_XPATH_FAIL(STR("position(b)=1"));
+	CHECK_XPATH_FAIL(STR("count()"));
+	CHECK_XPATH_FAIL(STR("count(*,4)"));
+	CHECK_XPATH_FAIL(STR("position()=last(a)"));
+}
+
+TEST(xpath_xalan_error_select)
+{
+	CHECK_XPATH_FAIL(STR(""));
+	CHECK_XPATH_FAIL(STR("count(troo())"));
+	CHECK_XPATH_FAIL(STR("c::sub"));
+	CHECK_XPATH_FAIL(STR("c()"));
+	CHECK_XPATH_FAIL(STR("(* - 4) foo 2"));
+	CHECK_XPATH_FAIL(STR("5 . + *"));
+	CHECK_XPATH_FAIL(STR("4/."));
+	CHECK_XPATH_FAIL(STR("true()/."));
+	CHECK_XPATH_FAIL(STR("item//[@type='x']"));
+	CHECK_XPATH_FAIL(STR("//"));
+	CHECK_XPATH_FAIL(STR("item//"));
+	CHECK_XPATH_FAIL(STR("count(//)"));
+	CHECK_XPATH_FAIL(STR("substring-after(//,'0')"));
+	CHECK_XPATH_FAIL(STR("//+17"));
+	CHECK_XPATH_FAIL(STR("//|subitem"));
+	CHECK_XPATH_FAIL(STR("..[near-north]"));
+}
+
+TEST(xpath_xalan_error_string)
+{
+	CHECK_XPATH_FAIL(STR("string(troo())"));
+	CHECK_XPATH_FAIL(STR("string-length(troo())"));
+	CHECK_XPATH_FAIL(STR("normalize-space(a,'\t\r\n ab cd ')"));
+	CHECK_XPATH_FAIL(STR("contains('ENCYCLOPEDIA')"));
+	CHECK_XPATH_FAIL(STR("contains('ENCYCLOPEDIA','LOPE',doc)"));
+	CHECK_XPATH_FAIL(STR("starts-with('ENCYCLOPEDIA')"));
+	CHECK_XPATH_FAIL(STR("starts-with('ENCYCLOPEDIA','LOPE',doc)"));
+	CHECK_XPATH_FAIL(STR("substring-before('ENCYCLOPEDIA')"));
+	CHECK_XPATH_FAIL(STR("substring-before('ENCYCLOPEDIA','LOPE',doc)"));
+	CHECK_XPATH_FAIL(STR("substring-after('ENCYCLOPEDIA')"));
+	CHECK_XPATH_FAIL(STR("substring-after('ENCYCLOPEDIA','LOPE',doc)"));
+	CHECK_XPATH_FAIL(STR("substring('ENCYCLOPEDIA')"));
+	CHECK_XPATH_FAIL(STR("substring('ENCYCLOPEDIA',4,5,2)"));
+	CHECK_XPATH_FAIL(STR("concat('x')"));
+	CHECK_XPATH_FAIL(STR("string-length('ENCYCLOPEDIA','PEDI')"));
+	CHECK_XPATH_FAIL(STR("translate('bar','abc')"));
+	CHECK_XPATH_FAIL(STR("translate('bar','abc','ABC','output')"));
+	CHECK_XPATH_FAIL(STR("string(22,44)"));
+	CHECK_XPATH_FAIL(STR("concat(/*)"));
+}
+
+#endif

lightspark.tar.xz/src/3rdparty/pugixml/tests/writer_string.cpp Added

@@ -0,0 +1,79 @@
+#include "writer_string.hpp"
+
+#include "test.hpp"
+
+static bool test_narrow(const std::string& result, const char* expected, size_t length)
+{
+	// check result
+	if (result != std::string(expected, expected + length)) return false;
+
+	// check comparison operator (incorrect implementation can theoretically early-out on zero terminators...)
+	if (length > 0 && result == std::string(expected, expected + length - 1) + "?") return false;
+
+	return true;
+}
+
+void xml_writer_string::write(const void* data, size_t size)
+{
+	contents.append(static_cast<const char*>(data), size);
+}
+
+std::string xml_writer_string::as_narrow() const
+{
+	return contents;
+}
+
+std::basic_string<wchar_t> xml_writer_string::as_wide() const
+{
+	CHECK(contents.size() % sizeof(wchar_t) == 0);
+
+ // round-trip pointer through void* to avoid pointer alignment warnings; contents data should be heap allocated => safe to cast
+	return std::basic_string<wchar_t>(static_cast<const wchar_t*>(static_cast<const void*>(contents.data())), contents.size() / sizeof(wchar_t));
+}
+
+std::basic_string<pugi::char_t> xml_writer_string::as_string() const
+{
+#ifdef PUGIXML_WCHAR_MODE // to avoid "condition is always true" warning in BCC
+	CHECK(contents.size() % sizeof(pugi::char_t) == 0);
+#endif
+
+ // round-trip pointer through void* to avoid pointer alignment warnings; contents data should be heap allocated => safe to cast
+	return std::basic_string<pugi::char_t>(static_cast<const pugi::char_t*>(static_cast<const void*>(contents.data())), contents.size() / sizeof(pugi::char_t));
+}
+
+std::string save_narrow(const pugi::xml_document& doc, unsigned int flags, pugi::xml_encoding encoding)
+{
+	xml_writer_string writer;
+
+	doc.save(writer, STR("\t"), flags, encoding);
+
+	return writer.as_narrow();
+}
+
+bool test_save_narrow(const pugi::xml_document& doc, unsigned int flags, pugi::xml_encoding encoding, const char* expected, size_t length)
+{
+	return test_narrow(save_narrow(doc, flags, encoding), expected, length);
+}
+
+std::string write_narrow(pugi::xml_node node, unsigned int flags, pugi::xml_encoding encoding)
+{
+	xml_writer_string writer;
+
+	node.print(writer, STR("\t"), flags, encoding);
+
+	return writer.as_narrow();
+}
+
+bool test_write_narrow(pugi::xml_node node, unsigned int flags, pugi::xml_encoding encoding, const char* expected, size_t length)
+{
+	return test_narrow(write_narrow(node, flags, encoding), expected, length);
+}
+
+std::basic_string<wchar_t> write_wide(pugi::xml_node node, unsigned int flags, pugi::xml_encoding encoding)
+{
+	xml_writer_string writer;
+
+	node.print(writer, STR("\t"), flags, encoding);
+
+	return writer.as_wide();
+}

lightspark.tar.xz/src/3rdparty/pugixml/tests/writer_string.hpp Added

@@ -0,0 +1,27 @@
+#ifndef HEADER_TEST_WRITER_STRING_HPP
+#define HEADER_TEST_WRITER_STRING_HPP
+
+#include "../src/pugixml.hpp"
+
+#include <string>
+
+struct xml_writer_string: public pugi::xml_writer
+{
+	std::string contents;
+	
+	virtual void write(const void* data, size_t size);
+
+	std::string as_narrow() const;
+	std::basic_string<wchar_t> as_wide() const;
+	std::basic_string<pugi::char_t> as_string() const;
+};
+
+std::string save_narrow(const pugi::xml_document& doc, unsigned int flags, pugi::xml_encoding encoding);
+bool test_save_narrow(const pugi::xml_document& doc, unsigned int flags, pugi::xml_encoding encoding, const char* expected, size_t length);
+
+std::string write_narrow(pugi::xml_node node, unsigned int flags, pugi::xml_encoding encoding);
+bool test_write_narrow(pugi::xml_node node, unsigned int flags, pugi::xml_encoding encoding, const char* expected, size_t length);
+
+std::basic_string<wchar_t> write_wide(pugi::xml_node node, unsigned int flags, pugi::xml_encoding encoding);
+
+#endif

lightspark.tar.xz/src/CMakeLists.txt Changed

@@ -113,6 +113,7 @@
   scripting/flash/utils/IntervalRunner.cpp
   scripting/flash/ui/Keyboard.cpp
   scripting/flash/ui/Mouse.cpp
+  scripting/flash/ui/Multitouch.cpp
   scripting/flash/ui/ContextMenu.cpp
   scripting/flash/ui/ContextMenuItem.cpp
   scripting/flash/ui/ContextMenuBuiltInItems.cpp
@@ -134,9 +135,12 @@
   scripting/class.cpp
   scripting/toplevel/toplevel.cpp
   scripting/avmplus/avmplus.cpp
-  platforms/engineutils.cpp)
+  platforms/engineutils.cpp
+  3rdparty/pugixml/src/pugixml.cpp)
 IF(MINGW)
   SET(LIBSPARK_SOURCES ${LIBSPARK_SOURCES} platforms/slowpaths_generic.cpp)
+ELSEIF(CMAKE_CXX_COMPILER_ID STREQUAL "Clang")
+    SET(LIBSPARK_SOURCES ${LIBSPARK_SOURCES} platforms/slowpaths_generic.cpp)
 ELSE()
   IF(${i386})
     SET(LIBSPARK_SOURCES ${LIBSPARK_SOURCES} platforms/fastpaths_x86.cpp)
@@ -153,7 +157,7 @@
 INCLUDE_DIRECTORIES(${PROJECT_SOURCE_DIR}/src/scripting)
 
 # liblightspark.so target
-IF(CMAKE_COMPILER_IS_GNUCC)
+IF(CMAKE_CXX_COMPILER_ID STREQUAL "GNU")
   ADD_LIBRARY(spark SHARED ${LIBSPARK_SOURCES})
   IF(NOT WIN32)
     #win32's cmake doesn't like liblightspark and lightspark.exe having the same name
@@ -165,15 +169,20 @@
     SET_TARGET_PROPERTIES(spark PROPERTIES LINK_FLAGS "-Wl,--version-script=${PROJECT_SOURCE_DIR}/src/lightspark.expmap")
   ENDIF()
   SET_TARGET_PROPERTIES(spark PROPERTIES LINK_INTERFACE_LIBRARIES "")
-ELSE (CMAKE_COMPILER_IS_GNUCC)
-  ADD_LIBRARY(spark STATIC ${LIBSPARK_SOURCES})
-ENDIF (CMAKE_COMPILER_IS_GNUCC)
+ELSE(CMAKE_CXX_COMPILER_ID STREQUAL "GNU")
+  IF(CMAKE_CXX_COMPILER_ID STREQUAL "Clang")
+    ADD_LIBRARY(spark SHARED ${LIBSPARK_SOURCES})
+    SET_TARGET_PROPERTIES(spark PROPERTIES OUTPUT_NAME lightspark)
+  ELSE (CMAKE_CXX_COMPILER_ID STREQUAL "Clang")
+    ADD_LIBRARY(spark STATIC ${LIBSPARK_SOURCES})
+  ENDIF (CMAKE_CXX_COMPILER_ID STREQUAL "Clang")
+ENDIF (CMAKE_CXX_COMPILER_ID STREQUAL "GNU")
 
 TARGET_LINK_LIBRARIES(spark ${CAIRO_LIBRARIES} ${ZLIB_LIBRARIES}
 	${Boost_LIBRARIES} ${LLVM_LIBS_CORE} ${LLVM_LIBS_JIT} ${LLVM_LDFLAGS}
 	${OPTIONAL_LIBRARIES} ${GTK_LIBRARIES} ${FREETYPE_LIBRARIES} ${JPEG_LIBRARIES} ${PNG_LIBRARIES}
 	${PCRE_LIBRARIES} ${GLIBMM_LIBRARIES} ${GMODULE_LIBRARIES}
-	${XMLPP_LIBRARIES} ${CMAKE_DL_LIBS} ${EXTRA_LIBS_LIBRARIES}
+	${CMAKE_DL_LIBS} ${EXTRA_LIBS_LIBRARIES}
 	${X11_LIBRARIES})
 SET_TARGET_PROPERTIES(spark PROPERTIES VERSION "${MAJOR_VERSION}.${MINOR_VERSION}.${PATCH_VERSION}")
 SET_TARGET_PROPERTIES(spark PROPERTIES SOVERSION "${MAJOR_VERSION}.${MINOR_VERSION}")

lightspark.tar.xz/src/allclasses.cpp Changed

lightspark.tar.xz/src/allclasses.h Changed

lightspark.tar.xz/src/asobject.cpp Changed

@@ -30,6 +30,7 @@
 #include "scripting/toplevel/XML.h"
 #include "scripting/toplevel/XMLList.h"
 #include "scripting/toplevel/Error.h"
+#include <3rdparty/pugixml/src/pugixml.hpp>
 
 using namespace lightspark;
 using namespace std;
@@ -1356,7 +1357,7 @@
 }
 
 ASObject::ASObject(MemoryAccount* m):Variables(m),classdef(NULL),proxyMultiName(NULL),
-	type(T_OBJECT),traitsInitialized(false),constructIndicator(false),implEnable(true)
+	type(T_OBJECT),traitsInitialized(false),constructIndicator(false),constructorCallComplete(false),implEnable(true)
 {
 #ifndef NDEBUG
 	//Stuff only used in debugging
@@ -1365,7 +1366,7 @@
 }
 
 ASObject::ASObject(Class_base* c):Variables((c)?c->memoryAccount:NULL),classdef(NULL),proxyMultiName(NULL),
-	type(T_OBJECT),traitsInitialized(false),constructIndicator(false),implEnable(true)
+	type(T_OBJECT),traitsInitialized(false),constructIndicator(false),constructorCallComplete(false),implEnable(true)
 {
 	setClass(c);
 #ifndef NDEBUG
@@ -1375,7 +1376,7 @@
 }
 
 ASObject::ASObject(const ASObject& o):Variables((o.classdef)?o.classdef->memoryAccount:NULL),classdef(NULL),proxyMultiName(NULL),
-	type(o.type),traitsInitialized(false),constructIndicator(false),implEnable(true)
+	type(o.type),traitsInitialized(false),constructIndicator(false),constructorCallComplete(false),implEnable(true)
 {
 	if(o.classdef)
 		setClass(o.classdef);
@@ -1667,22 +1668,34 @@
 
 ASObject *ASObject::describeType() const
 {
-	xmlpp::DomParser p;
-	xmlpp::Element* root=p.get_document()->create_root_node("type");
+	pugi::xml_document p;
+	pugi::xml_node root = p.append_child("type");
+
+	switch (getObjectType())
+	{
+		case T_NULL:
+			root.append_attribute("name").set_value("null");
+			break;
+		case T_UNDEFINED:
+			root.append_attribute("name").set_value("void");
+			break;
+		default:
+			break;
+	}
 
 	// type attributes
 	Class_base* prot=getClass();
 	if(prot)
 	{
-		root->set_attribute("name", prot->getQualifiedClassName().raw_buf());
+		root.append_attribute("name").set_value(prot->getQualifiedClassName().raw_buf());
 		if(prot->super)
-			root->set_attribute("base", prot->super->getQualifiedClassName().raw_buf());
+			root.append_attribute("base").set_value(prot->super->getQualifiedClassName().raw_buf());
 	}
 	bool isDynamic = classdef && !classdef->isSealed;
-	root->set_attribute("isDynamic", isDynamic?"true":"false");
-	bool isFinal = classdef && classdef->isFinal;
-	root->set_attribute("isFinal", isFinal?"true":"false");
-	root->set_attribute("isStatic", "false");
+	root.append_attribute("isDynamic").set_value(isDynamic?"true":"false");
+	bool isFinal = !classdef || classdef->isFinal;
+	root.append_attribute("isFinal").set_value(isFinal?"true":"false");
+	root.append_attribute("isStatic").set_value("false");
 
 	if(prot)
 		prot->describeInstance(root);

lightspark.tar.xz/src/asobject.h Changed

lightspark.tar.xz/src/backends/xml_support.cpp Changed

@@ -17,140 +17,58 @@
 along with this program. If not, see <http://www.gnu.org/licenses/>.
 **************************************************************************/
 
-#include <libxml++/nodes/textnode.h>
 #include "backends/xml_support.h"
 #include "logger.h"
+#include "scripting/abc.h"
+#include "scripting/toplevel/Error.h"
 
 using namespace lightspark;
 using namespace std;
 
-#ifdef XMLPP_2_35_1
-RecoveryDocument::RecoveryDocument(_xmlDoc* d):xmlpp::Document(d)
+const pugi::xml_node XMLBase::buildFromString(const tiny_string& str,
+										unsigned int xmlparsemode,
+										const tiny_string& default_ns)
 {
-}
-
-void RecoveryDomParser::parse_memory_raw(const unsigned char* contents, size_type bytes_count)
-{
-	release_underlying(); //Free any existing document.
-
-	//The following is based on the implementation of xmlParseFile(), in xmlSAXParseFileWithData():
-	context_ = xmlCreateMemoryParserCtxt((const char*)contents, bytes_count);
-	if(!context_)
-		throw xmlpp::internal_error("Couldn't create parsing context");
-
-	xmlSAXHandlerV1* handler=(xmlSAXHandlerV1*)calloc(1,sizeof(xmlSAXHandlerV1));
-	initxmlDefaultSAXHandler(handler, 0);
-	handler->comment = comment;
-	context_->recovery=1;
-	free(context_->sax);
-	context_->sax=(xmlSAXHandler*)handler;
-	context_->keepBlanks = 0;
-	handler->ignorableWhitespace = xmlSAX2IgnorableWhitespace;
-
-	//The following is based on the implementation of xmlParseFile(), in xmlSAXParseFileWithData():
-	//and the implementation of xmlParseMemory(), in xmlSaxParseMemoryWithData().
-	initialize_context();
-
-	if(!context_)
-		throw xmlpp::internal_error("Context not initialized");
-
-	xmlParseDocument(context_);
-
-	check_for_exception();
-
-	if(!context_->wellFormed)
-		LOG(LOG_ERROR, "XML data not well formed!");
-
-	if (context_->wellFormed && context_->myDoc)
-		doc_ = new RecoveryDocument(context_->myDoc);
-	// This is to indicate to release_underlying that we took the
-	// ownership on the doc.
-	context_->myDoc = 0;
-
-	//Free the parse context, but keep the document alive so people can navigate the DOM tree:
-	//TODO: Why not keep the context alive too?
-	Parser::release_underlying();
-
-	check_for_exception();
-}
-#endif
-
-xmlpp::Node* XMLBase::buildFromString(const string& str,
-				 bool ignoreEmptyTextNodes, bool *hasParent,
-				 const string& default_ns)
-{
-	string buf = parserQuirks(str);
-	try
-	{
-		parser.parse_memory_raw((const unsigned char*)buf.c_str(), buf.size());
-	}
-	catch(const exception& e)
+	tiny_string buf = quirkEncodeNull(removeWhitespace(str));
+	if (buf.numBytes() > 0 && buf.charAt(0) == '<')
 	{
-		LOG(LOG_ERROR,"xml error: "<<e.what());
-	}
-	xmlpp::Document* doc=parser.get_document();
-	if(doc)
-	{
-		xmlpp::Node *root = NULL;
-		if (!doc->get_root_node())
+		pugi::xml_parse_result res = xmldoc.load_buffer((void*)buf.raw_buf(),buf.numBytes(),xmlparsemode);
+		switch (res.status)
 		{
-			buf="<parent>";
-			buf += str;
-			buf += "</parent>";
-			try
-			{
-				parser.parse_memory_raw((const unsigned char*)buf.c_str(), buf.size());
-			}
-			catch(const exception& e)
-			{
-			}
-			doc=parser.get_document();
-			if (doc && doc->get_root_node())
-			{
-				root = doc->get_root_node()->get_first_child();
-			}
-		}
-		if (!doc || !doc->get_root_node())
-		{
-			try
-			{
-				buf="<parent>";
-				buf += XMLBase::encodeToXML(str,false);
-				buf += "</parent>";
-				parser.parse_memory_raw((const unsigned char*)buf.c_str(), buf.size());
-			}
-			catch(const exception& e)
-			{
-			}
-			doc=parser.get_document();
-			if (doc && doc->get_root_node())
-			{
-				root = doc->get_root_node()->get_first_child();
-			}
-		}
-		if (doc && doc->get_root_node())
-		{
-			*hasParent = true;
-			if (root==NULL) root = doc->get_root_node();
-			// It would be better to remove empty nodes during
-			// parsing, but xmlpp doesn't offer an interface.
-			if (ignoreEmptyTextNodes)
-				removeWhitespaceNodes(root);
-			addDefaultNamespace(root, default_ns);
-			return root;
+			case pugi::status_ok:
+				break;
+			case pugi::status_end_element_mismatch:
+				throwError<TypeError>(kXMLUnterminatedElementTag);
+				break;
+			case pugi::status_unrecognized_tag:
+				throwError<TypeError>(kXMLMalformedElement);
+				break;
+			case pugi::status_bad_pi:
+				throwError<TypeError>(kXMLUnterminatedXMLDecl);
+				break;
+			case pugi::status_bad_attribute:
+				throwError<TypeError>(kXMLUnterminatedAttribute);
+				break;
+			case pugi::status_bad_cdata:
+				throwError<TypeError>(kXMLUnterminatedCData);
+				break;
+			case pugi::status_bad_doctype:
+				throwError<TypeError>(kXMLUnterminatedDocTypeDecl);
+				break;
+			case pugi::status_bad_comment:
+				throwError<TypeError>(kXMLUnterminatedComment);
+				break;
+			default:
+				LOG(LOG_ERROR,"xml parser error:"<<buf<<" "<<res.status<<" "<<res.description());
+				break;
 		}
 	}
-	//If everything fails, create a fake document and add a single text string child
-	// see 10.3.1 in ECMA 357
-	
-	if (default_ns.empty())
-		buf="<parent></parent>";
 	else
-		buf="<parent xmlns=\"" + default_ns + "\"></parent>";
-	parser.parse_memory_raw((const unsigned char*)buf.c_str(), buf.size());
-
-	*hasParent = false;
-	return parser.get_document()->get_root_node()->add_child_text(str);
+	{
+		pugi::xml_node n = xmldoc.append_child(pugi::node_pcdata);
+		n.set_value(str.raw_buf());
+	}
+	return xmldoc.root();
 }
 const tiny_string XMLBase::encodeToXML(const tiny_string value, bool bIsAttribute)
 {
@@ -191,77 +109,17 @@
 	return res;
 }
 
-void XMLBase::addDefaultNamespace(xmlpp::Node *root, const string& default_ns)
-{
-	if(default_ns.empty() || !root->get_namespace_uri().empty())
-		return;
-
-	xmlNodePtr node = root->cobj();
-	xmlNsPtr ns = xmlNewNs(node, BAD_CAST default_ns.c_str(), NULL);
-	addDefaultNamespaceRecursive(node, ns);
-}
-
-void XMLBase::addDefaultNamespaceRecursive(xmlNodePtr node, xmlNsPtr ns)
-{
-	//Set the default namespace to nodes by descending until we
-	//encounter another namespace.
-	if ((node->type != XML_ELEMENT_NODE) || (node->ns != NULL))
-		return;
-
-	xmlSetNs(node, ns);
-
-	xmlNodePtr child=node->children;
-	while(child)
-	{
-		addDefaultNamespaceRecursive(child, ns);
-		child = child->next;
-	}
-}
-
-xmlpp::Node* XMLBase::buildCopy(const xmlpp::Node* src, bool *hasParent)
-{
-	const xmlpp::ContentNode* contentnode;
-	const xmlpp::TextNode* textnode=dynamic_cast<const xmlpp::TextNode*>(src);
-	if(textnode)
-	{
-		return buildFromString(textnode->get_content(), false,hasParent);
-	}
-	else if ((contentnode = dynamic_cast<const xmlpp::ContentNode*>(src)))
-	{
-		// ContentNode but not TextNode => comment, PI or CData
-		// These can't be root nodes so we add a dummy root.
-		*hasParent = false;
-		xmlpp::Element* root = parser.get_document()->create_root_node("dummy_root");
-		return root->import_node(contentnode);
-	}
-	else
-	{
-		*hasParent = true;
-		return parser.get_document()->create_root_node_by_import(src);
-	}
-}
-
 // Adobe player's XML parser accepts many strings which are not valid
 // XML according to the specs. This function attempts to massage
 // invalid-but-accepted-by-Adobe strings into valid XML so that
 // libxml++ parser doesn't throw an error.
 string XMLBase::parserQuirks(const string& str)
 {
-	string buf = quirkCData(str);
+	string buf = quirkEncodeNull(str);
 	buf = quirkXMLDeclarationInMiddle(buf);
 	return buf;
 }
 
-string XMLBase::quirkCData(const string& str) {
-	//if this is a CDATA node replace CDATA tags to make it look like a text-node
-	//for compatibility with the Adobe player
-	//if (str.compare(0, 9, "<![CDATA[") == 0) {
-	//	return "<a>"+str.substr(9, str.size()-12)+"</a>";
-	//}
-	//else
-		return str;
-}
-
 string XMLBase::quirkXMLDeclarationInMiddle(const string& str) {
 	string buf(str);
 
@@ -283,25 +141,26 @@
 
 	return buf;
 }
-
-void XMLBase::removeWhitespaceNodes(xmlpp::Node *node)
+string XMLBase::quirkEncodeNull(const string value)
 {
-	xmlpp::Node::NodeList children = node->get_children();
-	xmlpp::Node::NodeList::iterator it;
-	for (it=children.begin(); it!=children.end(); ++it)
+	string res;
+	auto it = value.cbegin();
+	while (it != value.cend())
 	{
-		xmlpp::Element *element = dynamic_cast<xmlpp::Element*>(*it);
-		xmlNode *xmlnode = (*it)->cobj();
-		if (xmlnode->type == XML_TEXT_NODE && xmlIsBlankNode(xmlnode))
-		{
-			node->remove_child(*it);
-		}
-		else if (element)
+		switch (*it)
 		{
-			removeWhitespaceNodes(element);
+			case '\0':
+				res += "&#x0;";
+				break;
+			default:
+				res += *it;
+				break;
 		}
+		it++;
 	}
+	return res;
 }
+
 tiny_string XMLBase::removeWhitespace(tiny_string val)
 {
 	bool bwhite = true;

lightspark.tar.xz/src/backends/xml_support.h Changed

@@ -20,33 +20,11 @@
 #ifndef BACKENDS_XML_SUPPORT_H
 #define BACKENDS_XML_SUPPORT_H 1
 
-#include <libxml/tree.h>
-#include <libxml++/parsers/domparser.h>
-#include <libxml++/exceptions/internal_error.h>
-//For xmlCreateFileParserCtxt().
-#include <libxml/parserInternals.h>
 #include "tiny_string.h"
-
+#include <3rdparty/pugixml/src/pugixml.hpp>
 namespace lightspark
 {
 
-#ifdef XMLPP_2_35_1
-//Create a utility derived class from xmlpp::DomParser since we want to use the recovery mode
-class RecoveryDomParser:public xmlpp::DomParser
-{
-public:
-	void parse_memory_raw(const unsigned char* contents, size_type bytes_count);
-};
-//Also create a utility derived class from xmlpp::Document to access the protected constructor
-class RecoveryDocument: public xmlpp::Document
-{
-public:
-	RecoveryDocument(_xmlDoc* d);
-};
-typedef RecoveryDomParser LSDomParser;
-#else
-typedef xmlpp::DomParser LSDomParser;
-#endif
 
 /*
 * Base class for both XML and XMLNode
@@ -55,25 +33,19 @@
 {
 protected:
 	//The parser will destroy the document and all the childs on destruction
-	LSDomParser parser;
-	xmlpp::Node* buildFromString(const std::string& str,
-				 bool ignoreEmptyTextnodes,
-				 bool *hasParent,
-				 const std::string& default_ns=std::string());
-	void addDefaultNamespace(xmlpp::Node *root, const std::string& default_ns);
-	void addDefaultNamespaceRecursive(xmlNodePtr node, xmlNsPtr ns);
-	// Set the root to be a copy of src. If src is a text node,
-	// create a new element node with the same content.
-	xmlpp::Node* buildCopy(const xmlpp::Node* node, bool *hasParent);
-	static std::string quirkCData(const std::string& str);
+	pugi::xml_document xmldoc;
+	const pugi::xml_node buildFromString(const tiny_string& str,
+										unsigned int xmlparsemode,
+										const tiny_string& default_ns=tiny_string());
+
 	static std::string quirkXMLDeclarationInMiddle(const std::string& str);
-	void removeWhitespaceNodes(xmlpp::Node *node);
-	tiny_string removeWhitespace(tiny_string val);
+	static std::string quirkEncodeNull(const std::string value);
+	static tiny_string removeWhitespace(tiny_string val);
 public:
 	static const tiny_string encodeToXML(const tiny_string value, bool bIsAttribute);
 	static std::string parserQuirks(const std::string& str);
 };
 
-};
+}
 
 #endif /* BACKENDS_XML_SUPPORT_H */

lightspark.tar.xz/src/parsing/crossdomainpolicy.cpp Changed

@@ -23,113 +23,115 @@
 
 CrossDomainPolicy::CrossDomainPolicy(const unsigned char* buffer, size_t length, 
 		POLICYFILETYPE _type, POLICYFILESUBTYPE _subtype, bool _master):
-	xml(buffer, length),type(_type),subtype(_subtype),master(_master),siteControlFound(false)
+	type(_type),subtype(_subtype),master(_master),first(true),siteControlFound(false)
 {
+	xml.load_buffer(buffer, length);
+	
 }
 
 CrossDomainPolicy::ELEMENT CrossDomainPolicy::getNextElement()
 {
-	try {
-		while(xml.read())
+	while (true)
+	{
+		if (first)
 		{
-			depth = xml.get_depth();
-			tagName = xml.get_name();
-			attrCount = xml.get_attribute_count();
-
-			//We only handle elements
-			if(xml.get_node_type() != xmlpp::TextReader::Element)
-				continue;
-
-			//Some reasons for marking this file as invalid (extraneous content)
-			if(depth > 1 || xml.has_value() || (depth == 0 && tagName != "cross-domain-policy"))
-			{
+			if (xml.root().name() != "cross-domain-policy")
 				return INVALID;
-			}
-
-			//The root element doesn't need handling
-			if(depth == 0 && tagName == "cross-domain-policy")
-				continue;
+			currentnode = xml.root().first_child();
+		}
+		else
+			currentnode = currentnode.next_sibling();
+		first = false;
+		// last node reached
+		if (currentnode.type() == pugi::node_null)
+			break;
+		//We only handle elements
+		if (currentnode.type() != pugi::node_element)
+			continue;
+		if(!currentnode.empty())
+			return INVALID;
 
-			//We are inside the cross-domain-policy tag so lets handle elements.
+		tagName = currentnode.name();
+		attrCount = 0;
+		for (auto it = currentnode.attributes_begin(); it !=currentnode.attributes_end(); it++)
+			attrCount++;
 
-			//Handle the site-control element, if this is a master file and if the element has attributes
-			if(tagName == "site-control")
+		//We are inside the cross-domain-policy tag so lets handle elements.
+		
+		//Handle the site-control element, if this is a master file and if the element has attributes
+		if(tagName == "site-control")
+		{
+			if(!siteControlFound && master && attrCount == 1)
 			{
-				if(!siteControlFound && master && attrCount == 1)
-				{
-					siteControlFound = true;
-					permittedPolicies = xml.get_attribute("permitted-cross-domain-policies");
-					//Found the required attribute, passing control
-					if(permittedPolicies != "")
-						return SITE_CONTROL;
-					else
-						return INVALID;
-				}
+				siteControlFound = true;
+				permittedPolicies = currentnode.attribute("permitted-cross-domain-policies").value();
+				//Found the required attribute, passing control
+				if(permittedPolicies != "")
+					return SITE_CONTROL;
 				else
 					return INVALID;
 			}
-			//Handle the allow-access-from element if the element has attributes
-			else if(tagName == "allow-access-from")
+			else
+				return INVALID;
+		}
+		//Handle the allow-access-from element if the element has attributes
+		else if(tagName == "allow-access-from")
+		{
+			if(attrCount >= 1 && attrCount <= 3)
 			{
-				if(attrCount >= 1 && attrCount <= 3)
+				domain = currentnode.attribute("domain").value();
+				toPorts = currentnode.attribute("to-ports").value();
+				secure = false;
+				secureSpecified = false;
+				if(currentnode.attribute("secure").value() == "false")
 				{
-					domain = xml.get_attribute("domain");
-					toPorts = xml.get_attribute("to-ports");
 					secure = false;
-					secureSpecified = false;
-					if(xml.get_attribute("secure") == "false")
-					{
-						secure = false;
-						secureSpecified = true;
-					}
-					else if(xml.get_attribute("secure") == "true")
-					{
-						secure = true;
-						secureSpecified = true;
-					}
-					//We found one of the required attributes, passing control
-					if(type == URL && domain != "")
-						return ALLOW_ACCESS_FROM;
-					else if(type == SOCKET && domain != "" && toPorts != "")
-						return ALLOW_ACCESS_FROM;
-					else
-						return INVALID;
+					secureSpecified = true;
 				}
+				else if(currentnode.attribute("secure").value() == "true")
+				{
+					secure = true;
+					secureSpecified = true;
+				}
+				//We found one of the required attributes, passing control
+				if(type == URL && domain != "")
+					return ALLOW_ACCESS_FROM;
+				else if(type == SOCKET && domain != "" && toPorts != "")
+					return ALLOW_ACCESS_FROM;
 				else
 					return INVALID;
 			}
-			//Handle the allow-http-request-headers-from element if the element has attributes and if the policy file type is HTTP(S)
-			else if(tagName == "allow-http-request-headers-from")
+			else
+				return INVALID;
+		}
+		//Handle the allow-http-request-headers-from element if the element has attributes and if the policy file type is HTTP(S)
+		else if(tagName == "allow-http-request-headers-from")
+		{
+			if(type == URL && (subtype == HTTP || subtype == HTTPS) && attrCount >= 2 && attrCount <= 3)
 			{
-				if(type == URL && (subtype == HTTP || subtype == HTTPS) && attrCount >= 2 && attrCount <= 3)
+				domain = currentnode.attribute("domain").value();
+				headers = currentnode.attribute("headers").value();
+				secure = false;
+				secureSpecified = false;
+				if(currentnode.attribute("secure").value() == "false")
 				{
-					domain = xml.get_attribute("domain");
-					headers = xml.get_attribute("headers");
 					secure = false;
-					secureSpecified = false;
-					if(xml.get_attribute("secure") == "false")
-					{
-						secure = false;
-						secureSpecified = true;
-					}
-					else if(xml.get_attribute("secure") == "true")
-					{
-						secure = true;
-						secureSpecified = true;
-					}
-					//We found the required attributes, passing control
-					if(domain != "" && headers != "")
-						return ALLOW_HTTP_REQUEST_HEADERS_FROM;
-					else
-						return INVALID;
+					secureSpecified = true;
 				}
+				else if(currentnode.attribute("secure").value() == "true")
+				{
+					secure = true;
+					secureSpecified = true;
+				}
+				//We found the required attributes, passing control
+				if(domain != "" && headers != "")
+					return ALLOW_HTTP_REQUEST_HEADERS_FROM;
 				else
 					return INVALID;
 			}
+			else
+				return INVALID;
 		}
-	} catch (xmlpp::parse_error&) {
-		// Invalid XML
-		return INVALID;
 	}
 	return END;
 }

lightspark.tar.xz/src/parsing/crossdomainpolicy.h Changed

lightspark.tar.xz/src/parsing/streams.cpp Changed

lightspark.tar.xz/src/parsing/streams.h Changed

lightspark.tar.xz/src/parsing/tags.cpp Changed

@@ -17,9 +17,6 @@
 along with this program. If not, see <http://www.gnu.org/licenses/>.
 **************************************************************************/
 
-#include <libxml++/libxml++.h>
-#include <libxml++/parsers/textreader.h>
-
 #include <vector>
 #include <list>
 #include <algorithm>
@@ -361,7 +358,7 @@
 
 	LOG(LOG_TRACE,"DefineSprite ID: " << SpriteID);
 	//Create a non top level TagFactory
-	TagFactory factory(in, false);
+	TagFactory factory(in);
 	Tag* tag;
 	bool done=false;
 	bool empty=true;
@@ -1696,21 +1693,25 @@
 	in >> XmlString;
 	string XmlStringStd = XmlString;
 
-	try
+	pugi::xml_document xml;
+	if (xml.load_buffer((const unsigned char*)XmlStringStd.c_str(), XmlStringStd.length()).status == pugi::status_ok)
 	{
-		xmlpp::TextReader xml((const unsigned char*)XmlStringStd.c_str(), XmlStringStd.length());
-
+		pugi::xml_node_iterator it1 = xml.root().begin();
 		ostringstream output;
-		while(xml.read())
+		for (;it1 != xml.root().end(); it1++)
 		{
-			if(xml.get_depth() == 2 && xml.get_node_type() == xmlpp::TextReader::Element)
+			pugi::xml_node_iterator it2 = it1->begin();
+			for (;it2 != it1->end(); it2++)
 			{
-				output << endl << "\t" << xml.get_local_name() << ":\t\t" << xml.read_string();
+				if (it2->type() == pugi::node_element)
+				{
+					output << endl << "\t" << xml.name() << ":\t\t" << xml.value();
+				}
 			}
 		}
 		LOG(LOG_INFO, "SWF Metadata:" << output.str());
 	}
-	catch(std::exception& e)
+	else
 	{
 		LOG(LOG_INFO, "SWF Metadata:" << XmlStringStd);
 	}

lightspark.tar.xz/src/parsing/tags.h Changed

lightspark.tar.xz/src/platforms/slowpaths_generic.cpp Changed

lightspark.tar.xz/src/scripting/abc.cpp Changed

@@ -26,8 +26,10 @@
 #include <llvm/ExecutionEngine/ExecutionEngine.h>
 #ifndef LLVM_36
 #include <llvm/ExecutionEngine/JIT.h>
-#endif
+#include "llvm/IR/LegacyPassManager.h"
+#else
 #include <llvm/PassManager.h>
+#endif
 #ifdef HAVE_IR_DATALAYOUT_H
 # include <llvm/IR/Module.h>
 # include <llvm/IR/LLVMContext.h>
@@ -114,6 +116,7 @@
 #include "scripting/flash/text/flashtextengine.h"
 #include "scripting/flash/ui/Keyboard.h"
 #include "scripting/flash/ui/Mouse.h"
+#include "scripting/flash/ui/Multitouch.h"
 #include "scripting/flash/ui/ContextMenu.h"
 #include "scripting/flash/ui/ContextMenuItem.h"
 #include "scripting/flash/ui/ContextMenuBuiltInItems.h"
@@ -359,6 +362,7 @@
 	builtin->registerBuiltin("FontDescription","flash.text.engine",Class<FontDescription>::getRef());
 	builtin->registerBuiltin("FontMetrics","flash.text.engine",Class<FontMetrics>::getRef());
 	builtin->registerBuiltin("FontLookup","flash.text.engine",Class<FontLookup>::getRef());
+	builtin->registerBuiltin("FontPosture","flash.text.engine",Class<FontPosture>::getRef());
 	builtin->registerBuiltin("FontWeight","flash.text.engine",Class<FontWeight>::getRef());
 	builtin->registerBuiltin("Kerning","flash.text.engine",Class<Kerning>::getRef());
 	builtin->registerBuiltin("LineJustification","flash.text.engine",Class<LineJustification>::getRef());
@@ -492,6 +496,7 @@
 	builtin->registerBuiltin("ContextMenuItem","flash.ui",Class<ContextMenuItem>::getRef());
 	builtin->registerBuiltin("ContextMenuBuiltInItems","flash.ui",Class<ContextMenuBuiltInItems>::getRef());
 	builtin->registerBuiltin("Mouse","flash.ui",Class<Mouse>::getRef());
+	builtin->registerBuiltin("Multitouch","flash.ui",Class<Multitouch>::getRef());
 
 	builtin->registerBuiltin("Accelerometer", "flash.sensors",Class<Accelerometer>::getRef());

lightspark.tar.xz/src/scripting/abc.h Changed

lightspark.tar.xz/src/scripting/abc_opcodes.cpp Changed

@@ -389,6 +389,13 @@
 				LOG(LOG_CALLS,_("End of calling ") << *name);
 				return;
 			}
+			else if(!o.isNull())
+			{
+				o->incRef();
+				callImpl(th, o.getPtr(), obj, args, m, called_mi, keepReturn);
+				LOG(LOG_CALLS,_("End of calling ") << *name);
+				return;
+			}
 		}
 		obj->decRef();
 		for(int i=0;i<m;i++)
@@ -683,7 +690,7 @@
 #endif
 
 	f->incRef();
-	ret->setVariableByQName("constructor","",f,DYNAMIC_TRAIT);
+	ret->setVariableByQName("constructor","",f,DECLARED_TRAIT);
 
 	ret->incRef();
 
@@ -743,7 +750,7 @@
 			throwError<TypeError>(kConstructOfNonFunctionError);
 		}
 	}
-
+	ret->setConstructorCallComplete();
 	obj->decRef();
 	LOG(LOG_CALLS,_("End of constructing ") << ret);
 	th->runtime_stack_push(ret);
@@ -1508,6 +1515,19 @@
 		else
 		{
 			LOG(LOG_NOT_IMPLEMENTED,"findPropStrict: " << *name << " not found");
+			for(it=th->scope_stack.rbegin();it!=th->scope_stack.rend();++it)
+			{
+				_R<ASObject> r = it->object;
+				if (!r->is<Class_base>())
+					continue;
+				NS_KIND nskind;
+				if (r->as<Class_base>()->findBorrowedGettable(*name,nskind))
+				{
+					if (!r->as<Class_base>()->isSealed)
+						break;
+					throwError<TypeError>(kCallOfNonFunctionError,name->normalizedNameUnresolved());
+				}
+			}
 			throwError<ReferenceError>(kUndefinedVarError,name->normalizedNameUnresolved());
 			return getSys()->getUndefinedRef();
 		}
@@ -1660,7 +1680,6 @@
 	Class_base* c=NULL;
 	switch (type->getObjectType())
 	{
-		case T_NULL:
 		case T_INTEGER:
 		case T_UINTEGER:
 		case T_NUMBER:
@@ -1668,6 +1687,11 @@
 		case T_STRING:
 			obj->decRef();
 			type->decRef();
+			LOG(LOG_ERROR,"trying to call isTypelate on object:"<<obj->toDebugString());
+			throwError<TypeError>(kIsTypeMustBeClassError);
+		case T_NULL:
+			obj->decRef();
+			type->decRef();
 			LOG(LOG_ERROR,"trying to call isTypelate on null:"<<obj->toDebugString());
 			throwError<TypeError>(kConvertNullToObjectError);
 		case T_UNDEFINED:
@@ -1906,6 +1930,8 @@
 	}
 
 	th->runtime_stack_push(ret);
+	ret->setConstructorCallComplete();
+
 	obj->decRef();
 	LOG(LOG_CALLS,_("End of constructing ") << ret);
 }

lightspark.tar.xz/src/scripting/flash/display/Graphics.cpp Changed

@@ -40,6 +40,7 @@
 	c->setDeclaredMethodByQName("copyFrom","",Class<IFunction>::getFunction(copyFrom),NORMAL_METHOD,true);
 	c->setDeclaredMethodByQName("drawRect","",Class<IFunction>::getFunction(drawRect),NORMAL_METHOD,true);
 	c->setDeclaredMethodByQName("drawRoundRect","",Class<IFunction>::getFunction(drawRoundRect),NORMAL_METHOD,true);
+	c->setDeclaredMethodByQName("drawRoundRectComplex","",Class<IFunction>::getFunction(drawRoundRectComplex),NORMAL_METHOD,true);
 	c->setDeclaredMethodByQName("drawCircle","",Class<IFunction>::getFunction(drawCircle),NORMAL_METHOD,true);
 	c->setDeclaredMethodByQName("drawEllipse","",Class<IFunction>::getFunction(drawEllipse),NORMAL_METHOD,true);
 	c->setDeclaredMethodByQName("drawPath","",Class<IFunction>::getFunction(drawPath),NORMAL_METHOD,true);
@@ -247,6 +248,33 @@
 	return NULL;
 }
 
+ASFUNCTIONBODY(Graphics,drawRoundRectComplex)
+{
+	LOG(LOG_NOT_IMPLEMENTED,"Graphics.drawRoundRectComplex currently draws a normal rect");
+	Graphics* th=static_cast<Graphics*>(obj);
+	assert_and_throw(argslen>=4);
+	th->checkAndSetScaling();
+
+	int x=args[0]->toInt();
+	int y=args[1]->toInt();
+	int width=args[2]->toInt();
+	int height=args[3]->toInt();
+
+	const Vector2 a(x,y);
+	const Vector2 b(x+width,y);
+	const Vector2 c(x+width,y+height);
+	const Vector2 d(x,y+height);
+
+	th->owner->tokens.emplace_back(GeomToken(MOVE, a));
+	th->owner->tokens.emplace_back(GeomToken(STRAIGHT, b));
+	th->owner->tokens.emplace_back(GeomToken(STRAIGHT, c));
+	th->owner->tokens.emplace_back(GeomToken(STRAIGHT, d));
+	th->owner->tokens.emplace_back(GeomToken(STRAIGHT, a));
+	th->owner->owner->requestInvalidation(getSys());
+	
+	return NULL;
+}
+
 ASFUNCTIONBODY(Graphics,drawCircle)
 {
 	Graphics* th=static_cast<Graphics*>(obj);

lightspark.tar.xz/src/scripting/flash/display/Graphics.h Changed

lightspark.tar.xz/src/scripting/flash/display/flashdisplay.cpp Changed

@@ -1535,7 +1535,7 @@
 	dynamicDisplayList.clear();
 }
 
-InteractiveObject::InteractiveObject(Class_base* c):DisplayObject(c),mouseEnabled(true),doubleClickEnabled(false),tabEnabled(false),tabIndex(-1)
+InteractiveObject::InteractiveObject(Class_base* c):DisplayObject(c),mouseEnabled(true),doubleClickEnabled(false),accessibilityImplementation(NullRef),contextMenu(NullRef),tabEnabled(false),tabIndex(-1)
 {
 }
 
@@ -1601,12 +1601,14 @@
 	c->setDeclaredMethodByQName("mouseEnabled","",Class<IFunction>::getFunction(_getMouseEnabled),GETTER_METHOD,true);
 	c->setDeclaredMethodByQName("doubleClickEnabled","",Class<IFunction>::getFunction(_setDoubleClickEnabled),SETTER_METHOD,true);
 	c->setDeclaredMethodByQName("doubleClickEnabled","",Class<IFunction>::getFunction(_getDoubleClickEnabled),GETTER_METHOD,true);
+	REGISTER_GETTER_SETTER(c, accessibilityImplementation);
 	REGISTER_GETTER_SETTER(c, contextMenu);
 	REGISTER_GETTER_SETTER(c, tabEnabled);
 	REGISTER_GETTER_SETTER(c, tabIndex);
 	REGISTER_GETTER_SETTER(c, focusRect);
 }
 
+ASFUNCTIONBODY_GETTER_SETTER(InteractiveObject, accessibilityImplementation);
 ASFUNCTIONBODY_GETTER_SETTER(InteractiveObject, contextMenu);
 ASFUNCTIONBODY_GETTER_SETTER(InteractiveObject, tabEnabled);
 ASFUNCTIONBODY_GETTER_SETTER(InteractiveObject, tabIndex);

lightspark.tar.xz/src/scripting/flash/display/flashdisplay.h Changed

lightspark.tar.xz/src/scripting/flash/net/URLStream.cpp Changed

@@ -33,7 +33,7 @@
 using namespace lightspark;
 
 URLStreamThread::URLStreamThread(_R<URLRequest> request, _R<URLStream> ldr, _R<ByteArray> bytes)
- : DownloaderThreadBase(request, ldr.getPtr()), loader(ldr), data(bytes),streambuffer(NULL)
+ : DownloaderThreadBase(request, ldr.getPtr()), loader(ldr), data(bytes),streambuffer(NULL),timestamp_last_progress(0)
 {
 }
 void URLStreamThread::setBytesLoaded(uint32_t b)
@@ -42,16 +42,22 @@
 	if(b>curlen && streambuffer)
 	{
 		data->append(streambuffer,b - curlen);
-		loader->incRef();
-		getVm()->addEvent(loader,_MR(Class<ProgressEvent>::getInstanceS(b,0)));
+		uint64_t cur=compat_get_thread_cputime_us();
+		if (cur > timestamp_last_progress+ 40*1000)
+		{
+			timestamp_last_progress = cur;
+			loader->incRef();
+			getVm()->addEvent(loader,_MR(Class<ProgressEvent>::getInstanceS(b,0)));
+		}
 	}
 }
 
 void URLStreamThread::execute()
 {
+	timestamp_last_progress = compat_get_thread_cputime_us();
 	assert(!downloader);
 
-	//TODO: support httpStatus, progress events
+	//TODO: support httpStatus
 
 	_R<MemoryStreamCache> cache(_MR(new MemoryStreamCache));
 	if(!createDownloader(cache, loader,this))

lightspark.tar.xz/src/scripting/flash/net/URLStream.h Changed

lightspark.tar.xz/src/scripting/flash/system/flashsystem.cpp Changed

lightspark.tar.xz/src/scripting/flash/text/flashtext.cpp Changed

@@ -17,16 +17,13 @@
 along with this program. If not, see <http://www.gnu.org/licenses/>.
 **************************************************************************/
 
-#include <libxml++/nodes/element.h>
-#include <libxml++/parsers/domparser.h>
-#include <libxml++/exceptions/exception.h>
-#include <libxml/tree.h>
 #include "scripting/flash/text/flashtext.h"
 #include "scripting/class.h"
 #include "compat.h"
 #include "backends/geometry.h"
 #include "backends/graphics.h"
 #include "scripting/argconv.h"
+#include <3rdparty/pugixml/src/pugixml.hpp>
 
 using namespace std;
 using namespace lightspark;
@@ -878,15 +875,14 @@
 
 tiny_string TextField::toHtmlText()
 {
-	xmlpp::DomParser parser;
-	xmlpp::Document *doc = parser.get_document();
-	xmlpp::Element *root = doc->create_root_node("font");
+	pugi::xml_document doc;
+	pugi::xml_node root = doc.append_child("font");
 
 	ostringstream ss;
 	ss << fontSize;
-	root->set_attribute("size", ss.str());
-	root->set_attribute("color", textColor.toString());
-	root->set_attribute("face", font);
+	root.append_attribute("size").set_value(ss.str().c_str());
+	root.append_attribute("color").set_value(textColor.toString().raw_buf());
+	root.append_attribute("face").set_value(font.raw_buf());
 
 	//Split text into paragraphs and wraps them into tags
 	uint32_t para_start = 0;
@@ -897,15 +893,13 @@
 		if (para_end == text.npos)
 			para_end = text.numChars();
 
-		xmlpp::Element *pNode = root->add_child("p");
-		pNode->add_child_text(text.substr(para_start, para_end));
+		root.append_child("p").set_value(text.substr(para_start, para_end).raw_buf());
 		para_start = para_end + 1;
 	} while (para_end < text.numChars());
 
-	xmlBufferPtr buf = xmlBufferCreateSize(4096);
-	xmlNodeDump(buf, doc->cobj(), doc->get_root_node()->cobj(), 0, 0);
-	tiny_string ret = tiny_string((char*)buf->content,true);
-	xmlBufferFree(buf);
+	ostringstream buf;
+	doc.print(buf);
+	tiny_string ret = tiny_string(buf.str());
 	return ret;
 }
 
@@ -1017,28 +1011,26 @@
 	textdata->text = "";
 
 	tiny_string rooted = tiny_string("<root>") + html + tiny_string("</root>");
-	try
+	pugi::xml_document doc;
+	if (doc.load_buffer(rooted.raw_buf(),rooted.numBytes()).status == pugi::status_ok)
 	{
-		parse_memory_raw((const unsigned char*)rooted.raw_buf(), rooted.numBytes());
+		doc.traverse(*this);
 	}
-	catch (xmlpp::exception& exc)
+	else
 	{
 		LOG(LOG_ERROR, "TextField HTML parser error");
 		return;
 	}
 }
 
-void TextField::HtmlTextParser::on_start_element(const Glib::ustring& name,
-						 const xmlpp::SaxParser::AttributeList& attributes)
+bool TextField::HtmlTextParser::for_each(pugi::xml_node &node)
 {
-	if (!textdata)
-		return;
 
-	if (name == "root")
-	{
-		return;
-	}
-	else if (name == "br")
+	if (!textdata)
+		return true;
+	tiny_string name = node.name();
+	textdata->text += node.value();
+	if (name == "br")
 	{
 		if (textdata->multiline)
 			textdata->text += "\n";
@@ -1058,22 +1050,23 @@
 		if (!textdata->text.empty())
 		{
 			LOG(LOG_NOT_IMPLEMENTED, "Font can be defined only in the beginning");
-			return;
+			return false;
 		}
 
-		for (auto it=attributes.begin(); it!=attributes.end(); ++it)
+		for (auto it=node.attributes_begin(); it!=node.attributes_end(); ++it)
 		{
-			if (it->name == "face")
+			tiny_string attrname = it->name();
+			if (attrname == "face")
 			{
-				textdata->font = it->value;
+				textdata->font = it->value();
 			}
-			else if (it->name == "size")
+			else if (attrname == "size")
 			{
-				textdata->fontSize = parseFontSize(it->value, textdata->fontSize);
+				textdata->fontSize = parseFontSize(it->value(), textdata->fontSize);
 			}
-			else if (it->name == "color")
+			else if (attrname == "color")
 			{
-				textdata->textColor = RGB(tiny_string(it->value));
+				textdata->textColor = RGB(tiny_string(it->value()));
 			}
 		}
 	}
@@ -1081,36 +1074,13 @@
 		 name == "li" || name == "b" || name == "i" ||
 		 name == "span" || name == "textformat" || name == "tab")
 	{
-		LOG(LOG_NOT_IMPLEMENTED, _("Unsupported tag in TextField: ") + name);
+		LOG(LOG_NOT_IMPLEMENTED, _("Unsupported tag in TextField: ") << name);
 	}
 	else
 	{
-		LOG(LOG_NOT_IMPLEMENTED, _("Unknown tag in TextField: ") + name);
-	}
-}
-
-void TextField::HtmlTextParser::on_end_element(const Glib::ustring& name)
-{
-	if (!textdata)
-		return;
-
-	if (name == "p")
-	{
-		if (textdata->multiline)
-		{
-			if (!textdata->text.empty() && 
-			 !textdata->text.endsWith("\n"))
-				textdata->text += "\n";
-		}
+		LOG(LOG_NOT_IMPLEMENTED, _("Unknown tag in TextField: ") << name);
 	}
-}
-
-void TextField::HtmlTextParser::on_characters(const Glib::ustring& characters)
-{
-	if (!textdata)
-		return;
-
-	textdata->text += characters;
+	return true;
 }
 
 uint32_t TextField::HtmlTextParser::parseFontSize(const Glib::ustring& sizestr,

lightspark.tar.xz/src/scripting/flash/text/flashtext.h Changed

lightspark.tar.xz/src/scripting/flash/text/flashtextengine.cpp Changed

@@ -61,6 +61,8 @@
 {
 	CLASS_SETUP(c, ASObject, _constructor, CLASS_FINAL | CLASS_SEALED);
 	c->setVariableByQName("GRAPHIC_ELEMENT","",abstract_ui(0xFDEF),CONSTANT_TRAIT);
+	c->setDeclaredMethodByQName("clone","",Class<IFunction>::getFunction(_clone),NORMAL_METHOD,true);
+
 	REGISTER_GETTER_SETTER(c,alignmentBaseline);
 	REGISTER_GETTER_SETTER(c,alpha);
 	REGISTER_GETTER_SETTER(c,baselineShift);
@@ -108,6 +110,31 @@
 			(th->digitWidth, "default")(th->ligatureLevel, "common")(th->typographicCase, "default");
 	return NULL;
 }
+ASFUNCTIONBODY(ElementFormat, _clone)
+{
+	ElementFormat* th=static_cast<ElementFormat*>(obj);
+
+	ElementFormat* newformat = Class<ElementFormat>::getInstanceS();
+	newformat->fontDescription = th->fontDescription;
+	newformat->fontSize = th->fontSize;
+	newformat->color = th->color;
+	newformat->alpha = th->alpha;
+	newformat->textRotation = th->textRotation;
+	newformat->dominantBaseline = th->dominantBaseline;
+	newformat->alignmentBaseline = th->alignmentBaseline;
+	newformat->baselineShift = th->baselineShift;
+	newformat->kerning = th->kerning;
+	newformat->trackingRight = th->trackingRight;
+	newformat->trackingLeft = th->trackingLeft;
+	newformat->locale = th->locale;
+	newformat->breakOpportunity = th->breakOpportunity;
+	newformat->digitCase = th->digitCase;
+	newformat->digitWidth = th->digitWidth;
+	newformat->ligatureLevel = th->ligatureLevel;
+	newformat->typographicCase = th->typographicCase;
+	newformat->locked = false;
+	return newformat;
+}
 
 void FontLookup::sinit(Class_base* c)
 {
@@ -119,6 +146,7 @@
 void FontDescription::sinit(Class_base* c)
 {
 	CLASS_SETUP(c, ASObject, _constructor, CLASS_FINAL | CLASS_SEALED);
+	c->setDeclaredMethodByQName("clone","",Class<IFunction>::getFunction(_clone),NORMAL_METHOD,true);
 	REGISTER_GETTER_SETTER(c,cffHinting);
 	REGISTER_GETTER_SETTER(c,fontLookup);
 	REGISTER_GETTER_SETTER(c,fontName);
@@ -141,6 +169,27 @@
 ASFUNCTIONBODY_GETTER_SETTER(FontDescription,locked)
 ASFUNCTIONBODY_GETTER_SETTER(FontDescription,renderingMode)
 
+ASFUNCTIONBODY(FontDescription, _clone)
+{
+	FontDescription* th=static_cast<FontDescription*>(obj);
+
+	FontDescription* newfontdescription = Class<FontDescription>::getInstanceS();
+	newfontdescription->cffHinting = th->cffHinting;
+	newfontdescription->fontLookup = th->fontLookup;
+	newfontdescription->fontName = th->fontName;
+	newfontdescription->fontPosture = th->fontPosture;
+	newfontdescription->fontWeight = th->fontWeight;
+	newfontdescription->renderingMode = th->renderingMode;
+	newfontdescription->locked = false;
+	return newfontdescription;
+}
+
+void FontPosture::sinit(Class_base* c)
+{
+	CLASS_SETUP_NO_CONSTRUCTOR(c, ASObject, CLASS_FINAL | CLASS_SEALED);
+	c->setVariableByQName("ITALIC","",Class<ASString>::getInstanceS("italic"),CONSTANT_TRAIT);
+	c->setVariableByQName("NORMAL","",Class<ASString>::getInstanceS("normal"),CONSTANT_TRAIT);
+}
 void FontWeight::sinit(Class_base* c)
 {
 	CLASS_SETUP_NO_CONSTRUCTOR(c, ASObject, CLASS_FINAL | CLASS_SEALED);
@@ -217,16 +266,25 @@
 	return NULL;
 }
 
+TextBlock::TextBlock(Class_base *c): ASObject(c),firstLine(NullRef),lastLine(NullRef),bidiLevel(0)
+{
+}
+
 void TextBlock::sinit(Class_base* c)
 {
 	CLASS_SETUP(c, ASObject, _constructor, CLASS_FINAL | CLASS_SEALED);
 	c->setDeclaredMethodByQName("createTextLine","",Class<IFunction>::getFunction(createTextLine),NORMAL_METHOD,true);
 	c->setDeclaredMethodByQName("recreateTextLine","",Class<IFunction>::getFunction(recreateTextLine),NORMAL_METHOD,true);
+	c->setDeclaredMethodByQName("releaseLines","",Class<IFunction>::getFunction(releaseLines),NORMAL_METHOD,true);
+	REGISTER_GETTER(c, firstLine);
+	REGISTER_GETTER(c, lastLine);
 	REGISTER_GETTER_SETTER(c, content);
 	REGISTER_GETTER_SETTER(c, textJustifier);
 	REGISTER_GETTER_SETTER(c, bidiLevel);
 }
 
+ASFUNCTIONBODY_GETTER(TextBlock, firstLine)
+ASFUNCTIONBODY_GETTER(TextBlock, lastLine)
 ASFUNCTIONBODY_GETTER_SETTER(TextBlock, content)
 ASFUNCTIONBODY_GETTER_SETTER(TextBlock, textJustifier)
 ASFUNCTIONBODY_GETTER_SETTER(TextBlock, bidiLevel)
@@ -268,19 +326,39 @@
 	LOG(LOG_NOT_IMPLEMENTED,"splitting textblock in multiple lines not implemented");
 	th->content->as<TextElement>()->text = "";
 	th->incRef();
-	TextLine *textLine = Class<TextLine>::getInstanceS(linetext, _MNR(th));
+	_NR<TextLine> textLine = _NR<TextLine>(Class<TextLine>::getInstanceS(linetext, _MNR(th)));
 	textLine->width = (uint32_t)width;
 	textLine->previousLine = previousLine;
 	textLine->updateSizes();
 	if (textLine->width > textLine->textWidth)
 	{
-		delete textLine;
+		textLine->decRef();
 		th->decRef();
 		return NULL;
 	}
-	if (!previousLine.isNull())
-		previousLine->nextLine == textLine;
-	return textLine;
+	if (previousLine.isNull())
+	{
+		textLine->incRef();
+		th->firstLine = textLine;
+		if (th->lastLine.isNull())
+		{
+			textLine->incRef();
+			th->lastLine = textLine;
+		}
+	}
+	else
+	{
+		if (th->lastLine == previousLine)
+		{
+			th->lastLine->decRef();
+			textLine->incRef();
+			th->lastLine = textLine;
+		}
+		textLine->incRef();
+		previousLine->nextLine = textLine;
+	}
+	
+	return textLine.getPtr();
 }
 ASFUNCTIONBODY(TextBlock, recreateTextLine)
 {
@@ -329,6 +407,53 @@
 	return textLine.getPtr();
 }
 
+ASFUNCTIONBODY(TextBlock, releaseLines)
+{
+	TextBlock* th=static_cast<TextBlock*>(obj);
+	_NR<TextLine> firstLine;
+	_NR<TextLine> lastLine;
+	ARG_UNPACK (firstLine) (lastLine);
+
+
+	// TODO handle non TextElement Content
+	if (th->content.isNull() || !th->content->is<TextElement>() || th->content->as<TextElement>()->text.empty())
+		return NULL;
+
+	if (firstLine.isNull() || firstLine->textBlock != th)
+	{
+		throwError<ArgumentError>(kInvalidArgumentError,"Invalid argument: firstLine");
+	}
+	if (lastLine.isNull() || lastLine->textBlock != th)
+	{
+		throwError<ArgumentError>(kInvalidArgumentError,"Invalid argument: lastLine");
+	}
+
+	bool afterlast = false;
+	_NR<TextLine> tmpLine;
+	_NR<TextLine> tmpLine2;
+	while (!firstLine.isNull())
+	{
+		firstLine->validity = "invalid";
+		tmpLine2 = firstLine->nextLine;
+		if (!afterlast)
+		{
+			if (!firstLine->previousLine.isNull())
+			{
+				tmpLine = firstLine->previousLine;
+				firstLine->previousLine = NullRef;
+				tmpLine->decRef();
+			}
+			firstLine->textBlock = NullRef;
+			firstLine->nextLine = NullRef;
+		}
+		if (firstLine == lastLine)
+			afterlast = true;
+		firstLine = tmpLine2;
+	}
+	
+	return NULL;
+}
+
 void TextElement::sinit(Class_base* c)
 {
 	CLASS_SETUP(c, ContentElement, _constructor, CLASS_FINAL | CLASS_SEALED);

lightspark.tar.xz/src/scripting/flash/text/flashtextengine.h Changed

@@ -45,6 +45,7 @@
 	ElementFormat(Class_base* c);
 	static void sinit(Class_base* c);
 	ASFUNCTION(_constructor);
+	ASFUNCTION(_clone);
 	ASPROPERTY_GETTER_SETTER(tiny_string,alignmentBaseline);
 	ASPROPERTY_GETTER_SETTER(number_t,alpha);
 	ASPROPERTY_GETTER_SETTER(number_t,baselineShift);
@@ -79,6 +80,7 @@
 		cffHinting("horizontalStem"), fontLookup("device"), fontName("_serif"), fontPosture("normal"), fontWeight("normal"),locked(false), renderingMode("cff") {}
 	static void sinit(Class_base* c);
 	ASFUNCTION(_constructor);
+	ASFUNCTION(_clone);
 	ASPROPERTY_GETTER_SETTER(tiny_string,cffHinting);
 	ASPROPERTY_GETTER_SETTER(tiny_string,fontLookup);
 	ASPROPERTY_GETTER_SETTER(tiny_string,fontName);
@@ -88,6 +90,12 @@
 	ASPROPERTY_GETTER_SETTER(tiny_string,renderingMode);
 };
 
+class FontPosture: public ASObject
+{
+public:
+	FontPosture(Class_base* c): ASObject(c) {}
+	static void sinit(Class_base* c);
+};
 class FontWeight: public ASObject
 {
 public:
@@ -147,14 +155,18 @@
 	ASFUNCTION(_constructor);
 };
 
+class TextLine;
 class TextBlock: public ASObject
 {
 public:
-	TextBlock(Class_base* c): ASObject(c),bidiLevel(0) {}
+	TextBlock(Class_base* c);
 	static void sinit(Class_base* c);
 	ASFUNCTION(_constructor);
 	ASFUNCTION(createTextLine);
 	ASFUNCTION(recreateTextLine);
+	ASFUNCTION(releaseLines);
+	ASPROPERTY_GETTER(_NR<TextLine>, firstLine);
+	ASPROPERTY_GETTER(_NR<TextLine>, lastLine);
 	ASPROPERTY_GETTER_SETTER(_NR<ContentElement>, content);
 	ASPROPERTY_GETTER_SETTER(_NR<TextJustifier>, textJustifier);
 	ASPROPERTY_GETTER_SETTER(int,bidiLevel);

lightspark.tar.xz/src/scripting/flash/ui/Multitouch.cpp Added

@@ -0,0 +1,67 @@
+/**************************************************************************
+ Lightspark, a free flash player implementation
+
+ Copyright (C) 2013 Antti Ajanki (antti.ajanki@iki.fi)
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Lesser General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program 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 for more details.
+
+ You should have received a copy of the GNU Lesser General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+**************************************************************************/
+
+#include "scripting/flash/ui/Multitouch.h"
+#include "scripting/toplevel/Vector.h"
+#include "scripting/toplevel/ASString.h"
+#include "scripting/toplevel/Error.h"
+#include "scripting/class.h"
+#include "scripting/argconv.h"
+#include "swf.h"
+
+using namespace std;
+using namespace lightspark;
+
+void Multitouch::sinit(Class_base* c)
+{
+	CLASS_SETUP(c, ASObject, _constructorNotInstantiatable, CLASS_FINAL | CLASS_SEALED);
+	c->setDeclaredMethodByQName("inputMode","",Class<IFunction>::getFunction(getInputMode),GETTER_METHOD,false);
+	c->setDeclaredMethodByQName("maxTouchPoints","",Class<IFunction>::getFunction(getMaxTouchPoints),GETTER_METHOD,false);
+	c->setDeclaredMethodByQName("supportedGestures","",Class<IFunction>::getFunction(getSupportedGestures),GETTER_METHOD,false);
+	c->setDeclaredMethodByQName("supportsGestureEvents","",Class<IFunction>::getFunction(getSupportsGestureEvents),GETTER_METHOD,false);
+	c->setDeclaredMethodByQName("supportsTouchEvents","",Class<IFunction>::getFunction(getSupportsTouchEvents),GETTER_METHOD,false);
+}
+
+ASFUNCTIONBODY(Multitouch, getInputMode)
+{
+	LOG(LOG_NOT_IMPLEMENTED,"Multitouch not supported");
+	return Class<ASString>::getInstanceS("gesture");
+}
+
+ASFUNCTIONBODY(Multitouch, getMaxTouchPoints)
+{
+	LOG(LOG_NOT_IMPLEMENTED,"Multitouch not supported");
+	return abstract_i(1);
+}
+
+ASFUNCTIONBODY(Multitouch, getSupportedGestures)
+{
+	LOG(LOG_NOT_IMPLEMENTED,"Multitouch not supported");
+	return Class<Vector>::getInstanceS(); 
+}
+ASFUNCTIONBODY(Multitouch, getSupportsGestureEvents)
+{
+	LOG(LOG_NOT_IMPLEMENTED,"Multitouch not supported");
+	return abstract_b(false); 
+}
+ASFUNCTIONBODY(Multitouch, getSupportsTouchEvents)
+{
+	LOG(LOG_NOT_IMPLEMENTED,"Multitouch not supported");
+	return abstract_b(false); 
+}

lightspark.tar.xz/src/scripting/flash/ui/Multitouch.h Added

@@ -0,0 +1,41 @@
+/**************************************************************************
+ Lightspark, a free flash player implementation
+
+ Copyright (C) 2013 Antti Ajanki (antti.ajanki@iki.fi)
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Lesser General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program 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 for more details.
+
+ You should have received a copy of the GNU Lesser General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+**************************************************************************/
+
+#ifndef SCRIPTING_FLASH_UI_MULTITOUCH_H
+#define SCRIPTING_FLASH_UI_MULTITOUCH_H 1
+
+#include "asobject.h"
+namespace lightspark
+{
+
+class Multitouch : public ASObject
+{
+public:
+	Multitouch(Class_base* c):ASObject(c){}
+	static void sinit(Class_base* c);
+	ASFUNCTION(getInputMode);
+	ASFUNCTION(getMaxTouchPoints);
+	ASFUNCTION(getSupportedGestures);
+	ASFUNCTION(getSupportsGestureEvents);
+	ASFUNCTION(getSupportsTouchEvents);
+};
+
+}
+
+#endif /* SCRIPTING_FLASH_UI_MULTITOUCH_H */

lightspark.tar.xz/src/scripting/flash/utils/Proxy.cpp Changed

@@ -50,7 +50,6 @@
 	ARG_UNPACK(name);
 	multiname mname(NULL);
 	name->applyProxyProperty(mname);
-	LOG(LOG_ERROR,"isAttr:"<<mname.isAttribute);
 	return abstract_b(mname.isAttribute);
 }
 
@@ -99,12 +98,12 @@
 	//It seems that various kind of implementation works only with the empty namespace
 	assert_and_throw(name.ns.size()>0);
 	_NR<ASObject> o;
-	LOG(LOG_CALLS,"Proxy::getVar "<< name << " " << this->toDebugString());
+	LOG(LOG_CALLS,"Proxy::getVar "<< name << " " << this->toDebugString()<<" "<<ASObject::hasPropertyByMultiname(name, true, true));
 	if(ASObject::hasPropertyByMultiname(name, true, true) || !implEnable || (opt & ASObject::SKIP_IMPL)!=0)
 		o = ASObject::getVariableByMultiname(name,opt);
 	if (!o.isNull() || !implEnable || (opt & ASObject::SKIP_IMPL)!=0)
 		return o;
-
+		
 	//Check if there is a custom getter defined, skipping implementation to avoid recursive calls
 	multiname getPropertyName(NULL);
 	getPropertyName.name_type=multiname::NAME_STRING;
@@ -259,4 +258,7 @@
 	incRef();
 	return _MR(f->call(this,&arg,1));
 }
-
+bool Proxy::isConstructed() const
+{
+	return ASObject::isConstructed() && constructorCallComplete;
+}

lightspark.tar.xz/src/scripting/flash/utils/Proxy.h Changed

lightspark.tar.xz/src/scripting/flash/xml/flashxml.cpp Changed

@@ -16,8 +16,6 @@
 You should have received a copy of the GNU Lesser General Public License
 along with this program. If not, see <http://www.gnu.org/licenses/>.
 **************************************************************************/
-#include <libxml/tree.h>
-#include <libxml++/nodes/textnode.h>
 
 #include "scripting/flash/xml/flashxml.h"
 #include "scripting/flash/utils/ByteArray.h"
@@ -29,7 +27,7 @@
 using namespace std;
 using namespace lightspark;
 
-XMLNode::XMLNode(Class_base* c, _R<XMLDocument> _r, xmlpp::Node* _n):ASObject(c),root(_r),node(_n)
+XMLNode::XMLNode(Class_base* c, _R<XMLDocument> _r, pugi::xml_node _n):ASObject(c),root(_r),node(_n)
 {
 }
 
@@ -81,13 +79,11 @@
 {
 	XMLNode* th=Class<XMLNode>::cast(obj);
 	assert_and_throw(argslen==0);
-	//We assume NULL node is like empty node
-	if(th->node==NULL || th->node->cobj()->type==XML_TEXT_NODE)
+	if(th->node.type()==pugi::node_null || th->node.type() == pugi::node_pcdata)
 		return getSys()->getNullRef();
-	const xmlpp::Node::NodeList& children=th->node->get_children();
-	if(children.empty())
+	pugi::xml_node newNode =th->node.first_child();
+	if(newNode.type() == pugi::node_null)
 		return getSys()->getNullRef();
-	xmlpp::Node* newNode=children.front();
 	assert_and_throw(!th->root.isNull());
 	return Class<XMLNode>::getInstanceS(th->root,newNode);
 }
@@ -96,13 +92,11 @@
 {
 	XMLNode* th=Class<XMLNode>::cast(obj);
 	assert_and_throw(argslen==0);
-	//We assume NULL node is like empty node
-	if(th->node==NULL || th->node->cobj()->type==XML_TEXT_NODE)
+	if(th->node.type()==pugi::node_null || th->node.type() == pugi::node_pcdata)
 		return getSys()->getNullRef();
-	const xmlpp::Node::NodeList& children=th->node->get_children();
-	if(children.empty())
+	pugi::xml_node newNode =th->node.last_child();
+	if(newNode.type() == pugi::node_null)
 		return getSys()->getNullRef();
-	xmlpp::Node* newNode=children.back();
 	assert_and_throw(!th->root.isNull());
 	return Class<XMLNode>::getInstanceS(th->root,newNode);
 }
@@ -112,14 +106,13 @@
 	XMLNode* th=Class<XMLNode>::cast(obj);
 	Array* ret = Class<Array>::getInstanceS();
 	assert_and_throw(argslen==0);
-	if(th->node==NULL) //We assume NULL node is like empty node
+	if(th->node.type()==pugi::node_null)
 		return ret;
 	assert_and_throw(!th->root.isNull());
-	const xmlpp::Node::NodeList& children=th->node->get_children();
-	xmlpp::Node::NodeList::const_iterator it = children.begin();
-	for(;it!=children.end();++it)
+	auto it = th->node.begin();
+	for(;it!=th->node.end();++it)
 	{
-		if((*it)->cobj()->type!=XML_TEXT_NODE) {
+		if(it->type()!=pugi::node_pcdata) {
 			ret->push(_MR(Class<XMLNode>::getInstanceS(th->root, *it)));
 		}
 	}
@@ -132,43 +125,28 @@
 	XMLNode* th=Class<XMLNode>::cast(obj);
 	assert_and_throw(argslen==0);
 	ASObject* ret=Class<ASObject>::getInstanceS();
-	if(th->node==NULL) //We assume NULL node is like empty node
+	if(th->node.type()==pugi::node_null)
 		return ret;
-	//Needed dynamic cast, we want the type check
-	xmlpp::Element* elem=dynamic_cast<xmlpp::Element*>(th->node);
-	if(elem==NULL)
-		return ret;
-	const xmlpp::Element::AttributeList& list=elem->get_attributes();
-	xmlpp::Element::AttributeList::const_iterator it=list.begin();
-	for(;it!=list.end();++it)
+	auto it=th->node.attributes_begin();
+	for(;it!=th->node.attributes_end();++it)
 	{
-		tiny_string attrName((*it)->get_name().c_str(),true);
-		const tiny_string nsName((*it)->get_namespace_prefix().c_str(),true);
-		if(nsName!="")
-			attrName=nsName+":"+attrName;
-		ASString* attrValue=Class<ASString>::getInstanceS((*it)->get_value().c_str());
+		tiny_string attrName = it->name();
+		ASString* attrValue=Class<ASString>::getInstanceS(it->value());
 		ret->setVariableByQName(attrName,"",attrValue,DYNAMIC_TRAIT);
 	}
 	return ret;
 }
 
-xmlpp::Node *XMLNode::getParentNode()
+pugi::xml_node XMLNode::getParentNode()
 {
-	if (!node)
-		return NULL;
-
-	xmlpp::Node *parent = node->get_parent();
-	if (parent)
-		return parent;
-	else
-		return NULL;
+	return node.parent();
 }
 
 ASFUNCTIONBODY(XMLNode,parentNode)
 {
 	XMLNode* th=Class<XMLNode>::cast(obj);
-	xmlpp::Node *parent = th->getParentNode();
-	if (parent)
+	pugi::xml_node parent = th->getParentNode();
+	if (parent.type()!=pugi::node_null)
 		return Class<XMLNode>::getInstanceS(th->root, parent);
 	else
 		return getSys()->getNullRef();
@@ -177,11 +155,11 @@
 ASFUNCTIONBODY(XMLNode,nextSibling)
 {
 	XMLNode* th=Class<XMLNode>::cast(obj);
-	if(th->node==NULL)
+	if(th->node.type()==pugi::node_null)
 		return getSys()->getNullRef();
 
-	xmlpp::Node *sibling = th->node->get_next_sibling();
-	if (sibling)
+	pugi::xml_node sibling = th->node.next_sibling();
+	if (sibling.type()!=pugi::node_null)
 		return Class<XMLNode>::getInstanceS(th->root, sibling);
 	else
 		return getSys()->getNullRef();
@@ -190,11 +168,11 @@
 ASFUNCTIONBODY(XMLNode,previousSibling)
 {
 	XMLNode* th=Class<XMLNode>::cast(obj);
-	if(th->node==NULL)
+	if(th->node.type()==pugi::node_null)
 		return getSys()->getNullRef();
 
-	xmlpp::Node *sibling = th->node->get_previous_sibling();
-	if (sibling)
+	pugi::xml_node sibling = th->node.previous_sibling();
+	if (sibling.type()!=pugi::node_null)
 		return Class<XMLNode>::getInstanceS(th->root, sibling);
 	else
 		return getSys()->getNullRef();
@@ -203,21 +181,42 @@
 ASFUNCTIONBODY(XMLNode,_getNodeType)
 {
 	XMLNode* th=Class<XMLNode>::cast(obj);
-	return abstract_i(th->node->cobj()->type);
+	int t = 0;
+	switch (th->node.type())
+	{
+		case pugi::node_element:
+			t = 1;
+			break;
+		case pugi::node_pcdata:
+			t = 3;
+			break;
+		case pugi::node_declaration: 
+			t = 5;
+			break;
+		case pugi::node_pi:
+			t = 9;
+			break;
+		case pugi::node_document:
+			t = 11;
+			break;
+		default:
+			LOG(LOG_NOT_IMPLEMENTED,"XMLNode.getNodeType: unhandled type:"<<th->node.type());
+			break;
+	}
+	return abstract_i(t);
 }
 
 ASFUNCTIONBODY(XMLNode,_getNodeName)
 {
 	XMLNode* th=Class<XMLNode>::cast(obj);
-	return Class<ASString>::getInstanceS((const char*)th->node->cobj()->name);
+	return Class<ASString>::getInstanceS(th->node.name());
 }
 
 ASFUNCTIONBODY(XMLNode,_getNodeValue)
 {
 	XMLNode* th=Class<XMLNode>::cast(obj);
-	xmlpp::TextNode* textnode=dynamic_cast<xmlpp::TextNode*>(th->node);
-	if(textnode)
-		return Class<ASString>::getInstanceS(textnode->get_content());
+	if(th->node.type() == pugi::node_pcdata)
+		return Class<ASString>::getInstanceS(th->node.value());
 	else
 		return getSys()->getNullRef();
 }
@@ -233,21 +232,14 @@
 	return toString_priv(node);
 }
 
-tiny_string XMLNode::toString_priv(xmlpp::Node *outputNode)
+tiny_string XMLNode::toString_priv(pugi::xml_node outputNode)
 {
-	if(outputNode==NULL)
+	if(outputNode.type() == pugi::node_null)
 		return "";
 
-	xmlNodePtr cNode=outputNode->cobj();
-	xmlDocPtr xmlDoc=cNode->doc;
-	xmlBufferPtr xmlBuffer=xmlBufferCreateSize(4096);
-	int success=xmlNodeDump(xmlBuffer, xmlDoc, cNode, 0, 0);
-	if (!success)
-		throw RunTimeException("Error in XMLNode::toString_priv");
-
-	tiny_string ret=tiny_string((char*)xmlBuffer->content,true);
-	xmlBufferFree(xmlBuffer);
-
+	ostringstream buf;
+	outputNode.print(buf);
+	tiny_string ret = tiny_string(buf.str());
 	return ret;
 }
 
@@ -297,8 +289,10 @@
 
 void XMLDocument::parseXMLImpl(const string& str)
 {
-	bool hasParent;
-	rootNode=buildFromString(str, ignoreWhite,&hasParent);
+	unsigned int parsemode = pugi::parse_full |pugi::parse_fragment;
+	if (!ignoreWhite) parsemode |= pugi::parse_ws_pcdata;
+
+	rootNode=buildFromString(str, parsemode);
 }
 
 ASFUNCTIONBODY(XMLDocument,_toString)
@@ -328,7 +322,7 @@
 	XMLDocument* th=Class<XMLDocument>::cast(obj);
 	assert_and_throw(argslen==0);
 	assert(th->node==NULL);
-	xmlpp::Node* newNode=th->rootNode;
+	pugi::xml_node newNode=th->rootNode;
 	th->incRef();
 	return Class<XMLNode>::getInstanceS(_MR(th),newNode);
 }

lightspark.tar.xz/src/scripting/flash/xml/flashxml.h Changed

lightspark.tar.xz/src/scripting/toplevel/ASString.cpp Changed

@@ -134,7 +134,7 @@
 	if(argslen == 0 || args[0]->getObjectType() == T_UNDEFINED)
 		return abstract_i(-1);
 
-	int options=PCRE_UTF8|PCRE_NEWLINE_ANY|PCRE_JAVASCRIPT_COMPAT;
+	int options=PCRE_UTF8|PCRE_NEWLINE_ANY;//|PCRE_JAVASCRIPT_COMPAT;
 	tiny_string restr;
 	if(args[0]->getClass() && args[0]->getClass()==Class<RegExp>::getClass())
 	{
@@ -252,7 +252,10 @@
 	if(Class<ASString>::getClass()->prototype->getObj() == obj)
 		return Class<ASString>::getInstanceS("");
 	if(!obj->is<ASString>())
+	{
+		LOG(LOG_ERROR,"String.toString is not generic:"<<obj->toDebugString());
 		throw Class<TypeError>::getInstanceS("String.toString is not generic");
+	}
 	assert_and_throw(argslen==0);
 
 	//As ASStrings are immutable, we can just return ourself
@@ -366,22 +369,23 @@
 			return ret;
 		}
 		unsigned int start=0;
+		unsigned int len = data.numChars();
 		do
 		{
 			int match=data.find(del,start);
 			if(del.empty())
 				match++;
 			if(match==-1)
-				match=data.numChars();
+				match= len;
 			ASString* s=Class<ASString>::getInstanceS(data.substr(start,(match-start)));
 			if (ret->size() >= limit)
 				break;
 			ret->push(_MR(s));
 			start=match+del.numChars();
-			if (start == data.numChars())
+			if (start == len)
 				ret->push(_MR(Class<ASString>::getInstanceS("")));
 		}
-		while(start<data.numChars() && ret->size() < limit);
+		while(start<len && ret->size() < limit);
 	}
 
 	return ret;

lightspark.tar.xz/src/scripting/toplevel/XML.cpp Changed

@@ -25,10 +25,6 @@
 #include "scripting/argconv.h"
 #include "abc.h"
 #include "parsing/amf3_generator.h"
-#include <libxml/tree.h>
-#include <libxml++/parsers/domparser.h>
-#include <libxml++/nodes/textnode.h>
-#include <libxml++/nodes/entityreference.h>
 
 using namespace std;
 using namespace lightspark;
@@ -48,18 +44,23 @@
 	prettyPrinting = true;
 }
 
-XML::XML(Class_base* c):ASObject(c),parentNode(0),nodetype((xmlElementType)0),constructed(false), hasParentNode(false)
+XML::XML(Class_base* c):ASObject(c),parentNode(0),nodetype((pugi::xml_node_type)0),isAttribute(false),constructed(false)
 {
 }
 
-XML::XML(Class_base* c, const std::string &str):ASObject(c),parentNode(0),nodetype((xmlElementType)0),constructed(false)
+XML::XML(Class_base* c, const std::string &str):ASObject(c),parentNode(0),nodetype((pugi::xml_node_type)0),isAttribute(false),constructed(false)
 {
-	createTree(buildFromString(str, false,&hasParentNode));
+	createTree(buildFromString(str, getParseMode()),false);
 }
 
-XML::XML(Class_base* c,xmlpp::Node* _n):ASObject(c),parentNode(0),nodetype((xmlElementType)0),constructed(false)
+XML::XML(Class_base* c, const pugi::xml_node& _n, XML* parent, bool fromXMLList):ASObject(c),parentNode(0),nodetype((pugi::xml_node_type)0),isAttribute(false),constructed(false)
 {
-	createTree(_n);
+	if (parent)
+	{
+		parent->incRef();
+		parentNode = _NR<XML>(parent);
+	}
+	createTree(_n,fromXMLList);
 }
 
 void XML::finalize()
@@ -180,7 +181,7 @@
 	 args[0]->is<Null>() || 
 	 args[0]->is<Undefined>())
 	{
-		th->createTree(th->buildFromString("", false,&th->hasParentNode));
+		th->createTree(th->buildFromString("", getParseMode()),false);
 	}
 	else if(args[0]->getClass()->isSubClass(Class<ByteArray>::getClass()))
 	{
@@ -189,8 +190,8 @@
 		ByteArray* ba=Class<ByteArray>::cast(args[0]);
 		uint32_t len=ba->getLength();
 		const uint8_t* str=ba->getBuffer(len, false);
-		th->createTree(th->buildFromString(std::string((const char*)str,len), false,&th->hasParentNode,
-					 getVm()->getDefaultXMLNamespace()));
+		th->createTree(th->buildFromString(std::string((const char*)str,len), getParseMode(),
+					 getVm()->getDefaultXMLNamespace()),false);
 	}
 	else if(args[0]->is<ASString>() ||
 		args[0]->is<Number>() ||
@@ -200,25 +201,26 @@
 	{
 		//By specs, XML constructor will only convert to string Numbers or Booleans
 		//ints are not explicitly mentioned, but they seem to work
-		th->createTree(th->buildFromString(args[0]->toString(), false,&th->hasParentNode,
-					 getVm()->getDefaultXMLNamespace()));
+		th->createTree(th->buildFromString(args[0]->toString(), getParseMode(),
+					 getVm()->getDefaultXMLNamespace()),false);
 	}
 	else if(args[0]->is<XML>())
 	{
-		th->createTree(th->buildFromString(args[0]->as<XML>()->toXMLString_internal(), false,&th->hasParentNode,
-					 getVm()->getDefaultXMLNamespace()));
+		th->createTree(th->buildFromString(args[0]->as<XML>()->toXMLString_internal(), getParseMode(),
+					 getVm()->getDefaultXMLNamespace()),false);
 	}
 	else if(args[0]->is<XMLList>())
 	{
 		XMLList *list=args[0]->as<XMLList>();
 		_R<XML> reduced=list->reduceToXML();
-		th->createTree(th->buildFromString(reduced->toXMLString_internal(), false,&th->hasParentNode));
+		th->createTree(th->buildFromString(reduced->toXMLString_internal(), getParseMode()),false);
 	}
 	else
 	{
-		th->createTree(th->buildFromString(args[0]->toString(), false,&th->hasParentNode,
-					 getVm()->getDefaultXMLNamespace()));
+		th->createTree(th->buildFromString(args[0]->toString(), getParseMode(),
+					 getVm()->getDefaultXMLNamespace()),false);
 	}
+
 	return NULL;
 }
 
@@ -230,18 +232,19 @@
 }
 const char *XML::nodekindString()
 {
+	if (isAttribute)
+		return "attribute";
 	switch(nodetype)
 	{
-		case XML_ATTRIBUTE_NODE:
-			return "attribute";
-		case XML_ELEMENT_NODE:
+		case pugi::node_element:
 			return "element";
-		case XML_CDATA_SECTION_NODE:
-		case XML_TEXT_NODE:
+		case pugi::node_cdata:
+		case pugi::node_pcdata:
+		case pugi::node_null:
 			return "text";
-		case XML_COMMENT_NODE:
+		case pugi::node_comment:
 			return "comment";
-		case XML_PI_NODE:
+		case pugi::node_pi:
 			return "processing-instruction";
 		default:
 		{
@@ -260,7 +263,7 @@
 {
 	XML* th=Class<XML>::cast(obj);
 	assert_and_throw(argslen==0);
-	if(th->nodetype==XML_TEXT_NODE || th->nodetype==XML_COMMENT_NODE)
+	if(!th->isAttribute && (th->nodetype==pugi::node_pcdata || th->nodetype==pugi::node_comment || th->nodetype==pugi::node_null))
 		return getSys()->getNullRef();
 	else
 		return Class<ASString>::getInstanceS(th->nodename);
@@ -271,7 +274,7 @@
 	XML* th=Class<XML>::cast(obj);
 	assert_and_throw(argslen==0);
 	//TODO: add namespace
-	if(th->nodetype==XML_TEXT_NODE || th->nodetype==XML_COMMENT_NODE)
+	if(!th->isAttribute && (th->nodetype==pugi::node_pcdata || th->nodetype==pugi::node_comment || th->nodetype==pugi::node_null))
 		return getSys()->getNullRef();
 	else
 	{
@@ -315,7 +318,9 @@
 		//The appendChild specs says that any other type is converted to string
 		//NOTE: this is explicitly different from XML constructor, that will only convert to
 		//string Numbers and Booleans
-		arg=_MR(Class<XML>::getInstanceS(args[0]->toString()));
+		arg=_MR(Class<XML>::getInstanceS("dummy"));
+		//avoid interpretation of the argument, just set it as text node
+		arg->setTextContent(args[0]->toString());
 	}
 
 	th->appendChild(arg);
@@ -414,213 +419,242 @@
 				break;
 		}
 	}
-	switch (nodetype)
+	if (isAttribute)
+		res += encodeToXML(nodevalue,true);
+	else
 	{
-		case XML_TEXT_NODE:
-			res = indent;
-			res += encodeToXML(nodevalue,false);
-			break;
-		case XML_ATTRIBUTE_NODE:
-			res += nodevalue;
-			break;
-		case XML_COMMENT_NODE:
-			res = indent;
-			res += "";
-			break;
-		case XML_PI_NODE:
-			if (ignoreProcessingInstructions)
-				break;
-			res = indent;
-			res += "<?";
-			res +=this->nodename;
-			res += " ";
-			res += nodevalue;
-			res += "?>";
-			break;
-		case XML_ELEMENT_NODE:
+	/*
+		if (!ignoreProcessingInstructions && !procinstlist.isNull())
+		{
+
+			for (uint32_t i = 0; i < procinstlist->nodes.size(); i++)
+			{
+				_R<XML> child= procinstlist->nodes[i];
+				res += child->toXMLString_internal(pretty,defaultnsprefix,indent,false);
+			LOG(LOG_INFO,"printpi:"<<res);
+				if (pretty && prettyPrinting)
+					res += "\n";
+			}
+		}
+		*/
+		switch (nodetype)
 		{
-			tiny_string curprefix = this->nodenamespace_prefix;
-			res = indent;
-			res += "<";
-			if (this->nodenamespace_prefix.empty())
+			case pugi::node_pcdata:
+				res += indent;
+				res += encodeToXML(nodevalue,false);
+				break;
+			case pugi::node_comment:
+				res += indent;
+				res += "";
+				break;
+			case pugi::node_declaration:
+			case pugi::node_pi:
+				if (ignoreProcessingInstructions)
+					break;
+				res += indent;
+				res += "<?";
+				res +=this->nodename;
+				res += " ";
+				res += nodevalue;
+				res += "?>";
+				break;
+			case pugi::node_element:
 			{
-				if (defaultnsprefix != "")
+				tiny_string curprefix = this->nodenamespace_prefix;
+				res += indent;
+				res += "<";
+				if (this->nodenamespace_prefix.empty())
 				{
-					res += defaultnsprefix;
+					if (defaultnsprefix != "")
+					{
+						res += defaultnsprefix;
+						res += ":";
+						curprefix = defaultnsprefix;
+					}
+				}
+				else
+				{
+					res += this->nodenamespace_prefix;
 					res += ":";
-					curprefix = defaultnsprefix;
 				}
-			}
-			else
-			{
-				res += this->nodenamespace_prefix;
-				res += ":";
-			}
-			res +=this->nodename;
-			for (uint32_t i = 0; i < this->namespacedefs.size(); i++)
-			{
-				bool b;
-				_R<Namespace> tmpns = this->namespacedefs[i];
-				tiny_string tmpprefix = tmpns->getPrefix(b);
-				if(tmpprefix == "" || tmpprefix==this->nodenamespace_prefix || seen_prefix.find(tmpprefix)!=seen_prefix.end())
-					continue;
-				seen_prefix.insert(tmpprefix);
-				res += " xmlns:";
-				res += tmpprefix;
-				res += "=\"";
-				res += tmpns->getURI();
-				res += "\"";
-			}
-			if (this->parentNode)
-			{
-				if (bfirst)
+				res +=this->nodename;
+				for (uint32_t i = 0; i < this->namespacedefs.size(); i++)
 				{
-					XML* tmp = this->parentNode.getPtr();
-					while(tmp)
+					bool b;
+					_R<Namespace> tmpns = this->namespacedefs[i];
+					tiny_string tmpprefix = tmpns->getPrefix(b);
+					/*
+					if(tmpprefix == "")
 					{
-						for (uint32_t i = 0; i < tmp->namespacedefs.size(); i++)
+						seen_prefix.insert(tmpprefix);
+						res += " xmlns";
+						res += "=\"";
+						res += tmpns->getURI();
+						res += "\"";
+					}
+					*/
+					if(tmpprefix == "" || tmpprefix==this->nodenamespace_prefix || seen_prefix.find(tmpprefix)!=seen_prefix.end())
+						continue;
+					seen_prefix.insert(tmpprefix);
+					res += " xmlns:";
+					res += tmpprefix;
+					res += "=\"";
+					res += tmpns->getURI();
+					res += "\"";
+				}
+				if (this->parentNode)
+				{
+					if (bfirst)
+					{
+						XML* tmp = this->parentNode.getPtr();
+						while(tmp)
 						{
-							bool b;
-							_R<Namespace> tmpns = tmp->namespacedefs[i];
-							tiny_string tmpprefix = tmpns->getPrefix(b);
-							if(tmpprefix != "" && seen_prefix.find(tmpprefix)==seen_prefix.end())
+							for (uint32_t i = 0; i < tmp->namespacedefs.size(); i++)
 							{
-								seen_prefix.insert(tmpprefix);
-								res += " xmlns:";
-								res += tmpprefix;
-								res += "=\"";
-								res += tmpns->getURI();
-								res += "\"";
+								bool b;
+								_R<Namespace> tmpns = tmp->namespacedefs[i];
+								tiny_string tmpprefix = tmpns->getPrefix(b);
+								if(tmpprefix != "" && seen_prefix.find(tmpprefix)==seen_prefix.end())
+								{
+									seen_prefix.insert(tmpprefix);
+									res += " xmlns:";
+									res += tmpprefix;
+									res += "=\"";
+									res += tmpns->getURI();
+									res += "\"";
+								}
 							}
+							if (tmp->parentNode)
+								tmp = tmp->parentNode.getPtr();
+							else
+								break;
 						}
-						if (tmp->parentNode)
-							tmp = tmp->parentNode.getPtr();
-						else
-							break;
 					}
-				}
-				else if (!curprefix.empty())
-				{
-					XML* tmp = this->parentNode.getPtr();
-					bool bfound = false;
-					while(tmp)
+					else if (!curprefix.empty())
 					{
-						for (uint32_t i = 0; i < tmp->namespacedefs.size(); i++)
+						XML* tmp = this->parentNode.getPtr();
+						bool bfound = false;
+						while(tmp)
 						{
-							bool b;
-							_R<Namespace> tmpns = tmp->namespacedefs[i];
-							tiny_string tmpprefix = tmpns->getPrefix(b);
-							if(tmpprefix == curprefix)
+							for (uint32_t i = 0; i < tmp->namespacedefs.size(); i++)
 							{
-								seen_prefix.insert(tmpprefix);
-								bfound = true;
-								break;
+								bool b;
+								_R<Namespace> tmpns = tmp->namespacedefs[i];
+								tiny_string tmpprefix = tmpns->getPrefix(b);
+								if(tmpprefix == curprefix)
+								{
+									seen_prefix.insert(tmpprefix);
+									bfound = true;
+									break;
+								}
 							}
+							if (!bfound && tmp->parentNode)
+								tmp = tmp->parentNode.getPtr();
+							else
+								break;
 						}
-						if (!bfound && tmp->parentNode)
-							tmp = tmp->parentNode.getPtr();
-						else
-							break;
 					}
 				}
-			}
-			if (!this->nodenamespace_uri.empty() && 
-					((this->nodenamespace_prefix.empty() && defaultnsprefix == "") ||
-					 (!this->nodenamespace_prefix.empty() && seen_prefix.find(this->nodenamespace_prefix)==seen_prefix.end())))
-			{
-				if (!this->nodenamespace_prefix.empty())
+				if (!this->nodenamespace_uri.empty() && 
+						((this->nodenamespace_prefix.empty() && defaultnsprefix == "") ||
+						 (!this->nodenamespace_prefix.empty() && seen_prefix.find(this->nodenamespace_prefix)==seen_prefix.end())))
+				{
+					if (!this->nodenamespace_prefix.empty())
+					{
+						seen_prefix.insert(this->nodenamespace_prefix);
+						res += " xmlns:";
+						res += this->nodenamespace_prefix;
+					}
+					else
+						res += " xmlns";
+					res += "=\"";
+					res += this->nodenamespace_uri;
+					res += "\"";
+				}
+				else if (defaultnsprefix != "" && seen_prefix.find(defaultnsprefix)==seen_prefix.end())
 				{
-					seen_prefix.insert(this->nodenamespace_prefix);
+					seen_prefix.insert(defaultnsprefix);
 					res += " xmlns:";
-					res += this->nodenamespace_prefix;
+					res += defaultnsprefix;
+					res += "=\"";
+					res += getVm()->getDefaultXMLNamespace();
+					res += "\"";
 				}
-				else
-					res += " xmlns";
-				res += "=\"";
-				res += this->nodenamespace_uri;
-				res += "\"";
-			}
-			else if (defaultnsprefix != "" && seen_prefix.find(defaultnsprefix)==seen_prefix.end())
-			{
-				seen_prefix.insert(defaultnsprefix);
-				res += " xmlns:";
-				res += defaultnsprefix;
-				res += "=\"";
-				res += getVm()->getDefaultXMLNamespace();
-				res += "\"";
-			}
-			for (XMLList::XMLListVector::const_iterator it = attributelist->nodes.begin(); it != attributelist->nodes.end(); it++)
-			{
-				_R<XML> attr = *it;
-				res += " ";
-				if (attr->nodenamespace_prefix != "")
+				for (XMLList::XMLListVector::const_iterator it = attributelist->nodes.begin(); it != attributelist->nodes.end(); it++)
 				{
-					res += attr->nodenamespace_prefix;
-					res += ":";
+					_R<XML> attr = *it;
+					res += " ";
+					if (attr->nodenamespace_prefix != "")
+					{
+						res += attr->nodenamespace_prefix;
+						res += ":";
+					}
+					res += attr->nodename;
+					res += "=\"";
+					res += encodeToXML(attr->nodevalue,true);
+					res += "\"";
 				}
-				res += attr->nodename;
-				res += "=\"";
-				res += encodeToXML(attr->nodevalue,true);
-				res += "\"";
-			}
-			if (childrenlist->nodes.size() == 0)
-			{
-				res += "/>";
-				break;
-			}
-			res += ">";
-			tiny_string newindent;
-			bool bindent = (pretty && prettyPrinting && prettyIndent >=0 && 
-							(childrenlist->nodes.size() >1 || 
-							(childrenlist->nodes[0]->nodetype != XML_TEXT_NODE && childrenlist->nodes[0]->nodetype != XML_CDATA_SECTION_NODE)));
-			if (bindent)
-			{
-				newindent = indent;
-				for (int32_t j = 0; j < prettyIndent; j++)
+				if (childrenlist->nodes.size() == 0)
 				{
-					newindent += " ";
+					res += "/>";
+					break;
 				}
-			}
-			for (uint32_t i = 0; i < childrenlist->nodes.size(); i++)
-			{
+				res += ">";
+				tiny_string newindent;
+				bool bindent = (pretty && prettyPrinting && prettyIndent >=0 && 
+								(childrenlist->nodes.size() >1 || 
+								 (!childrenlist->nodes[0]->procinstlist.isNull()) ||
+								 (childrenlist->nodes[0]->nodetype != pugi::node_pcdata && childrenlist->nodes[0]->nodetype != pugi::node_cdata)));
 				if (bindent)
+				{
+					newindent = indent;
+					for (int32_t j = 0; j < prettyIndent; j++)
+					{
+						newindent += " ";
+					}
+				}
+				for (uint32_t i = 0; i < childrenlist->nodes.size(); i++)
+				{
+					_R<XML> child= childrenlist->nodes[i];
+					tiny_string tmpres = child->toXMLString_internal(pretty,defaultnsprefix,newindent.raw_buf(),false);
+					if (bindent && !tmpres.empty())
+						res += "\n";
+					res += tmpres;
+				}
+				if (bindent)
+				{
 					res += "\n";
-				_R<XML> child= childrenlist->nodes[i];
-				res += child->toXMLString_internal(pretty,defaultnsprefix,newindent.raw_buf(),false);
-			}
-			if (bindent)
-			{
-				res += "\n";
-				res += indent;
-			}
-			res += "</";
-			if (this->nodenamespace_prefix.empty())
-			{
-				if (defaultnsprefix != "")
+					res += indent;
+				}
+				res += "</";
+				if (this->nodenamespace_prefix.empty())
 				{
-					res += defaultnsprefix;
+					if (defaultnsprefix != "")
+					{
+						res += defaultnsprefix;
+						res += ":";
+					}
+				}
+				else
+				{
+					res += this->nodenamespace_prefix;
 					res += ":";
 				}
+				res += this->nodename;
+				res += ">";
+				break;
 			}
-			else
-			{
-				res += this->nodenamespace_prefix;
-				res += ":";
-			}
-			res += this->nodename;
-			res += ">";
-			break;
+			case pugi::node_cdata:
+				res += "<![CDATA[";
+				res += nodevalue;
+				res += "]]>";
+				break;
+			default:
+				LOG(LOG_NOT_IMPLEMENTED,"XML::toXMLString unhandled nodetype:"<<nodetype);
+				break;
 		}
-		case XML_CDATA_SECTION_NODE:
-			res += "<![CDATA[";
-			res += nodevalue;
-			res += "]]>";
-			break;
-		default:
-			LOG(LOG_NOT_IMPLEMENTED,"XML::toXMLString unhandled nodetype:"<<nodetype);
-			break;
 	}
 	return res;
 }
@@ -729,8 +763,8 @@
 	for (uint32_t i = 0; i < childrenlist->nodes.size(); i++)
 	{
 		_R<XML> child= childrenlist->nodes[i];
-		if (child->getNodeKind() == XML_TEXT_NODE ||
-			child->getNodeKind() == XML_CDATA_SECTION_NODE)
+		if (child->getNodeKind() == pugi::node_pcdata ||
+			child->getNodeKind() == pugi::node_cdata)
 		{
 			child->incRef();
 			ret.push_back( child );
@@ -765,7 +799,7 @@
 	for (uint32_t i = 0; i < childrenlist->nodes.size(); i++)
 	{
 		_R<XML> child= childrenlist->nodes[i];
-		if(child->nodetype==XML_ELEMENT_NODE && (name.empty() || name == child->nodename))
+		if(child->nodetype==pugi::node_element && (name.empty() || name == child->nodename))
 		{
 			child->incRef();
 			foundElements.push_back( child );
@@ -873,10 +907,10 @@
 	tiny_string prefix;
 	ARG_UNPACK(prefix, "");
 
-	xmlElementType nodetype=th->nodetype;
+	pugi::xml_node_type nodetype=th->nodetype;
 	if(prefix.empty() && 
-	 nodetype!=XML_ELEMENT_NODE && 
-	 nodetype!=XML_ATTRIBUTE_NODE)
+	 nodetype!=pugi::node_element && 
+	 !th->isAttribute)
 	{
 		return getSys()->getNullRef();
 	}
@@ -901,8 +935,7 @@
 	_NR<ASObject> newName;
 	ARG_UNPACK(newName);
 
-	xmlElementType nodetype=th->nodetype;
-	if(nodetype==XML_TEXT_NODE || nodetype==XML_COMMENT_NODE)
+	if(th->nodetype==pugi::node_pcdata || th->nodetype==pugi::node_comment)
 		return NULL;
 
 	tiny_string new_name;
@@ -935,7 +968,7 @@
 	_NR<ASObject> newName;
 	ARG_UNPACK(newName);
 
-	if(th->nodetype==XML_TEXT_NODE || th->nodetype==XML_COMMENT_NODE)
+	if(th->nodetype==pugi::node_pcdata || th->nodetype==pugi::node_comment)
 		return NULL;
 
 	tiny_string localname;
@@ -965,9 +998,9 @@
 	_NR<ASObject> newNamespace;
 	ARG_UNPACK(newNamespace);
 
-	if(th->nodetype==XML_TEXT_NODE ||
-	 th->nodetype==XML_COMMENT_NODE ||
-	 th->nodetype==XML_PI_NODE)
+	if(th->nodetype==pugi::node_pcdata ||
+	 th->nodetype==pugi::node_comment ||
+	 th->nodetype==pugi::node_pi)
 		return NULL;
 	tiny_string ns_uri;
 	tiny_string ns_prefix;
@@ -1008,7 +1041,7 @@
 		}
 	}
 	th->setNamespace(ns_uri, ns_prefix);
-	if (th->nodetype==XML_ATTRIBUTE_NODE && th->parentNode)
+	if (th->isAttribute && th->parentNode)
 	{
 		XML* tmp = th->parentNode.getPtr();
 		for (uint32_t i = 0; i < tmp->namespacedefs.size(); i++)
@@ -1089,18 +1122,18 @@
 
 void XML::addTextContent(const tiny_string& str)
 {
-	assert(getNodeKind() == XML_TEXT_NODE);
+	assert(getNodeKind() == pugi::node_pcdata);
 
 	nodevalue += str;
 }
 
 void XML::setTextContent(const tiny_string& content)
 {
-	if (getNodeKind() == XML_TEXT_NODE ||
-	 getNodeKind() == XML_ATTRIBUTE_NODE ||
-	 getNodeKind() == XML_COMMENT_NODE ||
-	 getNodeKind() == XML_PI_NODE ||
-		getNodeKind() == XML_CDATA_SECTION_NODE)
+	if (getNodeKind() == pugi::node_pcdata ||
+	 isAttribute ||
+	 getNodeKind() == pugi::node_comment ||
+	 getNodeKind() == pugi::node_pi ||
+		getNodeKind() == pugi::node_cdata)
 	{
 		nodevalue = content;
 	}
@@ -1109,12 +1142,12 @@
 
 bool XML::hasSimpleContent() const
 {
-	if (getNodeKind() == XML_COMMENT_NODE ||
-		getNodeKind() == XML_PI_NODE)
+	if (getNodeKind() == pugi::node_comment ||
+		getNodeKind() == pugi::node_pi)
 		return false;
 	for(size_t i=0; i<childrenlist->nodes.size(); i++)
 	{
-		if (childrenlist->nodes[i]->getNodeKind() == XML_ELEMENT_NODE)
+		if (childrenlist->nodes[i]->getNodeKind() == pugi::node_element)
 			return false;
 	}
 	return true;
@@ -1125,7 +1158,7 @@
 	return !hasSimpleContent();
 }
 
-xmlElementType XML::getNodeKind() const
+pugi::xml_node_type XML::getNodeKind() const
 {
 	return nodetype;
 }
@@ -1261,7 +1294,6 @@
 		tiny_string childnamespace_uri = "|";
 		childnamespace_uri += child->nodenamespace_uri;
 		childnamespace_uri += "|";
-		
 		bool bmatch = (
 					((normalizedName=="") &&
 					 ((namespace_uri.find(defns)!= tiny_string::npos) ||
@@ -1431,7 +1463,8 @@
 			_NR<XML> tmp = _MR<XML>(Class<XML>::getInstanceS());
 			this->incRef();
 			tmp->parentNode = _MR<XML>(this);
-			tmp->nodetype = XML_ATTRIBUTE_NODE;
+			tmp->nodetype = pugi::node_null;
+			tmp->isAttribute = true;
 			tmp->nodename = buf;
 			tmp->nodenamespace_uri = ns_uri;
 			tmp->nodenamespace_prefix = ns_prefix;
@@ -1463,12 +1496,12 @@
 				}
 				else if(o->is<XML>())
 				{
-					if (o->as<XML>()->getNodeKind() == XML_TEXT_NODE)
+					if (o->as<XML>()->getNodeKind() == pugi::node_pcdata)
 					{
 						_R<XML> tmp = _MR<XML>(Class<XML>::getInstanceS());
 						tmp->parentNode = tmpnode;
 						tmp->incRef();
-						tmp->nodetype = XML_TEXT_NODE;
+						tmp->nodetype = pugi::node_pcdata;
 						tmp->nodename = "text";
 						tmp->nodenamespace_uri = "";
 						tmp->nodenamespace_prefix = "";
@@ -1491,7 +1524,7 @@
 				}
 				else
 				{
-					if (tmpnode->childrenlist->nodes.size() == 1 && tmpnode->childrenlist->nodes[0]->nodetype == XML_TEXT_NODE)
+					if (tmpnode->childrenlist->nodes.size() == 1 && tmpnode->childrenlist->nodes[0]->nodetype == pugi::node_pcdata)
 						tmpnode->childrenlist->nodes[0]->nodevalue = o->toString();
 					else
 					{
@@ -1775,7 +1808,6 @@
 {
 	assert(args && argslen==1);
 	ignoreWhitespace = Boolean_concrete(args[0]);
-	xmlKeepBlanksDefault(ignoreWhitespace ? 0 : 1);
 	return NULL;
 }
 ASFUNCTIONBODY(XML,_getPrettyIndent)
@@ -1921,7 +1953,7 @@
 	_NR<ASObject> child1;
 	_NR<ASObject> child2;
 	ARG_UNPACK(child1)(child2);
-	if (th->nodetype != XML_ELEMENT_NODE)
+	if (th->nodetype != pugi::node_element)
 		return getSys()->getUndefinedRef();
 	
 	if (child2->is<XML>())
@@ -1938,7 +1970,6 @@
 	if (child1->is<Null>())
 	{
 		th->incRef();
-		child2->as<XML>()->parentNode = _NR<XML>(th);
 		if (child2->is<XML>())
 		{
 			th->incRef();
@@ -1998,7 +2029,7 @@
 	_NR<ASObject> child1;
 	_NR<ASObject> child2;
 	ARG_UNPACK(child1)(child2);
-	if (th->nodetype != XML_ELEMENT_NODE)
+	if (th->nodetype != pugi::node_element)
 		return getSys()->getUndefinedRef();
 	
 	if (child2->is<XML>())
@@ -2138,7 +2169,7 @@
 	{
 		for (auto it = childrenlist->nodes.begin(); it != childrenlist->nodes.end(); it++)
 		{
-			if ((*it)->getNodeKind() == XML_COMMENT_NODE)
+			if ((*it)->getNodeKind() == pugi::node_comment)
 			{
 				(*it)->incRef();
 				ret.push_back(*it);
@@ -2162,7 +2193,7 @@
 	{
 		for (auto it = childrenlist->nodes.begin(); it != childrenlist->nodes.end(); it++)
 		{
-			if ((*it)->getNodeKind() == XML_PI_NODE && (name == "*" || name == (*it)->nodename))
+			if ((*it)->getNodeKind() == pugi::node_pi && (name == "*" || name == (*it)->nodename))
 			{
 				(*it)->incRef();
 				ret.push_back(*it);
@@ -2198,14 +2229,14 @@
 tiny_string XML::toString_priv()
 {
 	tiny_string ret;
-	if (getNodeKind() == XML_TEXT_NODE ||
-		getNodeKind() == XML_ATTRIBUTE_NODE ||
-		getNodeKind() == XML_CDATA_SECTION_NODE)
+	if (getNodeKind() == pugi::node_pcdata ||
+		isAttribute ||
+		getNodeKind() == pugi::node_cdata)
 	{
 		ret=nodevalue;
 	}
-	else if (getNodeKind() == XML_COMMENT_NODE ||
-			 getNodeKind() == XML_PI_NODE)
+	else if (getNodeKind() == pugi::node_comment ||
+			 getNodeKind() == pugi::node_pi)
 	{
 		ret="";
 	}
@@ -2214,8 +2245,8 @@
 		auto it = childrenlist->nodes.begin();
 		while(it != childrenlist->nodes.end())
 		{
-			if ((*it)->getNodeKind() != XML_COMMENT_NODE &&
-					(*it)->getNodeKind() != XML_PI_NODE)
+			if ((*it)->getNodeKind() != pugi::node_comment &&
+					(*it)->getNodeKind() != pugi::node_pi)
 				ret += (*it)->toString_priv();
 			it++;
 		}
@@ -2227,14 +2258,18 @@
 	return ret;
 }
 
-const tiny_string XML::encodeToXML(const tiny_string value, bool bIsAttribute)
+bool XML::getPrettyPrinting()
 {
-	return XMLBase::encodeToXML(value,bIsAttribute);
+	return prettyPrinting;
 }
 
-bool XML::getPrettyPrinting()
+unsigned int XML::getParseMode()
 {
-	return prettyPrinting;
+	unsigned int parsemode = pugi::parse_cdata | pugi::parse_escapes|pugi::parse_fragment | pugi::parse_doctype |pugi::parse_pi|pugi::parse_declaration;
+	if (!ignoreWhitespace) parsemode |= pugi::parse_ws_pcdata;
+	//if (!ignoreProcessingInstructions) parsemode |= pugi::parse_pi|pugi::parse_declaration;
+	if (!ignoreComments) parsemode |= pugi::parse_comments;
+	return parsemode;
 }
 
 tiny_string XML::toString()
@@ -2265,23 +2300,51 @@
 	 a->nodenamespace_uri!=b->nodenamespace_uri))
 		return false;
 
+	// content
+	if (a->nodevalue != b->nodevalue)
+		return false;
 	// attributes
-	if(a->nodetype==XML_ELEMENT_NODE)
+	if (a->attributelist->nodes.size() != b->attributelist->nodes.size())
+		return false;
+	for (int i = 0; i < (int)a->attributelist->nodes.size(); i++)
 	{
-		if (a->attributelist->nodes.size() != b->attributelist->nodes.size())
+		_R<XML> oa= a->attributelist->nodes[i];
+		bool bequal = false;
+		for (int j = 0; j < (int)b->attributelist->nodes.size(); j++)
+		{
+			_R<XML> ob= b->attributelist->nodes[j];
+			if (oa->isEqual(ob.getPtr()))
+			{
+				bequal = true;
+				break;
+			}
+		}
+		if (!bequal)
 			return false;
-			
-		for (int i = 0; i < (int)a->attributelist->nodes.size(); i++)
+	}
+	if (!ignoreProcessingInstructions && (!a->procinstlist.isNull() || !b->procinstlist.isNull()))
+	{
+		if (a->procinstlist.isNull() || b->procinstlist.isNull())
+			return false;
+		if (a->procinstlist->nodes.size() != b->procinstlist->nodes.size())
+			return false;
+		for (int i = 0; i < (int)a->procinstlist->nodes.size(); i++)
 		{
-			_R<XML> oa= a->attributelist->nodes[i];
-			_R<XML> ob= b->attributelist->nodes[i];
-			if (!oa->isEqual(ob.getPtr()))
+			_R<XML> oa= a->procinstlist->nodes[i];
+			bool bequal = false;
+			for (int j = 0; j < (int)b->procinstlist->nodes.size(); j++)
+			{
+				_R<XML> ob= b->procinstlist->nodes[j];
+				if (oa->isEqual(ob.getPtr()))
+				{
+					bequal = true;
+					break;
+				}
+			}
+			if (!bequal)
 				return false;
 		}
 	}
-	// content
-	if (a->nodevalue != b->nodevalue)
-		return false;
 	
 	// children
 	return a->childrenlist->isEqual(b->childrenlist.getPtr());
@@ -2340,111 +2403,219 @@
 	out->writeXMLString(objMap, this, toString());
 }
 
-void XML::createTree(xmlpp::Node* node)
+void XML::createTree(const pugi::xml_node& rootnode,bool fromXMLList)
 {
-	const xmlpp::Node::NodeList& list=node->get_children();
-	xmlpp::Node::NodeList::const_iterator it=list.begin();
-	childrenlist = _MR(Class<XMLList>::getInstanceS());
-	childrenlist->incRef();
-
-	this->nodetype = node->cobj()->type;
-	this->nodename = node->get_name();
-	this->nodenamespace_uri = node->get_namespace_uri();
-	this->nodenamespace_prefix = node ->get_namespace_prefix();
-	
-	switch (this->nodetype)
+	pugi::xml_node node = rootnode;
+	bool done = false;
+	this->childrenlist = _MR(Class<XMLList>::getInstanceS());
+	this->childrenlist->incRef();
+	if (parentNode.isNull() && !fromXMLList)
 	{
-		case XML_ATTRIBUTE_NODE:
-		case XML_TEXT_NODE:
+		while (true)
 		{
-			xmlpp::ContentNode *textnode=dynamic_cast<xmlpp::ContentNode*>(node);
-			this->nodevalue = textnode->get_content();
-			if (ignoreWhitespace)
+			//LOG(LOG_INFO,"rootfill:"<<node.name()<<" "<<node.value()<<" "<<node.type()<<" "<<parentNode.isNull());
+			switch (node.type())
 			{
-				nodevalue = removeWhitespace(nodevalue);
-				if (nodevalue.empty())
+				case pugi::node_null: // Empty (null) node handle
+					fillNode(this,node);
+					done = true;
+					break;
+				case pugi::node_document:// A document tree's absolute root
+					createTree(node.first_child(),fromXMLList);
 					return;
+				case pugi::node_pi:	// Processing instruction, i.e. '<?name?>'
+				case pugi::node_declaration: // Document declaration, i.e. '<?xml version="1.0"?>'
+				{
+					_NR<XML> tmp = _MR<XML>(Class<XML>::getInstanceS());
+					fillNode(tmp.getPtr(),node);
+					if(this->procinstlist.isNull())
+						this->procinstlist = _MR(Class<XMLList>::getInstanceS());
+					this->procinstlist->incRef();
+					this->procinstlist->append(_R<XML>(tmp));
+					break;
+				}
+				case pugi::node_doctype:// Document type declaration, i.e. '<!DOCTYPE doc>'
+					fillNode(this,node);
+					break;
+				case pugi::node_pcdata: // Plain character data, i.e. 'text'
+				case pugi::node_cdata: // Character data, i.e. '<![CDATA[text]]>'
+					fillNode(this,node);
+					done = true;
+					break;
+				case pugi::node_comment: // Comment tag, i.e. ''
+					fillNode(this,node);
+					break;
+				case pugi::node_element: // Element tag, i.e. '<node/>'
+				{
+					fillNode(this,node);
+					pugi::xml_node_iterator it=node.begin();
+					while(it!=node.end())
+					{
+						//LOG(LOG_ERROR,"rootchildnode1:"<<it->name()<<" "<<it->value()<<" "<<it->type()<<" "<<parentNode.isNull());
+						_NR<XML> tmp = _MR<XML>(Class<XML>::getInstanceS(*it,this));
+						this->childrenlist->append(_R<XML>(tmp));
+						it++;
+					}
+					done = true;
+					break;
+				}
+				default:
+					LOG(LOG_ERROR,"createTree:unhandled type:" <<node.type());
+					done=true;
+					break;
 			}
-			break;
+			if (done)
+				break;
+			node = node.next_sibling();
 		}
-		case XML_PI_NODE:
+		//LOG(LOG_INFO,"constructed:"<<this->toXMLString_internal());
+	}
+	else
+	{
+		switch (node.type())
 		{
-			xmlpp::ContentNode *textnode=dynamic_cast<xmlpp::ContentNode*>(node);
-			this->nodevalue = textnode->get_content();
-			break;
+			case pugi::node_pi:	// Processing instruction, i.e. '<?name?>'
+			case pugi::node_declaration: // Document declaration, i.e. '<?xml version="1.0"?>'
+			case pugi::node_doctype:// Document type declaration, i.e. '<!DOCTYPE doc>'
+			case pugi::node_pcdata: // Plain character data, i.e. 'text'
+			case pugi::node_cdata: // Character data, i.e. '<![CDATA[text]]>'
+			case pugi::node_comment: // Comment tag, i.e. ''
+				fillNode(this,node);
+				break;
+			case pugi::node_element: // Element tag, i.e. '<node/>'
+			{
+				fillNode(this,node);
+				pugi::xml_node_iterator it=node.begin();
+				{
+					while(it!=node.end())
+					{
+						_NR<XML> tmp = _MR<XML>(Class<XML>::getInstanceS(*it,this));
+						this->childrenlist->append(_R<XML>(tmp));
+						it++;
+					}
+				}
+				break;
+			}
+			default:
+				LOG(LOG_ERROR,"createTree:subtree unhandled type:" <<node.type());
+				break;
 		}
-		case XML_COMMENT_NODE:
-		case XML_CDATA_SECTION_NODE:
+	}
+}
+
+void XML::fillNode(XML* node, const pugi::xml_node &srcnode)
+{
+	if (node->childrenlist.isNull())
+	{
+		node->childrenlist = _MR(Class<XMLList>::getInstanceS());
+		node->childrenlist->incRef();
+	}
+	node->nodetype = srcnode.type();
+	node->nodename = srcnode.name();
+	node->nodevalue = srcnode.value();
+	node->nodenamespace_uri = getVm()->getDefaultXMLNamespace();
+	if (ignoreWhitespace && node->nodetype == pugi::node_pcdata)
+		node->nodevalue = node->removeWhitespace(node->nodevalue);
+	node->attributelist = _MR(Class<XMLList>::getInstanceS());
+	pugi::xml_attribute_iterator itattr;
+	for(itattr = srcnode.attributes_begin();itattr!=srcnode.attributes_end();++itattr)
+	{
+		tiny_string aname = tiny_string(itattr->name(),true);
+		if(aname == "xmlns")
 		{
-			xmlpp::ContentNode *textnode=dynamic_cast<xmlpp::ContentNode*>(node);
-			this->nodevalue = textnode->get_content();
-			break;
+			tiny_string uri = itattr->value();
+			Namespace* ns = Class<Namespace>::getInstanceS(uri,"");
+			node->namespacedefs.push_back(_MR(ns));
+			node->nodenamespace_uri = uri;
+		}
+		else if (aname.substr_bytes(0,6) == "xmlns:")
+		{
+			tiny_string uri = itattr->value();
+			tiny_string prefix = aname.substr(6,aname.end());
+			Namespace* ns = Class<Namespace>::getInstanceS(uri,prefix);
+			node->namespacedefs.push_back(_MR(ns));
 		}
-		default:
-			break;
 	}
-	for(;it!=list.end();++it)
+	uint32_t pos = node->nodename.find(":");
+	if (pos != tiny_string::npos)
 	{
-		if (ignoreProcessingInstructions && (*it)->cobj()->type == XML_PI_NODE)
-			continue;
-		if (ignoreComments && (*it)->cobj()->type == XML_COMMENT_NODE)
-			continue;
-		if (ignoreWhitespace && (*it)->cobj()->type == XML_TEXT_NODE)
+		// nodename has namespace
+		node->nodenamespace_prefix = node->nodename.substr(0,pos);
+		node->nodename = node->nodename.substr(pos+1,node->nodename.end());
+		if (node->nodenamespace_prefix == "xml")
+			node->nodenamespace_uri = "http://www.w3.org/XML/1998/namespace";
+		else
 		{
-			xmlpp::ContentNode *textnode=dynamic_cast<xmlpp::ContentNode*>(*it);
-			tiny_string tmpstr = textnode->get_content();
-			if (ignoreWhitespace)
+			XML* tmpnode = node;
+			bool found = false;
+			while (tmpnode)
 			{
-				tmpstr = removeWhitespace(tmpstr);
-				if (tmpstr.empty())
-					continue;
+				for (auto itns = tmpnode->namespacedefs.begin(); itns != tmpnode->namespacedefs.end();itns++)
+				{
+					bool undefined;
+					if ((*itns)->getPrefix(undefined) == node->nodenamespace_prefix)
+					{
+						node->nodenamespace_uri = (*itns)->getURI();
+						found = true;
+						break;
+					}
+				}
+				if (found)
+					break;
+				if (tmpnode->parentNode.isNull())
+					break;
+				tmpnode = tmpnode->parentNode.getPtr();
 			}
 		}
-		_NR<XML> tmp = _MR<XML>(Class<XML>::getInstanceS(*it));
-		this->incRef();
-		tmp->parentNode = _MR<XML>(this);
-		childrenlist->append(_R<XML>(tmp));
-	}
-	const xmlNode* xmlN = node->cobj();
-
-	xmlNsPtr nsdefs = xmlN->nsDef;
-	while (nsdefs)
-	{
-		tiny_string uri;
-		if (nsdefs->href) uri= (char*)nsdefs->href;
-		tiny_string prefix;
-		if (nsdefs->prefix) prefix= (char*)nsdefs->prefix;
-		Namespace* ns = Class<Namespace>::getInstanceS(uri,prefix);
-		namespacedefs.push_back(_MR(ns));
-		nsdefs = nsdefs->next;
 	}
-	attributelist = _MR(Class<XMLList>::getInstanceS());
-	for(xmlAttr* attr=xmlN->properties; attr!=NULL; attr=attr->next)
+	for(itattr = srcnode.attributes_begin();itattr!=srcnode.attributes_end();++itattr)
 	{
+		tiny_string aname = tiny_string(itattr->name(),true);
+		if(aname == "xmlns" || aname.substr_bytes(0,6) == "xmlns:")
+			continue;
 		_NR<XML> tmp = _MR<XML>(Class<XML>::getInstanceS());
-		this->incRef();
-		tmp->parentNode = _MR<XML>(this);
-		tmp->nodetype = XML_ATTRIBUTE_NODE;
-		tmp->nodename = (char*)attr->name;
-		if (attr->ns)
-		{
-			tmp->nodenamespace_uri = (char*)attr->ns->href;
-			tmp->nodenamespace_prefix = (char*)attr->ns->prefix;
-		}
-		else 
-			tmp->nodenamespace_uri = getVm()->getDefaultXMLNamespace();
-
-		//NOTE: libxmlpp headers says that Node::create_wrapper
-		//is supposed to be internal API. Still it's very useful and
-		//we use it.
-		xmlpp::Node::create_wrapper(reinterpret_cast<xmlNode*>(attr));
-		xmlpp::Node* attrX=static_cast<xmlpp::Node*>(attr->_private);
-		xmlpp::Attribute *textnode=dynamic_cast<xmlpp::Attribute*>(attrX);
-		tmp->nodevalue = textnode->get_value();
+		node->incRef();
+		tmp->parentNode = _MR<XML>(node);
+		tmp->nodetype = pugi::node_null;
+		tmp->isAttribute = true;
+		tmp->nodename = aname;
+		tmp->nodenamespace_uri = getVm()->getDefaultXMLNamespace();
+		pos = tmp->nodename.find(":");
+		if (pos != tiny_string::npos)
+		{
+			tmp->nodenamespace_prefix = tmp->nodename.substr(0,pos);
+			tmp->nodename = tmp->nodename.substr(pos+1,tmp->nodename.end());
+			if (tmp->nodenamespace_prefix == "xml")
+				tmp->nodenamespace_uri = "http://www.w3.org/XML/1998/namespace";
+			else
+			{
+				XML* tmpnode = node;
+				bool found = false;
+				while (tmpnode)
+				{
+					for (auto itns = tmpnode->namespacedefs.begin(); itns != tmpnode->namespacedefs.end();itns++)
+					{
+						bool undefined;
+						if ((*itns)->getPrefix(undefined) == tmp->nodenamespace_prefix)
+						{
+							tmp->nodenamespace_uri = (*itns)->getURI();
+							found = true;
+							break;
+						}
+					}
+					if (found)
+						break;
+					if (tmpnode->parentNode.isNull())
+						break;
+					tmpnode = tmpnode->parentNode.getPtr();
+				}
+			}
+		}
+		tmp->nodevalue = itattr->value();
 		tmp->constructed = true;
-		attributelist->nodes.push_back(tmp);
+		node->attributelist->nodes.push_back(tmp);
 	}
-	constructed=true;
+	node->constructed=true;
 }
 
 ASFUNCTIONBODY(XML,_prependChild)
@@ -2469,7 +2640,9 @@
 		//The appendChild specs says that any other type is converted to string
 		//NOTE: this is explicitly different from XML constructor, that will only convert to
 		//string Numbers and Booleans
-		arg=_MR(Class<XML>::getInstanceS(args[0]->toString()));
+		arg=_MR(Class<XML>::getInstanceS("dummy"));
+		//avoid interpretation of the argument, just set it as text node
+		arg->setTextContent(args[0]->toString());
 	}
 
 	th->prependChild(arg);

lightspark.tar.xz/src/scripting/toplevel/XML.h Changed

@@ -35,15 +35,18 @@
 private:
 	_NR<XMLList> childrenlist;
 	_NR<XML> parentNode;
-	xmlElementType nodetype;
+	pugi::xml_node_type nodetype;
+	bool isAttribute;
 	tiny_string nodename;
 	tiny_string nodevalue;
 	tiny_string nodenamespace_uri;
 	tiny_string nodenamespace_prefix;
 	_NR<XMLList> attributelist;
+	_NR<XMLList> procinstlist;
 	NSVector namespacedefs;
 
-	void createTree(xmlpp::Node* node);
+	void createTree(const pugi::xml_node &rootnode, bool fromXMLList);
+	static void fillNode(XML* node, const pugi::xml_node &srcnode);
 	tiny_string toString_priv();
 	const char* nodekindString();
 	
@@ -69,7 +72,6 @@
 	void prependChild(_R<XML> child);
 	static void normalizeRecursive(XML *node);
 	void addTextContent(const tiny_string& str);
-	bool hasParentNode;
 	void RemoveNamespace(Namespace *ns);
 	void getComments(XMLVector& ret);
 	void getprocessingInstructions(XMLVector& ret, tiny_string name);
@@ -77,7 +79,7 @@
 public:
 	XML(Class_base* c);
 	XML(Class_base* c,const std::string& str);
-	XML(Class_base* c,xmlpp::Node* _n);
+	XML(Class_base* c,const pugi::xml_node& _n, XML* parent=NULL, bool fromXMLList=false);
 	void finalize();
 	ASFUNCTION(_constructor);
 	ASFUNCTION(_toString);
@@ -139,8 +141,8 @@
 	static void buildTraits(ASObject* o){}
 	static void sinit(Class_base* c);
 	
-	static const tiny_string encodeToXML(const tiny_string value, bool bIsAttribute);
 	static bool getPrettyPrinting();
+	static unsigned int getParseMode();
 
 	const tiny_string getName() const { return nodename;}
 	const tiny_string getNamespaceURI() const { return nodenamespace_uri;}
@@ -161,7 +163,7 @@
 	int32_t toInt();
 	bool hasSimpleContent() const;
 	bool hasComplexContent() const;
-	xmlElementType getNodeKind() const;
+	pugi::xml_node_type getNodeKind() const;
 	ASObject *getParentNode();
 	XML *copy();
 	void normalize();

lightspark.tar.xz/src/scripting/toplevel/XMLList.cpp Changed

@@ -22,9 +22,6 @@
 #include "compat.h"
 #include "scripting/argconv.h"
 #include "abc.h"
-#include <libxml/tree.h>
-#include <libxml++/parsers/domparser.h>
-#include <libxml++/nodes/textnode.h>
 
 using namespace std;
 using namespace lightspark;
@@ -195,37 +192,45 @@
 	return NULL;
 }
 
-void XMLList::buildFromString(const std::string& str)
+void XMLList::buildFromString(const tiny_string &str)
 {
-	xmlpp::DomParser parser;
-	std::string default_ns=getVm()->getDefaultXMLNamespace();
-	std::string xmldecl;
-	std::string str_without_xmldecl = extractXMLDeclaration(str, xmldecl);
-	std::string expanded = xmldecl + 
-		"<parent xmlns=\"" + default_ns + "\">" + 
-		XMLBase::parserQuirks(str_without_xmldecl) + 
-		"</parent>";
-	try
+	pugi::xml_document xmldoc;
+
+	pugi::xml_parse_result res = xmldoc.load_buffer((void*)str.raw_buf(),str.numBytes(),XML::getParseMode());
+	switch (res.status)
 	{
-		parser.parse_memory(expanded);
+		case pugi::status_ok:
+			break;
+		case pugi::status_end_element_mismatch:
+			throwError<TypeError>(kXMLUnterminatedElementTag);
+			break;
+		case pugi::status_unrecognized_tag:
+			throwError<TypeError>(kXMLMalformedElement);
+			break;
+		case pugi::status_bad_pi:
+			throwError<TypeError>(kXMLUnterminatedXMLDecl);
+			break;
+		case pugi::status_bad_attribute:
+			throwError<TypeError>(kXMLUnterminatedAttribute);
+			break;
+		case pugi::status_bad_cdata:
+			throwError<TypeError>(kXMLUnterminatedCData);
+			break;
+		case pugi::status_bad_doctype:
+			throwError<TypeError>(kXMLUnterminatedDocTypeDecl);
+			break;
+		case pugi::status_bad_comment:
+			throwError<TypeError>(kXMLUnterminatedComment);
+			break;
+		default:
+			LOG(LOG_ERROR,"xmllist parser error:"<<str<<" "<<res.status<<" "<<res.description());
+			break;
 	}
-	catch(const exception& e)
-	{
-		try
-		{
-			parser.parse_memory(str);
-		}
-		catch(const exception& e)
-		{
-			throw RunTimeException("Error while parsing XML");
-		}
-	}
-	const xmlpp::Node::NodeList& children=\
-	 parser.get_document()->get_root_node()->get_children();
-	xmlpp::Node::NodeList::const_iterator it;
-	for(it=children.begin(); it!=children.end(); ++it)
+	
+	pugi::xml_node_iterator it=xmldoc.begin();
+	for(;it!=xmldoc.end();++it)
 	{
-		_R<XML> tmp = _MR(Class<XML>::getInstanceS(*it));
+		_R<XML> tmp = _MR(Class<XML>::getInstanceS(*it,(XML*)NULL,true));
 		if (tmp->constructed)
 			nodes.push_back(tmp);
 	}
@@ -566,14 +571,14 @@
 	auto it=nodes.begin();
 	while (it!=nodes.end())
 	{
-		if ((*it)->getNodeKind() == XML_ELEMENT_NODE)
+		if ((*it)->getNodeKind() == pugi::node_element)
 		{
 			(*it)->normalize();
 			++it;
 		}
-		else if ((*it)->getNodeKind() == XML_TEXT_NODE)
+		else if ((*it)->getNodeKind() == pugi::node_pcdata)
 		{
-			if ((*it)->toString().empty())
+			if (XMLBase::removeWhitespace((*it)->toString()).empty())
 			{
 				it = nodes.erase(it);
 			}
@@ -582,7 +587,7 @@
 				_R<XML> textnode = *it;
 
 				++it;
-				while (it!=nodes.end() && (*it)->getNodeKind() == XML_TEXT_NODE)
+				while (it!=nodes.end() && (*it)->getNodeKind() == pugi::node_pcdata)
 				{
 					textnode->addTextContent((*it)->toString());
 					it = nodes.erase(it);
@@ -775,7 +780,7 @@
 			if (!tmpprop.isEmpty())
 			{
 				XML* tmp = Class<XML>::getInstanceS();
-				tmp->nodetype = XML_ELEMENT_NODE;
+				tmp->nodetype = pugi::node_element;
 				tmp->nodename = targetproperty.normalizedName();
 				tmp->attributelist = _MR(Class<XMLList>::getInstanceS());
 				tmp->constructed = true;
@@ -785,7 +790,7 @@
 				if (retnodes.empty() && tmpname != "" && tmpname != "*")
 				{
 					XML* tmp2 = Class<XML>::getInstanceS();
-					tmp2->nodetype = XML_ELEMENT_NODE;
+					tmp2->nodetype = pugi::node_element;
 					tmp2->nodename = tmpname;
 					tmp2->attributelist = _MR(Class<XMLList>::getInstanceS());
 					tmp2->constructed = true;
@@ -880,7 +885,7 @@
 	auto it = nodes.begin();
 	while (it != nodes.end())
 	{
-		if ((*it)->nodetype == XML_ELEMENT_NODE)
+		if ((*it)->nodetype == pugi::node_element)
 			return false;
 		it++;
 	}
@@ -941,7 +946,7 @@
 	if (idx >= nodes.size())
 		return;
 
-	if (nodes[idx]->getNodeKind() == XML_ATTRIBUTE_NODE)
+	if (nodes[idx]->isAttribute)
 	{
 		if (targetobject)
 			targetobject->setVariableByMultiname(targetproperty,o,allowConst);
@@ -993,13 +998,13 @@
 			m.ns.push_back(nsNameAndKind("",NAMESPACE));
 			targetobject->setVariableByMultiname(m,o,allowConst);
 		}
-		if (o->as<XML>()->getNodeKind() == XML_TEXT_NODE)
+		if (o->as<XML>()->getNodeKind() == pugi::node_pcdata)
 		{
 			nodes[idx]->childrenlist->clear();
 			_R<XML> tmp = _MR<XML>(Class<XML>::getInstanceS());
 			nodes[idx]->incRef();
 			tmp->parentNode = nodes[idx];
-			tmp->nodetype = XML_TEXT_NODE;
+			tmp->nodetype = pugi::node_pcdata;
 			tmp->nodename = "text";
 			tmp->nodenamespace_uri = "";
 			tmp->nodenamespace_prefix = "";
@@ -1015,7 +1020,7 @@
 	}
 	else
 	{
-		if (nodes[idx]->nodetype == XML_TEXT_NODE)
+		if (nodes[idx]->nodetype == pugi::node_pcdata)
 			nodes[idx]->nodevalue = o->toString();
 		else 
 		{
@@ -1023,7 +1028,7 @@
 			_R<XML> tmp = _MR<XML>(Class<XML>::getInstanceS());
 			nodes[idx]->incRef();
 			tmp->parentNode = nodes[idx];
-			tmp->nodetype = XML_TEXT_NODE;
+			tmp->nodetype = pugi::node_pcdata;
 			tmp->nodename = "text";
 			tmp->nodenamespace_uri = "";
 			tmp->nodenamespace_prefix = "";
@@ -1041,21 +1046,22 @@
 		tiny_string ret;
 		for(size_t i=0; i<nodes.size(); i++)
 		{
-			xmlElementType kind=nodes[i]->getNodeKind();
-			switch (kind)
+			if (nodes[i]->isAttribute)
+				ret+=nodes[i]->toString_priv();
+			else
 			{
-				case XML_COMMENT_NODE:
-				case XML_PI_NODE:
-					break;
-				case XML_ATTRIBUTE_NODE:
-					ret+=nodes[i]->toString_priv();
-					break;
-				default:
-					ret+=nodes[i]->toString_priv();
-					break;
-			}
-
+				pugi::xml_node_type kind=nodes[i]->getNodeKind();
+				switch (kind)
+				{
+					case pugi::node_comment:
+					case pugi::node_pi:
+						break;
+					default:
+						ret+=nodes[i]->toString_priv();
+						break;
+				}
 				
+			}
 		}
 		return ret;
 	}

lightspark.tar.xz/src/scripting/toplevel/XMLList.h Changed

lightspark.tar.xz/src/scripting/toplevel/toplevel.cpp Changed

@@ -56,6 +56,7 @@
 {
 	traitsInitialized = true;
 	constructIndicator = true;
+	constructorCallComplete = true;
 	type=T_NULL;
 }
 
@@ -63,6 +64,7 @@
 {
 	traitsInitialized = true;
 	constructIndicator = true;
+	constructorCallComplete = true;
 	type=T_UNDEFINED;
 }
 
@@ -236,17 +238,16 @@
 
 ASObject *IFunction::describeType() const
 {
-	xmlpp::DomParser p;
-	xmlpp::Element* root=p.get_document()->create_root_node("type");
+	pugi::xml_document p;
+	pugi::xml_node root = p.append_child("type");
+	root.append_attribute("name").set_value("Function");
+	root.append_attribute("base").set_value("Object");
+	root.append_attribute("isDynamic").set_value("true");
+	root.append_attribute("isFinal").set_value("false");
+	root.append_attribute("isStatic").set_value("false");
 
-	root->set_attribute("name", "Function");
-	root->set_attribute("base", "Object");
-	root->set_attribute("isDynamic", "true");
-	root->set_attribute("isFinal", "false");
-	root->set_attribute("isStatic", "false");
-
-	xmlpp::Element* node=root->add_child("extendsClass");
-	node->set_attribute("type", "Object");
+	pugi::xml_node node=root.append_child("extendsClass");
+	node.append_attribute("type").set_value("Object");
 
 	// TODO: accessor
 	LOG(LOG_NOT_IMPLEMENTED, "describeType for Function not completely implemented");
@@ -803,7 +804,7 @@
 	
 	setDeclaredMethodByQName("toString","",Class<IFunction>::getFunction(Class_base::_toString),NORMAL_METHOD,false);
 	incRef();
-	prototype->setVariableByQName("constructor","",this,DYNAMIC_TRAIT);
+	prototype->setVariableByQName("constructor","",this,DECLARED_TRAIT);
 
 	if(super)
 		prototype->prevPrototype=super->prototype;
@@ -1190,41 +1191,41 @@
 
 ASObject *Class_base::describeType() const
 {
-	xmlpp::DomParser p;
-	xmlpp::Element* root=p.get_document()->create_root_node("type");
+	pugi::xml_document p;
+	pugi::xml_node root = p.append_child("type");
 
-	root->set_attribute("name", getQualifiedClassName().raw_buf());
-	root->set_attribute("base", "Class");
-	root->set_attribute("isDynamic", "true");
-	root->set_attribute("isFinal", "true");
-	root->set_attribute("isStatic", "true");
+	root.append_attribute("name").set_value(getQualifiedClassName().raw_buf());
+	root.append_attribute("base").set_value("Class");
+	root.append_attribute("isDynamic").set_value("true");
+	root.append_attribute("isFinal").set_value("true");
+	root.append_attribute("isStatic").set_value("true");
 
 	// extendsClass
-	xmlpp::Element* extends_class=root->add_child("extendsClass");
-	extends_class->set_attribute("type", "Class");
-	extends_class=root->add_child("extendsClass");
-	extends_class->set_attribute("type", "Object");
+	pugi::xml_node node=root.append_child("extendsClass");
+	node.append_attribute("type").set_value("class");
+	node=root.append_child("extendsClass");
+	node.append_attribute("type").set_value("Object");
+
 
 	// variable
 	if(class_index>=0)
 		describeTraits(root, context->classes[class_index].traits);
 
 	// factory
-	xmlpp::Element* factory=root->add_child("factory");
-	factory->set_attribute("type", getQualifiedClassName().raw_buf());
-	describeInstance(factory);
-
+	node=root.append_child("factory");
+	node.append_attribute("type").set_value(getQualifiedClassName().raw_buf());
+	describeInstance(node);
 	return Class<XML>::getInstanceS(root);
 }
 
-void Class_base::describeInstance(xmlpp::Element* root) const
+void Class_base::describeInstance(pugi::xml_node& root) const
 {
 	// extendsClass
 	const Class_base* c=super.getPtr();
 	while(c)
 	{
-		xmlpp::Element* extends_class=root->add_child("extendsClass");
-		extends_class->set_attribute("type", c->getQualifiedClassName().raw_buf());
+		pugi::xml_node node=root.append_child("extendsClass");
+		node.append_attribute("type").set_value(c->getQualifiedClassName().raw_buf());
 		c=c->super.getPtr();
 	}
 
@@ -1236,8 +1237,8 @@
 		auto it=interfaces.begin();
 		for(; it!=interfaces.end(); ++it)
 		{
-			xmlpp::Element* node=root->add_child("implementsInterface");
-			node->set_attribute("type", (*it)->getQualifiedClassName().raw_buf());
+			pugi::xml_node node=root.append_child("implementsInterface");
+			node.append_attribute("type").set_value((*it)->getQualifiedClassName().raw_buf());
 		}
 		c=c->super.getPtr();
 	}
@@ -1248,7 +1249,7 @@
 	{
 		// builtin class
 		LOG(LOG_NOT_IMPLEMENTED, "describeType for builtin classes not completely implemented:"<<this->class_name);
-		std::map<tiny_string, xmlpp::Element*> instanceNodes;
+		std::map<tiny_string, pugi::xml_node*> instanceNodes;
 		describeVariables(root,c,instanceNodes,Variables);
 		describeVariables(root,c,instanceNodes,borrowedVariables);
 	}
@@ -1259,7 +1260,7 @@
 	}
 }
 
-void Class_base::describeVariables(xmlpp::Element* root,const Class_base* c, std::map<tiny_string, xmlpp::Element*>& instanceNodes, const variables_map& map) const
+void Class_base::describeVariables(pugi::xml_node& root,const Class_base* c, std::map<tiny_string, pugi::xml_node*>& instanceNodes, const variables_map& map) const
 {
 	variables_map::const_var_iterator it=map.Variables.cbegin();
 	for(;it!=map.Variables.cend();++it)
@@ -1293,18 +1294,18 @@
 		auto existing=instanceNodes.find(name);
 		if(existing != instanceNodes.cend())
 			continue;
-		
-		xmlpp::Element* node=root->add_child(nodename);
-		instanceNodes[name] = node;
-		node->set_attribute("name", name.raw_buf());
+
+		pugi::xml_node node=root.append_child(nodename);
+		node.append_attribute("name").set_value(name.raw_buf());
 		if (access)
-			node->set_attribute("access", access);
+			node.append_attribute("access").set_value(access);
+		instanceNodes[name] = &node;
 	}
 }
-void Class_base::describeTraits(xmlpp::Element* root,
+void Class_base::describeTraits(pugi::xml_node &root,
 				std::vector<traits_info>& traits) const
 {
-	std::map<u30, xmlpp::Element*> accessorNodes;
+	std::map<u30, pugi::xml_node*> accessorNodes;
 	for(unsigned int i=0;i<traits.size();i++)
 	{
 		traits_info& t=traits[i];
@@ -1319,30 +1320,30 @@
 		{
 			multiname* type=context->getMultiname(t.type_name,NULL);
 			const char *nodename=kind==traits_info::Const?"constant":"variable";
-			xmlpp::Element* node=root->add_child(nodename);
-			node->set_attribute("name", getSys()->getStringFromUniqueId(mname->name_s_id).raw_buf());
-			node->set_attribute("type", type->qualifiedString().raw_buf());
+			pugi::xml_node node=root.append_child(nodename);
+			node.append_attribute("name").set_value(getSys()->getStringFromUniqueId(mname->name_s_id).raw_buf());
+			node.append_attribute("type").set_value(type->qualifiedString().raw_buf());
 
 			describeMetadata(node, t);
 		}
 		else if (kind==traits_info::Method)
 		{
-			xmlpp::Element* node=root->add_child("method");
-			node->set_attribute("name", getSys()->getStringFromUniqueId(mname->name_s_id).raw_buf());
-			node->set_attribute("declaredBy", getQualifiedClassName().raw_buf());
+			pugi::xml_node node=root.append_child("method");
+			node.append_attribute("name").set_value(getSys()->getStringFromUniqueId(mname->name_s_id).raw_buf());
+			node.append_attribute("declaredBy").set_value(getQualifiedClassName().raw_buf());
 
 			method_info& method=context->methods[t.method];
 			const multiname* rtname=method.returnTypeName();
-			node->set_attribute("returnType", rtname->qualifiedString().raw_buf());
+			node.append_attribute("returnType").set_value(rtname->qualifiedString().raw_buf());
 
 			assert(method.numArgs() >= method.numOptions());
 			uint32_t firstOpt=method.numArgs() - method.numOptions();
 			for(uint32_t j=0;j<method.numArgs(); j++)
 			{
-				xmlpp::Element* param=node->add_child("parameter");
-				param->set_attribute("index", UInteger::toString(j+1).raw_buf());
-				param->set_attribute("type", method.paramTypeName(j)->qualifiedString().raw_buf());
-				param->set_attribute("optional", j>=firstOpt?"true":"false");
+				pugi::xml_node param=node.append_child("parameter");
+				param.append_attribute("index").set_value(UInteger::toString(j+1).raw_buf());
+				param.append_attribute("type").set_value(method.paramTypeName(j)->qualifiedString().raw_buf());
+				param.append_attribute("optional").set_value(j>=firstOpt?"true":"false");
 			}
 
 			describeMetadata(node, t);
@@ -1354,23 +1355,23 @@
 			// node for this multiname with the
 			// complementary accessor. If we have, update
 			// the access attribute to "readwrite".
-			xmlpp::Element* node;
+			pugi::xml_node node;
 			auto existing=accessorNodes.find(t.name);
 			if(existing==accessorNodes.end())
 			{
-				node=root->add_child("accessor");
-				accessorNodes[t.name]=node;
+				node=root.append_child("accessor");
+				accessorNodes[t.name]=&node;
 			}
 			else
-				node=existing->second;
+				node=*existing->second;
 
-			node->set_attribute("name", getSys()->getStringFromUniqueId(mname->name_s_id).raw_buf());
+			node.append_attribute("name").set_value(getSys()->getStringFromUniqueId(mname->name_s_id).raw_buf());
 
 			const char* access=NULL;
 			tiny_string oldAccess;
-			xmlpp::Attribute* oldAttr=node->get_attribute("access");
-			if(oldAttr)
-				oldAccess=oldAttr->get_value();
+			pugi::xml_attribute oldAttr=node.attribute("access");
+			if (!oldAttr.empty())
+				oldAccess=oldAttr.value();
 
 			if(kind==traits_info::Getter && oldAccess=="")
 				access="readonly";
@@ -1381,7 +1382,12 @@
 				access="readwrite";
 
 			if(access)
-				node->set_attribute("access", access);
+			{
+				if (oldAttr.empty())
+					node.append_attribute("access").set_value(access);
+				else
+					oldAttr.set_value(access);
+			}
 
 			tiny_string type;
 			method_info& method=context->methods[t.method];
@@ -1395,31 +1401,35 @@
 				type=method.paramTypeName(0)->qualifiedString();
 			}
 			if(!type.empty())
-				node->set_attribute("type", type.raw_buf());
-
-			node->set_attribute("declaredBy", getQualifiedClassName().raw_buf());
+			{
+				node.remove_attribute("type");
+				node.append_attribute("type").set_value(type.raw_buf());
+			}
 
+			node.remove_attribute("declaredBy");
+			node.append_attribute("declaredBy").set_value(getQualifiedClassName().raw_buf());
+			
 			describeMetadata(node, t);
 		}
 	}
 }
 
-void Class_base::describeMetadata(xmlpp::Element* root, const traits_info& trait) const
+void Class_base::describeMetadata(pugi::xml_node& root, const traits_info& trait) const
 {
 	if((trait.kind&traits_info::Metadata) == 0)
 		return;
 
 	for(unsigned int i=0;i<trait.metadata_count;i++)
 	{
-		xmlpp::Element *metadata_node=root->add_child("metadata");
+		pugi::xml_node metadata_node=root.append_child("metadata");
 		metadata_info& minfo = context->metadata[trait.metadata[i]];
-		metadata_node->set_attribute("name", context->getString(minfo.name));
+		metadata_node.append_attribute("name").set_value(context->getString(minfo.name).raw_buf());
 
 		for(unsigned int j=0;j<minfo.item_count;++j)
 		{
-			xmlpp::Element *arg_node=metadata_node->add_child("arg");
-			arg_node->set_attribute("key", context->getString(minfo.items[j].key));
-			arg_node->set_attribute("value", context->getString(minfo.items[j].value));
+			pugi::xml_node arg_node=metadata_node.append_child("arg");
+			arg_node.append_attribute("key").set_value(context->getString(minfo.items[j].key).raw_buf());
+			arg_node.append_attribute("value").set_value(context->getString(minfo.items[j].value).raw_buf());
 		}
 	}
 }
@@ -1481,12 +1491,6 @@
 {
 	type=T_QNAME; uri_is_null=false;
 }
-void ASQName::setByNode(xmlpp::Node* node)
-{
-	uri_is_null=false;
-	local_name = node->get_name();
-	uri=node->get_namespace_uri();
-}
 void ASQName::setByXML(XML* node)
 {
 	uri_is_null=false;
@@ -2109,7 +2113,7 @@
 		//The prototype for Function seems to be a function object. Use the special FunctionPrototype
 		ret->prototype = _MNR(new_functionPrototype(ret, ret->super->prototype));
 		ret->incRef();
-		ret->prototype->getObj()->setVariableByQName("constructor","",ret,DYNAMIC_TRAIT);
+		ret->prototype->getObj()->setVariableByQName("constructor","",ret,DECLARED_TRAIT);
 		ret->prototype->getObj()->setConstructIndicator();
 		ret->incRef();
 		*retAddr = ret;
@@ -2529,6 +2533,8 @@
 {
 	traitsInitialized = true;
 	constructIndicator = true;
+	constructorCallComplete = true;
+
 }
 bool ObjectPrototype::isEqual(ASObject* r)
 {
@@ -2609,6 +2615,7 @@
 {
 	traitsInitialized = true;
 	constructIndicator = true;
+	constructorCallComplete = true;
 }
 
 void Function_object::finalize()

lightspark.tar.xz/src/scripting/toplevel/toplevel.h Changed

@@ -31,7 +31,6 @@
 #include "scripting/toplevel/Error.h"
 #include "scripting/toplevel/XML.h"
 #include "memory_support.h"
-#include <libxml++/parsers/domparser.h>
 #include <boost/intrusive/list.hpp>
 
 namespace lightspark
@@ -150,9 +149,9 @@
 	void initializeProtectedNamespace(const tiny_string& name, const namespace_info& ns);
 	void recursiveBuild(ASObject* target);
 	IFunction* constructor;
-	void describeTraits(xmlpp::Element* root, std::vector<traits_info>& traits) const;
-	void describeMetadata(xmlpp::Element* node, const traits_info& trait) const;
-	void describeVariables(xmlpp::Element *root,const Class_base* c, std::map<tiny_string, xmlpp::Element*>& instanceNodes, const variables_map& map) const;
+	void describeTraits(pugi::xml_node &root, std::vector<traits_info>& traits) const;
+	void describeMetadata(pugi::xml_node &node, const traits_info& trait) const;
+	void describeVariables(pugi::xml_node &root, const Class_base* c, std::map<tiny_string, pugi::xml_node *> &instanceNodes, const variables_map& map) const;
 	//Naive garbage collection until reference cycles are detected
 	Mutex referencedObjectsMutex;
 	boost::intrusive::list<ASObject, boost::intrusive::constant_time_size<false> > referencedObjects;
@@ -208,7 +207,7 @@
 	tiny_string toString();
 	virtual ASObject* generator(ASObject* const* args, const unsigned int argslen);
 	ASObject *describeType() const;
-	void describeInstance(xmlpp::Element* root) const;
+	void describeInstance(pugi::xml_node &root) const;
 	virtual const Template_base* getTemplate() const { return NULL; }
 	//DEPRECATED: naive garbage collector
 	void abandonObject(ASObject* ob) DLL_PUBLIC;
@@ -334,8 +333,8 @@
 	virtual IFunction* clone()=0;
 	_NR<ASObject> closure_this;
 
-	static void sinit(Class_base* c);
 public:
+	static void sinit(Class_base* c);
 	/* If this is a method, inClass is the class this is defined in.
 	 * If this is a function, inClass == NULL
 	 */
@@ -374,6 +373,7 @@
 			}
 			ret->closure_this=c;
 			ret->constructIndicator = true;
+			ret->constructorCallComplete = true;
 			//std::cout << "Binding " << ret << std::endl;
 			return ret;
 		}
@@ -494,6 +494,7 @@
 		Class<IFunction>* c=Class<IFunction>::getClass();
 		Function* ret=new (c->memoryAccount) Function(c, v);
 		ret->constructIndicator = true;
+		ret->constructorCallComplete = true;
 		return ret;
 	}
 	static Function* getFunction(Function::as_function v, int len)
@@ -502,6 +503,7 @@
 		Function* ret=new (c->memoryAccount) Function(c, v);
 		ret->length = len;
 		ret->constructIndicator = true;
+		ret->constructorCallComplete = true;
 		return ret;
 	}
 	static SyntheticFunction* getSyntheticFunction(method_info* m)
@@ -509,6 +511,7 @@
 		Class<IFunction>* c=Class<IFunction>::getClass();
 		SyntheticFunction* ret=new (c->memoryAccount) SyntheticFunction(c, m);
 		ret->constructIndicator = true;
+		ret->constructorCallComplete = true;
 		c->handleConstruction(ret,NULL,0,true);
 		return ret;
 	}
@@ -561,7 +564,6 @@
 	tiny_string local_name;
 public:
 	ASQName(Class_base* c);
-	void setByNode(xmlpp::Node* node);
 	void setByXML(XML* node);
 	static void sinit(Class_base*);
 	ASFUNCTION(_constructor);

lightspark.tar.xz/src/swf.cpp Changed

lightspark.tar.xz/src/swftypes.h Changed

lightspark.tar.xz/src/timer.cpp Changed

lightspark.tar.xz/src/timer.h Changed

lightspark.tar.xz/src/tiny_string.cpp Changed

@@ -32,6 +32,7 @@
 	if(stringSize > STATIC_SIZE)
 		createBuffer(stringSize);
 	memcpy(buf,r.c_str(),stringSize);
+	init();
 }
 
 tiny_string::tiny_string(std::istream& in, int len):buf(_buf_static),stringSize(len+1),type(STATIC)
@@ -40,6 +41,7 @@
 		createBuffer(stringSize);
 	in.read(buf,len);
 	buf[len]='\0';
+	init();
 }
 
 tiny_string::tiny_string(const char* s,bool copy):_buf_static(),buf(_buf_static),type(READONLY)
@@ -51,6 +53,7 @@
 		stringSize=strlen(s)+1;
 		buf=(char*)s; //This is an unsafe conversion, we have to take care of the RO data
 	}
+	init();
 }
 
 tiny_string::tiny_string(const tiny_string& r):_buf_static(),buf(_buf_static),stringSize(r.stringSize),type(STATIC)
@@ -60,11 +63,15 @@
 	{
 		type=READONLY;
 		buf=r.buf;
+		this->isASCII = r.isASCII;
+		this->hasNull = r.hasNull;
 		return;
 	}
 	if(stringSize > STATIC_SIZE)
 		createBuffer(stringSize);
 	memcpy(buf,r.buf,stringSize);
+	this->isASCII = r.isASCII;
+	this->hasNull = r.hasNull;
 }
 
 tiny_string::tiny_string(const std::string& r):_buf_static(),buf(_buf_static),stringSize(r.size()+1),type(STATIC)
@@ -72,6 +79,7 @@
 	if(stringSize > STATIC_SIZE)
 		createBuffer(stringSize);
 	memcpy(buf,r.c_str(),stringSize);
+	init();
 }
 
 tiny_string::~tiny_string()
@@ -95,6 +103,8 @@
 			createBuffer(stringSize);
 		memcpy(buf,s.buf,stringSize);
 	}
+	this->isASCII = s.isASCII;
+	this->hasNull = s.hasNull;
 	return *this;
 }
 
@@ -105,12 +115,14 @@
 	if(stringSize > STATIC_SIZE)
 		createBuffer(stringSize);
 	memcpy(buf,s.c_str(),stringSize);
+	init();
 	return *this;
 }
 
 tiny_string& tiny_string::operator=(const char* s)
 {
 	makePrivateCopy(s);
+	init();
 	return *this;
 }
 
@@ -121,6 +133,7 @@
 	if(stringSize > STATIC_SIZE)
 		createBuffer(stringSize);
 	memcpy(buf,r.c_str(),stringSize);
+	init();
 	return *this;
 }
 
@@ -170,6 +183,7 @@
 	//also copy \0 at the end
 	memcpy(buf+stringSize-1,s,addedLen+1);
 	stringSize=newStringSize;
+	init();
 	return *this;
 }
 
@@ -192,6 +206,10 @@
 	//start position is where the \0 was
 	memcpy(buf+stringSize-1,r.buf,r.stringSize);
 	stringSize=newStringSize;
+	if (this->isASCII)
+		this->isASCII = r.isASCII;
+	if (!this->hasNull)
+		this->hasNull = r.hasNull;
 	return *this;
 }
 
@@ -268,12 +286,15 @@
 
 bool tiny_string::operator==(const char* r) const
 {
-	return strcmp(buf,r)==0;
+	if(!r) return false;
+	unsigned len = strlen(r);
+	if(len!=stringSize-1) return false;
+	return memcmp(buf,r,len)==0;
 }
 
 bool tiny_string::operator==(const xmlChar* r) const
 {
-	return strcmp(buf,reinterpret_cast<const char*>(r))==0;
+	return *this==reinterpret_cast<const char*>(r);
 }
 
 bool tiny_string::operator!=(const char* r) const
@@ -300,6 +321,10 @@
 /* returns the length in utf-8 characters, not counting the trailing \0 */
 uint32_t tiny_string::numChars() const
 {
+	if (isASCII)
+		return stringSize-1;
+	if (!hasNull)
+		return g_utf8_strlen(buf,stringSize-1);
 	//we cannot use g_utf8_strlen, as we may have '\0' inside our string
 	uint32_t len = 0;
 	char* end = buf+numBytes();
@@ -343,6 +368,8 @@
 /* idx is an index of utf-8 characters */
 uint32_t tiny_string::charAt(uint32_t idx) const
 {
+	if (isASCII)
+		return buf[idx];
 	return g_utf8_get_char(g_utf8_offset_to_pointer(buf,idx));
 }
 
@@ -413,6 +440,20 @@
 	_buf_static[0] = '\0';
 	buf=_buf_static;
 	type=STATIC;
+	init();
+}
+
+void tiny_string::init()
+{
+	isASCII = true;
+	hasNull = false;
+	for (uint i = 0; i < stringSize-1; i++)
+	{
+		if (buf[i] & 0x80)
+			isASCII = false;
+		if (buf[i] == 0)
+			hasNull = true;
+	}
 }
 
 tiny_string tiny_string::fromChar(uint32_t c)
@@ -422,15 +463,19 @@
 	ret.type = STATIC;
 	ret.stringSize = g_unichar_to_utf8(c,ret.buf) + 1;
 	ret.buf[ret.stringSize-1] = '\0';
+	ret.isASCII = c<0x80;
+	ret.hasNull = c == 0;
 	return ret;
 }
 
 tiny_string& tiny_string::replace(uint32_t pos1, uint32_t n1, const tiny_string& o )
 {
 	assert(pos1 <= numChars());
-	uint32_t bytestart = g_utf8_offset_to_pointer(buf,pos1)-buf;
 	if(pos1 + n1 > numChars())
 		n1 = numChars()-pos1;
+	if (isASCII)
+		return replace_bytes(pos1, n1, o);
+	uint32_t bytestart = g_utf8_offset_to_pointer(buf,pos1)-buf;
 	uint32_t byteend = g_utf8_offset_to_pointer(buf,pos1+n1)-buf;
 	return replace_bytes(bytestart, byteend-bytestart, o);
 }
@@ -439,6 +484,7 @@
 {
 	//TODO avoid copy into std::string
 	*this = std::string(*this).replace(bytestart,bytenum,std::string(o));
+	this->init();
 	return *this;
 }
 
@@ -451,6 +497,8 @@
 	memcpy(ret.buf,buf+start,len);
 	ret.buf[len]=0;
 	ret.stringSize = len+1;
+	if (!this->isASCII || this->hasNull)
+		ret.init();
 	return ret;
 }
 
@@ -459,6 +507,8 @@
 	assert_and_throw(start <= numChars());
 	if(start+len > numChars())
 		len = numChars()-start;
+	if (isASCII)
+		return substr_bytes(start, len);
 	uint32_t bytestart = g_utf8_offset_to_pointer(buf,start) - buf;
 	uint32_t byteend = g_utf8_offset_to_pointer(buf,start+len) - buf;
 	return substr_bytes(bytestart, byteend-bytestart);
@@ -466,6 +516,8 @@
 
 tiny_string tiny_string::substr(uint32_t start, const CharIterator& end) const
 {
+	if (isASCII)
+		return substr_bytes(start, (end.buf_ptr - buf)-start);
 	assert_and_throw(start < numChars());
 	uint32_t bytestart = g_utf8_offset_to_pointer(buf,start) - buf;
 	uint32_t byteend = end.buf_ptr - buf;
@@ -479,12 +531,13 @@
 	tiny_string delimiterstring = tiny_string::fromChar(delimiter);
 
 	pos = 0;
-	while (pos < numChars())
+	uint len = numChars();
+	while (pos < len)
 	{
 		end = find(delimiterstring, pos);
 		if (end == tiny_string::npos)
 		{
-			res.push_back(substr(pos, numChars()-pos));
+			res.push_back(substr(pos, len-pos));
 			break;
 		}
 		else
@@ -493,7 +546,7 @@
 			pos = end+1;
 		}
 	}
-
+	
 	return res;
 }
 
@@ -522,6 +575,7 @@
 	}
 	*p = '\0';
 	ret.stringSize = len+1;
+	ret.init();
 	return ret;
 }
 
@@ -543,6 +597,7 @@
 	}
 	*p = '\0';
 	ret.stringSize = len+1;
+	ret.init();
 	return ret;
 }
 
@@ -562,6 +617,8 @@
 {
 	if (bytepos >= numBytes())
 		return numChars();
+	if (isASCII)
+		return bytepos;
 
 	return g_utf8_pointer_to_offset(raw_buf(), raw_buf() + bytepos);
 }

lightspark.tar.xz/src/tiny_string.h Changed

lightspark.tar.xz/tools/langref_parser Changed