Searched refs:lower_idx (Results 1 – 3 of 3) sorted by relevance
20 for lower_idx in range(0, len(buckets)):21 count_so_far += buckets[lower_idx]27 for upper_idx in range(lower_idx + 1, len(buckets)):30 return (boundaries[lower_idx] + boundaries[upper_idx]) / 2.034 lower_bound = boundaries[lower_idx]35 upper_bound = boundaries[lower_idx + 1]37 (count_so_far - count_below) / float(buckets[lower_idx]))
100 int lower_idx; in threshold_for_count_below() local105 for (lower_idx = 0; lower_idx < num_buckets; lower_idx++) { in threshold_for_count_below()106 count_so_far += static_cast<double>(bucket_counts[lower_idx]); in threshold_for_count_below()114 for (upper_idx = lower_idx + 1; upper_idx < num_buckets; upper_idx++) { in threshold_for_count_below()119 return (bucket_boundaries[lower_idx] + bucket_boundaries[upper_idx]) / 2.0; in threshold_for_count_below()123 lower_bound = bucket_boundaries[lower_idx]; in threshold_for_count_below()124 upper_bound = bucket_boundaries[lower_idx + 1]; in threshold_for_count_below()127 static_cast<double>(bucket_counts[lower_idx]); in threshold_for_count_below()
151 size_t lower_idx; in threshold_for_count_below() local167 for (lower_idx = 0; lower_idx < h->num_buckets; lower_idx++) { in threshold_for_count_below()168 count_so_far += h->buckets[lower_idx]; in threshold_for_count_below()176 for (upper_idx = lower_idx + 1; upper_idx < h->num_buckets; upper_idx++) { in threshold_for_count_below()181 return (bucket_start(h, static_cast<double>(lower_idx)) + in threshold_for_count_below()187 lower_bound = bucket_start(h, static_cast<double>(lower_idx)); in threshold_for_count_below()188 upper_bound = bucket_start(h, static_cast<double>(lower_idx + 1)); in threshold_for_count_below()191 h->buckets[lower_idx], in threshold_for_count_below()