Hash a node for RePair combiner.
More...
#include <RePairTreeHasher.h>
template<typename TreeType, typename DataType>
struct NodeHasher< TreeType, DataType >
Hash a node for RePair combiner.
Definition at line 7 of file RePairTreeHasher.h.
template<typename TreeType, typename DataType>
NodeHasher< TreeType, DataType >::NodeHasher |
( |
TreeType & |
tree, |
|
|
const TopDag< DataType > & |
topDag, |
|
|
const std::vector< int > & |
nodeIds |
|
) |
| |
|
inline |
Create hasher for a tree and its tentative Top DAG
- Parameters
-
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.
template<typename TreeType, typename DataType>
uint NodeHasher< TreeType, DataType >::hashCluster |
( |
const int |
clusterId | ) |
|
|
inline |
Hash a cluster
- Parameters
-
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.
template<typename TreeType, typename DataType>
void NodeHasher< TreeType, DataType >::hashNode |
( |
const int |
nodeId | ) |
|
|
inline |
Hash a node
- Parameters
-
nodeId | node identified by its tree node ID |
Definition at line 17 of file RePairTreeHasher.h.
template<typename TreeType, typename DataType>
void NodeHasher< TreeType, DataType >::hashTree |
( |
const int |
nodeId = 0 | ) |
|
|
inline |
template<typename TreeType, typename DataType>
std::vector<uint> NodeHasher< TreeType, DataType >::cache |
template<typename TreeType, typename DataType>
const std::vector<int>& NodeHasher< TreeType, DataType >::nodeIds |
template<typename TreeType, typename DataType>
template<typename TreeType, typename DataType>
The documentation for this struct was generated from the following file: