@tldraw/commenting 0.0.0-bootstrap

package/dist-cjs/canvas/rich-text.js

@@ -0,0 +1,28 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var rich_text_exports = {};
+__export(rich_text_exports, {
+  richTextToPlaintext: () => richTextToPlaintext
+});
+module.exports = __toCommonJS(rich_text_exports);
+var import_comment_render = require("./comment-render");
+function richTextToPlaintext(body, resolveName) {
+  return (0, import_comment_render.renderCommentPlaintext)(body, resolveName);
+}
+//# sourceMappingURL=rich-text.js.map

package/dist-cjs/canvas/rich-text.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/canvas/rich-text.ts"],
+  "sourcesContent": ["import { TLRichText } from 'tldraw'\nimport { renderCommentPlaintext } from './comment-render'\n\n/**\n * Flatten a rich-text comment body to plaintext through the limited comment extension set,\n * separating paragraphs and list items with newlines. A convenience for consumers rendering bodies\n * as plain text (e.g. the sidebar preview); richer rendering can read the `TLRichText` directly.\n * @public\n */\nexport function richTextToPlaintext(\n\tbody: TLRichText,\n\tresolveName?: (id: string) => string | undefined\n): string {\n\treturn renderCommentPlaintext(body, resolveName)\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AACA,4BAAuC;AAQhC,SAAS,oBACf,MACA,aACS;AACT,aAAO,8CAAuB,MAAM,WAAW;AAChD;",
+  "names": []
+}

package/dist-cjs/canvas/sidebar-filters.js

@@ -0,0 +1,30 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var sidebar_filters_exports = {};
+__export(sidebar_filters_exports, {
+  DEFAULT_SIDEBAR_FILTERS: () => DEFAULT_SIDEBAR_FILTERS
+});
+module.exports = __toCommonJS(sidebar_filters_exports);
+const DEFAULT_SIDEBAR_FILTERS = {
+  showResolved: true,
+  onlyMine: false,
+  onlyUnread: false,
+  onlyCurrentPage: true
+};
+//# sourceMappingURL=sidebar-filters.js.map

package/dist-cjs/canvas/sidebar-filters.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/canvas/sidebar-filters.ts"],
+  "sourcesContent": ["/**\n * Which threads the comments sidebar shows. Held as an editor-scoped signal (the `sidebarFilters`\n * `EditorAtom` in `./state`) rather than component state so it survives the sidebar\n * unmounting when the comment tool deactivates \u2014 a user's \"hide resolved\" choice shouldn't reset\n * every time they leave the tool.\n * @public\n */\nexport interface SidebarFilters {\n\t/** Include resolved threads. */\n\tshowResolved: boolean\n\t/** Only threads the current user started. Ignored when there's no current user. */\n\tonlyMine: boolean\n\t/** Only threads with unread comments. Ignored when the host provides no read status. */\n\tonlyUnread: boolean\n\t/** Only threads on the current page. Off = every page's threads, each labelled. */\n\tonlyCurrentPage: boolean\n}\n\n/** @public */\nexport const DEFAULT_SIDEBAR_FILTERS: SidebarFilters = {\n\tshowResolved: true,\n\tonlyMine: false,\n\tonlyUnread: false,\n\tonlyCurrentPage: true,\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAmBO,MAAM,0BAA0C;AAAA,EACtD,cAAc;AAAA,EACd,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,iBAAiB;AAClB;",
+  "names": []
+}

package/dist-cjs/canvas/state.js

@@ -0,0 +1,76 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var state_exports = {};
+__export(state_exports, {
+  commentsHidden: () => commentsHidden,
+  commitCommentMutation: () => commitCommentMutation,
+  openThreadId: () => openThreadId,
+  pendingComment: () => pendingComment,
+  regionDraft: () => regionDraft,
+  sidebarFilters: () => sidebarFilters,
+  toggleCommentsHidden: () => toggleCommentsHidden,
+  useCommentsHidden: () => useCommentsHidden,
+  useOpenThreadId: () => useOpenThreadId,
+  usePendingComment: () => usePendingComment,
+  useSidebarFilters: () => useSidebarFilters
+});
+module.exports = __toCommonJS(state_exports);
+var import_tldraw = require("tldraw");
+var import_options = require("./options");
+var import_sidebar_filters = require("./sidebar-filters");
+const openThreadId = new import_tldraw.EditorAtom("openThreadId", () => null);
+const pendingComment = new import_tldraw.EditorAtom("pendingComment", () => null);
+const regionDraft = new import_tldraw.EditorAtom("regionDraft", () => null);
+const commentsHidden = new import_tldraw.EditorAtom("commentsHidden", () => false);
+const sidebarFilters = new import_tldraw.EditorAtom(
+  "sidebarFilters",
+  () => import_sidebar_filters.DEFAULT_SIDEBAR_FILTERS
+);
+function toggleCommentsHidden(editor) {
+  commentsHidden.update(editor, (hidden) => !hidden);
+}
+function useOpenThreadId() {
+  const editor = (0, import_tldraw.useEditor)();
+  return (0, import_tldraw.useValue)("open thread id", () => openThreadId.get(editor), [editor]);
+}
+function usePendingComment() {
+  const editor = (0, import_tldraw.useEditor)();
+  return (0, import_tldraw.useValue)("pending comment", () => pendingComment.get(editor), [editor]);
+}
+function useCommentsHidden() {
+  const editor = (0, import_tldraw.useEditor)();
+  return (0, import_tldraw.useValue)("comments hidden", () => commentsHidden.get(editor), [editor]);
+}
+function useSidebarFilters() {
+  const editor = (0, import_tldraw.useEditor)();
+  return (0, import_tldraw.useValue)("sidebar filters", () => sidebarFilters.get(editor), [editor]);
+}
+function commitCommentMutation(editor, fn, kind = "mutation") {
+  const options = (0, import_options.getCommentingOptions)(editor);
+  const history = kind === "drag" ? options.dragHistory ?? options.history : options.history;
+  let result;
+  editor.run(
+    () => {
+      result = fn();
+    },
+    { history }
+  );
+  return result;
+}
+//# sourceMappingURL=state.js.map

