Tree Compression with Top Trees Revisited
Main Page
Namespaces
Classes
Files
Class List
Class Index
Class Hierarchy
Class Members
All
Functions
Variables
Typedefs
Enumerations
Enumerator
Related Functions
_
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
- _ -
_firstFreeEdge :
OrderedTree< NodeType, EdgeType >
_firstFreeNode :
OrderedTree< NodeType, EdgeType >
_numEdges :
OrderedTree< NodeType, EdgeType >
_numNodes :
OrderedTree< NodeType, EdgeType >
- a -
alreadyProcessed :
TopDagDotGraphExporter< DataType >
avg :
Statistics
avgDepth :
DebugInfo
- b -
bitsForInputMapping :
RePair::Coder< DataType >
blockingFactor :
BlockedHuffmanWriter< InputType, OutputType, inputSize, outputSize >
,
HuffmanBlocker< InputType, OutputType, inputSize, outputSize >
buffer :
BitWriter
,
BlockedHuffmanWriter< InputType, OutputType, inputSize, outputSize >
,
HuffmanWriter< SymbolType >
buffersize :
BitWriter
bufitem :
BitWriter
bytesWritten :
BitWriter
- c -
cache :
NodeHasher< TreeType, DataType >
clusters :
TopTree< DataType >
clusterToDag :
TopDag< DataType >
codes :
HuffmanBuilder< SymbolType >
count :
RePair::PQEntry
- d -
dag :
DagEntropy< DataType >
dagDuration :
DebugInfo
dagPointerEntropy :
DagEntropy< DataType >
dagPointerWriter :
DagEntropy< DataType >
dagStructureEntropy :
DagEntropy< DataType >
dagStructureWriter :
DagEntropy< DataType >
dict :
RePair::Coder< DataType >
dictionary :
RePair::RePair< DataType, InputType >
dirty :
RePairCombiner< TreeType, DataType >
distribution :
RandomTreeGenerator< RNG >
- e -
edgeRatios :
DebugInfo
edges :
OrderedTree< NodeType, EdgeType >
extraVerbose :
RePairCombiner< TreeType, DataType >
,
TopDagConstructor< TreeType, DataType >
- f -
firstEdgeIndex :
TreeNode
FLAG_MASK :
RePair::PQEntry
fn :
BitWriter
frequencies :
HuffmanBuilder< SymbolType >
frequency :
HuffNode
,
SimpleRePair::Record< Pair >
- g -
generationDuration :
DebugInfo
generator :
RandomTreeGenerator< RNG >
- h -
hash :
SimpleRePair::Record< Pair >
,
TreeNode
hasher :
RePairCombiner< TreeType, DataType >
hashTable :
RePair::RePair< DataType, InputType >
headNode :
TreeEdge
height :
DebugInfo
huff :
RePair::Coder< DataType >
huffman :
BlockedHuffmanWriter< InputType, OutputType, inputSize, outputSize >
,
HuffmanBlocker< InputType, OutputType, inputSize, outputSize >
,
HuffmanWriter< SymbolType >
,
LabelDataEntropy< std::string >
- i -
inDegree :
DagNode< T >
index :
RePair::PQEntry
ioDuration :
DebugInfo
itempos :
BitWriter
iterations :
DebugInfo
- k -
keys :
Labels< Value >
- l -
label :
Cluster< DataType >
,
DagNode< T >
labelDataEntropy :
DagEntropy< DataType >
labels :
LabelDataEntropy< std::string >
,
RandomLabels< RNG >
,
TopDag< DataType >
labelWriter :
DagEntropy< DataType >
lastEdgeIndex :
TreeNode
lastMergedIn :
TreeNode
left :
Cluster< DataType >
,
DagNode< T >
,
NavigationRecord
leftId :
HuffInnerNode
- m -
max :
Statistics
maxClusterId :
TopDag< DataType >
maxEdgeRatio :
DebugInfo
mergeDuration :
DebugInfo
mergeEntropy :
DagEntropy< DataType >
mergeType :
Cluster< DataType >
,
DagNode< T >
mergeWriter :
DagEntropy< DataType >
min :
Statistics
minEdgeRatio :
DebugInfo
modulo :
IdLabels
mutex :
StatWriter
- n -
nav :
PreorderTraversal< DataType >
next :
RePair::Records< DataType >
nextEntry :
RePair::PQEntry
nodeId :
NavigationRecord
nodeIds :
NodeHasher< TreeType, DataType >
,
RePairCombiner< TreeType, DataType >
,
TopDagConstructor< TreeType, DataType >
nodeMap :
TopDag< DataType >
nodes :
HuffmanBuilder< SymbolType >
,
OrderedTree< NodeType, EdgeType >
,
TopDag< DataType >
numDagEdges :
DebugInfo
numDagNodes :
DebugInfo
numDebugInfos :
Statistics
numItems :
HuffmanBuilder< SymbolType >
numLeaves :
TopTree< DataType >
- o -
occurrences :
SimpleRePair::Record< Pair >
out :
BitWriter
,
Statistics
,
StatWriter
output :
RePair::Coder< DataType >
- p -
parent :
TreeNode
parentId :
NavigationRecord
pointlessInts :
IdLabels
pqentries :
RePair::RePair< DataType, InputType >
prev :
RePair::Records< DataType >
prevEntry :
RePair::PQEntry
print :
PreorderTraversal< DataType >
- q -
queue :
RePair::RePair< DataType, InputType >
- r -
recordMap :
SimpleRePair::HashMap< Pair >
records :
RePair::RePair< DataType, InputType >
,
SimpleRePair::HashMap< Pair >
,
SimpleRePair::Records< Pair >
retval :
FakeLabels< Value >
right :
Cluster< DataType >
,
DagNode< T >
rightId :
HuffInnerNode
- s -
skipSymbol :
RePair::Records< DataType >
statDuration :
DebugInfo
symbolCount :
RePair::Records< DataType >
symbolId :
HuffLeaf
symbols :
HuffmanBuilder< SymbolType >
- t -
tempStore :
BlockedHuffmanWriter< InputType, OutputType, inputSize, outputSize >
,
HuffmanBlocker< InputType, OutputType, inputSize, outputSize >
text :
RePair::Records< DataType >
topDag :
NodeHasher< TreeType, DataType >
,
RePairCombiner< TreeType, DataType >
,
TopDagConstructor< TreeType, DataType >
topTreeAvgDepth :
DebugInfo
topTreeHeight :
DebugInfo
topTreeMinDepth :
DebugInfo
tree :
NodeHasher< TreeType, DataType >
,
RePairCombiner< TreeType, DataType >
,
TopDagConstructor< TreeType, DataType >
- u -
unpackDuration :
DebugInfo
- v -
valid :
TreeEdge
valueIndex :
Labels< Value >
values :
Labels< Value >
verbose :
RePairCombiner< TreeType, DataType >
,
TopDagConstructor< TreeType, DataType >
- w -
workingEntries :
RePair::RePair< DataType, InputType >
writer :
BlockedHuffmanWriter< InputType, OutputType, inputSize, outputSize >
,
DagEntropy< DataType >
,
HuffmanWriter< SymbolType >
Generated on Tue Jun 23 2015 18:14:00 for Tree Compression with Top Trees Revisited by
1.8.9.1