@tldraw/commenting 0.0.0-bootstrap

package/dist-esm/clustering/runtime.mjs

@@ -0,0 +1,114 @@
+function createClusterRuntime(table) {
+  return new ClusterRuntimeImpl(table);
+}
+class ClusterRuntimeImpl {
+  constructor(table) {
+    this.table = table;
+    this.resetVisible();
+  }
+  table;
+  // mutable internally; readonly through the ClusterRuntime interface
+  k = 0;
+  visible = /* @__PURE__ */ new Map();
+  seeded = false;
+  seed(zoom) {
+    validateZoom(zoom);
+    this.k = seedCount(this.table.events, zoom);
+    this.resetVisible();
+    for (let i = 0; i < this.k; i++) {
+      applyEvent(this.visible, this.table.events[i]);
+    }
+    this.seeded = true;
+  }
+  seedFrom(zoom, previous) {
+    validateZoom(zoom);
+    const ownerByMember = /* @__PURE__ */ new Map();
+    for (const node of previous.values()) {
+      for (const member of node.members) {
+        ownerByMember.set(member, node.id);
+      }
+    }
+    const events = this.table.events;
+    let k = 0;
+    while (k < events.length) {
+      const event = events[k];
+      if (zoom >= event.zSplit) break;
+      if (zoom > event.zMerge && !wasMergedTogether(event.result.members, ownerByMember)) break;
+      k++;
+    }
+    this.k = k;
+    this.resetVisible();
+    for (let i = 0; i < k; i++) {
+      applyEvent(this.visible, events[i]);
+    }
+    this.seeded = true;
+  }
+  onCamera(zoom) {
+    validateZoom(zoom);
+    if (!this.seeded) {
+      throw new Error("Cluster runtime must be seeded before onCamera");
+    }
+    while (this.k < this.table.events.length && zoom <= this.table.events[this.k].zMerge) {
+      applyEvent(this.visible, this.table.events[this.k]);
+      this.k++;
+    }
+    while (this.k > 0 && zoom >= this.table.events[this.k - 1].zSplit) {
+      this.k--;
+      unapplyEvent(this.visible, this.table.events[this.k]);
+    }
+  }
+  getVisible() {
+    return this.visible;
+  }
+  resetVisible() {
+    this.visible = /* @__PURE__ */ new Map();
+    for (const leaf of this.table.leaves) {
+      this.visible.set(leaf.id, leaf);
+    }
+  }
+}
+function wasMergedTogether(members, ownerByMember) {
+  const owner = ownerByMember.get(members[0]);
+  if (owner === void 0) return false;
+  for (let i = 1; i < members.length; i++) {
+    if (ownerByMember.get(members[i]) !== owner) return false;
+  }
+  return true;
+}
+function seedCount(events, zoom) {
+  let lo = 0;
+  let hi = events.length;
+  while (lo < hi) {
+    const mid = lo + hi >> 1;
+    if (zoom <= seedThreshold(events[mid])) {
+      lo = mid + 1;
+    } else {
+      hi = mid;
+    }
+  }
+  return lo;
+}
+function seedThreshold(event) {
+  return Math.sqrt(event.zMerge * event.zSplit);
+}
+function applyEvent(visible, event) {
+  for (const child of event.children) {
+    visible.delete(child.id);
+  }
+  visible.set(event.result.id, event.result);
+}
+function unapplyEvent(visible, event) {
+  visible.delete(event.result.id);
+  for (const child of event.children) {
+    visible.set(child.id, child);
+  }
+}
+function validateZoom(zoom) {
+  if (!Number.isFinite(zoom) || zoom <= 0) {
+    throw new Error("zoom must be finite and greater than 0");
+  }
+}
+export {
+  createClusterRuntime
+};
+//# sourceMappingURL=runtime.mjs.map

