Class Huffman.Node

java.lang.Object

Huffman.Node

All Implemented Interfaces:

java.io.Serializable, java.lang.Comparable<Huffman.Node>

Enclosing class:

Huffman

 class Huffman.Node
extends java.lang.Object
implements java.io.Serializable, java.lang.Comparable<Huffman.Node>

Inner class for the node of Huffman tree.

Field Summary

Fields

Modifier and Type	Field and Description
(package private) byte[]	cde code (variable length)
(package private) int	codeLength code length in bits
(package private) int	frequency frequency of the symbol in source data
(package private) Huffman.Node	left left child, 0 is appended to the code
(package private) Huffman.Node	right right child, 1 is appended to the code
static long	serialVersionUID serialization version id
(package private) byte	symbol byte to encode (for the leaf nodes)

Constructor Summary

Constructors

Constructor and Description
Huffman.Node() Default constructor.
Huffman.Node(byte sy, int fr) Constructor for leaves with byte data.
Huffman.Node(char ch, int fr) Constructor for leaves with char data.
Huffman.Node(Huffman.Node vs, Huffman.Node pr, int fr) Constructor for intermediate nodes.
Huffman.Node(int fr, Huffman.Node vs, Huffman.Node pr) Constructor for intermediate nodes.

Method Summary

Methods

Modifier and Type	Method and Description
(package private) int	bitsCounted() Length of source data in bits.
int	compareTo(Huffman.Node tt) Less frequent nodes come first.
(package private) void	setCode(int lngth, byte[] nodeCode) Calculating codes for this tree starting from the root (recursive).

Methods inherited from class java.lang.Object

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

Field Detail

serialVersionUID

public static final long serialVersionUID

serialization version id

See Also:

Constant Field Values

left

Huffman.Node left

left child, 0 is appended to the code

right

Huffman.Node right

right child, 1 is appended to the code

symbol

byte symbol

byte to encode (for the leaf nodes)

frequency

int frequency

frequency of the symbol in source data

codeLength

int codeLength

code length in bits

cde

byte[] cde

code (variable length)

Constructor Detail

Huffman.Node

Huffman.Node()

Default constructor.

Huffman.Node

Huffman.Node(byte sy,
            int fr)

Constructor for leaves with byte data.

Huffman.Node

Huffman.Node(char ch,
            int fr)

Constructor for leaves with char data.

Huffman.Node

Huffman.Node(int fr,
            Huffman.Node vs,
            Huffman.Node pr)

Constructor for intermediate nodes.

Huffman.Node

Huffman.Node(Huffman.Node vs,
            Huffman.Node pr,
            int fr)

Constructor for intermediate nodes.

Method Detail

compareTo

public int compareTo(Huffman.Node tt)

Less frequent nodes come first.

Specified by:

compareTo in interface java.lang.Comparable<Huffman.Node>

setCode

void setCode(int lngth,
           byte[] nodeCode)

Calculating codes for this tree starting from the root (recursive).

Parameters:

lngth - length of the code for this node in bits

nodeCode - code of this node

bitsCounted

int bitsCounted()

Length of source data in bits.

Returns:

number of bits