fact.io.hdureader.zfits

Class ByteWiseHuffmanTree

java.lang.Object

fact.io.hdureader.zfits.ByteWiseHuffmanTree

public class ByteWiseHuffmanTree
extends Object

A thing I call a ByteWiseHuffmann tree. Each nodes has up to 256 children. This works because the huffmann codes in the zfits files are aligned to bytes. So once a codeword is longer than one byte we traverse down a level. Each leaf contains a ByteWiseTree.Symbol object

See Also:

This implementation is quite similar to the things T Bretz and M Bulinski did.

Created by mackaiver on 16/11/16.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	ByteWiseHuffmanTree.Symbol

Field Summary

Fields

Modifier and Type	Field and Description
ByteWiseHuffmanTree[]	children
boolean	isLeaf
ByteWiseHuffmanTree.Symbol	payload

Constructor Summary

Constructors

Constructor and Description
ByteWiseHuffmanTree()

Method Summary

Modifier and Type	Method and Description
static void	insert(ByteWiseHuffmanTree rootNode, int bits, int codeLengthInBits, ByteWiseHuffmanTree.Symbol symbol) Insert a symbol into this huffmann tree.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

payload

public ByteWiseHuffmanTree.Symbol payload

children

public ByteWiseHuffmanTree[] children

isLeaf

public boolean isLeaf

Constructor Detail

ByteWiseHuffmanTree

public ByteWiseHuffmanTree()

Method Detail

insert

public static void insert(ByteWiseHuffmanTree rootNode,
                          int bits,
                          int codeLengthInBits,
                          ByteWiseHuffmanTree.Symbol symbol)

Insert a symbol into this huffmann tree.

Parameters:

rootNode - the rootnode of the tree to insert into.

bits - the bots of the codeword as int.

codeLengthInBits - the length of the codeword to insert.

symbol - the symbol to store in the leaf.