27 parent->m_siblings.push_back (
this);
42 parent->m_siblings.push_back (
this);
54 DOMSiblings::iterator sit;
114 std::cout <<
header << std::endl;
121 for (i = 0; i <
depth; i++) std::cout <<
" ";
122 std::cout <<
"<!--" <<
m_value <<
"-->" << std::endl;
131 for (i = 0; i <
depth; i++) std::cout <<
" ";
132 std::cout <<
"<" <<
m_name;
134 std::map <std::string, std::string>::const_iterator ait;
138 const std::string& n = (*ait).first;
139 const std::string& v = (*ait).second;
141 std::cout <<
" " << n <<
"='" << v <<
"'";
144 std::cout <<
">" << std::endl;
146 DOMSiblings::const_iterator sit;
152 n->print (
"",
depth+1);
155 for (i = 0; i <
depth; i++) std::cout <<
" ";
156 std::cout <<
"</" <<
m_name <<
">" << std::endl;
DOMNamedNodeMap m_attributes
void print(const std::string &header="", int depth=0) const
const DOMNamedNodeMap & get_attributes() const
unsigned int sibling_number() const
const DOMSiblings & get_siblings() const
DOMSiblings::iterator m_it
NodeType get_type() const
const std::string & get_name() const
DOMNode * get_next_sibling()
DOMNode * get_first_child()
const std::string & get_value() const
std::string depth
tag string for intendation
std::vector< DOMNode * > DOMSiblings
std::map< std::string, std::string > DOMNamedNodeMap