@rocicorp/zero 0.26.1 → 0.26.2-canary.1

package/out/shared/src/string-compare.js

@@ -1,13 +1,10 @@
+//#region ../shared/src/string-compare.ts
 function stringCompare(a, b) {
-  if (a === b) {
-    return 0;
-  }
-  if (a < b) {
-    return -1;
-  }
-  return 1;
+	if (a === b) return 0;
+	if (a < b) return -1;
+	return 1;
 }
-export {
-  stringCompare
-};
-//# sourceMappingURL=string-compare.js.map
+//#endregion
+export { stringCompare };
+
+//# sourceMappingURL=string-compare.js.map

package/out/shared/src/string-compare.js.map

@@ -1 +1 @@
-{"version":3,"file":"string-compare.js","sources":["../../../../shared/src/string-compare.ts"],"sourcesContent":["export function stringCompare(a: string, b: string): number {\n  if (a === b) {\n    return 0;\n  }\n  if (a < b) {\n    return -1;\n  }\n  return 1;\n}\n"],"names":[],"mappings":"AAAO,SAAS,cAAc,GAAW,GAAmB;AAC1D,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AACA,MAAI,IAAI,GAAG;AACT,WAAO;AAAA,EACT;AACA,SAAO;AACT;"}
+{"version":3,"file":"string-compare.js","names":[],"sources":["../../../../shared/src/string-compare.ts"],"sourcesContent":["export function stringCompare(a: string, b: string): number {\n  if (a === b) {\n    return 0;\n  }\n  if (a < b) {\n    return -1;\n  }\n  return 1;\n}\n"],"mappings":";AAAA,SAAgB,cAAc,GAAW,GAAmB;AAC1D,KAAI,MAAM,EACR,QAAO;AAET,KAAI,IAAI,EACN,QAAO;AAET,QAAO"}

package/out/shared/src/subscribable.js

