Tree Compression with Top Trees Revisited
Public Member Functions | Public Attributes | List of all members
IdLabels Struct Reference

Hashing modulo-wrapping label generator (NOT UNIFORM) More...

#include <Labels.h>

Inheritance diagram for IdLabels:
Inheritance graph
[legend]
Collaboration diagram for IdLabels:
Collaboration graph
[legend]

Public Member Functions

 IdLabels (uint modulo)
 
const int & operator[] (uint index) const
 Access a label by hashing its index. More...
 
void set (uint id, const int &value)
 this does nothing More...
 

Public Attributes

uint modulo
 
std::vector< int > pointlessInts
 

Detailed Description

Hashing modulo-wrapping label generator (NOT UNIFORM)

Definition at line 44 of file Labels.h.

Constructor & Destructor Documentation

IdLabels::IdLabels ( uint  modulo)
inline

Create a new set of labels

Parameters
modulothe number of different values to assign the labels

Definition at line 47 of file Labels.h.

Member Function Documentation

const int& IdLabels::operator[] ( uint  index) const
inlinevirtual

Access a label by hashing its index.

Implements LabelsT< int >.

Definition at line 54 of file Labels.h.

void IdLabels::set ( uint  id,
const int &  value 
)
inlinevirtual

this does nothing

Implements LabelsT< int >.

Definition at line 63 of file Labels.h.

Member Data Documentation

uint IdLabels::modulo

Definition at line 68 of file Labels.h.

std::vector<int> IdLabels::pointlessInts

We need this because results need to be returned by reference and are referred to with pointers elsewhere. As the name says, it's rather pointless, but ah well.

Definition at line 71 of file Labels.h.


The documentation for this struct was generated from the following file: