| 1 |
/** @license zlib.js 2012 - imaya [ https://github.com/imaya/zlib.js ] The MIT License */ |
| 2 |
/* eslint-disable unicorn/numeric-separators-style,camelcase,no-unused-expressions */ |
| 3 |
goog.provide("Zlib.Huffman"); |
| 4 |
|
| 5 |
goog.scope(function () { |
| 6 |
/** |
| 7 |
* build huffman table from length list. |
| 8 |
* @param {Uint8Array} lengths length list. |
| 9 |
* @return {Array.<number,number,number>} huffman table. |
| 10 |
*/ |
| 11 |
Zlib.Huffman.buildHuffmanTable = function (lengths) { |
| 12 |
/** @type {number} length list size. */ |
| 13 |
const listSize = lengths.length; |
| 14 |
/** @type {number} max code length for table size. */ |
| 15 |
let maxCodeLength = 0; |
| 16 |
/** @type {number} min code length for table size. */ |
| 17 |
let minCodeLength = Number.POSITIVE_INFINITY; |
| 18 |
/** @type {number} bit length. */ |
| 19 |
let bitLength; |
| 20 |
/** @type {number} huffman code. */ |
| 21 |
let code; |
| 22 |
/** |
| 23 |
* @type {number} skip length for table filling. |
| 24 |
*/ |
| 25 |
let skip; |
| 26 |
/** @type {number} reversed code. */ |
| 27 |
let reversed; |
| 28 |
/** @type {number} reverse temp. */ |
| 29 |
let rtemp; |
| 30 |
/** @type {number} loop counter. */ |
| 31 |
let index; |
| 32 |
/** @type {number} loop limit. */ |
| 33 |
let il; |
| 34 |
/** @type {number} loop counter. */ |
| 35 |
let index_; |
| 36 |
/** @type {number} table value. */ |
| 37 |
let value; |
| 38 |
|
| 39 |
// Math.max は遅いので最長の値は for-loop で取得する |
| 40 |
for (index = 0, il = listSize; index < il; ++index) { |
| 41 |
if (lengths[index] > maxCodeLength) { |
| 42 |
maxCodeLength = lengths[index]; |
| 43 |
} |
| 44 |
if (lengths[index] < minCodeLength) { |
| 45 |
minCodeLength = lengths[index]; |
| 46 |
} |
| 47 |
} |
| 48 |
|
| 49 |
/** @type {number} table size. */ |
| 50 |
const size = 1 << maxCodeLength; |
| 51 |
/** @type {Uint8Array|Uint16Array|Uint32Array} huffman code table. */ |
| 52 |
const table = new Uint32Array(size); |
| 53 |
|
| 54 |
// ビット長の短い順からハフマン符号を割り当てる |
| 55 |
for (bitLength = 1, code = 0, skip = 2; bitLength <= maxCodeLength; ) { |
| 56 |
for (index = 0; index < listSize; ++index) { |
| 57 |
if (lengths[index] === bitLength) { |
| 58 |
// ビットオーダーが逆になるためビット長分並びを反転する |
| 59 |
for (reversed = 0, rtemp = code, index_ = 0; index_ < bitLength; ++index_) { |
| 60 |
reversed = (reversed << 1) | (rtemp & 1); |
| 61 |
rtemp >>= 1; |
| 62 |
} |
| 63 |
|
| 64 |
// 最大ビット長をもとにテーブルを作るため、 |
| 65 |
// 最大ビット長以外では 0 / 1 どちらでも良い箇所ができる |
| 66 |
// そのどちらでも良い場所は同じ値で埋めることで |
| 67 |
// 本来のビット長以上のビット数取得しても問題が起こらないようにする |
| 68 |
value = (bitLength << 16) | index; |
| 69 |
for (index_ = reversed; index_ < size; index_ += skip) { |
| 70 |
table[index_] = value; |
| 71 |
} |
| 72 |
|
| 73 |
++code; |
| 74 |
} |
| 75 |
} |
| 76 |
|
| 77 |
// 次のビット長へ |
| 78 |
++bitLength; |
| 79 |
code <<= 1; |
| 80 |
skip <<= 1; |
| 81 |
} |
| 82 |
|
| 83 |
return [table, maxCodeLength, minCodeLength]; |
| 84 |
}; |
| 85 |
|
| 86 |
// end of scope |
| 87 |
}); |