|
Tree Compression with Top Trees Revisited
|
Hash a node for RePair combiner. More...
#include <RePairTreeHasher.h>

Public Member Functions | |
| NodeHasher (TreeType &tree, const TopDag< DataType > &topDag, const std::vector< int > &nodeIds) | |
| void | hashNode (const int nodeId) |
| uint | hashCluster (const int clusterId) |
| void | hashTree (const int nodeId=0) |
| Hash the entire tree in post-order. More... | |
Public Attributes | |
| TreeType & | tree |
| const TopDag< DataType > & | topDag |
| const std::vector< int > & | nodeIds |
| std::vector< uint > | cache |
Hash a node for RePair combiner.
Definition at line 7 of file RePairTreeHasher.h.
|
inline |
Create hasher for a tree and its tentative Top DAG
| tree | The input tree |
| topDag | An empty Top DAG |
| nodeIds | An empty mapping from tree nodes to Top DAG clusters |
Definition at line 12 of file RePairTreeHasher.h.
|
inline |
Hash a cluster
| clusterId | cluster identified by its Top DAG cluster ID |
| returns | the hash value (which is also set) |
Definition at line 25 of file RePairTreeHasher.h.
|
inline |
Hash a node
| nodeId | node identified by its tree node ID |
Definition at line 17 of file RePairTreeHasher.h.
|
inline |
Hash the entire tree in post-order.
Definition at line 51 of file RePairTreeHasher.h.
| std::vector<uint> NodeHasher< TreeType, DataType >::cache |
Definition at line 63 of file RePairTreeHasher.h.
| const std::vector<int>& NodeHasher< TreeType, DataType >::nodeIds |
Definition at line 62 of file RePairTreeHasher.h.
| const TopDag<DataType>& NodeHasher< TreeType, DataType >::topDag |
Definition at line 61 of file RePairTreeHasher.h.
| TreeType& NodeHasher< TreeType, DataType >::tree |
Definition at line 60 of file RePairTreeHasher.h.
1.8.9.1