package/dist-cjs/canvas/state.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/canvas/state.ts"],
+  "sourcesContent": ["import {\n\tEditorAtom,\n\ttype BoxModel,\n\ttype Editor,\n\ttype TLHistoryBatchOptions,\n\tuseEditor,\n\tuseValue,\n} from 'tldraw'\nimport type { PendingComment } from './comment-tool'\nimport { getCommentingOptions } from './options'\nimport { DEFAULT_SIDEBAR_FILTERS, type SidebarFilters } from './sidebar-filters'\n\n/**\n * Transient commenting UI state, scoped per editor via {@link EditorAtom}. Editor-scoping (rather\n * than module-global atoms) keeps two editors on one page \u2014 or an editor and a second instance \u2014\n * from sharing open-thread, visibility, and filter state. Reachable from both React (`useEditor()`)\n * and the comment tool (`this.editor`).\n */\n\n/** The id of the one open thread (only one popover is open at a time), or null when all closed.\n * @public */\nexport const openThreadId = new EditorAtom<string | null>('openThreadId', () => null)\n\n/** The comment currently being placed (composer open, not yet posted), or null.\n * @public */\nexport const pendingComment = new EditorAtom<PendingComment | null>('pendingComment', () => null)\n\n/** The region rectangle being dragged out right now (page coords), or null when not dragging. The\n *  comment tool writes it on each move; the overlay reads it to draw the live dashed box. */\nexport const regionDraft = new EditorAtom<BoxModel | null>('regionDraft', () => null)\n\n/**\n * Whether comment pins are hidden on the canvas. Governs the on-canvas layer (pins + open popover)\n * only \u2014 the sidebar is unaffected.\n * @public\n */\nexport const commentsHidden = new EditorAtom<boolean>('commentsHidden', () => false)\n\n/** Which threads the comments sidebar shows.\n * @public */\nexport const sidebarFilters = new EditorAtom<SidebarFilters>(\n\t'sidebarFilters',\n\t() => DEFAULT_SIDEBAR_FILTERS\n)\n\n/** Toggle comment-pin visibility for an editor.\n * @public */\nexport function toggleCommentsHidden(editor: Editor): void {\n\tcommentsHidden.update(editor, (hidden) => !hidden)\n}\n\n/** React hook for the open thread id.\n * @public */\nexport function useOpenThreadId(): string | null {\n\tconst editor = useEditor()\n\treturn useValue('open thread id', () => openThreadId.get(editor), [editor])\n}\n\n/** React hook for the pending (being-placed) comment.\n * @public */\nexport function usePendingComment(): PendingComment | null {\n\tconst editor = useEditor()\n\treturn useValue('pending comment', () => pendingComment.get(editor), [editor])\n}\n\n/** React hook for whether comment pins are hidden.\n * @public */\nexport function useCommentsHidden(): boolean {\n\tconst editor = useEditor()\n\treturn useValue('comments hidden', () => commentsHidden.get(editor), [editor])\n}\n\n/** React hook for the current sidebar filters.\n * @public */\nexport function useSidebarFilters(): SidebarFilters {\n\tconst editor = useEditor()\n\treturn useValue('sidebar filters', () => sidebarFilters.get(editor), [editor])\n}\n\n/**\n * Commit a comment mutation with the configured undo/redo behavior. All comment writes go through\n * here so the {@link CommentingOptions.history} option (and {@link CommentingOptions.dragHistory}\n * for pin re-anchors) governs whether they land on the undo stack. Defaults to `'ignore'`.\n * @public\n */\nexport function commitCommentMutation<T>(\n\teditor: Editor,\n\tfn: () => T,\n\tkind: 'mutation' | 'drag' = 'mutation'\n): T {\n\tconst options = getCommentingOptions(editor)\n\tconst history: TLHistoryBatchOptions['history'] =\n\t\tkind === 'drag' ? (options.dragHistory ?? options.history) : options.history\n\tlet result: T\n\teditor.run(\n\t\t() => {\n\t\t\tresult = fn()\n\t\t},\n\t\t{ history }\n\t)\n\treturn result!\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,oBAOO;AAEP,qBAAqC;AACrC,6BAA6D;AAWtD,MAAM,eAAe,IAAI,yBAA0B,gBAAgB,MAAM,IAAI;AAI7E,MAAM,iBAAiB,IAAI,yBAAkC,kBAAkB,MAAM,IAAI;AAIzF,MAAM,cAAc,IAAI,yBAA4B,eAAe,MAAM,IAAI;AAO7E,MAAM,iBAAiB,IAAI,yBAAoB,kBAAkB,MAAM,KAAK;AAI5E,MAAM,iBAAiB,IAAI;AAAA,EACjC;AAAA,EACA,MAAM;AACP;AAIO,SAAS,qBAAqB,QAAsB;AAC1D,iBAAe,OAAO,QAAQ,CAAC,WAAW,CAAC,MAAM;AAClD;AAIO,SAAS,kBAAiC;AAChD,QAAM,aAAS,yBAAU;AACzB,aAAO,wBAAS,kBAAkB,MAAM,aAAa,IAAI,MAAM,GAAG,CAAC,MAAM,CAAC;AAC3E;AAIO,SAAS,oBAA2C;AAC1D,QAAM,aAAS,yBAAU;AACzB,aAAO,wBAAS,mBAAmB,MAAM,eAAe,IAAI,MAAM,GAAG,CAAC,MAAM,CAAC;AAC9E;AAIO,SAAS,oBAA6B;AAC5C,QAAM,aAAS,yBAAU;AACzB,aAAO,wBAAS,mBAAmB,MAAM,eAAe,IAAI,MAAM,GAAG,CAAC,MAAM,CAAC;AAC9E;AAIO,SAAS,oBAAoC;AACnD,QAAM,aAAS,yBAAU;AACzB,aAAO,wBAAS,mBAAmB,MAAM,eAAe,IAAI,MAAM,GAAG,CAAC,MAAM,CAAC;AAC9E;AAQO,SAAS,sBACf,QACA,IACA,OAA4B,YACxB;AACJ,QAAM,cAAU,qCAAqB,MAAM;AAC3C,QAAM,UACL,SAAS,SAAU,QAAQ,eAAe,QAAQ,UAAW,QAAQ;AACtE,MAAI;AACJ,SAAO;AAAA,IACN,MAAM;AACL,eAAS,GAAG;AAAA,IACb;AAAA,IACA,EAAE,QAAQ;AAAA,EACX;AACA,SAAO;AACR;",
+  "names": []
+}

