Tree Compression with Top Trees Revisited
|
A key-value label storage. More...
#include <Labels.h>
Public Member Functions | |
Labels (int sizeHint=0) | |
const Value & | operator[] (uint index) const |
void | set (uint id, const Value &value) |
uint | size () const |
uint | numKeys () const |
Public Attributes | |
std::vector< int > | keys |
std::vector< const Value * > | valueIndex |
std::unordered_map< Value, int > | values |
A key-value label storage.
A double-indexed key-value label storage, allowing efficient access by ID and efficient non-duplicating setting of labels
|
inline |
|
inlinevirtual |
Access operator
index | the index of the label to look up |
Implements LabelsT< Value >.
|
inlinevirtual |
Set a label
id | the index of the label to set |
value | the value to set the label to |
Implements LabelsT< Value >.
|
inline |
std::vector<int> Labels< Value >::keys |
std::vector<const Value *> Labels< Value >::valueIndex |
std::unordered_map<Value, int> Labels< Value >::values |