@rocicorp/zero 1.11.0-canary.24 → 1.11.0-canary.26

package/out/shared/src/centroid.d.ts

@@ -6,5 +6,4 @@ export declare class Centroid {
 }
 /** CentroidList is sorted by the mean of the centroid, ascending. */
 export type CentroidList = Centroid[];
-export declare function sortCentroidList(centroids: CentroidList): void;
 //# sourceMappingURL=centroid.d.ts.map

package/out/shared/src/centroid.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"centroid.d.ts","sourceRoot":"","sources":["../../../../shared/src/centroid.ts"],"names":[],"mappings":"AAIA,qBAAa,QAAQ;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IAEf,YAAY,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAGvC;IAED,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI,CAWrB;CACF;AAED,qEAAqE;AACrE,MAAM,MAAM,YAAY,GAAG,QAAQ,EAAE,CAAC;AAEtC,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,YAAY,GAAG,IAAI,CAE9D"}
+{"version":3,"file":"centroid.d.ts","sourceRoot":"","sources":["../../../../shared/src/centroid.ts"],"names":[],"mappings":"AAIA,qBAAa,QAAQ;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IAEf,YAAY,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAGvC;IAED,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI,CAWrB;CACF;AAED,qEAAqE;AACrE,MAAM,MAAM,YAAY,GAAG,QAAQ,EAAE,CAAC"}

package/out/shared/src/centroid.js

@@ -17,10 +17,7 @@ var Centroid = class {
 		}
 	}
 };
-function sortCentroidList(centroids) {
-	centroids.sort((a, b) => a.mean - b.mean);
-}
 //#endregion
-export { Centroid, sortCentroidList };
+export { Centroid };
 
 //# sourceMappingURL=centroid.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"centroid.js","names":[],"sources":["../../../../shared/src/centroid.ts"],"sourcesContent":["// Apache License 2.0\n// https://github.com/influxdata/tdigest\n\n// Centroid average position of all points in a shape\nexport class Centroid {\n  mean: number;\n  weight: number;\n\n  constructor(mean: number, weight: number) {\n    this.mean = mean;\n    this.weight = weight;\n  }\n\n  add(r: Centroid): void {\n    if (r.weight < 0) {\n      throw new Error('centroid weight cannot be less than zero');\n    }\n    if (this.weight !== 0) {\n      this.weight += r.weight;\n      this.mean += (r.weight * (r.mean - this.mean)) / this.weight;\n    } else {\n      this.weight = r.weight;\n      this.mean = r.mean;\n    }\n  }\n}\n\n/** CentroidList is sorted by the mean of the centroid, ascending. */\nexport type CentroidList = Centroid[];\n\nexport function sortCentroidList(centroids: CentroidList): void {\n  centroids.sort((a, b) => a.mean - b.mean);\n}\n"],"mappings":";AAIA,IAAa,WAAb,MAAsB;CACpB;CACA;CAEA,YAAY,MAAc,QAAgB;EACxC,KAAK,OAAO;EACZ,KAAK,SAAS;CAChB;CAEA,IAAI,GAAmB;EACrB,IAAI,EAAE,SAAS,GACb,MAAM,IAAI,MAAM,0CAA0C;EAE5D,IAAI,KAAK,WAAW,GAAG;GACrB,KAAK,UAAU,EAAE;GACjB,KAAK,QAAS,EAAE,UAAU,EAAE,OAAO,KAAK,QAAS,KAAK;EACxD,OAAO;GACL,KAAK,SAAS,EAAE;GAChB,KAAK,OAAO,EAAE;EAChB;CACF;AACF;AAKA,SAAgB,iBAAiB,WAA+B;CAC9D,UAAU,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;AAC1C"}
+{"version":3,"file":"centroid.js","names":[],"sources":["../../../../shared/src/centroid.ts"],"sourcesContent":["// Apache License 2.0\n// https://github.com/influxdata/tdigest\n\n// Centroid average position of all points in a shape\nexport class Centroid {\n  mean: number;\n  weight: number;\n\n  constructor(mean: number, weight: number) {\n    this.mean = mean;\n    this.weight = weight;\n  }\n\n  add(r: Centroid): void {\n    if (r.weight < 0) {\n      throw new Error('centroid weight cannot be less than zero');\n    }\n    if (this.weight !== 0) {\n      this.weight += r.weight;\n      this.mean += (r.weight * (r.mean - this.mean)) / this.weight;\n    } else {\n      this.weight = r.weight;\n      this.mean = r.mean;\n    }\n  }\n}\n\n/** CentroidList is sorted by the mean of the centroid, ascending. */\nexport type CentroidList = Centroid[];\n"],"mappings":";AAIA,IAAa,WAAb,MAAsB;CACpB;CACA;CAEA,YAAY,MAAc,QAAgB;EACxC,KAAK,OAAO;EACZ,KAAK,SAAS;CAChB;CAEA,IAAI,GAAmB;EACrB,IAAI,EAAE,SAAS,GACb,MAAM,IAAI,MAAM,0CAA0C;EAE5D,IAAI,KAAK,WAAW,GAAG;GACrB,KAAK,UAAU,EAAE;GACjB,KAAK,QAAS,EAAE,UAAU,EAAE,OAAO,KAAK,QAAS,KAAK;EACxD,OAAO;GACL,KAAK,SAAS,EAAE;GAChB,KAAK,OAAO,EAAE;EAChB;CACF;AACF"}

package/out/shared/src/hash.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../../../shared/src/hash.ts"],"names":[],"mappings":"AAUA,eAAO,MAAM,GAAG,MAAO,MAAM,WAG5B,CAAC;AACF,eAAO,MAAM,GAAG,MAAO,MAAM,WAAe,CAAC;AAC7C,eAAO,MAAM,IAAI,MAAO,MAAM,WAAe,CAAC;AAkJ9C,OAAO,EAAC,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAC,MAAM,eAAe,CAAC"}
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../../../shared/src/hash.ts"],"names":[],"mappings":"AAUA,eAAO,MAAM,GAAG,MAAO,MAAM,WAG5B,CAAC;AACF,eAAO,MAAM,GAAG,MAAO,MAAM,WAAe,CAAC;AAC7C,eAAO,MAAM,IAAI,MAAO,MAAM,WAAe,CAAC;AAgL9C,OAAO,EAAC,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAC,MAAM,eAAe,CAAC"}

package/out/shared/src/hash.js

