| 169 | }; |
| 170 | |
| 171 | void Histogram::Clear() { |
| 172 | min_ = kBucketLimit[kNumBuckets - 1]; |
| 173 | max_ = 0; |
| 174 | num_ = 0; |
| 175 | sum_ = 0; |
| 176 | sum_squares_ = 0; |
| 177 | for (int i = 0; i < kNumBuckets; i++) { |
| 178 | buckets_[i] = 0; |
| 179 | } |
| 180 | } |
| 181 | |
| 182 | void Histogram::Add(double value) { |
| 183 | // Linear search is fast enough for our usage in db_bench |