diff options
| author | Marius Kintel <marius@kintel.net> | 2010-03-30 22:53:01 (GMT) |
|---|---|---|
| committer | Marius Kintel <marius@kintel.net> | 2010-10-31 00:42:35 (GMT) |
| commit | 99f406d9941ef9fef8b2522ccbf6a72eb474f27a (patch) | |
| tree | f9dc4a9f0e9e66fc8264044f4b6d663c87467a08 /src/node.cc | |
| parent | eb81def6ebfa0997798808408e3d27f03eff1996 (diff) | |
Removed temporary REMOVE_DUMP define
Diffstat (limited to 'src/node.cc')
| -rw-r--r-- | src/node.cc | 28 |
1 files changed, 1 insertions, 27 deletions
diff --git a/src/node.cc b/src/node.cc index 0cdf5d7..dc2fc0c 100644 --- a/src/node.cc +++ b/src/node.cc @@ -64,19 +64,7 @@ Response AbstractPolyNode::accept(const class State &state, Visitor &visitor) co return visitor.visit(state, *this); } -#ifndef REMOVE_DUMP -QString AbstractNode::dump(QString indent) const -{ - if (dump_cache.isEmpty()) { - QString text = indent + QString("n%1: group() {\n").arg(idx); - foreach (AbstractNode *v, children) - text += v->dump(indent + QString("\t")); - ((AbstractNode*)this)->dump_cache = text + indent + "}\n"; - } - return dump_cache; -} -#else -// Temporarily offer a top-level dump function to keep existing code running +// FIXME: Temporarily offer a top-level dump function to keep existing code running QString AbstractNode::dump() const { NodeDumper dumper; @@ -84,7 +72,6 @@ QString AbstractNode::dump() const trav.execute(); return QString::fromStdString(dumper.getDump() + "\n"); } -#endif std::string AbstractNode::toString() const { @@ -93,19 +80,6 @@ std::string AbstractNode::toString() const return stream.str(); } -#ifndef REMOVE_DUMP -QString AbstractIntersectionNode::dump(QString indent) const -{ - if (dump_cache.isEmpty()) { - QString text = indent + QString::fromStdString(this->toString()) + " {\n"; - foreach (AbstractNode *v, children) - text += v->dump(indent + QString("\t")); - ((AbstractNode*)this)->dump_cache = text + indent + "}\n"; - } - return dump_cache; -} -#endif - std::string AbstractIntersectionNode::toString() const { std::stringstream stream; |