@@ -12,6 +12,15 @@ var stripes = new Int32Array(MAX_WORDS * 4);
 var digests = new Uint32Array(MAX_WORDS);
 var encoder;
 /**
+* Inputs of up to this many UTF-16 code units are UTF-8 encoded into a reused
+* buffer: `TextEncoder#encode` allocates a fresh Uint8Array per call, which for
+* a row-key-sized string cost several times the hashing itself. Longer inputs
+* still allocate: there the allocation is a small share of the cost, and not
+* worth keeping a buffer that size alive.
+*/
+var MAX_REUSED_UNITS = 4096;
+var utf8;
+/**
 * xxHash32 over the UTF-8 bytes of `str` under seeds `0..words-1`, leaving the
 * digests in `digests[0..words)`.
 *
@@ -22,8 +31,16 @@ var encoder;
 * used to delegate to, and what `hash.test.ts` checks it still matches.
 */
 function digest(str, words) {
-	const b = (encoder ??= new TextEncoder()).encode(str);
-	const len = b.length;
+	encoder ??= new TextEncoder();
+	let b;
+	let len;
+	if (str.length <= MAX_REUSED_UNITS) {
+		b = utf8 ??= new Uint8Array(3 * MAX_REUSED_UNITS);
+		len = encoder.encodeInto(str, b).written;
+	} else {
+		b = encoder.encode(str);
+		len = b.length;
+	}
 	for (let w = 0; w < words; w++) accs[w] = w + PRIME32_5 & 4294967295;
 	let offset = 0;
 	if (len >= 16) {
@@ -79,15 +96,23 @@ function digest(str, words) {
 	}
 	for (let w = 0; w < words; w++) digests[w] = avalanche32(accs[w]);
 }
+var wideView = /* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(16));
 /**
-* A hash wider than 32 bits, folding `words` digests together highest seed
-* first.
+* A hash wider than 32 bits, folding the digests together highest seed first.
+*
+* Every bigint operation allocates its result, so folding word by word with a
+* `BigInt()`, a shift and an add per word allocated up to 6 bigints for h64 and
+* 12 for h128. Laying the words out big-endian and reading them back with
+* `getBigUint64` allocates 1 and 4 for the same values.
 */
 function wide(str, words) {
 	digest(str, words);
-	let result = 0n;
-	for (let w = 0; w < words; w++) result = (result << 32n) + BigInt(digests[w]);
-	return result;
+	wideView.setUint32(0, digests[0]);
+	wideView.setUint32(4, digests[1]);
+	if (words === 2) return wideView.getBigUint64(0);
+	wideView.setUint32(8, digests[2]);
+	wideView.setUint32(12, digests[3]);
+	return wideView.getBigUint64(0) << 64n | wideView.getBigUint64(8);
 }
 //#endregion
 export { h128, h32, h64 };

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

@@ -1 +1 @@
-{"version":3,"file":"hash.js","names":[],"sources":["../../../../shared/src/hash.ts"],"sourcesContent":["import {\n  avalanche32,\n  PRIME32_1,\n  PRIME32_2,\n  PRIME32_3,\n  PRIME32_4,\n  PRIME32_5,\n  round32,\n} from './xxhash32.ts';\n\nexport const h32 = (s: string) => {\n  digest(s, 1);\n  return digests[0];\n};\nexport const h64 = (s: string) => wide(s, 2);\nexport const h128 = (s: string) => wide(s, 4);\n\nconst MAX_WORDS = 4;\n\n// `digest` is synchronous and does not recurse, so these can be reused across\n// calls instead of allocated per call.\nconst accs = new Int32Array(MAX_WORDS);\nconst stripes = new Int32Array(MAX_WORDS * 4);\nconst digests = new Uint32Array(MAX_WORDS);\nlet encoder: TextEncoder | undefined;\n\n/**\n * xxHash32 over the UTF-8 bytes of `str` under seeds `0..words-1`, leaving the\n * digests in `digests[0..words)`.\n *\n * A seed only changes the initial accumulator values, so every word digests the\n * same input lanes. This walks the bytes once, advancing all `words` sets of\n * accumulators per lane, and UTF-8 encodes the string once. The result is\n * identical to `words` separate `xxHash32(str, i)` calls — which is what this\n * used to delegate to, and what `hash.test.ts` checks it still matches.\n */\nfunction digest(str: string, words: number): void {\n  const b = (encoder ??= new TextEncoder()).encode(str);\n  const len = b.length;\n\n  for (let w = 0; w < words; w++) {\n    accs[w] = (w + PRIME32_5) & 0xffffffff;\n  }\n\n  let offset = 0;\n\n  /*\n      Step 2. Process stripes\n      A stripe is a contiguous segment of 16 bytes, evenly divided into 4 lanes\n      of 4 bytes each, each lane updating its own accumulator. Inputs shorter\n      than a stripe skip straight to step 4 with a single accumulator.\n  */\n  if (len >= 16) {\n    for (let w = 0; w < words; w++) {\n      const base = w << 2;\n      stripes[base] = (w + PRIME32_1 + PRIME32_2) & 0xffffffff;\n      stripes[base + 1] = (w + PRIME32_2) & 0xffffffff;\n      stripes[base + 2] = w;\n      stripes[base + 3] = (w - PRIME32_1) & 0xffffffff;\n    }\n\n    const limit = len - 16;\n    for (; offset <= limit; offset += 16) {\n      const l0 =\n        b[offset] |\n        (b[offset + 1] << 8) |\n        (b[offset + 2] << 16) |\n        (b[offset + 3] << 24);\n      const l1 =\n        b[offset + 4] |\n        (b[offset + 5] << 8) |\n        (b[offset + 6] << 16) |\n        (b[offset + 7] << 24);\n      const l2 =\n        b[offset + 8] |\n        (b[offset + 9] << 8) |\n        (b[offset + 10] << 16) |\n        (b[offset + 11] << 24);\n      const l3 =\n        b[offset + 12] |\n        (b[offset + 13] << 8) |\n        (b[offset + 14] << 16) |\n        (b[offset + 15] << 24);\n      for (let w = 0; w < words; w++) {\n        const base = w << 2;\n        stripes[base] = round32(stripes[base], l0);\n        stripes[base + 1] = round32(stripes[base + 1], l1);\n        stripes[base + 2] = round32(stripes[base + 2], l2);\n        stripes[base + 3] = round32(stripes[base + 3], l3);\n      }\n    }\n\n    /*\n        Step 3. Accumulator convergence\n        acc = (acc1 <<< 1) + (acc2 <<< 7) + (acc3 <<< 12) + (acc4 <<< 18);\n    */\n    for (let w = 0; w < words; w++) {\n      const base = w << 2;\n      const s0 = stripes[base];\n      const s1 = stripes[base + 1];\n      const s2 = stripes[base + 2];\n      const s3 = stripes[base + 3];\n      accs[w] =\n        (((s0 << 1) | (s0 >>> 31)) +\n          ((s1 << 7) | (s1 >>> 25)) +\n          ((s2 << 12) | (s2 >>> 20)) +\n          ((s3 << 18) | (s3 >>> 14))) &\n        0xffffffff;\n    }\n  }\n\n  // Step 4. Add input length.\n  for (let w = 0; w < words; w++) {\n    accs[w] = (accs[w] + len) & 0xffffffff;\n  }\n\n  // Step 5. Consume the remaining input, 4 bytes at a time and then 1 at a time.\n  const limit4 = len - 4;\n  for (; offset <= limit4; offset += 4) {\n    const laneN0 = b[offset] + (b[offset + 1] << 8);\n    const laneN1 = b[offset + 2] + (b[offset + 3] << 8);\n    const laneP = laneN0 * PRIME32_3 + ((laneN1 * PRIME32_3) << 16);\n    for (let w = 0; w < words; w++) {\n      let acc = (accs[w] + laneP) | 0;\n      acc = (acc << 17) | (acc >>> 15);\n      accs[w] = Math.imul(acc, PRIME32_4);\n    }\n  }\n\n  for (; offset < len; ++offset) {\n    const lane = b[offset];\n    for (let w = 0; w < words; w++) {\n      let acc = (accs[w] + Math.imul(lane, PRIME32_5)) | 0;\n      acc = (acc << 11) | (acc >>> 21);\n      accs[w] = Math.imul(acc, PRIME32_1);\n    }\n  }\n\n  // Step 6. Final mix (avalanche). The Uint32Array store turns any negatives\n  // back into a positive number.\n  for (let w = 0; w < words; w++) {\n    digests[w] = avalanche32(accs[w]);\n  }\n}\n\n/**\n * A hash wider than 32 bits, folding `words` digests together highest seed\n * first.\n */\nfunction wide(str: string, words: number): bigint {\n  digest(str, words);\n  let result = 0n;\n  for (let w = 0; w < words; w++) {\n    result = (result << 32n) + BigInt(digests[w]);\n  }\n  return result;\n}\n\n// Re-exported for zero-protocol's AST hash, which cannot import xxhash32.ts\n// directly without tripping a tsc 7.0.2 bug (see the import comment in\n// zero-protocol/src/query-hash-visitor.ts).\nexport {avalanche32, PRIME32_1, PRIME32_5, round32} from './xxhash32.ts';\n"],"mappings":";;AAUA,IAAa,OAAO,MAAc;CAChC,OAAO,GAAG,CAAC;CACX,OAAO,QAAQ;AACjB;AACA,IAAa,OAAO,MAAc,KAAK,GAAG,CAAC;AAC3C,IAAa,QAAQ,MAAc,KAAK,GAAG,CAAC;AAE5C,IAAM,YAAY;AAIlB,IAAM,OAAO,IAAI,WAAW,SAAS;AACrC,IAAM,UAAU,IAAI,WAAW,YAAY,CAAC;AAC5C,IAAM,UAAU,IAAI,YAAY,SAAS;AACzC,IAAI;;;;;;;;;;;AAYJ,SAAS,OAAO,KAAa,OAAqB;CAChD,MAAM,KAAK,YAAY,IAAI,YAAY,GAAG,OAAO,GAAG;CACpD,MAAM,MAAM,EAAE;CAEd,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,KAAK,KAAM,IAAI,YAAa;CAG9B,IAAI,SAAS;CAQb,IAAI,OAAO,IAAI;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,OAAO,KAAK;GAClB,QAAQ,QAAS,IAAI,YAAY,YAAa;GAC9C,QAAQ,OAAO,KAAM,IAAI,YAAa;GACtC,QAAQ,OAAO,KAAK;GACpB,QAAQ,OAAO,KAAM,IAAI,YAAa;EACxC;EAEA,MAAM,QAAQ,MAAM;EACpB,OAAO,UAAU,OAAO,UAAU,IAAI;GACpC,MAAM,KACJ,EAAE,UACD,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,MAAM;GACpB,MAAM,KACJ,EAAE,SAAS,KACV,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,MAAM;GACpB,MAAM,KACJ,EAAE,SAAS,KACV,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,OAAO;GACrB,MAAM,KACJ,EAAE,SAAS,MACV,EAAE,SAAS,OAAO,IAClB,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,OAAO;GACrB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IAC9B,MAAM,OAAO,KAAK;IAClB,QAAQ,QAAQ,QAAQ,QAAQ,OAAO,EAAE;IACzC,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;IACjD,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;IACjD,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;GACnD;EACF;EAMA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,OAAO,KAAK;GAClB,MAAM,KAAK,QAAQ;GACnB,MAAM,KAAK,QAAQ,OAAO;GAC1B,MAAM,KAAK,QAAQ,OAAO;GAC1B,MAAM,KAAK,QAAQ,OAAO;GAC1B,KAAK,MACA,MAAM,IAAM,OAAO,OAClB,MAAM,IAAM,OAAO,OACnB,MAAM,KAAO,OAAO,OACpB,MAAM,KAAO,OAAO,MACxB;EACJ;CACF;CAGA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,KAAK,KAAM,KAAK,KAAK,MAAO;CAI9B,MAAM,SAAS,MAAM;CACrB,OAAO,UAAU,QAAQ,UAAU,GAAG;EACpC,MAAM,SAAS,EAAE,WAAW,EAAE,SAAS,MAAM;EAC7C,MAAM,SAAS,EAAE,SAAS,MAAM,EAAE,SAAS,MAAM;EACjD,MAAM,QAAQ,SAAS,aAAc,SAAS,aAAc;EAC5D,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,MAAO,KAAK,KAAK,QAAS;GAC9B,MAAO,OAAO,KAAO,QAAQ;GAC7B,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS;EACpC;CACF;CAEA,OAAO,SAAS,KAAK,EAAE,QAAQ;EAC7B,MAAM,OAAO,EAAE;EACf,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,MAAO,KAAK,KAAK,KAAK,KAAK,MAAM,SAAS,IAAK;GACnD,MAAO,OAAO,KAAO,QAAQ;GAC7B,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS;EACpC;CACF;CAIA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,QAAQ,KAAK,YAAY,KAAK,EAAE;AAEpC;;;;;AAMA,SAAS,KAAK,KAAa,OAAuB;CAChD,OAAO,KAAK,KAAK;CACjB,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,UAAU,UAAU,OAAO,OAAO,QAAQ,EAAE;CAE9C,OAAO;AACT"}
+{"version":3,"file":"hash.js","names":[],"sources":["../../../../shared/src/hash.ts"],"sourcesContent":["import {\n  avalanche32,\n  PRIME32_1,\n  PRIME32_2,\n  PRIME32_3,\n  PRIME32_4,\n  PRIME32_5,\n  round32,\n} from './xxhash32.ts';\n\nexport const h32 = (s: string) => {\n  digest(s, 1);\n  return digests[0];\n};\nexport const h64 = (s: string) => wide(s, 2);\nexport const h128 = (s: string) => wide(s, 4);\n\nconst MAX_WORDS = 4;\n\n// `digest` is synchronous and does not recurse, so these can be reused across\n// calls instead of allocated per call.\nconst accs = new Int32Array(MAX_WORDS);\nconst stripes = new Int32Array(MAX_WORDS * 4);\nconst digests = new Uint32Array(MAX_WORDS);\nlet encoder: TextEncoder | undefined;\n\n/**\n * Inputs of up to this many UTF-16 code units are UTF-8 encoded into a reused\n * buffer: `TextEncoder#encode` allocates a fresh Uint8Array per call, which for\n * a row-key-sized string cost several times the hashing itself. Longer inputs\n * still allocate: there the allocation is a small share of the cost, and not\n * worth keeping a buffer that size alive.\n */\nconst MAX_REUSED_UNITS = 4096;\nlet utf8: Uint8Array | undefined;\n\n/**\n * xxHash32 over the UTF-8 bytes of `str` under seeds `0..words-1`, leaving the\n * digests in `digests[0..words)`.\n *\n * A seed only changes the initial accumulator values, so every word digests the\n * same input lanes. This walks the bytes once, advancing all `words` sets of\n * accumulators per lane, and UTF-8 encodes the string once. The result is\n * identical to `words` separate `xxHash32(str, i)` calls — which is what this\n * used to delegate to, and what `hash.test.ts` checks it still matches.\n */\nfunction digest(str: string, words: number): void {\n  encoder ??= new TextEncoder();\n  let b: Uint8Array;\n  let len: number;\n  if (str.length <= MAX_REUSED_UNITS) {\n    // A UTF-16 code unit is at most 3 UTF-8 bytes (a surrogate pair is 2 units\n    // and 4 bytes), so the whole string always fits. Bytes past `len` are left\n    // over from earlier calls and never read.\n    b = utf8 ??= new Uint8Array(3 * MAX_REUSED_UNITS);\n    len = encoder.encodeInto(str, b).written;\n  } else {\n    b = encoder.encode(str);\n    len = b.length;\n  }\n\n  for (let w = 0; w < words; w++) {\n    accs[w] = (w + PRIME32_5) & 0xffffffff;\n  }\n\n  let offset = 0;\n\n  /*\n      Step 2. Process stripes\n      A stripe is a contiguous segment of 16 bytes, evenly divided into 4 lanes\n      of 4 bytes each, each lane updating its own accumulator. Inputs shorter\n      than a stripe skip straight to step 4 with a single accumulator.\n  */\n  if (len >= 16) {\n    for (let w = 0; w < words; w++) {\n      const base = w << 2;\n      stripes[base] = (w + PRIME32_1 + PRIME32_2) & 0xffffffff;\n      stripes[base + 1] = (w + PRIME32_2) & 0xffffffff;\n      stripes[base + 2] = w;\n      stripes[base + 3] = (w - PRIME32_1) & 0xffffffff;\n    }\n\n    const limit = len - 16;\n    for (; offset <= limit; offset += 16) {\n      const l0 =\n        b[offset] |\n        (b[offset + 1] << 8) |\n        (b[offset + 2] << 16) |\n        (b[offset + 3] << 24);\n      const l1 =\n        b[offset + 4] |\n        (b[offset + 5] << 8) |\n        (b[offset + 6] << 16) |\n        (b[offset + 7] << 24);\n      const l2 =\n        b[offset + 8] |\n        (b[offset + 9] << 8) |\n        (b[offset + 10] << 16) |\n        (b[offset + 11] << 24);\n      const l3 =\n        b[offset + 12] |\n        (b[offset + 13] << 8) |\n        (b[offset + 14] << 16) |\n        (b[offset + 15] << 24);\n      for (let w = 0; w < words; w++) {\n        const base = w << 2;\n        stripes[base] = round32(stripes[base], l0);\n        stripes[base + 1] = round32(stripes[base + 1], l1);\n        stripes[base + 2] = round32(stripes[base + 2], l2);\n        stripes[base + 3] = round32(stripes[base + 3], l3);\n      }\n    }\n\n    /*\n        Step 3. Accumulator convergence\n        acc = (acc1 <<< 1) + (acc2 <<< 7) + (acc3 <<< 12) + (acc4 <<< 18);\n    */\n    for (let w = 0; w < words; w++) {\n      const base = w << 2;\n      const s0 = stripes[base];\n      const s1 = stripes[base + 1];\n      const s2 = stripes[base + 2];\n      const s3 = stripes[base + 3];\n      accs[w] =\n        (((s0 << 1) | (s0 >>> 31)) +\n          ((s1 << 7) | (s1 >>> 25)) +\n          ((s2 << 12) | (s2 >>> 20)) +\n          ((s3 << 18) | (s3 >>> 14))) &\n        0xffffffff;\n    }\n  }\n\n  // Step 4. Add input length.\n  for (let w = 0; w < words; w++) {\n    accs[w] = (accs[w] + len) & 0xffffffff;\n  }\n\n  // Step 5. Consume the remaining input, 4 bytes at a time and then 1 at a time.\n  const limit4 = len - 4;\n  for (; offset <= limit4; offset += 4) {\n    const laneN0 = b[offset] + (b[offset + 1] << 8);\n    const laneN1 = b[offset + 2] + (b[offset + 3] << 8);\n    const laneP = laneN0 * PRIME32_3 + ((laneN1 * PRIME32_3) << 16);\n    for (let w = 0; w < words; w++) {\n      let acc = (accs[w] + laneP) | 0;\n      acc = (acc << 17) | (acc >>> 15);\n      accs[w] = Math.imul(acc, PRIME32_4);\n    }\n  }\n\n  for (; offset < len; ++offset) {\n    const lane = b[offset];\n    for (let w = 0; w < words; w++) {\n      let acc = (accs[w] + Math.imul(lane, PRIME32_5)) | 0;\n      acc = (acc << 11) | (acc >>> 21);\n      accs[w] = Math.imul(acc, PRIME32_1);\n    }\n  }\n\n  // Step 6. Final mix (avalanche). The Uint32Array store turns any negatives\n  // back into a positive number.\n  for (let w = 0; w < words; w++) {\n    digests[w] = avalanche32(accs[w]);\n  }\n}\n\nconst wideView = new DataView(new ArrayBuffer(16));\n\n/**\n * A hash wider than 32 bits, folding the digests together highest seed first.\n *\n * Every bigint operation allocates its result, so folding word by word with a\n * `BigInt()`, a shift and an add per word allocated up to 6 bigints for h64 and\n * 12 for h128. Laying the words out big-endian and reading them back with\n * `getBigUint64` allocates 1 and 4 for the same values.\n */\nfunction wide(str: string, words: 2 | 4): bigint {\n  digest(str, words);\n  wideView.setUint32(0, digests[0]);\n  wideView.setUint32(4, digests[1]);\n  if (words === 2) {\n    return wideView.getBigUint64(0);\n  }\n  wideView.setUint32(8, digests[2]);\n  wideView.setUint32(12, digests[3]);\n  return (wideView.getBigUint64(0) << 64n) | wideView.getBigUint64(8);\n}\n\n// Re-exported for zero-protocol's AST hash, which cannot import xxhash32.ts\n// directly without tripping a tsc 7.0.2 bug (see the import comment in\n// zero-protocol/src/query-hash-visitor.ts).\nexport {avalanche32, PRIME32_1, PRIME32_5, round32} from './xxhash32.ts';\n"],"mappings":";;AAUA,IAAa,OAAO,MAAc;CAChC,OAAO,GAAG,CAAC;CACX,OAAO,QAAQ;AACjB;AACA,IAAa,OAAO,MAAc,KAAK,GAAG,CAAC;AAC3C,IAAa,QAAQ,MAAc,KAAK,GAAG,CAAC;AAE5C,IAAM,YAAY;AAIlB,IAAM,OAAO,IAAI,WAAW,SAAS;AACrC,IAAM,UAAU,IAAI,WAAW,YAAY,CAAC;AAC5C,IAAM,UAAU,IAAI,YAAY,SAAS;AACzC,IAAI;;;;;;;;AASJ,IAAM,mBAAmB;AACzB,IAAI;;;;;;;;;;;AAYJ,SAAS,OAAO,KAAa,OAAqB;CAChD,YAAY,IAAI,YAAY;CAC5B,IAAI;CACJ,IAAI;CACJ,IAAI,IAAI,UAAU,kBAAkB;EAIlC,IAAI,SAAS,IAAI,WAAW,IAAI,gBAAgB;EAChD,MAAM,QAAQ,WAAW,KAAK,CAAC,EAAE;CACnC,OAAO;EACL,IAAI,QAAQ,OAAO,GAAG;EACtB,MAAM,EAAE;CACV;CAEA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,KAAK,KAAM,IAAI,YAAa;CAG9B,IAAI,SAAS;CAQb,IAAI,OAAO,IAAI;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,OAAO,KAAK;GAClB,QAAQ,QAAS,IAAI,YAAY,YAAa;GAC9C,QAAQ,OAAO,KAAM,IAAI,YAAa;GACtC,QAAQ,OAAO,KAAK;GACpB,QAAQ,OAAO,KAAM,IAAI,YAAa;EACxC;EAEA,MAAM,QAAQ,MAAM;EACpB,OAAO,UAAU,OAAO,UAAU,IAAI;GACpC,MAAM,KACJ,EAAE,UACD,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,MAAM;GACpB,MAAM,KACJ,EAAE,SAAS,KACV,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,MAAM;GACpB,MAAM,KACJ,EAAE,SAAS,KACV,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,OAAO;GACrB,MAAM,KACJ,EAAE,SAAS,MACV,EAAE,SAAS,OAAO,IAClB,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,OAAO;GACrB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IAC9B,MAAM,OAAO,KAAK;IAClB,QAAQ,QAAQ,QAAQ,QAAQ,OAAO,EAAE;IACzC,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;IACjD,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;IACjD,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;GACnD;EACF;EAMA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,OAAO,KAAK;GAClB,MAAM,KAAK,QAAQ;GACnB,MAAM,KAAK,QAAQ,OAAO;GAC1B,MAAM,KAAK,QAAQ,OAAO;GAC1B,MAAM,KAAK,QAAQ,OAAO;GAC1B,KAAK,MACA,MAAM,IAAM,OAAO,OAClB,MAAM,IAAM,OAAO,OACnB,MAAM,KAAO,OAAO,OACpB,MAAM,KAAO,OAAO,MACxB;EACJ;CACF;CAGA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,KAAK,KAAM,KAAK,KAAK,MAAO;CAI9B,MAAM,SAAS,MAAM;CACrB,OAAO,UAAU,QAAQ,UAAU,GAAG;EACpC,MAAM,SAAS,EAAE,WAAW,EAAE,SAAS,MAAM;EAC7C,MAAM,SAAS,EAAE,SAAS,MAAM,EAAE,SAAS,MAAM;EACjD,MAAM,QAAQ,SAAS,aAAc,SAAS,aAAc;EAC5D,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,MAAO,KAAK,KAAK,QAAS;GAC9B,MAAO,OAAO,KAAO,QAAQ;GAC7B,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS;EACpC;CACF;CAEA,OAAO,SAAS,KAAK,EAAE,QAAQ;EAC7B,MAAM,OAAO,EAAE;EACf,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,MAAO,KAAK,KAAK,KAAK,KAAK,MAAM,SAAS,IAAK;GACnD,MAAO,OAAO,KAAO,QAAQ;GAC7B,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS;EACpC;CACF;CAIA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,QAAQ,KAAK,YAAY,KAAK,EAAE;AAEpC;AAEA,IAAM,2BAAW,IAAI,yBAAS,IAAI,YAAY,EAAE,CAAC;;;;;;;;;AAUjD,SAAS,KAAK,KAAa,OAAsB;CAC/C,OAAO,KAAK,KAAK;CACjB,SAAS,UAAU,GAAG,QAAQ,EAAE;CAChC,SAAS,UAAU,GAAG,QAAQ,EAAE;CAChC,IAAI,UAAU,GACZ,OAAO,SAAS,aAAa,CAAC;CAEhC,SAAS,UAAU,GAAG,QAAQ,EAAE;CAChC,SAAS,UAAU,IAAI,QAAQ,EAAE;CACjC,OAAQ,SAAS,aAAa,CAAC,KAAK,MAAO,SAAS,aAAa,CAAC;AACpE"}

package/out/shared/src/tdigest.d.ts

@@ -8,6 +8,12 @@ export interface ReadonlyTDigest {
 export declare class TDigest {
     #private;
     readonly compression: number;
+    /**
+     * A digest keeps roughly `compression` centroids, and buffers up to eight
+     * times as many values between merges. The Go original defaults to 1000;
+     * 100 keeps p50, p95 and p99 within about 0.5% for a tenth of the memory
+     * and serialized size, which is plenty for the inspector's percentiles.
+     */
     constructor(compression?: number);
     /**
      * fromJSON creates a TDigest from a JSON-serializable representation.
@@ -15,6 +21,10 @@ export declare class TDigest {
      */
     static fromJSON(data: Readonly<TDigestJSON>): TDigest;
     reset(): void;
+    /**
+     * Adds a value with the given weight.
+     * Weights which are not a number or are <= 0 are ignored, as are NaN means.
+     */
     add(mean: number, weight?: number): void;
     /** AddCentroidList can quickly add multiple centroids. */
     addCentroidList(centroidList: CentroidList): void;

package/out/shared/src/tdigest.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"tdigest.d.ts","sourceRoot":"","sources":["../../../../shared/src/tdigest.ts"],"names":[],"mappings":"AAIA,OAAO,EAAC,QAAQ,EAAoB,KAAK,YAAY,EAAC,MAAM,eAAe,CAAC;AAC5E,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,qBAAqB,CAAC;AAErD,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,KAAK,EAAE,MAAM,MAAM,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;IACzC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;CACrC;AAID,qBAAa,OAAO;;IAClB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAY7B,YAAY,WAAW,GAAE,MAAa,EAKrC;IAED;;;OAGG;IACH,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,WAAW,CAAC,GAAG,OAAO,CASpD;IAED,KAAK,IAAI,IAAI,CAQZ;IAED,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,GAAE,MAAU,QAEnC;IAED,0DAA0D;IAC1D,eAAe,CAAC,YAAY,EAAE,YAAY,QAIzC;IAED;;;OAGG;IACH,WAAW,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI,CAmB7B;IAED;;;;QAII;IACJ,KAAK,CAAC,EAAE,EAAE,OAAO,QAGhB;IAwCD;;;;;;OAMG;IACH,SAAS,CAAC,EAAE,GAAE,YAAiB,GAAG,YAAY,CAG7C;IAED,KAAK,IAAI,MAAM,CAMd;IAED;;;OAGG;IACH,MAAM,IAAI,WAAW,CAOpB;IA8BD,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAuC1B;IAED;;OAEG;IACH,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CA2ErB;CAgBF;AAID,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAoB3D"}
+{"version":3,"file":"tdigest.d.ts","sourceRoot":"","sources":["../../../../shared/src/tdigest.ts"],"names":[],"mappings":"AAIA,OAAO,EAAC,QAAQ,EAAE,KAAK,YAAY,EAAC,MAAM,eAAe,CAAC;AAC1D,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,qBAAqB,CAAC;AAErD,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,KAAK,EAAE,MAAM,MAAM,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;IACzC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;CACrC;AAcD,qBAAa,OAAO;;IAClB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAqB7B;;;;;OAKG;IACH,YAAY,WAAW,GAAE,MAAY,EAOpC;IAED;;;OAGG;IACH,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,WAAW,CAAC,GAAG,OAAO,CASpD;IAED,KAAK,IAAI,IAAI,CASZ;IAED;;;OAGG;IACH,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,GAAE,MAAU,GAAG,IAAI,CAiB1C;IAED,0DAA0D;IAC1D,eAAe,CAAC,YAAY,EAAE,YAAY,QAIzC;IAED;;;OAGG;IACH,WAAW,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI,CAE7B;IAED;;;;QAII;IACJ,KAAK,CAAC,EAAE,EAAE,OAAO,QAShB;IAiHD;;;;;;OAMG;IACH,SAAS,CAAC,EAAE,GAAE,YAAiB,GAAG,YAAY,CAO7C;IAED,KAAK,IAAI,MAAM,CAMd;IAED;;;OAGG;IACH,MAAM,IAAI,WAAW,CAOpB;IA6BD,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAqC1B;IAED;;OAEG;IACH,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CA2ErB;CAgBF;AAID,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAoB3D"}

package/out/shared/src/tdigest.js

@@ -1,21 +1,37 @@
 import { binarySearch } from "./binary-search.js";
-import { Centroid, sortCentroidList } from "./centroid.js";
+import { Centroid } from "./centroid.js";
 //#region ../shared/src/tdigest.ts
+/** Initial capacity of the buffer of unprocessed values. */
+var INITIAL_CAPACITY = 16;
 var TDigest = class TDigest {
 	compression;
-	#maxProcessed;
 	#maxUnprocessed;
-	#processed;
-	#unprocessed;
+	/** Means of the processed centroids, ascending. */
+	#means;
+	/** Weights of the processed centroids, parallel to `#means`. */
+	#weights;
+	/** Means of the values added since the last `#process`, in order. */
+	#unprocessedMeans;
+	/** Weights of the unprocessed values, parallel to `#unprocessedMeans`. */
+	#unprocessedWeights;
+	#unprocessedCount;
 	#cumulative;
 	#processedWeight;
 	#unprocessedWeight;
 	#min;
 	#max;
-	constructor(compression = 1e3) {
+	/**
+	* A digest keeps roughly `compression` centroids, and buffers up to eight
+	* times as many values between merges. The Go original defaults to 1000;
+	* 100 keeps p50, p95 and p99 within about 0.5% for a tenth of the memory
+	* and serialized size, which is plenty for the inspector's percentiles.
+	*/
+	constructor(compression = 100) {
 		this.compression = compression;
-		this.#maxProcessed = processedSize(0, this.compression);
 		this.#maxUnprocessed = unprocessedSize(0, this.compression);
+		const capacity = Math.min(INITIAL_CAPACITY, this.#maxUnprocessed + 1);
+		this.#unprocessedMeans = new Float64Array(capacity);
+		this.#unprocessedWeights = new Float64Array(capacity);
 		this.reset();
 	}
 	/**
@@ -29,30 +45,39 @@ var TDigest = class TDigest {
 		return digest;
 	}
 	reset() {
-		this.#processed = [];
-		this.#unprocessed = [];
+		this.#means = [];
+		this.#weights = [];
+		this.#unprocessedCount = 0;
 		this.#cumulative = [];
 		this.#processedWeight = 0;
 		this.#unprocessedWeight = 0;
 		this.#min = Number.MAX_VALUE;
 		this.#max = -Number.MAX_VALUE;
 	}
+	/**
+	* Adds a value with the given weight.
+	* Weights which are not a number or are <= 0 are ignored, as are NaN means.
+	*/
 	add(mean, weight = 1) {
-		this.addCentroid(new Centroid(mean, weight));
+		if (Number.isNaN(mean) || weight <= 0 || !Number.isFinite(weight)) return;
+		const n = this.#unprocessedCount;
+		if (n === this.#unprocessedMeans.length) this.#grow();
+		this.#unprocessedMeans[n] = mean;
+		this.#unprocessedWeights[n] = weight;
+		this.#unprocessedCount = n + 1;
+		this.#unprocessedWeight += weight;
+		if (this.#unprocessedCount > this.#maxUnprocessed) this.#process();
 	}
 	/** AddCentroidList can quickly add multiple centroids. */
 	addCentroidList(centroidList) {
-		for (const c of centroidList) this.addCentroid(c);
+		for (const c of centroidList) this.add(c.mean, c.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;
-		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();
+		this.add(c.mean, c.weight);
 	}
 	/**
 	*  Merges the supplied digest into this digest. Functionally equivalent to
@@ -61,35 +86,88 @@ var TDigest = class TDigest {
 	**/
 	merge(t2) {
 		t2.#process();
-		this.addCentroidList(t2.#processed);
+		const means = t2.#means;
+		const weights = t2.#weights;
+		for (let i = 0; i < means.length; i++) this.add(means[i], weights[i]);
+	}
+	/** Doubles the unprocessed buffer, up to what `add` lets it hold. */
+	#grow() {
+		const capacity = Math.min(this.#unprocessedMeans.length * 2, this.#maxUnprocessed + 1);
+		const means = new Float64Array(capacity);
+		means.set(this.#unprocessedMeans);
+		this.#unprocessedMeans = means;
+		const weights = new Float64Array(capacity);
+		weights.set(this.#unprocessedWeights);
+		this.#unprocessedWeights = weights;
 	}
+	/**
+	* Merges the unprocessed values into the centroids: walks both in order of
+	* mean, folding each into the last centroid while that stays within its
+	* size limit, and starting a new centroid otherwise.
+	*/
 	#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.at(-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);
+		if (this.#unprocessedCount === 0) return;
+		const [newMeans, newWeights] = this.#sortedUnprocessed();
+		const oldMeans = this.#means;
+		const oldWeights = this.#weights;
+		const n = newMeans.length;
+		const p = oldMeans.length;
+		this.#unprocessedCount = 0;
+		this.#processedWeight += this.#unprocessedWeight;
+		this.#unprocessedWeight = 0;
+		const total = this.#processedWeight;
+		const means = [];
+		const weights = [];
+		let mean = 0;
+		let weight = 0;
+		let soFar = 0;
+		let limit = 0;
+		let i = 0;
+		let j = 0;
+		while (i < n || j < p) {
+			let m;
+			let w;
+			if (i < n && (j === p || newMeans[i] <= oldMeans[j])) {
+				m = newMeans[i];
+				w = newWeights[i++];
+			} else {
+				m = oldMeans[j];
+				w = oldWeights[j++];
+			}
+			if (soFar + w <= limit) {
+				weight += w;
+				mean += w * (m - mean) / weight;
+			} else {
+				if (weight > 0) {
+					means.push(mean);
+					weights.push(weight);
 				}
+				const k = this.#integratedLocation(soFar / total);
+				limit = total * this.#integratedQ(k + 1);
+				mean = m;
+				weight = w;
 			}
-			this.#min = Math.min(this.#min, this.#processed[0].mean);
-			this.#max = Math.max(this.#max, this.#processed.at(-1).mean);
-			this.#unprocessed.length = 0;
+			soFar += w;
+		}
+		means.push(mean);
+		weights.push(weight);
+		this.#means = means;
+		this.#weights = weights;
+		this.#min = Math.min(this.#min, means[0]);
+		this.#max = Math.max(this.#max, means.at(-1));
+	}
+	/** The unprocessed means and weights, sorted by mean. */
+	#sortedUnprocessed() {
+		const n = this.#unprocessedCount;
+		const means = this.#unprocessedMeans.subarray(0, n);
+		const weights = this.#unprocessedWeights.subarray(0, n);
+		if (isSorted(means)) return [means, weights];
+		if (allEqual(weights)) {
+			means.sort();
+			return [means, weights];
 		}
+		const order = Array.from(means, (_, k) => k).sort((a, b) => means[a] - means[b]);
+		return [Float64Array.from(order, (k) => means[k]), Float64Array.from(order, (k) => weights[k])];
 	}
 	/**
 	* Centroids returns a copy of processed centroids.
@@ -100,7 +178,9 @@ var TDigest = class TDigest {
 	*/
 	centroids(cl = []) {
 		this.#process();
-		return [...cl, ...this.#processed];
+		const result = [...cl];
+		for (let i = 0; i < this.#means.length; i++) result.push(new Centroid(this.#means[i], this.#weights[i]));
+		return result;
 	}
 	count() {
 		this.#process();
@@ -113,37 +193,37 @@ var TDigest = class TDigest {
 	toJSON() {
 		this.#process();
 		const data = [this.compression];
-		for (const centroid of this.#processed) data.push(centroid.mean, centroid.weight);
+		for (let i = 0; i < this.#means.length; i++) data.push(this.#means[i], this.#weights[i]);
 		return data;
 	}
 	#updateCumulative() {
 		if (this.#cumulative.length > 0 && this.#cumulative.at(-1) === this.#processedWeight) return;
-		const n = this.#processed.length + 1;
+		const n = this.#means.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;
+		for (let i = 0; i < this.#means.length; i++) {
+			const cur = this.#weights[i];
 			this.#cumulative[i] = prev + cur / 2;
 			prev += cur;
 		}
-		this.#cumulative[this.#processed.length] = prev;
+		this.#cumulative[this.#means.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;
+		if (q < 0 || q > 1 || this.#means.length === 0) return NaN;
+		if (this.#means.length === 1) return this.#means[0];
 		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);
+		if (index <= this.#weights[0] / 2) return this.#min + 2 * index / this.#weights[0] * (this.#means[0] - 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);
+			return weightedAverage(this.#means[lower - 1], z2, this.#means[lower], 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.at(-1).mean, z1, this.#max, z2);
+		const z1 = index - this.#processedWeight - this.#weights[lower - 1] / 2;
+		const z2 = this.#weights[lower - 1] / 2 - z1;
+		return weightedAverage(this.#means.at(-1), z1, this.#max, z2);
 	}
 	/**
 	* CDF returns the cumulative distribution function for a given value x.
@@ -151,7 +231,7 @@ var TDigest = class TDigest {
 	cdf(x) {
 		this.#process();
 		this.#updateCumulative();
-		switch (this.#processed.length) {
+		switch (this.#means.length) {
 			case 0: return 0;
 			case 1: {
 				const width = this.#max - this.#min;
@@ -163,19 +243,19 @@ var TDigest = class TDigest {
 		}
 		if (x <= this.#min) return 0;
 		if (x >= this.#max) return 1;
-		const m0 = this.#processed[0].mean;
+		const m0 = this.#means[0];
 		if (x <= m0) {
-			if (m0 - this.#min > 0) return (x - this.#min) / (m0 - this.#min) * this.#processed[0].weight / this.#processedWeight / 2;
+			if (m0 - this.#min > 0) return (x - this.#min) / (m0 - this.#min) * this.#weights[0] / this.#processedWeight / 2;
 			return 0;
 		}
-		const mn = this.#processed.at(-1).mean;
+		const mn = this.#means.at(-1);
 		if (x >= mn) {
-			if (this.#max - mn > 0) return 1 - (this.#max - x) / (this.#max - mn) * this.#processed.at(-1).weight / this.#processedWeight / 2;
+			if (this.#max - mn > 0) return 1 - (this.#max - x) / (this.#max - mn) * this.#weights.at(-1) / 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;
+		const upper = binarySearch(this.#means.length, (i) => x - this.#means[i] || 1);
+		const z1 = x - this.#means[upper - 1];
+		const z2 = this.#means[upper] - x;
 		return weightedAverage(this.#cumulative[upper - 1], z2, this.#cumulative[upper], z1) / this.#processedWeight;
 	}
 	#integratedQ(k) {
@@ -185,6 +265,14 @@ var TDigest = class TDigest {
 		return this.compression * (Math.asin(2 * q - 1) + Math.PI / 2) / Math.PI;
 	}
 };
+function isSorted(values) {
+	for (let i = 1; i < values.length; i++) if (values[i] < values[i - 1]) return false;
+	return true;
+}
+function allEqual(values) {
+	for (let i = 1; i < values.length; i++) if (values[i] !== values[0]) return false;
+	return true;
+}
 function weightedAverage(x1, w1, x2, w2) {
 	if (x1 <= x2) return weightedAverageSorted(x1, w1, x2, w2);
 	return weightedAverageSorted(x2, w2, x1, w1);
@@ -193,10 +281,6 @@ function weightedAverageSorted(x1, w1, x2, w2) {
 	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;
-}
 function unprocessedSize(size, compression) {
 	if (size === 0) return Math.ceil(compression) * 8;
 	return size;

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

@@ -1 +1 @@
-{"version":3,"file":"tdigest.js","names":["#maxProcessed","#maxUnprocessed","#processed","#unprocessed","#cumulative","#processedWeight","#unprocessedWeight","#min","#max","#process","#integratedQ","#integratedLocation","#updateCumulative"],"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          // oxlint-disable-next-line typescript/no-non-null-assertion\n          this.#processed.at(-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      // oxlint-disable-next-line typescript/no-non-null-assertion\n      this.#max = Math.max(this.#max, this.#processed.at(-1)!.mean);\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, ...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.at(-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    // oxlint-disable-next-line typescript/no-non-null-assertion\n    return weightedAverage(this.#processed.at(-1)!.mean, z1, this.#max, z2);\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    // oxlint-disable-next-line typescript/no-non-null-assertion\n    const mn = this.#processed.at(-1)!.mean;\n    if (x >= mn) {\n      if (this.#max - mn > 0) {\n        return (\n          1 -\n          (((this.#max - x) / (this.#max - mn)) *\n            // oxlint-disable-next-line typescript/no-non-null-assertion\n            this.#processed.at(-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"],"mappings":";;;AAeA,IAAa,UAAb,MAAa,QAAQ;CACnB;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA,YAAY,cAAsB,KAAM;EACtC,KAAK,cAAc;EACnB,KAAKA,gBAAgB,cAAc,GAAG,KAAK,WAAW;EACtD,KAAKC,kBAAkB,gBAAgB,GAAG,KAAK,WAAW;EAC1D,KAAK,MAAM;CACb;;;;;CAMA,OAAO,SAAS,MAAsC;EACpD,MAAM,SAAS,IAAI,QAAQ,KAAK,EAAE;EAClC,IAAI,KAAK,SAAS,MAAM,GACtB,MAAM,IAAI,MAAM,yBAAyB;EAE3C,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GACpC,OAAO,IAAI,KAAK,IAAI,KAAK,IAAI,EAAE;EAEjC,OAAO;CACT;CAEA,QAAc;EACZ,KAAKC,aAAa,CAAC;EACnB,KAAKC,eAAe,CAAC;EACrB,KAAKC,cAAc,CAAC;EACpB,KAAKC,mBAAmB;EACxB,KAAKC,qBAAqB;EAC1B,KAAKC,OAAO,OAAO;EACnB,KAAKC,OAAO,CAAC,OAAO;CACtB;CAEA,IAAI,MAAc,SAAiB,GAAG;EACpC,KAAK,YAAY,IAAI,SAAS,MAAM,MAAM,CAAC;CAC7C;;CAGA,gBAAgB,cAA4B;EAC1C,KAAK,MAAM,KAAK,cACd,KAAK,YAAY,CAAC;CAEtB;;;;;CAMA,YAAY,GAAmB;EAC7B,IACE,OAAO,MAAM,EAAE,IAAI,KACnB,EAAE,UAAU,KACZ,OAAO,MAAM,EAAE,MAAM,KACrB,CAAC,OAAO,SAAS,EAAE,MAAM,GAEzB;EAGF,KAAKL,aAAa,KAAK,IAAI,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC;EACrD,KAAKG,sBAAsB,EAAE;EAE7B,IACE,KAAKJ,WAAW,SAAS,KAAKF,iBAC9B,KAAKG,aAAa,SAAS,KAAKF,iBAEhC,KAAKQ,SAAS;CAElB;;;;;;CAOA,MAAM,IAAa;EACjB,GAAGA,SAAS;EACZ,KAAK,gBAAgB,GAAGP,UAAU;CACpC;CAEA,WAAW;EACT,IACE,KAAKC,aAAa,SAAS,KAC3B,KAAKD,WAAW,SAAS,KAAKF,eAC9B;GAEA,KAAKG,aAAa,KAAK,GAAG,KAAKD,UAAU;GACzC,iBAAiB,KAAKC,YAAY;GAGlC,KAAKD,WAAW,SAAS;GACzB,KAAKA,WAAW,KAAK,KAAKC,aAAa,EAAE;GAEzC,KAAKE,oBAAoB,KAAKC;GAC9B,KAAKA,qBAAqB;GAC1B,IAAI,QAAQ,KAAKH,aAAa,GAAG;GACjC,IAAI,QAAQ,KAAKE,mBAAmB,KAAKK,aAAa,CAAC;GACvD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAKP,aAAa,QAAQ,KAAK;IACjD,MAAM,WAAW,KAAKA,aAAa;IACnC,MAAM,YAAY,QAAQ,SAAS;IACnC,IAAI,aAAa,OAAO;KACtB,QAAQ;KAER,KAAKD,WAAW,GAAG,EAAE,EAAG,IAAI,QAAQ;IACtC,OAAO;KACL,MAAM,KAAK,KAAKS,oBAAoB,QAAQ,KAAKN,gBAAgB;KACjE,QAAQ,KAAKA,mBAAmB,KAAKK,aAAa,KAAK,CAAC;KACxD,SAAS,SAAS;KAClB,KAAKR,WAAW,KAAK,QAAQ;IAC/B;GACF;GACA,KAAKK,OAAO,KAAK,IAAI,KAAKA,MAAM,KAAKL,WAAW,GAAG,IAAI;GAEvD,KAAKM,OAAO,KAAK,IAAI,KAAKA,MAAM,KAAKN,WAAW,GAAG,EAAE,EAAG,IAAI;GAC5D,KAAKC,aAAa,SAAS;EAC7B;CACF;;;;;;;;CASA,UAAU,KAAmB,CAAC,GAAiB;EAC7C,KAAKM,SAAS;EACd,OAAO,CAAC,GAAG,IAAI,GAAG,KAAKP,UAAU;CACnC;CAEA,QAAgB;EACd,KAAKO,SAAS;EAId,OAAO,KAAKJ;CACd;;;;;CAMA,SAAsB;EACpB,KAAKI,SAAS;EACd,MAAM,OAAoB,CAAC,KAAK,WAAW;EAC3C,KAAK,MAAM,YAAY,KAAKP,YAC1B,KAAK,KAAK,SAAS,MAAM,SAAS,MAAM;EAE1C,OAAO;CACT;CAEA,oBAAoB;EAIlB,IACE,KAAKE,YAAY,SAAS,KAC1B,KAAKA,YAAY,GAAG,EAAE,MAAM,KAAKC,kBAEjC;EAEF,MAAM,IAAI,KAAKH,WAAW,SAAS;EACnC,IAAI,KAAKE,YAAY,SAAS,GAC5B,KAAKA,YAAY,SAAS;EAG5B,IAAI,OAAO;EACX,KAAK,IAAI,IAAI,GAAG,IAAI,KAAKF,WAAW,QAAQ,KAAK;GAE/C,MAAM,MADW,KAAKA,WAAW,GACZ;GACrB,KAAKE,YAAY,KAAK,OAAO,MAAM;GACnC,QAAQ;EACV;EACA,KAAKA,YAAY,KAAKF,WAAW,UAAU;CAC7C;CAKA,SAAS,GAAmB;EAC1B,KAAKO,SAAS;EACd,KAAKG,kBAAkB;EACvB,IAAI,IAAI,KAAK,IAAI,KAAK,KAAKV,WAAW,WAAW,GAC/C,OAAO;EAET,IAAI,KAAKA,WAAW,WAAW,GAC7B,OAAO,KAAKA,WAAW,GAAG;EAE5B,MAAM,QAAQ,IAAI,KAAKG;EACvB,IAAI,SAAS,KAAKH,WAAW,GAAG,SAAS,GACvC,OACE,KAAKK,OACH,IAAI,QAAS,KAAKL,WAAW,GAAG,UAC/B,KAAKA,WAAW,GAAG,OAAO,KAAKK;EAItC,MAAM,QAAQ,aACZ,KAAKH,YAAY,SAChB,MAAc,CAAC,KAAKA,YAAY,KAAK,KACxC;EAEA,IAAI,QAAQ,MAAM,KAAKA,YAAY,QAAQ;GACzC,MAAM,KAAK,QAAQ,KAAKA,YAAY,QAAQ;GAC5C,MAAM,KAAK,KAAKA,YAAY,SAAS;GACrC,OAAO,gBACL,KAAKF,WAAW,QAAQ,GAAG,MAC3B,IACA,KAAKA,WAAW,OAAO,MACvB,EACF;EACF;EAEA,MAAM,KACJ,QAAQ,KAAKG,mBAAmB,KAAKH,WAAW,QAAQ,GAAG,SAAS;EACtE,MAAM,KAAK,KAAKA,WAAW,QAAQ,GAAG,SAAS,IAAI;EAEnD,OAAO,gBAAgB,KAAKA,WAAW,GAAG,EAAE,EAAG,MAAM,IAAI,KAAKM,MAAM,EAAE;CACxE;;;;CAKA,IAAI,GAAmB;EACrB,KAAKC,SAAS;EACd,KAAKG,kBAAkB;EACvB,QAAQ,KAAKV,WAAW,QAAxB;GACE,KAAK,GACH,OAAO;GACT,KAAK,GAAG;IACN,MAAM,QAAQ,KAAKM,OAAO,KAAKD;IAC/B,IAAI,KAAK,KAAKA,MACZ,OAAO;IAET,IAAI,KAAK,KAAKC,MACZ,OAAO;IAET,IAAI,IAAI,KAAKD,QAAQ,OAEnB,OAAO;IAET,QAAQ,IAAI,KAAKA,QAAQ;GAC3B;EACF;EAEA,IAAI,KAAK,KAAKA,MACZ,OAAO;EAET,IAAI,KAAK,KAAKC,MACZ,OAAO;EAET,MAAM,KAAK,KAAKN,WAAW,GAAG;EAE9B,IAAI,KAAK,IAAI;GACX,IAAI,KAAK,KAAKK,OAAO,GACnB,QACK,IAAI,KAAKA,SAAS,KAAK,KAAKA,QAAS,KAAKL,WAAW,GAAG,SAC3D,KAAKG,mBACL;GAGJ,OAAO;EACT;EAGA,MAAM,KAAK,KAAKH,WAAW,GAAG,EAAE,EAAG;EACnC,IAAI,KAAK,IAAI;GACX,IAAI,KAAKM,OAAO,KAAK,GACnB,OACE,KACG,KAAKA,OAAO,MAAM,KAAKA,OAAO,MAE/B,KAAKN,WAAW,GAAG,EAAE,EAAG,SACxB,KAAKG,mBACL;GAGN,OAAO;EACT;EAEA,MAAM,QAAQ,aACZ,KAAKH,WAAW,SAIhB,MAAK,IAAI,KAAKA,WAAW,GAAG,QAAQ,CACtC;EAEA,MAAM,KAAK,IAAI,KAAKA,WAAW,QAAQ,GAAG;EAC1C,MAAM,KAAK,KAAKA,WAAW,OAAO,OAAO;EACzC,OACE,gBACE,KAAKE,YAAY,QAAQ,IACzB,IACA,KAAKA,YAAY,QACjB,EACF,IAAI,KAAKC;CAEb;CAEA,aAAa,GAAmB;EAC9B,QACG,KAAK,IACH,KAAK,IAAI,GAAG,KAAK,WAAW,IAAI,KAAK,KAAM,KAAK,cAC/C,KAAK,KAAK,CACd,IACE,KACF;CAEJ;CAEA,oBAAoB,GAAmB;EACrC,OAAQ,KAAK,eAAe,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,KAAM,KAAK;CAC1E;AACF;AA0BA,SAAS,gBACP,IACA,IACA,IACA,IACQ;CACR,IAAI,MAAM,IACR,OAAO,sBAAsB,IAAI,IAAI,IAAI,EAAE;CAE7C,OAAO,sBAAsB,IAAI,IAAI,IAAI,EAAE;AAC7C;AAEA,SAAS,sBACP,IACA,IACA,IACA,IACQ;CACR,MAAM,KAAK,KAAK,KAAK,KAAK,OAAO,KAAK;CACtC,OAAO,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;AACrC;AAEA,SAAS,cAAc,MAAc,aAA6B;CAChE,IAAI,SAAS,GACX,OAAO,KAAK,KAAK,WAAW,IAAI;CAElC,OAAO;AACT;AAEA,SAAS,gBAAgB,MAAc,aAA6B;CAClE,IAAI,SAAS,GACX,OAAO,KAAK,KAAK,WAAW,IAAI;CAElC,OAAO;AACT"}
+{"version":3,"file":"tdigest.js","names":["#maxUnprocessed","#unprocessedMeans","#unprocessedWeights","#means","#weights","#unprocessedCount","#cumulative","#processedWeight","#unprocessedWeight","#min","#max","#grow","#process","#sortedUnprocessed","#integratedLocation","#integratedQ","#updateCumulative"],"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, 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/** Initial capacity of the buffer of unprocessed values. */\nconst INITIAL_CAPACITY = 16;\n\n// TDigest is a data structure for accurate on-line accumulation of\n// rank-based statistics such as quantiles and trimmed means.\n//\n// Unlike the Go original, centroids are kept as parallel arrays of means and\n// weights rather than as objects, so adding a value allocates nothing. New\n// values are buffered in a Float64Array and sorted with its native numeric\n// sort instead of Array.prototype.sort with a comparator. On an engine\n// without a JIT, such as Hermes in React Native, calling the comparator for\n// every comparison is what made adding values expensive.\nexport class TDigest {\n  readonly compression: number;\n\n  readonly #maxUnprocessed: number;\n\n  /** Means of the processed centroids, ascending. */\n  #means!: number[];\n  /** Weights of the processed centroids, parallel to `#means`. */\n  #weights!: number[];\n\n  /** Means of the values added since the last `#process`, in order. */\n  #unprocessedMeans: Float64Array;\n  /** Weights of the unprocessed values, parallel to `#unprocessedMeans`. */\n  #unprocessedWeights: Float64Array;\n  #unprocessedCount!: number;\n\n  #cumulative!: number[];\n  #processedWeight!: number;\n  #unprocessedWeight!: number;\n  #min!: number;\n  #max!: number;\n\n  /**\n   * A digest keeps roughly `compression` centroids, and buffers up to eight\n   * times as many values between merges. The Go original defaults to 1000;\n   * 100 keeps p50, p95 and p99 within about 0.5% for a tenth of the memory\n   * and serialized size, which is plenty for the inspector's percentiles.\n   */\n  constructor(compression: number = 100) {\n    this.compression = compression;\n    this.#maxUnprocessed = unprocessedSize(0, this.compression);\n    const capacity = Math.min(INITIAL_CAPACITY, this.#maxUnprocessed + 1);\n    this.#unprocessedMeans = new Float64Array(capacity);\n    this.#unprocessedWeights = new Float64Array(capacity);\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.#means = [];\n    this.#weights = [];\n    this.#unprocessedCount = 0;\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  /**\n   * Adds a value with the given weight.\n   * Weights which are not a number or are <= 0 are ignored, as are NaN means.\n   */\n  add(mean: number, weight: number = 1): void {\n    if (Number.isNaN(mean) || weight <= 0 || !Number.isFinite(weight)) {\n      return;\n    }\n\n    const n = this.#unprocessedCount;\n    if (n === this.#unprocessedMeans.length) {\n      this.#grow();\n    }\n    this.#unprocessedMeans[n] = mean;\n    this.#unprocessedWeights[n] = weight;\n    this.#unprocessedCount = n + 1;\n    this.#unprocessedWeight += weight;\n\n    if (this.#unprocessedCount > this.#maxUnprocessed) {\n      this.#process();\n    }\n  }\n\n  /** AddCentroidList can quickly add multiple centroids. */\n  addCentroidList(centroidList: CentroidList) {\n    for (const c of centroidList) {\n      this.add(c.mean, c.weight);\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    this.add(c.mean, c.weight);\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    // #process replaces the arrays rather than changing them, so these stay\n    // intact even if t2 is this digest.\n    const means = t2.#means;\n    const weights = t2.#weights;\n    for (let i = 0; i < means.length; i++) {\n      this.add(means[i], weights[i]);\n    }\n  }\n\n  /** Doubles the unprocessed buffer, up to what `add` lets it hold. */\n  #grow(): void {\n    const capacity = Math.min(\n      this.#unprocessedMeans.length * 2,\n      this.#maxUnprocessed + 1,\n    );\n    const means = new Float64Array(capacity);\n    means.set(this.#unprocessedMeans);\n    this.#unprocessedMeans = means;\n    const weights = new Float64Array(capacity);\n    weights.set(this.#unprocessedWeights);\n    this.#unprocessedWeights = weights;\n  }\n\n  /**\n   * Merges the unprocessed values into the centroids: walks both in order of\n   * mean, folding each into the last centroid while that stays within its\n   * size limit, and starting a new centroid otherwise.\n   */\n  #process() {\n    if (this.#unprocessedCount === 0) {\n      return;\n    }\n    const [newMeans, newWeights] = this.#sortedUnprocessed();\n    const oldMeans = this.#means;\n    const oldWeights = this.#weights;\n    const n = newMeans.length;\n    const p = oldMeans.length;\n    this.#unprocessedCount = 0;\n    this.#processedWeight += this.#unprocessedWeight;\n    this.#unprocessedWeight = 0;\n    const total = this.#processedWeight;\n\n    const means: number[] = [];\n    const weights: number[] = [];\n    // The centroid being built, kept in locals rather than in the arrays,\n    // which is markedly faster without a JIT. Its weight is 0 until the first\n    // value.\n    let mean = 0;\n    let weight = 0;\n    let soFar = 0;\n    // A limit of 0 makes the first value start a centroid, whose limit then\n    // comes from the same formula as every other's. With soFar at 0 that is\n    // integratedQ(1): integratedLocation(0) is exactly 0, since\n    // Math.asin(-1) is -Math.PI / 2.\n    let limit = 0;\n    let i = 0;\n    let j = 0;\n    while (i < n || j < p) {\n      // On a tie the new value goes first, as in the original, which appended\n      // the old centroids to the new values and sorted them with a stable sort.\n      let m: number;\n      let w: number;\n      if (i < n && (j === p || newMeans[i] <= oldMeans[j])) {\n        m = newMeans[i];\n        w = newWeights[i++];\n      } else {\n        m = oldMeans[j];\n        w = oldWeights[j++];\n      }\n      if (soFar + w <= limit) {\n        // Same arithmetic as Centroid.add.\n        weight += w;\n        mean += (w * (m - mean)) / weight;\n      } else {\n        if (weight > 0) {\n          means.push(mean);\n          weights.push(weight);\n        }\n        const k = this.#integratedLocation(soFar / total);\n        limit = total * this.#integratedQ(k + 1);\n        mean = m;\n        weight = w;\n      }\n      soFar += w;\n    }\n    means.push(mean);\n    weights.push(weight);\n\n    this.#means = means;\n    this.#weights = weights;\n    this.#min = Math.min(this.#min, means[0]);\n    // oxlint-disable-next-line typescript/no-non-null-assertion\n    this.#max = Math.max(this.#max, means.at(-1)!);\n  }\n\n  /** The unprocessed means and weights, sorted by mean. */\n  #sortedUnprocessed(): [Float64Array, Float64Array] {\n    const n = this.#unprocessedCount;\n    const means = this.#unprocessedMeans.subarray(0, n);\n    const weights = this.#unprocessedWeights.subarray(0, n);\n    // fromJSON and merge add centroids in order of mean.\n    if (isSorted(means)) {\n      return [means, weights];\n    }\n    // With one weight for all the values, sorting the means alone keeps every\n    // value with its weight, and the native numeric sort needs no comparator.\n    if (allEqual(weights)) {\n      means.sort();\n      return [means, weights];\n    }\n    // A stable sort, so values with equal means stay in the order added.\n    const order = Array.from(means, (_, k) => k).sort(\n      (a, b) => means[a] - means[b],\n    );\n    return [\n      Float64Array.from(order, k => means[k]),\n      Float64Array.from(order, k => weights[k]),\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    const result = [...cl];\n    for (let i = 0; i < this.#means.length; i++) {\n      result.push(new Centroid(this.#means[i], this.#weights[i]));\n    }\n    return result;\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 (let i = 0; i < this.#means.length; i++) {\n      data.push(this.#means[i], this.#weights[i]);\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.at(-1) === this.#processedWeight\n    ) {\n      return;\n    }\n    const n = this.#means.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.#means.length; i++) {\n      const cur = this.#weights[i];\n      this.#cumulative[i] = prev + cur / 2;\n      prev += cur;\n    }\n    this.#cumulative[this.#means.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.#means.length === 0) {\n      return NaN;\n    }\n    if (this.#means.length === 1) {\n      return this.#means[0];\n    }\n    const index = q * this.#processedWeight;\n    if (index <= this.#weights[0] / 2) {\n      return (\n        this.#min +\n        ((2 * index) / this.#weights[0]) * (this.#means[0] - 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.#means[lower - 1],\n        z2,\n        this.#means[lower],\n        z1,\n      );\n    }\n\n    const z1 = index - this.#processedWeight - this.#weights[lower - 1] / 2;\n    const z2 = this.#weights[lower - 1] / 2 - z1;\n    // oxlint-disable-next-line typescript/no-non-null-assertion\n    return weightedAverage(this.#means.at(-1)!, z1, this.#max, z2);\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.#means.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.#means[0];\n    // Left Tail\n    if (x <= m0) {\n      if (m0 - this.#min > 0) {\n        return (\n          (((x - this.#min) / (m0 - this.#min)) * this.#weights[0]) /\n          this.#processedWeight /\n          2\n        );\n      }\n      return 0;\n    }\n    // Right Tail\n    // oxlint-disable-next-line typescript/no-non-null-assertion\n    const mn = this.#means.at(-1)!;\n    if (x >= mn) {\n      if (this.#max - mn > 0) {\n        return (\n          1 -\n          (((this.#max - x) / (this.#max - mn)) *\n            // oxlint-disable-next-line typescript/no-non-null-assertion\n            this.#weights.at(-1)!) /\n            this.#processedWeight /\n            2\n        );\n      }\n      return 1;\n    }\n\n    const upper = binarySearch(\n      this.#means.length,\n      // Treat equals as greater than, so we can use the upper index\n      // This is equivalent to:\n      //   i => this.#means[i] > x ? -1 : 1,\n      i => x - this.#means[i] || 1,\n    );\n\n    const z1 = x - this.#means[upper - 1];\n    const z2 = this.#means[upper] - 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 isSorted(values: Float64Array): boolean {\n  for (let i = 1; i < values.length; i++) {\n    if (values[i] < values[i - 1]) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction allEqual(values: Float64Array): boolean {\n  for (let i = 1; i < values.length; i++) {\n    if (values[i] !== values[0]) {\n      return false;\n    }\n  }\n  return true;\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 unprocessedSize(size: number, compression: number): number {\n  if (size === 0) {\n    return Math.ceil(compression) * 8;\n  }\n  return size;\n}\n"],"mappings":";;;;AAcA,IAAM,mBAAmB;AAWzB,IAAa,UAAb,MAAa,QAAQ;CACnB;CAEA;;CAGA;;CAEA;;CAGA;;CAEA;CACA;CAEA;CACA;CACA;CACA;CACA;;;;;;;CAQA,YAAY,cAAsB,KAAK;EACrC,KAAK,cAAc;EACnB,KAAKA,kBAAkB,gBAAgB,GAAG,KAAK,WAAW;EAC1D,MAAM,WAAW,KAAK,IAAI,kBAAkB,KAAKA,kBAAkB,CAAC;EACpE,KAAKC,oBAAoB,IAAI,aAAa,QAAQ;EAClD,KAAKC,sBAAsB,IAAI,aAAa,QAAQ;EACpD,KAAK,MAAM;CACb;;;;;CAMA,OAAO,SAAS,MAAsC;EACpD,MAAM,SAAS,IAAI,QAAQ,KAAK,EAAE;EAClC,IAAI,KAAK,SAAS,MAAM,GACtB,MAAM,IAAI,MAAM,yBAAyB;EAE3C,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GACpC,OAAO,IAAI,KAAK,IAAI,KAAK,IAAI,EAAE;EAEjC,OAAO;CACT;CAEA,QAAc;EACZ,KAAKC,SAAS,CAAC;EACf,KAAKC,WAAW,CAAC;EACjB,KAAKC,oBAAoB;EACzB,KAAKC,cAAc,CAAC;EACpB,KAAKC,mBAAmB;EACxB,KAAKC,qBAAqB;EAC1B,KAAKC,OAAO,OAAO;EACnB,KAAKC,OAAO,CAAC,OAAO;CACtB;;;;;CAMA,IAAI,MAAc,SAAiB,GAAS;EAC1C,IAAI,OAAO,MAAM,IAAI,KAAK,UAAU,KAAK,CAAC,OAAO,SAAS,MAAM,GAC9D;EAGF,MAAM,IAAI,KAAKL;EACf,IAAI,MAAM,KAAKJ,kBAAkB,QAC/B,KAAKU,MAAM;EAEb,KAAKV,kBAAkB,KAAK;EAC5B,KAAKC,oBAAoB,KAAK;EAC9B,KAAKG,oBAAoB,IAAI;EAC7B,KAAKG,sBAAsB;EAE3B,IAAI,KAAKH,oBAAoB,KAAKL,iBAChC,KAAKY,SAAS;CAElB;;CAGA,gBAAgB,cAA4B;EAC1C,KAAK,MAAM,KAAK,cACd,KAAK,IAAI,EAAE,MAAM,EAAE,MAAM;CAE7B;;;;;CAMA,YAAY,GAAmB;EAC7B,KAAK,IAAI,EAAE,MAAM,EAAE,MAAM;CAC3B;;;;;;CAOA,MAAM,IAAa;EACjB,GAAGA,SAAS;EAGZ,MAAM,QAAQ,GAAGT;EACjB,MAAM,UAAU,GAAGC;EACnB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,KAAK,IAAI,MAAM,IAAI,QAAQ,EAAE;CAEjC;;CAGA,QAAc;EACZ,MAAM,WAAW,KAAK,IACpB,KAAKH,kBAAkB,SAAS,GAChC,KAAKD,kBAAkB,CACzB;EACA,MAAM,QAAQ,IAAI,aAAa,QAAQ;EACvC,MAAM,IAAI,KAAKC,iBAAiB;EAChC,KAAKA,oBAAoB;EACzB,MAAM,UAAU,IAAI,aAAa,QAAQ;EACzC,QAAQ,IAAI,KAAKC,mBAAmB;EACpC,KAAKA,sBAAsB;CAC7B;;;;;;CAOA,WAAW;EACT,IAAI,KAAKG,sBAAsB,GAC7B;EAEF,MAAM,CAAC,UAAU,cAAc,KAAKQ,mBAAmB;EACvD,MAAM,WAAW,KAAKV;EACtB,MAAM,aAAa,KAAKC;EACxB,MAAM,IAAI,SAAS;EACnB,MAAM,IAAI,SAAS;EACnB,KAAKC,oBAAoB;EACzB,KAAKE,oBAAoB,KAAKC;EAC9B,KAAKA,qBAAqB;EAC1B,MAAM,QAAQ,KAAKD;EAEnB,MAAM,QAAkB,CAAC;EACzB,MAAM,UAAoB,CAAC;EAI3B,IAAI,OAAO;EACX,IAAI,SAAS;EACb,IAAI,QAAQ;EAKZ,IAAI,QAAQ;EACZ,IAAI,IAAI;EACR,IAAI,IAAI;EACR,OAAO,IAAI,KAAK,IAAI,GAAG;GAGrB,IAAI;GACJ,IAAI;GACJ,IAAI,IAAI,MAAM,MAAM,KAAK,SAAS,MAAM,SAAS,KAAK;IACpD,IAAI,SAAS;IACb,IAAI,WAAW;GACjB,OAAO;IACL,IAAI,SAAS;IACb,IAAI,WAAW;GACjB;GACA,IAAI,QAAQ,KAAK,OAAO;IAEtB,UAAU;IACV,QAAS,KAAK,IAAI,QAAS;GAC7B,OAAO;IACL,IAAI,SAAS,GAAG;KACd,MAAM,KAAK,IAAI;KACf,QAAQ,KAAK,MAAM;IACrB;IACA,MAAM,IAAI,KAAKO,oBAAoB,QAAQ,KAAK;IAChD,QAAQ,QAAQ,KAAKC,aAAa,IAAI,CAAC;IACvC,OAAO;IACP,SAAS;GACX;GACA,SAAS;EACX;EACA,MAAM,KAAK,IAAI;EACf,QAAQ,KAAK,MAAM;EAEnB,KAAKZ,SAAS;EACd,KAAKC,WAAW;EAChB,KAAKK,OAAO,KAAK,IAAI,KAAKA,MAAM,MAAM,EAAE;EAExC,KAAKC,OAAO,KAAK,IAAI,KAAKA,MAAM,MAAM,GAAG,EAAE,CAAE;CAC/C;;CAGA,qBAAmD;EACjD,MAAM,IAAI,KAAKL;EACf,MAAM,QAAQ,KAAKJ,kBAAkB,SAAS,GAAG,CAAC;EAClD,MAAM,UAAU,KAAKC,oBAAoB,SAAS,GAAG,CAAC;EAEtD,IAAI,SAAS,KAAK,GAChB,OAAO,CAAC,OAAO,OAAO;EAIxB,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,KAAK;GACX,OAAO,CAAC,OAAO,OAAO;EACxB;EAEA,MAAM,QAAQ,MAAM,KAAK,QAAQ,GAAG,MAAM,CAAC,EAAE,MAC1C,GAAG,MAAM,MAAM,KAAK,MAAM,EAC7B;EACA,OAAO,CACL,aAAa,KAAK,QAAO,MAAK,MAAM,EAAE,GACtC,aAAa,KAAK,QAAO,MAAK,QAAQ,EAAE,CAC1C;CACF;;;;;;;;CASA,UAAU,KAAmB,CAAC,GAAiB;EAC7C,KAAKU,SAAS;EACd,MAAM,SAAS,CAAC,GAAG,EAAE;EACrB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAKT,OAAO,QAAQ,KACtC,OAAO,KAAK,IAAI,SAAS,KAAKA,OAAO,IAAI,KAAKC,SAAS,EAAE,CAAC;EAE5D,OAAO;CACT;CAEA,QAAgB;EACd,KAAKQ,SAAS;EAId,OAAO,KAAKL;CACd;;;;;CAMA,SAAsB;EACpB,KAAKK,SAAS;EACd,MAAM,OAAoB,CAAC,KAAK,WAAW;EAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,KAAKT,OAAO,QAAQ,KACtC,KAAK,KAAK,KAAKA,OAAO,IAAI,KAAKC,SAAS,EAAE;EAE5C,OAAO;CACT;CAEA,oBAAoB;EAIlB,IACE,KAAKE,YAAY,SAAS,KAC1B,KAAKA,YAAY,GAAG,EAAE,MAAM,KAAKC,kBAEjC;EAEF,MAAM,IAAI,KAAKJ,OAAO,SAAS;EAC/B,IAAI,KAAKG,YAAY,SAAS,GAC5B,KAAKA,YAAY,SAAS;EAG5B,IAAI,OAAO;EACX,KAAK,IAAI,IAAI,GAAG,IAAI,KAAKH,OAAO,QAAQ,KAAK;GAC3C,MAAM,MAAM,KAAKC,SAAS;GAC1B,KAAKE,YAAY,KAAK,OAAO,MAAM;GACnC,QAAQ;EACV;EACA,KAAKA,YAAY,KAAKH,OAAO,UAAU;CACzC;CAKA,SAAS,GAAmB;EAC1B,KAAKS,SAAS;EACd,KAAKI,kBAAkB;EACvB,IAAI,IAAI,KAAK,IAAI,KAAK,KAAKb,OAAO,WAAW,GAC3C,OAAO;EAET,IAAI,KAAKA,OAAO,WAAW,GACzB,OAAO,KAAKA,OAAO;EAErB,MAAM,QAAQ,IAAI,KAAKI;EACvB,IAAI,SAAS,KAAKH,SAAS,KAAK,GAC9B,OACE,KAAKK,OACH,IAAI,QAAS,KAAKL,SAAS,MAAO,KAAKD,OAAO,KAAK,KAAKM;EAI9D,MAAM,QAAQ,aACZ,KAAKH,YAAY,SAChB,MAAc,CAAC,KAAKA,YAAY,KAAK,KACxC;EAEA,IAAI,QAAQ,MAAM,KAAKA,YAAY,QAAQ;GACzC,MAAM,KAAK,QAAQ,KAAKA,YAAY,QAAQ;GAC5C,MAAM,KAAK,KAAKA,YAAY,SAAS;GACrC,OAAO,gBACL,KAAKH,OAAO,QAAQ,IACpB,IACA,KAAKA,OAAO,QACZ,EACF;EACF;EAEA,MAAM,KAAK,QAAQ,KAAKI,mBAAmB,KAAKH,SAAS,QAAQ,KAAK;EACtE,MAAM,KAAK,KAAKA,SAAS,QAAQ,KAAK,IAAI;EAE1C,OAAO,gBAAgB,KAAKD,OAAO,GAAG,EAAE,GAAI,IAAI,KAAKO,MAAM,EAAE;CAC/D;;;;CAKA,IAAI,GAAmB;EACrB,KAAKE,SAAS;EACd,KAAKI,kBAAkB;EACvB,QAAQ,KAAKb,OAAO,QAApB;GACE,KAAK,GACH,OAAO;GACT,KAAK,GAAG;IACN,MAAM,QAAQ,KAAKO,OAAO,KAAKD;IAC/B,IAAI,KAAK,KAAKA,MACZ,OAAO;IAET,IAAI,KAAK,KAAKC,MACZ,OAAO;IAET,IAAI,IAAI,KAAKD,QAAQ,OAEnB,OAAO;IAET,QAAQ,IAAI,KAAKA,QAAQ;GAC3B;EACF;EAEA,IAAI,KAAK,KAAKA,MACZ,OAAO;EAET,IAAI,KAAK,KAAKC,MACZ,OAAO;EAET,MAAM,KAAK,KAAKP,OAAO;EAEvB,IAAI,KAAK,IAAI;GACX,IAAI,KAAK,KAAKM,OAAO,GACnB,QACK,IAAI,KAAKA,SAAS,KAAK,KAAKA,QAAS,KAAKL,SAAS,KACtD,KAAKG,mBACL;GAGJ,OAAO;EACT;EAGA,MAAM,KAAK,KAAKJ,OAAO,GAAG,EAAE;EAC5B,IAAI,KAAK,IAAI;GACX,IAAI,KAAKO,OAAO,KAAK,GACnB,OACE,KACG,KAAKA,OAAO,MAAM,KAAKA,OAAO,MAE/B,KAAKN,SAAS,GAAG,EAAE,IACnB,KAAKG,mBACL;GAGN,OAAO;EACT;EAEA,MAAM,QAAQ,aACZ,KAAKJ,OAAO,SAIZ,MAAK,IAAI,KAAKA,OAAO,MAAM,CAC7B;EAEA,MAAM,KAAK,IAAI,KAAKA,OAAO,QAAQ;EACnC,MAAM,KAAK,KAAKA,OAAO,SAAS;EAChC,OACE,gBACE,KAAKG,YAAY,QAAQ,IACzB,IACA,KAAKA,YAAY,QACjB,EACF,IAAI,KAAKC;CAEb;CAEA,aAAa,GAAmB;EAC9B,QACG,KAAK,IACH,KAAK,IAAI,GAAG,KAAK,WAAW,IAAI,KAAK,KAAM,KAAK,cAC/C,KAAK,KAAK,CACd,IACE,KACF;CAEJ;CAEA,oBAAoB,GAAmB;EACrC,OAAQ,KAAK,eAAe,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,KAAM,KAAK;CAC1E;AACF;AA0BA,SAAS,SAAS,QAA+B;CAC/C,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KACjC,IAAI,OAAO,KAAK,OAAO,IAAI,IACzB,OAAO;CAGX,OAAO;AACT;AAEA,SAAS,SAAS,QAA+B;CAC/C,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KACjC,IAAI,OAAO,OAAO,OAAO,IACvB,OAAO;CAGX,OAAO;AACT;AAEA,SAAS,gBACP,IACA,IACA,IACA,IACQ;CACR,IAAI,MAAM,IACR,OAAO,sBAAsB,IAAI,IAAI,IAAI,EAAE;CAE7C,OAAO,sBAAsB,IAAI,IAAI,IAAI,EAAE;AAC7C;AAEA,SAAS,sBACP,IACA,IACA,IACA,IACQ;CACR,MAAM,KAAK,KAAK,KAAK,KAAK,OAAO,KAAK;CACtC,OAAO,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;AACrC;AAEA,SAAS,gBAAgB,MAAc,aAA6B;CAClE,IAAI,SAAS,GACX,OAAO,KAAK,KAAK,WAAW,IAAI;CAElC,OAAO;AACT"}

package/out/z2s/src/compiler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compiler.d.ts","sourceRoot":"","sources":["../../../../z2s/src/compiler.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,gBAAgB,CAAC;AAQ7C,OAAO,EAAC,KAAK,SAAS,EAAC,MAAM,0BAA0B,CAAC;AAExD,OAAO,KAAK,EACV,GAAG,EACH,KAAK,EAEL,kBAAkB,EAElB,WAAW,EAEX,QAAQ,EACR,eAAe,EAEhB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAEL,KAAK,UAAU,EAChB,MAAM,sCAAsC,CAAC;AAC9C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AAC3D,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,uCAAuC,CAAC;AACxE,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,2BAA2B,CAAC;AAUtD,KAAK,KAAK,GAAG;IACX,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,KAAK,eAAe,GAAG;IACrB,KAAK,EAAE,KAAK,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;CACb,CAAC;AAEF,KAAK,UAAU,GAAG;IAChB,MAAM,EAAE,YAAY,CAAC;IAErB,MAAM,EAAE,UAAU,CAAC;CACpB,CAAC;AAEF,MAAM,MAAM,IAAI,GAAG;IACjB,MAAM,EAAE,UAAU,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAQF,wBAAgB,OAAO,CACrB,YAAY,EAAE,YAAY,EAC1B,SAAS,EAAE,MAAM,EACjB,GAAG,EAAE,GAAG,EACR,MAAM,CAAC,EAAE,MAAM,GACd,QAAQ,CAgBV;AAiDD,wBAAgB,KAAK,CACnB,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,QAAQ,EAAE,OAAO,GAAG,SAAS,GAC5B,QAAQ,CAWV;AAUD,wBAAgB,OAAO,CACrB,IAAI,EAAE,IAAI,EACV,OAAO,EAAE,QAAQ,GAAG,SAAS,EAC7B,KAAK,EAAE,KAAK,GACX,QAAQ,CAoBV;AAED,wBAAgB,KAAK,CACnB,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,KAAK,GAAG,SAAS,EACxB,OAAO,EAAE,QAAQ,GAAG,SAAS,EAC7B,KAAK,EAAE,KAAK,GACX,QAAQ,CA4CV;AA2KD,wBAAgB,cAAc,CAC5B,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,SAAS,eAAe,EAAE,EACxC,cAAc,EAAE,SAAS,MAAM,EAAE,GAChC,CAAC,UAAU,EAAE,KAAK,KAAK,QAAQ,CAiBjC;AAED,wBAAgB,MAAM,CACpB,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,KAAK,GACX,QAAQ,CAgCV;AAED,wBAAgB,GAAG,CACjB,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,KAAK,GACX,QAAQ,CAMV;AAED,wBAAgB,YAAY,CAC1B,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,KAAK,GACX,QAAQ,CAIV;AA4ID,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,kBAAkB,GAC/B;IACD,IAAI,EAAE,QAAQ,CAAC;IACf,mBAAmB,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC;CAC/D,CA2BA;AAED,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,kBAAkB,GAC/B;IACD;QACE,KAAK,EAAE,KAAK,CAAC;QACb,WAAW,EAAE,WAAW,CAAC;QACzB,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;KAC3B;IACD;QAAC,KAAK,EAAE,KAAK,CAAC;QAAC,WAAW,EAAE,WAAW,CAAC;QAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAA;KAAC;CACpE,CAsBA;AAyED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,SAAS,CAMhE"}
+{"version":3,"file":"compiler.d.ts","sourceRoot":"","sources":["../../../../z2s/src/compiler.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,gBAAgB,CAAC;AAQ7C,OAAO,EAAC,KAAK,SAAS,EAAC,MAAM,0BAA0B,CAAC;AAExD,OAAO,KAAK,EACV,GAAG,EACH,KAAK,EAEL,kBAAkB,EAElB,WAAW,EAEX,QAAQ,EACR,eAAe,EAEhB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAEL,KAAK,UAAU,EAChB,MAAM,sCAAsC,CAAC;AAC9C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AAC3D,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,uCAAuC,CAAC;AACxE,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,2BAA2B,CAAC;AAUtD,KAAK,KAAK,GAAG;IACX,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,KAAK,eAAe,GAAG;IACrB,KAAK,EAAE,KAAK,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;CACb,CAAC;AAEF,KAAK,UAAU,GAAG;IAChB,MAAM,EAAE,YAAY,CAAC;IAErB,MAAM,EAAE,UAAU,CAAC;CACpB,CAAC;AAEF,MAAM,MAAM,IAAI,GAAG;IACjB,MAAM,EAAE,UAAU,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAQF,wBAAgB,OAAO,CACrB,YAAY,EAAE,YAAY,EAC1B,SAAS,EAAE,MAAM,EACjB,GAAG,EAAE,GAAG,EACR,MAAM,CAAC,EAAE,MAAM,GACd,QAAQ,CAgBV;AAiDD,wBAAgB,KAAK,CACnB,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,QAAQ,EAAE,OAAO,GAAG,SAAS,GAC5B,QAAQ,CAWV;AAUD,wBAAgB,OAAO,CACrB,IAAI,EAAE,IAAI,EACV,OAAO,EAAE,QAAQ,GAAG,SAAS,EAC7B,KAAK,EAAE,KAAK,GACX,QAAQ,CAoBV;AAED,wBAAgB,KAAK,CACnB,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,KAAK,GAAG,SAAS,EACxB,OAAO,EAAE,QAAQ,GAAG,SAAS,EAC7B,KAAK,EAAE,KAAK,GACX,QAAQ,CA4CV;AA2KD,wBAAgB,cAAc,CAC5B,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,SAAS,eAAe,EAAE,EACxC,cAAc,EAAE,SAAS,MAAM,EAAE,GAChC,CAAC,UAAU,EAAE,KAAK,KAAK,QAAQ,CAiBjC;AAED,wBAAgB,MAAM,CACpB,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,KAAK,GACX,QAAQ,CAkDV;AAED,wBAAgB,GAAG,CACjB,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,KAAK,GACX,QAAQ,CAMV;AAED,wBAAgB,YAAY,CAC1B,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,KAAK,GACX,QAAQ,CAIV;AA4ID,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,kBAAkB,GAC/B;IACD,IAAI,EAAE,QAAQ,CAAC;IACf,mBAAmB,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC;CAC/D,CA2BA;AAED,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,kBAAkB,GAC/B;IACD;QACE,KAAK,EAAE,KAAK,CAAC;QACb,WAAW,EAAE,WAAW,CAAC;QACzB,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;KAC3B;IACD;QAAC,KAAK,EAAE,KAAK,CAAC;QAAC,WAAW,EAAE,WAAW,CAAC;QAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAA;KAAC;CACpE,CAsBA;AAyED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,SAAS,CAMhE"}