Searched refs:value_best_candidate (Results 1 – 1 of 1) sorted by relevance
190 int32_t value_best_candidate = 16384; // 32 in Q9, (max |mean_bit_counts|). in WebRtc_ProcessBinarySpectrum() local242 if (handle->mean_bit_counts[i] < value_best_candidate) { in WebRtc_ProcessBinarySpectrum()243 value_best_candidate = handle->mean_bit_counts[i]; in WebRtc_ProcessBinarySpectrum()266 (value_worst_candidate - value_best_candidate > kProbabilityMinSpread)) { in WebRtc_ProcessBinarySpectrum()271 int32_t threshold = value_best_candidate + kProbabilityOffset; in WebRtc_ProcessBinarySpectrum()282 if (value_worst_candidate > value_best_candidate + kProbabilityOffset) { in WebRtc_ProcessBinarySpectrum()284 if (value_best_candidate < handle->minimum_probability) { in WebRtc_ProcessBinarySpectrum()287 if (value_best_candidate < handle->last_delay_probability) { in WebRtc_ProcessBinarySpectrum()290 handle->last_delay_probability = value_best_candidate; in WebRtc_ProcessBinarySpectrum()