drwnXMLParser.h

Go to the documentation of this file.

/*****************************************************************************
** DARWIN: A FRAMEWORK FOR MACHINE LEARNING RESEARCH AND DEVELOPMENT
** Distributed under the terms of the BSD license (see the LICENSE file)
** Copyright (c) 2007-2015, Stephen Gould
** All rights reserved.
**
******************************************************************************
** FILENAME:    drwnXMLParser.h
** AUTHOR(S):   Stephen Gould <stephen.gould@anu.edu.au>
**
*****************************************************************************/

#pragma once

#define RAPIDXML_NO_EXCEPTIONS
#include "../../../external/rapidxml/rapidxml.hpp"
#include "../../../external/rapidxml/rapidxml_utils.hpp"
#include "../../../external/rapidxml/rapidxml_print.hpp"

#define drwnXMLDoc rapidxml::xml_document<char>
#define drwnXMLNode rapidxml::xml_node<char>
#define drwnXMLAttr rapidxml::xml_attribute<char>

// essential utilities

drwnXMLNode *drwnParseXMLFile(drwnXMLDoc& xml, const char* filename, const char *tag = NULL);
bool drwnIsXMLEmpty(drwnXMLNode& xml);
int drwnCountXMLChildren(drwnXMLNode& xml, const char *name = NULL);
drwnXMLAttr *drwnAddXMLAttribute(drwnXMLNode& xml, const char *name, const char *value,
    bool bCopyName = true);
drwnXMLNode *drwnAddXMLText(drwnXMLNode& xml, const char *value);
drwnXMLNode *drwnAddXMLChildNode(drwnXMLNode& parent, const char *name,
    const char *value = NULL, bool bCopyName = true);
drwnXMLNode *drwnAddXMLRootNode(drwnXMLDoc& xml, const char *name, bool bCopyName = false);
inline const char *drwnGetXMLAttribute(const drwnXMLNode& node, const char *name)
{
    drwnXMLAttr *a = node.first_attribute(name);
    return (a == NULL) ? NULL : a->value();
}
inline const char *drwnGetXMLText(const drwnXMLNode &node)
{
    if ((node.value() != NULL) && (node.value()[0] != '\0'))
        return node.value();

    const drwnXMLNode *child = node.first_node();
    while (child != NULL) {
        if (child->type() == rapidxml::node_data) {
            return child->value();
        }
        child = child->next_sibling();
    }

    return node.value();
}