-// ANNA - Anna is Not Nothingness Anymore
-//
-// (c) Copyright 2005-2014 Eduardo Ramos Testillano & Francisco Ruiz Rayo
-//
-// http://redmine.teslayout.com/projects/anna-suite
-//
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions
-// are met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following disclaimer
-// in the documentation and/or other materials provided with the
-// distribution.
-// * Neither the name of the copyright holder nor the names of its
-// contributors may be used to endorse or promote products derived from
-// this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-//
-// Authors: eduardo.ramos.testillano@gmail.com
-// cisco.tierra@gmail.com
+// ANNA - Anna is Not Nothingness Anymore //
+// //
+// (c) Copyright 2005-2015 Eduardo Ramos Testillano & Francisco Ruiz Rayo //
+// //
+// See project site at http://redmine.teslayout.com/projects/anna-suite //
+// See accompanying file LICENSE or copy at http://www.teslayout.com/projects/public/anna.LICENSE //
#include <anna/core/mt/Guard.hpp>
+#include <anna/core/util/defines.hpp>
#include <anna/xml/Compiler.hpp>
#include <anna/xml/Node.hpp>
#include <anna/xml/Document.hpp>
#include <anna/xml/Namespace.hpp>
+#include <algorithm>
+#include <cstring>
+
+
using namespace anna;
using namespace anna::xml;
}
const char* Compiler::apply(const Node* node, const int flags)
-throw(RuntimeException) {
+noexcept(false) {
Guard guard(this, "xml::Compiler::apply");
a_result.clear();
}
const char* Compiler::apply(const Document& document, const Node* node, const int flags)
-throw(RuntimeException) {
+noexcept(false) {
Guard guard(this, "xml::Compiler::apply");
a_result.clear();
const char* version = document.getVersion();
// nodos + texto.
//------------------------------------------------------------------------------------
void Compiler::apply(const Node* node, Result& result, const int level, const int flags)
-throw(RuntimeException) {
+noexcept(false) {
const bool hasText(node->getText() != NULL);
Node::const_child_iterator ii = node->child_begin();
Node::const_child_iterator maxii = node->child_end();
// nodos + texto.
//------------------------------------------------------------------------------------
void Compiler::apply(const Node* node, Result& result, const int flags)
-throw(RuntimeException) {
+noexcept(false) {
static const int level = 0;
const bool hasText(node->getText() != NULL);
Node::const_child_iterator ii = node->child_begin();
/*static*/
void Compiler::open(const Node* node, Result& result, const int level, const bool quickClose, const bool newline, const int flags)
-throw(RuntimeException) {
+noexcept(false) {
const Attribute* attribute;
const Namespace* ns;
for(int i = 0; i < level; i ++)
- result += ANNA_XML_COMPILER_TAB;
+ result += std::string(ANNA_XML_INDENTATION_SPACES, ' ');
result += '<';
writeFullName(node, result, flags);
}
}
+ // Sort node attributes (this is a compiler used for on-demand representation, this sorting is not permanent in the object which uses it):
+ if(flags & Mode::Sort) {
+ Node *nc_node = const_cast<Node*>(node);
+ std::sort(nc_node->attribute_begin(), nc_node->attribute_end(),
+ [](Attribute *a, Attribute *b) { return (std::strcmp(a->getName(), b->getName()) < 0); }); // sort alphabetically by attribute name
+ }
+
for(Node::const_attribute_iterator ii = node->attribute_begin(), maxii = node->attribute_end(); ii != maxii; ii ++) {
attribute = Node::attribute(ii);
result += ' ';
/*static*/
void Compiler::writeFullName(const Node* node, Result& result, const int flags)
-throw(RuntimeException) {
+noexcept(false) {
const Namespace* ns;
if((flags & Mode::NoNamespaces) == 0 && (ns = node->getNamespace()) != NULL) {
/*static*/
void Compiler::writeFullName(const Attribute* attr, Result& result, const int flags)
-throw(RuntimeException) {
+noexcept(false) {
const Namespace* ns;
if((flags & Mode::NoNamespaces) == 0 && (ns = attr->getNamespace()) != NULL) {
/*static*/
void Compiler::close(const Node* node, Result& result, const int level, const int flags)
-throw(RuntimeException) {
+noexcept(false) {
for(int i = 0; i < level; i ++)
- result += ANNA_XML_COMPILER_TAB;
+ result += std::string(ANNA_XML_INDENTATION_SPACES, ' ');
result += "</";
writeFullName(node, result, flags);
}
void Compiler::Result::extend(const int nbytes)
-throw(RuntimeException) {
+noexcept(false) {
if((a_size + nbytes) >= a_maxSize) {
int newSize = ((a_size + nbytes) << 1) - ((a_size + nbytes) >> 1);
char* newBuffer = new char [newSize];
projects / anna.git / blobdiff