[freesci-develop] Re: SCI 1.1 decompress hufmann trees, one small fix

[Petr Vyhnak]

>
>This is not a Huffman tree:
Sorry. The value for 00 should be bits 101

That gives this tree:
                                                 Root
                         1 
0

           1(=0x01)                  0

                                  1(=0x00)   0(=0x02) 
      (the  rest of the tree here ...)

Petr

PS: here is the tree in another form:
{ // first value is the bit string and the 2nd is the length of the string 
- how many LSB bits to use
         {0x05,3}, // 0
         {0x03,2}, // 1
         {0x01,3}, // 2
         {0x06,3}, // 3
         {0x0A,4}, // 4
         {0x02,4}, // 5
         {0x0C,4}, // 6
         {0x14,5}, // 7
         {0x04,5}, // 8
         {0x18,5}, // 9
         {0x08,5}, // A
         {0x30,6}, // B
         {0x10,6}, // C
         {0x20,6}, // D
         {0x40,7}, // E
         {0x00,7}, // F
};