@pibbl/core 0.0.2 → 0.0.3-alpha.109.1

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../src/features/viz/lib/graph/matrix.tsx"],
+  "sourcesContent": ["import { Group, Rectangle, resolveSignalValue } from \"@pibbl/core\";\nimport type { PibblNode } from \"@pibbl/core\";\nimport type {\n  Accessor,\n  AdjacencyMatrixProps,\n  MatrixCellGeometry,\n  MatrixCellProps,\n  MatrixData,\n  MatrixLayout,\n  MatrixOptions,\n  NodeStyle,\n  VizKey,\n} from \"./types.js\";\nimport {\n  defaultGraphLabelStyle,\n  GraphLabel,\n  resolveMarkStyle,\n  useGraphFrame,\n} from \"./shared.js\";\n\nfunction value<D, V>(accessor: Accessor<D, V>, datum: D): V {\n  return typeof accessor === \"function\"\n    ? accessor(datum)\n    : (datum as Record<PropertyKey, V>)[accessor];\n}\nfunction finite(input: number, name: string, nonnegative = false): number {\n  if (!Number.isFinite(input) || (nonnegative && input < 0))\n    throw new RangeError(\n      `layoutMatrix: ${name} must be finite${nonnegative ? \" and nonnegative\" : \"\"}.`,\n    );\n  return input;\n}\nfunction bounds(\n  input: MatrixOptions<unknown, unknown, unknown>[\"bounds\"],\n): void {\n  finite(input.x, \"bounds.x\");\n  finite(input.y, \"bounds.y\");\n  finite(input.width, \"bounds.width\", true);\n  finite(input.height, \"bounds.height\", true);\n}\nfunction label(\n  text: string,\n  x: number,\n  y: number,\n  width: number,\n  height: number,\n  rotationDegrees = 0,\n) {\n  return Object.freeze({\n    text,\n    bounds: Object.freeze({ x, y, width, height }),\n    rotationDegrees,\n  });\n}\n\n/** Computes ordered cells for an explicit row/column relation matrix.\n * @param data - Explicit rows, columns, and ordered relations. See {@link MatrixData}.\n * @param options - Typed accessors, dimensions, labels, and unit. See {@link MatrixOptions}.\n * @returns Immutable cell and label geometry. See {@link MatrixLayout}.\n */\nexport function layoutMatrix<R, C, E>(\n  data: MatrixData<R, C, E>,\n  options: MatrixOptions<R, C, E>,\n): MatrixLayout<R, C, E> {\n  bounds(options.bounds as MatrixOptions<unknown, unknown, unknown>[\"bounds\"]);\n  const gap = finite(options.cellGap ?? 2, \"cellGap\", true);\n  const rowLabelWidth = finite(\n    options.rowLabelWidth ?? 96,\n    \"rowLabelWidth\",\n    true,\n  );\n  const columnLabelHeight = finite(\n    options.columnLabelHeight ?? 54,\n    \"columnLabelHeight\",\n    true,\n  );\n  const rowKeys = new Map<VizKey, R>(),\n    columnKeys = new Map<VizKey, C>();\n  for (const row of data.rows) {\n    const key = value(options.rowKey, row);\n    if (rowKeys.has(key))\n      throw new Error(`layoutMatrix: duplicate row key ${String(key)}.`);\n    rowKeys.set(key, row);\n  }\n  for (const column of data.columns) {\n    const key = value(options.columnKey, column);\n    if (columnKeys.has(key))\n      throw new Error(`layoutMatrix: duplicate column key ${String(key)}.`);\n    columnKeys.set(key, column);\n  }\n  const width = Math.max(\n    0,\n    (options.bounds.width -\n      rowLabelWidth -\n      Math.max(0, data.columns.length - 1) * gap) /\n      Math.max(1, data.columns.length),\n  );\n  const height = Math.max(\n    0,\n    (options.bounds.height -\n      columnLabelHeight -\n      Math.max(0, data.rows.length - 1) * gap) /\n      Math.max(1, data.rows.length),\n  );\n  const grouped = new Map<string, E[]>();\n  for (const relation of data.relations) {\n    const source = value(options.source, relation),\n      target = value(options.target, relation);\n    if (!rowKeys.has(source))\n      throw new RangeError(\n        `layoutMatrix: source ${String(source)} is not a row key.`,\n      );\n    if (!columnKeys.has(target))\n      throw new RangeError(\n        `layoutMatrix: target ${String(target)} is not a column key.`,\n      );\n    const amount = value(options.value, relation);\n    finite(amount, \"relation value\");\n    const key = `${typeof source}:${String(source)}\\u0000${typeof target}:${String(target)}`;\n    const records = grouped.get(key);\n    if (records) records.push(relation);\n    else grouped.set(key, [relation]);\n  }\n  const cells: MatrixCellGeometry<R, C, E>[] = [];\n  const rowLabels = data.rows.map((row, index) =>\n    label(\n      options.rowLabel\n        ? value(options.rowLabel, row)\n        : String(value(options.rowKey, row)),\n      options.bounds.x,\n      options.bounds.y + columnLabelHeight + index * (height + gap),\n      rowLabelWidth - gap,\n      height,\n    ),\n  );\n  const columnLabels = data.columns.map((column, index) =>\n    label(\n      options.columnLabel\n        ? value(options.columnLabel, column)\n        : String(value(options.columnKey, column)),\n      options.bounds.x + rowLabelWidth + index * (width + gap),\n      options.bounds.y,\n      width,\n      columnLabelHeight - gap,\n    ),\n  );\n  for (let r = 0; r < data.rows.length; r++)\n    for (let c = 0; c < data.columns.length; c++) {\n      const row = data.rows[r],\n        column = data.columns[c],\n        rowKey = value(options.rowKey, row),\n        columnKey = value(options.columnKey, column);\n      const records =\n        grouped.get(\n          `${typeof rowKey}:${String(rowKey)}\\u0000${typeof columnKey}:${String(columnKey)}`,\n        ) ?? [];\n      const total = records.reduce(\n        (sum, record) => sum + value(options.value, record),\n        0,\n      );\n      finite(total, \"cell aggregate\");\n      const cellBounds = Object.freeze({\n        x: options.bounds.x + rowLabelWidth + c * (width + gap),\n        y: options.bounds.y + columnLabelHeight + r * (height + gap),\n        width,\n        height,\n      });\n      cells.push(\n        Object.freeze({\n          row,\n          column,\n          rowKey,\n          columnKey,\n          records: Object.freeze(records),\n          value: records.length ? total : null,\n          bounds: cellBounds,\n          label: records.length\n            ? label(\n                options.formatValue\n                  ? options.formatValue(total)\n                  : `${total} ${options.unit}`,\n                cellBounds.x,\n                cellBounds.y,\n                width,\n                height,\n              )\n            : null,\n        }),\n      );\n    }\n  return Object.freeze({\n    bounds: Object.freeze({ ...options.bounds }),\n    unit: options.unit,\n    cells: Object.freeze(cells),\n    rowLabels: Object.freeze(rowLabels),\n    columnLabels: Object.freeze(columnLabels),\n  });\n}\n\n/** Default cell paint for custom matrix compositions.\n * @param cell - Cell geometry.\n * @param range - Observed numeric extent.\n * @returns Resolved cell paint.\n * @see {@link MatrixCell}\n */\nexport function defaultMatrixCellStyle<R, C, E>(\n  cell: MatrixCellGeometry<R, C, E>,\n  range: Readonly<{ minimum: number; maximum: number }>,\n): NodeStyle {\n  const value = cell.value ?? 0,\n    span = range.maximum - range.minimum;\n  const alpha =\n    cell.value === null\n      ? 0.05\n      : span <= 0\n        ? 0.8\n        : 0.16 +\n          0.74 * Math.max(0, Math.min(1, (value - range.minimum) / span));\n  return { fill: `rgba(15, 118, 110, ${alpha})`, cornerRadius: 2 };\n}\n\n/** Draw one supplied matrix cell geometry.\n * @param argument - Cell props.\n * @returns Canvas node.\n * @see {@link MatrixCellProps}\n */\nexport function MatrixCell<R, C, E>({\n  cell,\n  style: input,\n  children,\n  ...events\n}: MatrixCellProps<R, C, E>): PibblNode {\n  const style = resolveSignalValue(input) ?? {};\n  return (\n    <Group>\n      <Rectangle\n        {...events}\n        style={{\n          ...style,\n          left: cell.bounds.x,\n          top: cell.bounds.y,\n          width: cell.bounds.width,\n          height: cell.bounds.height,\n        }}\n      />\n      {children}\n    </Group>\n  );\n}\n\n/** Render an ordered relation matrix with default marks and labels.\n * @param props - Matrix data and presentation.\n * @returns Canvas node.\n * @see {@link layoutMatrix}\n */\nexport function AdjacencyMatrix<R, C, E>(\n  props: AdjacencyMatrixProps<R, C, E>,\n): PibblNode {\n  const frame = useGraphFrame(props.style);\n  if (!frame.bounds.width || !frame.bounds.height)\n    return <Group style={frame.groupStyle}>{null}</Group>;\n  const data = resolveSignalValue(props.data);\n  const style = frame.style;\n  const layout = layoutMatrix(data, {\n    ...props,\n    bounds: frame.bounds,\n    cellGap: style.cellGap,\n    rowLabelWidth: style.rowLabelWidth,\n    columnLabelHeight: style.columnLabelHeight,\n  });\n  const values = layout.cells\n    .map((cell) => cell.value)\n    .filter((entry): entry is number => entry !== null);\n  const minimum = Math.min(...values, 0),\n    maximum = Math.max(...values, 1);\n  return (\n    <Group style={frame.groupStyle}>\n      {layout.cells.map((cell) => (\n        <Group\n          key={JSON.stringify([cell.rowKey, cell.columnKey])}\n          onClick={(event) => props.onCellClick?.(cell, event)}\n        >\n          {props.renderCell ? (\n            props.renderCell(cell)\n          ) : (\n            <Group>\n              <MatrixCell\n                cell={cell}\n                keyboardFocusable={Boolean(props.onCellClick)}\n                style={{\n                  ...defaultMatrixCellStyle(cell, { minimum, maximum }),\n                  ...resolveMarkStyle(cell, props.cellStyle),\n                }}\n              />\n              {cell.label && (\n                <GraphLabel\n                  label={cell.label}\n                  style={{\n                    ...defaultGraphLabelStyle(cell.label),\n                    fill:\n                      cell.value !== null &&\n                      (cell.value - minimum) / (maximum - minimum || 1) >= 0.5\n                        ? \"#ffffff\"\n                        : \"#123c34\",\n                    textAlign: \"center\",\n                    ...resolveSignalValue(props.labelStyle),\n                  }}\n                />\n              )}\n            </Group>\n          )}\n        </Group>\n      ))}\n      {layout.rowLabels.concat(layout.columnLabels).map((entry, index) => (\n        <GraphLabel\n          key={`axis-${index}`}\n          label={entry}\n          style={{\n            ...defaultGraphLabelStyle(entry),\n            ...resolveSignalValue(props.labelStyle),\n          }}\n        />\n      ))}\n    </Group>\n  );\n}\n"],
+  "mappings": "AA0OI,SACE,KADF;AA1OJ,SAAS,OAAO,WAAW,0BAA0B;AAarD;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAEP,SAAS,MAAY,UAA0B,OAAa;AAC1D,SAAO,OAAO,aAAa,aACvB,SAAS,KAAK,IACb,MAAiC,QAAQ;AAChD;AACA,SAAS,OAAO,OAAe,MAAc,cAAc,OAAe;AACxE,MAAI,CAAC,OAAO,SAAS,KAAK,KAAM,eAAe,QAAQ;AACrD,UAAM,IAAI;AAAA,MACR,iBAAiB,IAAI,kBAAkB,cAAc,qBAAqB,EAAE;AAAA,IAC9E;AACF,SAAO;AACT;AACA,SAAS,OACP,OACM;AACN,SAAO,MAAM,GAAG,UAAU;AAC1B,SAAO,MAAM,GAAG,UAAU;AAC1B,SAAO,MAAM,OAAO,gBAAgB,IAAI;AACxC,SAAO,MAAM,QAAQ,iBAAiB,IAAI;AAC5C;AACA,SAAS,MACP,MACA,GACA,GACA,OACA,QACA,kBAAkB,GAClB;AACA,SAAO,OAAO,OAAO;AAAA,IACnB;AAAA,IACA,QAAQ,OAAO,OAAO,EAAE,GAAG,GAAG,OAAO,OAAO,CAAC;AAAA,IAC7C;AAAA,EACF,CAAC;AACH;AAOO,SAAS,aACd,MACA,SACuB;AACvB,SAAO,QAAQ,MAA4D;AAC3E,QAAM,MAAM,OAAO,QAAQ,WAAW,GAAG,WAAW,IAAI;AACxD,QAAM,gBAAgB;AAAA,IACpB,QAAQ,iBAAiB;AAAA,IACzB;AAAA,IACA;AAAA,EACF;AACA,QAAM,oBAAoB;AAAA,IACxB,QAAQ,qBAAqB;AAAA,IAC7B;AAAA,IACA;AAAA,EACF;AACA,QAAM,UAAU,oBAAI,IAAe,GACjC,aAAa,oBAAI,IAAe;AAClC,aAAW,OAAO,KAAK,MAAM;AAC3B,UAAM,MAAM,MAAM,QAAQ,QAAQ,GAAG;AACrC,QAAI,QAAQ,IAAI,GAAG;AACjB,YAAM,IAAI,MAAM,mCAAmC,OAAO,GAAG,CAAC,GAAG;AACnE,YAAQ,IAAI,KAAK,GAAG;AAAA,EACtB;AACA,aAAW,UAAU,KAAK,SAAS;AACjC,UAAM,MAAM,MAAM,QAAQ,WAAW,MAAM;AAC3C,QAAI,WAAW,IAAI,GAAG;AACpB,YAAM,IAAI,MAAM,sCAAsC,OAAO,GAAG,CAAC,GAAG;AACtE,eAAW,IAAI,KAAK,MAAM;AAAA,EAC5B;AACA,QAAM,QAAQ,KAAK;AAAA,IACjB;AAAA,KACC,QAAQ,OAAO,QACd,gBACA,KAAK,IAAI,GAAG,KAAK,QAAQ,SAAS,CAAC,IAAI,OACvC,KAAK,IAAI,GAAG,KAAK,QAAQ,MAAM;AAAA,EACnC;AACA,QAAM,SAAS,KAAK;AAAA,IAClB;AAAA,KACC,QAAQ,OAAO,SACd,oBACA,KAAK,IAAI,GAAG,KAAK,KAAK,SAAS,CAAC,IAAI,OACpC,KAAK,IAAI,GAAG,KAAK,KAAK,MAAM;AAAA,EAChC;AACA,QAAM,UAAU,oBAAI,IAAiB;AACrC,aAAW,YAAY,KAAK,WAAW;AACrC,UAAM,SAAS,MAAM,QAAQ,QAAQ,QAAQ,GAC3C,SAAS,MAAM,QAAQ,QAAQ,QAAQ;AACzC,QAAI,CAAC,QAAQ,IAAI,MAAM;AACrB,YAAM,IAAI;AAAA,QACR,wBAAwB,OAAO,MAAM,CAAC;AAAA,MACxC;AACF,QAAI,CAAC,WAAW,IAAI,MAAM;AACxB,YAAM,IAAI;AAAA,QACR,wBAAwB,OAAO,MAAM,CAAC;AAAA,MACxC;AACF,UAAM,SAAS,MAAM,QAAQ,OAAO,QAAQ;AAC5C,WAAO,QAAQ,gBAAgB;AAC/B,UAAM,MAAM,GAAG,OAAO,MAAM,IAAI,OAAO,MAAM,CAAC,KAAS,OAAO,MAAM,IAAI,OAAO,MAAM,CAAC;AACtF,UAAM,UAAU,QAAQ,IAAI,GAAG;AAC/B,QAAI,QAAS,SAAQ,KAAK,QAAQ;AAAA,QAC7B,SAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC;AAAA,EAClC;AACA,QAAM,QAAuC,CAAC;AAC9C,QAAM,YAAY,KAAK,KAAK;AAAA,IAAI,CAAC,KAAK,UACpC;AAAA,MACE,QAAQ,WACJ,MAAM,QAAQ,UAAU,GAAG,IAC3B,OAAO,MAAM,QAAQ,QAAQ,GAAG,CAAC;AAAA,MACrC,QAAQ,OAAO;AAAA,MACf,QAAQ,OAAO,IAAI,oBAAoB,SAAS,SAAS;AAAA,MACzD,gBAAgB;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AACA,QAAM,eAAe,KAAK,QAAQ;AAAA,IAAI,CAAC,QAAQ,UAC7C;AAAA,MACE,QAAQ,cACJ,MAAM,QAAQ,aAAa,MAAM,IACjC,OAAO,MAAM,QAAQ,WAAW,MAAM,CAAC;AAAA,MAC3C,QAAQ,OAAO,IAAI,gBAAgB,SAAS,QAAQ;AAAA,MACpD,QAAQ,OAAO;AAAA,MACf;AAAA,MACA,oBAAoB;AAAA,IACtB;AAAA,EACF;AACA,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ;AACpC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KAAK;AAC5C,YAAM,MAAM,KAAK,KAAK,CAAC,GACrB,SAAS,KAAK,QAAQ,CAAC,GACvB,SAAS,MAAM,QAAQ,QAAQ,GAAG,GAClC,YAAY,MAAM,QAAQ,WAAW,MAAM;AAC7C,YAAM,UACJ,QAAQ;AAAA,QACN,GAAG,OAAO,MAAM,IAAI,OAAO,MAAM,CAAC,KAAS,OAAO,SAAS,IAAI,OAAO,SAAS,CAAC;AAAA,MAClF,KAAK,CAAC;AACR,YAAM,QAAQ,QAAQ;AAAA,QACpB,CAAC,KAAK,WAAW,MAAM,MAAM,QAAQ,OAAO,MAAM;AAAA,QAClD;AAAA,MACF;AACA,aAAO,OAAO,gBAAgB;AAC9B,YAAM,aAAa,OAAO,OAAO;AAAA,QAC/B,GAAG,QAAQ,OAAO,IAAI,gBAAgB,KAAK,QAAQ;AAAA,QACnD,GAAG,QAAQ,OAAO,IAAI,oBAAoB,KAAK,SAAS;AAAA,QACxD;AAAA,QACA;AAAA,MACF,CAAC;AACD,YAAM;AAAA,QACJ,OAAO,OAAO;AAAA,UACZ;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,SAAS,OAAO,OAAO,OAAO;AAAA,UAC9B,OAAO,QAAQ,SAAS,QAAQ;AAAA,UAChC,QAAQ;AAAA,UACR,OAAO,QAAQ,SACX;AAAA,YACE,QAAQ,cACJ,QAAQ,YAAY,KAAK,IACzB,GAAG,KAAK,IAAI,QAAQ,IAAI;AAAA,YAC5B,WAAW;AAAA,YACX,WAAW;AAAA,YACX;AAAA,YACA;AAAA,UACF,IACA;AAAA,QACN,CAAC;AAAA,MACH;AAAA,IACF;AACF,SAAO,OAAO,OAAO;AAAA,IACnB,QAAQ,OAAO,OAAO,EAAE,GAAG,QAAQ,OAAO,CAAC;AAAA,IAC3C,MAAM,QAAQ;AAAA,IACd,OAAO,OAAO,OAAO,KAAK;AAAA,IAC1B,WAAW,OAAO,OAAO,SAAS;AAAA,IAClC,cAAc,OAAO,OAAO,YAAY;AAAA,EAC1C,CAAC;AACH;AAQO,SAAS,uBACd,MACA,OACW;AACX,QAAMA,SAAQ,KAAK,SAAS,GAC1B,OAAO,MAAM,UAAU,MAAM;AAC/B,QAAM,QACJ,KAAK,UAAU,OACX,OACA,QAAQ,IACN,MACA,OACA,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,IAAIA,SAAQ,MAAM,WAAW,IAAI,CAAC;AACtE,SAAO,EAAE,MAAM,sBAAsB,KAAK,KAAK,cAAc,EAAE;AACjE;AAOO,SAAS,WAAoB;AAAA,EAClC;AAAA,EACA,OAAO;AAAA,EACP;AAAA,EACA,GAAG;AACL,GAAwC;AACtC,QAAM,QAAQ,mBAAmB,KAAK,KAAK,CAAC;AAC5C,SACE,qBAAC,SACC;AAAA;AAAA,MAAC;AAAA;AAAA,QACE,GAAG;AAAA,QACJ,OAAO;AAAA,UACL,GAAG;AAAA,UACH,MAAM,KAAK,OAAO;AAAA,UAClB,KAAK,KAAK,OAAO;AAAA,UACjB,OAAO,KAAK,OAAO;AAAA,UACnB,QAAQ,KAAK,OAAO;AAAA,QACtB;AAAA;AAAA,IACF;AAAA,IACC;AAAA,KACH;AAEJ;AAOO,SAAS,gBACd,OACW;AACX,QAAM,QAAQ,cAAc,MAAM,KAAK;AACvC,MAAI,CAAC,MAAM,OAAO,SAAS,CAAC,MAAM,OAAO;AACvC,WAAO,oBAAC,SAAM,OAAO,MAAM,YAAa,gBAAK;AAC/C,QAAM,OAAO,mBAAmB,MAAM,IAAI;AAC1C,QAAM,QAAQ,MAAM;AACpB,QAAM,SAAS,aAAa,MAAM;AAAA,IAChC,GAAG;AAAA,IACH,QAAQ,MAAM;AAAA,IACd,SAAS,MAAM;AAAA,IACf,eAAe,MAAM;AAAA,IACrB,mBAAmB,MAAM;AAAA,EAC3B,CAAC;AACD,QAAM,SAAS,OAAO,MACnB,IAAI,CAAC,SAAS,KAAK,KAAK,EACxB,OAAO,CAAC,UAA2B,UAAU,IAAI;AACpD,QAAM,UAAU,KAAK,IAAI,GAAG,QAAQ,CAAC,GACnC,UAAU,KAAK,IAAI,GAAG,QAAQ,CAAC;AACjC,SACE,qBAAC,SAAM,OAAO,MAAM,YACjB;AAAA,WAAO,MAAM,IAAI,CAAC,SACjB;AAAA,MAAC;AAAA;AAAA,QAEC,SAAS,CAAC,UAAU,MAAM,cAAc,MAAM,KAAK;AAAA,QAElD,gBAAM,aACL,MAAM,WAAW,IAAI,IAErB,qBAAC,SACC;AAAA;AAAA,YAAC;AAAA;AAAA,cACC;AAAA,cACA,mBAAmB,QAAQ,MAAM,WAAW;AAAA,cAC5C,OAAO;AAAA,gBACL,GAAG,uBAAuB,MAAM,EAAE,SAAS,QAAQ,CAAC;AAAA,gBACpD,GAAG,iBAAiB,MAAM,MAAM,SAAS;AAAA,cAC3C;AAAA;AAAA,UACF;AAAA,UACC,KAAK,SACJ;AAAA,YAAC;AAAA;AAAA,cACC,OAAO,KAAK;AAAA,cACZ,OAAO;AAAA,gBACL,GAAG,uBAAuB,KAAK,KAAK;AAAA,gBACpC,MACE,KAAK,UAAU,SACd,KAAK,QAAQ,YAAY,UAAU,WAAW,MAAM,MACjD,YACA;AAAA,gBACN,WAAW;AAAA,gBACX,GAAG,mBAAmB,MAAM,UAAU;AAAA,cACxC;AAAA;AAAA,UACF;AAAA,WAEJ;AAAA;AAAA,MA9BG,KAAK,UAAU,CAAC,KAAK,QAAQ,KAAK,SAAS,CAAC;AAAA,IAgCnD,CACD;AAAA,IACA,OAAO,UAAU,OAAO,OAAO,YAAY,EAAE,IAAI,CAAC,OAAO,UACxD;AAAA,MAAC;AAAA;AAAA,QAEC,OAAO;AAAA,QACP,OAAO;AAAA,UACL,GAAG,uBAAuB,KAAK;AAAA,UAC/B,GAAG,mBAAmB,MAAM,UAAU;AAAA,QACxC;AAAA;AAAA,MALK,QAAQ,KAAK;AAAA,IAMpB,CACD;AAAA,KACH;AAEJ;",
+  "names": ["value"]
+}