package/dist-cjs/canvas/thread-state.js

@@ -0,0 +1,81 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var thread_state_exports = {};
+__export(thread_state_exports, {
+  DEFAULT_IMPRECISE_SHAPE_ANCHOR: () => DEFAULT_IMPRECISE_SHAPE_ANCHOR,
+  REGION_PIN_CORNER: () => REGION_PIN_CORNER,
+  anchorPagePoint: () => anchorPagePoint,
+  focusThread: () => focusThread,
+  regionPinPoint: () => regionPinPoint,
+  shapeAnchorAt: () => shapeAnchorAt
+});
+module.exports = __toCommonJS(thread_state_exports);
+var import_region_options = require("./region-options");
+var import_state = require("./state");
+const DEFAULT_IMPRECISE_SHAPE_ANCHOR = { x: 1, y: 0 };
+const REGION_PIN_CORNER = { x: 1, y: 1 };
+function regionPinPoint(region, corner = REGION_PIN_CORNER) {
+  return {
+    x: region.x + corner.x * region.w,
+    y: region.y + corner.y * region.h
+  };
+}
+function anchorPagePoint(editor, anchor, impreciseShapeAnchor = DEFAULT_IMPRECISE_SHAPE_ANCHOR) {
+  switch (anchor.type) {
+    case "shape": {
+      const bounds = editor.getShapePageBounds(anchor.shapeId);
+      if (!bounds) return null;
+      const { x, y } = anchor.isPrecise ? anchor : impreciseShapeAnchor;
+      return { x: bounds.minX + x * bounds.w, y: bounds.minY + y * bounds.h };
+    }
+    case "text-range": {
+      const bounds = editor.getShapePageBounds(anchor.shapeId);
+      if (!bounds) return null;
+      return { x: bounds.maxX, y: bounds.minY };
+    }
+    case "point":
+      return { x: anchor.x, y: anchor.y };
+    case "region":
+      return regionPinPoint(anchor, (0, import_region_options.getRegionCommentOptions)(editor).pinCorner);
+    case "page":
+      return null;
+  }
+}
+function shapeAnchorAt(editor, shapeId, page, precise) {
+  const bounds = editor.getShapePageBounds(shapeId);
+  if (!bounds || bounds.w === 0 || bounds.h === 0) {
+    return { type: "shape", shapeId, x: 0.5, y: 0.5, isPrecise: precise };
+  }
+  return {
+    type: "shape",
+    shapeId,
+    x: (page.x - bounds.minX) / bounds.w,
+    y: (page.y - bounds.minY) / bounds.h,
+    isPrecise: precise
+  };
+}
+function focusThread(editor, thread, impreciseShapeAnchor) {
+  if (thread.pageId !== editor.getCurrentPageId()) {
+    editor.setCurrentPage(thread.pageId);
+  }
+  import_state.openThreadId.set(editor, thread.id);
+  const point = anchorPagePoint(editor, thread.anchor, impreciseShapeAnchor);
+  if (point) editor.centerOnPoint(point, { animation: { duration: 200 } });
+}
+//# sourceMappingURL=thread-state.js.map

