graphein 0.20.0 → 0.22.0

package/dist/interaction/veil.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Focus veils — the dependency-free half of hover focus. A veil is a
+ * translucent wash of the chart background painted on the interaction layer
+ * over a plot area, receding every mark beneath it; a cutout veil leaves the
+ * hovered mark's own shape unveiled so it stays at full strength.
+ */
+import type { Rect } from '../types.js';
+/** Veil opacity at full focus: unfocused marks keep roughly 40% of their ink. */
+export declare const FOCUS_VEIL = 0.6;
+/** Whether hover focus is on for a spec. `tooltip: { focus: false }` opts out, and
+ * hand-drawn (sketch) charts keep their classic highlight because rough marks
+ * can't be repainted stroke-for-stroke. */
+export declare function hoverFocusEnabled(spec: {
+    tooltip?: unknown;
+    sketch?: unknown;
+}): boolean;
+/** Recede `rect` behind a veil of `color` at `strength` (0..1). */
+export declare function paintFocusVeil(ctx: CanvasRenderingContext2D, rect: Rect, color: string, strength: number): void;
+/**
+ * Recede `rect` behind a veil everywhere except inside the shape `trace` adds
+ * to the current path — the hovered mark stays untouched at full strength, so
+ * charts with bespoke mark geometry get focus without repainting anything.
+ */
+export declare function paintCutoutVeil(ctx: CanvasRenderingContext2D, rect: Rect, color: string, strength: number, trace: (ctx: CanvasRenderingContext2D) => void): void;
+//# sourceMappingURL=veil.d.ts.map

package/dist/interaction/veil.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"veil.d.ts","sourceRoot":"","sources":["../../src/interaction/veil.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,UAAU,CAAC;AAErC,iFAAiF;AACjF,eAAO,MAAM,UAAU,MAAM,CAAC;AAE9B;;2CAE2C;AAC3C,wBAAgB,iBAAiB,CAAC,IAAI,EAAE;IAAE,OAAO,CAAC,EAAE,OAAO,CAAC;IAAC,MAAM,CAAC,EAAE,OAAO,CAAA;CAAE,GAAG,OAAO,CAIxF;AAED,mEAAmE;AACnE,wBAAgB,cAAc,CAAC,GAAG,EAAE,wBAAwB,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAO/G;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,wBAAwB,EAC7B,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,CAAC,GAAG,EAAE,wBAAwB,KAAK,IAAI,GAC7C,IAAI,CAeN"}

package/dist/interaction/veil.js

@@ -0,0 +1,35 @@
+const FOCUS_VEIL = 0.6;
+function hoverFocusEnabled(spec) {
+  if (spec.sketch) return false;
+  const tooltip = spec.tooltip;
+  return !(tooltip && typeof tooltip === "object" && tooltip.focus === false);
+}
+function paintFocusVeil(ctx, rect, color, strength) {
+  if (!(strength > 0)) return;
+  ctx.save();
+  ctx.globalAlpha = Math.min(1, strength);
+  ctx.fillStyle = color;
+  ctx.fillRect(rect.x, rect.y, rect.width, rect.height);
+  ctx.restore();
+}
+function paintCutoutVeil(ctx, rect, color, strength, trace) {
+  if (!(strength > 0)) return;
+  ctx.save();
+  ctx.beginPath();
+  ctx.rect(rect.x, rect.y, rect.width, rect.height);
+  ctx.clip();
+  ctx.globalAlpha = Math.min(1, strength);
+  ctx.fillStyle = color;
+  ctx.beginPath();
+  ctx.rect(rect.x, rect.y, rect.width, rect.height);
+  trace(ctx);
+  ctx.fill("evenodd");
+  ctx.restore();
+}
+export {
+  FOCUS_VEIL,
+  hoverFocusEnabled,
+  paintCutoutVeil,
+  paintFocusVeil
+};
+//# sourceMappingURL=veil.js.map

package/dist/interaction/veil.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/interaction/veil.ts"],
+  "sourcesContent": ["/**\n * Focus veils \u2014 the dependency-free half of hover focus. A veil is a\n * translucent wash of the chart background painted on the interaction layer\n * over a plot area, receding every mark beneath it; a cutout veil leaves the\n * hovered mark's own shape unveiled so it stays at full strength.\n */\n\nimport type { Rect } from '../types';\n\n/** Veil opacity at full focus: unfocused marks keep roughly 40% of their ink. */\nexport const FOCUS_VEIL = 0.6;\n\n/** Whether hover focus is on for a spec. `tooltip: { focus: false }` opts out, and\n * hand-drawn (sketch) charts keep their classic highlight because rough marks\n * can't be repainted stroke-for-stroke. */\nexport function hoverFocusEnabled(spec: { tooltip?: unknown; sketch?: unknown }): boolean {\n  if (spec.sketch) return false;\n  const tooltip = spec.tooltip;\n  return !(tooltip && typeof tooltip === 'object' && (tooltip as { focus?: unknown }).focus === false);\n}\n\n/** Recede `rect` behind a veil of `color` at `strength` (0..1). */\nexport function paintFocusVeil(ctx: CanvasRenderingContext2D, rect: Rect, color: string, strength: number): void {\n  if (!(strength > 0)) return;\n  ctx.save();\n  ctx.globalAlpha = Math.min(1, strength);\n  ctx.fillStyle = color;\n  ctx.fillRect(rect.x, rect.y, rect.width, rect.height);\n  ctx.restore();\n}\n\n/**\n * Recede `rect` behind a veil everywhere except inside the shape `trace` adds\n * to the current path \u2014 the hovered mark stays untouched at full strength, so\n * charts with bespoke mark geometry get focus without repainting anything.\n */\nexport function paintCutoutVeil(\n  ctx: CanvasRenderingContext2D,\n  rect: Rect,\n  color: string,\n  strength: number,\n  trace: (ctx: CanvasRenderingContext2D) => void,\n): void {\n  if (!(strength > 0)) return;\n  ctx.save();\n  // Clip to the veil: a cutout reaching past it (say, a bar cut off by a fixed\n  // domain) must not flip into painted area under the even-odd rule.\n  ctx.beginPath();\n  ctx.rect(rect.x, rect.y, rect.width, rect.height);\n  ctx.clip();\n  ctx.globalAlpha = Math.min(1, strength);\n  ctx.fillStyle = color;\n  ctx.beginPath();\n  ctx.rect(rect.x, rect.y, rect.width, rect.height);\n  trace(ctx);\n  ctx.fill('evenodd');\n  ctx.restore();\n}\n"],
+  "mappings": "AAUO,MAAM,aAAa;AAKnB,SAAS,kBAAkB,MAAwD;AACxF,MAAI,KAAK,OAAQ,QAAO;AACxB,QAAM,UAAU,KAAK;AACrB,SAAO,EAAE,WAAW,OAAO,YAAY,YAAa,QAAgC,UAAU;AAChG;AAGO,SAAS,eAAe,KAA+B,MAAY,OAAe,UAAwB;AAC/G,MAAI,EAAE,WAAW,GAAI;AACrB,MAAI,KAAK;AACT,MAAI,cAAc,KAAK,IAAI,GAAG,QAAQ;AACtC,MAAI,YAAY;AAChB,MAAI,SAAS,KAAK,GAAG,KAAK,GAAG,KAAK,OAAO,KAAK,MAAM;AACpD,MAAI,QAAQ;AACd;AAOO,SAAS,gBACd,KACA,MACA,OACA,UACA,OACM;AACN,MAAI,EAAE,WAAW,GAAI;AACrB,MAAI,KAAK;AAGT,MAAI,UAAU;AACd,MAAI,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,OAAO,KAAK,MAAM;AAChD,MAAI,KAAK;AACT,MAAI,cAAc,KAAK,IAAI,GAAG,QAAQ;AACtC,MAAI,YAAY;AAChB,MAAI,UAAU;AACd,MAAI,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,OAAO,KAAK,MAAM;AAChD,QAAM,GAAG;AACT,MAAI,KAAK,SAAS;AAClB,MAAI,QAAQ;AACd;",
+  "names": []
+}

package/dist/pivot/pivot.d.ts

@@ -58,4 +58,22 @@ export declare function resolveValueRef(ref: number | {
 } | undefined, data: readonly Datum[]): number | null;
 export declare function groupBy<T extends Record<string, unknown>>(rows: T[], keyFields: string[]): GroupedMap<T>;
 export declare function pivot(data: Datum[], options: PivotOptions): PivotResult;
+/** One distinct prefix path of an axis, in first-seen order (id 0 is the empty path). */
+export interface PivotAxisEntry {
+    id: number;
+    parent: number;
+    depth: number;
+    key: string;
+    /** The first raw value seen for this key (keeps real types such as dates). */
+    value: unknown;
+}
+/** Aggregates for every (row prefix × column prefix) path, built in one pass over the data. */
+export interface PivotCube {
+    valueAt(rowPath: string[], colPath: string[], valueIndex: number): number | null;
+    /** Same as {@link valueAt} for interned path ids from {@link rowAxis}/{@link columnAxis}. */
+    valueAtIds(rowId: number, colId: number, valueIndex: number): number | null;
+    readonly rowAxis: readonly PivotAxisEntry[];
+    readonly columnAxis: readonly PivotAxisEntry[];
+}
+export declare function buildPivotCube(data: Datum[], rowFields: string[], columnFields: string[], values: PivotValueDef[]): PivotCube;
 //# sourceMappingURL=pivot.d.ts.map