package/dist/features/viz/lib/graph/neighborhood.d.ts

@@ -0,0 +1,11 @@
+import { type PibblNode } from "@pibbl/core";
+import type { GraphData, NeighborhoodLayout, NeighborhoodOptions, RadialNeighborhoodProps } from "./types.js";
+/** Lay out the reachable neighborhood around one stable key in concentric rings.
+ * @param graph - Nodes and edges in source order.
+ * @param options - Accessors, center, hops, and finite bounds.
+ * @returns Immutable neighborhood geometry. @see {@link NeighborhoodLayout} */
+export declare function layoutNeighborhood<N, E>(graph: GraphData<N, E>, options: NeighborhoodOptions<N, E>): NeighborhoodLayout<N, E>;
+/** Render an interactive radial neighborhood from ordinary graph records.
+ * @param props - Reactive graph, center, presentation, and frame style.
+ * @returns Canvas composition. @see {@link layoutNeighborhood} */
+export declare function RadialNeighborhood<N, E>(props: RadialNeighborhoodProps<N, E>): PibblNode;

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

@@ -0,0 +1,281 @@
+import { jsx, jsxs } from "@pibbl/core/jsx-runtime";
+import { Group, resolveSignalValue } from "@pibbl/core";
+import {
+  defaultGraphEdgeStyle,
+  defaultGraphLabelStyle,
+  defaultGraphNodeStyle,
+  GraphEdge,
+  GraphLabel,
+  GraphNode,
+  resolveMarkStyle,
+  useGraphFrame
+} from "./shared.js";
+import {
+  checkedBounds,
+  finiteGap,
+  finiteSize,
+  hierarchyLabel
+} from "./hierarchy.js";
+import { readAccessor } from "./shared.js";
+function key(value, name) {
+  if (typeof value === "string" || typeof value === "number" && Number.isFinite(value))
+    return value;
+  throw new TypeError(`${name}: key must be a string or finite number.`);
+}
+function layoutNeighborhood(graph, options) {
+  const bounds = checkedBounds(options.bounds, "layoutNeighborhood");
+  const hops = options.hops ?? 2;
+  if (!Number.isSafeInteger(hops) || hops < 0)
+    throw new RangeError(
+      "layoutNeighborhood: hops must be a nonnegative safe integer."
+    );
+  const ringGap = finiteGap(options.ringGap, 120, "layoutNeighborhood ringGap");
+  const nodeGap = finiteGap(options.nodeGap, 12, "layoutNeighborhood nodeGap");
+  const nodes = /* @__PURE__ */ new Map();
+  const order = /* @__PURE__ */ new Map();
+  graph.nodes.forEach((node, index) => {
+    const id = key(
+      readAccessor(node, options.nodeKey),
+      "layoutNeighborhood nodeKey"
+    );
+    if (nodes.has(id))
+      throw new Error(`layoutNeighborhood: duplicate node key ${String(id)}.`);
+    nodes.set(id, node);
+    order.set(id, index);
+  });
+  if (!nodes.has(options.centerKey))
+    throw new Error(
+      `layoutNeighborhood: unknown centerKey ${String(options.centerKey)}.`
+    );
+  const edges = graph.edges.map((edge) => {
+    const sourceKey = key(
+      readAccessor(edge, options.source),
+      "layoutNeighborhood source"
+    );
+    const targetKey = key(
+      readAccessor(edge, options.target),
+      "layoutNeighborhood target"
+    );
+    const edgeKey = key(
+      readAccessor(edge, options.edgeKey),
+      "layoutNeighborhood edgeKey"
+    );
+    if (!nodes.has(sourceKey) || !nodes.has(targetKey))
+      throw new Error(
+        `layoutNeighborhood: edge ${String(edgeKey)} references an unknown node.`
+      );
+    return { edge, edgeKey, sourceKey, targetKey };
+  });
+  const direction = options.direction ?? "outbound";
+  const adjacency = /* @__PURE__ */ new Map();
+  for (const { sourceKey, targetKey } of edges) {
+    const add = (a, b) => {
+      const list = adjacency.get(a) ?? [];
+      list.push(b);
+      adjacency.set(a, list);
+    };
+    if (direction !== "inbound") add(sourceKey, targetKey);
+    if (direction !== "outbound") add(targetKey, sourceKey);
+  }
+  const hop = /* @__PURE__ */ new Map([[options.centerKey, 0]]);
+  const queue = [options.centerKey];
+  for (let index = 0; index < queue.length; index++) {
+    const current = queue[index];
+    const depth = hop.get(current);
+    if (depth === hops) continue;
+    for (const next of adjacency.get(current) ?? [])
+      if (!hop.has(next)) {
+        hop.set(next, depth + 1);
+        queue.push(next);
+      }
+  }
+  const rings = Array.from({ length: hops + 1 }, () => []);
+  for (const [id, depth] of hop) rings[depth].push(id);
+  for (const ring of rings) ring.sort((a, b) => order.get(a) - order.get(b));
+  const sizes = /* @__PURE__ */ new Map();
+  let maxFootprint = 0;
+  for (const id of hop.keys()) {
+    const size = finiteSize(
+      nodes.get(id),
+      options.nodeSize ?? { width: 48, height: 48 },
+      "layoutNeighborhood"
+    );
+    sizes.set(id, size);
+    maxFootprint = Math.max(maxFootprint, Math.hypot(size.width, size.height));
+  }
+  const center = {
+    x: bounds.x + bounds.width / 2,
+    y: bounds.y + bounds.height / 2
+  };
+  const usedHops = Math.max(0, ...hop.values());
+  const outer = usedHops === 0 ? maxFootprint / 2 : maxFootprint + usedHops * ringGap;
+  if (outer * 2 > Math.min(bounds.width, bounds.height))
+    throw new RangeError(
+      "layoutNeighborhood: bounds are too small for the requested rings."
+    );
+  const geometry = [];
+  for (let depth = 0; depth < rings.length; depth++) {
+    const ring = rings[depth];
+    const radius = depth === 0 ? 0 : maxFootprint / 2 + depth * ringGap;
+    if (depth > 0 && ring.length > 1 && 2 * radius * Math.sin(Math.PI / ring.length) < maxFootprint + nodeGap)
+      throw new RangeError(
+        "layoutNeighborhood: ring is too crowded for nodeGap and nodeSize."
+      );
+    ring.forEach((id, index) => {
+      const angle = depth === 0 ? -Math.PI / 2 : -Math.PI / 2 + Math.PI * 2 * index / ring.length;
+      const size = sizes.get(id);
+      const x = center.x + Math.cos(angle) * radius - size.width / 2;
+      const y = center.y + Math.sin(angle) * radius - size.height / 2;
+      const datum = nodes.get(id);
+      const box = Object.freeze({
+        x,
+        y,
+        width: size.width,
+        height: size.height
+      });
+      geometry.push(
+        Object.freeze({
+          key: id,
+          datum,
+          bounds: box,
+          label: hierarchyLabel(
+            datum,
+            options.label,
+            {
+              x,
+              y: y + size.height + 4,
+              width: size.width,
+              height: 18
+            },
+            String(id)
+          ),
+          detail: options.detail === void 0 ? null : hierarchyLabel(datum, options.detail, {
+            x,
+            y: y + size.height + 22,
+            width: size.width,
+            height: 16
+          }),
+          hop: depth
+        })
+      );
+    });
+  }
+  const byKey = new Map(geometry.map((node) => [node.key, node]));
+  const resultEdges = [];
+  for (const entry of edges)
+    if (byKey.has(entry.sourceKey) && byKey.has(entry.targetKey)) {
+      const source = byKey.get(entry.sourceKey);
+      const target = byKey.get(entry.targetKey);
+      const sourceAnchor = {
+        x: source.bounds.x + source.bounds.width / 2,
+        y: source.bounds.y + source.bounds.height / 2
+      };
+      const targetAnchor = {
+        x: target.bounds.x + target.bounds.width / 2,
+        y: target.bounds.y + target.bounds.height / 2
+      };
+      const segments = Object.freeze([
+        { type: "move", ...sourceAnchor },
+        { type: "line", ...targetAnchor }
+      ]);
+      resultEdges.push(
+        Object.freeze({
+          key: entry.edgeKey,
+          datum: entry.edge,
+          sourceKey: entry.sourceKey,
+          targetKey: entry.targetKey,
+          route: Object.freeze({
+            sourceAnchor: Object.freeze(sourceAnchor),
+            targetAnchor: Object.freeze(targetAnchor),
+            segments,
+            arrowSegments: null
+          }),
+          path: `M ${sourceAnchor.x} ${sourceAnchor.y} L ${targetAnchor.x} ${targetAnchor.y}`,
+          arrowPath: null
+        })
+      );
+    }
+  return Object.freeze({
+    bounds,
+    centerKey: options.centerKey,
+    nodes: Object.freeze(geometry),
+    edges: Object.freeze(resultEdges),
+    omittedKeys: Object.freeze([...nodes.keys()].filter((id) => !hop.has(id)))
+  });
+}
+function RadialNeighborhood(props) {
+  const frame = useGraphFrame(props.style);
+  const graph = resolveSignalValue(props.graph);
+  const centerKey = resolveSignalValue(props.centerKey);
+  const hops = props.hops === void 0 ? void 0 : resolveSignalValue(props.hops);
+  if (frame.bounds.width === 0 || frame.bounds.height === 0)
+    return /* @__PURE__ */ jsx(Group, { style: frame.groupStyle, children: null });
+  const layout = layoutNeighborhood(graph, {
+    ...props,
+    bounds: frame.bounds,
+    centerKey,
+    hops,
+    ringGap: frame.style.ringGap,
+    nodeGap: frame.style.nodeGap
+  });
+  return /* @__PURE__ */ jsxs(Group, { style: frame.groupStyle, children: [
+    layout.edges.map(
+      (edge) => props.renderEdge ? /* @__PURE__ */ jsx(
+        Group,
+        {
+          onClick: (event) => props.onEdgeClick?.(edge, event),
+          children: props.renderEdge(edge)
+        },
+        edge.key
+      ) : /* @__PURE__ */ jsx(
+        GraphEdge,
+        {
+          edge,
+          style: {
+            ...defaultGraphEdgeStyle(edge),
+            ...resolveMarkStyle(edge, props.edgeStyle)
+          },
+          onClick: (event) => props.onEdgeClick?.(edge, event)
+        },
+        edge.key
+      )
+    ),
+    layout.nodes.map(
+      (node) => props.renderNode ? /* @__PURE__ */ jsx(
+        Group,
+        {
+          onClick: (event) => props.onNodeClick?.(node, event),
+          children: props.renderNode(node)
+        },
+        node.key
+      ) : /* @__PURE__ */ jsxs(Group, { children: [
+        /* @__PURE__ */ jsx(
+          GraphNode,
+          {
+            node,
+            style: {
+              ...defaultGraphNodeStyle(node),
+              ...resolveMarkStyle(node, props.nodeStyle)
+            },
+            onClick: (event) => props.onNodeClick?.(node, event)
+          }
+        ),
+        /* @__PURE__ */ jsx(
+          GraphLabel,
+          {
+            label: node.label,
+            style: {
+              ...defaultGraphLabelStyle(node.label),
+              ...resolveMarkStyle(node, props.labelStyle)
+            }
+          }
+        )
+      ] }, node.key)
+    )
+  ] });
+}
+export {
+  RadialNeighborhood,
+  layoutNeighborhood
+};
+//# sourceMappingURL=neighborhood.js.map

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../src/features/viz/lib/graph/neighborhood.tsx"],
+  "sourcesContent": ["import { Group, resolveSignalValue, type PibblNode } from \"@pibbl/core\";\nimport {\n  defaultGraphEdgeStyle,\n  defaultGraphLabelStyle,\n  defaultGraphNodeStyle,\n  GraphEdge,\n  GraphLabel,\n  GraphNode,\n  resolveMarkStyle,\n  useGraphFrame,\n} from \"./shared.js\";\nimport type {\n  GraphData,\n  GraphEdgeGeometry,\n  NeighborhoodLayout,\n  NeighborhoodNodeGeometry,\n  NeighborhoodOptions,\n  NeighborhoodStyle,\n  RadialNeighborhoodProps,\n  VizKey,\n} from \"./types.js\";\nimport {\n  checkedBounds,\n  finiteGap,\n  finiteSize,\n  hierarchyLabel,\n} from \"./hierarchy.js\";\nimport { readAccessor } from \"./shared.js\";\n\nfunction key(value: unknown, name: string): VizKey {\n  if (\n    typeof value === \"string\" ||\n    (typeof value === \"number\" && Number.isFinite(value))\n  )\n    return value;\n  throw new TypeError(`${name}: key must be a string or finite number.`);\n}\n\n/** Lay out the reachable neighborhood around one stable key in concentric rings.\n * @param graph - Nodes and edges in source order.\n * @param options - Accessors, center, hops, and finite bounds.\n * @returns Immutable neighborhood geometry. @see {@link NeighborhoodLayout} */\nexport function layoutNeighborhood<N, E>(\n  graph: GraphData<N, E>,\n  options: NeighborhoodOptions<N, E>,\n): NeighborhoodLayout<N, E> {\n  const bounds = checkedBounds(options.bounds, \"layoutNeighborhood\");\n  const hops = options.hops ?? 2;\n  if (!Number.isSafeInteger(hops) || hops < 0)\n    throw new RangeError(\n      \"layoutNeighborhood: hops must be a nonnegative safe integer.\",\n    );\n  const ringGap = finiteGap(options.ringGap, 120, \"layoutNeighborhood ringGap\");\n  const nodeGap = finiteGap(options.nodeGap, 12, \"layoutNeighborhood nodeGap\");\n  const nodes = new Map<VizKey, N>();\n  const order = new Map<VizKey, number>();\n  graph.nodes.forEach((node, index) => {\n    const id = key(\n      readAccessor(node, options.nodeKey),\n      \"layoutNeighborhood nodeKey\",\n    );\n    if (nodes.has(id))\n      throw new Error(`layoutNeighborhood: duplicate node key ${String(id)}.`);\n    nodes.set(id, node);\n    order.set(id, index);\n  });\n  if (!nodes.has(options.centerKey))\n    throw new Error(\n      `layoutNeighborhood: unknown centerKey ${String(options.centerKey)}.`,\n    );\n  const edges = graph.edges.map((edge) => {\n    const sourceKey = key(\n      readAccessor(edge, options.source),\n      \"layoutNeighborhood source\",\n    );\n    const targetKey = key(\n      readAccessor(edge, options.target),\n      \"layoutNeighborhood target\",\n    );\n    const edgeKey = key(\n      readAccessor(edge, options.edgeKey),\n      \"layoutNeighborhood edgeKey\",\n    );\n    if (!nodes.has(sourceKey) || !nodes.has(targetKey))\n      throw new Error(\n        `layoutNeighborhood: edge ${String(edgeKey)} references an unknown node.`,\n      );\n    return { edge, edgeKey, sourceKey, targetKey };\n  });\n  const direction = options.direction ?? \"outbound\";\n  const adjacency = new Map<VizKey, VizKey[]>();\n  for (const { sourceKey, targetKey } of edges) {\n    const add = (a: VizKey, b: VizKey) => {\n      const list = adjacency.get(a) ?? [];\n      list.push(b);\n      adjacency.set(a, list);\n    };\n    if (direction !== \"inbound\") add(sourceKey, targetKey);\n    if (direction !== \"outbound\") add(targetKey, sourceKey);\n  }\n  const hop = new Map<VizKey, number>([[options.centerKey, 0]]);\n  const queue = [options.centerKey];\n  for (let index = 0; index < queue.length; index++) {\n    const current = queue[index];\n    const depth = hop.get(current)!;\n    if (depth === hops) continue;\n    for (const next of adjacency.get(current) ?? [])\n      if (!hop.has(next)) {\n        hop.set(next, depth + 1);\n        queue.push(next);\n      }\n  }\n  const rings = Array.from({ length: hops + 1 }, () => [] as VizKey[]);\n  for (const [id, depth] of hop) rings[depth].push(id);\n  for (const ring of rings) ring.sort((a, b) => order.get(a)! - order.get(b)!);\n  const sizes = new Map<VizKey, ReturnType<typeof finiteSize>>();\n  let maxFootprint = 0;\n  for (const id of hop.keys()) {\n    const size = finiteSize(\n      nodes.get(id)!,\n      options.nodeSize ?? { width: 48, height: 48 },\n      \"layoutNeighborhood\",\n    );\n    sizes.set(id, size);\n    maxFootprint = Math.max(maxFootprint, Math.hypot(size.width, size.height));\n  }\n  const center = {\n    x: bounds.x + bounds.width / 2,\n    y: bounds.y + bounds.height / 2,\n  };\n  const usedHops = Math.max(0, ...hop.values());\n  const outer =\n    usedHops === 0 ? maxFootprint / 2 : maxFootprint + usedHops * ringGap;\n  if (outer * 2 > Math.min(bounds.width, bounds.height))\n    throw new RangeError(\n      \"layoutNeighborhood: bounds are too small for the requested rings.\",\n    );\n  const geometry: NeighborhoodNodeGeometry<N>[] = [];\n  for (let depth = 0; depth < rings.length; depth++) {\n    const ring = rings[depth];\n    const radius = depth === 0 ? 0 : maxFootprint / 2 + depth * ringGap;\n    if (\n      depth > 0 &&\n      ring.length > 1 &&\n      2 * radius * Math.sin(Math.PI / ring.length) < maxFootprint + nodeGap\n    )\n      throw new RangeError(\n        \"layoutNeighborhood: ring is too crowded for nodeGap and nodeSize.\",\n      );\n    ring.forEach((id, index) => {\n      const angle =\n        depth === 0\n          ? -Math.PI / 2\n          : -Math.PI / 2 + (Math.PI * 2 * index) / ring.length;\n      const size = sizes.get(id)!;\n      const x = center.x + Math.cos(angle) * radius - size.width / 2;\n      const y = center.y + Math.sin(angle) * radius - size.height / 2;\n      const datum = nodes.get(id)!;\n      const box = Object.freeze({\n        x,\n        y,\n        width: size.width,\n        height: size.height,\n      });\n      geometry.push(\n        Object.freeze({\n          key: id,\n          datum,\n          bounds: box,\n          label: hierarchyLabel(\n            datum,\n            options.label,\n            {\n              x,\n              y: y + size.height + 4,\n              width: size.width,\n              height: 18,\n            },\n            String(id),\n          ),\n          detail:\n            options.detail === undefined\n              ? null\n              : hierarchyLabel(datum, options.detail, {\n                  x,\n                  y: y + size.height + 22,\n                  width: size.width,\n                  height: 16,\n                }),\n          hop: depth,\n        }),\n      );\n    });\n  }\n  const byKey = new Map(geometry.map((node) => [node.key, node]));\n  const resultEdges: GraphEdgeGeometry<E>[] = [];\n  for (const entry of edges)\n    if (byKey.has(entry.sourceKey) && byKey.has(entry.targetKey)) {\n      const source = byKey.get(entry.sourceKey)!;\n      const target = byKey.get(entry.targetKey)!;\n      const sourceAnchor = {\n        x: source.bounds.x + source.bounds.width / 2,\n        y: source.bounds.y + source.bounds.height / 2,\n      };\n      const targetAnchor = {\n        x: target.bounds.x + target.bounds.width / 2,\n        y: target.bounds.y + target.bounds.height / 2,\n      };\n      const segments = Object.freeze([\n        { type: \"move\" as const, ...sourceAnchor },\n        { type: \"line\" as const, ...targetAnchor },\n      ]);\n      resultEdges.push(\n        Object.freeze({\n          key: entry.edgeKey,\n          datum: entry.edge,\n          sourceKey: entry.sourceKey,\n          targetKey: entry.targetKey,\n          route: Object.freeze({\n            sourceAnchor: Object.freeze(sourceAnchor),\n            targetAnchor: Object.freeze(targetAnchor),\n            segments,\n            arrowSegments: null,\n          }),\n          path: `M ${sourceAnchor.x} ${sourceAnchor.y} L ${targetAnchor.x} ${targetAnchor.y}`,\n          arrowPath: null,\n        }),\n      );\n    }\n  return Object.freeze({\n    bounds,\n    centerKey: options.centerKey,\n    nodes: Object.freeze(geometry),\n    edges: Object.freeze(resultEdges),\n    omittedKeys: Object.freeze([...nodes.keys()].filter((id) => !hop.has(id))),\n  });\n}\n\n/** Render an interactive radial neighborhood from ordinary graph records.\n * @param props - Reactive graph, center, presentation, and frame style.\n * @returns Canvas composition. @see {@link layoutNeighborhood} */\nexport function RadialNeighborhood<N, E>(\n  props: RadialNeighborhoodProps<N, E>,\n): PibblNode {\n  const frame = useGraphFrame<NeighborhoodStyle>(props.style);\n  const graph = resolveSignalValue(props.graph);\n  const centerKey = resolveSignalValue(props.centerKey);\n  const hops =\n    props.hops === undefined ? undefined : resolveSignalValue(props.hops);\n  if (frame.bounds.width === 0 || frame.bounds.height === 0)\n    return <Group style={frame.groupStyle}>{null}</Group>;\n  const layout = layoutNeighborhood(graph, {\n    ...props,\n    bounds: frame.bounds,\n    centerKey,\n    hops,\n    ringGap: frame.style.ringGap,\n    nodeGap: frame.style.nodeGap,\n  });\n  return (\n    <Group style={frame.groupStyle}>\n      {layout.edges.map((edge) =>\n        props.renderEdge ? (\n          <Group\n            key={edge.key}\n            onClick={(event) => props.onEdgeClick?.(edge, event)}\n          >\n            {props.renderEdge(edge)}\n          </Group>\n        ) : (\n          <GraphEdge\n            key={edge.key}\n            edge={edge}\n            style={{\n              ...defaultGraphEdgeStyle(edge),\n              ...resolveMarkStyle(edge, props.edgeStyle),\n            }}\n            onClick={(event) => props.onEdgeClick?.(edge, event)}\n          />\n        ),\n      )}\n      {layout.nodes.map((node) =>\n        props.renderNode ? (\n          <Group\n            key={node.key}\n            onClick={(event) => props.onNodeClick?.(node, event)}\n          >\n            {props.renderNode(node)}\n          </Group>\n        ) : (\n          <Group key={node.key}>\n            <GraphNode\n              node={node}\n              style={{\n                ...defaultGraphNodeStyle(node),\n                ...resolveMarkStyle(node, props.nodeStyle),\n              }}\n              onClick={(event) => props.onNodeClick?.(node, event)}\n            />\n            <GraphLabel\n              label={node.label}\n              style={{\n                ...defaultGraphLabelStyle(node.label),\n                ...resolveMarkStyle(node, props.labelStyle),\n              }}\n            />\n          </Group>\n        ),\n      )}\n    </Group>\n  );\n}\n"],
+  "mappings": "AA0PW,cAwCD,YAxCC;AA1PX,SAAS,OAAO,0BAA0C;AAC1D;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAWP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,oBAAoB;AAE7B,SAAS,IAAI,OAAgB,MAAsB;AACjD,MACE,OAAO,UAAU,YAChB,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK;AAEnD,WAAO;AACT,QAAM,IAAI,UAAU,GAAG,IAAI,0CAA0C;AACvE;AAMO,SAAS,mBACd,OACA,SAC0B;AAC1B,QAAM,SAAS,cAAc,QAAQ,QAAQ,oBAAoB;AACjE,QAAM,OAAO,QAAQ,QAAQ;AAC7B,MAAI,CAAC,OAAO,cAAc,IAAI,KAAK,OAAO;AACxC,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AACF,QAAM,UAAU,UAAU,QAAQ,SAAS,KAAK,4BAA4B;AAC5E,QAAM,UAAU,UAAU,QAAQ,SAAS,IAAI,4BAA4B;AAC3E,QAAM,QAAQ,oBAAI,IAAe;AACjC,QAAM,QAAQ,oBAAI,IAAoB;AACtC,QAAM,MAAM,QAAQ,CAAC,MAAM,UAAU;AACnC,UAAM,KAAK;AAAA,MACT,aAAa,MAAM,QAAQ,OAAO;AAAA,MAClC;AAAA,IACF;AACA,QAAI,MAAM,IAAI,EAAE;AACd,YAAM,IAAI,MAAM,0CAA0C,OAAO,EAAE,CAAC,GAAG;AACzE,UAAM,IAAI,IAAI,IAAI;AAClB,UAAM,IAAI,IAAI,KAAK;AAAA,EACrB,CAAC;AACD,MAAI,CAAC,MAAM,IAAI,QAAQ,SAAS;AAC9B,UAAM,IAAI;AAAA,MACR,yCAAyC,OAAO,QAAQ,SAAS,CAAC;AAAA,IACpE;AACF,QAAM,QAAQ,MAAM,MAAM,IAAI,CAAC,SAAS;AACtC,UAAM,YAAY;AAAA,MAChB,aAAa,MAAM,QAAQ,MAAM;AAAA,MACjC;AAAA,IACF;AACA,UAAM,YAAY;AAAA,MAChB,aAAa,MAAM,QAAQ,MAAM;AAAA,MACjC;AAAA,IACF;AACA,UAAM,UAAU;AAAA,MACd,aAAa,MAAM,QAAQ,OAAO;AAAA,MAClC;AAAA,IACF;AACA,QAAI,CAAC,MAAM,IAAI,SAAS,KAAK,CAAC,MAAM,IAAI,SAAS;AAC/C,YAAM,IAAI;AAAA,QACR,4BAA4B,OAAO,OAAO,CAAC;AAAA,MAC7C;AACF,WAAO,EAAE,MAAM,SAAS,WAAW,UAAU;AAAA,EAC/C,CAAC;AACD,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,YAAY,oBAAI,IAAsB;AAC5C,aAAW,EAAE,WAAW,UAAU,KAAK,OAAO;AAC5C,UAAM,MAAM,CAAC,GAAW,MAAc;AACpC,YAAM,OAAO,UAAU,IAAI,CAAC,KAAK,CAAC;AAClC,WAAK,KAAK,CAAC;AACX,gBAAU,IAAI,GAAG,IAAI;AAAA,IACvB;AACA,QAAI,cAAc,UAAW,KAAI,WAAW,SAAS;AACrD,QAAI,cAAc,WAAY,KAAI,WAAW,SAAS;AAAA,EACxD;AACA,QAAM,MAAM,oBAAI,IAAoB,CAAC,CAAC,QAAQ,WAAW,CAAC,CAAC,CAAC;AAC5D,QAAM,QAAQ,CAAC,QAAQ,SAAS;AAChC,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;AACjD,UAAM,UAAU,MAAM,KAAK;AAC3B,UAAM,QAAQ,IAAI,IAAI,OAAO;AAC7B,QAAI,UAAU,KAAM;AACpB,eAAW,QAAQ,UAAU,IAAI,OAAO,KAAK,CAAC;AAC5C,UAAI,CAAC,IAAI,IAAI,IAAI,GAAG;AAClB,YAAI,IAAI,MAAM,QAAQ,CAAC;AACvB,cAAM,KAAK,IAAI;AAAA,MACjB;AAAA,EACJ;AACA,QAAM,QAAQ,MAAM,KAAK,EAAE,QAAQ,OAAO,EAAE,GAAG,MAAM,CAAC,CAAa;AACnE,aAAW,CAAC,IAAI,KAAK,KAAK,IAAK,OAAM,KAAK,EAAE,KAAK,EAAE;AACnD,aAAW,QAAQ,MAAO,MAAK,KAAK,CAAC,GAAG,MAAM,MAAM,IAAI,CAAC,IAAK,MAAM,IAAI,CAAC,CAAE;AAC3E,QAAM,QAAQ,oBAAI,IAA2C;AAC7D,MAAI,eAAe;AACnB,aAAW,MAAM,IAAI,KAAK,GAAG;AAC3B,UAAM,OAAO;AAAA,MACX,MAAM,IAAI,EAAE;AAAA,MACZ,QAAQ,YAAY,EAAE,OAAO,IAAI,QAAQ,GAAG;AAAA,MAC5C;AAAA,IACF;AACA,UAAM,IAAI,IAAI,IAAI;AAClB,mBAAe,KAAK,IAAI,cAAc,KAAK,MAAM,KAAK,OAAO,KAAK,MAAM,CAAC;AAAA,EAC3E;AACA,QAAM,SAAS;AAAA,IACb,GAAG,OAAO,IAAI,OAAO,QAAQ;AAAA,IAC7B,GAAG,OAAO,IAAI,OAAO,SAAS;AAAA,EAChC;AACA,QAAM,WAAW,KAAK,IAAI,GAAG,GAAG,IAAI,OAAO,CAAC;AAC5C,QAAM,QACJ,aAAa,IAAI,eAAe,IAAI,eAAe,WAAW;AAChE,MAAI,QAAQ,IAAI,KAAK,IAAI,OAAO,OAAO,OAAO,MAAM;AAClD,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AACF,QAAM,WAA0C,CAAC;AACjD,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;AACjD,UAAM,OAAO,MAAM,KAAK;AACxB,UAAM,SAAS,UAAU,IAAI,IAAI,eAAe,IAAI,QAAQ;AAC5D,QACE,QAAQ,KACR,KAAK,SAAS,KACd,IAAI,SAAS,KAAK,IAAI,KAAK,KAAK,KAAK,MAAM,IAAI,eAAe;AAE9D,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AACF,SAAK,QAAQ,CAAC,IAAI,UAAU;AAC1B,YAAM,QACJ,UAAU,IACN,CAAC,KAAK,KAAK,IACX,CAAC,KAAK,KAAK,IAAK,KAAK,KAAK,IAAI,QAAS,KAAK;AAClD,YAAM,OAAO,MAAM,IAAI,EAAE;AACzB,YAAM,IAAI,OAAO,IAAI,KAAK,IAAI,KAAK,IAAI,SAAS,KAAK,QAAQ;AAC7D,YAAM,IAAI,OAAO,IAAI,KAAK,IAAI,KAAK,IAAI,SAAS,KAAK,SAAS;AAC9D,YAAM,QAAQ,MAAM,IAAI,EAAE;AAC1B,YAAM,MAAM,OAAO,OAAO;AAAA,QACxB;AAAA,QACA;AAAA,QACA,OAAO,KAAK;AAAA,QACZ,QAAQ,KAAK;AAAA,MACf,CAAC;AACD,eAAS;AAAA,QACP,OAAO,OAAO;AAAA,UACZ,KAAK;AAAA,UACL;AAAA,UACA,QAAQ;AAAA,UACR,OAAO;AAAA,YACL;AAAA,YACA,QAAQ;AAAA,YACR;AAAA,cACE;AAAA,cACA,GAAG,IAAI,KAAK,SAAS;AAAA,cACrB,OAAO,KAAK;AAAA,cACZ,QAAQ;AAAA,YACV;AAAA,YACA,OAAO,EAAE;AAAA,UACX;AAAA,UACA,QACE,QAAQ,WAAW,SACf,OACA,eAAe,OAAO,QAAQ,QAAQ;AAAA,YACpC;AAAA,YACA,GAAG,IAAI,KAAK,SAAS;AAAA,YACrB,OAAO,KAAK;AAAA,YACZ,QAAQ;AAAA,UACV,CAAC;AAAA,UACP,KAAK;AAAA,QACP,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAAA,EACH;AACA,QAAM,QAAQ,IAAI,IAAI,SAAS,IAAI,CAAC,SAAS,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;AAC9D,QAAM,cAAsC,CAAC;AAC7C,aAAW,SAAS;AAClB,QAAI,MAAM,IAAI,MAAM,SAAS,KAAK,MAAM,IAAI,MAAM,SAAS,GAAG;AAC5D,YAAM,SAAS,MAAM,IAAI,MAAM,SAAS;AACxC,YAAM,SAAS,MAAM,IAAI,MAAM,SAAS;AACxC,YAAM,eAAe;AAAA,QACnB,GAAG,OAAO,OAAO,IAAI,OAAO,OAAO,QAAQ;AAAA,QAC3C,GAAG,OAAO,OAAO,IAAI,OAAO,OAAO,SAAS;AAAA,MAC9C;AACA,YAAM,eAAe;AAAA,QACnB,GAAG,OAAO,OAAO,IAAI,OAAO,OAAO,QAAQ;AAAA,QAC3C,GAAG,OAAO,OAAO,IAAI,OAAO,OAAO,SAAS;AAAA,MAC9C;AACA,YAAM,WAAW,OAAO,OAAO;AAAA,QAC7B,EAAE,MAAM,QAAiB,GAAG,aAAa;AAAA,QACzC,EAAE,MAAM,QAAiB,GAAG,aAAa;AAAA,MAC3C,CAAC;AACD,kBAAY;AAAA,QACV,OAAO,OAAO;AAAA,UACZ,KAAK,MAAM;AAAA,UACX,OAAO,MAAM;AAAA,UACb,WAAW,MAAM;AAAA,UACjB,WAAW,MAAM;AAAA,UACjB,OAAO,OAAO,OAAO;AAAA,YACnB,cAAc,OAAO,OAAO,YAAY;AAAA,YACxC,cAAc,OAAO,OAAO,YAAY;AAAA,YACxC;AAAA,YACA,eAAe;AAAA,UACjB,CAAC;AAAA,UACD,MAAM,KAAK,aAAa,CAAC,IAAI,aAAa,CAAC,MAAM,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA,UACjF,WAAW;AAAA,QACb,CAAC;AAAA,MACH;AAAA,IACF;AACF,SAAO,OAAO,OAAO;AAAA,IACnB;AAAA,IACA,WAAW,QAAQ;AAAA,IACnB,OAAO,OAAO,OAAO,QAAQ;AAAA,IAC7B,OAAO,OAAO,OAAO,WAAW;AAAA,IAChC,aAAa,OAAO,OAAO,CAAC,GAAG,MAAM,KAAK,CAAC,EAAE,OAAO,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;AAAA,EAC3E,CAAC;AACH;AAKO,SAAS,mBACd,OACW;AACX,QAAM,QAAQ,cAAiC,MAAM,KAAK;AAC1D,QAAM,QAAQ,mBAAmB,MAAM,KAAK;AAC5C,QAAM,YAAY,mBAAmB,MAAM,SAAS;AACpD,QAAM,OACJ,MAAM,SAAS,SAAY,SAAY,mBAAmB,MAAM,IAAI;AACtE,MAAI,MAAM,OAAO,UAAU,KAAK,MAAM,OAAO,WAAW;AACtD,WAAO,oBAAC,SAAM,OAAO,MAAM,YAAa,gBAAK;AAC/C,QAAM,SAAS,mBAAmB,OAAO;AAAA,IACvC,GAAG;AAAA,IACH,QAAQ,MAAM;AAAA,IACd;AAAA,IACA;AAAA,IACA,SAAS,MAAM,MAAM;AAAA,IACrB,SAAS,MAAM,MAAM;AAAA,EACvB,CAAC;AACD,SACE,qBAAC,SAAM,OAAO,MAAM,YACjB;AAAA,WAAO,MAAM;AAAA,MAAI,CAAC,SACjB,MAAM,aACJ;AAAA,QAAC;AAAA;AAAA,UAEC,SAAS,CAAC,UAAU,MAAM,cAAc,MAAM,KAAK;AAAA,UAElD,gBAAM,WAAW,IAAI;AAAA;AAAA,QAHjB,KAAK;AAAA,MAIZ,IAEA;AAAA,QAAC;AAAA;AAAA,UAEC;AAAA,UACA,OAAO;AAAA,YACL,GAAG,sBAAsB,IAAI;AAAA,YAC7B,GAAG,iBAAiB,MAAM,MAAM,SAAS;AAAA,UAC3C;AAAA,UACA,SAAS,CAAC,UAAU,MAAM,cAAc,MAAM,KAAK;AAAA;AAAA,QAN9C,KAAK;AAAA,MAOZ;AAAA,IAEJ;AAAA,IACC,OAAO,MAAM;AAAA,MAAI,CAAC,SACjB,MAAM,aACJ;AAAA,QAAC;AAAA;AAAA,UAEC,SAAS,CAAC,UAAU,MAAM,cAAc,MAAM,KAAK;AAAA,UAElD,gBAAM,WAAW,IAAI;AAAA;AAAA,QAHjB,KAAK;AAAA,MAIZ,IAEA,qBAAC,SACC;AAAA;AAAA,UAAC;AAAA;AAAA,YACC;AAAA,YACA,OAAO;AAAA,cACL,GAAG,sBAAsB,IAAI;AAAA,cAC7B,GAAG,iBAAiB,MAAM,MAAM,SAAS;AAAA,YAC3C;AAAA,YACA,SAAS,CAAC,UAAU,MAAM,cAAc,MAAM,KAAK;AAAA;AAAA,QACrD;AAAA,QACA;AAAA,UAAC;AAAA;AAAA,YACC,OAAO,KAAK;AAAA,YACZ,OAAO;AAAA,cACL,GAAG,uBAAuB,KAAK,KAAK;AAAA,cACpC,GAAG,iBAAiB,MAAM,MAAM,UAAU;AAAA,YAC5C;AAAA;AAAA,QACF;AAAA,WAfU,KAAK,GAgBjB;AAAA,IAEJ;AAAA,KACF;AAEJ;",
+  "names": []
+}