package/dist-cjs/canvas/thread-state.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/canvas/thread-state.ts"],
+  "sourcesContent": ["import { BoxModel, Editor, TLCommentAnchor, TLCommentThread, TLShapeId, VecLike } from 'tldraw'\nimport { getRegionCommentOptions } from './region-options'\nimport { openThreadId } from './state'\n\n/** Where an imprecise shape comment sits by default: the shape's top-right corner. Overridable. @public */\nexport const DEFAULT_IMPRECISE_SHAPE_ANCHOR = { x: 1, y: 0 }\n\n/** The default corner a region's pin and composer sit on, as a normalized 0\u20131 offset (bottom-right).\n *  Overridable per editor via region options; pin position, composer placement, region move, and\n *  which corner has no resize handle all derive from the chosen corner. */\nexport const REGION_PIN_CORNER: VecLike = { x: 1, y: 1 }\n\n/** The page point of a region's pin corner. */\nexport function regionPinPoint(region: BoxModel, corner: VecLike = REGION_PIN_CORNER): VecLike {\n\treturn {\n\t\tx: region.x + corner.x * region.w,\n\t\ty: region.y + corner.y * region.h,\n\t}\n}\n\n/**\n * Where a thread's pin sits on the page, for each anchor kind. Null hides the pin. For imprecise\n * shape anchors the pin uses `impreciseShapeAnchor` (a normalized 0\u20131 spot, top-right by default)\n * rather than the stored `x`/`y`.\n * @public\n */\nexport function anchorPagePoint(\n\teditor: Editor,\n\tanchor: TLCommentAnchor,\n\timpreciseShapeAnchor: { x: number; y: number } = DEFAULT_IMPRECISE_SHAPE_ANCHOR\n): { x: number; y: number } | null {\n\tswitch (anchor.type) {\n\t\tcase 'shape': {\n\t\t\tconst bounds = editor.getShapePageBounds(anchor.shapeId as TLShapeId)\n\t\t\tif (!bounds) return null\n\t\t\t// Precise pins sit at their stored x/y; imprecise ones at the consumer's default spot.\n\t\t\tconst { x, y } = anchor.isPrecise ? anchor : impreciseShapeAnchor\n\t\t\treturn { x: bounds.minX + x * bounds.w, y: bounds.minY + y * bounds.h }\n\t\t}\n\t\tcase 'text-range': {\n\t\t\tconst bounds = editor.getShapePageBounds(anchor.shapeId as TLShapeId)\n\t\t\tif (!bounds) return null\n\t\t\treturn { x: bounds.maxX, y: bounds.minY }\n\t\t}\n\t\tcase 'point':\n\t\t\treturn { x: anchor.x, y: anchor.y }\n\t\tcase 'region':\n\t\t\treturn regionPinPoint(anchor, getRegionCommentOptions(editor).pinCorner)\n\t\tcase 'page':\n\t\t\treturn null\n\t}\n}\n\n/**\n * A shape anchor for a page point. `x`/`y` are the point's normalized (0\u20131) offset within the\n * shape's page bounds, remembered either way. When `precise` (Alt held) the pin sits at exactly\n * `x`/`y`; otherwise it sits at the consumer's imprecise default (top-right out of the box).\n * @public\n */\nexport function shapeAnchorAt(\n\teditor: Editor,\n\tshapeId: TLShapeId,\n\tpage: { x: number; y: number },\n\tprecise: boolean\n): TLCommentAnchor {\n\tconst bounds = editor.getShapePageBounds(shapeId)\n\tif (!bounds || bounds.w === 0 || bounds.h === 0) {\n\t\treturn { type: 'shape', shapeId, x: 0.5, y: 0.5, isPrecise: precise }\n\t}\n\treturn {\n\t\ttype: 'shape',\n\t\tshapeId,\n\t\tx: (page.x - bounds.minX) / bounds.w,\n\t\ty: (page.y - bounds.minY) / bounds.h,\n\t\tisPrecise: precise,\n\t}\n}\n\n/** Open a thread and bring it into view \u2014 switch to its page if needed, then center its pin. @public */\nexport function focusThread(\n\teditor: Editor,\n\tthread: TLCommentThread,\n\timpreciseShapeAnchor?: { x: number; y: number }\n): void {\n\tif (thread.pageId !== editor.getCurrentPageId()) {\n\t\teditor.setCurrentPage(thread.pageId as any)\n\t}\n\topenThreadId.set(editor, thread.id)\n\tconst point = anchorPagePoint(editor, thread.anchor, impreciseShapeAnchor)\n\tif (point) editor.centerOnPoint(point, { animation: { duration: 200 } })\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AACA,4BAAwC;AACxC,mBAA6B;AAGtB,MAAM,iCAAiC,EAAE,GAAG,GAAG,GAAG,EAAE;AAKpD,MAAM,oBAA6B,EAAE,GAAG,GAAG,GAAG,EAAE;AAGhD,SAAS,eAAe,QAAkB,SAAkB,mBAA4B;AAC9F,SAAO;AAAA,IACN,GAAG,OAAO,IAAI,OAAO,IAAI,OAAO;AAAA,IAChC,GAAG,OAAO,IAAI,OAAO,IAAI,OAAO;AAAA,EACjC;AACD;AAQO,SAAS,gBACf,QACA,QACA,uBAAiD,gCACf;AAClC,UAAQ,OAAO,MAAM;AAAA,IACpB,KAAK,SAAS;AACb,YAAM,SAAS,OAAO,mBAAmB,OAAO,OAAoB;AACpE,UAAI,CAAC,OAAQ,QAAO;AAEpB,YAAM,EAAE,GAAG,EAAE,IAAI,OAAO,YAAY,SAAS;AAC7C,aAAO,EAAE,GAAG,OAAO,OAAO,IAAI,OAAO,GAAG,GAAG,OAAO,OAAO,IAAI,OAAO,EAAE;AAAA,IACvE;AAAA,IACA,KAAK,cAAc;AAClB,YAAM,SAAS,OAAO,mBAAmB,OAAO,OAAoB;AACpE,UAAI,CAAC,OAAQ,QAAO;AACpB,aAAO,EAAE,GAAG,OAAO,MAAM,GAAG,OAAO,KAAK;AAAA,IACzC;AAAA,IACA,KAAK;AACJ,aAAO,EAAE,GAAG,OAAO,GAAG,GAAG,OAAO,EAAE;AAAA,IACnC,KAAK;AACJ,aAAO,eAAe,YAAQ,+CAAwB,MAAM,EAAE,SAAS;AAAA,IACxE,KAAK;AACJ,aAAO;AAAA,EACT;AACD;AAQO,SAAS,cACf,QACA,SACA,MACA,SACkB;AAClB,QAAM,SAAS,OAAO,mBAAmB,OAAO;AAChD,MAAI,CAAC,UAAU,OAAO,MAAM,KAAK,OAAO,MAAM,GAAG;AAChD,WAAO,EAAE,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK,WAAW,QAAQ;AAAA,EACrE;AACA,SAAO;AAAA,IACN,MAAM;AAAA,IACN;AAAA,IACA,IAAI,KAAK,IAAI,OAAO,QAAQ,OAAO;AAAA,IACnC,IAAI,KAAK,IAAI,OAAO,QAAQ,OAAO;AAAA,IACnC,WAAW;AAAA,EACZ;AACD;AAGO,SAAS,YACf,QACA,QACA,sBACO;AACP,MAAI,OAAO,WAAW,OAAO,iBAAiB,GAAG;AAChD,WAAO,eAAe,OAAO,MAAa;AAAA,EAC3C;AACA,4BAAa,IAAI,QAAQ,OAAO,EAAE;AAClC,QAAM,QAAQ,gBAAgB,QAAQ,OAAO,QAAQ,oBAAoB;AACzE,MAAI,MAAO,QAAO,cAAc,OAAO,EAAE,WAAW,EAAE,UAAU,IAAI,EAAE,CAAC;AACxE;",
+  "names": []
+}

package/dist-cjs/clustering/computeClusterTable.js