package/dist-esm/clustering/runtime.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/clustering/runtime.ts"],
+  "sourcesContent": ["import type { ClusterNode, ClusterTable, MergeEvent } from './types'\n\n/** @public */\nexport interface ClusterRuntime {\n\t/** Events[0..k) are active. Exposed for tests and debugging. */\n\treadonly k: number\n\t/** Reset state from scratch for the given zoom (cold start / after rebuild). */\n\tseed(zoom: number): void\n\t/**\n\t * Reset state for the given zoom, carrying hysteresis state over from a previous partition\n\t * (the visible map of the model being replaced). Threshold-forced events ignore history:\n\t * zoom \\<= zMerge is always active, zoom \\>= zSplit always inactive. An event inside its band\n\t * is active iff its members were merged together in `previous`; a band event with no history\n\t * (e.g. introduced by the rebuild) stays inactive until the next zoom-out crosses its zMerge.\n\t * Active events must form a prefix of the table, so classification stops at the first\n\t * inactive event; later band-active events conservatively resolve to split.\n\t */\n\tseedFrom(zoom: number, previous: ReadonlyMap<string, ClusterNode>): void\n\t/** Advance/retreat the cursor for a camera change. No-op if zoom sits inside all bands. */\n\tonCamera(zoom: number): void\n\t/** The current partition: cluster id \u2192 node. Do not mutate. */\n\tgetVisible(): ReadonlyMap<string, ClusterNode>\n}\n\n/** @public */\nexport function createClusterRuntime(table: ClusterTable): ClusterRuntime {\n\treturn new ClusterRuntimeImpl(table)\n}\n\nclass ClusterRuntimeImpl implements ClusterRuntime {\n\t// mutable internally; readonly through the ClusterRuntime interface\n\tk = 0\n\tprivate visible = new Map<string, ClusterNode>()\n\tprivate seeded = false\n\n\tconstructor(private readonly table: ClusterTable) {\n\t\tthis.resetVisible()\n\t}\n\n\tseed(zoom: number): void {\n\t\tvalidateZoom(zoom)\n\t\tthis.k = seedCount(this.table.events, zoom)\n\t\tthis.resetVisible()\n\t\tfor (let i = 0; i < this.k; i++) {\n\t\t\tapplyEvent(this.visible, this.table.events[i])\n\t\t}\n\t\tthis.seeded = true\n\t}\n\n\tseedFrom(zoom: number, previous: ReadonlyMap<string, ClusterNode>): void {\n\t\tvalidateZoom(zoom)\n\t\tconst ownerByMember = new Map<string, string>()\n\t\tfor (const node of previous.values()) {\n\t\t\tfor (const member of node.members) {\n\t\t\t\townerByMember.set(member, node.id)\n\t\t\t}\n\t\t}\n\n\t\tconst events = this.table.events\n\t\tlet k = 0\n\t\twhile (k < events.length) {\n\t\t\tconst event = events[k]\n\t\t\tif (zoom >= event.zSplit) break\n\t\t\tif (zoom > event.zMerge && !wasMergedTogether(event.result.members, ownerByMember)) break\n\t\t\tk++\n\t\t}\n\n\t\tthis.k = k\n\t\tthis.resetVisible()\n\t\tfor (let i = 0; i < k; i++) {\n\t\t\tapplyEvent(this.visible, events[i])\n\t\t}\n\t\tthis.seeded = true\n\t}\n\n\tonCamera(zoom: number): void {\n\t\tvalidateZoom(zoom)\n\t\tif (!this.seeded) {\n\t\t\tthrow new Error('Cluster runtime must be seeded before onCamera')\n\t\t}\n\n\t\twhile (this.k < this.table.events.length && zoom <= this.table.events[this.k].zMerge) {\n\t\t\tapplyEvent(this.visible, this.table.events[this.k])\n\t\t\tthis.k++\n\t\t}\n\t\twhile (this.k > 0 && zoom >= this.table.events[this.k - 1].zSplit) {\n\t\t\tthis.k--\n\t\t\tunapplyEvent(this.visible, this.table.events[this.k])\n\t\t}\n\t}\n\n\tgetVisible(): ReadonlyMap<string, ClusterNode> {\n\t\treturn this.visible\n\t}\n\n\tprivate resetVisible() {\n\t\tthis.visible = new Map()\n\t\tfor (const leaf of this.table.leaves) {\n\t\t\tthis.visible.set(leaf.id, leaf)\n\t\t}\n\t}\n}\n\n/** True iff every member id belonged to the same node of the previous partition. */\nfunction wasMergedTogether(\n\tmembers: readonly string[],\n\townerByMember: ReadonlyMap<string, string>\n): boolean {\n\tconst owner = ownerByMember.get(members[0])\n\tif (owner === undefined) return false\n\tfor (let i = 1; i < members.length; i++) {\n\t\tif (ownerByMember.get(members[i]) !== owner) return false\n\t}\n\treturn true\n}\n\nfunction seedCount(events: readonly MergeEvent[], zoom: number): number {\n\tlet lo = 0\n\tlet hi = events.length\n\twhile (lo < hi) {\n\t\tconst mid = (lo + hi) >> 1\n\t\tif (zoom <= seedThreshold(events[mid])) {\n\t\t\tlo = mid + 1\n\t\t} else {\n\t\t\thi = mid\n\t\t}\n\t}\n\treturn lo\n}\n\nfunction seedThreshold(event: MergeEvent): number {\n\treturn Math.sqrt(event.zMerge * event.zSplit)\n}\n\nfunction applyEvent(visible: Map<string, ClusterNode>, event: MergeEvent) {\n\tfor (const child of event.children) {\n\t\tvisible.delete(child.id)\n\t}\n\tvisible.set(event.result.id, event.result)\n}\n\nfunction unapplyEvent(visible: Map<string, ClusterNode>, event: MergeEvent) {\n\tvisible.delete(event.result.id)\n\tfor (const child of event.children) {\n\t\tvisible.set(child.id, child)\n\t}\n}\n\nfunction validateZoom(zoom: number) {\n\tif (!Number.isFinite(zoom) || zoom <= 0) {\n\t\tthrow new Error('zoom must be finite and greater than 0')\n\t}\n}\n"],
+  "mappings": "AAyBO,SAAS,qBAAqB,OAAqC;AACzE,SAAO,IAAI,mBAAmB,KAAK;AACpC;AAEA,MAAM,mBAA6C;AAAA,EAMlD,YAA6B,OAAqB;AAArB;AAC5B,SAAK,aAAa;AAAA,EACnB;AAAA,EAF6B;AAAA;AAAA,EAJ7B,IAAI;AAAA,EACI,UAAU,oBAAI,IAAyB;AAAA,EACvC,SAAS;AAAA,EAMjB,KAAK,MAAoB;AACxB,iBAAa,IAAI;AACjB,SAAK,IAAI,UAAU,KAAK,MAAM,QAAQ,IAAI;AAC1C,SAAK,aAAa;AAClB,aAAS,IAAI,GAAG,IAAI,KAAK,GAAG,KAAK;AAChC,iBAAW,KAAK,SAAS,KAAK,MAAM,OAAO,CAAC,CAAC;AAAA,IAC9C;AACA,SAAK,SAAS;AAAA,EACf;AAAA,EAEA,SAAS,MAAc,UAAkD;AACxE,iBAAa,IAAI;AACjB,UAAM,gBAAgB,oBAAI,IAAoB;AAC9C,eAAW,QAAQ,SAAS,OAAO,GAAG;AACrC,iBAAW,UAAU,KAAK,SAAS;AAClC,sBAAc,IAAI,QAAQ,KAAK,EAAE;AAAA,MAClC;AAAA,IACD;AAEA,UAAM,SAAS,KAAK,MAAM;AAC1B,QAAI,IAAI;AACR,WAAO,IAAI,OAAO,QAAQ;AACzB,YAAM,QAAQ,OAAO,CAAC;AACtB,UAAI,QAAQ,MAAM,OAAQ;AAC1B,UAAI,OAAO,MAAM,UAAU,CAAC,kBAAkB,MAAM,OAAO,SAAS,aAAa,EAAG;AACpF;AAAA,IACD;AAEA,SAAK,IAAI;AACT,SAAK,aAAa;AAClB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,iBAAW,KAAK,SAAS,OAAO,CAAC,CAAC;AAAA,IACnC;AACA,SAAK,SAAS;AAAA,EACf;AAAA,EAEA,SAAS,MAAoB;AAC5B,iBAAa,IAAI;AACjB,QAAI,CAAC,KAAK,QAAQ;AACjB,YAAM,IAAI,MAAM,gDAAgD;AAAA,IACjE;AAEA,WAAO,KAAK,IAAI,KAAK,MAAM,OAAO,UAAU,QAAQ,KAAK,MAAM,OAAO,KAAK,CAAC,EAAE,QAAQ;AACrF,iBAAW,KAAK,SAAS,KAAK,MAAM,OAAO,KAAK,CAAC,CAAC;AAClD,WAAK;AAAA,IACN;AACA,WAAO,KAAK,IAAI,KAAK,QAAQ,KAAK,MAAM,OAAO,KAAK,IAAI,CAAC,EAAE,QAAQ;AAClE,WAAK;AACL,mBAAa,KAAK,SAAS,KAAK,MAAM,OAAO,KAAK,CAAC,CAAC;AAAA,IACrD;AAAA,EACD;AAAA,EAEA,aAA+C;AAC9C,WAAO,KAAK;AAAA,EACb;AAAA,EAEQ,eAAe;AACtB,SAAK,UAAU,oBAAI,IAAI;AACvB,eAAW,QAAQ,KAAK,MAAM,QAAQ;AACrC,WAAK,QAAQ,IAAI,KAAK,IAAI,IAAI;AAAA,IAC/B;AAAA,EACD;AACD;AAGA,SAAS,kBACR,SACA,eACU;AACV,QAAM,QAAQ,cAAc,IAAI,QAAQ,CAAC,CAAC;AAC1C,MAAI,UAAU,OAAW,QAAO;AAChC,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACxC,QAAI,cAAc,IAAI,QAAQ,CAAC,CAAC,MAAM,MAAO,QAAO;AAAA,EACrD;AACA,SAAO;AACR;AAEA,SAAS,UAAU,QAA+B,MAAsB;AACvE,MAAI,KAAK;AACT,MAAI,KAAK,OAAO;AAChB,SAAO,KAAK,IAAI;AACf,UAAM,MAAO,KAAK,MAAO;AACzB,QAAI,QAAQ,cAAc,OAAO,GAAG,CAAC,GAAG;AACvC,WAAK,MAAM;AAAA,IACZ,OAAO;AACN,WAAK;AAAA,IACN;AAAA,EACD;AACA,SAAO;AACR;AAEA,SAAS,cAAc,OAA2B;AACjD,SAAO,KAAK,KAAK,MAAM,SAAS,MAAM,MAAM;AAC7C;AAEA,SAAS,WAAW,SAAmC,OAAmB;AACzE,aAAW,SAAS,MAAM,UAAU;AACnC,YAAQ,OAAO,MAAM,EAAE;AAAA,EACxB;AACA,UAAQ,IAAI,MAAM,OAAO,IAAI,MAAM,MAAM;AAC1C;AAEA,SAAS,aAAa,SAAmC,OAAmB;AAC3E,UAAQ,OAAO,MAAM,OAAO,EAAE;AAC9B,aAAW,SAAS,MAAM,UAAU;AACnC,YAAQ,IAAI,MAAM,IAAI,KAAK;AAAA,EAC5B;AACD;AAEA,SAAS,aAAa,MAAc;AACnC,MAAI,CAAC,OAAO,SAAS,IAAI,KAAK,QAAQ,GAAG;AACxC,UAAM,IAAI,MAAM,wCAAwC;AAAA,EACzD;AACD;",
+  "names": []
+}