package/dist/features/viz/lib/graph/routes.d.ts

@@ -0,0 +1,35 @@
+import type { GraphRoute, Point } from "./types.js";
+type Endpoints = Readonly<{
+    sourceAnchor: Point;
+    targetAnchor: Point;
+}>;
+/**
+ * Build an independent straight graph route in local logical units.
+ * @param endpoints - Finite named source and target anchor points. See {@link GraphRoute}.
+ * @param options - Optional nonnegative arrowLength (default zero).
+ * @returns Named anchors and independently editable core path segments. See {@link GraphRoute}.
+ */
+export declare function straightGraphRoute(endpoints: Endpoints, options?: Readonly<{
+    arrowLength?: number;
+}>): GraphRoute;
+/**
+ * Build an independent horizontal orthogonal graph route in local logical units.
+ * @param endpoints - Finite named source and target anchor points. See {@link GraphRoute}.
+ * @param options - Optional nonnegative arrowLength (default zero).
+ * @returns Named anchors and independently editable core path segments. See {@link GraphRoute}.
+ */
+export declare function orthogonalGraphRoute(endpoints: Endpoints, options?: Readonly<{
+    arrowLength?: number;
+}>): GraphRoute;
+/**
+ * Build an independent horizontal cubic graph route in local logical units.
+ * @param endpoints - Finite named source and target anchor points. See {@link GraphRoute}.
+ * @param options - Optional nonnegative arrowLength (default zero); curvature defaults to 0.5 and must be in [0, 1].
+ * @returns Named anchors and independently editable core path segments. See {@link GraphRoute}.
+ */
+export declare function curvedGraphRoute(endpoints: Endpoints, options?: Readonly<{
+    curvature?: number;
+    arrowLength?: number;
+}>): GraphRoute;
+export declare function routePath(segments: GraphRoute["segments"]): string;
+export {};

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