@@ -0,0 +1,83 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var computeClusterTable_exports = {};
+__export(computeClusterTable_exports, {
+  computeClusterTable: () => computeClusterTable
+});
+module.exports = __toCommonJS(computeClusterTable_exports);
+var import_mst = require("./mst");
+var import_replay = require("./replay");
+var import_schedule = require("./schedule");
+function computeClusterTable(leaves, options) {
+  const opts = resolveOptions(options);
+  const leafNodes = leaves.map(leafToNode);
+  const edges = (0, import_mst.mstEdges)(leaves);
+  if (leaves.length < 2) {
+    return { events: [], leaves: leafNodes };
+  }
+  const raw = (0, import_replay.cappedReplay)(leaves, edges, { Tc: opts.Tc, Dmax: opts.Dmax });
+  const contracted = (0, import_schedule.contract)(raw, opts.eps);
+  const events = (0, import_schedule.finalize)(contracted, {
+    Tc: opts.Tc,
+    Tu: opts.Tu,
+    minZoom: opts.minZoom,
+    maxZoom: opts.maxZoom,
+    maxSplitZoom: opts.maxSplitZoom
+  });
+  return { events, leaves: leafNodes };
+}
+function resolveOptions(options) {
+  const Tc = options.Tc ?? 40;
+  const Tu = options.Tu ?? 1.5 * Tc;
+  const eps = options.eps ?? 0.12;
+  const Dmax = options.Dmax ?? 3 * Tc;
+  const maxSplitZoom = options.maxSplitZoom ?? 6;
+  const { minZoom, maxZoom } = options;
+  if (!Number.isFinite(Tc) || Tc <= 0) {
+    throw new Error("Tc must be finite and greater than 0");
+  }
+  if (!Number.isFinite(Tu) || Tu <= Tc) {
+    throw new Error("Tu must be finite and greater than Tc");
+  }
+  if (!Number.isFinite(eps) || eps < 0) {
+    throw new Error("eps must be finite and greater than or equal to 0");
+  }
+  if (!Number.isFinite(Dmax) || Dmax < Tc) {
+    throw new Error("Dmax must be finite and greater than or equal to Tc");
+  }
+  if (!Number.isFinite(minZoom) || minZoom <= 0) {
+    throw new Error("minZoom must be finite and greater than 0");
+  }
+  if (!Number.isFinite(maxZoom) || maxZoom <= minZoom) {
+    throw new Error("maxZoom must be finite and greater than minZoom");
+  }
+  if (!Number.isFinite(maxSplitZoom) || maxSplitZoom <= 0) {
+    throw new Error("maxSplitZoom must be finite and greater than 0");
+  }
+  return { Tc, Tu, eps, Dmax, minZoom, maxZoom, maxSplitZoom };
+}
+function leafToNode(leaf) {
+  return {
+    id: leaf.id,
+    centroid: { x: leaf.point.x, y: leaf.point.y },
+    count: 1,
+    members: [leaf.id]
+  };
+}
+//# sourceMappingURL=computeClusterTable.js.map

package/dist-cjs/clustering/computeClusterTable.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/clustering/computeClusterTable.ts"],
+  "sourcesContent": ["import { mstEdges } from './mst'\nimport { cappedReplay } from './replay'\nimport { contract, finalize } from './schedule'\nimport type { ClusterNode, ClusterOptions, ClusterTable, LeafInput } from './types'\n\ninterface ResolvedClusterOptions {\n\tTc: number\n\tTu: number\n\teps: number\n\tDmax: number\n\tminZoom: number\n\tmaxZoom: number\n\tmaxSplitZoom: number\n}\n\n/** @public */\nexport function computeClusterTable(\n\tleaves: readonly LeafInput[],\n\toptions: ClusterOptions\n): ClusterTable {\n\tconst opts = resolveOptions(options)\n\tconst leafNodes = leaves.map(leafToNode)\n\tconst edges = mstEdges(leaves)\n\n\tif (leaves.length < 2) {\n\t\treturn { events: [], leaves: leafNodes }\n\t}\n\n\tconst raw = cappedReplay(leaves, edges, { Tc: opts.Tc, Dmax: opts.Dmax })\n\tconst contracted = contract(raw, opts.eps)\n\tconst events = finalize(contracted, {\n\t\tTc: opts.Tc,\n\t\tTu: opts.Tu,\n\t\tminZoom: opts.minZoom,\n\t\tmaxZoom: opts.maxZoom,\n\t\tmaxSplitZoom: opts.maxSplitZoom,\n\t})\n\n\treturn { events, leaves: leafNodes }\n}\n\nfunction resolveOptions(options: ClusterOptions): ResolvedClusterOptions {\n\tconst Tc = options.Tc ?? 40\n\tconst Tu = options.Tu ?? 1.5 * Tc\n\tconst eps = options.eps ?? 0.12\n\tconst Dmax = options.Dmax ?? 3 * Tc\n\tconst maxSplitZoom = options.maxSplitZoom ?? 6\n\tconst { minZoom, maxZoom } = options\n\n\tif (!Number.isFinite(Tc) || Tc <= 0) {\n\t\tthrow new Error('Tc must be finite and greater than 0')\n\t}\n\tif (!Number.isFinite(Tu) || Tu <= Tc) {\n\t\tthrow new Error('Tu must be finite and greater than Tc')\n\t}\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\tif (!Number.isFinite(Dmax) || Dmax < Tc) {\n\t\tthrow new Error('Dmax must be finite and greater than or equal to Tc')\n\t}\n\tif (!Number.isFinite(minZoom) || minZoom <= 0) {\n\t\tthrow new Error('minZoom must be finite and greater than 0')\n\t}\n\tif (!Number.isFinite(maxZoom) || maxZoom <= minZoom) {\n\t\tthrow new Error('maxZoom must be finite and greater than minZoom')\n\t}\n\tif (!Number.isFinite(maxSplitZoom) || maxSplitZoom <= 0) {\n\t\tthrow new Error('maxSplitZoom must be finite and greater than 0')\n\t}\n\n\treturn { Tc, Tu, eps, Dmax, minZoom, maxZoom, maxSplitZoom }\n}\n\nfunction leafToNode(leaf: LeafInput): ClusterNode {\n\treturn {\n\t\tid: leaf.id,\n\t\tcentroid: { x: leaf.point.x, y: leaf.point.y },\n\t\tcount: 1,\n\t\tmembers: [leaf.id],\n\t}\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAAyB;AACzB,oBAA6B;AAC7B,sBAAmC;AAc5B,SAAS,oBACf,QACA,SACe;AACf,QAAM,OAAO,eAAe,OAAO;AACnC,QAAM,YAAY,OAAO,IAAI,UAAU;AACvC,QAAM,YAAQ,qBAAS,MAAM;AAE7B,MAAI,OAAO,SAAS,GAAG;AACtB,WAAO,EAAE,QAAQ,CAAC,GAAG,QAAQ,UAAU;AAAA,EACxC;AAEA,QAAM,UAAM,4BAAa,QAAQ,OAAO,EAAE,IAAI,KAAK,IAAI,MAAM,KAAK,KAAK,CAAC;AACxE,QAAM,iBAAa,0BAAS,KAAK,KAAK,GAAG;AACzC,QAAM,aAAS,0BAAS,YAAY;AAAA,IACnC,IAAI,KAAK;AAAA,IACT,IAAI,KAAK;AAAA,IACT,SAAS,KAAK;AAAA,IACd,SAAS,KAAK;AAAA,IACd,cAAc,KAAK;AAAA,EACpB,CAAC;AAED,SAAO,EAAE,QAAQ,QAAQ,UAAU;AACpC;AAEA,SAAS,eAAe,SAAiD;AACxE,QAAM,KAAK,QAAQ,MAAM;AACzB,QAAM,KAAK,QAAQ,MAAM,MAAM;AAC/B,QAAM,MAAM,QAAQ,OAAO;AAC3B,QAAM,OAAO,QAAQ,QAAQ,IAAI;AACjC,QAAM,eAAe,QAAQ,gBAAgB;AAC7C,QAAM,EAAE,SAAS,QAAQ,IAAI;AAE7B,MAAI,CAAC,OAAO,SAAS,EAAE,KAAK,MAAM,GAAG;AACpC,UAAM,IAAI,MAAM,sCAAsC;AAAA,EACvD;AACA,MAAI,CAAC,OAAO,SAAS,EAAE,KAAK,MAAM,IAAI;AACrC,UAAM,IAAI,MAAM,uCAAuC;AAAA,EACxD;AACA,MAAI,CAAC,OAAO,SAAS,GAAG,KAAK,MAAM,GAAG;AACrC,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACpE;AACA,MAAI,CAAC,OAAO,SAAS,IAAI,KAAK,OAAO,IAAI;AACxC,UAAM,IAAI,MAAM,qDAAqD;AAAA,EACtE;AACA,MAAI,CAAC,OAAO,SAAS,OAAO,KAAK,WAAW,GAAG;AAC9C,UAAM,IAAI,MAAM,2CAA2C;AAAA,EAC5D;AACA,MAAI,CAAC,OAAO,SAAS,OAAO,KAAK,WAAW,SAAS;AACpD,UAAM,IAAI,MAAM,iDAAiD;AAAA,EAClE;AACA,MAAI,CAAC,OAAO,SAAS,YAAY,KAAK,gBAAgB,GAAG;AACxD,UAAM,IAAI,MAAM,gDAAgD;AAAA,EACjE;AAEA,SAAO,EAAE,IAAI,IAAI,KAAK,MAAM,SAAS,SAAS,aAAa;AAC5D;AAEA,SAAS,WAAW,MAA8B;AACjD,SAAO;AAAA,IACN,IAAI,KAAK;AAAA,IACT,UAAU,EAAE,GAAG,KAAK,MAAM,GAAG,GAAG,KAAK,MAAM,EAAE;AAAA,IAC7C,OAAO;AAAA,IACP,SAAS,CAAC,KAAK,EAAE;AAAA,EAClB;AACD;",
+  "names": []
+}

