31 if(currentDepth >= 0) {
33 for(
int i=0;i<currentDepth;++i)
52 std::string value = node->
value();
55 if(value.find(
"\n") != std::string::npos) {
56 if(value[value.length()-1] ==
'\n' && value[value.length()-2] ==
'\n')
58 else if(value[value.length()-1] ==
'\n')
64 for(std::size_t pos = 0; pos < value.length(); ++pos) {
68 for(
int i=0;i<currentDepth+1;++i)
72 while(pos < value.length()) {
73 if(value[pos] ==
'\n')
85 for(
int i=0;i<node->
size();++i) {
86 if(currentDepth >= 0 || i != 0)