@@ -0,0 +1,101 @@
+import { PathGeometry, toSvgPathData } from "@pibbl/core";
+function route(endpoints, segments, arrowLength = 0) {
+  const { sourceAnchor: a, targetAnchor: b } = endpoints;
+  if (!Number.isFinite(a.x) || !Number.isFinite(a.y) || (!Number.isFinite(b.x) || !Number.isFinite(b.y)))
+    throw new RangeError("Route anchors must be finite.");
+  if (!Number.isFinite(arrowLength) || arrowLength < 0)
+    throw new RangeError("arrowLength must be finite and nonnegative.");
+  const angle = Math.atan2(b.y - a.y, b.x - a.x), c = Math.cos(angle), s = Math.sin(angle);
+  return {
+    ...endpoints,
+    segments,
+    arrowSegments: arrowLength === 0 ? null : [
+      { type: "move", x: b.x, y: b.y },
+      {
+        type: "line",
+        x: b.x - arrowLength * c - arrowLength * s / 2,
+        y: b.y - arrowLength * s + arrowLength * c / 2
+      },
+      {
+        type: "line",
+        x: b.x - arrowLength * c + arrowLength * s / 2,
+        y: b.y - arrowLength * s - arrowLength * c / 2
+      },
+      { type: "close" }
+    ]
+  };
+}
+function straightGraphRoute(endpoints, options = {}) {
+  const { sourceAnchor: a, targetAnchor: b } = endpoints;
+  return route(
+    endpoints,
+    [
+      { type: "move", x: a.x, y: a.y },
+      { type: "line", x: b.x, y: b.y }
+    ],
+    options.arrowLength
+  );
+}
+function orthogonalGraphRoute(endpoints, options = {}) {
+  const { sourceAnchor: a, targetAnchor: b } = endpoints, middle = (a.x + b.x) / 2;
+  const result = route(
+    endpoints,
+    [
+      { type: "move", x: a.x, y: a.y },
+      { type: "line", x: middle, y: a.y },
+      { type: "line", x: middle, y: b.y },
+      { type: "line", x: b.x, y: b.y }
+    ],
+    options.arrowLength
+  );
+  if (options.arrowLength)
+    return {
+      ...result,
+      arrowSegments: straightGraphRoute(
+        { sourceAnchor: { x: middle, y: b.y }, targetAnchor: b },
+        options
+      ).arrowSegments
+    };
+  return result;
+}
+function curvedGraphRoute(endpoints, options = {}) {
+  const { sourceAnchor: a, targetAnchor: b } = endpoints, curvature = options.curvature ?? 0.5;
+  if (!Number.isFinite(curvature) || curvature < 0 || curvature > 1)
+    throw new RangeError("curvature must be between 0 and 1.");
+  const dx = (b.x - a.x) * curvature;
+  const result = route(
+    endpoints,
+    [
+      { type: "move", x: a.x, y: a.y },
+      {
+        type: "cubic",
+        cp1x: a.x + dx,
+        cp1y: a.y,
+        cp2x: b.x - dx,
+        cp2y: b.y,
+        x: b.x,
+        y: b.y
+      }
+    ],
+    options.arrowLength
+  );
+  return options.arrowLength && dx !== 0 ? {
+    ...result,
+    arrowSegments: straightGraphRoute(
+      { sourceAnchor: { x: b.x - dx, y: b.y }, targetAnchor: b },
+      options
+    ).arrowSegments
+  } : result;
+}
+function routePath(segments) {
+  const path = new PathGeometry();
+  path.spliceSegments(0, 0, segments);
+  return toSvgPathData(path);
+}
+export {
+  curvedGraphRoute,
+  orthogonalGraphRoute,
+  routePath,
+  straightGraphRoute
+};
+//# sourceMappingURL=routes.js.map

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../src/features/viz/lib/graph/routes.ts"],
+  "sourcesContent": ["import { PathGeometry, toSvgPathData } from \"@pibbl/core\";\nimport type { GraphRoute, Point } from \"./types.js\";\ntype Endpoints = Readonly<{ sourceAnchor: Point; targetAnchor: Point }>;\nfunction route(\n  endpoints: Endpoints,\n  segments: GraphRoute[\"segments\"],\n  arrowLength = 0,\n): GraphRoute {\n  const { sourceAnchor: a, targetAnchor: b } = endpoints;\n  if ((!Number.isFinite(a.x) || !Number.isFinite(a.y)) || (!Number.isFinite(b.x) || !Number.isFinite(b.y)))\n        throw new RangeError(\"Route anchors must be finite.\");\n  if (!Number.isFinite(arrowLength) || arrowLength < 0)\n    throw new RangeError(\"arrowLength must be finite and nonnegative.\");\n  const angle = Math.atan2(b.y - a.y, b.x - a.x),\n    c = Math.cos(angle),\n    s = Math.sin(angle);\n  return {\n    ...endpoints,\n    segments,\n    arrowSegments:\n      arrowLength === 0\n        ? null\n        : [\n            { type: \"move\", x: b.x, y: b.y },\n            {\n              type: \"line\",\n              x: b.x - arrowLength * c - (arrowLength * s) / 2,\n              y: b.y - arrowLength * s + (arrowLength * c) / 2,\n            },\n            {\n              type: \"line\",\n              x: b.x - arrowLength * c + (arrowLength * s) / 2,\n              y: b.y - arrowLength * s - (arrowLength * c) / 2,\n            },\n            { type: \"close\" },\n          ],\n  };\n}\n/**\n * Build an independent straight graph route in local logical units.\n * @param endpoints - Finite named source and target anchor points. See {@link GraphRoute}.\n * @param options - Optional nonnegative arrowLength (default zero).\n * @returns Named anchors and independently editable core path segments. See {@link GraphRoute}.\n */\nexport function straightGraphRoute(\n  endpoints: Endpoints,\n  options: Readonly<{ arrowLength?: number }> = {},\n): GraphRoute {\n  const { sourceAnchor: a, targetAnchor: b } = endpoints;\n  return route(\n    endpoints,\n    [\n      { type: \"move\", x: a.x, y: a.y },\n      { type: \"line\", x: b.x, y: b.y },\n    ],\n    options.arrowLength,\n  );\n}\n/**\n * Build an independent horizontal orthogonal graph route in local logical units.\n * @param endpoints - Finite named source and target anchor points. See {@link GraphRoute}.\n * @param options - Optional nonnegative arrowLength (default zero).\n * @returns Named anchors and independently editable core path segments. See {@link GraphRoute}.\n */\nexport function orthogonalGraphRoute(\n  endpoints: Endpoints,\n  options: Readonly<{ arrowLength?: number }> = {},\n): GraphRoute {\n  const { sourceAnchor: a, targetAnchor: b } = endpoints,\n    middle = (a.x + b.x) / 2;\n  const result = route(\n    endpoints,\n    [\n      { type: \"move\", x: a.x, y: a.y },\n      { type: \"line\", x: middle, y: a.y },\n      { type: \"line\", x: middle, y: b.y },\n      { type: \"line\", x: b.x, y: b.y },\n    ],\n    options.arrowLength,\n  );\n  if (options.arrowLength)\n    return {\n      ...result,\n      arrowSegments: straightGraphRoute(\n        { sourceAnchor: { x: middle, y: b.y }, targetAnchor: b },\n        options,\n      ).arrowSegments,\n    };\n  return result;\n}\n/**\n * Build an independent horizontal cubic graph route in local logical units.\n * @param endpoints - Finite named source and target anchor points. See {@link GraphRoute}.\n * @param options - Optional nonnegative arrowLength (default zero); curvature defaults to 0.5 and must be in [0, 1].\n * @returns Named anchors and independently editable core path segments. See {@link GraphRoute}.\n */\nexport function curvedGraphRoute(\n  endpoints: Endpoints,\n  options: Readonly<{ curvature?: number; arrowLength?: number }> = {},\n): GraphRoute {\n  const { sourceAnchor: a, targetAnchor: b } = endpoints,\n    curvature = options.curvature ?? 0.5;\n  if (!Number.isFinite(curvature) || curvature < 0 || curvature > 1)\n    throw new RangeError(\"curvature must be between 0 and 1.\");\n  const dx = (b.x - a.x) * curvature;\n  const result = route(\n    endpoints,\n    [\n      { type: \"move\", x: a.x, y: a.y },\n      {\n        type: \"cubic\",\n        cp1x: a.x + dx,\n        cp1y: a.y,\n        cp2x: b.x - dx,\n        cp2y: b.y,\n        x: b.x,\n        y: b.y,\n      },\n    ],\n    options.arrowLength,\n  );\n  return options.arrowLength && dx !== 0\n    ? {\n        ...result,\n        arrowSegments: straightGraphRoute(\n          { sourceAnchor: { x: b.x - dx, y: b.y }, targetAnchor: b },\n          options,\n        ).arrowSegments,\n      }\n    : result;\n}\nexport function routePath(segments: GraphRoute[\"segments\"]): string {\n  const path = new PathGeometry();\n  path.spliceSegments(0, 0, segments);\n  return toSvgPathData(path);\n}\n"],
+  "mappings": "AAAA,SAAS,cAAc,qBAAqB;AAG5C,SAAS,MACP,WACA,UACA,cAAc,GACF;AACZ,QAAM,EAAE,cAAc,GAAG,cAAc,EAAE,IAAI;AAC7C,MAAK,CAAC,OAAO,SAAS,EAAE,CAAC,KAAK,CAAC,OAAO,SAAS,EAAE,CAAC,MAAO,CAAC,OAAO,SAAS,EAAE,CAAC,KAAK,CAAC,OAAO,SAAS,EAAE,CAAC;AAChG,UAAM,IAAI,WAAW,+BAA+B;AAC1D,MAAI,CAAC,OAAO,SAAS,WAAW,KAAK,cAAc;AACjD,UAAM,IAAI,WAAW,6CAA6C;AACpE,QAAM,QAAQ,KAAK,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAC3C,IAAI,KAAK,IAAI,KAAK,GAClB,IAAI,KAAK,IAAI,KAAK;AACpB,SAAO;AAAA,IACL,GAAG;AAAA,IACH;AAAA,IACA,eACE,gBAAgB,IACZ,OACA;AAAA,MACE,EAAE,MAAM,QAAQ,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE;AAAA,MAC/B;AAAA,QACE,MAAM;AAAA,QACN,GAAG,EAAE,IAAI,cAAc,IAAK,cAAc,IAAK;AAAA,QAC/C,GAAG,EAAE,IAAI,cAAc,IAAK,cAAc,IAAK;AAAA,MACjD;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,GAAG,EAAE,IAAI,cAAc,IAAK,cAAc,IAAK;AAAA,QAC/C,GAAG,EAAE,IAAI,cAAc,IAAK,cAAc,IAAK;AAAA,MACjD;AAAA,MACA,EAAE,MAAM,QAAQ;AAAA,IAClB;AAAA,EACR;AACF;AAOO,SAAS,mBACd,WACA,UAA8C,CAAC,GACnC;AACZ,QAAM,EAAE,cAAc,GAAG,cAAc,EAAE,IAAI;AAC7C,SAAO;AAAA,IACL;AAAA,IACA;AAAA,MACE,EAAE,MAAM,QAAQ,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE;AAAA,MAC/B,EAAE,MAAM,QAAQ,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE;AAAA,IACjC;AAAA,IACA,QAAQ;AAAA,EACV;AACF;AAOO,SAAS,qBACd,WACA,UAA8C,CAAC,GACnC;AACZ,QAAM,EAAE,cAAc,GAAG,cAAc,EAAE,IAAI,WAC3C,UAAU,EAAE,IAAI,EAAE,KAAK;AACzB,QAAM,SAAS;AAAA,IACb;AAAA,IACA;AAAA,MACE,EAAE,MAAM,QAAQ,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE;AAAA,MAC/B,EAAE,MAAM,QAAQ,GAAG,QAAQ,GAAG,EAAE,EAAE;AAAA,MAClC,EAAE,MAAM,QAAQ,GAAG,QAAQ,GAAG,EAAE,EAAE;AAAA,MAClC,EAAE,MAAM,QAAQ,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE;AAAA,IACjC;AAAA,IACA,QAAQ;AAAA,EACV;AACA,MAAI,QAAQ;AACV,WAAO;AAAA,MACL,GAAG;AAAA,MACH,eAAe;AAAA,QACb,EAAE,cAAc,EAAE,GAAG,QAAQ,GAAG,EAAE,EAAE,GAAG,cAAc,EAAE;AAAA,QACvD;AAAA,MACF,EAAE;AAAA,IACJ;AACF,SAAO;AACT;AAOO,SAAS,iBACd,WACA,UAAkE,CAAC,GACvD;AACZ,QAAM,EAAE,cAAc,GAAG,cAAc,EAAE,IAAI,WAC3C,YAAY,QAAQ,aAAa;AACnC,MAAI,CAAC,OAAO,SAAS,SAAS,KAAK,YAAY,KAAK,YAAY;AAC9D,UAAM,IAAI,WAAW,oCAAoC;AAC3D,QAAM,MAAM,EAAE,IAAI,EAAE,KAAK;AACzB,QAAM,SAAS;AAAA,IACb;AAAA,IACA;AAAA,MACE,EAAE,MAAM,QAAQ,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE;AAAA,MAC/B;AAAA,QACE,MAAM;AAAA,QACN,MAAM,EAAE,IAAI;AAAA,QACZ,MAAM,EAAE;AAAA,QACR,MAAM,EAAE,IAAI;AAAA,QACZ,MAAM,EAAE;AAAA,QACR,GAAG,EAAE;AAAA,QACL,GAAG,EAAE;AAAA,MACP;AAAA,IACF;AAAA,IACA,QAAQ;AAAA,EACV;AACA,SAAO,QAAQ,eAAe,OAAO,IACjC;AAAA,IACE,GAAG;AAAA,IACH,eAAe;AAAA,MACb,EAAE,cAAc,EAAE,GAAG,EAAE,IAAI,IAAI,GAAG,EAAE,EAAE,GAAG,cAAc,EAAE;AAAA,MACzD;AAAA,IACF,EAAE;AAAA,EACJ,IACA;AACN;AACO,SAAS,UAAU,UAA0C;AAClE,QAAM,OAAO,IAAI,aAAa;AAC9B,OAAK,eAAe,GAAG,GAAG,QAAQ;AAClC,SAAO,cAAc,IAAI;AAC3B;",
+  "names": []
+}