package/dist-esm/clustering/schedule.mjs

@@ -0,0 +1,150 @@
+function contract(raw, eps) {
+  if (!Number.isFinite(eps) || eps < 0) {
+    throw new Error("eps must be finite and greater than or equal to 0");
+  }
+  const out = [];
+  let i = 0;
+  while (i < raw.length) {
+    const anchor = raw[i].z;
+    let j = i;
+    while (j + 1 < raw.length && raw[j + 1].z >= anchor / (1 + eps)) {
+      j++;
+    }
+    const chains = contractWindow(raw.slice(i, j + 1), anchor);
+    out.push(...chains);
+    i = j + 1;
+  }
+  return out;
+}
+function finalize(events, opts) {
+  validateFinalizeOptions(opts);
+  const r = opts.Tu / opts.Tc;
+  const zMergeCap = opts.maxSplitZoom / r;
+  const out = [];
+  for (const event of events) {
+    const zMerge = Math.min(event.zMerge, zMergeCap);
+    if (zMerge < opts.minZoom) break;
+    let zSplit = zMerge * r;
+    if (zMerge < opts.maxZoom) {
+      zSplit = Math.min(zSplit, opts.maxZoom);
+    }
+    out.push({
+      zMerge,
+      zSplit,
+      children: event.children,
+      result: event.result
+    });
+  }
+  return out;
+}
+function contractWindow(events, zMerge) {
+  const uf = new ComponentUnionFind(events.length);
+  const resultToIndex = /* @__PURE__ */ new Map();
+  for (let i = 0; i < events.length; i++) {
+    resultToIndex.set(events[i].result.id, i);
+  }
+  for (let i = 0; i < events.length; i++) {
+    for (const child of events[i].children) {
+      const producer = resultToIndex.get(child.id);
+      if (producer !== void 0) {
+        uf.union(i, producer);
+      }
+    }
+  }
+  const byRoot = /* @__PURE__ */ new Map();
+  for (let i = 0; i < events.length; i++) {
+    const root = uf.find(i);
+    const list = byRoot.get(root);
+    if (list) {
+      list.push(i);
+    } else {
+      byRoot.set(root, [i]);
+    }
+  }
+  return Array.from(byRoot.values()).map((indices) => contractChain(events, indices, zMerge)).sort((a, b) => compareNodesByMinMember(a.result, b.result));
+}
+function contractChain(events, indices, zMerge) {
+  const produced = /* @__PURE__ */ new Set();
+  const consumedProduced = /* @__PURE__ */ new Set();
+  for (const index of indices) {
+    produced.add(events[index].result.id);
+  }
+  for (const index of indices) {
+    for (const child of events[index].children) {
+      if (produced.has(child.id)) consumedProduced.add(child.id);
+    }
+  }
+  const childrenById = /* @__PURE__ */ new Map();
+  for (const index of indices) {
+    for (const child of events[index].children) {
+      if (!produced.has(child.id)) childrenById.set(child.id, child);
+    }
+  }
+  let result;
+  for (const index of indices) {
+    const candidate = events[index].result;
+    if (!consumedProduced.has(candidate.id)) {
+      if (!result || compareNodesByMinMember(candidate, result) < 0) result = candidate;
+    }
+  }
+  return {
+    zMerge,
+    children: Array.from(childrenById.values()).sort(compareNodesByMinMember),
+    result
+  };
+}
+function validateFinalizeOptions(opts) {
+  if (!Number.isFinite(opts.maxSplitZoom) || opts.maxSplitZoom <= 0) {
+    throw new Error("maxSplitZoom must be finite and greater than 0");
+  }
+  if (!Number.isFinite(opts.Tc) || opts.Tc <= 0) {
+    throw new Error("Tc must be finite and greater than 0");
+  }
+  if (!Number.isFinite(opts.Tu) || opts.Tu <= opts.Tc) {
+    throw new Error("Tu must be finite and greater than Tc");
+  }
+  if (!Number.isFinite(opts.minZoom) || opts.minZoom <= 0) {
+    throw new Error("minZoom must be finite and greater than 0");
+  }
+  if (!Number.isFinite(opts.maxZoom) || opts.maxZoom <= opts.minZoom) {
+    throw new Error("maxZoom must be finite and greater than minZoom");
+  }
+}
+function compareNodesByMinMember(a, b) {
+  const aMin = a.members[0];
+  const bMin = b.members[0];
+  if (aMin < bMin) return -1;
+  if (aMin > bMin) return 1;
+  return 0;
+}
+class ComponentUnionFind {
+  parent;
+  constructor(n) {
+    this.parent = new Int32Array(n);
+    for (let i = 0; i < n; i++) {
+      this.parent[i] = i;
+    }
+  }
+  find(index) {
+    let root = index;
+    while (this.parent[root] !== root) {
+      root = this.parent[root];
+    }
+    while (this.parent[index] !== index) {
+      const next = this.parent[index];
+      this.parent[index] = root;
+      index = next;
+    }
+    return root;
+  }
+  union(a, b) {
+    const rootA = this.find(a);
+    const rootB = this.find(b);
+    if (rootA !== rootB) this.parent[rootB] = rootA;
+  }
+}
+export {
+  contract,
+  finalize
+};
+//# sourceMappingURL=schedule.mjs.map

