46   int b = 0;  in Add()  local
47   while (b < kNumBuckets - 1 && kBucketLimit[b] <= value) {  in Add()
48     b++;  in Add()
50   buckets_[b] += 1.0;  in Add()
64   for (int b = 0; b < kNumBuckets; b++) {  in Merge()  local
65     buckets_[b] += other.buckets_[b];  in Merge()
76   for (int b = 0; b < kNumBuckets; b++) {  in Percentile()  local
77     sum += buckets_[b];  in Percentile()
80       double left_point = (b == 0) ? 0 : kBucketLimit[b-1];  in Percentile()
81       double right_point = kBucketLimit[b];  in Percentile()
82       double left_sum = sum - buckets_[b];  in Percentile()
119   for (int b = 0; b < kNumBuckets; b++) {  in ToString()  local
120     if (buckets_[b] <= 0.0) continue;  in ToString()
121     sum += buckets_[b];  in ToString()
124              ((b == 0) ? 0.0 : kBucketLimit[b-1]),      // left  in ToString()
125              kBucketLimit[b],                           // right  in ToString()
126              buckets_[b],                               // count  in ToString()
127              mult * buckets_[b],                        // percentage  in ToString()
132     int marks = static_cast<int>(20*(buckets_[b] / num_) + 0.5);  in ToString()