CalculateHuffmanCode()

uint[] System.IO.Compression.HuffmanTree.CalculateHuffmanCode ( )

inlineprivate

Definition at line 86 of file HuffmanTree.cs.

    {
        uint[] array = new uint[17];
        byte[] codeLengthArray = _codeLengthArray;
        foreach (int num in codeLengthArray)
        {
            array[num]++;
        }
        array[0] = 0u;
        uint[] array2 = new uint[17];
        uint num2 = 0u;
        for (int j = 1; j <= 16; j++)
        {
            num2 = (array2[j] = num2 + array[j - 1] << 1);
        }
        uint[] array3 = new uint[288];
        for (int k = 0; k < _codeLengthArray.Length; k++)
        {
            int num3 = _codeLengthArray[k];
            if (num3 > 0)
            {
                array3[k] = BitReverse(array2[num3], num3);
                array2[num3]++;
            }
        }
        return array3;
    }

References System.IO.Compression.HuffmanTree._codeLengthArray, System.array, and System.IO.Compression.HuffmanTree.BitReverse().

Referenced by System.IO.Compression.HuffmanTree.CreateTable().