Home
last modified time | relevance | path

Searched refs:Huffman (Results 1 – 25 of 55) sorted by relevance

123

/external/puffin/
DREADME.md13 * __Huffman code__ A variable length code representing the Huffman encoded of an
14 alphabet. Huffman codes can be created uniquely using Huffman code length
16 * __Huffman code array__ An array which an array index identifies a Huffman code
18 alphabet. Throughout the code, Huffman code arrays are identified by
21 alphabet and the array element in that index contains the Huffman code of
22 the alphabet. Throughout the code, The Huffman reverse code arrays are
24 * __Huffman code length__ The number of bits in a Huffman code.
25 * __Huffman code length array__ An array of Huffman code lengths with the array
26 index as the alphabet. Throughout the code, Huffman code length arrays
/external/swiftshader/third_party/SPIRV-Tools/test/
Dhuffman_codec.cpp58 TEST(Huffman, PrintTree) { in TEST() argument
86 TEST(Huffman, PrintTable) { in TEST() argument
113 TEST(Huffman, TestValidity) { in TEST() argument
133 TEST(Huffman, TestEncode) { in TEST() argument
154 TEST(Huffman, TestDecode) { in TEST() argument
185 TEST(Huffman, TestDecodeNumbers) { in TEST() argument
219 TEST(Huffman, SerializeToTextU64) { in TEST() argument
237 TEST(Huffman, SerializeToTextString) { in TEST() argument
256 TEST(Huffman, CreateFromTextString) { in TEST() argument
278 TEST(Huffman, CreateFromTextU64) { in TEST() argument
/external/deqp-deps/SPIRV-Tools/test/
Dhuffman_codec.cpp58 TEST(Huffman, PrintTree) { in TEST() argument
86 TEST(Huffman, PrintTable) { in TEST() argument
113 TEST(Huffman, TestValidity) { in TEST() argument
133 TEST(Huffman, TestEncode) { in TEST() argument
154 TEST(Huffman, TestDecode) { in TEST() argument
185 TEST(Huffman, TestDecodeNumbers) { in TEST() argument
219 TEST(Huffman, SerializeToTextU64) { in TEST() argument
237 TEST(Huffman, SerializeToTextString) { in TEST() argument
256 TEST(Huffman, CreateFromTextString) { in TEST() argument
278 TEST(Huffman, CreateFromTextU64) { in TEST() argument
/external/okhttp/repackaged/okhttp/src/main/java/com/android/okhttp/internal/framed/
DHuffman.java32 class Huffman { class
78 private static final Huffman INSTANCE = new Huffman();
80 public static Huffman get() { in get()
86 private Huffman() { in Huffman() method in Huffman
/external/grpc-grpc-java/okhttp/third_party/okhttp/main/java/io/grpc/okhttp/internal/framed/
DHuffman.java35 class Huffman { class
81 private static final Huffman INSTANCE = new Huffman();
83 public static Huffman get() { in get()
89 private Huffman() { in Huffman() method in Huffman
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/framed/
DHuffman.java31 class Huffman { class
77 private static final Huffman INSTANCE = new Huffman();
79 public static Huffman get() { in get()
85 private Huffman() { in Huffman() method in Huffman
/external/zlib/src/doc/
Drfc1951.txt43 compresses data using a combination of the LZ77 algorithm and Huffman
77 3.2.1. Synopsis of prefix and Huffman coding ............... 6
78 3.2.2. Use of Huffman coding in the "deflate" format ....... 7
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
146 representations. Familiarity with the technique of Huffman coding
194 and Huffman coding. The Huffman trees for each block are independent
199 Each block consists of two parts: a pair of Huffman code trees that
201 compressed data part. (The Huffman trees themselves are compressed
202 using Huffman encoding.) The compressed data consists of a series of
[all …]
Dalgorithm.txt13 Literals or match lengths are compressed with one Huffman tree, and
28 favor small distances and thus take advantage of the Huffman encoding.
62 The key question is how to represent a Huffman code (or any prefix code) so
95 looks like. You are correct that it's not a Huffman tree. It is simply a
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
124 that's essentially a Huffman tree. But then you spend too much time
183 compared to 16 entries for a Huffman tree (six two entry tables and one four
187 Huffman tree.
/external/okhttp/okhttp-tests/src/test/java/com/squareup/okhttp/internal/framed/
DHuffmanTest.java49 Huffman.get().encode(buf, dos); in assertRoundTrip()
50 assertEquals(baos.size(), Huffman.get().encodedLength(buf)); in assertRoundTrip()
52 byte[] decodedBytes = Huffman.get().decode(baos.toByteArray()); in assertRoundTrip()
/external/aac/libSBRdec/src/
Dpsbitdec.cpp119 Huffman h, /*!< pointer to huffman codebook table */ in decode_huff_cw()
459 Huffman CurrentTable; in ReadPsData()
543 CurrentTable = (Huffman)&aBookPsIidFineFreqDecode; in ReadPsData()
545 CurrentTable = (Huffman)&aBookPsIidFreqDecode; in ReadPsData()
548 CurrentTable = (Huffman)&aBookPsIidFineTimeDecode; in ReadPsData()
550 CurrentTable = (Huffman)&aBookPsIidTimeDecode; in ReadPsData()
565 CurrentTable = (Huffman)&aBookPsIccFreqDecode; in ReadPsData()
567 CurrentTable = (Huffman)&aBookPsIccTimeDecode; in ReadPsData()
Dhuff_dec.h113 typedef const SCHAR (*Huffman)[2]; typedef
115 int DecodeHuffmanCW(Huffman h, HANDLE_FDK_BITSTREAM hBitBuf);
Denv_extr.cpp870 Huffman hcb_noiseF; in sbrGetNoiseFloorData()
871 Huffman hcb_noise; in sbrGetNoiseFloorData()
880 hcb_noise = (Huffman)&FDK_sbrDecoder_sbr_huffBook_NoiseBalance11T; in sbrGetNoiseFloorData()
882 (Huffman)&FDK_sbrDecoder_sbr_huffBook_EnvBalance11F; /* "sbr_huffBook_NoiseBalance11F" in sbrGetNoiseFloorData()
886 hcb_noise = (Huffman)&FDK_sbrDecoder_sbr_huffBook_NoiseLevel11T; in sbrGetNoiseFloorData()
888 (Huffman)&FDK_sbrDecoder_sbr_huffBook_EnvLevel11F; /* "sbr_huffBook_NoiseLevel11F" in sbrGetNoiseFloorData()
1036 Huffman hcb_t, hcb_f; in sbrGetEnvelope()
1075 hcb_t = (Huffman)&FDK_sbrDecoder_sbr_huffBook_EnvBalance10T; in sbrGetEnvelope()
1076 hcb_f = (Huffman)&FDK_sbrDecoder_sbr_huffBook_EnvBalance10F; in sbrGetEnvelope()
1078 hcb_t = (Huffman)&FDK_sbrDecoder_sbr_huffBook_EnvBalance11T; in sbrGetEnvelope()
[all …]
Dhuff_dec.cpp123 int DecodeHuffmanCW(Huffman h, /*!< pointer to huffman codebook table */ in DecodeHuffmanCW()
/external/brotli/csharp/org/brotli/dec/
DHuffmanTreeGroup.cs31 group.codes = new int[n * Org.Brotli.Dec.Huffman.HuffmanMaxTableSize]; in Init()
46 next += Org.Brotli.Dec.Huffman.HuffmanMaxTableSize; in Decode()
DState.cs18 internal readonly int[] blockTypeTrees = new int[3 * Org.Brotli.Dec.Huffman.HuffmanMaxTableSize];
20 internal readonly int[] blockLenTrees = new int[3 * Org.Brotli.Dec.Huffman.HuffmanMaxTableSize];
DDecode.cs188 Org.Brotli.Dec.Huffman.BuildHuffmanTable(table, 0, 5, codeLengthCodeLengths, CodeLengthCodes); in ReadHuffmanCodeLengths()
346 …Org.Brotli.Dec.Huffman.BuildHuffmanTable(table, offset, HuffmanTableBits, codeLengths, alphabetSiz… in ReadHuffmanCode()
364 int[] table = new int[Org.Brotli.Dec.Huffman.HuffmanMaxTableSize]; in DecodeContextMap()
410 …int blockType = ReadSymbol(state.blockTypeTrees, treeType * Org.Brotli.Dec.Huffman.HuffmanMaxTable… in DecodeBlockTypeAndLength()
411 …eeType] = ReadBlockLength(state.blockLenTrees, treeType * Org.Brotli.Dec.Huffman.HuffmanMaxTableSi… in DecodeBlockTypeAndLength()
555 …ReadHuffmanCode(state.numBlockTypes[i] + 2, state.blockTypeTrees, i * Org.Brotli.Dec.Huffman.Huffm… in ReadMetablockHuffmanCodesAndContextMaps()
556 …ReadHuffmanCode(NumBlockLengthCodes, state.blockLenTrees, i * Org.Brotli.Dec.Huffman.HuffmanMaxTab… in ReadMetablockHuffmanCodesAndContextMaps()
557 …state.blockLength[i] = ReadBlockLength(state.blockLenTrees, i * Org.Brotli.Dec.Huffman.HuffmanMaxT… in ReadMetablockHuffmanCodesAndContextMaps()
DHuffman.cs9 internal sealed class Huffman class
/external/python/cpython2/Modules/zlib/
Dalgorithm.txt13 Literals or match lengths are compressed with one Huffman tree, and
28 favor small distances and thus take advantage of the Huffman encoding.
62 The key question is how to represent a Huffman code (or any prefix code) so
95 looks like. You are correct that it's not a Huffman tree. It is simply a
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
124 that's essentially a Huffman tree. But then you spend too much time
183 compared to 16 entries for a Huffman tree (six two entry tables and one four
187 Huffman tree.
/external/libjpeg-turbo/
DChangeLog.md125 9. Fixed a signed integer overflow in the progressive Huffman decoder, detected
257 15. Added SIMD acceleration for progressive Huffman encoding on SSE2-capable
475 path" of libjpeg-turbo's Huffman decoder to read from uninitialized memory.
498 5. Fixed an issue in the ARM 32-bit SIMD-accelerated Huffman encoder that
558 allows the Huffman codec to determine the word size at compile time. Since
573 12. Added SIMD acceleration for Huffman encoding on SSE2-capable x86 and x86-64
578 when compiling the C version of the Huffman encoder
580 benchmarking or regression testing, SIMD-accelerated Huffman encoding can be
590 14. Added SIMD acceleration for Huffman encoding on NEON-capable ARM 32-bit
598 the C Huffman encoder as well as GCC does.
[all …]
/external/libjpeg-turbo/simd/x86_64/
Djchuff-sse2.asm2 ; jchuff-sse2.asm - Huffman entropy encoding (64-bit SSE2)
17 ; This file contains an SSE2 implementation for Huffman coding of one block.
227 ; Emit the Huffman-coded symbol for the number of bits
301 ; Emit Huffman symbol for run length / number of bits
/external/libjpeg-turbo/simd/i386/
Djchuff-sse2.asm2 ; jchuff-sse2.asm - Huffman entropy encoding (SSE2)
17 ; This file contains an SSE2 implementation for Huffman coding of one block.
239 ; Emit the Huffman-coded symbol for the number of bits
310 ; Emit Huffman symbol for run length / number of bits
378 ; Emit Huffman symbol for run length / number of bits
/external/brotli/
DREADME4 using a combination of a modern variant of the LZ77 algorithm, Huffman coding
/external/brotli/java/org/brotli/dec/
DDecodeTest.java158 new Huffman(); in testUtils()
DHuffman.java12 final class Huffman { class
/external/libjpeg-turbo/release/
DReadMe.txt1 …rform libjpeg by a significant amount, by virtue of its highly-optimized Huffman coding routines. …

123