package/dist-cjs/clustering/mst.js

@@ -0,0 +1,117 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var mst_exports = {};
+__export(mst_exports, {
+  mstEdges: () => mstEdges
+});
+module.exports = __toCommonJS(mst_exports);
+function mstEdges(leaves) {
+  const n = leaves.length;
+  const ids = new Array(n);
+  const xs = new Float64Array(n);
+  const ys = new Float64Array(n);
+  const seen = /* @__PURE__ */ new Set();
+  let root = 0;
+  for (let i = 0; i < n; i++) {
+    const leaf = leaves[i];
+    if (seen.has(leaf.id)) {
+      throw new Error(`Duplicate leaf id: ${leaf.id}`);
+    }
+    seen.add(leaf.id);
+    if (!Number.isFinite(leaf.point.x) || !Number.isFinite(leaf.point.y)) {
+      throw new Error(`Non-finite coordinate for leaf id: ${leaf.id}`);
+    }
+    ids[i] = leaf.id;
+    xs[i] = leaf.point.x;
+    ys[i] = leaf.point.y;
+    if (i > 0 && leaf.id < ids[root]) root = i;
+  }
+  if (n < 2) return [];
+  const inTree = new Uint8Array(n);
+  const bestD2 = new Float64Array(n);
+  const bestFrom = new Int32Array(n);
+  inTree[root] = 1;
+  bestD2.fill(Number.POSITIVE_INFINITY);
+  bestFrom.fill(-1);
+  for (let i = 0; i < n; i++) {
+    if (i === root) continue;
+    bestD2[i] = squaredDistance(xs, ys, root, i);
+    bestFrom[i] = root;
+  }
+  const edges = [];
+  for (let edgeCount = 0; edgeCount < n - 1; edgeCount++) {
+    let next = -1;
+    for (let i = 0; i < n; i++) {
+      if (inTree[i]) continue;
+      if (next === -1 || edgeKeyLess(bestD2[i], bestFrom[i], i, bestD2[next], bestFrom[next], next, ids)) {
+        next = i;
+      }
+    }
+    const from = bestFrom[next];
+    edges.push(createOutputEdge(xs, ys, ids, from, next));
+    inTree[next] = 1;
+    for (let i = 0; i < n; i++) {
+      if (inTree[i]) continue;
+      const d2 = squaredDistance(xs, ys, next, i);
+      if (edgeKeyLess(d2, next, i, bestD2[i], bestFrom[i], i, ids)) {
+        bestD2[i] = d2;
+        bestFrom[i] = next;
+      }
+    }
+  }
+  edges.sort((a, b) => outputEdgeCompare(a, b, leaves));
+  return edges;
+}
+function squaredDistance(xs, ys, a, b) {
+  const dx = xs[a] - xs[b];
+  const dy = ys[a] - ys[b];
+  return dx * dx + dy * dy;
+}
+function edgeKeyLess(d2A, a0, a1, d2B, b0, b1, ids) {
+  if (d2A !== d2B) return d2A < d2B;
+  const aLo = ids[a0] < ids[a1] ? ids[a0] : ids[a1];
+  const aHi = ids[a0] < ids[a1] ? ids[a1] : ids[a0];
+  const bLo = ids[b0] < ids[b1] ? ids[b0] : ids[b1];
+  const bHi = ids[b0] < ids[b1] ? ids[b1] : ids[b0];
+  if (aLo !== bLo) return aLo < bLo;
+  return aHi < bHi;
+}
+function createOutputEdge(xs, ys, ids, i, j) {
+  const a = ids[i] < ids[j] ? i : j;
+  const b = ids[i] < ids[j] ? j : i;
+  return {
+    a,
+    b,
+    d: Math.hypot(xs[a] - xs[b], ys[a] - ys[b])
+  };
+}
+function outputEdgeCompare(a, b, leaves) {
+  if (a.d < b.d) return -1;
+  if (a.d > b.d) return 1;
+  const aLo = leaves[a.a].id;
+  const aHi = leaves[a.b].id;
+  const bLo = leaves[b.a].id;
+  const bHi = leaves[b.b].id;
+  if (aLo < bLo) return -1;
+  if (aLo > bLo) return 1;
+  if (aHi < bHi) return -1;
+  if (aHi > bHi) return 1;
+  return 0;
+}
+//# sourceMappingURL=mst.js.map