package/dist-esm/clustering/schedule.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/clustering/schedule.ts"],
+  "sourcesContent": ["import type { ClusterNode, ContractedEvent, MergeEvent, RawMergeEvent } from './types'\n\nexport function contract(raw: readonly RawMergeEvent[], eps: number): ContractedEvent[] {\n\tif (!Number.isFinite(eps) || eps < 0) {\n\t\tthrow new Error('eps must be finite and greater than or equal to 0')\n\t}\n\n\tconst out: ContractedEvent[] = []\n\tlet i = 0\n\twhile (i < raw.length) {\n\t\tconst anchor = raw[i].z\n\t\tlet j = i\n\t\twhile (j + 1 < raw.length && raw[j + 1].z >= anchor / (1 + eps)) {\n\t\t\tj++\n\t\t}\n\n\t\tconst chains = contractWindow(raw.slice(i, j + 1), anchor)\n\t\tout.push(...chains)\n\t\ti = j + 1\n\t}\n\n\treturn out\n}\n\nexport function finalize(\n\tevents: readonly ContractedEvent[],\n\topts: { Tc: number; Tu: number; minZoom: number; maxZoom: number; maxSplitZoom: number }\n): MergeEvent[] {\n\tvalidateFinalizeOptions(opts)\n\n\tconst r = opts.Tu / opts.Tc\n\t// Every cluster must have split by maxSplitZoom, however close (or coincident) its members.\n\t// Capping zMerge at maxSplitZoom / r keeps the whole band below the cap, preserving\n\t// zSplit > zMerge and the table's sort order (min with a constant is order-preserving).\n\tconst zMergeCap = opts.maxSplitZoom / r\n\tconst out: MergeEvent[] = []\n\tfor (const event of events) {\n\t\tconst zMerge = Math.min(event.zMerge, zMergeCap)\n\t\tif (zMerge < opts.minZoom) break\n\t\tlet zSplit = zMerge * r\n\t\tif (zMerge < opts.maxZoom) {\n\t\t\tzSplit = Math.min(zSplit, opts.maxZoom)\n\t\t}\n\t\tout.push({\n\t\t\tzMerge,\n\t\t\tzSplit,\n\t\t\tchildren: event.children,\n\t\t\tresult: event.result,\n\t\t})\n\t}\n\treturn out\n}\n\nfunction contractWindow(events: readonly RawMergeEvent[], zMerge: number): ContractedEvent[] {\n\tconst uf = new ComponentUnionFind(events.length)\n\tconst resultToIndex = new Map<string, number>()\n\tfor (let i = 0; i < events.length; i++) {\n\t\tresultToIndex.set(events[i].result.id, i)\n\t}\n\n\tfor (let i = 0; i < events.length; i++) {\n\t\tfor (const child of events[i].children) {\n\t\t\tconst producer = resultToIndex.get(child.id)\n\t\t\tif (producer !== undefined) {\n\t\t\t\tuf.union(i, producer)\n\t\t\t}\n\t\t}\n\t}\n\n\tconst byRoot = new Map<number, number[]>()\n\tfor (let i = 0; i < events.length; i++) {\n\t\tconst root = uf.find(i)\n\t\tconst list = byRoot.get(root)\n\t\tif (list) {\n\t\t\tlist.push(i)\n\t\t} else {\n\t\t\tbyRoot.set(root, [i])\n\t\t}\n\t}\n\n\treturn Array.from(byRoot.values())\n\t\t.map((indices) => contractChain(events, indices, zMerge))\n\t\t.sort((a, b) => compareNodesByMinMember(a.result, b.result))\n}\n\nfunction contractChain(\n\tevents: readonly RawMergeEvent[],\n\tindices: readonly number[],\n\tzMerge: number\n): ContractedEvent {\n\tconst produced = new Set<string>()\n\tconst consumedProduced = new Set<string>()\n\tfor (const index of indices) {\n\t\tproduced.add(events[index].result.id)\n\t}\n\tfor (const index of indices) {\n\t\tfor (const child of events[index].children) {\n\t\t\tif (produced.has(child.id)) consumedProduced.add(child.id)\n\t\t}\n\t}\n\n\tconst childrenById = new Map<string, ClusterNode>()\n\tfor (const index of indices) {\n\t\tfor (const child of events[index].children) {\n\t\t\tif (!produced.has(child.id)) childrenById.set(child.id, child)\n\t\t}\n\t}\n\n\tlet result: ClusterNode | undefined\n\tfor (const index of indices) {\n\t\tconst candidate = events[index].result\n\t\tif (!consumedProduced.has(candidate.id)) {\n\t\t\tif (!result || compareNodesByMinMember(candidate, result) < 0) result = candidate\n\t\t}\n\t}\n\n\treturn {\n\t\tzMerge,\n\t\tchildren: Array.from(childrenById.values()).sort(compareNodesByMinMember),\n\t\tresult: result!,\n\t}\n}\n\nfunction validateFinalizeOptions(opts: {\n\tTc: number\n\tTu: number\n\tminZoom: number\n\tmaxZoom: number\n\tmaxSplitZoom: number\n}) {\n\tif (!Number.isFinite(opts.maxSplitZoom) || opts.maxSplitZoom <= 0) {\n\t\tthrow new Error('maxSplitZoom must be finite and greater than 0')\n\t}\n\tif (!Number.isFinite(opts.Tc) || opts.Tc <= 0) {\n\t\tthrow new Error('Tc must be finite and greater than 0')\n\t}\n\tif (!Number.isFinite(opts.Tu) || opts.Tu <= opts.Tc) {\n\t\tthrow new Error('Tu must be finite and greater than Tc')\n\t}\n\tif (!Number.isFinite(opts.minZoom) || opts.minZoom <= 0) {\n\t\tthrow new Error('minZoom must be finite and greater than 0')\n\t}\n\tif (!Number.isFinite(opts.maxZoom) || opts.maxZoom <= opts.minZoom) {\n\t\tthrow new Error('maxZoom must be finite and greater than minZoom')\n\t}\n}\n\nfunction compareNodesByMinMember(a: ClusterNode, b: ClusterNode): number {\n\tconst aMin = a.members[0]\n\tconst bMin = b.members[0]\n\tif (aMin < bMin) return -1\n\tif (aMin > bMin) return 1\n\treturn 0\n}\n\nclass ComponentUnionFind {\n\tprivate readonly parent: Int32Array\n\n\tconstructor(n: number) {\n\t\tthis.parent = new Int32Array(n)\n\t\tfor (let i = 0; i < n; i++) {\n\t\t\tthis.parent[i] = i\n\t\t}\n\t}\n\n\tfind(index: number): number {\n\t\tlet root = index\n\t\twhile (this.parent[root] !== root) {\n\t\t\troot = this.parent[root]\n\t\t}\n\t\twhile (this.parent[index] !== index) {\n\t\t\tconst next = this.parent[index]\n\t\t\tthis.parent[index] = root\n\t\t\tindex = next\n\t\t}\n\t\treturn root\n\t}\n\n\tunion(a: number, b: number) {\n\t\tconst rootA = this.find(a)\n\t\tconst rootB = this.find(b)\n\t\tif (rootA !== rootB) this.parent[rootB] = rootA\n\t}\n}\n"],
+  "mappings": "AAEO,SAAS,SAAS,KAA+B,KAAgC;AACvF,MAAI,CAAC,OAAO,SAAS,GAAG,KAAK,MAAM,GAAG;AACrC,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACpE;AAEA,QAAM,MAAyB,CAAC;AAChC,MAAI,IAAI;AACR,SAAO,IAAI,IAAI,QAAQ;AACtB,UAAM,SAAS,IAAI,CAAC,EAAE;AACtB,QAAI,IAAI;AACR,WAAO,IAAI,IAAI,IAAI,UAAU,IAAI,IAAI,CAAC,EAAE,KAAK,UAAU,IAAI,MAAM;AAChE;AAAA,IACD;AAEA,UAAM,SAAS,eAAe,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,MAAM;AACzD,QAAI,KAAK,GAAG,MAAM;AAClB,QAAI,IAAI;AAAA,EACT;AAEA,SAAO;AACR;AAEO,SAAS,SACf,QACA,MACe;AACf,0BAAwB,IAAI;AAE5B,QAAM,IAAI,KAAK,KAAK,KAAK;AAIzB,QAAM,YAAY,KAAK,eAAe;AACtC,QAAM,MAAoB,CAAC;AAC3B,aAAW,SAAS,QAAQ;AAC3B,UAAM,SAAS,KAAK,IAAI,MAAM,QAAQ,SAAS;AAC/C,QAAI,SAAS,KAAK,QAAS;AAC3B,QAAI,SAAS,SAAS;AACtB,QAAI,SAAS,KAAK,SAAS;AAC1B,eAAS,KAAK,IAAI,QAAQ,KAAK,OAAO;AAAA,IACvC;AACA,QAAI,KAAK;AAAA,MACR;AAAA,MACA;AAAA,MACA,UAAU,MAAM;AAAA,MAChB,QAAQ,MAAM;AAAA,IACf,CAAC;AAAA,EACF;AACA,SAAO;AACR;AAEA,SAAS,eAAe,QAAkC,QAAmC;AAC5F,QAAM,KAAK,IAAI,mBAAmB,OAAO,MAAM;AAC/C,QAAM,gBAAgB,oBAAI,IAAoB;AAC9C,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACvC,kBAAc,IAAI,OAAO,CAAC,EAAE,OAAO,IAAI,CAAC;AAAA,EACzC;AAEA,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACvC,eAAW,SAAS,OAAO,CAAC,EAAE,UAAU;AACvC,YAAM,WAAW,cAAc,IAAI,MAAM,EAAE;AAC3C,UAAI,aAAa,QAAW;AAC3B,WAAG,MAAM,GAAG,QAAQ;AAAA,MACrB;AAAA,IACD;AAAA,EACD;AAEA,QAAM,SAAS,oBAAI,IAAsB;AACzC,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACvC,UAAM,OAAO,GAAG,KAAK,CAAC;AACtB,UAAM,OAAO,OAAO,IAAI,IAAI;AAC5B,QAAI,MAAM;AACT,WAAK,KAAK,CAAC;AAAA,IACZ,OAAO;AACN,aAAO,IAAI,MAAM,CAAC,CAAC,CAAC;AAAA,IACrB;AAAA,EACD;AAEA,SAAO,MAAM,KAAK,OAAO,OAAO,CAAC,EAC/B,IAAI,CAAC,YAAY,cAAc,QAAQ,SAAS,MAAM,CAAC,EACvD,KAAK,CAAC,GAAG,MAAM,wBAAwB,EAAE,QAAQ,EAAE,MAAM,CAAC;AAC7D;AAEA,SAAS,cACR,QACA,SACA,QACkB;AAClB,QAAM,WAAW,oBAAI,IAAY;AACjC,QAAM,mBAAmB,oBAAI,IAAY;AACzC,aAAW,SAAS,SAAS;AAC5B,aAAS,IAAI,OAAO,KAAK,EAAE,OAAO,EAAE;AAAA,EACrC;AACA,aAAW,SAAS,SAAS;AAC5B,eAAW,SAAS,OAAO,KAAK,EAAE,UAAU;AAC3C,UAAI,SAAS,IAAI,MAAM,EAAE,EAAG,kBAAiB,IAAI,MAAM,EAAE;AAAA,IAC1D;AAAA,EACD;AAEA,QAAM,eAAe,oBAAI,IAAyB;AAClD,aAAW,SAAS,SAAS;AAC5B,eAAW,SAAS,OAAO,KAAK,EAAE,UAAU;AAC3C,UAAI,CAAC,SAAS,IAAI,MAAM,EAAE,EAAG,cAAa,IAAI,MAAM,IAAI,KAAK;AAAA,IAC9D;AAAA,EACD;AAEA,MAAI;AACJ,aAAW,SAAS,SAAS;AAC5B,UAAM,YAAY,OAAO,KAAK,EAAE;AAChC,QAAI,CAAC,iBAAiB,IAAI,UAAU,EAAE,GAAG;AACxC,UAAI,CAAC,UAAU,wBAAwB,WAAW,MAAM,IAAI,EAAG,UAAS;AAAA,IACzE;AAAA,EACD;AAEA,SAAO;AAAA,IACN;AAAA,IACA,UAAU,MAAM,KAAK,aAAa,OAAO,CAAC,EAAE,KAAK,uBAAuB;AAAA,IACxE;AAAA,EACD;AACD;AAEA,SAAS,wBAAwB,MAM9B;AACF,MAAI,CAAC,OAAO,SAAS,KAAK,YAAY,KAAK,KAAK,gBAAgB,GAAG;AAClE,UAAM,IAAI,MAAM,gDAAgD;AAAA,EACjE;AACA,MAAI,CAAC,OAAO,SAAS,KAAK,EAAE,KAAK,KAAK,MAAM,GAAG;AAC9C,UAAM,IAAI,MAAM,sCAAsC;AAAA,EACvD;AACA,MAAI,CAAC,OAAO,SAAS,KAAK,EAAE,KAAK,KAAK,MAAM,KAAK,IAAI;AACpD,UAAM,IAAI,MAAM,uCAAuC;AAAA,EACxD;AACA,MAAI,CAAC,OAAO,SAAS,KAAK,OAAO,KAAK,KAAK,WAAW,GAAG;AACxD,UAAM,IAAI,MAAM,2CAA2C;AAAA,EAC5D;AACA,MAAI,CAAC,OAAO,SAAS,KAAK,OAAO,KAAK,KAAK,WAAW,KAAK,SAAS;AACnE,UAAM,IAAI,MAAM,iDAAiD;AAAA,EAClE;AACD;AAEA,SAAS,wBAAwB,GAAgB,GAAwB;AACxE,QAAM,OAAO,EAAE,QAAQ,CAAC;AACxB,QAAM,OAAO,EAAE,QAAQ,CAAC;AACxB,MAAI,OAAO,KAAM,QAAO;AACxB,MAAI,OAAO,KAAM,QAAO;AACxB,SAAO;AACR;AAEA,MAAM,mBAAmB;AAAA,EACP;AAAA,EAEjB,YAAY,GAAW;AACtB,SAAK,SAAS,IAAI,WAAW,CAAC;AAC9B,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,WAAK,OAAO,CAAC,IAAI;AAAA,IAClB;AAAA,EACD;AAAA,EAEA,KAAK,OAAuB;AAC3B,QAAI,OAAO;AACX,WAAO,KAAK,OAAO,IAAI,MAAM,MAAM;AAClC,aAAO,KAAK,OAAO,IAAI;AAAA,IACxB;AACA,WAAO,KAAK,OAAO,KAAK,MAAM,OAAO;AACpC,YAAM,OAAO,KAAK,OAAO,KAAK;AAC9B,WAAK,OAAO,KAAK,IAAI;AACrB,cAAQ;AAAA,IACT;AACA,WAAO;AAAA,EACR;AAAA,EAEA,MAAM,GAAW,GAAW;AAC3B,UAAM,QAAQ,KAAK,KAAK,CAAC;AACzB,UAAM,QAAQ,KAAK,KAAK,CAAC;AACzB,QAAI,UAAU,MAAO,MAAK,OAAO,KAAK,IAAI;AAAA,EAC3C;AACD;",
+  "names": []
+}

package/dist-esm/clustering/types.mjs

@@ -0,0 +1 @@
+//# sourceMappingURL=types.mjs.map

package/dist-esm/clustering/types.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": [],
+  "sourcesContent": [],
+  "mappings": "",
+  "names": []
+}