package/dist/features/viz/lib/graph/sankey.d.ts

@@ -0,0 +1,44 @@
+import type { NodeStyle } from "./types.js";
+import type { PibblNode } from "@pibbl/core";
+import type { GraphData, GraphNodeProps, MarkInteraction, SankeyFlowGeometry, SankeyLayout, SankeyNodeGeometry, SankeyOptions, SankeyProps, Style, EdgeStyle } from "./types.js";
+/** Places an acyclic weighted flow graph in deterministic left-to-right ranks.
+ * @param graph - Nodes and acyclic weighted edges. See {@link GraphData}.
+ * @param options - Accessors, bounds, and display unit. See {@link SankeyOptions}.
+ * @returns Immutable nodes and proportional flow geometry. See {@link SankeyLayout}.
+ */
+export declare function layoutSankey<N, E>(graph: GraphData<N, E>, options: SankeyOptions<N, E>): SankeyLayout<N, E>;
+/** Default node paint for custom Sankey compositions.
+ * @param _node - Node geometry.
+ * @returns Resolved node paint.
+ * @see {@link SankeyNode}
+ */
+export declare function defaultSankeyNodeStyle<N>(_node: SankeyNodeGeometry<N>): NodeStyle;
+/** Default flow paint for custom Sankey compositions.
+ * @param _flow - Flow geometry.
+ * @returns Resolved flow paint.
+ * @see {@link SankeyFlow}
+ */
+export declare function defaultSankeyFlowStyle<E>(_flow: SankeyFlowGeometry<E>): EdgeStyle;
+/** Draw one supplied Sankey node.
+ * @param argument - Node props.
+ * @returns Canvas node.
+ * @see {@link SankeyNodeGeometry}
+ */
+export declare function SankeyNode<N>({ node, style: input, children, ...events }: GraphNodeProps<N> & {
+    readonly node: SankeyNodeGeometry<N>;
+}): PibblNode;
+/** Draw one supplied Sankey flow.
+ * @param argument - Flow props.
+ * @returns Canvas node.
+ * @see {@link SankeyFlowGeometry}
+ */
+export declare function SankeyFlow<E>({ flow, style: input, ...events }: MarkInteraction & {
+    readonly flow: SankeyFlowGeometry<E>;
+    readonly style?: Style<EdgeStyle>;
+}): PibblNode;
+/** Render a weighted acyclic flow graph.
+ * @param props - Graph data and presentation.
+ * @returns Canvas node.
+ * @see {@link layoutSankey}
+ */
+export declare function Sankey<N, E>(props: SankeyProps<N, E>): PibblNode;