InflaterHuffmanTree(byte[] codeLengths) throws DataFormatException 
{
  
    try 
      {
	byte[] codeLengths = new byte[288];
	int i = 0;
	while (i <  144)
	  codeLengths[i++] = 8;
	while (i <  256)
	  codeLengths[i++] = 9;
	while (i <  280)
	  codeLengths[i++] = 7;
	while (i <  288)
	  codeLengths[i++] = 8;
	defLitLenTree = new InflaterHuffmanTree(codeLengths);
	codeLengths = new byte[32];
	i = 0;
	while (i <  32)
	  codeLengths[i++] = 5;
	defDistTree = new InflaterHuffmanTree(codeLengths);
      } 
    catch (DataFormatException ex)
      {
	throw new InternalError
	  ("InflaterHuffmanTree: static tree length illegal");
      }
    buildTree(codeLengths);
}

Constructs a Huffman tree from the array of code lengths.

Parameters:

codeLengths - the array of code lengths

 int getSymbol(StreamManipulator input) throws DataFormatException 
{
    int lookahead, symbol;
    if ((lookahead = input.peekBits(9))  >= 0)
      {
	if ((symbol = tree[lookahead])  >= 0)
	  {
	    input.dropBits(symbol & 15);
	    return symbol  > > 4;
	  }
	int subtree = -(symbol  > > 4);
	int bitlen = symbol & 15;
	if ((lookahead = input.peekBits(bitlen))  >= 0)
	  {
	    symbol = tree[subtree | (lookahead  > > 9)];
	    input.dropBits(symbol & 15);
	    return symbol  > > 4;
	  }
	else
	  {
	    int bits = input.getAvailableBits();
	    lookahead = input.peekBits(bits);
	    symbol = tree[subtree | (lookahead  > > 9)];
	    if ((symbol & 15) < = bits)
	      {
		input.dropBits(symbol & 15);
		return symbol  > > 4;
	      }
	    else
	      return -1;
	  }
      }
    else
      {
	int bits = input.getAvailableBits();
	lookahead = input.peekBits(bits);
	symbol = tree[lookahead];
	if (symbol  >= 0 && (symbol & 15) < = bits)
	  {
	    input.dropBits(symbol & 15);
	    return symbol  > > 4;
	  }
	else
	  return -1;
      }
}

Reads the next symbol from input. The symbol is encoded using the huffman tree.