@@ -1,34 +1,35 @@
-class Subscribable {
-  _listeners = /* @__PURE__ */ new Set();
-  /**
-   * Subscribe to the subscribable.
-   *
-   * @param listener - The listener to subscribe to.
-   * @returns A function to unsubscribe from the subscribable.
-   */
-  subscribe = (listener) => {
-    this._listeners.add(listener);
-    return () => {
-      this._listeners.delete(listener);
-    };
-  };
-  /**
-   * Notify all listeners.
-   *
-   * @param update - The update to notify listeners with.
-   */
-  notify = (update) => {
-    this._listeners.forEach((listener) => listener(update));
-  };
-  hasListeners = () => this._listeners.size > 0;
-  /**
-   * Unsubscribe all listeners.
-   */
-  cleanup = () => {
-    this._listeners.clear();
-  };
-}
-export {
-  Subscribable
+//#region ../shared/src/subscribable.ts
+var Subscribable = class {
+	_listeners = /* @__PURE__ */ new Set();
+	/**
+	* Subscribe to the subscribable.
+	*
+	* @param listener - The listener to subscribe to.
+	* @returns A function to unsubscribe from the subscribable.
+	*/
+	subscribe = (listener) => {
+		this._listeners.add(listener);
+		return () => {
+			this._listeners.delete(listener);
+		};
+	};
+	/**
+	* Notify all listeners.
+	*
+	* @param update - The update to notify listeners with.
+	*/
+	notify = (update) => {
+		this._listeners.forEach((listener) => listener(update));
+	};
+	hasListeners = () => this._listeners.size > 0;
+	/**
+	* Unsubscribe all listeners.
+	*/
+	cleanup = () => {
+		this._listeners.clear();
+	};
 };
-//# sourceMappingURL=subscribable.js.map
+//#endregion
+export { Subscribable };
+
+//# sourceMappingURL=subscribable.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"subscribable.js","sources":["../../../../shared/src/subscribable.ts"],"sourcesContent":["export class Subscribable<\n  TArgs,\n  TListener extends (obj: TArgs) => unknown = (obj: TArgs) => unknown,\n> {\n  protected _listeners = new Set<TListener>();\n\n  /**\n   * Subscribe to the subscribable.\n   *\n   * @param listener - The listener to subscribe to.\n   * @returns A function to unsubscribe from the subscribable.\n   */\n  subscribe = (listener: TListener): (() => void) => {\n    this._listeners.add(listener);\n\n    return () => {\n      this._listeners.delete(listener);\n    };\n  };\n\n  /**\n   * Notify all listeners.\n   *\n   * @param update - The update to notify listeners with.\n   */\n  notify = (update: TArgs): void => {\n    this._listeners.forEach(listener => listener(update));\n  };\n\n  hasListeners = (): boolean => this._listeners.size > 0;\n\n  /**\n   * Unsubscribe all listeners.\n   */\n  cleanup = (): void => {\n    this._listeners.clear();\n  };\n}\n"],"names":[],"mappings":"AAAO,MAAM,aAGX;AAAA,EACU,iCAAiB,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ3B,YAAY,CAAC,aAAsC;AACjD,SAAK,WAAW,IAAI,QAAQ;AAE5B,WAAO,MAAM;AACX,WAAK,WAAW,OAAO,QAAQ;AAAA,IACjC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,CAAC,WAAwB;AAChC,SAAK,WAAW,QAAQ,CAAA,aAAY,SAAS,MAAM,CAAC;AAAA,EACtD;AAAA,EAEA,eAAe,MAAe,KAAK,WAAW,OAAO;AAAA;AAAA;AAAA;AAAA,EAKrD,UAAU,MAAY;AACpB,SAAK,WAAW,MAAA;AAAA,EAClB;AACF;"}
+{"version":3,"file":"subscribable.js","names":[],"sources":["../../../../shared/src/subscribable.ts"],"sourcesContent":["export class Subscribable<\n  TArgs,\n  TListener extends (obj: TArgs) => unknown = (obj: TArgs) => unknown,\n> {\n  protected _listeners = new Set<TListener>();\n\n  /**\n   * Subscribe to the subscribable.\n   *\n   * @param listener - The listener to subscribe to.\n   * @returns A function to unsubscribe from the subscribable.\n   */\n  subscribe = (listener: TListener): (() => void) => {\n    this._listeners.add(listener);\n\n    return () => {\n      this._listeners.delete(listener);\n    };\n  };\n\n  /**\n   * Notify all listeners.\n   *\n   * @param update - The update to notify listeners with.\n   */\n  notify = (update: TArgs): void => {\n    this._listeners.forEach(listener => listener(update));\n  };\n\n  hasListeners = (): boolean => this._listeners.size > 0;\n\n  /**\n   * Unsubscribe all listeners.\n   */\n  cleanup = (): void => {\n    this._listeners.clear();\n  };\n}\n"],"mappings":";AAAA,IAAa,eAAb,MAGE;CACA,6BAAuB,IAAI,KAAgB;;;;;;;CAQ3C,aAAa,aAAsC;AACjD,OAAK,WAAW,IAAI,SAAS;AAE7B,eAAa;AACX,QAAK,WAAW,OAAO,SAAS;;;;;;;;CASpC,UAAU,WAAwB;AAChC,OAAK,WAAW,SAAQ,aAAY,SAAS,OAAO,CAAC;;CAGvD,qBAA8B,KAAK,WAAW,OAAO;;;;CAKrD,gBAAsB;AACpB,OAAK,WAAW,OAAO"}

package/out/shared/src/tdigest-schema.js

@@ -1,7 +1,11 @@
-import "./valita.js";
-import { tuple, number, array } from "@badrap/valita";
-const tdigestSchema = tuple([number()]).concat(array(number()));
-export {
-  tdigestSchema
-};
-//# sourceMappingURL=tdigest-schema.js.map
+import { valita_exports } from "./valita.js";
+//#region ../shared/src/tdigest-schema.ts
+/**
+* Valita schema for TDigest JSON representation.
+* Matches the structure returned by TDigest.toJSON().
+*/
+var tdigestSchema = valita_exports.tuple([valita_exports.number()]).concat(valita_exports.array(valita_exports.number()));
+//#endregion
+export { tdigestSchema };
+
+//# sourceMappingURL=tdigest-schema.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"tdigest-schema.js","sources":["../../../../shared/src/tdigest-schema.ts"],"sourcesContent":["import * as v from './valita.ts';\n\n/**\n * Valita schema for TDigest JSON representation.\n * Matches the structure returned by TDigest.toJSON().\n */\nexport const tdigestSchema = v.tuple([v.number()]).concat(v.array(v.number()));\n\nexport type TDigestJSON = v.Infer<typeof tdigestSchema>;\n"],"names":["v.tuple","v.number","v.array"],"mappings":";;AAMO,MAAM,gBAAgBA,MAAQ,CAACC,OAAE,CAAQ,CAAC,EAAE,OAAOC,MAAQD,QAAU,CAAC;"}
+{"version":3,"file":"tdigest-schema.js","names":[],"sources":["../../../../shared/src/tdigest-schema.ts"],"sourcesContent":["import * as v from './valita.ts';\n\n/**\n * Valita schema for TDigest JSON representation.\n * Matches the structure returned by TDigest.toJSON().\n */\nexport const tdigestSchema = v.tuple([v.number()]).concat(v.array(v.number()));\n\nexport type TDigestJSON = v.Infer<typeof tdigestSchema>;\n"],"mappings":";;;;;;AAMA,IAAa,gBAAgB,eAAE,MAAM,CAAC,eAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,eAAE,MAAM,eAAE,QAAQ,CAAC,CAAC"}

package/out/shared/src/tdigest.js

@@ -1,280 +1,207 @@
 import { binarySearch } from "./binary-search.js";
 import { Centroid, sortCentroidList } from "./centroid.js";
-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");
-    }
-    for (let i = 1; i < data.length; i += 2) {
-      digest.add(data[i], data[i + 1]);
-    }
-    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);
-    }
-  }
-  /**
-   * 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;
-    }
-  }
-  /**
-   * 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);
-    }
-    return data;
-  }
-  #updateCumulative() {
-    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;
-  }
-  // 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 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;
-        }
-        if (x >= this.#max) {
-          return 1;
-        }
-        if (x - this.#min <= width) {
-          return 0.5;
-        }
-        return (x - this.#min) / width;
-      }
-    }
-    if (x <= this.#min) {
-      return 0;
-    }
-    if (x >= this.#max) {
-      return 1;
-    }
-    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;
-  }
-}
+//#region ../shared/src/tdigest.ts
+var TDigest = 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");
+		for (let i = 1; i < data.length; i += 2) digest.add(data[i], data[i + 1]);
+		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);
+	}
+	/**
+	* 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;
+		}
+	}
+	/**
+	* 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);
+		return data;
+	}
+	#updateCumulative() {
+		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 cur = this.#processed[i].weight;
+			this.#cumulative[i] = prev + cur / 2;
+			prev += cur;
+		}
+		this.#cumulative[this.#processed.length] = prev;
+	}
+	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);
+	}
+	/**
+	* 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) return .5;
+				return (x - this.#min) / width;
+			}
+		}
+		if (x <= this.#min) return 0;
+		if (x >= this.#max) return 1;
+		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, (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) {
-  {
-    return Math.ceil(compression) * 2;
-  }
+	if (size === 0) return Math.ceil(compression) * 2;
+	return size;
 }
 function unprocessedSize(size, compression) {
-  {
-    return Math.ceil(compression) * 8;
-  }
+	if (size === 0) return Math.ceil(compression) * 8;
+	return size;
 }
-export {
-  TDigest
-};
-//# sourceMappingURL=tdigest.js.map
+//#endregion
+export { TDigest };
+
+//# sourceMappingURL=tdigest.js.map