Searched refs:nonzeros (Results 1 – 14 of 14) sorted by relevance
148 int nonzeros; in vp8_decode_mb_tokens() local167 nonzeros = GetCoeffs(bc, coef_probs, (*a + *l), 0, qcoeff_ptr + 24 * 16); in vp8_decode_mb_tokens()168 *a = *l = (nonzeros > 0); in vp8_decode_mb_tokens()170 eobs[24] = nonzeros; in vp8_decode_mb_tokens()171 eobtotal += nonzeros - 16; in vp8_decode_mb_tokens()184 nonzeros = GetCoeffs(bc, coef_probs, (*a + *l), skip_dc, qcoeff_ptr); in vp8_decode_mb_tokens()185 *a = *l = (nonzeros > 0); in vp8_decode_mb_tokens()187 nonzeros += skip_dc; in vp8_decode_mb_tokens()188 eobs[i] = nonzeros; in vp8_decode_mb_tokens()189 eobtotal += nonzeros; in vp8_decode_mb_tokens()[all …]
269 size_t nonzeros = 0; in BrotliOptimizeHuffmanCountsForRle() local273 ++nonzeros; in BrotliOptimizeHuffmanCountsForRle()279 if (nonzeros < 5) { in BrotliOptimizeHuffmanCountsForRle()284 size_t zeros = length - nonzeros; in BrotliOptimizeHuffmanCountsForRle()293 if (nonzeros < 28) { in BrotliOptimizeHuffmanCountsForRle()
10 <!ELEMENT ENTRIES (#PCDATA)> <!-- The number of nonzeros elements -->
233 if (entropy->nonzeros < 5) { in BitsEntropyRefine()234 if (entropy->nonzeros <= 1) { in BitsEntropyRefine()240 if (entropy->nonzeros == 2) { in BitsEntropyRefine()247 if (entropy->nonzeros == 3) { in BitsEntropyRefine()306 *trivial_sym = (bit_entropy.nonzeros == 1) ? bit_entropy.nonzero_code in PopulationCost()
43 int nonzeros = 0; in ConvertPopulationCountTableToBitEstimates() local48 ++nonzeros; in ConvertPopulationCountTableToBitEstimates()51 if (nonzeros <= 1) { in ConvertPopulationCountTableToBitEstimates()
408 entropy->nonzeros = 0; in VP8LBitEntropyInit()423 ++entropy->nonzeros; in VP8LBitsEntropyUnrefined()441 bit_entropy->nonzeros += streak; in GetEntropyUnrefinedHelper()
188 int nonzeros; // number of non-zero elements in the population member
228 bit_entropy->nonzeros += streak; in GetEntropyUnrefinedHelper()
26 * the nonzeros elements in LLT(A*P) will be much smaller than that in LLT(A).
193 conc_nnz = 7 // Sum of nonzeros of inputs
25 sm1.reserve(nnz); // Allocate room for nnz nonzeros elements.
131 A = ...; // modify the values of the nonzeros of A, the nonzeros pattern must st…
57 … a random element is therefore in O(nnz_j) where nnz_j is the number of nonzeros of the respective…224 …ctorXi or std::vector<int>). If only a rought estimate of the number of nonzeros per inner-vector …
55 nonzeros = np.count_nonzero(x.flatten())56 return 1.0 - nonzeros / total_elements