fix TDigest::merge using oversized vectors of centroids

Summary:
When joining multiple `TDigest` instances into one using `TDigest::merge(Range<const TDigest*>)`, more than `maxSize` elements appear in the `centroids` vector periodically. This happens because of the missing `k_limit` increment during `q_limit_times_count` initialisation. This diff fixes it.

It is hard to say if this bug causes any issues with the precision of the highest percentiles. But it causes some performance degradation: unplanned multiple merging, additional vector resizes etc. It can also lead to more serious bugs as nobody expects the centroids vector to be bigger than was specified.

Reviewed By: yfeldblum

Differential Revision: D71970273

fbshipit-source-id: 2fea55846426a9986d3d0854b387d321b6e31ed1

Author: Max Kupriianov

third-party/folly/src/folly/stats/TDigest.cpp

@@ -189,7 +189,7 @@ void TDigest::internalMerge(
     double nextSum = next.mean() * next.weight();
     weightSoFar += next.weight();
 
-    if (weightSoFar <= q_limit_times_count) {
+    if (weightSoFar <= q_limit_times_count || k_limit > maxSize_) {
       sumsToMerge += nextSum;
       weightsToMerge += next.weight();
     } else {
@@ -212,6 +212,7 @@ void TDigest::internalMerge(
   dst.max_ = newMax;
   dst.min_ = newMin;
 
+  DCHECK_LE(workingBuffer.size(), maxSize_);
   std::swap(dst.centroids_, workingBuffer);
 }
 
@@ -317,15 +318,15 @@ TDigest TDigest::merge(Range<const TDigest*> digests) {
   compressed.reserve(maxSize);
 
   double k_limit = 1;
-  double q_limit_times_count = k_to_q(k_limit, maxSize) * count;
+  double q_limit_times_count = k_to_q(k_limit++, maxSize) * count;
 
   Centroid cur = centroids.front();
   double weightSoFar = cur.weight();
   double sumsToMerge = 0;
   double weightsToMerge = 0;
   for (auto it = centroids.begin() + 1, e = centroids.end(); it != e; ++it) {
     weightSoFar += it->weight();
-    if (weightSoFar <= q_limit_times_count) {
+    if (weightSoFar <= q_limit_times_count || k_limit > maxSize) {
       sumsToMerge += it->mean() * it->weight();
       weightsToMerge += it->weight();
     } else {
@@ -339,6 +340,7 @@ TDigest TDigest::merge(Range<const TDigest*> digests) {
   }
   result.sum_ += cur.add(sumsToMerge, weightsToMerge);
   compressed.push_back(cur);
+  DCHECK_LE(compressed.size(), maxSize);
   compressed.shrink_to_fit();
 
   // Deal with floating point precision