package/dist/pivot/pivot.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"pivot.d.ts","sourceRoot":"","sources":["../../src/pivot/pivot.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAItC,MAAM,MAAM,KAAK,GACb,KAAK,GACL,MAAM,GACN,KAAK,GACL,KAAK,GACL,KAAK,GACL,OAAO,GACP,eAAe,GACf,QAAQ,GACR,OAAO,GACP,MAAM,CAAC;AAEX,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,EAAE,EAAE,KAAK,CAAC;IACV,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,MAAM,EAAE,aAAa,EAAE,CAAC;IACxB,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,IAAI,CAAC,EAAE,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;CAChC;AAED,MAAM,WAAW,eAAe;IAC9B,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,eAAe,EAAE,CAAC;IAC5B,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,SAAS;IACxB,MAAM,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;CAC3B;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,gBAAgB,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;CAC1C;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,eAAe,EAAE,CAAC;IAC3B,UAAU,EAAE,eAAe,EAAE,CAAC;IAC9B,YAAY,EAAE,eAAe,EAAE,CAAC;IAChC,IAAI,EAAE,YAAY,EAAE,CAAC;IACrB,MAAM,EAAE,aAAa,EAAE,CAAC;IACxB,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;CAClF;AAED,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAM7D,wBAAgB,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,KAAK,GAAG,MAAM,GAAG,IAAI,CAwD3E;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,MAAM,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,KAAK,CAAA;CAAE,GAAG,SAAS,EAC9D,IAAI,EAAE,SAAS,KAAK,EAAE,GACrB,MAAM,GAAG,IAAI,CAQf;AAED,wBAAgB,OAAO,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACvD,IAAI,EAAE,CAAC,EAAE,EACT,SAAS,EAAE,MAAM,EAAE,GAClB,UAAU,CAAC,CAAC,CAAC,CA6Bf;AAED,wBAAgB,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,YAAY,GAAG,WAAW,CA+BvE"}
+{"version":3,"file":"pivot.d.ts","sourceRoot":"","sources":["../../src/pivot/pivot.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAItC,MAAM,MAAM,KAAK,GACb,KAAK,GACL,MAAM,GACN,KAAK,GACL,KAAK,GACL,KAAK,GACL,OAAO,GACP,eAAe,GACf,QAAQ,GACR,OAAO,GACP,MAAM,CAAC;AAEX,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,EAAE,EAAE,KAAK,CAAC;IACV,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,MAAM,EAAE,aAAa,EAAE,CAAC;IACxB,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,IAAI,CAAC,EAAE,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;CAChC;AAED,MAAM,WAAW,eAAe;IAC9B,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,eAAe,EAAE,CAAC;IAC5B,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,SAAS;IACxB,MAAM,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;CAC3B;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,gBAAgB,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;CAC1C;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,eAAe,EAAE,CAAC;IAC3B,UAAU,EAAE,eAAe,EAAE,CAAC;IAC9B,YAAY,EAAE,eAAe,EAAE,CAAC;IAChC,IAAI,EAAE,YAAY,EAAE,CAAC;IACrB,MAAM,EAAE,aAAa,EAAE,CAAC;IACxB,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;CAClF;AAED,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAM7D,wBAAgB,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,KAAK,GAAG,MAAM,GAAG,IAAI,CAwD3E;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,MAAM,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,KAAK,CAAA;CAAE,GAAG,SAAS,EAC9D,IAAI,EAAE,SAAS,KAAK,EAAE,GACrB,MAAM,GAAG,IAAI,CAQf;AAED,wBAAgB,OAAO,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACvD,IAAI,EAAE,CAAC,EAAE,EACT,SAAS,EAAE,MAAM,EAAE,GAClB,UAAU,CAAC,CAAC,CAAC,CA6Bf;AAED,wBAAgB,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,YAAY,GAAG,WAAW,CA+BvE;AAuND,yFAAyF;AACzF,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,8EAA8E;IAC9E,KAAK,EAAE,OAAO,CAAC;CAChB;AAED,+FAA+F;AAC/F,MAAM,WAAW,SAAS;IACxB,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;IACjF,6FAA6F;IAC7F,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;IAC5E,QAAQ,CAAC,OAAO,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,QAAQ,CAAC,UAAU,EAAE,SAAS,cAAc,EAAE,CAAC;CAChD;AAsED,wBAAgB,cAAc,CAC5B,IAAI,EAAE,KAAK,EAAE,EACb,SAAS,EAAE,MAAM,EAAE,EACnB,YAAY,EAAE,MAAM,EAAE,EACtB,MAAM,EAAE,aAAa,EAAE,GACtB,SAAS,CAiFX"}

package/dist/pivot/pivot.js

@@ -260,6 +260,7 @@ class AxisPathInterner {
     __publicField(this, "children", /* @__PURE__ */ new Map());
     __publicField(this, "nextKeyId", 1);
     __publicField(this, "nextPathId", 1);
+    __publicField(this, "entries", []);
     this.keyIds = fields.map(() => /* @__PURE__ */ new Map());
   }
   keyId(depth, key, create) {
@@ -271,7 +272,7 @@ class AxisPathInterner {
     }
     return id ?? -1;
   }
-  child(parentId, keyId, create) {
+  child(parentId, keyId, create, depth = 0, key = "", value) {
     let children = this.children.get(parentId);
     if (!children) {
       if (!create) return -1;
@@ -282,6 +283,7 @@ class AxisPathInterner {
     if (id === void 0 && create) {
       id = this.nextPathId++;
       children.set(keyId, id);
+      this.entries.push({ id, parent: parentId, depth, key, value });
     }
     return id ?? -1;
   }
@@ -310,21 +312,28 @@ function buildPivotCube(data, rowFields, columnFields, values) {
   const rowPrefixIds = new Array(rowFields.length + 1);
   const columnPrefixIds = new Array(columnFields.length + 1);
   const valueCache = new Array(values.length);
+  const numberCache = new Array(values.length);
   const buckets = /* @__PURE__ */ new Map();
   const cache = /* @__PURE__ */ new Map();
   for (const row of data) {
     rowPrefixIds[0] = 0;
     for (let depth = 0; depth < rowReads.length; depth++) {
-      const keyId = rows.keyId(depth, toKey(rowReads[depth](row)), true);
-      rowPrefixIds[depth + 1] = rows.child(rowPrefixIds[depth], keyId, true);
+      const raw = rowReads[depth](row);
+      const key = toKey(raw);
+      const keyId = rows.keyId(depth, key, true);
+      rowPrefixIds[depth + 1] = rows.child(rowPrefixIds[depth], keyId, true, depth, key, raw);
     }
     columnPrefixIds[0] = 0;
     for (let depth = 0; depth < columnReads.length; depth++) {
-      const keyId = columns.keyId(depth, toKey(columnReads[depth](row)), true);
-      columnPrefixIds[depth + 1] = columns.child(columnPrefixIds[depth], keyId, true);
+      const raw = columnReads[depth](row);
+      const key = toKey(raw);
+      const keyId = columns.keyId(depth, key, true);
+      columnPrefixIds[depth + 1] = columns.child(columnPrefixIds[depth], keyId, true, depth, key, raw);
     }
     for (let valueIndex = 0; valueIndex < valueReads.length; valueIndex++) {
-      valueCache[valueIndex] = valueReads[valueIndex](row);
+      const raw = valueReads[valueIndex](row);
+      valueCache[valueIndex] = raw;
+      numberCache[valueIndex] = coerceFinite(raw);
     }
     for (let r = 0; r <= rowFields.length; r++) {
       const rowId = rowPrefixIds[r];
@@ -341,38 +350,40 @@ function buildPivotCube(data, rowFields, columnFields, values) {
           rowBuckets.set(colId, bucket);
         }
         for (let valueIndex = 0; valueIndex < values.length; valueIndex++) {
-          addToState(bucket[valueIndex], values[valueIndex].op, valueCache[valueIndex]);
+          addToState(bucket[valueIndex], values[valueIndex].op, valueCache[valueIndex], numberCache[valueIndex]);
         }
       }
     }
   }
-  return {
-    valueAt(rowPath, colPath, valueIndex) {
-      const valueDef = values[valueIndex];
-      if (!valueDef) return null;
-      const rowId = rows.pathId(rowPath, false);
-      const colId = columns.pathId(colPath, false);
-      if (rowId < 0 || colId < 0) return aggregateValues([], valueDef.op);
-      let rowCache = cache.get(rowId);
-      if (!rowCache) {
-        rowCache = /* @__PURE__ */ new Map();
-        cache.set(rowId, rowCache);
-      }
-      let cached = rowCache.get(colId);
-      if (!cached) {
-        cached = new Array(values.length);
-        rowCache.set(colId, cached);
-      } else if (valueIndex in cached) {
-        return cached[valueIndex];
-      }
-      const bucket = buckets.get(rowId)?.get(colId);
-      const result = bucket ? stateValue(bucket[valueIndex], valueDef.op) : aggregateValues([], valueDef.op);
-      cached[valueIndex] = result;
-      return result;
+  const valueAtIds = (rowId, colId, valueIndex) => {
+    const valueDef = values[valueIndex];
+    if (!valueDef) return null;
+    if (rowId < 0 || colId < 0) return aggregateValues([], valueDef.op);
+    let rowCache = cache.get(rowId);
+    if (!rowCache) {
+      rowCache = /* @__PURE__ */ new Map();
+      cache.set(rowId, rowCache);
     }
+    let cached = rowCache.get(colId);
+    if (!cached) {
+      cached = new Array(values.length);
+      rowCache.set(colId, cached);
+    } else if (valueIndex in cached) {
+      return cached[valueIndex];
+    }
+    const bucket = buckets.get(rowId)?.get(colId);
+    const result = bucket ? stateValue(bucket[valueIndex], valueDef.op) : aggregateValues([], valueDef.op);
+    cached[valueIndex] = result;
+    return result;
+  };
+  return {
+    valueAt: (rowPath, colPath, valueIndex) => valueAtIds(rows.pathId(rowPath, false), columns.pathId(colPath, false), valueIndex),
+    valueAtIds,
+    rowAxis: rows.entries,
+    columnAxis: columns.entries
   };
 }
-function addToState(state, op, value) {
+function addToState(state, op, value, numeric = coerceFinite(value)) {
   if (op === "count") {
     if (value !== null && value !== void 0) state.count = (state.count ?? 0) + 1;
     return;
@@ -385,16 +396,16 @@ function addToState(state, op, value) {
   }
   if (op === "first") {
     if (!state.hasFirst && value !== null && value !== void 0) {
-      state.first = coerceFinite(value);
+      state.first = numeric;
       state.hasFirst = true;
     }
     return;
   }
   if (op === "last") {
-    if (value !== null && value !== void 0) state.last = coerceFinite(value);
+    if (value !== null && value !== void 0) state.last = numeric;
     return;
   }
-  const numberValue = coerceFinite(value);
+  const numberValue = numeric;
   if (numberValue === null) return;
   if (op === "min") {
     state.min = state.min === void 0 ? numberValue : Math.min(state.min, numberValue);
@@ -440,6 +451,7 @@ function stateValue(state, op) {
 }
 export {
   aggregateValues,
+  buildPivotCube,
   groupBy,
   pivot,
   resolveValueRef

package/dist/pivot/pivot.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/pivot/pivot.ts"],
-  "sourcesContent": ["import type { Datum } from '../types';\nimport { accessor, getField, toKey, toNumber } from '../util/data';\nimport { medianSorted, stableSum } from '../util/math';\n\nexport type AggOp =\n  | 'sum'\n  | 'mean'\n  | 'avg'\n  | 'min'\n  | 'max'\n  | 'count'\n  | 'countDistinct'\n  | 'median'\n  | 'first'\n  | 'last';\n\nexport interface PivotValueDef {\n  field: string;\n  op: AggOp;\n  label?: string;\n}\n\nexport interface PivotOptions {\n  rows?: string[];\n  columns?: string[];\n  values: PivotValueDef[];\n  includeRowSubtotals?: boolean;\n  includeColumnSubtotals?: boolean;\n  includeGrandTotals?: boolean;\n  sort?: 'asc' | 'desc' | 'none';\n}\n\nexport interface PivotHeaderNode {\n  key: string;\n  path: string[];\n  depth: number;\n  children: PivotHeaderNode[];\n  isSubtotal?: boolean;\n  isGrandTotal?: boolean;\n  span: number;\n}\n\nexport interface PivotCell {\n  values: (number | null)[];\n}\n\nexport interface PivotFlatRow {\n  path: string[];\n  depth: number;\n  isSubtotal?: boolean;\n  isGrandTotal?: boolean;\n  label: string;\n  cellsByColumnKey: Map<string, PivotCell>;\n}\n\nexport interface PivotResult {\n  rowTree: PivotHeaderNode[];\n  columnTree: PivotHeaderNode[];\n  columnLeaves: PivotHeaderNode[];\n  rows: PivotFlatRow[];\n  values: PivotValueDef[];\n  valueAt(rowPath: string[], colPath: string[], valueIndex: number): number | null;\n}\n\nexport type GroupedMap<T> = Map<string, GroupedMap<T> | T[]>;\n\nconst GRAND_TOTAL_LABEL = 'Grand Total';\nconst SUBTOTAL_LABEL = 'Total';\nconst PATH_SEPARATOR = '\\u0000';\n\nexport function aggregateValues(values: unknown[], op: AggOp): number | null {\n  if (op === 'count') {\n    return values.filter((value) => value !== null && value !== undefined).length;\n  }\n\n  if (values.length === 0) {\n    return null;\n  }\n\n  if (op === 'countDistinct') {\n    const distinct = new Set(values.filter((value) => !isMissingAggregateValue(value)).map(toKey));\n    return distinct.size === 0 ? null : distinct.size;\n  }\n\n  if (op === 'first') {\n    return coerceFinite(values.find((value) => value !== null && value !== undefined));\n  }\n\n  if (op === 'last') {\n    for (let index = values.length - 1; index >= 0; index -= 1) {\n      const value = values[index];\n      if (value !== null && value !== undefined) {\n        return coerceFinite(value);\n      }\n    }\n    return null;\n  }\n\n  const numbers = values.map(coerceFinite).filter((value): value is number => value !== null);\n  if (numbers.length === 0) {\n    return null;\n  }\n\n  switch (op) {\n    case 'sum':\n      return stableSum(numbers);\n    case 'mean':\n    case 'avg':\n      return stableSum(numbers, numbers.length);\n    case 'min': {\n      let min = numbers[0];\n      for (const value of numbers) min = Math.min(min, value);\n      return min;\n    }\n    case 'max': {\n      let max = numbers[0];\n      for (const value of numbers) max = Math.max(max, value);\n      return max;\n    }\n    case 'median': {\n      const sorted = [...numbers].sort((left, right) => left - right);\n      return medianSorted(sorted);\n    }\n  }\n\n  return null;\n}\n\n/**\n * Resolve a value reference \u2014 either a literal number or a field aggregated over\n * `data` \u2014 to a single number (or null). Shared by the single-value visuals\n * (`kpi`, `gauge`) and by the runtime's update value-tween, which needs\n * the previously-displayed value to interpolate from. The parameter is typed\n * structurally (rather than importing `ValueRef`) to avoid a module cycle with\n * `spec/types`, which already imports `AggOp` from here.\n */\nexport function resolveValueRef(\n  ref: number | { field: string; aggregate?: AggOp } | undefined,\n  data: readonly Datum[],\n): number | null {\n  if (ref == null) return null;\n  if (typeof ref === 'number') return Number.isFinite(ref) ? ref : null;\n  const read = accessor(ref.field);\n  return aggregateValues(\n    (data ?? []).map((d) => read(d)),\n    ref.aggregate ?? 'sum',\n  );\n}\n\nexport function groupBy<T extends Record<string, unknown>>(\n  rows: T[],\n  keyFields: string[],\n): GroupedMap<T> {\n  const grouped: GroupedMap<T> = new Map();\n\n  for (const row of rows) {\n    let current = grouped;\n    for (let depth = 0; depth < keyFields.length; depth += 1) {\n      const key = toKey(getField(row, keyFields[depth]));\n      const isLeaf = depth === keyFields.length - 1;\n      const existing = current.get(key);\n\n      if (isLeaf) {\n        if (Array.isArray(existing)) {\n          existing.push(row);\n        } else {\n          current.set(key, [row]);\n        }\n      } else {\n        if (existing instanceof Map) {\n          current = existing;\n        } else {\n          const next: GroupedMap<T> = new Map();\n          current.set(key, next);\n          current = next;\n        }\n      }\n    }\n  }\n\n  return grouped;\n}\n\nexport function pivot(data: Datum[], options: PivotOptions): PivotResult {\n  const rowFields = options.rows ?? [];\n  const columnFields = options.columns ?? [];\n  const sort = options.sort ?? 'asc';\n\n  const rowTree = buildHeaderTree(data, rowFields, {\n    includeSubtotals: options.includeRowSubtotals === true,\n    includeGrandTotal: options.includeGrandTotals === true,\n    sort,\n  });\n  const columnTree = buildHeaderTree(data, columnFields, {\n    includeSubtotals: options.includeColumnSubtotals === true,\n    includeGrandTotal: columnFields.length === 0 || options.includeGrandTotals === true,\n    sort,\n  });\n  const columnLeaves = flattenColumnLeaves(columnTree);\n  const cube = buildPivotCube(data, rowFields, columnFields, options.values);\n  const flatRows = buildFlatRows(data, rowFields, columnLeaves, options, sort, cube);\n\n  const valueAt = (rowPath: string[], colPath: string[], valueIndex: number): number | null => {\n    return cube.valueAt(rowPath, colPath, valueIndex);\n  };\n\n  return {\n    rowTree,\n    columnTree,\n    columnLeaves,\n    rows: flatRows,\n    values: options.values,\n    valueAt,\n  };\n}\n\nfunction buildFlatRows(\n  data: Datum[],\n  rowFields: string[],\n  columnLeaves: PivotHeaderNode[],\n  options: PivotOptions,\n  sort: 'asc' | 'desc' | 'none',\n  cube: PivotCube,\n): PivotFlatRow[] {\n  if (rowFields.length === 0) {\n    return [makeFlatRow([], 0, true, false, columnLeaves, options, cube)];\n  }\n\n  const rows: PivotFlatRow[] = [];\n  appendFlatRows(rows, data, rowFields, [], 0, columnLeaves, options, sort, cube);\n\n  if (options.includeGrandTotals === true) {\n    rows.push(makeFlatRow([], 0, true, false, columnLeaves, options, cube));\n  }\n\n  return rows;\n}\n\nfunction appendFlatRows(\n  out: PivotFlatRow[],\n  data: Datum[],\n  fields: string[],\n  path: string[],\n  depth: number,\n  columnLeaves: PivotHeaderNode[],\n  options: PivotOptions,\n  sort: 'asc' | 'desc' | 'none',\n  cube: PivotCube,\n): void {\n  const field = fields[depth];\n  const groups = groupRowsAtDepth(data, field, sort);\n\n  for (const [key, groupRows] of groups) {\n    const nextPath = [...path, key];\n    if (depth === fields.length - 1) {\n      out.push(makeFlatRow(nextPath, depth, false, false, columnLeaves, options, cube));\n    } else {\n      appendFlatRows(out, groupRows, fields, nextPath, depth + 1, columnLeaves, options, sort, cube);\n      if (options.includeRowSubtotals === true) {\n        out.push(makeFlatRow(nextPath, depth, false, true, columnLeaves, options, cube));\n      }\n    }\n  }\n}\n\nfunction makeFlatRow(\n  path: string[],\n  depth: number,\n  isGrandTotal: boolean,\n  isSubtotal: boolean,\n  columnLeaves: PivotHeaderNode[],\n  options: PivotOptions,\n  cube: PivotCube,\n): PivotFlatRow {\n  const cellsByColumnKey = new Map<string, PivotCell>();\n\n  for (const columnLeaf of columnLeaves) {\n    const columnKey = makePathKey(columnLeaf.path);\n    cellsByColumnKey.set(columnKey, {\n      values: options.values.map((_, valueIndex) => cube.valueAt(path, columnLeaf.path, valueIndex)),\n    });\n  }\n\n  return {\n    path,\n    depth,\n    isGrandTotal: isGrandTotal || undefined,\n    isSubtotal: isSubtotal || undefined,\n    label: isGrandTotal\n      ? GRAND_TOTAL_LABEL\n      : isSubtotal\n        ? SUBTOTAL_LABEL\n        : (path[path.length - 1] ?? GRAND_TOTAL_LABEL),\n    cellsByColumnKey,\n  };\n}\n\nfunction buildHeaderTree(\n  data: Datum[],\n  fields: string[],\n  options: {\n    includeSubtotals: boolean;\n    includeGrandTotal: boolean;\n    sort: 'asc' | 'desc' | 'none';\n  },\n): PivotHeaderNode[] {\n  const roots = fields.length === 0 ? [] : buildHeaderLevel(data, fields, [], 0, options);\n\n  if (fields.length === 0 || options.includeGrandTotal) {\n    roots.push({\n      key: GRAND_TOTAL_LABEL,\n      path: [],\n      depth: 0,\n      children: [],\n      isGrandTotal: true,\n      span: 1,\n    });\n  }\n\n  return roots;\n}\n\nfunction buildHeaderLevel(\n  data: Datum[],\n  fields: string[],\n  path: string[],\n  depth: number,\n  options: {\n    includeSubtotals: boolean;\n    includeGrandTotal: boolean;\n    sort: 'asc' | 'desc' | 'none';\n  },\n): PivotHeaderNode[] {\n  const field = fields[depth];\n  const groups = groupRowsAtDepth(data, field, options.sort);\n  const nodes: PivotHeaderNode[] = [];\n\n  for (const [key, groupRows] of groups) {\n    const nextPath = [...path, key];\n    const children =\n      depth === fields.length - 1\n        ? []\n        : buildHeaderLevel(groupRows, fields, nextPath, depth + 1, options);\n\n    if (children.length > 0 && options.includeSubtotals) {\n      children.push({\n        key: SUBTOTAL_LABEL,\n        path: nextPath,\n        depth: depth + 1,\n        children: [],\n        isSubtotal: true,\n        span: 1,\n      });\n    }\n\n    const span = children.length === 0 ? 1 : children.reduce((sum, child) => sum + child.span, 0);\n    nodes.push({\n      key,\n      path: nextPath,\n      depth,\n      children,\n      span,\n    });\n  }\n\n  return nodes;\n}\n\nfunction flattenColumnLeaves(nodes: PivotHeaderNode[]): PivotHeaderNode[] {\n  const leaves: PivotHeaderNode[] = [];\n  for (const node of nodes) {\n    if (node.children.length === 0) {\n      leaves.push(node);\n    } else {\n      leaves.push(...flattenColumnLeaves(node.children));\n    }\n  }\n  return leaves;\n}\n\nfunction groupRowsAtDepth(\n  data: Datum[],\n  field: string,\n  sort: 'asc' | 'desc' | 'none',\n): Map<string, Datum[]> {\n  const grouped = new Map<string, Datum[]>();\n\n  for (const row of data) {\n    const key = toKey(getField(row, field));\n    const rows = grouped.get(key);\n    if (rows === undefined) {\n      grouped.set(key, [row]);\n    } else {\n      rows.push(row);\n    }\n  }\n\n  if (sort === 'none') {\n    return grouped;\n  }\n\n  return new Map(\n    [...grouped.entries()].sort(([left], [right]) => {\n      if (left === right) {\n        return 0;\n      }\n      const direction = sort === 'asc' ? 1 : -1;\n      return left < right ? -direction : direction;\n    }),\n  );\n}\n\nfunction coerceFinite(value: unknown): number | null {\n  if (value === null || value === undefined) {\n    return null;\n  }\n\n  const numberValue = toNumber(value);\n  return Number.isFinite(numberValue) ? numberValue : null;\n}\n\nfunction makePathKey(path: string[]): string {\n  return path.join(PATH_SEPARATOR);\n}\n\nfunction isMissingAggregateValue(value: unknown): boolean {\n  return value == null || value === '' || (typeof value === 'number' && Number.isNaN(value));\n}\n\ninterface PivotCube {\n  valueAt(rowPath: string[], colPath: string[], valueIndex: number): number | null;\n}\n\ninterface AggregateState {\n  count?: number;\n  distinct?: Set<string>;\n  first?: number | null;\n  hasFirst?: boolean;\n  last?: number | null;\n  sum?: number;\n  numericCount?: number;\n  min?: number;\n  max?: number;\n  numbers?: number[];\n}\n\nclass AxisPathInterner {\n  private readonly keyIds: Map<string, number>[];\n  private readonly children = new Map<number, Map<number, number>>();\n  private nextKeyId = 1;\n  private nextPathId = 1;\n\n  constructor(fields: readonly string[]) {\n    this.keyIds = fields.map(() => new Map<string, number>());\n  }\n\n  keyId(depth: number, key: string, create: boolean): number {\n    const ids = this.keyIds[depth];\n    let id = ids.get(key);\n    if (id === undefined && create) {\n      id = this.nextKeyId++;\n      ids.set(key, id);\n    }\n    return id ?? -1;\n  }\n\n  child(parentId: number, keyId: number, create: boolean): number {\n    let children = this.children.get(parentId);\n    if (!children) {\n      if (!create) return -1;\n      children = new Map<number, number>();\n      this.children.set(parentId, children);\n    }\n    let id = children.get(keyId);\n    if (id === undefined && create) {\n      id = this.nextPathId++;\n      children.set(keyId, id);\n    }\n    return id ?? -1;\n  }\n\n  pathId(path: readonly string[], create: boolean): number {\n    let id = 0;\n    for (let depth = 0; depth < path.length; depth++) {\n      const keyId = this.keyId(depth, path[depth], create);\n      if (keyId < 0) return -1;\n      id = this.child(id, keyId, create);\n      if (id < 0) return -1;\n    }\n    return id;\n  }\n}\n\nfunction emptyState(values: readonly PivotValueDef[]): AggregateState[] {\n  const states: AggregateState[] = [];\n  for (let i = 0; i < values.length; i++) states.push({});\n  return states;\n}\n\nfunction buildPivotCube(\n  data: Datum[],\n  rowFields: string[],\n  columnFields: string[],\n  values: PivotValueDef[],\n): PivotCube {\n  const rows = new AxisPathInterner(rowFields);\n  const columns = new AxisPathInterner(columnFields);\n  const rowReads = rowFields.map((field) => accessor(field));\n  const columnReads = columnFields.map((field) => accessor(field));\n  const valueReads = values.map((value) => accessor(value.field));\n  const rowPrefixIds = new Array<number>(rowFields.length + 1);\n  const columnPrefixIds = new Array<number>(columnFields.length + 1);\n  const valueCache = new Array<unknown>(values.length);\n  const buckets = new Map<number, Map<number, AggregateState[]>>();\n  const cache = new Map<number, Map<number, (number | null)[]>>();\n  for (const row of data) {\n    rowPrefixIds[0] = 0;\n    for (let depth = 0; depth < rowReads.length; depth++) {\n      const keyId = rows.keyId(depth, toKey(rowReads[depth](row)), true);\n      rowPrefixIds[depth + 1] = rows.child(rowPrefixIds[depth], keyId, true);\n    }\n    columnPrefixIds[0] = 0;\n    for (let depth = 0; depth < columnReads.length; depth++) {\n      const keyId = columns.keyId(depth, toKey(columnReads[depth](row)), true);\n      columnPrefixIds[depth + 1] = columns.child(columnPrefixIds[depth], keyId, true);\n    }\n    for (let valueIndex = 0; valueIndex < valueReads.length; valueIndex++) {\n      valueCache[valueIndex] = valueReads[valueIndex](row);\n    }\n    for (let r = 0; r <= rowFields.length; r++) {\n      const rowId = rowPrefixIds[r];\n      let rowBuckets = buckets.get(rowId);\n      if (!rowBuckets) {\n        rowBuckets = new Map<number, AggregateState[]>();\n        buckets.set(rowId, rowBuckets);\n      }\n      for (let c = 0; c <= columnFields.length; c++) {\n        const colId = columnPrefixIds[c];\n        let bucket = rowBuckets.get(colId);\n        if (!bucket) {\n          bucket = emptyState(values);\n          rowBuckets.set(colId, bucket);\n        }\n        for (let valueIndex = 0; valueIndex < values.length; valueIndex++) {\n          addToState(bucket[valueIndex], values[valueIndex].op, valueCache[valueIndex]);\n        }\n      }\n    }\n  }\n  return {\n    valueAt(rowPath, colPath, valueIndex) {\n      const valueDef = values[valueIndex];\n      if (!valueDef) return null;\n      const rowId = rows.pathId(rowPath, false);\n      const colId = columns.pathId(colPath, false);\n      if (rowId < 0 || colId < 0) return aggregateValues([], valueDef.op);\n      let rowCache = cache.get(rowId);\n      if (!rowCache) {\n        rowCache = new Map<number, (number | null)[]>();\n        cache.set(rowId, rowCache);\n      }\n      let cached = rowCache.get(colId);\n      if (!cached) {\n        cached = new Array<number | null>(values.length);\n        rowCache.set(colId, cached);\n      } else if (valueIndex in cached) {\n        return cached[valueIndex];\n      }\n      const bucket = buckets.get(rowId)?.get(colId);\n      const result = bucket ? stateValue(bucket[valueIndex], valueDef.op) : aggregateValues([], valueDef.op);\n      cached[valueIndex] = result;\n      return result;\n    },\n  };\n}\n\nfunction addToState(state: AggregateState, op: AggOp, value: unknown): void {\n  if (op === 'count') {\n    if (value !== null && value !== undefined) state.count = (state.count ?? 0) + 1;\n    return;\n  }\n  if (op === 'countDistinct') {\n    if (!isMissingAggregateValue(value)) {\n      (state.distinct ??= new Set()).add(toKey(value));\n    }\n    return;\n  }\n  if (op === 'first') {\n    if (!state.hasFirst && value !== null && value !== undefined) {\n      state.first = coerceFinite(value);\n      state.hasFirst = true;\n    }\n    return;\n  }\n  if (op === 'last') {\n    if (value !== null && value !== undefined) state.last = coerceFinite(value);\n    return;\n  }\n  const numberValue = coerceFinite(value);\n  if (numberValue === null) return;\n  if (op === 'min') {\n    state.min = state.min === undefined ? numberValue : Math.min(state.min, numberValue);\n  } else if (op === 'max') {\n    state.max = state.max === undefined ? numberValue : Math.max(state.max, numberValue);\n  } else if (op === 'median') {\n    (state.numbers ??= []).push(numberValue);\n  } else {\n    const previous = state.sum ?? 0;\n    state.sum = previous + numberValue;\n    state.numericCount = (state.numericCount ?? 0) + 1;\n    if (state.numbers || !Number.isFinite(state.sum) || Math.abs(numberValue) > 1e300) {\n      (state.numbers ??= [previous]).push(numberValue);\n    }\n  }\n}\n\nfunction stateValue(state: AggregateState, op: AggOp): number | null {\n  if (op === 'count') return state.count ?? 0;\n  if (op === 'countDistinct') return state.distinct?.size ? state.distinct.size : null;\n  if (op === 'first') return state.hasFirst ? (state.first ?? null) : null;\n  if (op === 'last') return state.last ?? null;\n  switch (op) {\n    case 'sum':\n      if (!state.numericCount) return null;\n      return state.numbers ? stableSum(state.numbers) : Number.isFinite(state.sum) ? state.sum! : null;\n    case 'mean':\n    case 'avg':\n      if (!state.numericCount) return null;\n      return state.numbers ? stableSum(state.numbers, state.numericCount) : Number.isFinite(state.sum) ? state.sum! / state.numericCount : null;\n    case 'min': {\n      return state.min ?? null;\n    }\n    case 'max': {\n      return state.max ?? null;\n    }\n    case 'median': {\n      const numbers = state.numbers ?? [];\n      if (numbers.length === 0) return null;\n      const sorted = [...numbers].sort((left, right) => left - right);\n      return medianSorted(sorted);\n    }\n  }\n}\n"],
-  "mappings": ";;;AACA,SAAS,UAAU,UAAU,OAAO,gBAAgB;AACpD,SAAS,cAAc,iBAAiB;AAgExC,MAAM,oBAAoB;AAC1B,MAAM,iBAAiB;AACvB,MAAM,iBAAiB;AAEhB,SAAS,gBAAgB,QAAmB,IAA0B;AAC3E,MAAI,OAAO,SAAS;AAClB,WAAO,OAAO,OAAO,CAAC,UAAU,UAAU,QAAQ,UAAU,MAAS,EAAE;AAAA,EACzE;AAEA,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,iBAAiB;AAC1B,UAAM,WAAW,IAAI,IAAI,OAAO,OAAO,CAAC,UAAU,CAAC,wBAAwB,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC;AAC7F,WAAO,SAAS,SAAS,IAAI,OAAO,SAAS;AAAA,EAC/C;AAEA,MAAI,OAAO,SAAS;AAClB,WAAO,aAAa,OAAO,KAAK,CAAC,UAAU,UAAU,QAAQ,UAAU,MAAS,CAAC;AAAA,EACnF;AAEA,MAAI,OAAO,QAAQ;AACjB,aAAS,QAAQ,OAAO,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;AAC1D,YAAM,QAAQ,OAAO,KAAK;AAC1B,UAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,eAAO,aAAa,KAAK;AAAA,MAC3B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,OAAO,IAAI,YAAY,EAAE,OAAO,CAAC,UAA2B,UAAU,IAAI;AAC1F,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;AAAA,EACT;AAEA,UAAQ,IAAI;AAAA,IACV,KAAK;AACH,aAAO,UAAU,OAAO;AAAA,IAC1B,KAAK;AAAA,IACL,KAAK;AACH,aAAO,UAAU,SAAS,QAAQ,MAAM;AAAA,IAC1C,KAAK,OAAO;AACV,UAAI,MAAM,QAAQ,CAAC;AACnB,iBAAW,SAAS,QAAS,OAAM,KAAK,IAAI,KAAK,KAAK;AACtD,aAAO;AAAA,IACT;AAAA,IACA,KAAK,OAAO;AACV,UAAI,MAAM,QAAQ,CAAC;AACnB,iBAAW,SAAS,QAAS,OAAM,KAAK,IAAI,KAAK,KAAK;AACtD,aAAO;AAAA,IACT;AAAA,IACA,KAAK,UAAU;AACb,YAAM,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,MAAM,UAAU,OAAO,KAAK;AAC9D,aAAO,aAAa,MAAM;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,gBACd,KACA,MACe;AACf,MAAI,OAAO,KAAM,QAAO;AACxB,MAAI,OAAO,QAAQ,SAAU,QAAO,OAAO,SAAS,GAAG,IAAI,MAAM;AACjE,QAAM,OAAO,SAAS,IAAI,KAAK;AAC/B,SAAO;AAAA,KACJ,QAAQ,CAAC,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;AAAA,IAC/B,IAAI,aAAa;AAAA,EACnB;AACF;AAEO,SAAS,QACd,MACA,WACe;AACf,QAAM,UAAyB,oBAAI,IAAI;AAEvC,aAAW,OAAO,MAAM;AACtB,QAAI,UAAU;AACd,aAAS,QAAQ,GAAG,QAAQ,UAAU,QAAQ,SAAS,GAAG;AACxD,YAAM,MAAM,MAAM,SAAS,KAAK,UAAU,KAAK,CAAC,CAAC;AACjD,YAAM,SAAS,UAAU,UAAU,SAAS;AAC5C,YAAM,WAAW,QAAQ,IAAI,GAAG;AAEhC,UAAI,QAAQ;AACV,YAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,mBAAS,KAAK,GAAG;AAAA,QACnB,OAAO;AACL,kBAAQ,IAAI,KAAK,CAAC,GAAG,CAAC;AAAA,QACxB;AAAA,MACF,OAAO;AACL,YAAI,oBAAoB,KAAK;AAC3B,oBAAU;AAAA,QACZ,OAAO;AACL,gBAAM,OAAsB,oBAAI,IAAI;AACpC,kBAAQ,IAAI,KAAK,IAAI;AACrB,oBAAU;AAAA,QACZ;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,MAAM,MAAe,SAAoC;AACvE,QAAM,YAAY,QAAQ,QAAQ,CAAC;AACnC,QAAM,eAAe,QAAQ,WAAW,CAAC;AACzC,QAAM,OAAO,QAAQ,QAAQ;AAE7B,QAAM,UAAU,gBAAgB,MAAM,WAAW;AAAA,IAC/C,kBAAkB,QAAQ,wBAAwB;AAAA,IAClD,mBAAmB,QAAQ,uBAAuB;AAAA,IAClD;AAAA,EACF,CAAC;AACD,QAAM,aAAa,gBAAgB,MAAM,cAAc;AAAA,IACrD,kBAAkB,QAAQ,2BAA2B;AAAA,IACrD,mBAAmB,aAAa,WAAW,KAAK,QAAQ,uBAAuB;AAAA,IAC/E;AAAA,EACF,CAAC;AACD,QAAM,eAAe,oBAAoB,UAAU;AACnD,QAAM,OAAO,eAAe,MAAM,WAAW,cAAc,QAAQ,MAAM;AACzE,QAAM,WAAW,cAAc,MAAM,WAAW,cAAc,SAAS,MAAM,IAAI;AAEjF,QAAM,UAAU,CAAC,SAAmB,SAAmB,eAAsC;AAC3F,WAAO,KAAK,QAAQ,SAAS,SAAS,UAAU;AAAA,EAClD;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAM;AAAA,IACN,QAAQ,QAAQ;AAAA,IAChB;AAAA,EACF;AACF;AAEA,SAAS,cACP,MACA,WACA,cACA,SACA,MACA,MACgB;AAChB,MAAI,UAAU,WAAW,GAAG;AAC1B,WAAO,CAAC,YAAY,CAAC,GAAG,GAAG,MAAM,OAAO,cAAc,SAAS,IAAI,CAAC;AAAA,EACtE;AAEA,QAAM,OAAuB,CAAC;AAC9B,iBAAe,MAAM,MAAM,WAAW,CAAC,GAAG,GAAG,cAAc,SAAS,MAAM,IAAI;AAE9E,MAAI,QAAQ,uBAAuB,MAAM;AACvC,SAAK,KAAK,YAAY,CAAC,GAAG,GAAG,MAAM,OAAO,cAAc,SAAS,IAAI,CAAC;AAAA,EACxE;AAEA,SAAO;AACT;AAEA,SAAS,eACP,KACA,MACA,QACA,MACA,OACA,cACA,SACA,MACA,MACM;AACN,QAAM,QAAQ,OAAO,KAAK;AAC1B,QAAM,SAAS,iBAAiB,MAAM,OAAO,IAAI;AAEjD,aAAW,CAAC,KAAK,SAAS,KAAK,QAAQ;AACrC,UAAM,WAAW,CAAC,GAAG,MAAM,GAAG;AAC9B,QAAI,UAAU,OAAO,SAAS,GAAG;AAC/B,UAAI,KAAK,YAAY,UAAU,OAAO,OAAO,OAAO,cAAc,SAAS,IAAI,CAAC;AAAA,IAClF,OAAO;AACL,qBAAe,KAAK,WAAW,QAAQ,UAAU,QAAQ,GAAG,cAAc,SAAS,MAAM,IAAI;AAC7F,UAAI,QAAQ,wBAAwB,MAAM;AACxC,YAAI,KAAK,YAAY,UAAU,OAAO,OAAO,MAAM,cAAc,SAAS,IAAI,CAAC;AAAA,MACjF;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,YACP,MACA,OACA,cACA,YACA,cACA,SACA,MACc;AACd,QAAM,mBAAmB,oBAAI,IAAuB;AAEpD,aAAW,cAAc,cAAc;AACrC,UAAM,YAAY,YAAY,WAAW,IAAI;AAC7C,qBAAiB,IAAI,WAAW;AAAA,MAC9B,QAAQ,QAAQ,OAAO,IAAI,CAAC,GAAG,eAAe,KAAK,QAAQ,MAAM,WAAW,MAAM,UAAU,CAAC;AAAA,IAC/F,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,cAAc,gBAAgB;AAAA,IAC9B,YAAY,cAAc;AAAA,IAC1B,OAAO,eACH,oBACA,aACE,iBACC,KAAK,KAAK,SAAS,CAAC,KAAK;AAAA,IAChC;AAAA,EACF;AACF;AAEA,SAAS,gBACP,MACA,QACA,SAKmB;AACnB,QAAM,QAAQ,OAAO,WAAW,IAAI,CAAC,IAAI,iBAAiB,MAAM,QAAQ,CAAC,GAAG,GAAG,OAAO;AAEtF,MAAI,OAAO,WAAW,KAAK,QAAQ,mBAAmB;AACpD,UAAM,KAAK;AAAA,MACT,KAAK;AAAA,MACL,MAAM,CAAC;AAAA,MACP,OAAO;AAAA,MACP,UAAU,CAAC;AAAA,MACX,cAAc;AAAA,MACd,MAAM;AAAA,IACR,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEA,SAAS,iBACP,MACA,QACA,MACA,OACA,SAKmB;AACnB,QAAM,QAAQ,OAAO,KAAK;AAC1B,QAAM,SAAS,iBAAiB,MAAM,OAAO,QAAQ,IAAI;AACzD,QAAM,QAA2B,CAAC;AAElC,aAAW,CAAC,KAAK,SAAS,KAAK,QAAQ;AACrC,UAAM,WAAW,CAAC,GAAG,MAAM,GAAG;AAC9B,UAAM,WACJ,UAAU,OAAO,SAAS,IACtB,CAAC,IACD,iBAAiB,WAAW,QAAQ,UAAU,QAAQ,GAAG,OAAO;AAEtE,QAAI,SAAS,SAAS,KAAK,QAAQ,kBAAkB;AACnD,eAAS,KAAK;AAAA,QACZ,KAAK;AAAA,QACL,MAAM;AAAA,QACN,OAAO,QAAQ;AAAA,QACf,UAAU,CAAC;AAAA,QACX,YAAY;AAAA,QACZ,MAAM;AAAA,MACR,CAAC;AAAA,IACH;AAEA,UAAM,OAAO,SAAS,WAAW,IAAI,IAAI,SAAS,OAAO,CAAC,KAAK,UAAU,MAAM,MAAM,MAAM,CAAC;AAC5F,UAAM,KAAK;AAAA,MACT;AAAA,MACA,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEA,SAAS,oBAAoB,OAA6C;AACxE,QAAM,SAA4B,CAAC;AACnC,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,SAAS,WAAW,GAAG;AAC9B,aAAO,KAAK,IAAI;AAAA,IAClB,OAAO;AACL,aAAO,KAAK,GAAG,oBAAoB,KAAK,QAAQ,CAAC;AAAA,IACnD;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,iBACP,MACA,OACA,MACsB;AACtB,QAAM,UAAU,oBAAI,IAAqB;AAEzC,aAAW,OAAO,MAAM;AACtB,UAAM,MAAM,MAAM,SAAS,KAAK,KAAK,CAAC;AACtC,UAAM,OAAO,QAAQ,IAAI,GAAG;AAC5B,QAAI,SAAS,QAAW;AACtB,cAAQ,IAAI,KAAK,CAAC,GAAG,CAAC;AAAA,IACxB,OAAO;AACL,WAAK,KAAK,GAAG;AAAA,IACf;AAAA,EACF;AAEA,MAAI,SAAS,QAAQ;AACnB,WAAO;AAAA,EACT;AAEA,SAAO,IAAI;AAAA,IACT,CAAC,GAAG,QAAQ,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAAM;AAC/C,UAAI,SAAS,OAAO;AAClB,eAAO;AAAA,MACT;AACA,YAAM,YAAY,SAAS,QAAQ,IAAI;AACvC,aAAO,OAAO,QAAQ,CAAC,YAAY;AAAA,IACrC,CAAC;AAAA,EACH;AACF;AAEA,SAAS,aAAa,OAA+B;AACnD,MAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,WAAO;AAAA,EACT;AAEA,QAAM,cAAc,SAAS,KAAK;AAClC,SAAO,OAAO,SAAS,WAAW,IAAI,cAAc;AACtD;AAEA,SAAS,YAAY,MAAwB;AAC3C,SAAO,KAAK,KAAK,cAAc;AACjC;AAEA,SAAS,wBAAwB,OAAyB;AACxD,SAAO,SAAS,QAAQ,UAAU,MAAO,OAAO,UAAU,YAAY,OAAO,MAAM,KAAK;AAC1F;AAmBA,MAAM,iBAAiB;AAAA,EAMrB,YAAY,QAA2B;AALvC,wBAAiB;AACjB,wBAAiB,YAAW,oBAAI,IAAiC;AACjE,wBAAQ,aAAY;AACpB,wBAAQ,cAAa;AAGnB,SAAK,SAAS,OAAO,IAAI,MAAM,oBAAI,IAAoB,CAAC;AAAA,EAC1D;AAAA,EAEA,MAAM,OAAe,KAAa,QAAyB;AACzD,UAAM,MAAM,KAAK,OAAO,KAAK;AAC7B,QAAI,KAAK,IAAI,IAAI,GAAG;AACpB,QAAI,OAAO,UAAa,QAAQ;AAC9B,WAAK,KAAK;AACV,UAAI,IAAI,KAAK,EAAE;AAAA,IACjB;AACA,WAAO,MAAM;AAAA,EACf;AAAA,EAEA,MAAM,UAAkB,OAAe,QAAyB;AAC9D,QAAI,WAAW,KAAK,SAAS,IAAI,QAAQ;AACzC,QAAI,CAAC,UAAU;AACb,UAAI,CAAC,OAAQ,QAAO;AACpB,iBAAW,oBAAI,IAAoB;AACnC,WAAK,SAAS,IAAI,UAAU,QAAQ;AAAA,IACtC;AACA,QAAI,KAAK,SAAS,IAAI,KAAK;AAC3B,QAAI,OAAO,UAAa,QAAQ;AAC9B,WAAK,KAAK;AACV,eAAS,IAAI,OAAO,EAAE;AAAA,IACxB;AACA,WAAO,MAAM;AAAA,EACf;AAAA,EAEA,OAAO,MAAyB,QAAyB;AACvD,QAAI,KAAK;AACT,aAAS,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS;AAChD,YAAM,QAAQ,KAAK,MAAM,OAAO,KAAK,KAAK,GAAG,MAAM;AACnD,UAAI,QAAQ,EAAG,QAAO;AACtB,WAAK,KAAK,MAAM,IAAI,OAAO,MAAM;AACjC,UAAI,KAAK,EAAG,QAAO;AAAA,IACrB;AACA,WAAO;AAAA,EACT;AACF;AAEA,SAAS,WAAW,QAAoD;AACtE,QAAM,SAA2B,CAAC;AAClC,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAK,QAAO,KAAK,CAAC,CAAC;AACtD,SAAO;AACT;AAEA,SAAS,eACP,MACA,WACA,cACA,QACW;AACX,QAAM,OAAO,IAAI,iBAAiB,SAAS;AAC3C,QAAM,UAAU,IAAI,iBAAiB,YAAY;AACjD,QAAM,WAAW,UAAU,IAAI,CAAC,UAAU,SAAS,KAAK,CAAC;AACzD,QAAM,cAAc,aAAa,IAAI,CAAC,UAAU,SAAS,KAAK,CAAC;AAC/D,QAAM,aAAa,OAAO,IAAI,CAAC,UAAU,SAAS,MAAM,KAAK,CAAC;AAC9D,QAAM,eAAe,IAAI,MAAc,UAAU,SAAS,CAAC;AAC3D,QAAM,kBAAkB,IAAI,MAAc,aAAa,SAAS,CAAC;AACjE,QAAM,aAAa,IAAI,MAAe,OAAO,MAAM;AACnD,QAAM,UAAU,oBAAI,IAA2C;AAC/D,QAAM,QAAQ,oBAAI,IAA4C;AAC9D,aAAW,OAAO,MAAM;AACtB,iBAAa,CAAC,IAAI;AAClB,aAAS,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS;AACpD,YAAM,QAAQ,KAAK,MAAM,OAAO,MAAM,SAAS,KAAK,EAAE,GAAG,CAAC,GAAG,IAAI;AACjE,mBAAa,QAAQ,CAAC,IAAI,KAAK,MAAM,aAAa,KAAK,GAAG,OAAO,IAAI;AAAA,IACvE;AACA,oBAAgB,CAAC,IAAI;AACrB,aAAS,QAAQ,GAAG,QAAQ,YAAY,QAAQ,SAAS;AACvD,YAAM,QAAQ,QAAQ,MAAM,OAAO,MAAM,YAAY,KAAK,EAAE,GAAG,CAAC,GAAG,IAAI;AACvE,sBAAgB,QAAQ,CAAC,IAAI,QAAQ,MAAM,gBAAgB,KAAK,GAAG,OAAO,IAAI;AAAA,IAChF;AACA,aAAS,aAAa,GAAG,aAAa,WAAW,QAAQ,cAAc;AACrE,iBAAW,UAAU,IAAI,WAAW,UAAU,EAAE,GAAG;AAAA,IACrD;AACA,aAAS,IAAI,GAAG,KAAK,UAAU,QAAQ,KAAK;AAC1C,YAAM,QAAQ,aAAa,CAAC;AAC5B,UAAI,aAAa,QAAQ,IAAI,KAAK;AAClC,UAAI,CAAC,YAAY;AACf,qBAAa,oBAAI,IAA8B;AAC/C,gBAAQ,IAAI,OAAO,UAAU;AAAA,MAC/B;AACA,eAAS,IAAI,GAAG,KAAK,aAAa,QAAQ,KAAK;AAC7C,cAAM,QAAQ,gBAAgB,CAAC;AAC/B,YAAI,SAAS,WAAW,IAAI,KAAK;AACjC,YAAI,CAAC,QAAQ;AACX,mBAAS,WAAW,MAAM;AAC1B,qBAAW,IAAI,OAAO,MAAM;AAAA,QAC9B;AACA,iBAAS,aAAa,GAAG,aAAa,OAAO,QAAQ,cAAc;AACjE,qBAAW,OAAO,UAAU,GAAG,OAAO,UAAU,EAAE,IAAI,WAAW,UAAU,CAAC;AAAA,QAC9E;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AAAA,IACL,QAAQ,SAAS,SAAS,YAAY;AACpC,YAAM,WAAW,OAAO,UAAU;AAClC,UAAI,CAAC,SAAU,QAAO;AACtB,YAAM,QAAQ,KAAK,OAAO,SAAS,KAAK;AACxC,YAAM,QAAQ,QAAQ,OAAO,SAAS,KAAK;AAC3C,UAAI,QAAQ,KAAK,QAAQ,EAAG,QAAO,gBAAgB,CAAC,GAAG,SAAS,EAAE;AAClE,UAAI,WAAW,MAAM,IAAI,KAAK;AAC9B,UAAI,CAAC,UAAU;AACb,mBAAW,oBAAI,IAA+B;AAC9C,cAAM,IAAI,OAAO,QAAQ;AAAA,MAC3B;AACA,UAAI,SAAS,SAAS,IAAI,KAAK;AAC/B,UAAI,CAAC,QAAQ;AACX,iBAAS,IAAI,MAAqB,OAAO,MAAM;AAC/C,iBAAS,IAAI,OAAO,MAAM;AAAA,MAC5B,WAAW,cAAc,QAAQ;AAC/B,eAAO,OAAO,UAAU;AAAA,MAC1B;AACA,YAAM,SAAS,QAAQ,IAAI,KAAK,GAAG,IAAI,KAAK;AAC5C,YAAM,SAAS,SAAS,WAAW,OAAO,UAAU,GAAG,SAAS,EAAE,IAAI,gBAAgB,CAAC,GAAG,SAAS,EAAE;AACrG,aAAO,UAAU,IAAI;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,WAAW,OAAuB,IAAW,OAAsB;AAC1E,MAAI,OAAO,SAAS;AAClB,QAAI,UAAU,QAAQ,UAAU,OAAW,OAAM,SAAS,MAAM,SAAS,KAAK;AAC9E;AAAA,EACF;AACA,MAAI,OAAO,iBAAiB;AAC1B,QAAI,CAAC,wBAAwB,KAAK,GAAG;AACnC,OAAC,MAAM,aAAa,oBAAI,IAAI,GAAG,IAAI,MAAM,KAAK,CAAC;AAAA,IACjD;AACA;AAAA,EACF;AACA,MAAI,OAAO,SAAS;AAClB,QAAI,CAAC,MAAM,YAAY,UAAU,QAAQ,UAAU,QAAW;AAC5D,YAAM,QAAQ,aAAa,KAAK;AAChC,YAAM,WAAW;AAAA,IACnB;AACA;AAAA,EACF;AACA,MAAI,OAAO,QAAQ;AACjB,QAAI,UAAU,QAAQ,UAAU,OAAW,OAAM,OAAO,aAAa,KAAK;AAC1E;AAAA,EACF;AACA,QAAM,cAAc,aAAa,KAAK;AACtC,MAAI,gBAAgB,KAAM;AAC1B,MAAI,OAAO,OAAO;AAChB,UAAM,MAAM,MAAM,QAAQ,SAAY,cAAc,KAAK,IAAI,MAAM,KAAK,WAAW;AAAA,EACrF,WAAW,OAAO,OAAO;AACvB,UAAM,MAAM,MAAM,QAAQ,SAAY,cAAc,KAAK,IAAI,MAAM,KAAK,WAAW;AAAA,EACrF,WAAW,OAAO,UAAU;AAC1B,KAAC,MAAM,YAAY,CAAC,GAAG,KAAK,WAAW;AAAA,EACzC,OAAO;AACL,UAAM,WAAW,MAAM,OAAO;AAC9B,UAAM,MAAM,WAAW;AACvB,UAAM,gBAAgB,MAAM,gBAAgB,KAAK;AACjD,QAAI,MAAM,WAAW,CAAC,OAAO,SAAS,MAAM,GAAG,KAAK,KAAK,IAAI,WAAW,IAAI,OAAO;AACjF,OAAC,MAAM,YAAY,CAAC,QAAQ,GAAG,KAAK,WAAW;AAAA,IACjD;AAAA,EACF;AACF;AAEA,SAAS,WAAW,OAAuB,IAA0B;AACnE,MAAI,OAAO,QAAS,QAAO,MAAM,SAAS;AAC1C,MAAI,OAAO,gBAAiB,QAAO,MAAM,UAAU,OAAO,MAAM,SAAS,OAAO;AAChF,MAAI,OAAO,QAAS,QAAO,MAAM,WAAY,MAAM,SAAS,OAAQ;AACpE,MAAI,OAAO,OAAQ,QAAO,MAAM,QAAQ;AACxC,UAAQ,IAAI;AAAA,IACV,KAAK;AACH,UAAI,CAAC,MAAM,aAAc,QAAO;AAChC,aAAO,MAAM,UAAU,UAAU,MAAM,OAAO,IAAI,OAAO,SAAS,MAAM,GAAG,IAAI,MAAM,MAAO;AAAA,IAC9F,KAAK;AAAA,IACL,KAAK;AACH,UAAI,CAAC,MAAM,aAAc,QAAO;AAChC,aAAO,MAAM,UAAU,UAAU,MAAM,SAAS,MAAM,YAAY,IAAI,OAAO,SAAS,MAAM,GAAG,IAAI,MAAM,MAAO,MAAM,eAAe;AAAA,IACvI,KAAK,OAAO;AACV,aAAO,MAAM,OAAO;AAAA,IACtB;AAAA,IACA,KAAK,OAAO;AACV,aAAO,MAAM,OAAO;AAAA,IACtB;AAAA,IACA,KAAK,UAAU;AACb,YAAM,UAAU,MAAM,WAAW,CAAC;AAClC,UAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,YAAM,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,MAAM,UAAU,OAAO,KAAK;AAC9D,aAAO,aAAa,MAAM;AAAA,IAC5B;AAAA,EACF;AACF;",
+  "sourcesContent": ["import type { Datum } from '../types';\nimport { accessor, getField, toKey, toNumber } from '../util/data';\nimport { medianSorted, stableSum } from '../util/math';\n\nexport type AggOp =\n  | 'sum'\n  | 'mean'\n  | 'avg'\n  | 'min'\n  | 'max'\n  | 'count'\n  | 'countDistinct'\n  | 'median'\n  | 'first'\n  | 'last';\n\nexport interface PivotValueDef {\n  field: string;\n  op: AggOp;\n  label?: string;\n}\n\nexport interface PivotOptions {\n  rows?: string[];\n  columns?: string[];\n  values: PivotValueDef[];\n  includeRowSubtotals?: boolean;\n  includeColumnSubtotals?: boolean;\n  includeGrandTotals?: boolean;\n  sort?: 'asc' | 'desc' | 'none';\n}\n\nexport interface PivotHeaderNode {\n  key: string;\n  path: string[];\n  depth: number;\n  children: PivotHeaderNode[];\n  isSubtotal?: boolean;\n  isGrandTotal?: boolean;\n  span: number;\n}\n\nexport interface PivotCell {\n  values: (number | null)[];\n}\n\nexport interface PivotFlatRow {\n  path: string[];\n  depth: number;\n  isSubtotal?: boolean;\n  isGrandTotal?: boolean;\n  label: string;\n  cellsByColumnKey: Map<string, PivotCell>;\n}\n\nexport interface PivotResult {\n  rowTree: PivotHeaderNode[];\n  columnTree: PivotHeaderNode[];\n  columnLeaves: PivotHeaderNode[];\n  rows: PivotFlatRow[];\n  values: PivotValueDef[];\n  valueAt(rowPath: string[], colPath: string[], valueIndex: number): number | null;\n}\n\nexport type GroupedMap<T> = Map<string, GroupedMap<T> | T[]>;\n\nconst GRAND_TOTAL_LABEL = 'Grand Total';\nconst SUBTOTAL_LABEL = 'Total';\nconst PATH_SEPARATOR = '\\u0000';\n\nexport function aggregateValues(values: unknown[], op: AggOp): number | null {\n  if (op === 'count') {\n    return values.filter((value) => value !== null && value !== undefined).length;\n  }\n\n  if (values.length === 0) {\n    return null;\n  }\n\n  if (op === 'countDistinct') {\n    const distinct = new Set(values.filter((value) => !isMissingAggregateValue(value)).map(toKey));\n    return distinct.size === 0 ? null : distinct.size;\n  }\n\n  if (op === 'first') {\n    return coerceFinite(values.find((value) => value !== null && value !== undefined));\n  }\n\n  if (op === 'last') {\n    for (let index = values.length - 1; index >= 0; index -= 1) {\n      const value = values[index];\n      if (value !== null && value !== undefined) {\n        return coerceFinite(value);\n      }\n    }\n    return null;\n  }\n\n  const numbers = values.map(coerceFinite).filter((value): value is number => value !== null);\n  if (numbers.length === 0) {\n    return null;\n  }\n\n  switch (op) {\n    case 'sum':\n      return stableSum(numbers);\n    case 'mean':\n    case 'avg':\n      return stableSum(numbers, numbers.length);\n    case 'min': {\n      let min = numbers[0];\n      for (const value of numbers) min = Math.min(min, value);\n      return min;\n    }\n    case 'max': {\n      let max = numbers[0];\n      for (const value of numbers) max = Math.max(max, value);\n      return max;\n    }\n    case 'median': {\n      const sorted = [...numbers].sort((left, right) => left - right);\n      return medianSorted(sorted);\n    }\n  }\n\n  return null;\n}\n\n/**\n * Resolve a value reference \u2014 either a literal number or a field aggregated over\n * `data` \u2014 to a single number (or null). Shared by the single-value visuals\n * (`kpi`, `gauge`) and by the runtime's update value-tween, which needs\n * the previously-displayed value to interpolate from. The parameter is typed\n * structurally (rather than importing `ValueRef`) to avoid a module cycle with\n * `spec/types`, which already imports `AggOp` from here.\n */\nexport function resolveValueRef(\n  ref: number | { field: string; aggregate?: AggOp } | undefined,\n  data: readonly Datum[],\n): number | null {\n  if (ref == null) return null;\n  if (typeof ref === 'number') return Number.isFinite(ref) ? ref : null;\n  const read = accessor(ref.field);\n  return aggregateValues(\n    (data ?? []).map((d) => read(d)),\n    ref.aggregate ?? 'sum',\n  );\n}\n\nexport function groupBy<T extends Record<string, unknown>>(\n  rows: T[],\n  keyFields: string[],\n): GroupedMap<T> {\n  const grouped: GroupedMap<T> = new Map();\n\n  for (const row of rows) {\n    let current = grouped;\n    for (let depth = 0; depth < keyFields.length; depth += 1) {\n      const key = toKey(getField(row, keyFields[depth]));\n      const isLeaf = depth === keyFields.length - 1;\n      const existing = current.get(key);\n\n      if (isLeaf) {\n        if (Array.isArray(existing)) {\n          existing.push(row);\n        } else {\n          current.set(key, [row]);\n        }\n      } else {\n        if (existing instanceof Map) {\n          current = existing;\n        } else {\n          const next: GroupedMap<T> = new Map();\n          current.set(key, next);\n          current = next;\n        }\n      }\n    }\n  }\n\n  return grouped;\n}\n\nexport function pivot(data: Datum[], options: PivotOptions): PivotResult {\n  const rowFields = options.rows ?? [];\n  const columnFields = options.columns ?? [];\n  const sort = options.sort ?? 'asc';\n\n  const rowTree = buildHeaderTree(data, rowFields, {\n    includeSubtotals: options.includeRowSubtotals === true,\n    includeGrandTotal: options.includeGrandTotals === true,\n    sort,\n  });\n  const columnTree = buildHeaderTree(data, columnFields, {\n    includeSubtotals: options.includeColumnSubtotals === true,\n    includeGrandTotal: columnFields.length === 0 || options.includeGrandTotals === true,\n    sort,\n  });\n  const columnLeaves = flattenColumnLeaves(columnTree);\n  const cube = buildPivotCube(data, rowFields, columnFields, options.values);\n  const flatRows = buildFlatRows(data, rowFields, columnLeaves, options, sort, cube);\n\n  const valueAt = (rowPath: string[], colPath: string[], valueIndex: number): number | null => {\n    return cube.valueAt(rowPath, colPath, valueIndex);\n  };\n\n  return {\n    rowTree,\n    columnTree,\n    columnLeaves,\n    rows: flatRows,\n    values: options.values,\n    valueAt,\n  };\n}\n\nfunction buildFlatRows(\n  data: Datum[],\n  rowFields: string[],\n  columnLeaves: PivotHeaderNode[],\n  options: PivotOptions,\n  sort: 'asc' | 'desc' | 'none',\n  cube: PivotCube,\n): PivotFlatRow[] {\n  if (rowFields.length === 0) {\n    return [makeFlatRow([], 0, true, false, columnLeaves, options, cube)];\n  }\n\n  const rows: PivotFlatRow[] = [];\n  appendFlatRows(rows, data, rowFields, [], 0, columnLeaves, options, sort, cube);\n\n  if (options.includeGrandTotals === true) {\n    rows.push(makeFlatRow([], 0, true, false, columnLeaves, options, cube));\n  }\n\n  return rows;\n}\n\nfunction appendFlatRows(\n  out: PivotFlatRow[],\n  data: Datum[],\n  fields: string[],\n  path: string[],\n  depth: number,\n  columnLeaves: PivotHeaderNode[],\n  options: PivotOptions,\n  sort: 'asc' | 'desc' | 'none',\n  cube: PivotCube,\n): void {\n  const field = fields[depth];\n  const groups = groupRowsAtDepth(data, field, sort);\n\n  for (const [key, groupRows] of groups) {\n    const nextPath = [...path, key];\n    if (depth === fields.length - 1) {\n      out.push(makeFlatRow(nextPath, depth, false, false, columnLeaves, options, cube));\n    } else {\n      appendFlatRows(out, groupRows, fields, nextPath, depth + 1, columnLeaves, options, sort, cube);\n      if (options.includeRowSubtotals === true) {\n        out.push(makeFlatRow(nextPath, depth, false, true, columnLeaves, options, cube));\n      }\n    }\n  }\n}\n\nfunction makeFlatRow(\n  path: string[],\n  depth: number,\n  isGrandTotal: boolean,\n  isSubtotal: boolean,\n  columnLeaves: PivotHeaderNode[],\n  options: PivotOptions,\n  cube: PivotCube,\n): PivotFlatRow {\n  const cellsByColumnKey = new Map<string, PivotCell>();\n\n  for (const columnLeaf of columnLeaves) {\n    const columnKey = makePathKey(columnLeaf.path);\n    cellsByColumnKey.set(columnKey, {\n      values: options.values.map((_, valueIndex) => cube.valueAt(path, columnLeaf.path, valueIndex)),\n    });\n  }\n\n  return {\n    path,\n    depth,\n    isGrandTotal: isGrandTotal || undefined,\n    isSubtotal: isSubtotal || undefined,\n    label: isGrandTotal\n      ? GRAND_TOTAL_LABEL\n      : isSubtotal\n        ? SUBTOTAL_LABEL\n        : (path[path.length - 1] ?? GRAND_TOTAL_LABEL),\n    cellsByColumnKey,\n  };\n}\n\nfunction buildHeaderTree(\n  data: Datum[],\n  fields: string[],\n  options: {\n    includeSubtotals: boolean;\n    includeGrandTotal: boolean;\n    sort: 'asc' | 'desc' | 'none';\n  },\n): PivotHeaderNode[] {\n  const roots = fields.length === 0 ? [] : buildHeaderLevel(data, fields, [], 0, options);\n\n  if (fields.length === 0 || options.includeGrandTotal) {\n    roots.push({\n      key: GRAND_TOTAL_LABEL,\n      path: [],\n      depth: 0,\n      children: [],\n      isGrandTotal: true,\n      span: 1,\n    });\n  }\n\n  return roots;\n}\n\nfunction buildHeaderLevel(\n  data: Datum[],\n  fields: string[],\n  path: string[],\n  depth: number,\n  options: {\n    includeSubtotals: boolean;\n    includeGrandTotal: boolean;\n    sort: 'asc' | 'desc' | 'none';\n  },\n): PivotHeaderNode[] {\n  const field = fields[depth];\n  const groups = groupRowsAtDepth(data, field, options.sort);\n  const nodes: PivotHeaderNode[] = [];\n\n  for (const [key, groupRows] of groups) {\n    const nextPath = [...path, key];\n    const children =\n      depth === fields.length - 1\n        ? []\n        : buildHeaderLevel(groupRows, fields, nextPath, depth + 1, options);\n\n    if (children.length > 0 && options.includeSubtotals) {\n      children.push({\n        key: SUBTOTAL_LABEL,\n        path: nextPath,\n        depth: depth + 1,\n        children: [],\n        isSubtotal: true,\n        span: 1,\n      });\n    }\n\n    const span = children.length === 0 ? 1 : children.reduce((sum, child) => sum + child.span, 0);\n    nodes.push({\n      key,\n      path: nextPath,\n      depth,\n      children,\n      span,\n    });\n  }\n\n  return nodes;\n}\n\nfunction flattenColumnLeaves(nodes: PivotHeaderNode[]): PivotHeaderNode[] {\n  const leaves: PivotHeaderNode[] = [];\n  for (const node of nodes) {\n    if (node.children.length === 0) {\n      leaves.push(node);\n    } else {\n      leaves.push(...flattenColumnLeaves(node.children));\n    }\n  }\n  return leaves;\n}\n\nfunction groupRowsAtDepth(\n  data: Datum[],\n  field: string,\n  sort: 'asc' | 'desc' | 'none',\n): Map<string, Datum[]> {\n  const grouped = new Map<string, Datum[]>();\n\n  for (const row of data) {\n    const key = toKey(getField(row, field));\n    const rows = grouped.get(key);\n    if (rows === undefined) {\n      grouped.set(key, [row]);\n    } else {\n      rows.push(row);\n    }\n  }\n\n  if (sort === 'none') {\n    return grouped;\n  }\n\n  return new Map(\n    [...grouped.entries()].sort(([left], [right]) => {\n      if (left === right) {\n        return 0;\n      }\n      const direction = sort === 'asc' ? 1 : -1;\n      return left < right ? -direction : direction;\n    }),\n  );\n}\n\nfunction coerceFinite(value: unknown): number | null {\n  if (value === null || value === undefined) {\n    return null;\n  }\n\n  const numberValue = toNumber(value);\n  return Number.isFinite(numberValue) ? numberValue : null;\n}\n\nfunction makePathKey(path: string[]): string {\n  return path.join(PATH_SEPARATOR);\n}\n\nfunction isMissingAggregateValue(value: unknown): boolean {\n  return value == null || value === '' || (typeof value === 'number' && Number.isNaN(value));\n}\n\n/** One distinct prefix path of an axis, in first-seen order (id 0 is the empty path). */\nexport interface PivotAxisEntry {\n  id: number;\n  parent: number;\n  depth: number;\n  key: string;\n  /** The first raw value seen for this key (keeps real types such as dates). */\n  value: unknown;\n}\n\n/** Aggregates for every (row prefix \u00D7 column prefix) path, built in one pass over the data. */\nexport interface PivotCube {\n  valueAt(rowPath: string[], colPath: string[], valueIndex: number): number | null;\n  /** Same as {@link valueAt} for interned path ids from {@link rowAxis}/{@link columnAxis}. */\n  valueAtIds(rowId: number, colId: number, valueIndex: number): number | null;\n  readonly rowAxis: readonly PivotAxisEntry[];\n  readonly columnAxis: readonly PivotAxisEntry[];\n}\n\ninterface AggregateState {\n  count?: number;\n  distinct?: Set<string>;\n  first?: number | null;\n  hasFirst?: boolean;\n  last?: number | null;\n  sum?: number;\n  numericCount?: number;\n  min?: number;\n  max?: number;\n  numbers?: number[];\n}\n\nclass AxisPathInterner {\n  private readonly keyIds: Map<string, number>[];\n  private readonly children = new Map<number, Map<number, number>>();\n  private nextKeyId = 1;\n  private nextPathId = 1;\n  readonly entries: PivotAxisEntry[] = [];\n\n  constructor(fields: readonly string[]) {\n    this.keyIds = fields.map(() => new Map<string, number>());\n  }\n\n  keyId(depth: number, key: string, create: boolean): number {\n    const ids = this.keyIds[depth];\n    let id = ids.get(key);\n    if (id === undefined && create) {\n      id = this.nextKeyId++;\n      ids.set(key, id);\n    }\n    return id ?? -1;\n  }\n\n  child(parentId: number, keyId: number, create: boolean, depth = 0, key = '', value?: unknown): number {\n    let children = this.children.get(parentId);\n    if (!children) {\n      if (!create) return -1;\n      children = new Map<number, number>();\n      this.children.set(parentId, children);\n    }\n    let id = children.get(keyId);\n    if (id === undefined && create) {\n      id = this.nextPathId++;\n      children.set(keyId, id);\n      this.entries.push({ id, parent: parentId, depth, key, value });\n    }\n    return id ?? -1;\n  }\n\n  pathId(path: readonly string[], create: boolean): number {\n    let id = 0;\n    for (let depth = 0; depth < path.length; depth++) {\n      const keyId = this.keyId(depth, path[depth], create);\n      if (keyId < 0) return -1;\n      id = this.child(id, keyId, create);\n      if (id < 0) return -1;\n    }\n    return id;\n  }\n}\n\nfunction emptyState(values: readonly PivotValueDef[]): AggregateState[] {\n  const states: AggregateState[] = [];\n  for (let i = 0; i < values.length; i++) states.push({});\n  return states;\n}\n\nexport function buildPivotCube(\n  data: Datum[],\n  rowFields: string[],\n  columnFields: string[],\n  values: PivotValueDef[],\n): PivotCube {\n  const rows = new AxisPathInterner(rowFields);\n  const columns = new AxisPathInterner(columnFields);\n  const rowReads = rowFields.map((field) => accessor(field));\n  const columnReads = columnFields.map((field) => accessor(field));\n  const valueReads = values.map((value) => accessor(value.field));\n  const rowPrefixIds = new Array<number>(rowFields.length + 1);\n  const columnPrefixIds = new Array<number>(columnFields.length + 1);\n  const valueCache = new Array<unknown>(values.length);\n  const numberCache = new Array<number | null>(values.length);\n  const buckets = new Map<number, Map<number, AggregateState[]>>();\n  const cache = new Map<number, Map<number, (number | null)[]>>();\n  for (const row of data) {\n    rowPrefixIds[0] = 0;\n    for (let depth = 0; depth < rowReads.length; depth++) {\n      const raw = rowReads[depth](row);\n      const key = toKey(raw);\n      const keyId = rows.keyId(depth, key, true);\n      rowPrefixIds[depth + 1] = rows.child(rowPrefixIds[depth], keyId, true, depth, key, raw);\n    }\n    columnPrefixIds[0] = 0;\n    for (let depth = 0; depth < columnReads.length; depth++) {\n      const raw = columnReads[depth](row);\n      const key = toKey(raw);\n      const keyId = columns.keyId(depth, key, true);\n      columnPrefixIds[depth + 1] = columns.child(columnPrefixIds[depth], keyId, true, depth, key, raw);\n    }\n    // Coerce each measure once per row, not once per (row prefix \u00D7 column prefix) bucket.\n    for (let valueIndex = 0; valueIndex < valueReads.length; valueIndex++) {\n      const raw = valueReads[valueIndex](row);\n      valueCache[valueIndex] = raw;\n      numberCache[valueIndex] = coerceFinite(raw);\n    }\n    for (let r = 0; r <= rowFields.length; r++) {\n      const rowId = rowPrefixIds[r];\n      let rowBuckets = buckets.get(rowId);\n      if (!rowBuckets) {\n        rowBuckets = new Map<number, AggregateState[]>();\n        buckets.set(rowId, rowBuckets);\n      }\n      for (let c = 0; c <= columnFields.length; c++) {\n        const colId = columnPrefixIds[c];\n        let bucket = rowBuckets.get(colId);\n        if (!bucket) {\n          bucket = emptyState(values);\n          rowBuckets.set(colId, bucket);\n        }\n        for (let valueIndex = 0; valueIndex < values.length; valueIndex++) {\n          addToState(bucket[valueIndex], values[valueIndex].op, valueCache[valueIndex], numberCache[valueIndex]);\n        }\n      }\n    }\n  }\n  const valueAtIds = (rowId: number, colId: number, valueIndex: number): number | null => {\n    const valueDef = values[valueIndex];\n    if (!valueDef) return null;\n    if (rowId < 0 || colId < 0) return aggregateValues([], valueDef.op);\n    let rowCache = cache.get(rowId);\n    if (!rowCache) {\n      rowCache = new Map<number, (number | null)[]>();\n      cache.set(rowId, rowCache);\n    }\n    let cached = rowCache.get(colId);\n    if (!cached) {\n      cached = new Array<number | null>(values.length);\n      rowCache.set(colId, cached);\n    } else if (valueIndex in cached) {\n      return cached[valueIndex];\n    }\n    const bucket = buckets.get(rowId)?.get(colId);\n    const result = bucket ? stateValue(bucket[valueIndex], valueDef.op) : aggregateValues([], valueDef.op);\n    cached[valueIndex] = result;\n    return result;\n  };\n  return {\n    valueAt: (rowPath, colPath, valueIndex) =>\n      valueAtIds(rows.pathId(rowPath, false), columns.pathId(colPath, false), valueIndex),\n    valueAtIds,\n    rowAxis: rows.entries,\n    columnAxis: columns.entries,\n  };\n}\n\nfunction addToState(state: AggregateState, op: AggOp, value: unknown, numeric: number | null = coerceFinite(value)): void {\n  if (op === 'count') {\n    if (value !== null && value !== undefined) state.count = (state.count ?? 0) + 1;\n    return;\n  }\n  if (op === 'countDistinct') {\n    if (!isMissingAggregateValue(value)) {\n      (state.distinct ??= new Set()).add(toKey(value));\n    }\n    return;\n  }\n  if (op === 'first') {\n    if (!state.hasFirst && value !== null && value !== undefined) {\n      state.first = numeric;\n      state.hasFirst = true;\n    }\n    return;\n  }\n  if (op === 'last') {\n    if (value !== null && value !== undefined) state.last = numeric;\n    return;\n  }\n  const numberValue = numeric;\n  if (numberValue === null) return;\n  if (op === 'min') {\n    state.min = state.min === undefined ? numberValue : Math.min(state.min, numberValue);\n  } else if (op === 'max') {\n    state.max = state.max === undefined ? numberValue : Math.max(state.max, numberValue);\n  } else if (op === 'median') {\n    (state.numbers ??= []).push(numberValue);\n  } else {\n    const previous = state.sum ?? 0;\n    state.sum = previous + numberValue;\n    state.numericCount = (state.numericCount ?? 0) + 1;\n    if (state.numbers || !Number.isFinite(state.sum) || Math.abs(numberValue) > 1e300) {\n      (state.numbers ??= [previous]).push(numberValue);\n    }\n  }\n}\n\nfunction stateValue(state: AggregateState, op: AggOp): number | null {\n  if (op === 'count') return state.count ?? 0;\n  if (op === 'countDistinct') return state.distinct?.size ? state.distinct.size : null;\n  if (op === 'first') return state.hasFirst ? (state.first ?? null) : null;\n  if (op === 'last') return state.last ?? null;\n  switch (op) {\n    case 'sum':\n      if (!state.numericCount) return null;\n      return state.numbers ? stableSum(state.numbers) : Number.isFinite(state.sum) ? state.sum! : null;\n    case 'mean':\n    case 'avg':\n      if (!state.numericCount) return null;\n      return state.numbers ? stableSum(state.numbers, state.numericCount) : Number.isFinite(state.sum) ? state.sum! / state.numericCount : null;\n    case 'min': {\n      return state.min ?? null;\n    }\n    case 'max': {\n      return state.max ?? null;\n    }\n    case 'median': {\n      const numbers = state.numbers ?? [];\n      if (numbers.length === 0) return null;\n      const sorted = [...numbers].sort((left, right) => left - right);\n      return medianSorted(sorted);\n    }\n  }\n}\n"],
+  "mappings": ";;;AACA,SAAS,UAAU,UAAU,OAAO,gBAAgB;AACpD,SAAS,cAAc,iBAAiB;AAgExC,MAAM,oBAAoB;AAC1B,MAAM,iBAAiB;AACvB,MAAM,iBAAiB;AAEhB,SAAS,gBAAgB,QAAmB,IAA0B;AAC3E,MAAI,OAAO,SAAS;AAClB,WAAO,OAAO,OAAO,CAAC,UAAU,UAAU,QAAQ,UAAU,MAAS,EAAE;AAAA,EACzE;AAEA,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,iBAAiB;AAC1B,UAAM,WAAW,IAAI,IAAI,OAAO,OAAO,CAAC,UAAU,CAAC,wBAAwB,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC;AAC7F,WAAO,SAAS,SAAS,IAAI,OAAO,SAAS;AAAA,EAC/C;AAEA,MAAI,OAAO,SAAS;AAClB,WAAO,aAAa,OAAO,KAAK,CAAC,UAAU,UAAU,QAAQ,UAAU,MAAS,CAAC;AAAA,EACnF;AAEA,MAAI,OAAO,QAAQ;AACjB,aAAS,QAAQ,OAAO,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;AAC1D,YAAM,QAAQ,OAAO,KAAK;AAC1B,UAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,eAAO,aAAa,KAAK;AAAA,MAC3B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,OAAO,IAAI,YAAY,EAAE,OAAO,CAAC,UAA2B,UAAU,IAAI;AAC1F,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;AAAA,EACT;AAEA,UAAQ,IAAI;AAAA,IACV,KAAK;AACH,aAAO,UAAU,OAAO;AAAA,IAC1B,KAAK;AAAA,IACL,KAAK;AACH,aAAO,UAAU,SAAS,QAAQ,MAAM;AAAA,IAC1C,KAAK,OAAO;AACV,UAAI,MAAM,QAAQ,CAAC;AACnB,iBAAW,SAAS,QAAS,OAAM,KAAK,IAAI,KAAK,KAAK;AACtD,aAAO;AAAA,IACT;AAAA,IACA,KAAK,OAAO;AACV,UAAI,MAAM,QAAQ,CAAC;AACnB,iBAAW,SAAS,QAAS,OAAM,KAAK,IAAI,KAAK,KAAK;AACtD,aAAO;AAAA,IACT;AAAA,IACA,KAAK,UAAU;AACb,YAAM,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,MAAM,UAAU,OAAO,KAAK;AAC9D,aAAO,aAAa,MAAM;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,gBACd,KACA,MACe;AACf,MAAI,OAAO,KAAM,QAAO;AACxB,MAAI,OAAO,QAAQ,SAAU,QAAO,OAAO,SAAS,GAAG,IAAI,MAAM;AACjE,QAAM,OAAO,SAAS,IAAI,KAAK;AAC/B,SAAO;AAAA,KACJ,QAAQ,CAAC,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;AAAA,IAC/B,IAAI,aAAa;AAAA,EACnB;AACF;AAEO,SAAS,QACd,MACA,WACe;AACf,QAAM,UAAyB,oBAAI,IAAI;AAEvC,aAAW,OAAO,MAAM;AACtB,QAAI,UAAU;AACd,aAAS,QAAQ,GAAG,QAAQ,UAAU,QAAQ,SAAS,GAAG;AACxD,YAAM,MAAM,MAAM,SAAS,KAAK,UAAU,KAAK,CAAC,CAAC;AACjD,YAAM,SAAS,UAAU,UAAU,SAAS;AAC5C,YAAM,WAAW,QAAQ,IAAI,GAAG;AAEhC,UAAI,QAAQ;AACV,YAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,mBAAS,KAAK,GAAG;AAAA,QACnB,OAAO;AACL,kBAAQ,IAAI,KAAK,CAAC,GAAG,CAAC;AAAA,QACxB;AAAA,MACF,OAAO;AACL,YAAI,oBAAoB,KAAK;AAC3B,oBAAU;AAAA,QACZ,OAAO;AACL,gBAAM,OAAsB,oBAAI,IAAI;AACpC,kBAAQ,IAAI,KAAK,IAAI;AACrB,oBAAU;AAAA,QACZ;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,MAAM,MAAe,SAAoC;AACvE,QAAM,YAAY,QAAQ,QAAQ,CAAC;AACnC,QAAM,eAAe,QAAQ,WAAW,CAAC;AACzC,QAAM,OAAO,QAAQ,QAAQ;AAE7B,QAAM,UAAU,gBAAgB,MAAM,WAAW;AAAA,IAC/C,kBAAkB,QAAQ,wBAAwB;AAAA,IAClD,mBAAmB,QAAQ,uBAAuB;AAAA,IAClD;AAAA,EACF,CAAC;AACD,QAAM,aAAa,gBAAgB,MAAM,cAAc;AAAA,IACrD,kBAAkB,QAAQ,2BAA2B;AAAA,IACrD,mBAAmB,aAAa,WAAW,KAAK,QAAQ,uBAAuB;AAAA,IAC/E;AAAA,EACF,CAAC;AACD,QAAM,eAAe,oBAAoB,UAAU;AACnD,QAAM,OAAO,eAAe,MAAM,WAAW,cAAc,QAAQ,MAAM;AACzE,QAAM,WAAW,cAAc,MAAM,WAAW,cAAc,SAAS,MAAM,IAAI;AAEjF,QAAM,UAAU,CAAC,SAAmB,SAAmB,eAAsC;AAC3F,WAAO,KAAK,QAAQ,SAAS,SAAS,UAAU;AAAA,EAClD;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAM;AAAA,IACN,QAAQ,QAAQ;AAAA,IAChB;AAAA,EACF;AACF;AAEA,SAAS,cACP,MACA,WACA,cACA,SACA,MACA,MACgB;AAChB,MAAI,UAAU,WAAW,GAAG;AAC1B,WAAO,CAAC,YAAY,CAAC,GAAG,GAAG,MAAM,OAAO,cAAc,SAAS,IAAI,CAAC;AAAA,EACtE;AAEA,QAAM,OAAuB,CAAC;AAC9B,iBAAe,MAAM,MAAM,WAAW,CAAC,GAAG,GAAG,cAAc,SAAS,MAAM,IAAI;AAE9E,MAAI,QAAQ,uBAAuB,MAAM;AACvC,SAAK,KAAK,YAAY,CAAC,GAAG,GAAG,MAAM,OAAO,cAAc,SAAS,IAAI,CAAC;AAAA,EACxE;AAEA,SAAO;AACT;AAEA,SAAS,eACP,KACA,MACA,QACA,MACA,OACA,cACA,SACA,MACA,MACM;AACN,QAAM,QAAQ,OAAO,KAAK;AAC1B,QAAM,SAAS,iBAAiB,MAAM,OAAO,IAAI;AAEjD,aAAW,CAAC,KAAK,SAAS,KAAK,QAAQ;AACrC,UAAM,WAAW,CAAC,GAAG,MAAM,GAAG;AAC9B,QAAI,UAAU,OAAO,SAAS,GAAG;AAC/B,UAAI,KAAK,YAAY,UAAU,OAAO,OAAO,OAAO,cAAc,SAAS,IAAI,CAAC;AAAA,IAClF,OAAO;AACL,qBAAe,KAAK,WAAW,QAAQ,UAAU,QAAQ,GAAG,cAAc,SAAS,MAAM,IAAI;AAC7F,UAAI,QAAQ,wBAAwB,MAAM;AACxC,YAAI,KAAK,YAAY,UAAU,OAAO,OAAO,MAAM,cAAc,SAAS,IAAI,CAAC;AAAA,MACjF;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,YACP,MACA,OACA,cACA,YACA,cACA,SACA,MACc;AACd,QAAM,mBAAmB,oBAAI,IAAuB;AAEpD,aAAW,cAAc,cAAc;AACrC,UAAM,YAAY,YAAY,WAAW,IAAI;AAC7C,qBAAiB,IAAI,WAAW;AAAA,MAC9B,QAAQ,QAAQ,OAAO,IAAI,CAAC,GAAG,eAAe,KAAK,QAAQ,MAAM,WAAW,MAAM,UAAU,CAAC;AAAA,IAC/F,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,cAAc,gBAAgB;AAAA,IAC9B,YAAY,cAAc;AAAA,IAC1B,OAAO,eACH,oBACA,aACE,iBACC,KAAK,KAAK,SAAS,CAAC,KAAK;AAAA,IAChC;AAAA,EACF;AACF;AAEA,SAAS,gBACP,MACA,QACA,SAKmB;AACnB,QAAM,QAAQ,OAAO,WAAW,IAAI,CAAC,IAAI,iBAAiB,MAAM,QAAQ,CAAC,GAAG,GAAG,OAAO;AAEtF,MAAI,OAAO,WAAW,KAAK,QAAQ,mBAAmB;AACpD,UAAM,KAAK;AAAA,MACT,KAAK;AAAA,MACL,MAAM,CAAC;AAAA,MACP,OAAO;AAAA,MACP,UAAU,CAAC;AAAA,MACX,cAAc;AAAA,MACd,MAAM;AAAA,IACR,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEA,SAAS,iBACP,MACA,QACA,MACA,OACA,SAKmB;AACnB,QAAM,QAAQ,OAAO,KAAK;AAC1B,QAAM,SAAS,iBAAiB,MAAM,OAAO,QAAQ,IAAI;AACzD,QAAM,QAA2B,CAAC;AAElC,aAAW,CAAC,KAAK,SAAS,KAAK,QAAQ;AACrC,UAAM,WAAW,CAAC,GAAG,MAAM,GAAG;AAC9B,UAAM,WACJ,UAAU,OAAO,SAAS,IACtB,CAAC,IACD,iBAAiB,WAAW,QAAQ,UAAU,QAAQ,GAAG,OAAO;AAEtE,QAAI,SAAS,SAAS,KAAK,QAAQ,kBAAkB;AACnD,eAAS,KAAK;AAAA,QACZ,KAAK;AAAA,QACL,MAAM;AAAA,QACN,OAAO,QAAQ;AAAA,QACf,UAAU,CAAC;AAAA,QACX,YAAY;AAAA,QACZ,MAAM;AAAA,MACR,CAAC;AAAA,IACH;AAEA,UAAM,OAAO,SAAS,WAAW,IAAI,IAAI,SAAS,OAAO,CAAC,KAAK,UAAU,MAAM,MAAM,MAAM,CAAC;AAC5F,UAAM,KAAK;AAAA,MACT;AAAA,MACA,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEA,SAAS,oBAAoB,OAA6C;AACxE,QAAM,SAA4B,CAAC;AACnC,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,SAAS,WAAW,GAAG;AAC9B,aAAO,KAAK,IAAI;AAAA,IAClB,OAAO;AACL,aAAO,KAAK,GAAG,oBAAoB,KAAK,QAAQ,CAAC;AAAA,IACnD;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,iBACP,MACA,OACA,MACsB;AACtB,QAAM,UAAU,oBAAI,IAAqB;AAEzC,aAAW,OAAO,MAAM;AACtB,UAAM,MAAM,MAAM,SAAS,KAAK,KAAK,CAAC;AACtC,UAAM,OAAO,QAAQ,IAAI,GAAG;AAC5B,QAAI,SAAS,QAAW;AACtB,cAAQ,IAAI,KAAK,CAAC,GAAG,CAAC;AAAA,IACxB,OAAO;AACL,WAAK,KAAK,GAAG;AAAA,IACf;AAAA,EACF;AAEA,MAAI,SAAS,QAAQ;AACnB,WAAO;AAAA,EACT;AAEA,SAAO,IAAI;AAAA,IACT,CAAC,GAAG,QAAQ,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAAM;AAC/C,UAAI,SAAS,OAAO;AAClB,eAAO;AAAA,MACT;AACA,YAAM,YAAY,SAAS,QAAQ,IAAI;AACvC,aAAO,OAAO,QAAQ,CAAC,YAAY;AAAA,IACrC,CAAC;AAAA,EACH;AACF;AAEA,SAAS,aAAa,OAA+B;AACnD,MAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,WAAO;AAAA,EACT;AAEA,QAAM,cAAc,SAAS,KAAK;AAClC,SAAO,OAAO,SAAS,WAAW,IAAI,cAAc;AACtD;AAEA,SAAS,YAAY,MAAwB;AAC3C,SAAO,KAAK,KAAK,cAAc;AACjC;AAEA,SAAS,wBAAwB,OAAyB;AACxD,SAAO,SAAS,QAAQ,UAAU,MAAO,OAAO,UAAU,YAAY,OAAO,MAAM,KAAK;AAC1F;AAkCA,MAAM,iBAAiB;AAAA,EAOrB,YAAY,QAA2B;AANvC,wBAAiB;AACjB,wBAAiB,YAAW,oBAAI,IAAiC;AACjE,wBAAQ,aAAY;AACpB,wBAAQ,cAAa;AACrB,wBAAS,WAA4B,CAAC;AAGpC,SAAK,SAAS,OAAO,IAAI,MAAM,oBAAI,IAAoB,CAAC;AAAA,EAC1D;AAAA,EAEA,MAAM,OAAe,KAAa,QAAyB;AACzD,UAAM,MAAM,KAAK,OAAO,KAAK;AAC7B,QAAI,KAAK,IAAI,IAAI,GAAG;AACpB,QAAI,OAAO,UAAa,QAAQ;AAC9B,WAAK,KAAK;AACV,UAAI,IAAI,KAAK,EAAE;AAAA,IACjB;AACA,WAAO,MAAM;AAAA,EACf;AAAA,EAEA,MAAM,UAAkB,OAAe,QAAiB,QAAQ,GAAG,MAAM,IAAI,OAAyB;AACpG,QAAI,WAAW,KAAK,SAAS,IAAI,QAAQ;AACzC,QAAI,CAAC,UAAU;AACb,UAAI,CAAC,OAAQ,QAAO;AACpB,iBAAW,oBAAI,IAAoB;AACnC,WAAK,SAAS,IAAI,UAAU,QAAQ;AAAA,IACtC;AACA,QAAI,KAAK,SAAS,IAAI,KAAK;AAC3B,QAAI,OAAO,UAAa,QAAQ;AAC9B,WAAK,KAAK;AACV,eAAS,IAAI,OAAO,EAAE;AACtB,WAAK,QAAQ,KAAK,EAAE,IAAI,QAAQ,UAAU,OAAO,KAAK,MAAM,CAAC;AAAA,IAC/D;AACA,WAAO,MAAM;AAAA,EACf;AAAA,EAEA,OAAO,MAAyB,QAAyB;AACvD,QAAI,KAAK;AACT,aAAS,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS;AAChD,YAAM,QAAQ,KAAK,MAAM,OAAO,KAAK,KAAK,GAAG,MAAM;AACnD,UAAI,QAAQ,EAAG,QAAO;AACtB,WAAK,KAAK,MAAM,IAAI,OAAO,MAAM;AACjC,UAAI,KAAK,EAAG,QAAO;AAAA,IACrB;AACA,WAAO;AAAA,EACT;AACF;AAEA,SAAS,WAAW,QAAoD;AACtE,QAAM,SAA2B,CAAC;AAClC,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAK,QAAO,KAAK,CAAC,CAAC;AACtD,SAAO;AACT;AAEO,SAAS,eACd,MACA,WACA,cACA,QACW;AACX,QAAM,OAAO,IAAI,iBAAiB,SAAS;AAC3C,QAAM,UAAU,IAAI,iBAAiB,YAAY;AACjD,QAAM,WAAW,UAAU,IAAI,CAAC,UAAU,SAAS,KAAK,CAAC;AACzD,QAAM,cAAc,aAAa,IAAI,CAAC,UAAU,SAAS,KAAK,CAAC;AAC/D,QAAM,aAAa,OAAO,IAAI,CAAC,UAAU,SAAS,MAAM,KAAK,CAAC;AAC9D,QAAM,eAAe,IAAI,MAAc,UAAU,SAAS,CAAC;AAC3D,QAAM,kBAAkB,IAAI,MAAc,aAAa,SAAS,CAAC;AACjE,QAAM,aAAa,IAAI,MAAe,OAAO,MAAM;AACnD,QAAM,cAAc,IAAI,MAAqB,OAAO,MAAM;AAC1D,QAAM,UAAU,oBAAI,IAA2C;AAC/D,QAAM,QAAQ,oBAAI,IAA4C;AAC9D,aAAW,OAAO,MAAM;AACtB,iBAAa,CAAC,IAAI;AAClB,aAAS,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS;AACpD,YAAM,MAAM,SAAS,KAAK,EAAE,GAAG;AAC/B,YAAM,MAAM,MAAM,GAAG;AACrB,YAAM,QAAQ,KAAK,MAAM,OAAO,KAAK,IAAI;AACzC,mBAAa,QAAQ,CAAC,IAAI,KAAK,MAAM,aAAa,KAAK,GAAG,OAAO,MAAM,OAAO,KAAK,GAAG;AAAA,IACxF;AACA,oBAAgB,CAAC,IAAI;AACrB,aAAS,QAAQ,GAAG,QAAQ,YAAY,QAAQ,SAAS;AACvD,YAAM,MAAM,YAAY,KAAK,EAAE,GAAG;AAClC,YAAM,MAAM,MAAM,GAAG;AACrB,YAAM,QAAQ,QAAQ,MAAM,OAAO,KAAK,IAAI;AAC5C,sBAAgB,QAAQ,CAAC,IAAI,QAAQ,MAAM,gBAAgB,KAAK,GAAG,OAAO,MAAM,OAAO,KAAK,GAAG;AAAA,IACjG;AAEA,aAAS,aAAa,GAAG,aAAa,WAAW,QAAQ,cAAc;AACrE,YAAM,MAAM,WAAW,UAAU,EAAE,GAAG;AACtC,iBAAW,UAAU,IAAI;AACzB,kBAAY,UAAU,IAAI,aAAa,GAAG;AAAA,IAC5C;AACA,aAAS,IAAI,GAAG,KAAK,UAAU,QAAQ,KAAK;AAC1C,YAAM,QAAQ,aAAa,CAAC;AAC5B,UAAI,aAAa,QAAQ,IAAI,KAAK;AAClC,UAAI,CAAC,YAAY;AACf,qBAAa,oBAAI,IAA8B;AAC/C,gBAAQ,IAAI,OAAO,UAAU;AAAA,MAC/B;AACA,eAAS,IAAI,GAAG,KAAK,aAAa,QAAQ,KAAK;AAC7C,cAAM,QAAQ,gBAAgB,CAAC;AAC/B,YAAI,SAAS,WAAW,IAAI,KAAK;AACjC,YAAI,CAAC,QAAQ;AACX,mBAAS,WAAW,MAAM;AAC1B,qBAAW,IAAI,OAAO,MAAM;AAAA,QAC9B;AACA,iBAAS,aAAa,GAAG,aAAa,OAAO,QAAQ,cAAc;AACjE,qBAAW,OAAO,UAAU,GAAG,OAAO,UAAU,EAAE,IAAI,WAAW,UAAU,GAAG,YAAY,UAAU,CAAC;AAAA,QACvG;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,QAAM,aAAa,CAAC,OAAe,OAAe,eAAsC;AACtF,UAAM,WAAW,OAAO,UAAU;AAClC,QAAI,CAAC,SAAU,QAAO;AACtB,QAAI,QAAQ,KAAK,QAAQ,EAAG,QAAO,gBAAgB,CAAC,GAAG,SAAS,EAAE;AAClE,QAAI,WAAW,MAAM,IAAI,KAAK;AAC9B,QAAI,CAAC,UAAU;AACb,iBAAW,oBAAI,IAA+B;AAC9C,YAAM,IAAI,OAAO,QAAQ;AAAA,IAC3B;AACA,QAAI,SAAS,SAAS,IAAI,KAAK;AAC/B,QAAI,CAAC,QAAQ;AACX,eAAS,IAAI,MAAqB,OAAO,MAAM;AAC/C,eAAS,IAAI,OAAO,MAAM;AAAA,IAC5B,WAAW,cAAc,QAAQ;AAC/B,aAAO,OAAO,UAAU;AAAA,IAC1B;AACA,UAAM,SAAS,QAAQ,IAAI,KAAK,GAAG,IAAI,KAAK;AAC5C,UAAM,SAAS,SAAS,WAAW,OAAO,UAAU,GAAG,SAAS,EAAE,IAAI,gBAAgB,CAAC,GAAG,SAAS,EAAE;AACrG,WAAO,UAAU,IAAI;AACrB,WAAO;AAAA,EACT;AACA,SAAO;AAAA,IACL,SAAS,CAAC,SAAS,SAAS,eAC1B,WAAW,KAAK,OAAO,SAAS,KAAK,GAAG,QAAQ,OAAO,SAAS,KAAK,GAAG,UAAU;AAAA,IACpF;AAAA,IACA,SAAS,KAAK;AAAA,IACd,YAAY,QAAQ;AAAA,EACtB;AACF;AAEA,SAAS,WAAW,OAAuB,IAAW,OAAgB,UAAyB,aAAa,KAAK,GAAS;AACxH,MAAI,OAAO,SAAS;AAClB,QAAI,UAAU,QAAQ,UAAU,OAAW,OAAM,SAAS,MAAM,SAAS,KAAK;AAC9E;AAAA,EACF;AACA,MAAI,OAAO,iBAAiB;AAC1B,QAAI,CAAC,wBAAwB,KAAK,GAAG;AACnC,OAAC,MAAM,aAAa,oBAAI,IAAI,GAAG,IAAI,MAAM,KAAK,CAAC;AAAA,IACjD;AACA;AAAA,EACF;AACA,MAAI,OAAO,SAAS;AAClB,QAAI,CAAC,MAAM,YAAY,UAAU,QAAQ,UAAU,QAAW;AAC5D,YAAM,QAAQ;AACd,YAAM,WAAW;AAAA,IACnB;AACA;AAAA,EACF;AACA,MAAI,OAAO,QAAQ;AACjB,QAAI,UAAU,QAAQ,UAAU,OAAW,OAAM,OAAO;AACxD;AAAA,EACF;AACA,QAAM,cAAc;AACpB,MAAI,gBAAgB,KAAM;AAC1B,MAAI,OAAO,OAAO;AAChB,UAAM,MAAM,MAAM,QAAQ,SAAY,cAAc,KAAK,IAAI,MAAM,KAAK,WAAW;AAAA,EACrF,WAAW,OAAO,OAAO;AACvB,UAAM,MAAM,MAAM,QAAQ,SAAY,cAAc,KAAK,IAAI,MAAM,KAAK,WAAW;AAAA,EACrF,WAAW,OAAO,UAAU;AAC1B,KAAC,MAAM,YAAY,CAAC,GAAG,KAAK,WAAW;AAAA,EACzC,OAAO;AACL,UAAM,WAAW,MAAM,OAAO;AAC9B,UAAM,MAAM,WAAW;AACvB,UAAM,gBAAgB,MAAM,gBAAgB,KAAK;AACjD,QAAI,MAAM,WAAW,CAAC,OAAO,SAAS,MAAM,GAAG,KAAK,KAAK,IAAI,WAAW,IAAI,OAAO;AACjF,OAAC,MAAM,YAAY,CAAC,QAAQ,GAAG,KAAK,WAAW;AAAA,IACjD;AAAA,EACF;AACF;AAEA,SAAS,WAAW,OAAuB,IAA0B;AACnE,MAAI,OAAO,QAAS,QAAO,MAAM,SAAS;AAC1C,MAAI,OAAO,gBAAiB,QAAO,MAAM,UAAU,OAAO,MAAM,SAAS,OAAO;AAChF,MAAI,OAAO,QAAS,QAAO,MAAM,WAAY,MAAM,SAAS,OAAQ;AACpE,MAAI,OAAO,OAAQ,QAAO,MAAM,QAAQ;AACxC,UAAQ,IAAI;AAAA,IACV,KAAK;AACH,UAAI,CAAC,MAAM,aAAc,QAAO;AAChC,aAAO,MAAM,UAAU,UAAU,MAAM,OAAO,IAAI,OAAO,SAAS,MAAM,GAAG,IAAI,MAAM,MAAO;AAAA,IAC9F,KAAK;AAAA,IACL,KAAK;AACH,UAAI,CAAC,MAAM,aAAc,QAAO;AAChC,aAAO,MAAM,UAAU,UAAU,MAAM,SAAS,MAAM,YAAY,IAAI,OAAO,SAAS,MAAM,GAAG,IAAI,MAAM,MAAO,MAAM,eAAe;AAAA,IACvI,KAAK,OAAO;AACV,aAAO,MAAM,OAAO;AAAA,IACtB;AAAA,IACA,KAAK,OAAO;AACV,aAAO,MAAM,OAAO;AAAA,IACtB;AAAA,IACA,KAAK,UAAU;AACb,YAAM,UAAU,MAAM,WAAW,CAAC;AAClC,UAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,YAAM,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,MAAM,UAAU,OAAO,KAAK;AAC9D,aAAO,aAAa,MAAM;AAAA,IAC5B;AAAA,EACF;AACF;",
   "names": []
 }

package/dist/render/chromeMotion.d.ts

@@ -0,0 +1,65 @@
+/**
+ * Chrome motion — lets axes, annotations and trendlines move with the marks.
+ *
+ * Chart chrome (gridlines, tick labels, reference lines, trendlines) is drawn by
+ * shared modules from each frame's model. To animate it, every module stashes
+ * what it drew — by name, on the surface the frame belongs to. While a morph
+ * runs, the runtime hands the outgoing frame's chrome to the transient view the
+ * tween paints on, and each module draws a blend of the outgoing and incoming
+ * chrome instead of jumping to the new scale. During an entrance the surface can
+ * carry a reveal progress so reference lines and trendlines draw in after the
+ * marks. Static draws (no morph, no entrance) are untouched.
+ */
+import type { Surface } from './surface.js';
+/** Everything chrome modules stashed while drawing one frame, keyed by module. */
+export type ChromeSnapshot = ReadonlyMap<string, unknown>;
+/**
+ * Below this opacity a chrome element is invisible: it is neither drawn nor
+ * carried into the next morph, so back-to-back updates can't pile up faded-out
+ * ticks, labels or reference lines.
+ */
+export declare const CHROME_VISIBLE = 0.002;
+/** The items of a blended frame that are still visible (what a morph stashes). */
+export declare function visibleItems<T extends {
+    alpha: number;
+}>(items: readonly T[]): T[];
+/**
+ * Morph progress a chrome frame may report while the animation is still in
+ * flight. Overshooting easings (`backOut`, `elasticOut`) pass 1 mid-flight; chrome
+ * stays in its animating state until the animation completes, when it is set to 1.
+ */
+export declare const CHROME_IN_FLIGHT: number;
+/** Remember chrome `name` as drawn on `surface` (static and tween frames alike). */
+export declare function stashChrome(surface: Surface, name: string, frame: unknown): void;
+/** Forget the stashed chrome (the surface is about to draw a new frame). */
+export declare function clearChrome(surface: Surface): void;
+/**
+ * Scale stashed chrome `name` (a list of items with `alpha`) by `factor` when it
+ * is captured — for labels an entrance fades in place without redrawing, so an
+ * update that interrupts it starts from how far they had faded in. Restashing
+ * the name, or a factor of 1, clears it.
+ */
+export declare function fadeChrome(surface: Surface, name: string, factor: number): void;
+/** The chrome on screen right now — captured before a redraw replaces it. */
+export declare function captureChrome(surface: Surface): ChromeSnapshot;
+/**
+ * Mark a tween view as drawing chrome `t` of the way from `from` to the frame
+ * being drawn. At `t >= 1` the view draws plain static chrome again, so the last
+ * frame of a morph is exactly the static frame.
+ */
+export declare function setChromeMorph(view: Surface, from: ChromeSnapshot | undefined, t: number): void;
+/** The outgoing chrome frame `name` and the morph progress, or null when not morphing. */
+export declare function chromeMorph<T>(surface: Surface, name: string): {
+    from: T;
+    t: number;
+} | null;
+/** Set (or clear, with null) the entrance reveal progress chrome reads on `surface`. */
+export declare function setChromeEntrance(surface: Surface, t: number | null): void;
+/** Entrance progress (0..1) while the surface's marks are still entering, else null. */
+export declare function chromeEntrance(surface: Surface): number | null;
+/**
+ * The share of an entrance a late element has played: 0 until `start`, rising
+ * to 1 by `end` (both fractions of the entrance), eased out.
+ */
+export declare function revealAt(t: number, start: number, end: number): number;
+//# sourceMappingURL=chromeMotion.d.ts.map

package/dist/render/chromeMotion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chromeMotion.d.ts","sourceRoot":"","sources":["../../src/render/chromeMotion.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAGzC,kFAAkF;AAClF,MAAM,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAE1D;;;;GAIG;AACH,eAAO,MAAM,cAAc,QAAQ,CAAC;AAEpC,kFAAkF;AAClF,wBAAgB,YAAY,CAAC,CAAC,SAAS;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,EAAE,CAElF;AAED;;;;GAIG;AACH,eAAO,MAAM,gBAAgB,QAAW,CAAC;AAOzC,oFAAoF;AACpF,wBAAgB,WAAW,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAMhF;AAED,4EAA4E;AAC5E,wBAAgB,WAAW,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,CAIlD;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAM/E;AAED,6EAA6E;AAC7E,wBAAgB,aAAa,CAAC,OAAO,EAAE,OAAO,GAAG,cAAc,CAU9D;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,cAAc,GAAG,SAAS,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAG/F;AAED,0FAA0F;AAC1F,wBAAgB,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,GAAG;IAAE,IAAI,EAAE,CAAC,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAK5F;AAED,wFAAwF;AACxF,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CAI1E;AAED,wFAAwF;AACxF,wBAAgB,cAAc,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAE9D;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAKtE"}

package/dist/render/chromeMotion.js

@@ -0,0 +1,79 @@
+import { surfaceOwner } from "./transient.js";
+const CHROME_VISIBLE = 2e-3;
+function visibleItems(items) {
+  return items.filter((item) => item.alpha > CHROME_VISIBLE);
+}
+const CHROME_IN_FLIGHT = 1 - 1e-6;
+const STASH = /* @__PURE__ */ new WeakMap();
+const MORPHS = /* @__PURE__ */ new WeakMap();
+const ENTRANCES = /* @__PURE__ */ new WeakMap();
+const FADES = /* @__PURE__ */ new WeakMap();
+function stashChrome(surface, name, frame) {
+  const owner = surfaceOwner(surface);
+  let stash = STASH.get(owner);
+  if (!stash) STASH.set(owner, stash = /* @__PURE__ */ new Map());
+  stash.set(name, frame);
+  FADES.get(owner)?.delete(name);
+}
+function clearChrome(surface) {
+  const owner = surfaceOwner(surface);
+  STASH.delete(owner);
+  FADES.delete(owner);
+}
+function fadeChrome(surface, name, factor) {
+  const owner = surfaceOwner(surface);
+  let fades = FADES.get(owner);
+  if (!fades) FADES.set(owner, fades = /* @__PURE__ */ new Map());
+  if (factor >= 1) fades.delete(name);
+  else fades.set(name, Math.max(0, factor));
+}
+function captureChrome(surface) {
+  const owner = surfaceOwner(surface);
+  const snapshot = new Map(STASH.get(owner) ?? []);
+  for (const [name, factor] of FADES.get(owner) ?? []) {
+    const items = snapshot.get(name);
+    if (Array.isArray(items)) {
+      snapshot.set(name, visibleItems(items.map((item) => ({ ...item, alpha: (item.alpha ?? 1) * factor }))));
+    }
+  }
+  return snapshot;
+}
+function setChromeMorph(view, from, t) {
+  if (from && from.size > 0 && t < 1) MORPHS.set(view, { from, t: Math.max(0, t) });
+  else MORPHS.delete(view);
+}
+function chromeMorph(surface, name) {
+  const morph = MORPHS.get(surface);
+  if (!morph) return null;
+  const from = morph.from.get(name);
+  return from === void 0 ? null : { from, t: morph.t };
+}
+function setChromeEntrance(surface, t) {
+  const owner = surfaceOwner(surface);
+  if (t == null || t >= 1) ENTRANCES.delete(owner);
+  else ENTRANCES.set(owner, Math.max(0, t));
+}
+function chromeEntrance(surface) {
+  return ENTRANCES.get(surfaceOwner(surface)) ?? null;
+}
+function revealAt(t, start, end) {
+  if (t <= start) return 0;
+  if (t >= end) return 1;
+  const k = (t - start) / (end - start);
+  return 1 - (1 - k) * (1 - k);
+}
+export {
+  CHROME_IN_FLIGHT,
+  CHROME_VISIBLE,
+  captureChrome,
+  chromeEntrance,
+  chromeMorph,
+  clearChrome,
+  fadeChrome,
+  revealAt,
+  setChromeEntrance,
+  setChromeMorph,
+  stashChrome,
+  visibleItems
+};
+//# sourceMappingURL=chromeMotion.js.map

package/dist/render/chromeMotion.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/render/chromeMotion.ts"],
+  "sourcesContent": ["/**\n * Chrome motion \u2014 lets axes, annotations and trendlines move with the marks.\n *\n * Chart chrome (gridlines, tick labels, reference lines, trendlines) is drawn by\n * shared modules from each frame's model. To animate it, every module stashes\n * what it drew \u2014 by name, on the surface the frame belongs to. While a morph\n * runs, the runtime hands the outgoing frame's chrome to the transient view the\n * tween paints on, and each module draws a blend of the outgoing and incoming\n * chrome instead of jumping to the new scale. During an entrance the surface can\n * carry a reveal progress so reference lines and trendlines draw in after the\n * marks. Static draws (no morph, no entrance) are untouched.\n */\n\nimport type { Surface } from './surface';\nimport { surfaceOwner } from './transient';\n\n/** Everything chrome modules stashed while drawing one frame, keyed by module. */\nexport type ChromeSnapshot = ReadonlyMap<string, unknown>;\n\n/**\n * Below this opacity a chrome element is invisible: it is neither drawn nor\n * carried into the next morph, so back-to-back updates can't pile up faded-out\n * ticks, labels or reference lines.\n */\nexport const CHROME_VISIBLE = 0.002;\n\n/** The items of a blended frame that are still visible (what a morph stashes). */\nexport function visibleItems<T extends { alpha: number }>(items: readonly T[]): T[] {\n  return items.filter((item) => item.alpha > CHROME_VISIBLE);\n}\n\n/**\n * Morph progress a chrome frame may report while the animation is still in\n * flight. Overshooting easings (`backOut`, `elasticOut`) pass 1 mid-flight; chrome\n * stays in its animating state until the animation completes, when it is set to 1.\n */\nexport const CHROME_IN_FLIGHT = 1 - 1e-6;\n\nconst STASH = new WeakMap<Surface, Map<string, unknown>>();\nconst MORPHS = new WeakMap<object, { from: ChromeSnapshot; t: number }>();\nconst ENTRANCES = new WeakMap<Surface, number>();\nconst FADES = new WeakMap<Surface, Map<string, number>>();\n\n/** Remember chrome `name` as drawn on `surface` (static and tween frames alike). */\nexport function stashChrome(surface: Surface, name: string, frame: unknown): void {\n  const owner = surfaceOwner(surface);\n  let stash = STASH.get(owner);\n  if (!stash) STASH.set(owner, (stash = new Map()));\n  stash.set(name, frame);\n  FADES.get(owner)?.delete(name);\n}\n\n/** Forget the stashed chrome (the surface is about to draw a new frame). */\nexport function clearChrome(surface: Surface): void {\n  const owner = surfaceOwner(surface);\n  STASH.delete(owner);\n  FADES.delete(owner);\n}\n\n/**\n * Scale stashed chrome `name` (a list of items with `alpha`) by `factor` when it\n * is captured \u2014 for labels an entrance fades in place without redrawing, so an\n * update that interrupts it starts from how far they had faded in. Restashing\n * the name, or a factor of 1, clears it.\n */\nexport function fadeChrome(surface: Surface, name: string, factor: number): void {\n  const owner = surfaceOwner(surface);\n  let fades = FADES.get(owner);\n  if (!fades) FADES.set(owner, (fades = new Map()));\n  if (factor >= 1) fades.delete(name);\n  else fades.set(name, Math.max(0, factor));\n}\n\n/** The chrome on screen right now \u2014 captured before a redraw replaces it. */\nexport function captureChrome(surface: Surface): ChromeSnapshot {\n  const owner = surfaceOwner(surface);\n  const snapshot = new Map(STASH.get(owner) ?? []);\n  for (const [name, factor] of FADES.get(owner) ?? []) {\n    const items = snapshot.get(name);\n    if (Array.isArray(items)) {\n      snapshot.set(name, visibleItems(items.map((item: { alpha?: number }) => ({ ...item, alpha: (item.alpha ?? 1) * factor }))));\n    }\n  }\n  return snapshot;\n}\n\n/**\n * Mark a tween view as drawing chrome `t` of the way from `from` to the frame\n * being drawn. At `t >= 1` the view draws plain static chrome again, so the last\n * frame of a morph is exactly the static frame.\n */\nexport function setChromeMorph(view: Surface, from: ChromeSnapshot | undefined, t: number): void {\n  if (from && from.size > 0 && t < 1) MORPHS.set(view, { from, t: Math.max(0, t) });\n  else MORPHS.delete(view);\n}\n\n/** The outgoing chrome frame `name` and the morph progress, or null when not morphing. */\nexport function chromeMorph<T>(surface: Surface, name: string): { from: T; t: number } | null {\n  const morph = MORPHS.get(surface);\n  if (!morph) return null;\n  const from = morph.from.get(name);\n  return from === undefined ? null : { from: from as T, t: morph.t };\n}\n\n/** Set (or clear, with null) the entrance reveal progress chrome reads on `surface`. */\nexport function setChromeEntrance(surface: Surface, t: number | null): void {\n  const owner = surfaceOwner(surface);\n  if (t == null || t >= 1) ENTRANCES.delete(owner);\n  else ENTRANCES.set(owner, Math.max(0, t));\n}\n\n/** Entrance progress (0..1) while the surface's marks are still entering, else null. */\nexport function chromeEntrance(surface: Surface): number | null {\n  return ENTRANCES.get(surfaceOwner(surface)) ?? null;\n}\n\n/**\n * The share of an entrance a late element has played: 0 until `start`, rising\n * to 1 by `end` (both fractions of the entrance), eased out.\n */\nexport function revealAt(t: number, start: number, end: number): number {\n  if (t <= start) return 0;\n  if (t >= end) return 1;\n  const k = (t - start) / (end - start);\n  return 1 - (1 - k) * (1 - k);\n}\n"],
+  "mappings": "AAcA,SAAS,oBAAoB;AAUtB,MAAM,iBAAiB;AAGvB,SAAS,aAA0C,OAA0B;AAClF,SAAO,MAAM,OAAO,CAAC,SAAS,KAAK,QAAQ,cAAc;AAC3D;AAOO,MAAM,mBAAmB,IAAI;AAEpC,MAAM,QAAQ,oBAAI,QAAuC;AACzD,MAAM,SAAS,oBAAI,QAAqD;AACxE,MAAM,YAAY,oBAAI,QAAyB;AAC/C,MAAM,QAAQ,oBAAI,QAAsC;AAGjD,SAAS,YAAY,SAAkB,MAAc,OAAsB;AAChF,QAAM,QAAQ,aAAa,OAAO;AAClC,MAAI,QAAQ,MAAM,IAAI,KAAK;AAC3B,MAAI,CAAC,MAAO,OAAM,IAAI,OAAQ,QAAQ,oBAAI,IAAI,CAAE;AAChD,QAAM,IAAI,MAAM,KAAK;AACrB,QAAM,IAAI,KAAK,GAAG,OAAO,IAAI;AAC/B;AAGO,SAAS,YAAY,SAAwB;AAClD,QAAM,QAAQ,aAAa,OAAO;AAClC,QAAM,OAAO,KAAK;AAClB,QAAM,OAAO,KAAK;AACpB;AAQO,SAAS,WAAW,SAAkB,MAAc,QAAsB;AAC/E,QAAM,QAAQ,aAAa,OAAO;AAClC,MAAI,QAAQ,MAAM,IAAI,KAAK;AAC3B,MAAI,CAAC,MAAO,OAAM,IAAI,OAAQ,QAAQ,oBAAI,IAAI,CAAE;AAChD,MAAI,UAAU,EAAG,OAAM,OAAO,IAAI;AAAA,MAC7B,OAAM,IAAI,MAAM,KAAK,IAAI,GAAG,MAAM,CAAC;AAC1C;AAGO,SAAS,cAAc,SAAkC;AAC9D,QAAM,QAAQ,aAAa,OAAO;AAClC,QAAM,WAAW,IAAI,IAAI,MAAM,IAAI,KAAK,KAAK,CAAC,CAAC;AAC/C,aAAW,CAAC,MAAM,MAAM,KAAK,MAAM,IAAI,KAAK,KAAK,CAAC,GAAG;AACnD,UAAM,QAAQ,SAAS,IAAI,IAAI;AAC/B,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,eAAS,IAAI,MAAM,aAAa,MAAM,IAAI,CAAC,UAA8B,EAAE,GAAG,MAAM,QAAQ,KAAK,SAAS,KAAK,OAAO,EAAE,CAAC,CAAC;AAAA,IAC5H;AAAA,EACF;AACA,SAAO;AACT;AAOO,SAAS,eAAe,MAAe,MAAkC,GAAiB;AAC/F,MAAI,QAAQ,KAAK,OAAO,KAAK,IAAI,EAAG,QAAO,IAAI,MAAM,EAAE,MAAM,GAAG,KAAK,IAAI,GAAG,CAAC,EAAE,CAAC;AAAA,MAC3E,QAAO,OAAO,IAAI;AACzB;AAGO,SAAS,YAAe,SAAkB,MAA6C;AAC5F,QAAM,QAAQ,OAAO,IAAI,OAAO;AAChC,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,OAAO,MAAM,KAAK,IAAI,IAAI;AAChC,SAAO,SAAS,SAAY,OAAO,EAAE,MAAiB,GAAG,MAAM,EAAE;AACnE;AAGO,SAAS,kBAAkB,SAAkB,GAAwB;AAC1E,QAAM,QAAQ,aAAa,OAAO;AAClC,MAAI,KAAK,QAAQ,KAAK,EAAG,WAAU,OAAO,KAAK;AAAA,MAC1C,WAAU,IAAI,OAAO,KAAK,IAAI,GAAG,CAAC,CAAC;AAC1C;AAGO,SAAS,eAAe,SAAiC;AAC9D,SAAO,UAAU,IAAI,aAAa,OAAO,CAAC,KAAK;AACjD;AAMO,SAAS,SAAS,GAAW,OAAe,KAAqB;AACtE,MAAI,KAAK,MAAO,QAAO;AACvB,MAAI,KAAK,IAAK,QAAO;AACrB,QAAM,KAAK,IAAI,UAAU,MAAM;AAC/B,SAAO,KAAK,IAAI,MAAM,IAAI;AAC5B;",
+  "names": []
+}

package/dist/render/pathSample.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Path sampling — evaluate a drawn path at an x position.
+ *
+ * Curve generators write into a {@link PathSink}; this sink records the
+ * segments instead of drawing them, so animation code can find exactly where an
+ * x-monotone path (a line chart's stroke under any curve interpolation) passes
+ * a given x — e.g. to ride a marker along the leading edge of a draw-on reveal.
+ */
+import type { PathSink } from '../shape/sink.js';
+export declare class PathSampler implements PathSink {
+    private readonly segments;
+    private x;
+    private y;
+    moveTo(x: number, y: number): void;
+    lineTo(x: number, y: number): void;
+    bezierCurveTo(c1x: number, c1y: number, c2x: number, c2y: number, x: number, y: number): void;
+    quadraticCurveTo(cx: number, cy: number, x: number, y: number): void;
+    arc(): void;
+    arcTo(_x1: number, _y1: number, x: number, y: number): void;
+    closePath(): void;
+    /** The path's y where it crosses `x`, or undefined when no segment spans it. */
+    yAt(x: number): number | undefined;
+}
+//# sourceMappingURL=pathSample.d.ts.map

package/dist/render/pathSample.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pathSample.d.ts","sourceRoot":"","sources":["../../src/render/pathSample.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AA6B9C,qBAAa,WAAY,YAAW,QAAQ;IAC1C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAiB;IAC1C,OAAO,CAAC,CAAC,CAAO;IAChB,OAAO,CAAC,CAAC,CAAO;IAEhB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI;IAKlC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI;IAMlC,aAAa,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI;IAM7F,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI;IAMpE,GAAG,IAAI,IAAI;IAIX,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI;IAI3D,SAAS,IAAI,IAAI;IAIjB,gFAAgF;IAChF,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;CAiBnC"}