INMOST
A toolkit for distributed mathematical modeling
|
Structure defining entire XML file. More...
#include <inmost_xml.h>
Public Member Functions | |
int | FindChild (std::string name, int offset=-1) const |
Return next occurence of XML tag with the specified name. More... | |
int | FindAttrib (std::string name, int offset=-1) const |
Return next occurence of XML attribute with the specified name. More... | |
const XMLTree & | GetChild (int n) const |
Retrieve a child of current XML tag with number n. | |
const XMLTree * | GetChild (std::string name) const |
Retrieve a child of current XML tag with name Returns NULL if not found. | |
const XMLTree * | GetChildWithAttrib (std::string name, std::string value) const |
Retrieve a child of current XML tag with attribute Returns NULL if not found. | |
int | NumChildren () const |
Retrieve number of children. | |
const XMLAttrib & | GetAttrib (int n) const |
Retrieve attribute of current XML tag with number n. | |
const std::string & | GetAttrib (std::string name) const |
Retrieve attribute of current XML tag with name. More... | |
int | NumAttrib () const |
Retrieve number of attributes. | |
std::string | GetName () const |
Retrieve the name of the tag. | |
const std::string & | GetContents () const |
Retrieve contents of the tag. | |
Public Attributes | |
XMLTag | tag |
std::vector< XMLTree > | children |
std::string | contents |
Structure defining entire XML file.
Definition at line 194 of file inmost_xml.h.
int INMOST::XMLReader::XMLTree::FindAttrib | ( | std::string | name, |
int | offset = -1 |
||
) | const |
Return next occurence of XML attribute with the specified name.
Returns NumAttrib() if not found.
int INMOST::XMLReader::XMLTree::FindChild | ( | std::string | name, |
int | offset = -1 |
||
) | const |
Return next occurence of XML tag with the specified name.
Returns NumChildren() if not found.
const std::string& INMOST::XMLReader::XMLTree::GetAttrib | ( | std::string | name | ) | const |
Retrieve attribute of current XML tag with name.
Returns NULL if not found.