Tree Compression with Top Trees Revisited
|
Specialised hash map for RePair. More...
#include <RePair.h>
Public Member Functions | |
HashMap (Records< Pair > &records) | |
void | add (uint hash, const Pair &pair) |
void | populatePQ (PriorityQueue< Pair > &queue) |
Public Attributes | |
std::unordered_map< uint, uint > | recordMap |
Records< Pair > & | records |
Friends | |
std::ostream & | operator<< (std::ostream &os, const HashMap< Pair > &hashMap) |
Specialised hash map for RePair.
|
inline |
|
inline |
|
inline |
|
friend |
std::unordered_map<uint, uint> SimpleRePair::HashMap< Pair >::recordMap |
Records<Pair>& SimpleRePair::HashMap< Pair >::records |