(table: Huffman[], p: number, cd: number, d: number, t: Huffman)
| 99 | } |
| 100 | |
| 101 | private static _treeWalk(table: Huffman[], p: number, cd: number, d: number, t: Huffman): void { |
| 102 | if (t instanceof NeedBit) { |
| 103 | if (d > 0) { |
| 104 | HuffTools._treeWalk(table, p, cd + 1, d - 1, t.left); |
| 105 | HuffTools._treeWalk(table, p | (1 << cd), cd + 1, d - 1, t.right); |
| 106 | } else { |
| 107 | table[p] = HuffTools._treeCompress(t); |
| 108 | } |
| 109 | } else { |
| 110 | table[p] = HuffTools._treeCompress(t); |
| 111 | } |
| 112 | } |
| 113 | |
| 114 | private static _treeDepth(t: Huffman): number { |
| 115 | if (t instanceof Found) { |
no test coverage detected