Tree Compression with Top Trees Revisited
|
Traverse an in-memory Top DAG in preorder. More...
#include <NavTest.h>
Public Member Functions | |
PreorderTraversal (const TopDag< DataType > &dag, const bool print=false) | |
long long | run () |
Do the traversal and print an XML representation to stdout. More... | |
Protected Member Functions | |
void | openTag (int depth=0, const bool newline=true) |
Output an opening tag. More... | |
void | closeTag (int depth=0, const bool indent=true) |
Output a closing tag. More... | |
void | traverse (int depth=0) |
Recursively traverse. More... | |
Protected Attributes | |
Navigator< DataType > | nav |
const bool | |
Traverse an in-memory Top DAG in preorder.
|
inline |
|
inlineprotected |
|
inlineprotected |
|
inline |
|
inlineprotected |
|
protected |
|
protected |