HomeSort by relevance Sort by last modified time
    Searched defs:alphabet_size (Results 1 - 4 of 4) sorted by null

  /external/brotli/c/enc/
block_encoder_inc.h 17 const size_t alphabet_size = self->alphabet_size_; local
18 const size_t table_size = histograms_size * alphabet_size;
26 size_t ix = i * alphabet_size;
27 BuildAndStoreHuffmanTree(&histograms[i].data_[0], alphabet_size, tree,
brotli_bit_stream.c 811 size_t alphabet_size = num_types + repeat_code; local
816 memset(histogram, 0, alphabet_size * sizeof(histogram[0]));
822 for (i = context_bits; i < alphabet_size; ++i) {
825 BuildAndStoreHuffmanTree(histogram, alphabet_size, tree,
854 static void InitBlockEncoder(BlockEncoder* self, size_t alphabet_size,
857 self->alphabet_size_ = alphabet_size;
    [all...]
  /external/brotli/c/dec/
huffman.h 60 uint16_t alphabet_size; member in struct:__anon14402
  /external/webp/src/dec/
vp8l_dec.c 309 static int ReadHuffmanCode(int alphabet_size, VP8LDecoder* const dec,
316 memset(code_lengths, 0, alphabet_size * sizeof(*code_lengths));
342 ok = ReadHuffmanCodeLengths(dec, code_length_code_lengths, alphabet_size,
349 code_lengths, alphabet_size);
397 int alphabet_size = kAlphabetSize[j]; local
399 alphabet_size += 1 << color_cache_bits;
401 if (max_alphabet_size < alphabet_size) {
402 max_alphabet_size = alphabet_size;
426 int alphabet_size = kAlphabetSize[j]; local
429 alphabet_size += 1 << color_cache_bits
    [all...]

Completed in 73 milliseconds