X-Git-Url: https://main.carlh.net/gitweb/?a=blobdiff_plain;f=src%2Fxml.h;h=5978ff7ec10d7346a941d5ebbb71297c3fc5b33c;hb=62701cd6827b885fdfaef5159a542ea25a6c24b7;hp=2469981c877d1d48b34fcacc4c6dddcc155c194d;hpb=22da2b02b161290a1c3c08f041eb5456e5fdd3c6;p=libdcp.git diff --git a/src/xml.h b/src/xml.h index 2469981c..5978ff7e 100644 --- a/src/xml.h +++ b/src/xml.h @@ -1,82 +1,91 @@ -#ifndef LIBDCP_XML_H -#define LIBDCP_XML_H +/* + Copyright (C) 2013 Carl Hetherington -#include -#include -#include -#include -#include -#include "types.h" -#include "exceptions.h" + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. -namespace xmlpp { - class Node; - class DomParser; -} + 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 General Public License for more details. -namespace libdcp { + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. -class XMLNode -{ -public: - XMLNode (); - XMLNode (xmlpp::Node const * node); +*/ -protected: - std::string string_node (std::string); - std::string optional_string_node (std::string); - ContentKind kind_node (std::string); - Fraction fraction_node (std::string); - int64_t int64_node (std::string); - void ignore_node (std::string); - void done (); +#ifndef LIBDCP_XML_H +#define LIBDCP_XML_H - template - boost::shared_ptr sub_node (std::string name) { - return boost::shared_ptr (new T (xml_node (name))); - } +#include +#include "exceptions.h" - template - boost::shared_ptr optional_sub_node (std::string name) { - std::list n = xml_nodes (name); - if (n.size() > 1) { - throw XMLError ("duplicate XML tag"); - } else if (n.empty ()) { - return boost::shared_ptr (); - } - - return boost::shared_ptr (new T (n.front ())); - } - - template - std::list > sub_nodes (std::string name, std::string sub) { - XMLNode p (xml_node (name)); - std::list n = p.xml_nodes (sub); - std::list > r; - for (typename std::list::iterator i = n.begin(); i != n.end(); ++i) { - r.push_back (boost::shared_ptr (new T (*i))); - } - return r; +namespace libdcp +{ + +template +boost::shared_ptr +optional_type_child (cxml::Node const & node, std::string name) +{ + std::list > n = node.node_children (name); + if (n.size() > 1) { + throw XMLError ("duplicate XML tag"); + } else if (n.empty ()) { + return boost::shared_ptr (); } - xmlpp::Node const * _node; + return boost::shared_ptr (new T (n.front ())); +} -private: - xmlpp::Node* xml_node (std::string); - std::list xml_nodes (std::string); - std::list _taken; -}; +template +boost::shared_ptr type_child (boost::shared_ptr node, std::string name) { + return boost::shared_ptr (new T (node->node_child (name))); +} + +template +boost::shared_ptr +optional_type_child (boost::shared_ptr node, std::string name) +{ + return optional_type_child (*node.get(), name); +} -class XMLFile : public XMLNode +template +std::list > +type_children (cxml::Node const & node, std::string name) { -public: - XMLFile (std::string file, std::string root_name); - virtual ~XMLFile (); + std::list > n = node.node_children (name); + std::list > r; + for (typename std::list >::iterator i = n.begin(); i != n.end(); ++i) { + r.push_back (boost::shared_ptr (new T (*i))); + } + return r; +} -private: - xmlpp::DomParser* _parser; -}; +template +std::list > +type_children (boost::shared_ptr node, std::string name) +{ + return type_children (*node.get(), name); +} + +template +std::list > +type_grand_children (cxml::Node const & node, std::string name, std::string sub) +{ + boost::shared_ptr p = node.node_child (name); + return type_children (p, sub); +} +template +std::list > +type_grand_children (boost::shared_ptr node, std::string name, std::string sub) +{ + return type_grand_children (*node.get(), name, sub); +} + } #endif