@pibbl/core 0.0.2 → 0.0.3-alpha.90.1

package/dist/features/viz/lib/graph/treemap.js

@@ -0,0 +1,227 @@
+import { jsx, jsxs } from "@pibbl/core/jsx-runtime";
+import {
+  Group,
+  Rectangle,
+  resolveSignalValue
+} from "@pibbl/core";
+import {
+  defaultGraphLabelStyle,
+  GraphLabel,
+  resolveMarkStyle,
+  useGraphFrame
+} from "./shared.js";
+import {
+  checkedBounds,
+  finiteGap,
+  hierarchy,
+  partitionLabel,
+  partitionLabelFits
+} from "./hierarchy.js";
+function defaultPartitionCellStyle(cell) {
+  const shade = 82 - Math.min(cell.depth, 4) * 8;
+  return {
+    fill: `hsl(174 42% ${shade}%)`,
+    stroke: "#fbfaf6",
+    strokeWidth: 1,
+    cornerRadius: 3
+  };
+}
+function inset(box, amount) {
+  return {
+    x: box.x + amount,
+    y: box.y + amount,
+    width: Math.max(0, box.width - amount * 2),
+    height: Math.max(0, box.height - amount * 2)
+  };
+}
+function worstAspect(row, length) {
+  if (row.length === 0 || length <= 0) return Infinity;
+  const sum = row.reduce((total, item) => total + item.area, 0);
+  if (sum === 0) return Infinity;
+  const min = Math.min(...row.map((item) => item.area));
+  const max = Math.max(...row.map((item) => item.area));
+  const side2 = length * length;
+  return Math.max(side2 * max / (sum * sum), sum * sum / (side2 * min));
+}
+function squarify(records, box) {
+  const total = records.reduce((sum, record) => sum + record.value, 0);
+  const weighted = records.map((record) => ({
+    record,
+    area: box.width * box.height * (total === 0 ? 1 / records.length : record.value / total)
+  }));
+  const boxes = /* @__PURE__ */ new Map();
+  let remaining = { ...box };
+  let index = 0;
+  while (index < weighted.length && remaining.width > 0 && remaining.height > 0) {
+    const row = [weighted[index++]];
+    const length = Math.min(remaining.width, remaining.height);
+    while (index < weighted.length && worstAspect([...row, weighted[index]], length) <= worstAspect(row, length))
+      row.push(weighted[index++]);
+    const area = row.reduce((sum, item) => sum + item.area, 0);
+    if (remaining.width >= remaining.height) {
+      const rowWidth = area / remaining.height;
+      let y = remaining.y;
+      for (const item of row) {
+        const height = rowWidth === 0 ? 0 : item.area / rowWidth;
+        boxes.set(item.record, { x: remaining.x, y, width: rowWidth, height });
+        y += height;
+      }
+      remaining = {
+        x: remaining.x + rowWidth,
+        y: remaining.y,
+        width: Math.max(0, remaining.width - rowWidth),
+        height: remaining.height
+      };
+    } else {
+      const rowHeight = area / remaining.width;
+      let x = remaining.x;
+      for (const item of row) {
+        const width = rowHeight === 0 ? 0 : item.area / rowHeight;
+        boxes.set(item.record, { x, y: remaining.y, width, height: rowHeight });
+        x += width;
+      }
+      remaining = {
+        x: remaining.x,
+        y: remaining.y + rowHeight,
+        width: remaining.width,
+        height: Math.max(0, remaining.height - rowHeight)
+      };
+    }
+  }
+  return boxes;
+}
+function layoutTreemap(root, options) {
+  const bounds = checkedBounds(options.bounds, "layoutTreemap");
+  const gap = finiteGap(options.cellGap, 4, "layoutTreemap cellGap");
+  const padding = finiteGap(options.padding, 6, "layoutTreemap padding");
+  const headerHeight = finiteGap(
+    options.headerHeight,
+    26,
+    "layoutTreemap headerHeight"
+  );
+  const tree = hierarchy(root, options, "layoutTreemap", options.value);
+  const cells = [];
+  const add = (record, box, depth, parentKey, rootItem) => {
+    const children = record.collapsed ? [] : record.children;
+    const boxLabel = partitionLabel(record, options, {
+      x: box.x + 12,
+      y: box.y + 8,
+      width: Math.max(0, box.width - 24),
+      height: Math.max(0, box.height - 16)
+    });
+    if (!rootItem || record.isLeaf)
+      cells.push(
+        Object.freeze({
+          key: record.key,
+          datum: record.datum,
+          parentKey,
+          depth,
+          value: record.value,
+          fraction: tree.value === 0 ? 0 : record.value / tree.value,
+          isLeaf: record.isLeaf,
+          collapsed: record.collapsed,
+          bounds: Object.freeze(box),
+          label: partitionLabelFits(boxLabel, box) ? boxLabel : null
+        })
+      );
+    if (children.length === 0) return;
+    const content = inset(
+      {
+        x: box.x,
+        y: box.y + headerHeight,
+        width: box.width,
+        height: Math.max(0, box.height - headerHeight)
+      },
+      padding
+    );
+    const laidOut = squarify(children, content);
+    for (const child of children) {
+      const raw = laidOut.get(child);
+      const childBox = inset(raw, gap / 2);
+      add(
+        child,
+        childBox,
+        rootItem ? 0 : depth + 1,
+        rootItem ? null : record.key,
+        false
+      );
+    }
+  };
+  add(tree, bounds, 0, null, true);
+  return Object.freeze({
+    bounds,
+    rootKey: tree.key,
+    total: tree.value,
+    unit: options.unit,
+    cells: Object.freeze(cells)
+  });
+}
+function TreemapCell(props) {
+  const { bounds } = props.cell;
+  const { children, style, ...events } = props;
+  return /* @__PURE__ */ jsxs(Group, { children: [
+    /* @__PURE__ */ jsx(
+      Rectangle,
+      {
+        ...events,
+        style: {
+          ...resolveSignalValue(style),
+          left: bounds.x,
+          top: bounds.y,
+          width: bounds.width,
+          height: bounds.height
+        }
+      }
+    ),
+    children
+  ] });
+}
+function Treemap(props) {
+  const frame = useGraphFrame(props.style);
+  const root = resolveSignalValue(props.root);
+  if (frame.bounds.width === 0 || frame.bounds.height === 0)
+    return /* @__PURE__ */ jsx(Group, { style: frame.groupStyle, children: null });
+  const layout = layoutTreemap(root, {
+    ...props,
+    bounds: frame.bounds,
+    cellGap: frame.style.cellGap,
+    padding: frame.style.padding,
+    headerHeight: frame.style.headerHeight
+  });
+  const labelStyle = resolveSignalValue(props.labelStyle);
+  return /* @__PURE__ */ jsx(Group, { style: frame.groupStyle, children: layout.cells.map(
+    (cell) => props.renderCell ? /* @__PURE__ */ jsx(
+      Group,
+      {
+        onClick: (event) => props.onCellClick?.(cell, event),
+        children: props.renderCell(cell)
+      },
+      cell.key
+    ) : /* @__PURE__ */ jsx(
+      TreemapCell,
+      {
+        cell,
+        style: {
+          ...defaultPartitionCellStyle(cell),
+          ...resolveMarkStyle(cell, props.cellStyle)
+        },
+        onClick: (event) => props.onCellClick?.(cell, event),
+        children: cell.label && /* @__PURE__ */ jsx(
+          GraphLabel,
+          {
+            label: cell.label,
+            style: { ...defaultGraphLabelStyle(cell.label), ...labelStyle }
+          }
+        )
+      },
+      cell.key
+    )
+  ) });
+}
+export {
+  Treemap,
+  TreemapCell,
+  defaultPartitionCellStyle,
+  layoutTreemap
+};
+//# sourceMappingURL=treemap.js.map

