|
|
@ -366,7 +366,7 @@ namespace xml { |
|
|
|
} |
|
|
|
} |
|
|
|
Node& Node::limits(size_type min, size_type max) throw() { |
|
|
|
Node& Node::limits(size_type min, size_type max) throw() { |
|
|
|
_min = min; |
|
|
|
_min = min; |
|
|
|
_min = max; |
|
|
|
_max = max; |
|
|
|
return *this; |
|
|
|
return *this; |
|
|
|
} |
|
|
|
} |
|
|
|
Node::List Node::list(const std::string& name) const throw() { |
|
|
|
Node::List Node::list(const std::string& name) const throw() { |
|
|
@ -555,7 +555,7 @@ namespace xml { |
|
|
|
os<<std::endl; |
|
|
|
os<<std::endl; |
|
|
|
for (Node::size_type i(0); i<node.children(); ++i) |
|
|
|
for (Node::size_type i(0); i<node.children(); ++i) |
|
|
|
print(os, node[i], level+1); |
|
|
|
print(os, node[i], level+1); |
|
|
|
os<<std::string(level, '\t')<<"</"<<node.name()<<'>'; |
|
|
|
os<<std::string(level, '\t')<<"</"<<node.name()<<'>'<<std::endl; |
|
|
|
} else { |
|
|
|
} else { |
|
|
|
os<<std::string(level, '\t')<<'<'<<node.name(); |
|
|
|
os<<std::string(level, '\t')<<'<'<<node.name(); |
|
|
|
for (Attributes::const_iterator it(node.attributes().begin()); |
|
|
|
for (Attributes::const_iterator it(node.attributes().begin()); |
|
|
|