Lines Matching refs:histogram
68 Moreover, for long inputs we build a histogram from a sample of the input
79 uint32_t histogram[256] = { 0 };
84 ++histogram[input[i]];
89 balancing effect of the LZ77 phase on the histogram. */
90 const uint32_t adjust = 2 * BROTLI_MIN(uint32_t, histogram[i], 11u);
91 histogram[i] += adjust;
97 ++histogram[input[i]];
104 effect of the LZ77 phase on the histogram (more frequent symbols are
106 const uint32_t adjust = 1 + 2 * BROTLI_MIN(uint32_t, histogram[i], 11u);
107 histogram[i] += adjust;
111 BrotliBuildAndStoreHuffmanTreeFast(m, histogram, histogram_total,
118 if (histogram[i]) literal_ratio += histogram[i] * depths[i];
126 "bits" based on "histogram" and stores it into the bit stream. */
127 static void BuildAndStoreCommandPrefixCode(const uint32_t histogram[128],
135 BrotliCreateHuffmanTree(histogram, 64, 15, tree, depth);
136 BrotliCreateHuffmanTree(&histogram[64], 64, 14, tree, &depth[64]);