blob: 7615a3d19ad95b327399b891321746224848646a (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
#include "Tree.h"
#include "nodedumper.h"
#include <assert.h>
#include <algorithm>
static bool filter(char c)
{
return c == ' ' || c == '\n' || c == '\t' || c == '\r';
}
/*!
Returns the cached string representation of the subtree rooted by \a node.
If node is not cached, the cache will be rebuilt.
*/
const std::string Tree::getString(const AbstractNode &node) const
{
assert(this->root_node);
if (!this->nodecache.contains(node)) {
NodeDumper dumper(this->nodecache, false);
Traverser trav(dumper, *this->root_node, Traverser::PRE_AND_POSTFIX);
trav.execute();
assert(this->nodecache.contains(*this->root_node) &&
"NodeDumper failed to create a cache");
}
std::string str = this->nodecache[node];
str.erase(std::remove_if(str.begin(), str.end(), filter), str.end());
return str;
}
/*!
Sets a new root. Will clear the existing cache.
*/
void Tree::setRoot(const AbstractNode *root)
{
this->root_node = root;
this->nodecache.clear();
}
|
