/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* This file is part of the program and library */ /* SCIP --- Solving Constraint Integer Programs */ /* */ /* Copyright 2002-2022 Zuse Institute Berlin */ /* */ /* Licensed under the Apache License, Version 2.0 (the "License"); */ /* you may not use this file except in compliance with the License. */ /* You may obtain a copy of the License at */ /* */ /* http://www.apache.org/licenses/LICENSE-2.0 */ /* */ /* Unless required by applicable law or agreed to in writing, software */ /* distributed under the License is distributed on an "AS IS" BASIS, */ /* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. */ /* See the License for the specific language governing permissions and */ /* limitations under the License. */ /* */ /* You should have received a copy of the Apache-2.0 license */ /* along with SCIP; see the file LICENSE. If not visit scipopt.org. */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /**@file xml.h * @brief declarations for XML parsing * @author Thorsten Koch * @author Marc Pfetsch */ /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ #ifndef __SCIP_XML_H__ #define __SCIP_XML_H__ #ifdef __cplusplus extern "C" { #endif typedef struct XML_ATTR_struct XML_ATTR; struct XML_ATTR_struct { char* name; char* value; XML_ATTR* next; }; typedef struct XML_NODE_struct XML_NODE; struct XML_NODE_struct { char* name; int lineno; XML_ATTR* attrlist; XML_NODE* parent; XML_NODE* prevsibl; XML_NODE* nextsibl; XML_NODE* firstchild; XML_NODE* lastchild; char* data; /* does not come together with children */ }; /** Parse file */ XML_NODE* xmlProcess( const char* filename /**< XML file name */ ); /** create new node */ XML_NODE* xmlNewNode( const char* name, int lineno ); /** create new attribute */ XML_ATTR* xmlNewAttr( const char* name, const char* value ); /** add attribute */ void xmlAddAttr( XML_NODE* n, XML_ATTR* a ); /** append child node */ void xmlAppendChild( XML_NODE* parent, XML_NODE* child ); /** free node */ void xmlFreeNode( XML_NODE* node ); /** output node */ void xmlShowNode( const XML_NODE* root ); /** get attribute value */ const char* xmlGetAttrval( const XML_NODE* node, const char* name ); /** return first node */ const XML_NODE* xmlFirstNode( const XML_NODE* node, const char* name ); /** return next node */ const XML_NODE* xmlNextNode( const XML_NODE* node, const char* name ); /** find node */ const XML_NODE* xmlFindNode( const XML_NODE* node, const char* name ); /** find node with bound on the depth */ const XML_NODE* xmlFindNodeMaxdepth( const XML_NODE* node, /**< current node - use start node to begin */ const char* name, /**< name of tag to search for */ int depth, /**< current depth - start with 0 */ int maxdepth /**< maximal depth */ ); /** return next sibling */ const XML_NODE* xmlNextSibl( const XML_NODE* node ); /** return previous sibling */ const XML_NODE* xmlPrevSibl( const XML_NODE* node ); /** return first child */ const XML_NODE* xmlFirstChild( const XML_NODE* node ); /** return last child */ const XML_NODE* xmlLastChild( const XML_NODE* node ); /** return name of node */ const char* xmlGetName( const XML_NODE* node ); /** get line number */ int xmlGetLine( const XML_NODE* node ); /** get data */ const char* xmlGetData( const XML_NODE* node ); /** find PCDATA */ const char* xmlFindPcdata( const XML_NODE* node, const char* name ); #ifdef __cplusplus } #endif #endif