@rocicorp/zero 0.25.0 → 0.26.0-canary.0

package/out/shared/src/tdigest.js

@@ -1,304 +1,280 @@
-// Apache License 2.0
-// https://github.com/influxdata/tdigest
 import { binarySearch } from "./binary-search.js";
 import { Centroid, sortCentroidList } from "./centroid.js";
-// TDigest is a data structure for accurate on-line accumulation of
-// rank-based statistics such as quantiles and trimmed means.
-export class TDigest {
-    compression;
-    #maxProcessed;
-    #maxUnprocessed;
-    #processed;
-    #unprocessed;
-    #cumulative;
-    #processedWeight;
-    #unprocessedWeight;
-    #min;
-    #max;
-    constructor(compression = 1000) {
-        this.compression = compression;
-        this.#maxProcessed = processedSize(0, this.compression);
-        this.#maxUnprocessed = unprocessedSize(0, this.compression);
-        this.reset();
+class TDigest {
+  compression;
+  #maxProcessed;
+  #maxUnprocessed;
+  #processed;
+  #unprocessed;
+  #cumulative;
+  #processedWeight;
+  #unprocessedWeight;
+  #min;
+  #max;
+  constructor(compression = 1e3) {
+    this.compression = compression;
+    this.#maxProcessed = processedSize(0, this.compression);
+    this.#maxUnprocessed = unprocessedSize(0, this.compression);
+    this.reset();
+  }
+  /**
+   * fromJSON creates a TDigest from a JSON-serializable representation.
+   * The data should be an object with compression and centroids array.
+   */
+  static fromJSON(data) {
+    const digest = new TDigest(data[0]);
+    if (data.length % 2 !== 1) {
+      throw new Error("Invalid centroids array");
     }
-    /**
-     * fromJSON creates a TDigest from a JSON-serializable representation.
-     * The data should be an object with compression and centroids array.
-     */
-    static fromJSON(data) {
-        const digest = new TDigest(data[0]);
-        if (data.length % 2 !== 1) {
-            throw new Error('Invalid centroids array');
-        }
-        for (let i = 1; i < data.length; i += 2) {
-            digest.add(data[i], data[i + 1]);
-        }
-        return digest;
+    for (let i = 1; i < data.length; i += 2) {
+      digest.add(data[i], data[i + 1]);
     }
-    reset() {
-        this.#processed = [];
-        this.#unprocessed = [];
-        this.#cumulative = [];
-        this.#processedWeight = 0;
-        this.#unprocessedWeight = 0;
-        this.#min = Number.MAX_VALUE;
-        this.#max = -Number.MAX_VALUE;
+    return digest;
+  }
+  reset() {
+    this.#processed = [];
+    this.#unprocessed = [];
+    this.#cumulative = [];
+    this.#processedWeight = 0;
+    this.#unprocessedWeight = 0;
+    this.#min = Number.MAX_VALUE;
+    this.#max = -Number.MAX_VALUE;
+  }
+  add(mean, weight = 1) {
+    this.addCentroid(new Centroid(mean, weight));
+  }
+  /** AddCentroidList can quickly add multiple centroids. */
+  addCentroidList(centroidList) {
+    for (const c of centroidList) {
+      this.addCentroid(c);
     }
-    add(mean, weight = 1) {
-        this.addCentroid(new Centroid(mean, weight));
+  }
+  /**
+   * AddCentroid adds a single centroid.
+   * Weights which are not a number or are <= 0 are ignored, as are NaN means.
+   */
+  addCentroid(c) {
+    if (Number.isNaN(c.mean) || c.weight <= 0 || Number.isNaN(c.weight) || !Number.isFinite(c.weight)) {
+      return;
     }
-    /** AddCentroidList can quickly add multiple centroids. */
-    addCentroidList(centroidList) {
-        for (const c of centroidList) {
-            this.addCentroid(c);
-        }
+    this.#unprocessed.push(new Centroid(c.mean, c.weight));
+    this.#unprocessedWeight += c.weight;
+    if (this.#processed.length > this.#maxProcessed || this.#unprocessed.length > this.#maxUnprocessed) {
+      this.#process();
     }
-    /**
-     * AddCentroid adds a single centroid.
-     * Weights which are not a number or are <= 0 are ignored, as are NaN means.
-     */
-    addCentroid(c) {
-        if (Number.isNaN(c.mean) ||
-            c.weight <= 0 ||
-            Number.isNaN(c.weight) ||
-            !Number.isFinite(c.weight)) {
-            return;
-        }
-        this.#unprocessed.push(new Centroid(c.mean, c.weight));
-        this.#unprocessedWeight += c.weight;
-        if (this.#processed.length > this.#maxProcessed ||
-            this.#unprocessed.length > this.#maxUnprocessed) {
-            this.#process();
+  }
+  /**
+   *  Merges the supplied digest into this digest. Functionally equivalent to
+   * calling t.AddCentroidList(t2.Centroids(nil)), but avoids making an extra
+   * copy of the CentroidList.
+   **/
+  merge(t2) {
+    t2.#process();
+    this.addCentroidList(t2.#processed);
+  }
+  #process() {
+    if (this.#unprocessed.length > 0 || this.#processed.length > this.#maxProcessed) {
+      this.#unprocessed.push(...this.#processed);
+      sortCentroidList(this.#unprocessed);
+      this.#processed.length = 0;
+      this.#processed.push(this.#unprocessed[0]);
+      this.#processedWeight += this.#unprocessedWeight;
+      this.#unprocessedWeight = 0;
+      let soFar = this.#unprocessed[0].weight;
+      let limit = this.#processedWeight * this.#integratedQ(1);
+      for (let i = 1; i < this.#unprocessed.length; i++) {
+        const centroid = this.#unprocessed[i];
+        const projected = soFar + centroid.weight;
+        if (projected <= limit) {
+          soFar = projected;
+          this.#processed[this.#processed.length - 1].add(centroid);
+        } else {
+          const k1 = this.#integratedLocation(soFar / this.#processedWeight);
+          limit = this.#processedWeight * this.#integratedQ(k1 + 1);
+          soFar += centroid.weight;
+          this.#processed.push(centroid);
         }
+      }
+      this.#min = Math.min(this.#min, this.#processed[0].mean);
+      this.#max = Math.max(
+        this.#max,
+        this.#processed[this.#processed.length - 1].mean
+      );
+      this.#unprocessed.length = 0;
     }
-    /**
-     *  Merges the supplied digest into this digest. Functionally equivalent to
-     * calling t.AddCentroidList(t2.Centroids(nil)), but avoids making an extra
-     * copy of the CentroidList.
-     **/
-    merge(t2) {
-        t2.#process();
-        this.addCentroidList(t2.#processed);
+  }
+  /**
+   * Centroids returns a copy of processed centroids.
+   * Useful when aggregating multiple t-digests.
+   *
+   * Centroids are appended to the passed CentroidList; if you're re-using a
+   * buffer, be sure to pass cl[:0].
+   */
+  centroids(cl = []) {
+    this.#process();
+    return cl.concat(this.#processed);
+  }
+  count() {
+    this.#process();
+    return this.#processedWeight;
+  }
+  /**
+   * toJSON returns a JSON-serializable representation of the digest.
+   * This processes the digest and returns an object with compression and centroid data.
+   */
+  toJSON() {
+    this.#process();
+    const data = [this.compression];
+    for (const centroid of this.#processed) {
+      data.push(centroid.mean, centroid.weight);
     }
-    #process() {
-        if (this.#unprocessed.length > 0 ||
-            this.#processed.length > this.#maxProcessed) {
-            // Append all processed centroids to the unprocessed list and sort
-            this.#unprocessed.push(...this.#processed);
-            sortCentroidList(this.#unprocessed);
-            // Reset processed list with first centroid
-            this.#processed.length = 0;
-            this.#processed.push(this.#unprocessed[0]);
-            this.#processedWeight += this.#unprocessedWeight;
-            this.#unprocessedWeight = 0;
-            let soFar = this.#unprocessed[0].weight;
-            let limit = this.#processedWeight * this.#integratedQ(1);
-            for (let i = 1; i < this.#unprocessed.length; i++) {
-                const centroid = this.#unprocessed[i];
-                const projected = soFar + centroid.weight;
-                if (projected <= limit) {
-                    soFar = projected;
-                    this.#processed[this.#processed.length - 1].add(centroid);
-                }
-                else {
-                    const k1 = this.#integratedLocation(soFar / this.#processedWeight);
-                    limit = this.#processedWeight * this.#integratedQ(k1 + 1);
-                    soFar += centroid.weight;
-                    this.#processed.push(centroid);
-                }
-            }
-            this.#min = Math.min(this.#min, this.#processed[0].mean);
-            this.#max = Math.max(this.#max, this.#processed[this.#processed.length - 1].mean);
-            this.#unprocessed.length = 0;
-        }
+    return data;
+  }
+  #updateCumulative() {
+    if (this.#cumulative.length > 0 && this.#cumulative[this.#cumulative.length - 1] === this.#processedWeight) {
+      return;
     }
-    /**
-     * Centroids returns a copy of processed centroids.
-     * Useful when aggregating multiple t-digests.
-     *
-     * Centroids are appended to the passed CentroidList; if you're re-using a
-     * buffer, be sure to pass cl[:0].
-     */
-    centroids(cl = []) {
-        this.#process();
-        return cl.concat(this.#processed);
+    const n = this.#processed.length + 1;
+    if (this.#cumulative.length > n) {
+      this.#cumulative.length = n;
     }
-    count() {
-        this.#process();
-        // this.process always updates this.processedWeight to the total count of all
-        // centroids, so we don't need to re-count here.
-        return this.#processedWeight;
+    let prev = 0;
+    for (let i = 0; i < this.#processed.length; i++) {
+      const centroid = this.#processed[i];
+      const cur = centroid.weight;
+      this.#cumulative[i] = prev + cur / 2;
+      prev += cur;
     }
-    /**
-     * toJSON returns a JSON-serializable representation of the digest.
-     * This processes the digest and returns an object with compression and centroid data.
-     */
-    toJSON() {
-        this.#process();
-        const data = [this.compression];
-        for (const centroid of this.#processed) {
-            data.push(centroid.mean, centroid.weight);
-        }
-        return data;
+    this.#cumulative[this.#processed.length] = prev;
+  }
+  // Quantile returns the (approximate) quantile of
+  // the distribution. Accepted values for q are between 0 and 1.
+  // Returns NaN if Count is zero or bad inputs.
+  quantile(q) {
+    this.#process();
+    this.#updateCumulative();
+    if (q < 0 || q > 1 || this.#processed.length === 0) {
+      return NaN;
     }
-    #updateCumulative() {
-        // Weight can only increase, so the final cumulative value will always be
-        // either equal to, or less than, the total weight. If they are the same,
-        // then nothing has changed since the last update.
-        if (this.#cumulative.length > 0 &&
-            this.#cumulative[this.#cumulative.length - 1] === this.#processedWeight) {
-            return;
-        }
-        const n = this.#processed.length + 1;
-        if (this.#cumulative.length > n) {
-            this.#cumulative.length = n;
-        }
-        let prev = 0;
-        for (let i = 0; i < this.#processed.length; i++) {
-            const centroid = this.#processed[i];
-            const cur = centroid.weight;
-            this.#cumulative[i] = prev + cur / 2;
-            prev += cur;
-        }
-        this.#cumulative[this.#processed.length] = prev;
+    if (this.#processed.length === 1) {
+      return this.#processed[0].mean;
     }
-    // Quantile returns the (approximate) quantile of
-    // the distribution. Accepted values for q are between 0 and 1.
-    // Returns NaN if Count is zero or bad inputs.
-    quantile(q) {
-        this.#process();
-        this.#updateCumulative();
-        if (q < 0 || q > 1 || this.#processed.length === 0) {
-            return NaN;
-        }
-        if (this.#processed.length === 1) {
-            return this.#processed[0].mean;
-        }
-        const index = q * this.#processedWeight;
-        if (index <= this.#processed[0].weight / 2) {
-            return (this.#min +
-                ((2 * index) / this.#processed[0].weight) *
-                    (this.#processed[0].mean - this.#min));
-        }
-        const lower = binarySearch(this.#cumulative.length, (i) => -this.#cumulative[i] + index);
-        if (lower + 1 !== this.#cumulative.length) {
-            const z1 = index - this.#cumulative[lower - 1];
-            const z2 = this.#cumulative[lower] - index;
-            return weightedAverage(this.#processed[lower - 1].mean, z2, this.#processed[lower].mean, z1);
-        }
-        const z1 = index - this.#processedWeight - this.#processed[lower - 1].weight / 2;
-        const z2 = this.#processed[lower - 1].weight / 2 - z1;
-        return weightedAverage(this.#processed[this.#processed.length - 1].mean, z1, this.#max, z2);
+    const index = q * this.#processedWeight;
+    if (index <= this.#processed[0].weight / 2) {
+      return this.#min + 2 * index / this.#processed[0].weight * (this.#processed[0].mean - this.#min);
     }
-    /**
-     * CDF returns the cumulative distribution function for a given value x.
-     */
-    cdf(x) {
-        this.#process();
-        this.#updateCumulative();
-        switch (this.#processed.length) {
-            case 0:
-                return 0;
-            case 1: {
-                const width = this.#max - this.#min;
-                if (x <= this.#min) {
-                    return 0;
-                }
-                if (x >= this.#max) {
-                    return 1;
-                }
-                if (x - this.#min <= width) {
-                    // min and max are too close together to do any viable interpolation
-                    return 0.5;
-                }
-                return (x - this.#min) / width;
-            }
-        }
+    const lower = binarySearch(
+      this.#cumulative.length,
+      (i) => -this.#cumulative[i] + index
+    );
+    if (lower + 1 !== this.#cumulative.length) {
+      const z12 = index - this.#cumulative[lower - 1];
+      const z22 = this.#cumulative[lower] - index;
+      return weightedAverage(
+        this.#processed[lower - 1].mean,
+        z22,
+        this.#processed[lower].mean,
+        z12
+      );
+    }
+    const z1 = index - this.#processedWeight - this.#processed[lower - 1].weight / 2;
+    const z2 = this.#processed[lower - 1].weight / 2 - z1;
+    return weightedAverage(
+      this.#processed[this.#processed.length - 1].mean,
+      z1,
+      this.#max,
+      z2
+    );
+  }
+  /**
+   * CDF returns the cumulative distribution function for a given value x.
+   */
+  cdf(x) {
+    this.#process();
+    this.#updateCumulative();
+    switch (this.#processed.length) {
+      case 0:
+        return 0;
+      case 1: {
+        const width = this.#max - this.#min;
         if (x <= this.#min) {
-            return 0;
+          return 0;
         }
         if (x >= this.#max) {
-            return 1;
-        }
-        const m0 = this.#processed[0].mean;
-        // Left Tail
-        if (x <= m0) {
-            if (m0 - this.#min > 0) {
-                return ((((x - this.#min) / (m0 - this.#min)) * this.#processed[0].weight) /
-                    this.#processedWeight /
-                    2);
-            }
-            return 0;
+          return 1;
         }
-        // Right Tail
-        const mn = this.#processed[this.#processed.length - 1].mean;
-        if (x >= mn) {
-            if (this.#max - mn > 0) {
-                return (1 -
-                    (((this.#max - x) / (this.#max - mn)) *
-                        this.#processed[this.#processed.length - 1].weight) /
-                        this.#processedWeight /
-                        2);
-            }
-            return 1;
+        if (x - this.#min <= width) {
+          return 0.5;
         }
-        const upper = binarySearch(this.#processed.length, 
-        // Treat equals as greater than, so we can use the upper index
-        // This is equivalent to:
-        //   i => this.#processed[i].mean > x ? -1 : 1,
-        i => x - this.#processed[i].mean || 1);
-        const z1 = x - this.#processed[upper - 1].mean;
-        const z2 = this.#processed[upper].mean - x;
-        return (weightedAverage(this.#cumulative[upper - 1], z2, this.#cumulative[upper], z1) / this.#processedWeight);
+        return (x - this.#min) / width;
+      }
     }
-    #integratedQ(k) {
-        return ((Math.sin((Math.min(k, this.compression) * Math.PI) / this.compression -
-            Math.PI / 2) +
-            1) /
-            2);
+    if (x <= this.#min) {
+      return 0;
     }
-    #integratedLocation(q) {
-        return (this.compression * (Math.asin(2 * q - 1) + Math.PI / 2)) / Math.PI;
+    if (x >= this.#max) {
+      return 1;
     }
-}
-// Calculate number of bytes needed for a tdigest of size c,
-// where c is the compression value
-export function byteSizeForCompression(comp) {
-    const c = comp | 0;
-    // // A centroid is 2 float64s, so we need 16 bytes for each centroid
-    // float_size := 8
-    // centroid_size := 2 * float_size
-    // // Unprocessed and processed can grow up to length c
-    // unprocessed_size := centroid_size * c
-    // processed_size := unprocessed_size
-    // // the cumulative field can also be of length c, but each item is a single float64
-    // cumulative_size := float_size * c // <- this could also be unprocessed_size / 2
-    // return unprocessed_size + processed_size + cumulative_size
-    // // or, more succinctly:
-    // return float_size * c * 5
-    // or even more succinctly
-    return c * 40;
+    const m0 = this.#processed[0].mean;
+    if (x <= m0) {
+      if (m0 - this.#min > 0) {
+        return (x - this.#min) / (m0 - this.#min) * this.#processed[0].weight / this.#processedWeight / 2;
+      }
+      return 0;
+    }
+    const mn = this.#processed[this.#processed.length - 1].mean;
+    if (x >= mn) {
+      if (this.#max - mn > 0) {
+        return 1 - (this.#max - x) / (this.#max - mn) * this.#processed[this.#processed.length - 1].weight / this.#processedWeight / 2;
+      }
+      return 1;
+    }
+    const upper = binarySearch(
+      this.#processed.length,
+      // Treat equals as greater than, so we can use the upper index
+      // This is equivalent to:
+      //   i => this.#processed[i].mean > x ? -1 : 1,
+      (i) => x - this.#processed[i].mean || 1
+    );
+    const z1 = x - this.#processed[upper - 1].mean;
+    const z2 = this.#processed[upper].mean - x;
+    return weightedAverage(
+      this.#cumulative[upper - 1],
+      z2,
+      this.#cumulative[upper],
+      z1
+    ) / this.#processedWeight;
+  }
+  #integratedQ(k) {
+    return (Math.sin(
+      Math.min(k, this.compression) * Math.PI / this.compression - Math.PI / 2
+    ) + 1) / 2;
+  }
+  #integratedLocation(q) {
+    return this.compression * (Math.asin(2 * q - 1) + Math.PI / 2) / Math.PI;
+  }
 }
 function weightedAverage(x1, w1, x2, w2) {
-    if (x1 <= x2) {
-        return weightedAverageSorted(x1, w1, x2, w2);
-    }
-    return weightedAverageSorted(x2, w2, x1, w1);
+  if (x1 <= x2) {
+    return weightedAverageSorted(x1, w1, x2, w2);
+  }
+  return weightedAverageSorted(x2, w2, x1, w1);
 }
 function weightedAverageSorted(x1, w1, x2, w2) {
-    const x = (x1 * w1 + x2 * w2) / (w1 + w2);
-    return Math.max(x1, Math.min(x, x2));
+  const x = (x1 * w1 + x2 * w2) / (w1 + w2);
+  return Math.max(x1, Math.min(x, x2));
 }
 function processedSize(size, compression) {
-    if (size === 0) {
-        return Math.ceil(compression) * 2;
-    }
-    return size;
+  {
+    return Math.ceil(compression) * 2;
+  }
 }
 function unprocessedSize(size, compression) {
-    if (size === 0) {
-        return Math.ceil(compression) * 8;
-    }
-    return size;
+  {
+    return Math.ceil(compression) * 8;
+  }
 }
-//# sourceMappingURL=tdigest.js.map
+export {
+  TDigest
+};
+//# sourceMappingURL=tdigest.js.map

package/out/shared/src/tdigest.js.map

@@ -1 +1 @@
-{"version":3,"file":"tdigest.js","sourceRoot":"","sources":["../../../../shared/src/tdigest.ts"],"names":[],"mappings":"AAAA,qBAAqB;AACrB,wCAAwC;AAExC,OAAO,EAAC,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAC,QAAQ,EAAE,gBAAgB,EAAoB,MAAM,eAAe,CAAC;AAS5E,mEAAmE;AACnE,6DAA6D;AAC7D,MAAM,OAAO,OAAO;IACT,WAAW,CAAS;IAE7B,aAAa,CAAS;IACtB,eAAe,CAAS;IACxB,UAAU,CAAgB;IAC1B,YAAY,CAAgB;IAC5B,WAAW,CAAY;IACvB,gBAAgB,CAAU;IAC1B,kBAAkB,CAAU;IAC5B,IAAI,CAAU;IACd,IAAI,CAAU;IAEd,YAAY,cAAsB,IAAI;QACpC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACxD,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QAC5D,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,QAAQ,CAAC,IAA2B;QACzC,MAAM,MAAM,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;QAC7C,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QACrB,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,kBAAkB,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC;IAChC,CAAC;IAED,GAAG,CAAC,IAAY,EAAE,SAAiB,CAAC;QAClC,IAAI,CAAC,WAAW,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,0DAA0D;IAC1D,eAAe,CAAC,YAA0B;QACxC,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,CAAW;QACrB,IACE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;YACpB,CAAC,CAAC,MAAM,IAAI,CAAC;YACb,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;YACtB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,EAC1B,CAAC;YACD,OAAO;QACT,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACvD,IAAI,CAAC,kBAAkB,IAAI,CAAC,CAAC,MAAM,CAAC;QAEpC,IACE,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa;YAC3C,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,EAC/C,CAAC;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,CAAC;IACH,CAAC;IAED;;;;QAII;IACJ,KAAK,CAAC,EAAW;QACf,EAAE,CAAC,QAAQ,EAAE,CAAC;QACd,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;IACtC,CAAC;IAED,QAAQ;QACN,IACE,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;YAC5B,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,EAC3C,CAAC;YACD,kEAAkE;YAClE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3C,gBAAgB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAEpC,2CAA2C;YAC3C,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;YAC3B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YAE3C,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,kBAAkB,CAAC;YACjD,IAAI,CAAC,kBAAkB,GAAG,CAAC,CAAC;YAC5B,IAAI,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACxC,IAAI,KAAK,GAAG,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,SAAS,GAAG,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC;gBAC1C,IAAI,SAAS,IAAI,KAAK,EAAE,CAAC;oBACvB,KAAK,GAAG,SAAS,CAAC;oBAClB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC5D,CAAC;qBAAM,CAAC;oBACN,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC;oBACnE,KAAK,GAAG,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;oBAC1D,KAAK,IAAI,QAAQ,CAAC,MAAM,CAAC;oBACzB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;YACD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACzD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAClB,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CACjD,CAAC;YACF,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,SAAS,CAAC,KAAmB,EAAE;QAC7B,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,OAAO,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACpC,CAAC;IAED,KAAK;QACH,IAAI,CAAC,QAAQ,EAAE,CAAC;QAEhB,6EAA6E;QAC7E,gDAAgD;QAChD,OAAO,IAAI,CAAC,gBAAgB,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACH,MAAM;QACJ,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,MAAM,IAAI,GAAgB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC7C,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,iBAAiB;QACf,yEAAyE;QACzE,yEAAyE;QACzE,kDAAkD;QAClD,IACE,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;YAC3B,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,gBAAgB,EACvE,CAAC;YACD,OAAO;QACT,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9B,CAAC;QAED,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC5B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;YACrC,IAAI,IAAI,GAAG,CAAC;QACd,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAClD,CAAC;IAED,iDAAiD;IACjD,+DAA+D;IAC/D,8CAA8C;IAC9C,QAAQ,CAAC,CAAS;QAChB,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACjC,CAAC;QACD,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC;QACxC,IAAI,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,OAAO,CACL,IAAI,CAAC,IAAI;gBACT,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;oBACvC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CACxC,CAAC;QACJ,CAAC;QAED,MAAM,KAAK,GAAG,YAAY,CACxB,IAAI,CAAC,WAAW,CAAC,MAAM,EACvB,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAC5C,CAAC;QAEF,IAAI,KAAK,GAAG,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;YAC1C,MAAM,EAAE,GAAG,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC/C,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;YAC3C,OAAO,eAAe,CACpB,IAAI,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,EAC/B,EAAE,EACF,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,EAC3B,EAAE,CACH,CAAC;QACJ,CAAC;QAED,MAAM,EAAE,GACN,KAAK,GAAG,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;QACxE,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC;QACtD,OAAO,eAAe,CACpB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,EAChD,EAAE,EACF,IAAI,CAAC,IAAI,EACT,EAAE,CACH,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,CAAS;QACX,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,QAAQ,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;YAC/B,KAAK,CAAC;gBACJ,OAAO,CAAC,CAAC;YACX,KAAK,CAAC,CAAC,CAAC,CAAC;gBACP,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACpC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACnB,OAAO,CAAC,CAAC;gBACX,CAAC;gBACD,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACnB,OAAO,CAAC,CAAC;gBACX,CAAC;gBACD,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,KAAK,EAAE,CAAC;oBAC3B,oEAAoE;oBACpE,OAAO,GAAG,CAAC;gBACb,CAAC;gBACD,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;YACjC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACnB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACnB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACnC,YAAY;QACZ,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACZ,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBACvB,OAAO,CACL,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;oBAClE,IAAI,CAAC,gBAAgB;oBACrB,CAAC,CACF,CAAC;YACJ,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC;QACD,aAAa;QACb,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QAC5D,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,IAAI,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACvB,OAAO,CACL,CAAC;oBACD,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;wBACnC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;wBACnD,IAAI,CAAC,gBAAgB;wBACrB,CAAC,CACJ,CAAC;YACJ,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC;QAED,MAAM,KAAK,GAAG,YAAY,CACxB,IAAI,CAAC,UAAU,CAAC,MAAM;QACtB,8DAA8D;QAC9D,yBAAyB;QACzB,+CAA+C;QAC/C,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CACtC,CAAC;QAEF,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/C,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAC3C,OAAO,CACL,eAAe,CACb,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,EAC3B,EAAE,EACF,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,EACvB,EAAE,CACH,GAAG,IAAI,CAAC,gBAAgB,CAC1B,CAAC;IACJ,CAAC;IAED,YAAY,CAAC,CAAS;QACpB,OAAO,CACL,CAAC,IAAI,CAAC,GAAG,CACP,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW;YAC1D,IAAI,CAAC,EAAE,GAAG,CAAC,CACd;YACC,CAAC,CAAC;YACJ,CAAC,CACF,CAAC;IACJ,CAAC;IAED,mBAAmB,CAAC,CAAS;QAC3B,OAAO,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IAC7E,CAAC;CACF;AAED,4DAA4D;AAC5D,mCAAmC;AACnC,MAAM,UAAU,sBAAsB,CAAC,IAAY;IACjD,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACnB,qEAAqE;IACrE,kBAAkB;IAClB,kCAAkC;IAElC,uDAAuD;IACvD,wCAAwC;IACxC,qCAAqC;IAErC,qFAAqF;IACrF,kFAAkF;IAElF,6DAA6D;IAE7D,0BAA0B;IAC1B,4BAA4B;IAE5B,0BAA0B;IAC1B,OAAO,CAAC,GAAG,EAAE,CAAC;AAChB,CAAC;AAED,SAAS,eAAe,CACtB,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU;IAEV,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;QACb,OAAO,qBAAqB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,qBAAqB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;AAC/C,CAAC;AAED,SAAS,qBAAqB,CAC5B,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU;IAEV,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAC1C,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,aAAa,CAAC,IAAY,EAAE,WAAmB;IACtD,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACf,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,eAAe,CAAC,IAAY,EAAE,WAAmB;IACxD,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACf,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}
+{"version":3,"file":"tdigest.js","sources":["../../../../shared/src/tdigest.ts"],"sourcesContent":["// Apache License 2.0\n// https://github.com/influxdata/tdigest\n\nimport {binarySearch} from './binary-search.ts';\nimport {Centroid, sortCentroidList, type CentroidList} from './centroid.ts';\nimport type {TDigestJSON} from './tdigest-schema.ts';\n\nexport interface ReadonlyTDigest {\n  readonly count: () => number;\n  readonly quantile: (q: number) => number;\n  readonly cdf: (x: number) => number;\n}\n\n// TDigest is a data structure for accurate on-line accumulation of\n// rank-based statistics such as quantiles and trimmed means.\nexport class TDigest {\n  readonly compression: number;\n\n  #maxProcessed: number;\n  #maxUnprocessed: number;\n  #processed!: CentroidList;\n  #unprocessed!: CentroidList;\n  #cumulative!: number[];\n  #processedWeight!: number;\n  #unprocessedWeight!: number;\n  #min!: number;\n  #max!: number;\n\n  constructor(compression: number = 1000) {\n    this.compression = compression;\n    this.#maxProcessed = processedSize(0, this.compression);\n    this.#maxUnprocessed = unprocessedSize(0, this.compression);\n    this.reset();\n  }\n\n  /**\n   * fromJSON creates a TDigest from a JSON-serializable representation.\n   * The data should be an object with compression and centroids array.\n   */\n  static fromJSON(data: Readonly<TDigestJSON>): TDigest {\n    const digest = new TDigest(data[0]);\n    if (data.length % 2 !== 1) {\n      throw new Error('Invalid centroids array');\n    }\n    for (let i = 1; i < data.length; i += 2) {\n      digest.add(data[i], data[i + 1]);\n    }\n    return digest;\n  }\n\n  reset(): void {\n    this.#processed = [];\n    this.#unprocessed = [];\n    this.#cumulative = [];\n    this.#processedWeight = 0;\n    this.#unprocessedWeight = 0;\n    this.#min = Number.MAX_VALUE;\n    this.#max = -Number.MAX_VALUE;\n  }\n\n  add(mean: number, weight: number = 1) {\n    this.addCentroid(new Centroid(mean, weight));\n  }\n\n  /** AddCentroidList can quickly add multiple centroids. */\n  addCentroidList(centroidList: CentroidList) {\n    for (const c of centroidList) {\n      this.addCentroid(c);\n    }\n  }\n\n  /**\n   * AddCentroid adds a single centroid.\n   * Weights which are not a number or are <= 0 are ignored, as are NaN means.\n   */\n  addCentroid(c: Centroid): void {\n    if (\n      Number.isNaN(c.mean) ||\n      c.weight <= 0 ||\n      Number.isNaN(c.weight) ||\n      !Number.isFinite(c.weight)\n    ) {\n      return;\n    }\n\n    this.#unprocessed.push(new Centroid(c.mean, c.weight));\n    this.#unprocessedWeight += c.weight;\n\n    if (\n      this.#processed.length > this.#maxProcessed ||\n      this.#unprocessed.length > this.#maxUnprocessed\n    ) {\n      this.#process();\n    }\n  }\n\n  /**\n   *  Merges the supplied digest into this digest. Functionally equivalent to\n   * calling t.AddCentroidList(t2.Centroids(nil)), but avoids making an extra\n   * copy of the CentroidList.\n   **/\n  merge(t2: TDigest) {\n    t2.#process();\n    this.addCentroidList(t2.#processed);\n  }\n\n  #process() {\n    if (\n      this.#unprocessed.length > 0 ||\n      this.#processed.length > this.#maxProcessed\n    ) {\n      // Append all processed centroids to the unprocessed list and sort\n      this.#unprocessed.push(...this.#processed);\n      sortCentroidList(this.#unprocessed);\n\n      // Reset processed list with first centroid\n      this.#processed.length = 0;\n      this.#processed.push(this.#unprocessed[0]);\n\n      this.#processedWeight += this.#unprocessedWeight;\n      this.#unprocessedWeight = 0;\n      let soFar = this.#unprocessed[0].weight;\n      let limit = this.#processedWeight * this.#integratedQ(1);\n      for (let i = 1; i < this.#unprocessed.length; i++) {\n        const centroid = this.#unprocessed[i];\n        const projected = soFar + centroid.weight;\n        if (projected <= limit) {\n          soFar = projected;\n          this.#processed[this.#processed.length - 1].add(centroid);\n        } else {\n          const k1 = this.#integratedLocation(soFar / this.#processedWeight);\n          limit = this.#processedWeight * this.#integratedQ(k1 + 1);\n          soFar += centroid.weight;\n          this.#processed.push(centroid);\n        }\n      }\n      this.#min = Math.min(this.#min, this.#processed[0].mean);\n      this.#max = Math.max(\n        this.#max,\n        this.#processed[this.#processed.length - 1].mean,\n      );\n      this.#unprocessed.length = 0;\n    }\n  }\n\n  /**\n   * Centroids returns a copy of processed centroids.\n   * Useful when aggregating multiple t-digests.\n   *\n   * Centroids are appended to the passed CentroidList; if you're re-using a\n   * buffer, be sure to pass cl[:0].\n   */\n  centroids(cl: CentroidList = []): CentroidList {\n    this.#process();\n    return cl.concat(this.#processed);\n  }\n\n  count(): number {\n    this.#process();\n\n    // this.process always updates this.processedWeight to the total count of all\n    // centroids, so we don't need to re-count here.\n    return this.#processedWeight;\n  }\n\n  /**\n   * toJSON returns a JSON-serializable representation of the digest.\n   * This processes the digest and returns an object with compression and centroid data.\n   */\n  toJSON(): TDigestJSON {\n    this.#process();\n    const data: TDigestJSON = [this.compression];\n    for (const centroid of this.#processed) {\n      data.push(centroid.mean, centroid.weight);\n    }\n    return data;\n  }\n\n  #updateCumulative() {\n    // Weight can only increase, so the final cumulative value will always be\n    // either equal to, or less than, the total weight. If they are the same,\n    // then nothing has changed since the last update.\n    if (\n      this.#cumulative.length > 0 &&\n      this.#cumulative[this.#cumulative.length - 1] === this.#processedWeight\n    ) {\n      return;\n    }\n    const n = this.#processed.length + 1;\n    if (this.#cumulative.length > n) {\n      this.#cumulative.length = n;\n    }\n\n    let prev = 0;\n    for (let i = 0; i < this.#processed.length; i++) {\n      const centroid = this.#processed[i];\n      const cur = centroid.weight;\n      this.#cumulative[i] = prev + cur / 2;\n      prev += cur;\n    }\n    this.#cumulative[this.#processed.length] = prev;\n  }\n\n  // Quantile returns the (approximate) quantile of\n  // the distribution. Accepted values for q are between 0 and 1.\n  // Returns NaN if Count is zero or bad inputs.\n  quantile(q: number): number {\n    this.#process();\n    this.#updateCumulative();\n    if (q < 0 || q > 1 || this.#processed.length === 0) {\n      return NaN;\n    }\n    if (this.#processed.length === 1) {\n      return this.#processed[0].mean;\n    }\n    const index = q * this.#processedWeight;\n    if (index <= this.#processed[0].weight / 2) {\n      return (\n        this.#min +\n        ((2 * index) / this.#processed[0].weight) *\n          (this.#processed[0].mean - this.#min)\n      );\n    }\n\n    const lower = binarySearch(\n      this.#cumulative.length,\n      (i: number) => -this.#cumulative[i] + index,\n    );\n\n    if (lower + 1 !== this.#cumulative.length) {\n      const z1 = index - this.#cumulative[lower - 1];\n      const z2 = this.#cumulative[lower] - index;\n      return weightedAverage(\n        this.#processed[lower - 1].mean,\n        z2,\n        this.#processed[lower].mean,\n        z1,\n      );\n    }\n\n    const z1 =\n      index - this.#processedWeight - this.#processed[lower - 1].weight / 2;\n    const z2 = this.#processed[lower - 1].weight / 2 - z1;\n    return weightedAverage(\n      this.#processed[this.#processed.length - 1].mean,\n      z1,\n      this.#max,\n      z2,\n    );\n  }\n\n  /**\n   * CDF returns the cumulative distribution function for a given value x.\n   */\n  cdf(x: number): number {\n    this.#process();\n    this.#updateCumulative();\n    switch (this.#processed.length) {\n      case 0:\n        return 0;\n      case 1: {\n        const width = this.#max - this.#min;\n        if (x <= this.#min) {\n          return 0;\n        }\n        if (x >= this.#max) {\n          return 1;\n        }\n        if (x - this.#min <= width) {\n          // min and max are too close together to do any viable interpolation\n          return 0.5;\n        }\n        return (x - this.#min) / width;\n      }\n    }\n\n    if (x <= this.#min) {\n      return 0;\n    }\n    if (x >= this.#max) {\n      return 1;\n    }\n    const m0 = this.#processed[0].mean;\n    // Left Tail\n    if (x <= m0) {\n      if (m0 - this.#min > 0) {\n        return (\n          (((x - this.#min) / (m0 - this.#min)) * this.#processed[0].weight) /\n          this.#processedWeight /\n          2\n        );\n      }\n      return 0;\n    }\n    // Right Tail\n    const mn = this.#processed[this.#processed.length - 1].mean;\n    if (x >= mn) {\n      if (this.#max - mn > 0) {\n        return (\n          1 -\n          (((this.#max - x) / (this.#max - mn)) *\n            this.#processed[this.#processed.length - 1].weight) /\n            this.#processedWeight /\n            2\n        );\n      }\n      return 1;\n    }\n\n    const upper = binarySearch(\n      this.#processed.length,\n      // Treat equals as greater than, so we can use the upper index\n      // This is equivalent to:\n      //   i => this.#processed[i].mean > x ? -1 : 1,\n      i => x - this.#processed[i].mean || 1,\n    );\n\n    const z1 = x - this.#processed[upper - 1].mean;\n    const z2 = this.#processed[upper].mean - x;\n    return (\n      weightedAverage(\n        this.#cumulative[upper - 1],\n        z2,\n        this.#cumulative[upper],\n        z1,\n      ) / this.#processedWeight\n    );\n  }\n\n  #integratedQ(k: number): number {\n    return (\n      (Math.sin(\n        (Math.min(k, this.compression) * Math.PI) / this.compression -\n          Math.PI / 2,\n      ) +\n        1) /\n      2\n    );\n  }\n\n  #integratedLocation(q: number): number {\n    return (this.compression * (Math.asin(2 * q - 1) + Math.PI / 2)) / Math.PI;\n  }\n}\n\n// Calculate number of bytes needed for a tdigest of size c,\n// where c is the compression value\nexport function byteSizeForCompression(comp: number): number {\n  const c = comp | 0;\n  // // A centroid is 2 float64s, so we need 16 bytes for each centroid\n  // float_size := 8\n  // centroid_size := 2 * float_size\n\n  // // Unprocessed and processed can grow up to length c\n  // unprocessed_size := centroid_size * c\n  // processed_size := unprocessed_size\n\n  // // the cumulative field can also be of length c, but each item is a single float64\n  // cumulative_size := float_size * c // <- this could also be unprocessed_size / 2\n\n  // return unprocessed_size + processed_size + cumulative_size\n\n  // // or, more succinctly:\n  // return float_size * c * 5\n\n  // or even more succinctly\n  return c * 40;\n}\n\nfunction weightedAverage(\n  x1: number,\n  w1: number,\n  x2: number,\n  w2: number,\n): number {\n  if (x1 <= x2) {\n    return weightedAverageSorted(x1, w1, x2, w2);\n  }\n  return weightedAverageSorted(x2, w2, x1, w1);\n}\n\nfunction weightedAverageSorted(\n  x1: number,\n  w1: number,\n  x2: number,\n  w2: number,\n): number {\n  const x = (x1 * w1 + x2 * w2) / (w1 + w2);\n  return Math.max(x1, Math.min(x, x2));\n}\n\nfunction processedSize(size: number, compression: number): number {\n  if (size === 0) {\n    return Math.ceil(compression) * 2;\n  }\n  return size;\n}\n\nfunction unprocessedSize(size: number, compression: number): number {\n  if (size === 0) {\n    return Math.ceil(compression) * 8;\n  }\n  return size;\n}\n"],"names":["z1","z2"],"mappings":";;AAeO,MAAM,QAAQ;AAAA,EACV;AAAA,EAET;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEA,YAAY,cAAsB,KAAM;AACtC,SAAK,cAAc;AACnB,SAAK,gBAAgB,cAAc,GAAG,KAAK,WAAW;AACtD,SAAK,kBAAkB,gBAAgB,GAAG,KAAK,WAAW;AAC1D,SAAK,MAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,SAAS,MAAsC;AACpD,UAAM,SAAS,IAAI,QAAQ,KAAK,CAAC,CAAC;AAClC,QAAI,KAAK,SAAS,MAAM,GAAG;AACzB,YAAM,IAAI,MAAM,yBAAyB;AAAA,IAC3C;AACA,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACvC,aAAO,IAAI,KAAK,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;AAAA,IACjC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,QAAc;AACZ,SAAK,aAAa,CAAA;AAClB,SAAK,eAAe,CAAA;AACpB,SAAK,cAAc,CAAA;AACnB,SAAK,mBAAmB;AACxB,SAAK,qBAAqB;AAC1B,SAAK,OAAO,OAAO;AACnB,SAAK,OAAO,CAAC,OAAO;AAAA,EACtB;AAAA,EAEA,IAAI,MAAc,SAAiB,GAAG;AACpC,SAAK,YAAY,IAAI,SAAS,MAAM,MAAM,CAAC;AAAA,EAC7C;AAAA;AAAA,EAGA,gBAAgB,cAA4B;AAC1C,eAAW,KAAK,cAAc;AAC5B,WAAK,YAAY,CAAC;AAAA,IACpB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,GAAmB;AAC7B,QACE,OAAO,MAAM,EAAE,IAAI,KACnB,EAAE,UAAU,KACZ,OAAO,MAAM,EAAE,MAAM,KACrB,CAAC,OAAO,SAAS,EAAE,MAAM,GACzB;AACA;AAAA,IACF;AAEA,SAAK,aAAa,KAAK,IAAI,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC;AACrD,SAAK,sBAAsB,EAAE;AAE7B,QACE,KAAK,WAAW,SAAS,KAAK,iBAC9B,KAAK,aAAa,SAAS,KAAK,iBAChC;AACA,WAAK,SAAA;AAAA,IACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAa;AACjB,OAAG,SAAA;AACH,SAAK,gBAAgB,GAAG,UAAU;AAAA,EACpC;AAAA,EAEA,WAAW;AACT,QACE,KAAK,aAAa,SAAS,KAC3B,KAAK,WAAW,SAAS,KAAK,eAC9B;AAEA,WAAK,aAAa,KAAK,GAAG,KAAK,UAAU;AACzC,uBAAiB,KAAK,YAAY;AAGlC,WAAK,WAAW,SAAS;AACzB,WAAK,WAAW,KAAK,KAAK,aAAa,CAAC,CAAC;AAEzC,WAAK,oBAAoB,KAAK;AAC9B,WAAK,qBAAqB;AAC1B,UAAI,QAAQ,KAAK,aAAa,CAAC,EAAE;AACjC,UAAI,QAAQ,KAAK,mBAAmB,KAAK,aAAa,CAAC;AACvD,eAAS,IAAI,GAAG,IAAI,KAAK,aAAa,QAAQ,KAAK;AACjD,cAAM,WAAW,KAAK,aAAa,CAAC;AACpC,cAAM,YAAY,QAAQ,SAAS;AACnC,YAAI,aAAa,OAAO;AACtB,kBAAQ;AACR,eAAK,WAAW,KAAK,WAAW,SAAS,CAAC,EAAE,IAAI,QAAQ;AAAA,QAC1D,OAAO;AACL,gBAAM,KAAK,KAAK,oBAAoB,QAAQ,KAAK,gBAAgB;AACjE,kBAAQ,KAAK,mBAAmB,KAAK,aAAa,KAAK,CAAC;AACxD,mBAAS,SAAS;AAClB,eAAK,WAAW,KAAK,QAAQ;AAAA,QAC/B;AAAA,MACF;AACA,WAAK,OAAO,KAAK,IAAI,KAAK,MAAM,KAAK,WAAW,CAAC,EAAE,IAAI;AACvD,WAAK,OAAO,KAAK;AAAA,QACf,KAAK;AAAA,QACL,KAAK,WAAW,KAAK,WAAW,SAAS,CAAC,EAAE;AAAA,MAAA;AAE9C,WAAK,aAAa,SAAS;AAAA,IAC7B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,UAAU,KAAmB,IAAkB;AAC7C,SAAK,SAAA;AACL,WAAO,GAAG,OAAO,KAAK,UAAU;AAAA,EAClC;AAAA,EAEA,QAAgB;AACd,SAAK,SAAA;AAIL,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAsB;AACpB,SAAK,SAAA;AACL,UAAM,OAAoB,CAAC,KAAK,WAAW;AAC3C,eAAW,YAAY,KAAK,YAAY;AACtC,WAAK,KAAK,SAAS,MAAM,SAAS,MAAM;AAAA,IAC1C;AACA,WAAO;AAAA,EACT;AAAA,EAEA,oBAAoB;AAIlB,QACE,KAAK,YAAY,SAAS,KAC1B,KAAK,YAAY,KAAK,YAAY,SAAS,CAAC,MAAM,KAAK,kBACvD;AACA;AAAA,IACF;AACA,UAAM,IAAI,KAAK,WAAW,SAAS;AACnC,QAAI,KAAK,YAAY,SAAS,GAAG;AAC/B,WAAK,YAAY,SAAS;AAAA,IAC5B;AAEA,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,KAAK,WAAW,QAAQ,KAAK;AAC/C,YAAM,WAAW,KAAK,WAAW,CAAC;AAClC,YAAM,MAAM,SAAS;AACrB,WAAK,YAAY,CAAC,IAAI,OAAO,MAAM;AACnC,cAAQ;AAAA,IACV;AACA,SAAK,YAAY,KAAK,WAAW,MAAM,IAAI;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,GAAmB;AAC1B,SAAK,SAAA;AACL,SAAK,kBAAA;AACL,QAAI,IAAI,KAAK,IAAI,KAAK,KAAK,WAAW,WAAW,GAAG;AAClD,aAAO;AAAA,IACT;AACA,QAAI,KAAK,WAAW,WAAW,GAAG;AAChC,aAAO,KAAK,WAAW,CAAC,EAAE;AAAA,IAC5B;AACA,UAAM,QAAQ,IAAI,KAAK;AACvB,QAAI,SAAS,KAAK,WAAW,CAAC,EAAE,SAAS,GAAG;AAC1C,aACE,KAAK,OACH,IAAI,QAAS,KAAK,WAAW,CAAC,EAAE,UAC/B,KAAK,WAAW,CAAC,EAAE,OAAO,KAAK;AAAA,IAEtC;AAEA,UAAM,QAAQ;AAAA,MACZ,KAAK,YAAY;AAAA,MACjB,CAAC,MAAc,CAAC,KAAK,YAAY,CAAC,IAAI;AAAA,IAAA;AAGxC,QAAI,QAAQ,MAAM,KAAK,YAAY,QAAQ;AACzC,YAAMA,MAAK,QAAQ,KAAK,YAAY,QAAQ,CAAC;AAC7C,YAAMC,MAAK,KAAK,YAAY,KAAK,IAAI;AACrC,aAAO;AAAA,QACL,KAAK,WAAW,QAAQ,CAAC,EAAE;AAAA,QAC3BA;AAAAA,QACA,KAAK,WAAW,KAAK,EAAE;AAAA,QACvBD;AAAAA,MAAA;AAAA,IAEJ;AAEA,UAAM,KACJ,QAAQ,KAAK,mBAAmB,KAAK,WAAW,QAAQ,CAAC,EAAE,SAAS;AACtE,UAAM,KAAK,KAAK,WAAW,QAAQ,CAAC,EAAE,SAAS,IAAI;AACnD,WAAO;AAAA,MACL,KAAK,WAAW,KAAK,WAAW,SAAS,CAAC,EAAE;AAAA,MAC5C;AAAA,MACA,KAAK;AAAA,MACL;AAAA,IAAA;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,GAAmB;AACrB,SAAK,SAAA;AACL,SAAK,kBAAA;AACL,YAAQ,KAAK,WAAW,QAAA;AAAA,MACtB,KAAK;AACH,eAAO;AAAA,MACT,KAAK,GAAG;AACN,cAAM,QAAQ,KAAK,OAAO,KAAK;AAC/B,YAAI,KAAK,KAAK,MAAM;AAClB,iBAAO;AAAA,QACT;AACA,YAAI,KAAK,KAAK,MAAM;AAClB,iBAAO;AAAA,QACT;AACA,YAAI,IAAI,KAAK,QAAQ,OAAO;AAE1B,iBAAO;AAAA,QACT;AACA,gBAAQ,IAAI,KAAK,QAAQ;AAAA,MAC3B;AAAA,IAAA;AAGF,QAAI,KAAK,KAAK,MAAM;AAClB,aAAO;AAAA,IACT;AACA,QAAI,KAAK,KAAK,MAAM;AAClB,aAAO;AAAA,IACT;AACA,UAAM,KAAK,KAAK,WAAW,CAAC,EAAE;AAE9B,QAAI,KAAK,IAAI;AACX,UAAI,KAAK,KAAK,OAAO,GAAG;AACtB,gBACK,IAAI,KAAK,SAAS,KAAK,KAAK,QAAS,KAAK,WAAW,CAAC,EAAE,SAC3D,KAAK,mBACL;AAAA,MAEJ;AACA,aAAO;AAAA,IACT;AAEA,UAAM,KAAK,KAAK,WAAW,KAAK,WAAW,SAAS,CAAC,EAAE;AACvD,QAAI,KAAK,IAAI;AACX,UAAI,KAAK,OAAO,KAAK,GAAG;AACtB,eACE,KACG,KAAK,OAAO,MAAM,KAAK,OAAO,MAC/B,KAAK,WAAW,KAAK,WAAW,SAAS,CAAC,EAAE,SAC5C,KAAK,mBACL;AAAA,MAEN;AACA,aAAO;AAAA,IACT;AAEA,UAAM,QAAQ;AAAA,MACZ,KAAK,WAAW;AAAA;AAAA;AAAA;AAAA,MAIhB,OAAK,IAAI,KAAK,WAAW,CAAC,EAAE,QAAQ;AAAA,IAAA;AAGtC,UAAM,KAAK,IAAI,KAAK,WAAW,QAAQ,CAAC,EAAE;AAC1C,UAAM,KAAK,KAAK,WAAW,KAAK,EAAE,OAAO;AACzC,WACE;AAAA,MACE,KAAK,YAAY,QAAQ,CAAC;AAAA,MAC1B;AAAA,MACA,KAAK,YAAY,KAAK;AAAA,MACtB;AAAA,IAAA,IACE,KAAK;AAAA,EAEb;AAAA,EAEA,aAAa,GAAmB;AAC9B,YACG,KAAK;AAAA,MACH,KAAK,IAAI,GAAG,KAAK,WAAW,IAAI,KAAK,KAAM,KAAK,cAC/C,KAAK,KAAK;AAAA,IAAA,IAEZ,KACF;AAAA,EAEJ;AAAA,EAEA,oBAAoB,GAAmB;AACrC,WAAQ,KAAK,eAAe,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,KAAM,KAAK;AAAA,EAC1E;AACF;AA0BA,SAAS,gBACP,IACA,IACA,IACA,IACQ;AACR,MAAI,MAAM,IAAI;AACZ,WAAO,sBAAsB,IAAI,IAAI,IAAI,EAAE;AAAA,EAC7C;AACA,SAAO,sBAAsB,IAAI,IAAI,IAAI,EAAE;AAC7C;AAEA,SAAS,sBACP,IACA,IACA,IACA,IACQ;AACR,QAAM,KAAK,KAAK,KAAK,KAAK,OAAO,KAAK;AACtC,SAAO,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;AACrC;AAEA,SAAS,cAAc,MAAc,aAA6B;AAChD;AACd,WAAO,KAAK,KAAK,WAAW,IAAI;AAAA,EAClC;AAEF;AAEA,SAAS,gBAAgB,MAAc,aAA6B;AAClD;AACd,WAAO,KAAK,KAAK,WAAW,IAAI;AAAA,EAClC;AAEF;"}