MCPcopy
hub / github.com/google/brotli / decodeHuffmanTreeGroup

Function decodeHuffmanTreeGroup

js/decode.ts:860–871  ·  view source on GitHub ↗
(alphabetSizeMax: number, alphabetSizeLimit: number, n: number, s: State, group: Int32Array)

Source from the content-addressed store, hash-verified

858 return n + n * maxTableSize;
859}
860function decodeHuffmanTreeGroup(alphabetSizeMax: number, alphabetSizeLimit: number, n: number, s: State, group: Int32Array): number {
861 let next: number = n;
862 for (let i = 0; i < n; ++i) {
863 group[i] = next;
864 const result: number = readHuffmanCode(alphabetSizeMax, alphabetSizeLimit, group, i, s);
865 if (result < 0) {
866 return result;
867 }
868 next += result;
869 }
870 return 0;
871}
872function calculateFence(s: State): number {
873 let result: number = s.ringBufferSize;
874 if (s.isEager !== 0) {

Calls 1

readHuffmanCodeFunction · 0.70

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…