package/dist/features/viz/lib/graph/treemap.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../src/features/viz/lib/graph/treemap.tsx"],
+  "sourcesContent": ["import type { NodeStyle } from \"./types.js\";\nimport {\n  Group,\n  Rectangle,\n  resolveSignalValue,\n  type PibblNode,\n} from \"@pibbl/core\";\nimport {\n  defaultGraphLabelStyle,\n  GraphLabel,\n  resolveMarkStyle,\n  useGraphFrame,\n} from \"./shared.js\";\nimport type {\n  Bounds,\n  PartitionCellGeometry,\n  PartitionLayout,\n  PartitionCellProps,\n  TreemapOptions,\n  TreemapProps,\n  TreemapStyle,\n} from \"./types.js\";\nimport {\n  checkedBounds,\n  finiteGap,\n  hierarchy,\n  partitionLabel,\n  partitionLabelFits,\n  type HierarchyRecord,\n} from \"./hierarchy.js\";\n\n/** Return the built-in depth-aware partition paint.\n * @param cell - Partition cell geometry.\n * @returns Ordinary rectangle style. @see {@link PartitionCellGeometry} */\nexport function defaultPartitionCellStyle<D>(\n  cell: PartitionCellGeometry<D>,\n): NodeStyle {\n  const shade = 82 - Math.min(cell.depth, 4) * 8;\n  return {\n    fill: `hsl(174 42% ${shade}%)`,\n    stroke: \"#fbfaf6\",\n    strokeWidth: 1,\n    cornerRadius: 3,\n  };\n}\n\nfunction inset(box: Bounds, amount: number): Bounds {\n  return {\n    x: box.x + amount,\n    y: box.y + amount,\n    width: Math.max(0, box.width - amount * 2),\n    height: Math.max(0, box.height - amount * 2),\n  };\n}\n\ninterface WeightedRecord<D> {\n  readonly record: HierarchyRecord<D>;\n  readonly area: number;\n}\n\nfunction worstAspect<D>(\n  row: readonly WeightedRecord<D>[],\n  length: number,\n): number {\n  if (row.length === 0 || length <= 0) return Infinity;\n  const sum = row.reduce((total, item) => total + item.area, 0);\n  if (sum === 0) return Infinity;\n  const min = Math.min(...row.map((item) => item.area));\n  const max = Math.max(...row.map((item) => item.area));\n  const side2 = length * length;\n  return Math.max((side2 * max) / (sum * sum), (sum * sum) / (side2 * min));\n}\n\n/** Stable squarification: append records while doing so improves the current row\u2019s worst aspect ratio. */\nfunction squarify<D>(\n  records: readonly HierarchyRecord<D>[],\n  box: Bounds,\n): ReadonlyMap<HierarchyRecord<D>, Bounds> {\n  const total = records.reduce((sum, record) => sum + record.value, 0);\n  const weighted = records.map((record) => ({\n    record,\n    area:\n      box.width *\n      box.height *\n      (total === 0 ? 1 / records.length : record.value / total),\n  }));\n  const boxes = new Map<HierarchyRecord<D>, Bounds>();\n  let remaining = { ...box };\n  let index = 0;\n  while (\n    index < weighted.length &&\n    remaining.width > 0 &&\n    remaining.height > 0\n  ) {\n    const row: WeightedRecord<D>[] = [weighted[index++]];\n    const length = Math.min(remaining.width, remaining.height);\n    while (\n      index < weighted.length &&\n      worstAspect([...row, weighted[index]], length) <= worstAspect(row, length)\n    )\n      row.push(weighted[index++]);\n    const area = row.reduce((sum, item) => sum + item.area, 0);\n    if (remaining.width >= remaining.height) {\n      const rowWidth = area / remaining.height;\n      let y = remaining.y;\n      for (const item of row) {\n        const height = rowWidth === 0 ? 0 : item.area / rowWidth;\n        boxes.set(item.record, { x: remaining.x, y, width: rowWidth, height });\n        y += height;\n      }\n      remaining = {\n        x: remaining.x + rowWidth,\n        y: remaining.y,\n        width: Math.max(0, remaining.width - rowWidth),\n        height: remaining.height,\n      };\n    } else {\n      const rowHeight = area / remaining.width;\n      let x = remaining.x;\n      for (const item of row) {\n        const width = rowHeight === 0 ? 0 : item.area / rowHeight;\n        boxes.set(item.record, { x, y: remaining.y, width, height: rowHeight });\n        x += width;\n      }\n      remaining = {\n        x: remaining.x,\n        y: remaining.y + rowHeight,\n        width: remaining.width,\n        height: Math.max(0, remaining.height - rowHeight),\n      };\n    }\n  }\n  return boxes;\n}\n\n/** Squarify weighted hierarchy leaves into stable, compact rectangles.\n * @param root - Hierarchy root.\n * @param options - Accessors, units, and finite bounds.\n * @returns Immutable partition geometry. @see {@link PartitionLayout} */\nexport function layoutTreemap<D>(\n  root: D,\n  options: TreemapOptions<D>,\n): PartitionLayout<D> {\n  const bounds = checkedBounds(options.bounds, \"layoutTreemap\");\n  const gap = finiteGap(options.cellGap, 4, \"layoutTreemap cellGap\");\n  const padding = finiteGap(options.padding, 6, \"layoutTreemap padding\");\n  const headerHeight = finiteGap(\n    options.headerHeight,\n    26,\n    \"layoutTreemap headerHeight\",\n  );\n  const tree = hierarchy(root, options, \"layoutTreemap\", options.value);\n  const cells: PartitionCellGeometry<D>[] = [];\n  const add = (\n    record: HierarchyRecord<D>,\n    box: Bounds,\n    depth: number,\n    parentKey: PartitionCellGeometry<D>[\"parentKey\"],\n    rootItem: boolean,\n  ) => {\n    const children = record.collapsed ? [] : record.children;\n    const boxLabel = partitionLabel(record, options, {\n      x: box.x + 12,\n      y: box.y + 8,\n      width: Math.max(0, box.width - 24),\n      height: Math.max(0, box.height - 16),\n    });\n    if (!rootItem || record.isLeaf)\n      cells.push(\n        Object.freeze({\n          key: record.key,\n          datum: record.datum,\n          parentKey,\n          depth,\n          value: record.value,\n          fraction: tree.value === 0 ? 0 : record.value / tree.value,\n          isLeaf: record.isLeaf,\n          collapsed: record.collapsed,\n          bounds: Object.freeze(box),\n          label: partitionLabelFits(boxLabel, box) ? boxLabel : null,\n        }),\n      );\n    if (children.length === 0) return;\n    const content = inset(\n      {\n        x: box.x,\n        y: box.y + headerHeight,\n        width: box.width,\n        height: Math.max(0, box.height - headerHeight),\n      },\n      padding,\n    );\n    const laidOut = squarify(children, content);\n    for (const child of children) {\n      const raw = laidOut.get(child)!;\n      const childBox = inset(raw, gap / 2);\n      add(\n        child,\n        childBox,\n        rootItem ? 0 : depth + 1,\n        rootItem ? null : record.key,\n        false,\n      );\n    }\n  };\n  add(tree, bounds, 0, null, true);\n  return Object.freeze({\n    bounds,\n    rootKey: tree.key,\n    total: tree.value,\n    unit: options.unit,\n    cells: Object.freeze(cells),\n  });\n}\n\n/** Paint one partition cell at its immutable geometry.\n * @param props - Cell geometry, paint, events, and optional global-coordinate children.\n * @returns Canvas composition. @see {@link PartitionCellGeometry} */\nexport function TreemapCell<D>(props: PartitionCellProps<D>): PibblNode {\n  const { bounds } = props.cell;\n  const { children, style, ...events } = props;\n  return (\n    <Group>\n      <Rectangle\n        {...events}\n        style={{\n          ...resolveSignalValue(style),\n          left: bounds.x,\n          top: bounds.y,\n          width: bounds.width,\n          height: bounds.height,\n        }}\n      />\n      {children}\n    </Group>\n  );\n}\n\n/** Render a squarified hierarchy with visible quantitative labels.\n * @param props - Reactive hierarchy data and presentation.\n * @returns Canvas composition. @see {@link layoutTreemap} */\nexport function Treemap<D>(props: TreemapProps<D>): PibblNode {\n  const frame = useGraphFrame<TreemapStyle>(props.style);\n  const root = resolveSignalValue(props.root);\n  if (frame.bounds.width === 0 || frame.bounds.height === 0)\n    return <Group style={frame.groupStyle}>{null}</Group>;\n  const layout = layoutTreemap(root, {\n    ...props,\n    bounds: frame.bounds,\n    cellGap: frame.style.cellGap,\n    padding: frame.style.padding,\n    headerHeight: frame.style.headerHeight,\n  });\n  const labelStyle = resolveSignalValue(props.labelStyle);\n  return (\n    <Group style={frame.groupStyle}>\n      {layout.cells.map((cell) =>\n        props.renderCell ? (\n          <Group\n            key={cell.key}\n            onClick={(event) => props.onCellClick?.(cell, event)}\n          >\n            {props.renderCell(cell)}\n          </Group>\n        ) : (\n          <TreemapCell\n            key={cell.key}\n            cell={cell}\n            style={{\n              ...defaultPartitionCellStyle(cell),\n              ...resolveMarkStyle(cell, props.cellStyle),\n            }}\n            onClick={(event) => props.onCellClick?.(cell, event)}\n          >\n            {cell.label && (\n              <GraphLabel\n                label={cell.label}\n                style={{ ...defaultGraphLabelStyle(cell.label), ...labelStyle }}\n              />\n            )}\n          </TreemapCell>\n        ),\n      )}\n    </Group>\n  );\n}\n"],
+  "mappings": "AA8NI,SACE,KADF;AA7NJ;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OAEK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAUP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAEK;AAKA,SAAS,0BACd,MACW;AACX,QAAM,QAAQ,KAAK,KAAK,IAAI,KAAK,OAAO,CAAC,IAAI;AAC7C,SAAO;AAAA,IACL,MAAM,eAAe,KAAK;AAAA,IAC1B,QAAQ;AAAA,IACR,aAAa;AAAA,IACb,cAAc;AAAA,EAChB;AACF;AAEA,SAAS,MAAM,KAAa,QAAwB;AAClD,SAAO;AAAA,IACL,GAAG,IAAI,IAAI;AAAA,IACX,GAAG,IAAI,IAAI;AAAA,IACX,OAAO,KAAK,IAAI,GAAG,IAAI,QAAQ,SAAS,CAAC;AAAA,IACzC,QAAQ,KAAK,IAAI,GAAG,IAAI,SAAS,SAAS,CAAC;AAAA,EAC7C;AACF;AAOA,SAAS,YACP,KACA,QACQ;AACR,MAAI,IAAI,WAAW,KAAK,UAAU,EAAG,QAAO;AAC5C,QAAM,MAAM,IAAI,OAAO,CAAC,OAAO,SAAS,QAAQ,KAAK,MAAM,CAAC;AAC5D,MAAI,QAAQ,EAAG,QAAO;AACtB,QAAM,MAAM,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC;AACpD,QAAM,MAAM,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC;AACpD,QAAM,QAAQ,SAAS;AACvB,SAAO,KAAK,IAAK,QAAQ,OAAQ,MAAM,MAAO,MAAM,OAAQ,QAAQ,IAAI;AAC1E;AAGA,SAAS,SACP,SACA,KACyC;AACzC,QAAM,QAAQ,QAAQ,OAAO,CAAC,KAAK,WAAW,MAAM,OAAO,OAAO,CAAC;AACnE,QAAM,WAAW,QAAQ,IAAI,CAAC,YAAY;AAAA,IACxC;AAAA,IACA,MACE,IAAI,QACJ,IAAI,UACH,UAAU,IAAI,IAAI,QAAQ,SAAS,OAAO,QAAQ;AAAA,EACvD,EAAE;AACF,QAAM,QAAQ,oBAAI,IAAgC;AAClD,MAAI,YAAY,EAAE,GAAG,IAAI;AACzB,MAAI,QAAQ;AACZ,SACE,QAAQ,SAAS,UACjB,UAAU,QAAQ,KAClB,UAAU,SAAS,GACnB;AACA,UAAM,MAA2B,CAAC,SAAS,OAAO,CAAC;AACnD,UAAM,SAAS,KAAK,IAAI,UAAU,OAAO,UAAU,MAAM;AACzD,WACE,QAAQ,SAAS,UACjB,YAAY,CAAC,GAAG,KAAK,SAAS,KAAK,CAAC,GAAG,MAAM,KAAK,YAAY,KAAK,MAAM;AAEzE,UAAI,KAAK,SAAS,OAAO,CAAC;AAC5B,UAAM,OAAO,IAAI,OAAO,CAAC,KAAK,SAAS,MAAM,KAAK,MAAM,CAAC;AACzD,QAAI,UAAU,SAAS,UAAU,QAAQ;AACvC,YAAM,WAAW,OAAO,UAAU;AAClC,UAAI,IAAI,UAAU;AAClB,iBAAW,QAAQ,KAAK;AACtB,cAAM,SAAS,aAAa,IAAI,IAAI,KAAK,OAAO;AAChD,cAAM,IAAI,KAAK,QAAQ,EAAE,GAAG,UAAU,GAAG,GAAG,OAAO,UAAU,OAAO,CAAC;AACrE,aAAK;AAAA,MACP;AACA,kBAAY;AAAA,QACV,GAAG,UAAU,IAAI;AAAA,QACjB,GAAG,UAAU;AAAA,QACb,OAAO,KAAK,IAAI,GAAG,UAAU,QAAQ,QAAQ;AAAA,QAC7C,QAAQ,UAAU;AAAA,MACpB;AAAA,IACF,OAAO;AACL,YAAM,YAAY,OAAO,UAAU;AACnC,UAAI,IAAI,UAAU;AAClB,iBAAW,QAAQ,KAAK;AACtB,cAAM,QAAQ,cAAc,IAAI,IAAI,KAAK,OAAO;AAChD,cAAM,IAAI,KAAK,QAAQ,EAAE,GAAG,GAAG,UAAU,GAAG,OAAO,QAAQ,UAAU,CAAC;AACtE,aAAK;AAAA,MACP;AACA,kBAAY;AAAA,QACV,GAAG,UAAU;AAAA,QACb,GAAG,UAAU,IAAI;AAAA,QACjB,OAAO,UAAU;AAAA,QACjB,QAAQ,KAAK,IAAI,GAAG,UAAU,SAAS,SAAS;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAMO,SAAS,cACd,MACA,SACoB;AACpB,QAAM,SAAS,cAAc,QAAQ,QAAQ,eAAe;AAC5D,QAAM,MAAM,UAAU,QAAQ,SAAS,GAAG,uBAAuB;AACjE,QAAM,UAAU,UAAU,QAAQ,SAAS,GAAG,uBAAuB;AACrE,QAAM,eAAe;AAAA,IACnB,QAAQ;AAAA,IACR;AAAA,IACA;AAAA,EACF;AACA,QAAM,OAAO,UAAU,MAAM,SAAS,iBAAiB,QAAQ,KAAK;AACpE,QAAM,QAAoC,CAAC;AAC3C,QAAM,MAAM,CACV,QACA,KACA,OACA,WACA,aACG;AACH,UAAM,WAAW,OAAO,YAAY,CAAC,IAAI,OAAO;AAChD,UAAM,WAAW,eAAe,QAAQ,SAAS;AAAA,MAC/C,GAAG,IAAI,IAAI;AAAA,MACX,GAAG,IAAI,IAAI;AAAA,MACX,OAAO,KAAK,IAAI,GAAG,IAAI,QAAQ,EAAE;AAAA,MACjC,QAAQ,KAAK,IAAI,GAAG,IAAI,SAAS,EAAE;AAAA,IACrC,CAAC;AACD,QAAI,CAAC,YAAY,OAAO;AACtB,YAAM;AAAA,QACJ,OAAO,OAAO;AAAA,UACZ,KAAK,OAAO;AAAA,UACZ,OAAO,OAAO;AAAA,UACd;AAAA,UACA;AAAA,UACA,OAAO,OAAO;AAAA,UACd,UAAU,KAAK,UAAU,IAAI,IAAI,OAAO,QAAQ,KAAK;AAAA,UACrD,QAAQ,OAAO;AAAA,UACf,WAAW,OAAO;AAAA,UAClB,QAAQ,OAAO,OAAO,GAAG;AAAA,UACzB,OAAO,mBAAmB,UAAU,GAAG,IAAI,WAAW;AAAA,QACxD,CAAC;AAAA,MACH;AACF,QAAI,SAAS,WAAW,EAAG;AAC3B,UAAM,UAAU;AAAA,MACd;AAAA,QACE,GAAG,IAAI;AAAA,QACP,GAAG,IAAI,IAAI;AAAA,QACX,OAAO,IAAI;AAAA,QACX,QAAQ,KAAK,IAAI,GAAG,IAAI,SAAS,YAAY;AAAA,MAC/C;AAAA,MACA;AAAA,IACF;AACA,UAAM,UAAU,SAAS,UAAU,OAAO;AAC1C,eAAW,SAAS,UAAU;AAC5B,YAAM,MAAM,QAAQ,IAAI,KAAK;AAC7B,YAAM,WAAW,MAAM,KAAK,MAAM,CAAC;AACnC;AAAA,QACE;AAAA,QACA;AAAA,QACA,WAAW,IAAI,QAAQ;AAAA,QACvB,WAAW,OAAO,OAAO;AAAA,QACzB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,MAAI,MAAM,QAAQ,GAAG,MAAM,IAAI;AAC/B,SAAO,OAAO,OAAO;AAAA,IACnB;AAAA,IACA,SAAS,KAAK;AAAA,IACd,OAAO,KAAK;AAAA,IACZ,MAAM,QAAQ;AAAA,IACd,OAAO,OAAO,OAAO,KAAK;AAAA,EAC5B,CAAC;AACH;AAKO,SAAS,YAAe,OAAyC;AACtE,QAAM,EAAE,OAAO,IAAI,MAAM;AACzB,QAAM,EAAE,UAAU,OAAO,GAAG,OAAO,IAAI;AACvC,SACE,qBAAC,SACC;AAAA;AAAA,MAAC;AAAA;AAAA,QACE,GAAG;AAAA,QACJ,OAAO;AAAA,UACL,GAAG,mBAAmB,KAAK;AAAA,UAC3B,MAAM,OAAO;AAAA,UACb,KAAK,OAAO;AAAA,UACZ,OAAO,OAAO;AAAA,UACd,QAAQ,OAAO;AAAA,QACjB;AAAA;AAAA,IACF;AAAA,IACC;AAAA,KACH;AAEJ;AAKO,SAAS,QAAW,OAAmC;AAC5D,QAAM,QAAQ,cAA4B,MAAM,KAAK;AACrD,QAAM,OAAO,mBAAmB,MAAM,IAAI;AAC1C,MAAI,MAAM,OAAO,UAAU,KAAK,MAAM,OAAO,WAAW;AACtD,WAAO,oBAAC,SAAM,OAAO,MAAM,YAAa,gBAAK;AAC/C,QAAM,SAAS,cAAc,MAAM;AAAA,IACjC,GAAG;AAAA,IACH,QAAQ,MAAM;AAAA,IACd,SAAS,MAAM,MAAM;AAAA,IACrB,SAAS,MAAM,MAAM;AAAA,IACrB,cAAc,MAAM,MAAM;AAAA,EAC5B,CAAC;AACD,QAAM,aAAa,mBAAmB,MAAM,UAAU;AACtD,SACE,oBAAC,SAAM,OAAO,MAAM,YACjB,iBAAO,MAAM;AAAA,IAAI,CAAC,SACjB,MAAM,aACJ;AAAA,MAAC;AAAA;AAAA,QAEC,SAAS,CAAC,UAAU,MAAM,cAAc,MAAM,KAAK;AAAA,QAElD,gBAAM,WAAW,IAAI;AAAA;AAAA,MAHjB,KAAK;AAAA,IAIZ,IAEA;AAAA,MAAC;AAAA;AAAA,QAEC;AAAA,QACA,OAAO;AAAA,UACL,GAAG,0BAA0B,IAAI;AAAA,UACjC,GAAG,iBAAiB,MAAM,MAAM,SAAS;AAAA,QAC3C;AAAA,QACA,SAAS,CAAC,UAAU,MAAM,cAAc,MAAM,KAAK;AAAA,QAElD,eAAK,SACJ;AAAA,UAAC;AAAA;AAAA,YACC,OAAO,KAAK;AAAA,YACZ,OAAO,EAAE,GAAG,uBAAuB,KAAK,KAAK,GAAG,GAAG,WAAW;AAAA;AAAA,QAChE;AAAA;AAAA,MAZG,KAAK;AAAA,IAcZ;AAAA,EAEJ,GACF;AAEJ;",
+  "names": []
+}