package/dist-cjs/clustering/mst.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/clustering/mst.ts"],
+  "sourcesContent": ["import type { LeafInput, MstEdge } from './types'\n\n/**\n * Return the Euclidean MST over the leaves, ordered by the canonical edge key:\n * distance, then normalized endpoint ids.\n */\nexport function mstEdges(leaves: readonly LeafInput[]): MstEdge[] {\n\tconst n = leaves.length\n\tconst ids = new Array<string>(n)\n\tconst xs = new Float64Array(n)\n\tconst ys = new Float64Array(n)\n\tconst seen = new Set<string>()\n\n\tlet root = 0\n\tfor (let i = 0; i < n; i++) {\n\t\tconst leaf = leaves[i]\n\t\tif (seen.has(leaf.id)) {\n\t\t\tthrow new Error(`Duplicate leaf id: ${leaf.id}`)\n\t\t}\n\t\tseen.add(leaf.id)\n\t\tif (!Number.isFinite(leaf.point.x) || !Number.isFinite(leaf.point.y)) {\n\t\t\tthrow new Error(`Non-finite coordinate for leaf id: ${leaf.id}`)\n\t\t}\n\t\tids[i] = leaf.id\n\t\txs[i] = leaf.point.x\n\t\tys[i] = leaf.point.y\n\t\tif (i > 0 && leaf.id < ids[root]) root = i\n\t}\n\n\tif (n < 2) return []\n\n\tconst inTree = new Uint8Array(n)\n\tconst bestD2 = new Float64Array(n)\n\tconst bestFrom = new Int32Array(n)\n\n\tinTree[root] = 1\n\tbestD2.fill(Number.POSITIVE_INFINITY)\n\tbestFrom.fill(-1)\n\n\tfor (let i = 0; i < n; i++) {\n\t\tif (i === root) continue\n\t\tbestD2[i] = squaredDistance(xs, ys, root, i)\n\t\tbestFrom[i] = root\n\t}\n\n\tconst edges: MstEdge[] = []\n\n\tfor (let edgeCount = 0; edgeCount < n - 1; edgeCount++) {\n\t\tlet next = -1\n\t\tfor (let i = 0; i < n; i++) {\n\t\t\tif (inTree[i]) continue\n\t\t\tif (\n\t\t\t\tnext === -1 ||\n\t\t\t\tedgeKeyLess(bestD2[i], bestFrom[i], i, bestD2[next], bestFrom[next], next, ids)\n\t\t\t) {\n\t\t\t\tnext = i\n\t\t\t}\n\t\t}\n\n\t\tconst from = bestFrom[next]\n\t\tedges.push(createOutputEdge(xs, ys, ids, from, next))\n\t\tinTree[next] = 1\n\n\t\tfor (let i = 0; i < n; i++) {\n\t\t\tif (inTree[i]) continue\n\t\t\tconst d2 = squaredDistance(xs, ys, next, i)\n\t\t\tif (edgeKeyLess(d2, next, i, bestD2[i], bestFrom[i], i, ids)) {\n\t\t\t\tbestD2[i] = d2\n\t\t\t\tbestFrom[i] = next\n\t\t\t}\n\t\t}\n\t}\n\n\tedges.sort((a, b) => outputEdgeCompare(a, b, leaves))\n\treturn edges\n}\n\nfunction squaredDistance(xs: Float64Array, ys: Float64Array, a: number, b: number): number {\n\tconst dx = xs[a] - xs[b]\n\tconst dy = ys[a] - ys[b]\n\treturn dx * dx + dy * dy\n}\n\nfunction edgeKeyLess(\n\td2A: number,\n\ta0: number,\n\ta1: number,\n\td2B: number,\n\tb0: number,\n\tb1: number,\n\tids: readonly string[]\n): boolean {\n\tif (d2A !== d2B) return d2A < d2B\n\n\tconst aLo = ids[a0] < ids[a1] ? ids[a0] : ids[a1]\n\tconst aHi = ids[a0] < ids[a1] ? ids[a1] : ids[a0]\n\tconst bLo = ids[b0] < ids[b1] ? ids[b0] : ids[b1]\n\tconst bHi = ids[b0] < ids[b1] ? ids[b1] : ids[b0]\n\n\tif (aLo !== bLo) return aLo < bLo\n\treturn aHi < bHi\n}\n\nfunction createOutputEdge(\n\txs: Float64Array,\n\tys: Float64Array,\n\tids: readonly string[],\n\ti: number,\n\tj: number\n): MstEdge {\n\tconst a = ids[i] < ids[j] ? i : j\n\tconst b = ids[i] < ids[j] ? j : i\n\treturn {\n\t\ta,\n\t\tb,\n\t\td: Math.hypot(xs[a] - xs[b], ys[a] - ys[b]),\n\t}\n}\n\nfunction outputEdgeCompare(a: MstEdge, b: MstEdge, leaves: readonly LeafInput[]): number {\n\tif (a.d < b.d) return -1\n\tif (a.d > b.d) return 1\n\n\tconst aLo = leaves[a.a].id\n\tconst aHi = leaves[a.b].id\n\tconst bLo = leaves[b.a].id\n\tconst bHi = leaves[b.b].id\n\n\tif (aLo < bLo) return -1\n\tif (aLo > bLo) return 1\n\tif (aHi < bHi) return -1\n\tif (aHi > bHi) return 1\n\treturn 0\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAMO,SAAS,SAAS,QAAyC;AACjE,QAAM,IAAI,OAAO;AACjB,QAAM,MAAM,IAAI,MAAc,CAAC;AAC/B,QAAM,KAAK,IAAI,aAAa,CAAC;AAC7B,QAAM,KAAK,IAAI,aAAa,CAAC;AAC7B,QAAM,OAAO,oBAAI,IAAY;AAE7B,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,UAAM,OAAO,OAAO,CAAC;AACrB,QAAI,KAAK,IAAI,KAAK,EAAE,GAAG;AACtB,YAAM,IAAI,MAAM,sBAAsB,KAAK,EAAE,EAAE;AAAA,IAChD;AACA,SAAK,IAAI,KAAK,EAAE;AAChB,QAAI,CAAC,OAAO,SAAS,KAAK,MAAM,CAAC,KAAK,CAAC,OAAO,SAAS,KAAK,MAAM,CAAC,GAAG;AACrE,YAAM,IAAI,MAAM,sCAAsC,KAAK,EAAE,EAAE;AAAA,IAChE;AACA,QAAI,CAAC,IAAI,KAAK;AACd,OAAG,CAAC,IAAI,KAAK,MAAM;AACnB,OAAG,CAAC,IAAI,KAAK,MAAM;AACnB,QAAI,IAAI,KAAK,KAAK,KAAK,IAAI,IAAI,EAAG,QAAO;AAAA,EAC1C;AAEA,MAAI,IAAI,EAAG,QAAO,CAAC;AAEnB,QAAM,SAAS,IAAI,WAAW,CAAC;AAC/B,QAAM,SAAS,IAAI,aAAa,CAAC;AACjC,QAAM,WAAW,IAAI,WAAW,CAAC;AAEjC,SAAO,IAAI,IAAI;AACf,SAAO,KAAK,OAAO,iBAAiB;AACpC,WAAS,KAAK,EAAE;AAEhB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,QAAI,MAAM,KAAM;AAChB,WAAO,CAAC,IAAI,gBAAgB,IAAI,IAAI,MAAM,CAAC;AAC3C,aAAS,CAAC,IAAI;AAAA,EACf;AAEA,QAAM,QAAmB,CAAC;AAE1B,WAAS,YAAY,GAAG,YAAY,IAAI,GAAG,aAAa;AACvD,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,UAAI,OAAO,CAAC,EAAG;AACf,UACC,SAAS,MACT,YAAY,OAAO,CAAC,GAAG,SAAS,CAAC,GAAG,GAAG,OAAO,IAAI,GAAG,SAAS,IAAI,GAAG,MAAM,GAAG,GAC7E;AACD,eAAO;AAAA,MACR;AAAA,IACD;AAEA,UAAM,OAAO,SAAS,IAAI;AAC1B,UAAM,KAAK,iBAAiB,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC;AACpD,WAAO,IAAI,IAAI;AAEf,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,UAAI,OAAO,CAAC,EAAG;AACf,YAAM,KAAK,gBAAgB,IAAI,IAAI,MAAM,CAAC;AAC1C,UAAI,YAAY,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,SAAS,CAAC,GAAG,GAAG,GAAG,GAAG;AAC7D,eAAO,CAAC,IAAI;AACZ,iBAAS,CAAC,IAAI;AAAA,MACf;AAAA,IACD;AAAA,EACD;AAEA,QAAM,KAAK,CAAC,GAAG,MAAM,kBAAkB,GAAG,GAAG,MAAM,CAAC;AACpD,SAAO;AACR;AAEA,SAAS,gBAAgB,IAAkB,IAAkB,GAAW,GAAmB;AAC1F,QAAM,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC;AACvB,QAAM,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC;AACvB,SAAO,KAAK,KAAK,KAAK;AACvB;AAEA,SAAS,YACR,KACA,IACA,IACA,KACA,IACA,IACA,KACU;AACV,MAAI,QAAQ,IAAK,QAAO,MAAM;AAE9B,QAAM,MAAM,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE;AAChD,QAAM,MAAM,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE;AAChD,QAAM,MAAM,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE;AAChD,QAAM,MAAM,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE;AAEhD,MAAI,QAAQ,IAAK,QAAO,MAAM;AAC9B,SAAO,MAAM;AACd;AAEA,SAAS,iBACR,IACA,IACA,KACA,GACA,GACU;AACV,QAAM,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI;AAChC,QAAM,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI;AAChC,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,GAAG,KAAK,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;AAAA,EAC3C;AACD;AAEA,SAAS,kBAAkB,GAAY,GAAY,QAAsC;AACxF,MAAI,EAAE,IAAI,EAAE,EAAG,QAAO;AACtB,MAAI,EAAE,IAAI,EAAE,EAAG,QAAO;AAEtB,QAAM,MAAM,OAAO,EAAE,CAAC,EAAE;AACxB,QAAM,MAAM,OAAO,EAAE,CAAC,EAAE;AACxB,QAAM,MAAM,OAAO,EAAE,CAAC,EAAE;AACxB,QAAM,MAAM,OAAO,EAAE,CAAC,EAAE;AAExB,MAAI,MAAM,IAAK,QAAO;AACtB,MAAI,MAAM,IAAK,QAAO;AACtB,MAAI,MAAM,IAAK,QAAO;AACtB,MAAI,MAAM,IAAK,QAAO;AACtB,SAAO;AACR;",
+  "names": []
+}