@pibbl/core 0.0.2 → 0.0.3-alpha.109.1

package/dist/lib/layout/standalone-kernel.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/lib/layout/standalone-kernel.ts"],
+  "sourcesContent": ["/**\n * Friend adapter for `@pibbl/layout`. It owns one native persistent tree and\n * deliberately has no Canvas, signal, component, or scheduler dependency.\n */\nimport { readyLayoutModule } from \"./wasm/module.js\";\n\ntype Direction = \"ltr\" | \"rtl\";\ntype Measure = (input: {\n  readonly width: { readonly minimum: number; readonly maximum: number };\n  readonly height: { readonly minimum: number; readonly maximum: number };\n}) => { readonly width: number; readonly height: number };\ntype IntrinsicMeasure = () => {\n  readonly minWidth: number;\n  readonly maxWidth: number;\n  readonly minHeight: number;\n  readonly maxHeight: number;\n};\n/** One private native-tree node provided by {@link StandaloneLayoutKernelInput}. */\nexport interface StandaloneLayoutKernelNode {\n  /** Traversal-local node identifier. */ readonly id: number;\n  /** Parent identifier, if any. */ readonly parent: number | undefined;\n  /** Source-order child identifiers. */ readonly children: readonly number[];\n  /** Fully normalized standalone style data. */ readonly style: Readonly<\n    Record<string, unknown>\n  >;\n  /** Final-size measurement callback, if owned by this node. */ readonly measure:\n    Measure | undefined;\n  /** Paired intrinsic contribution callback, if owned by this node. */ readonly measureIntrinsic:\n    IntrinsicMeasure | undefined;\n}\n/** Private request consumed by {@link StandaloneLayoutKernel}. */\nexport interface StandaloneLayoutKernelInput {\n  /** Identifier of the calculated root. */ readonly root: number;\n  /** Finite owner width. */ readonly width: number;\n  /** Finite owner height. */ readonly height: number;\n  /** Inherited layout direction. */ readonly direction: Direction;\n  /** Reachable source-order native nodes. */ readonly nodes: readonly StandaloneLayoutKernelNode[];\n}\n/** One private box returned by {@link StandaloneLayoutKernel}. */\nexport interface StandaloneLayoutKernelBox {\n  /** Traversal-local node identifier. */ readonly id: number;\n  /** Physical x coordinate. */ readonly x: number;\n  /** Physical y coordinate. */ readonly y: number;\n  /** Outer width. */ readonly width: number;\n  /** Outer height. */ readonly height: number;\n}\n/** Private native-tree owner used by the version-coupled {@link StandaloneLayoutKernelInput} adapter. */\nexport interface StandaloneLayoutKernel {\n  /**\n   * Calculates boxes for one request.\n   * @param input - Fully normalized owned-tree input.\n   * @returns Frozen native boxes in traversal order.\n   */ calculate(\n    input: StandaloneLayoutKernelInput,\n  ): readonly StandaloneLayoutKernelBox[];\n  /** Releases the native arena. */ dispose(): void;\n}\n\ninterface Kernel {\n  memory: WebAssembly.Memory;\n  standalone_tree_create(): number;\n  standalone_tree_generation(handle: number): number;\n  standalone_tree_dispose(handle: number, generation: number): number;\n  standalone_tree_resize_nodes(\n    handle: number,\n    generation: number,\n    count: number,\n  ): number;\n  standalone_tree_resize_children(\n    handle: number,\n    generation: number,\n    count: number,\n  ): number;\n  standalone_tree_resize_grid(\n    handle: number,\n    generation: number,\n    count: number,\n  ): number;\n  standalone_tree_replace(\n    handle: number,\n    generation: number,\n    root: number,\n    direction: number,\n  ): number;\n  standalone_tree_prepare(\n    handle: number,\n    generation: number,\n    width: number,\n    height: number,\n  ): number;\n  standalone_tree_prepare_settled_measurements(\n    handle: number,\n    generation: number,\n  ): number;\n  standalone_tree_measure_count(handle: number, generation: number): number;\n  standalone_tree_measure_node(\n    handle: number,\n    generation: number,\n    index: number,\n  ): number;\n  standalone_tree_measure_kind(\n    handle: number,\n    generation: number,\n    index: number,\n  ): number;\n  standalone_tree_measure_width_min(\n    handle: number,\n    generation: number,\n    index: number,\n  ): number;\n  standalone_tree_measure_width_max(\n    handle: number,\n    generation: number,\n    index: number,\n  ): number;\n  standalone_tree_measure_height_min(\n    handle: number,\n    generation: number,\n    index: number,\n  ): number;\n  standalone_tree_measure_height_max(\n    handle: number,\n    generation: number,\n    index: number,\n  ): number;\n  standalone_tree_resize_measurements(\n    handle: number,\n    generation: number,\n    count: number,\n  ): number;\n  standalone_tree_solve(\n    handle: number,\n    generation: number,\n    width: number,\n    height: number,\n  ): number;\n  standalone_tree_box_count(handle: number, generation: number): number;\n  standalone_tree_box_id(\n    handle: number,\n    generation: number,\n    index: number,\n  ): number;\n  standalone_tree_box_x(\n    handle: number,\n    generation: number,\n    index: number,\n  ): number;\n  standalone_tree_box_y(\n    handle: number,\n    generation: number,\n    index: number,\n  ): number;\n  standalone_tree_box_width(\n    handle: number,\n    generation: number,\n    index: number,\n  ): number;\n  standalone_tree_box_height(\n    handle: number,\n    generation: number,\n    index: number,\n  ): number;\n  dispose(): void;\n}\n\n// Keep this record deliberately append-only.  The Rust owner validates every\n// field before it enters the persistent tree.\nconst NODE_STRIDE = 70;\nconst MEASUREMENT_STRIDE = 7;\nconst LENGTH_NONE = 0;\nconst LENGTH_POINT = 1;\nconst LENGTH_PERCENT = 2;\nconst LENGTH_AUTO = 3;\nconst FLEX_DIRECTIONS = [\n  \"row\",\n  \"row-reverse\",\n  \"column\",\n  \"column-reverse\",\n] as const;\nconst FLEX_WRAPS = [\"nowrap\", \"wrap\", \"wrap-reverse\"] as const;\nconst JUSTIFY_CONTENT = [\n  \"flex-start\",\n  \"flex-end\",\n  \"center\",\n  \"space-between\",\n  \"space-around\",\n  \"space-evenly\",\n] as const;\nconst ALIGNMENTS = [\n  \"stretch\",\n  \"flex-start\",\n  \"flex-end\",\n  \"center\",\n  \"baseline\",\n  \"first-baseline\",\n  \"last-baseline\",\n] as const;\nconst ALIGN_SELF = [\n  \"auto\",\n  \"stretch\",\n  \"flex-start\",\n  \"flex-end\",\n  \"center\",\n  \"baseline\",\n  \"first-baseline\",\n  \"last-baseline\",\n] as const;\nconst ALIGN_CONTENT = [\n  \"flex-start\", \"flex-end\", \"center\", \"stretch\", \"space-between\",\n  \"space-around\", \"space-evenly\",\n] as const;\nconst POSITIONS = [\"relative\", \"static\", \"absolute\"] as const;\nconst BOX_SIZINGS = [\"border-box\", \"content-box\"] as const;\nconst GRID_FLOWS = [\"row\", \"column\", \"row dense\", \"column dense\"] as const;\nfunction status(value: number, action: string): void {\n  if (value !== 0)\n    throw new Error(`Standalone native layout ${action} failed (${value}).`);\n}\nfunction finite(value: unknown, property: string): number {\n  if (typeof value !== \"number\" || !Number.isFinite(value))\n    throw new TypeError(\n      `Standalone layout ${property} must be a finite number.`,\n    );\n  return value;\n}\nfunction length(\n  records: Float64Array,\n  offset: number,\n  value: unknown,\n  property: string,\n): void {\n  if (value === undefined) {\n    records[offset] = 0;\n    records[offset + 1] = LENGTH_NONE;\n    return;\n  }\n  if (value === \"auto\") {\n    records[offset] = 0;\n    records[offset + 1] = LENGTH_AUTO;\n    return;\n  }\n  if (typeof value === \"number\") {\n    records[offset] = finite(value, property);\n    records[offset + 1] = LENGTH_POINT;\n    return;\n  }\n  if (typeof value === \"string\" && /^-?(?:\\d+|\\d*\\.\\d+)%$/.test(value)) {\n    records[offset] = Number.parseFloat(value);\n    records[offset + 1] = LENGTH_PERCENT;\n    return;\n  }\n  throw new TypeError(\n    `Standalone layout ${property} must be numeric, percentage, auto, or omitted.`,\n  );\n}\nfunction numeric(\n  records: Float64Array,\n  offset: number,\n  value: unknown,\n  fallback: number,\n  property: string,\n): void {\n  records[offset] = value === undefined ? fallback : finite(value, property);\n}\nfunction numericValue(\n  value: unknown,\n  fallback: number,\n  property: string,\n): number {\n  return value === undefined ? fallback : finite(value, property);\n}\nfunction enumCode(\n  value: unknown,\n  values: readonly string[],\n  fallback: number,\n  property: string,\n): number {\n  if (value === undefined) return fallback;\n  const index = values.indexOf(value as string);\n  if (index < 0)\n    throw new TypeError(\n      `Standalone layout ${property} is unsupported by the native tree boundary.`,\n    );\n  return index;\n}\nfunction edge(\n  style: Readonly<Record<string, unknown>>,\n  side: \"top\" | \"right\" | \"bottom\" | \"left\",\n  property: \"padding\" | \"borderWidth\",\n): unknown {\n  const value = style[property];\n  if (\n    value === undefined ||\n    typeof value === \"number\" ||\n    typeof value === \"string\"\n  )\n    return value;\n  if (value !== null && typeof value === \"object\")\n    return (value as Record<string, unknown>)[side];\n  throw new TypeError(\n    `Standalone layout ${property} must be a scalar or physical-edge record.`,\n  );\n}\n\nclass NativeStandaloneLayoutKernel implements StandaloneLayoutKernel {\n  #kernel: Kernel | undefined;\n  #handle = 0;\n  #generation = 0;\n  constructor() {\n    this.#kernel = new WebAssembly.Instance(readyLayoutModule())\n      .exports as unknown as Kernel;\n    this.#handle = this.kernel.standalone_tree_create();\n    this.#generation = this.#handle\n      ? this.kernel.standalone_tree_generation(this.#handle)\n      : 0;\n    if (!this.#handle || !this.#generation)\n      throw new Error(\"Standalone native tree allocation failed.\");\n  }\n  get kernel(): Kernel {\n    if (!this.#kernel)\n      throw new Error(\"The standalone layout kernel has been disposed.\");\n    return this.#kernel;\n  }\n  calculate(\n    input: StandaloneLayoutKernelInput,\n  ): readonly StandaloneLayoutKernelBox[] {\n    if (\n      !Number.isFinite(input.width) ||\n      input.width < 0 ||\n      !Number.isFinite(input.height) ||\n      input.height < 0\n    )\n      throw new RangeError(\n        \"Standalone layout constraints must be finite and nonnegative.\",\n      );\n    const nodes = input.nodes;\n    const sourceIndex = new Map<number, number>();\n    for (let index = 0; index < nodes.length; index++) {\n      const id = nodes[index]!.id;\n      if (!Number.isInteger(id) || id < 0 || sourceIndex.has(id))\n        throw new Error(\n          \"Standalone layout node ids must be unique nonnegative integers.\",\n        );\n      sourceIndex.set(id, index);\n    }\n    const rootIndex = sourceIndex.get(input.root);\n    if (rootIndex === undefined)\n      throw new Error(\n        \"Standalone layout root is not present in the owned node set.\",\n      );\n    const children: number[] = [];\n    const pointer = this.kernel.standalone_tree_resize_nodes(\n      this.#handle,\n      this.#generation,\n      nodes.length,\n    );\n    if (!pointer && nodes.length)\n      throw new Error(\"Standalone native node storage allocation failed.\");\n    const records = new Float64Array(\n      this.kernel.memory.buffer,\n      pointer,\n      nodes.length * NODE_STRIDE,\n    );\n    for (let index = 0; index < nodes.length; index++) {\n      const node = nodes[index]!;\n      const offset = index * NODE_STRIDE;\n      const style = node.style;\n      const parentIndex =\n        node.parent === undefined ? -1 : sourceIndex.get(node.parent);\n      if (parentIndex === undefined)\n        throw new Error(\n          \"Standalone layout node parent is not present in the owned node set.\",\n        );\n      const parent = parentIndex < 0 ? undefined : nodes[parentIndex];\n      const gridContainerDeclaration =\n        style.gridTemplateColumns !== undefined ||\n        style.gridTemplateRows !== undefined ||\n        style.gridAutoColumns !== undefined ||\n        style.gridAutoRows !== undefined ||\n        style.gridAutoFlow !== undefined;\n      const gridItemDeclaration =\n        style.gridColumnStart !== undefined ||\n        style.gridColumnSpan !== undefined ||\n        style.gridRowStart !== undefined ||\n        style.gridRowSpan !== undefined;\n      const flexContainerDeclaration =\n        style.flexDirection !== undefined ||\n        style.flexWrap !== undefined ||\n        style.justifyContent !== undefined ||\n        style.alignContent !== undefined;\n      const flexItemDeclaration =\n        style.flexBasis !== undefined ||\n        style.flexGrow !== undefined ||\n        style.flexShrink !== undefined;\n      if (style.layout !== \"grid\" && gridContainerDeclaration)\n        throw new TypeError(\n          \"Standalone Grid declarations require layout: 'grid'.\",\n        );\n      if (style.layout === \"grid\" && flexContainerDeclaration)\n        throw new TypeError(\n          \"Standalone Flex-container declarations cannot be applied to a Grid owner.\",\n        );\n      if (parent === undefined && style.layout === \"grid\" && flexItemDeclaration)\n        throw new TypeError(\n          \"Standalone Flex item declarations require a Flex parent.\",\n        );\n      if (parent?.style.layout === \"grid\" && flexItemDeclaration)\n        throw new TypeError(\n          \"Standalone Flex item declarations require a Flex parent.\",\n        );\n      if (parent?.style.layout !== \"grid\" && gridItemDeclaration)\n        throw new TypeError(\n          \"Standalone Grid item placement requires a Grid parent.\",\n        );\n      if (style.overflow !== undefined && style.overflow !== \"visible\")\n        throw new TypeError(\n          \"The standalone native tree does not yet admit clipped overflow.\",\n        );\n      if (style.alignItems === 'baseline' || style.alignItems === 'first-baseline' || style.alignItems === 'last-baseline' ||\n          style.alignSelf === 'baseline' || style.alignSelf === 'first-baseline' || style.alignSelf === 'last-baseline')\n        throw new TypeError('Standalone baseline alignment requires a baseline provider and is not supported.');\n      records[offset] = index;\n      records[offset + 1] = parentIndex;\n      records[offset + 2] = children.length;\n      records[offset + 3] = node.children.length;\n      for (const child of node.children) {\n        const childIndex = sourceIndex.get(child);\n        if (childIndex === undefined)\n          throw new Error(\n            \"Standalone layout child is not present in the owned node set.\",\n          );\n        children.push(childIndex);\n      }\n      length(records, offset + 4, style.width, \"width\");\n      length(records, offset + 6, style.height, \"height\");\n      length(records, offset + 8, style.minWidth, \"minWidth\");\n      length(records, offset + 10, style.minHeight, \"minHeight\");\n      length(records, offset + 12, style.maxWidth, \"maxWidth\");\n      length(records, offset + 14, style.maxHeight, \"maxHeight\");\n      length(records, offset + 16, style.flexBasis, \"flexBasis\");\n      numeric(records, offset + 18, style.flexGrow, 0, \"flexGrow\");\n      numeric(records, offset + 19, style.flexShrink, 0, \"flexShrink\");\n      numeric(records, offset + 20, style.gap, 0, \"gap\");\n      numeric(records, offset + 21, style.rowGap, -1, \"rowGap\");\n      numeric(records, offset + 22, style.columnGap, -1, \"columnGap\");\n      records[offset + 23] = enumCode(\n        style.flexDirection,\n        FLEX_DIRECTIONS,\n        0,\n        \"flexDirection\",\n      );\n      records[offset + 24] = enumCode(\n        style.flexWrap,\n        FLEX_WRAPS,\n        0,\n        \"flexWrap\",\n      );\n      records[offset + 25] = enumCode(\n        style.justifyContent,\n        JUSTIFY_CONTENT,\n        0,\n        \"justifyContent\",\n      );\n      records[offset + 26] = enumCode(\n        style.alignItems,\n        ALIGNMENTS,\n        0,\n        \"alignItems\",\n      );\n      records[offset + 27] = enumCode(\n        style.alignSelf,\n        ALIGN_SELF,\n        0,\n        \"alignSelf\",\n      );\n      records[offset + 50] = enumCode(style.alignContent, ALIGN_CONTENT, 0, \"alignContent\");\n      records[offset + 51] = enumCode(style.position, POSITIONS, 0, \"position\");\n      records[offset + 52] = enumCode(style.boxSizing, BOX_SIZINGS, 0, \"boxSizing\");\n      numeric(records, offset + 53, style.aspectRatio, 0, \"aspectRatio\");\n      if (records[offset + 53] < 0 || (records[offset + 53] !== 0 && records[offset + 53] <= 0))\n        throw new TypeError(\"Standalone layout aspectRatio must be positive.\");\n      length(records, offset + 54, style.left, \"left\");\n      length(records, offset + 56, style.right, \"right\");\n      length(records, offset + 58, style.top, \"top\");\n      length(records, offset + 60, style.bottom, \"bottom\");\n      const borderLeft = edge(style, \"left\", \"borderWidth\") ?? 0;\n      const borderRight = edge(style, \"right\", \"borderWidth\") ?? 0;\n      const borderTop = edge(style, \"top\", \"borderWidth\") ?? 0;\n      const borderBottom = edge(style, \"bottom\", \"borderWidth\") ?? 0;\n      records[offset + 62] = finite(borderLeft, \"borderWidth.left\");\n      records[offset + 63] = finite(borderRight, \"borderWidth.right\");\n      records[offset + 64] = finite(borderTop, \"borderWidth.top\");\n      records[offset + 65] = finite(borderBottom, \"borderWidth.bottom\");\n      if (records[offset + 62] < 0 || records[offset + 63] < 0 || records[offset + 64] < 0 || records[offset + 65] < 0)\n        throw new TypeError(\"Standalone layout borderWidth must be nonnegative.\");\n      length(\n        records,\n        offset + 28,\n        style.marginLeft ?? style.margin,\n        \"marginLeft\",\n      );\n      length(\n        records,\n        offset + 30,\n        style.marginRight ?? style.margin,\n        \"marginRight\",\n      );\n      length(\n        records,\n        offset + 32,\n        style.marginTop ?? style.margin,\n        \"marginTop\",\n      );\n      length(\n        records,\n        offset + 34,\n        style.marginBottom ?? style.margin,\n        \"marginBottom\",\n      );\n      length(\n        records,\n        offset + 36,\n        edge(style, \"left\", \"padding\") ?? 0,\n        \"padding.left\",\n      );\n      length(\n        records,\n        offset + 38,\n        edge(style, \"right\", \"padding\") ?? 0,\n        \"padding.right\",\n      );\n      length(\n        records,\n        offset + 40,\n        edge(style, \"top\", \"padding\") ?? 0,\n        \"padding.top\",\n      );\n      length(\n        records,\n        offset + 42,\n        edge(style, \"bottom\", \"padding\") ?? 0,\n        \"padding.bottom\",\n      );\n      if (\n        (records[offset + 37] !== LENGTH_POINT &&\n          records[offset + 37] !== LENGTH_PERCENT) ||\n        (records[offset + 39] !== LENGTH_POINT &&\n          records[offset + 39] !== LENGTH_PERCENT) ||\n        (records[offset + 41] !== LENGTH_POINT &&\n          records[offset + 41] !== LENGTH_PERCENT) ||\n        (records[offset + 43] !== LENGTH_POINT &&\n          records[offset + 43] !== LENGTH_PERCENT)\n      )\n        throw new TypeError(\n          \"Standalone layout padding must be numeric or percentage.\",\n        );\n      records[offset + 44] = node.measure ? 1 : 0;\n      records[offset + 49] = node.measureIntrinsic ? 1 : 0;\n      records[offset + 45] = numericValue(\n        style.gridColumnStart,\n        0,\n        \"gridColumnStart\",\n      );\n      records[offset + 46] = numericValue(\n        style.gridColumnSpan,\n        1,\n        \"gridColumnSpan\",\n      );\n      records[offset + 47] = numericValue(\n        style.gridRowStart,\n        0,\n        \"gridRowStart\",\n      );\n      records[offset + 48] = numericValue(style.gridRowSpan, 1, \"gridRowSpan\");\n    }\n    const grid: number[] = [];\n    type PackedTrack = readonly [\n      number,\n      number,\n      number,\n      number,\n      number,\n      number,\n      number,\n    ];\n    const breadth = (\n      value: unknown,\n      property: string,\n    ): readonly [number, number] => {\n      if (typeof value === \"number\" && Number.isFinite(value) && value >= 0)\n        return [0, value];\n      if (typeof value === \"string\" && /^(?:\\d+|\\d*\\.\\d+)%$/.test(value))\n        return [1, Number.parseFloat(value)];\n      if (\n        typeof value === \"string\" &&\n        /^(?:\\d+|\\d*\\.\\d+)fr$/.test(value) &&\n        Number.parseFloat(value) >= 0\n      )\n        return [2, Number.parseFloat(value)];\n      if (value === \"min-content\") return [3, 0];\n      if (value === \"max-content\") return [4, 0];\n      if (value === \"auto\") return [5, 0];\n      throw new TypeError(\n        `Standalone Grid ${property} must be a finite, percentage, fractional, or intrinsic track.`,\n      );\n    };\n    const track = (value: unknown, property: string): PackedTrack => {\n      if (\n        value !== null &&\n        typeof value === \"object\" &&\n        (value as { kind?: unknown }).kind === \"minmax\"\n      ) {\n        const min = breadth(\n          (value as { min?: unknown }).min,\n          `${property}.min`,\n        );\n        const max = breadth(\n          (value as { max?: unknown }).max,\n          `${property}.max`,\n        );\n        return [6, 0, min[0], min[1], max[0], max[1], 0];\n      }\n      if (\n        value !== null &&\n        typeof value === \"object\" &&\n        (value as { kind?: unknown }).kind === \"fit-content\"\n      ) {\n        const limit = breadth(\n          (value as { limit?: unknown }).limit,\n          `${property}.limit`,\n        );\n        if (limit[0] > 1)\n          throw new TypeError(\n            `Standalone Grid ${property} fit-content limit must be numeric or percentage.`,\n          );\n        return [limit[0] === 1 ? 9 : 7, limit[1], 0, 0, 4, 0, 0];\n      }\n      const fixed = breadth(value, property);\n      return [fixed[0], fixed[1], 0, 0, 4, fixed[1], 0];\n    };\n    const expand = (\n      value: unknown,\n      property: string,\n      target: PackedTrack[],\n      nestedAuto = false,\n    ): void => {\n      if (\n        value !== null &&\n        typeof value === \"object\" &&\n        (value as { kind?: unknown }).kind === \"repeat\"\n      ) {\n        const repeat = value as { count?: unknown; tracks?: unknown };\n        if (!Array.isArray(repeat.tracks) || !repeat.tracks.length)\n          throw new TypeError(\n            `Standalone Grid ${property} repeat requires tracks.`,\n          );\n        if (repeat.count === \"auto-fill\" || repeat.count === \"auto-fit\") {\n          if (nestedAuto)\n            throw new TypeError(\n              `Standalone Grid ${property} does not permit nested automatic repeats.`,\n            );\n          const pattern: PackedTrack[] = [];\n          for (const nested of repeat.tracks)\n            expand(nested, `${property}.tracks`, pattern, true);\n          // Marker kind 8 is expanded by the owner-bound native Grid helper.\n          target.push([\n            8,\n            repeat.count === \"auto-fill\" ? 1 : 2,\n            pattern.length,\n            0,\n            0,\n            0,\n            0,\n          ]);\n          for (const record of pattern) target.push(record);\n          return;\n        }\n        if (!Number.isInteger(repeat.count) || (repeat.count as number) < 1)\n          throw new TypeError(\n            `Standalone Grid ${property} repeat count must be positive or automatic.`,\n          );\n        for (let count = 0; count < (repeat.count as number); count++)\n          for (const nested of repeat.tracks)\n            expand(nested, `${property}.tracks`, target, nestedAuto);\n        return;\n      }\n      target.push(track(value, property));\n    };\n    for (let index = 0; index < nodes.length; index++) {\n      const style = nodes[index]!.style;\n      if (style.layout !== \"grid\") continue;\n      const columns = style.gridTemplateColumns;\n      const rows = style.gridTemplateRows;\n      if (\n        !Array.isArray(columns) ||\n        !Array.isArray(rows) ||\n        !columns.length ||\n        !rows.length\n      )\n        throw new TypeError(\n          \"Standalone Grid requires nonempty explicit column and row tracks.\",\n        );\n      const packedColumns: PackedTrack[] = [];\n      const packedRows: PackedTrack[] = [];\n      for (const value of columns)\n        expand(value, \"gridTemplateColumns\", packedColumns);\n      for (const value of rows) expand(value, \"gridTemplateRows\", packedRows);\n      const flow = enumCode(style.gridAutoFlow, GRID_FLOWS, 0, \"gridAutoFlow\");\n      const autoColumn =\n        style.gridAutoColumns === undefined\n          ? undefined\n          : track(style.gridAutoColumns, \"gridAutoColumns\");\n      const autoRow =\n        style.gridAutoRows === undefined\n          ? undefined\n          : track(style.gridAutoRows, \"gridAutoRows\");\n      // Header: owner, explicit axis counts, gaps, flow, configured implicit-axis flags, then auto records and explicit records.\n      grid.push(\n        index,\n        packedColumns.length,\n        packedRows.length,\n        numericValue(style.columnGap ?? style.gap, 0, \"columnGap\"),\n        numericValue(style.rowGap ?? style.gap, 0, \"rowGap\"),\n        flow,\n        autoColumn ? 1 : 0,\n        autoRow ? 1 : 0,\n        ...(autoColumn ?? [0, 0, 0, 0, 4, 0, 0]),\n        ...(autoRow ?? [0, 0, 0, 0, 4, 0, 0]),\n      );\n      for (const value of packedColumns) grid.push(...value);\n      for (const value of packedRows) grid.push(...value);\n    }\n    const gridPointer = this.kernel.standalone_tree_resize_grid(\n      this.#handle,\n      this.#generation,\n      grid.length,\n    );\n    if (!gridPointer && grid.length)\n      throw new Error(\"Standalone native Grid storage allocation failed.\");\n    new Float64Array(this.kernel.memory.buffer, gridPointer, grid.length).set(\n      grid,\n    );\n    const childPointer = this.kernel.standalone_tree_resize_children(\n      this.#handle,\n      this.#generation,\n      children.length,\n    );\n    if (!childPointer && children.length)\n      throw new Error(\"Standalone native child storage allocation failed.\");\n    new Uint32Array(\n      this.kernel.memory.buffer,\n      childPointer,\n      children.length,\n    ).set(children);\n    status(\n      this.kernel.standalone_tree_replace(\n        this.#handle,\n        this.#generation,\n        rootIndex,\n        input.direction === \"rtl\" ? 1 : 0,\n      ),\n      \"tree replacement\",\n    );\n    status(\n      this.kernel.standalone_tree_prepare(\n        this.#handle,\n        this.#generation,\n        input.width,\n        input.height,\n      ),\n      \"measurement preparation\",\n    );\n    const count = this.kernel.standalone_tree_measure_count(\n      this.#handle,\n      this.#generation,\n    );\n    const measurementPointer = this.kernel.standalone_tree_resize_measurements(\n      this.#handle,\n      this.#generation,\n      count,\n    );\n    if (!measurementPointer && count)\n      throw new Error(\n        \"Standalone native measurement storage allocation failed.\",\n      );\n    const measurements = new Float64Array(\n      this.kernel.memory.buffer,\n      measurementPointer,\n      count * MEASUREMENT_STRIDE,\n    );\n    for (let index = 0; index < count; index++) {\n      const nativeId = this.kernel.standalone_tree_measure_node(\n        this.#handle,\n        this.#generation,\n        index,\n      );\n      const node = nodes[nativeId];\n      const kind = this.kernel.standalone_tree_measure_kind(\n        this.#handle,\n        this.#generation,\n        index,\n      );\n      if (!node)\n        throw new Error(\n          \"Standalone native tree requested an unknown measurement node.\",\n        );\n      // Native tree ids are traversal indexes; public owned-node ids are only\n      // mapped back after solve. Returning the public id here misroutes a\n      // callback whenever a root does not happen to be id zero.\n      const offset = index * MEASUREMENT_STRIDE;\n      measurements[offset] = nativeId;\n      if (kind === 0) {\n        if (!node.measure)\n          throw new Error(\n            \"Standalone native tree requested a node without an owned measurement callback.\",\n          );\n        const result = node.measure({\n          width: {\n            minimum: this.kernel.standalone_tree_measure_width_min(\n              this.#handle,\n              this.#generation,\n              index,\n            ),\n            maximum: this.kernel.standalone_tree_measure_width_max(\n              this.#handle,\n              this.#generation,\n              index,\n            ),\n          },\n          height: {\n            minimum: this.kernel.standalone_tree_measure_height_min(\n              this.#handle,\n              this.#generation,\n              index,\n            ),\n            maximum: this.kernel.standalone_tree_measure_height_max(\n              this.#handle,\n              this.#generation,\n              index,\n            ),\n          },\n        });\n        measurements[offset + 1] = finite(result.width, \"measurement width\");\n        measurements[offset + 2] = finite(result.height, \"measurement height\");\n      } else if (kind === 1) {\n        if (!node.measureIntrinsic)\n          throw new Error(\n            \"Standalone native tree requested a node without an owned intrinsic measurement callback.\",\n          );\n        const result = node.measureIntrinsic();\n        measurements[offset + 3] = finite(\n          result.minWidth,\n          \"intrinsic minimum width\",\n        );\n        measurements[offset + 4] = finite(\n          result.maxWidth,\n          \"intrinsic maximum width\",\n        );\n        measurements[offset + 5] = finite(\n          result.minHeight,\n          \"intrinsic minimum height\",\n        );\n        measurements[offset + 6] = finite(\n          result.maxHeight,\n          \"intrinsic maximum height\",\n        );\n        if (\n          measurements[offset + 3] > measurements[offset + 4] ||\n          measurements[offset + 5] > measurements[offset + 6]\n        )\n          throw new RangeError(\n            \"Standalone intrinsic measurement minimums must not exceed maximums.\",\n          );\n      } else\n        throw new Error(\n          \"Standalone native tree requested an unknown measurement kind.\",\n        );\n    }\n    status(\n      this.kernel.standalone_tree_solve(\n        this.#handle,\n        this.#generation,\n        input.width,\n        input.height,\n      ),\n      \"solve\",\n    );\n    // The native first pass has now fixed every parent allocation.  Ask the\n    // tree for one bounded continuation at those boxes, then let native solve\n    // placement again from the refreshed measurements.\n    let settled = false;\n    for (let phase = 0; phase <= nodes.length; phase++) {\n    status(\n      this.kernel.standalone_tree_prepare_settled_measurements(\n        this.#handle,\n        this.#generation,\n      ),\n      \"settled measurement preparation\",\n    );\n    const settledCount = this.kernel.standalone_tree_measure_count(\n      this.#handle,\n      this.#generation,\n    );\n    if (!settledCount) { settled = true; break; }\n    {\n      const settledPointer = this.kernel.standalone_tree_resize_measurements(this.#handle, this.#generation, settledCount);\n      if (!settledPointer) throw new Error(\"Standalone native settled measurement storage allocation failed.\");\n      const settled = new Float64Array(this.kernel.memory.buffer, settledPointer, settledCount * MEASUREMENT_STRIDE);\n      for (let index = 0; index < settledCount; index++) {\n        const nativeId = this.kernel.standalone_tree_measure_node(this.#handle, this.#generation, index);\n        const node = nodes[nativeId]; const kind = this.kernel.standalone_tree_measure_kind(this.#handle, this.#generation, index);\n        if (!node) throw new Error(\"Standalone native tree requested an unknown settled measurement node.\");\n        const offset = index * MEASUREMENT_STRIDE; settled[offset] = nativeId;\n        if (kind === 0) {\n          if (!node.measure) throw new Error(\"Standalone native tree requested a node without an owned measurement callback.\");\n          const result = node.measure({ width: { minimum: this.kernel.standalone_tree_measure_width_min(this.#handle, this.#generation, index), maximum: this.kernel.standalone_tree_measure_width_max(this.#handle, this.#generation, index) }, height: { minimum: this.kernel.standalone_tree_measure_height_min(this.#handle, this.#generation, index), maximum: this.kernel.standalone_tree_measure_height_max(this.#handle, this.#generation, index) } });\n          settled[offset + 1] = finite(result.width, \"settled measurement width\"); settled[offset + 2] = finite(result.height, \"settled measurement height\");\n        } else if (kind === 1) {\n          if (!node.measureIntrinsic) throw new Error(\"Standalone native tree requested a node without an owned intrinsic measurement callback.\");\n          const result = node.measureIntrinsic(); settled[offset + 3] = finite(result.minWidth, \"settled intrinsic minimum width\"); settled[offset + 4] = finite(result.maxWidth, \"settled intrinsic maximum width\"); settled[offset + 5] = finite(result.minHeight, \"settled intrinsic minimum height\"); settled[offset + 6] = finite(result.maxHeight, \"settled intrinsic maximum height\");\n          if (settled[offset + 3] > settled[offset + 4] || settled[offset + 5] > settled[offset + 6]) throw new RangeError(\"Standalone settled intrinsic measurement minimums must not exceed maximums.\");\n        } else throw new Error(\"Standalone native tree requested an unknown settled measurement kind.\");\n      }\n      status(this.kernel.standalone_tree_solve(this.#handle, this.#generation, input.width, input.height), \"settled solve\");\n    }\n    }\n    if (!settled)\n      throw new Error(`Standalone native layout measurement continuation did not converge within ${nodes.length + 1} native dependency phases.`);\n    const boxCount = this.kernel.standalone_tree_box_count(\n      this.#handle,\n      this.#generation,\n    );\n    if (boxCount !== nodes.length)\n      throw new Error(\"Standalone native tree returned an incomplete box set.\");\n    const boxes: StandaloneLayoutKernelBox[] = [];\n    for (let index = 0; index < boxCount; index++) {\n      const nativeId = this.kernel.standalone_tree_box_id(\n        this.#handle,\n        this.#generation,\n        index,\n      );\n      const source = nodes[nativeId];\n      if (!source)\n        throw new Error(\"Standalone native tree returned an unknown node id.\");\n      const box = {\n        id: source.id,\n        x: this.kernel.standalone_tree_box_x(\n          this.#handle,\n          this.#generation,\n          index,\n        ),\n        y: this.kernel.standalone_tree_box_y(\n          this.#handle,\n          this.#generation,\n          index,\n        ),\n        width: this.kernel.standalone_tree_box_width(\n          this.#handle,\n          this.#generation,\n          index,\n        ),\n        height: this.kernel.standalone_tree_box_height(\n          this.#handle,\n          this.#generation,\n          index,\n        ),\n      };\n      boxes.push(box);\n    }\n    return Object.freeze(\n      boxes.map((box) => Object.freeze(box)) as StandaloneLayoutKernelBox[],\n    );\n  }\n  dispose(): void {\n    const kernel = this.#kernel;\n    if (!kernel) return;\n    this.#kernel = undefined;\n    try {\n      if (\n        this.#handle &&\n        kernel.standalone_tree_dispose(this.#handle, this.#generation) !== 0\n      )\n        throw new Error(\"Standalone native tree disposal failed.\");\n    } finally {\n      this.#handle = 0;\n      this.#generation = 0;\n      kernel.dispose();\n    }\n  }\n}\n\n/**\n * Creates a private native-tree owner used by {@link StandaloneLayoutKernelInput}.\n * @returns A disposable standalone kernel.\n */\nexport function createStandaloneLayoutKernel(): StandaloneLayoutKernel {\n  return new NativeStandaloneLayoutKernel();\n}\n"],
+  "mappings": "AAIA,SAAS,yBAAyB;AAmKlC,MAAM,cAAc;AACpB,MAAM,qBAAqB;AAC3B,MAAM,cAAc;AACpB,MAAM,eAAe;AACrB,MAAM,iBAAiB;AACvB,MAAM,cAAc;AACpB,MAAM,kBAAkB;AAAA,EACtB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,MAAM,aAAa,CAAC,UAAU,QAAQ,cAAc;AACpD,MAAM,kBAAkB;AAAA,EACtB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,MAAM,aAAa;AAAA,EACjB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,MAAM,aAAa;AAAA,EACjB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,MAAM,gBAAgB;AAAA,EACpB;AAAA,EAAc;AAAA,EAAY;AAAA,EAAU;AAAA,EAAW;AAAA,EAC/C;AAAA,EAAgB;AAClB;AACA,MAAM,YAAY,CAAC,YAAY,UAAU,UAAU;AACnD,MAAM,cAAc,CAAC,cAAc,aAAa;AAChD,MAAM,aAAa,CAAC,OAAO,UAAU,aAAa,cAAc;AAChE,SAAS,OAAO,OAAe,QAAsB;AACnD,MAAI,UAAU;AACZ,UAAM,IAAI,MAAM,4BAA4B,MAAM,YAAY,KAAK,IAAI;AAC3E;AACA,SAAS,OAAO,OAAgB,UAA0B;AACxD,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK;AACrD,UAAM,IAAI;AAAA,MACR,qBAAqB,QAAQ;AAAA,IAC/B;AACF,SAAO;AACT;AACA,SAAS,OACP,SACA,QACA,OACA,UACM;AACN,MAAI,UAAU,QAAW;AACvB,YAAQ,MAAM,IAAI;AAClB,YAAQ,SAAS,CAAC,IAAI;AACtB;AAAA,EACF;AACA,MAAI,UAAU,QAAQ;AACpB,YAAQ,MAAM,IAAI;AAClB,YAAQ,SAAS,CAAC,IAAI;AACtB;AAAA,EACF;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,YAAQ,MAAM,IAAI,OAAO,OAAO,QAAQ;AACxC,YAAQ,SAAS,CAAC,IAAI;AACtB;AAAA,EACF;AACA,MAAI,OAAO,UAAU,YAAY,wBAAwB,KAAK,KAAK,GAAG;AACpE,YAAQ,MAAM,IAAI,OAAO,WAAW,KAAK;AACzC,YAAQ,SAAS,CAAC,IAAI;AACtB;AAAA,EACF;AACA,QAAM,IAAI;AAAA,IACR,qBAAqB,QAAQ;AAAA,EAC/B;AACF;AACA,SAAS,QACP,SACA,QACA,OACA,UACA,UACM;AACN,UAAQ,MAAM,IAAI,UAAU,SAAY,WAAW,OAAO,OAAO,QAAQ;AAC3E;AACA,SAAS,aACP,OACA,UACA,UACQ;AACR,SAAO,UAAU,SAAY,WAAW,OAAO,OAAO,QAAQ;AAChE;AACA,SAAS,SACP,OACA,QACA,UACA,UACQ;AACR,MAAI,UAAU,OAAW,QAAO;AAChC,QAAM,QAAQ,OAAO,QAAQ,KAAe;AAC5C,MAAI,QAAQ;AACV,UAAM,IAAI;AAAA,MACR,qBAAqB,QAAQ;AAAA,IAC/B;AACF,SAAO;AACT;AACA,SAAS,KACP,OACA,MACA,UACS;AACT,QAAM,QAAQ,MAAM,QAAQ;AAC5B,MACE,UAAU,UACV,OAAO,UAAU,YACjB,OAAO,UAAU;AAEjB,WAAO;AACT,MAAI,UAAU,QAAQ,OAAO,UAAU;AACrC,WAAQ,MAAkC,IAAI;AAChD,QAAM,IAAI;AAAA,IACR,qBAAqB,QAAQ;AAAA,EAC/B;AACF;AAEA,MAAM,6BAA+D;AAAA,EACnE;AAAA,EACA,UAAU;AAAA,EACV,cAAc;AAAA,EACd,cAAc;AACZ,SAAK,UAAU,IAAI,YAAY,SAAS,kBAAkB,CAAC,EACxD;AACH,SAAK,UAAU,KAAK,OAAO,uBAAuB;AAClD,SAAK,cAAc,KAAK,UACpB,KAAK,OAAO,2BAA2B,KAAK,OAAO,IACnD;AACJ,QAAI,CAAC,KAAK,WAAW,CAAC,KAAK;AACzB,YAAM,IAAI,MAAM,2CAA2C;AAAA,EAC/D;AAAA,EACA,IAAI,SAAiB;AACnB,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,iDAAiD;AACnE,WAAO,KAAK;AAAA,EACd;AAAA,EACA,UACE,OACsC;AACtC,QACE,CAAC,OAAO,SAAS,MAAM,KAAK,KAC5B,MAAM,QAAQ,KACd,CAAC,OAAO,SAAS,MAAM,MAAM,KAC7B,MAAM,SAAS;AAEf,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AACF,UAAM,QAAQ,MAAM;AACpB,UAAM,cAAc,oBAAI,IAAoB;AAC5C,aAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;AACjD,YAAM,KAAK,MAAM,KAAK,EAAG;AACzB,UAAI,CAAC,OAAO,UAAU,EAAE,KAAK,KAAK,KAAK,YAAY,IAAI,EAAE;AACvD,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AACF,kBAAY,IAAI,IAAI,KAAK;AAAA,IAC3B;AACA,UAAM,YAAY,YAAY,IAAI,MAAM,IAAI;AAC5C,QAAI,cAAc;AAChB,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AACF,UAAM,WAAqB,CAAC;AAC5B,UAAM,UAAU,KAAK,OAAO;AAAA,MAC1B,KAAK;AAAA,MACL,KAAK;AAAA,MACL,MAAM;AAAA,IACR;AACA,QAAI,CAAC,WAAW,MAAM;AACpB,YAAM,IAAI,MAAM,mDAAmD;AACrE,UAAM,UAAU,IAAI;AAAA,MAClB,KAAK,OAAO,OAAO;AAAA,MACnB;AAAA,MACA,MAAM,SAAS;AAAA,IACjB;AACA,aAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;AACjD,YAAM,OAAO,MAAM,KAAK;AACxB,YAAM,SAAS,QAAQ;AACvB,YAAM,QAAQ,KAAK;AACnB,YAAM,cACJ,KAAK,WAAW,SAAY,KAAK,YAAY,IAAI,KAAK,MAAM;AAC9D,UAAI,gBAAgB;AAClB,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AACF,YAAM,SAAS,cAAc,IAAI,SAAY,MAAM,WAAW;AAC9D,YAAM,2BACJ,MAAM,wBAAwB,UAC9B,MAAM,qBAAqB,UAC3B,MAAM,oBAAoB,UAC1B,MAAM,iBAAiB,UACvB,MAAM,iBAAiB;AACzB,YAAM,sBACJ,MAAM,oBAAoB,UAC1B,MAAM,mBAAmB,UACzB,MAAM,iBAAiB,UACvB,MAAM,gBAAgB;AACxB,YAAM,2BACJ,MAAM,kBAAkB,UACxB,MAAM,aAAa,UACnB,MAAM,mBAAmB,UACzB,MAAM,iBAAiB;AACzB,YAAM,sBACJ,MAAM,cAAc,UACpB,MAAM,aAAa,UACnB,MAAM,eAAe;AACvB,UAAI,MAAM,WAAW,UAAU;AAC7B,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AACF,UAAI,MAAM,WAAW,UAAU;AAC7B,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AACF,UAAI,WAAW,UAAa,MAAM,WAAW,UAAU;AACrD,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AACF,UAAI,QAAQ,MAAM,WAAW,UAAU;AACrC,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AACF,UAAI,QAAQ,MAAM,WAAW,UAAU;AACrC,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AACF,UAAI,MAAM,aAAa,UAAa,MAAM,aAAa;AACrD,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AACF,UAAI,MAAM,eAAe,cAAc,MAAM,eAAe,oBAAoB,MAAM,eAAe,mBACjG,MAAM,cAAc,cAAc,MAAM,cAAc,oBAAoB,MAAM,cAAc;AAChG,cAAM,IAAI,UAAU,kFAAkF;AACxG,cAAQ,MAAM,IAAI;AAClB,cAAQ,SAAS,CAAC,IAAI;AACtB,cAAQ,SAAS,CAAC,IAAI,SAAS;AAC/B,cAAQ,SAAS,CAAC,IAAI,KAAK,SAAS;AACpC,iBAAW,SAAS,KAAK,UAAU;AACjC,cAAM,aAAa,YAAY,IAAI,KAAK;AACxC,YAAI,eAAe;AACjB,gBAAM,IAAI;AAAA,YACR;AAAA,UACF;AACF,iBAAS,KAAK,UAAU;AAAA,MAC1B;AACA,aAAO,SAAS,SAAS,GAAG,MAAM,OAAO,OAAO;AAChD,aAAO,SAAS,SAAS,GAAG,MAAM,QAAQ,QAAQ;AAClD,aAAO,SAAS,SAAS,GAAG,MAAM,UAAU,UAAU;AACtD,aAAO,SAAS,SAAS,IAAI,MAAM,WAAW,WAAW;AACzD,aAAO,SAAS,SAAS,IAAI,MAAM,UAAU,UAAU;AACvD,aAAO,SAAS,SAAS,IAAI,MAAM,WAAW,WAAW;AACzD,aAAO,SAAS,SAAS,IAAI,MAAM,WAAW,WAAW;AACzD,cAAQ,SAAS,SAAS,IAAI,MAAM,UAAU,GAAG,UAAU;AAC3D,cAAQ,SAAS,SAAS,IAAI,MAAM,YAAY,GAAG,YAAY;AAC/D,cAAQ,SAAS,SAAS,IAAI,MAAM,KAAK,GAAG,KAAK;AACjD,cAAQ,SAAS,SAAS,IAAI,MAAM,QAAQ,IAAI,QAAQ;AACxD,cAAQ,SAAS,SAAS,IAAI,MAAM,WAAW,IAAI,WAAW;AAC9D,cAAQ,SAAS,EAAE,IAAI;AAAA,QACrB,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,cAAQ,SAAS,EAAE,IAAI;AAAA,QACrB,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,cAAQ,SAAS,EAAE,IAAI;AAAA,QACrB,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,cAAQ,SAAS,EAAE,IAAI;AAAA,QACrB,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,cAAQ,SAAS,EAAE,IAAI;AAAA,QACrB,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,cAAQ,SAAS,EAAE,IAAI,SAAS,MAAM,cAAc,eAAe,GAAG,cAAc;AACpF,cAAQ,SAAS,EAAE,IAAI,SAAS,MAAM,UAAU,WAAW,GAAG,UAAU;AACxE,cAAQ,SAAS,EAAE,IAAI,SAAS,MAAM,WAAW,aAAa,GAAG,WAAW;AAC5E,cAAQ,SAAS,SAAS,IAAI,MAAM,aAAa,GAAG,aAAa;AACjE,UAAI,QAAQ,SAAS,EAAE,IAAI,KAAM,QAAQ,SAAS,EAAE,MAAM,KAAK,QAAQ,SAAS,EAAE,KAAK;AACrF,cAAM,IAAI,UAAU,iDAAiD;AACvE,aAAO,SAAS,SAAS,IAAI,MAAM,MAAM,MAAM;AAC/C,aAAO,SAAS,SAAS,IAAI,MAAM,OAAO,OAAO;AACjD,aAAO,SAAS,SAAS,IAAI,MAAM,KAAK,KAAK;AAC7C,aAAO,SAAS,SAAS,IAAI,MAAM,QAAQ,QAAQ;AACnD,YAAM,aAAa,KAAK,OAAO,QAAQ,aAAa,KAAK;AACzD,YAAM,cAAc,KAAK,OAAO,SAAS,aAAa,KAAK;AAC3D,YAAM,YAAY,KAAK,OAAO,OAAO,aAAa,KAAK;AACvD,YAAM,eAAe,KAAK,OAAO,UAAU,aAAa,KAAK;AAC7D,cAAQ,SAAS,EAAE,IAAI,OAAO,YAAY,kBAAkB;AAC5D,cAAQ,SAAS,EAAE,IAAI,OAAO,aAAa,mBAAmB;AAC9D,cAAQ,SAAS,EAAE,IAAI,OAAO,WAAW,iBAAiB;AAC1D,cAAQ,SAAS,EAAE,IAAI,OAAO,cAAc,oBAAoB;AAChE,UAAI,QAAQ,SAAS,EAAE,IAAI,KAAK,QAAQ,SAAS,EAAE,IAAI,KAAK,QAAQ,SAAS,EAAE,IAAI,KAAK,QAAQ,SAAS,EAAE,IAAI;AAC7G,cAAM,IAAI,UAAU,oDAAoD;AAC1E;AAAA,QACE;AAAA,QACA,SAAS;AAAA,QACT,MAAM,cAAc,MAAM;AAAA,QAC1B;AAAA,MACF;AACA;AAAA,QACE;AAAA,QACA,SAAS;AAAA,QACT,MAAM,eAAe,MAAM;AAAA,QAC3B;AAAA,MACF;AACA;AAAA,QACE;AAAA,QACA,SAAS;AAAA,QACT,MAAM,aAAa,MAAM;AAAA,QACzB;AAAA,MACF;AACA;AAAA,QACE;AAAA,QACA,SAAS;AAAA,QACT,MAAM,gBAAgB,MAAM;AAAA,QAC5B;AAAA,MACF;AACA;AAAA,QACE;AAAA,QACA,SAAS;AAAA,QACT,KAAK,OAAO,QAAQ,SAAS,KAAK;AAAA,QAClC;AAAA,MACF;AACA;AAAA,QACE;AAAA,QACA,SAAS;AAAA,QACT,KAAK,OAAO,SAAS,SAAS,KAAK;AAAA,QACnC;AAAA,MACF;AACA;AAAA,QACE;AAAA,QACA,SAAS;AAAA,QACT,KAAK,OAAO,OAAO,SAAS,KAAK;AAAA,QACjC;AAAA,MACF;AACA;AAAA,QACE;AAAA,QACA,SAAS;AAAA,QACT,KAAK,OAAO,UAAU,SAAS,KAAK;AAAA,QACpC;AAAA,MACF;AACA,UACG,QAAQ,SAAS,EAAE,MAAM,gBACxB,QAAQ,SAAS,EAAE,MAAM,kBAC1B,QAAQ,SAAS,EAAE,MAAM,gBACxB,QAAQ,SAAS,EAAE,MAAM,kBAC1B,QAAQ,SAAS,EAAE,MAAM,gBACxB,QAAQ,SAAS,EAAE,MAAM,kBAC1B,QAAQ,SAAS,EAAE,MAAM,gBACxB,QAAQ,SAAS,EAAE,MAAM;AAE3B,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AACF,cAAQ,SAAS,EAAE,IAAI,KAAK,UAAU,IAAI;AAC1C,cAAQ,SAAS,EAAE,IAAI,KAAK,mBAAmB,IAAI;AACnD,cAAQ,SAAS,EAAE,IAAI;AAAA,QACrB,MAAM;AAAA,QACN;AAAA,QACA;AAAA,MACF;AACA,cAAQ,SAAS,EAAE,IAAI;AAAA,QACrB,MAAM;AAAA,QACN;AAAA,QACA;AAAA,MACF;AACA,cAAQ,SAAS,EAAE,IAAI;AAAA,QACrB,MAAM;AAAA,QACN;AAAA,QACA;AAAA,MACF;AACA,cAAQ,SAAS,EAAE,IAAI,aAAa,MAAM,aAAa,GAAG,aAAa;AAAA,IACzE;AACA,UAAM,OAAiB,CAAC;AAUxB,UAAM,UAAU,CACd,OACA,aAC8B;AAC9B,UAAI,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,KAAK,SAAS;AAClE,eAAO,CAAC,GAAG,KAAK;AAClB,UAAI,OAAO,UAAU,YAAY,sBAAsB,KAAK,KAAK;AAC/D,eAAO,CAAC,GAAG,OAAO,WAAW,KAAK,CAAC;AACrC,UACE,OAAO,UAAU,YACjB,uBAAuB,KAAK,KAAK,KACjC,OAAO,WAAW,KAAK,KAAK;AAE5B,eAAO,CAAC,GAAG,OAAO,WAAW,KAAK,CAAC;AACrC,UAAI,UAAU,cAAe,QAAO,CAAC,GAAG,CAAC;AACzC,UAAI,UAAU,cAAe,QAAO,CAAC,GAAG,CAAC;AACzC,UAAI,UAAU,OAAQ,QAAO,CAAC,GAAG,CAAC;AAClC,YAAM,IAAI;AAAA,QACR,mBAAmB,QAAQ;AAAA,MAC7B;AAAA,IACF;AACA,UAAM,QAAQ,CAAC,OAAgB,aAAkC;AAC/D,UACE,UAAU,QACV,OAAO,UAAU,YAChB,MAA6B,SAAS,UACvC;AACA,cAAM,MAAM;AAAA,UACT,MAA4B;AAAA,UAC7B,GAAG,QAAQ;AAAA,QACb;AACA,cAAM,MAAM;AAAA,UACT,MAA4B;AAAA,UAC7B,GAAG,QAAQ;AAAA,QACb;AACA,eAAO,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC;AAAA,MACjD;AACA,UACE,UAAU,QACV,OAAO,UAAU,YAChB,MAA6B,SAAS,eACvC;AACA,cAAM,QAAQ;AAAA,UACX,MAA8B;AAAA,UAC/B,GAAG,QAAQ;AAAA,QACb;AACA,YAAI,MAAM,CAAC,IAAI;AACb,gBAAM,IAAI;AAAA,YACR,mBAAmB,QAAQ;AAAA,UAC7B;AACF,eAAO,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACzD;AACA,YAAM,QAAQ,QAAQ,OAAO,QAAQ;AACrC,aAAO,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,GAAG,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;AAAA,IAClD;AACA,UAAM,SAAS,CACb,OACA,UACA,QACA,aAAa,UACJ;AACT,UACE,UAAU,QACV,OAAO,UAAU,YAChB,MAA6B,SAAS,UACvC;AACA,cAAM,SAAS;AACf,YAAI,CAAC,MAAM,QAAQ,OAAO,MAAM,KAAK,CAAC,OAAO,OAAO;AAClD,gBAAM,IAAI;AAAA,YACR,mBAAmB,QAAQ;AAAA,UAC7B;AACF,YAAI,OAAO,UAAU,eAAe,OAAO,UAAU,YAAY;AAC/D,cAAI;AACF,kBAAM,IAAI;AAAA,cACR,mBAAmB,QAAQ;AAAA,YAC7B;AACF,gBAAM,UAAyB,CAAC;AAChC,qBAAW,UAAU,OAAO;AAC1B,mBAAO,QAAQ,GAAG,QAAQ,WAAW,SAAS,IAAI;AAEpD,iBAAO,KAAK;AAAA,YACV;AAAA,YACA,OAAO,UAAU,cAAc,IAAI;AAAA,YACnC,QAAQ;AAAA,YACR;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF,CAAC;AACD,qBAAW,UAAU,QAAS,QAAO,KAAK,MAAM;AAChD;AAAA,QACF;AACA,YAAI,CAAC,OAAO,UAAU,OAAO,KAAK,KAAM,OAAO,QAAmB;AAChE,gBAAM,IAAI;AAAA,YACR,mBAAmB,QAAQ;AAAA,UAC7B;AACF,iBAASA,SAAQ,GAAGA,SAAS,OAAO,OAAkBA;AACpD,qBAAW,UAAU,OAAO;AAC1B,mBAAO,QAAQ,GAAG,QAAQ,WAAW,QAAQ,UAAU;AAC3D;AAAA,MACF;AACA,aAAO,KAAK,MAAM,OAAO,QAAQ,CAAC;AAAA,IACpC;AACA,aAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;AACjD,YAAM,QAAQ,MAAM,KAAK,EAAG;AAC5B,UAAI,MAAM,WAAW,OAAQ;AAC7B,YAAM,UAAU,MAAM;AACtB,YAAM,OAAO,MAAM;AACnB,UACE,CAAC,MAAM,QAAQ,OAAO,KACtB,CAAC,MAAM,QAAQ,IAAI,KACnB,CAAC,QAAQ,UACT,CAAC,KAAK;AAEN,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AACF,YAAM,gBAA+B,CAAC;AACtC,YAAM,aAA4B,CAAC;AACnC,iBAAW,SAAS;AAClB,eAAO,OAAO,uBAAuB,aAAa;AACpD,iBAAW,SAAS,KAAM,QAAO,OAAO,oBAAoB,UAAU;AACtE,YAAM,OAAO,SAAS,MAAM,cAAc,YAAY,GAAG,cAAc;AACvE,YAAM,aACJ,MAAM,oBAAoB,SACtB,SACA,MAAM,MAAM,iBAAiB,iBAAiB;AACpD,YAAM,UACJ,MAAM,iBAAiB,SACnB,SACA,MAAM,MAAM,cAAc,cAAc;AAE9C,WAAK;AAAA,QACH;AAAA,QACA,cAAc;AAAA,QACd,WAAW;AAAA,QACX,aAAa,MAAM,aAAa,MAAM,KAAK,GAAG,WAAW;AAAA,QACzD,aAAa,MAAM,UAAU,MAAM,KAAK,GAAG,QAAQ;AAAA,QACnD;AAAA,QACA,aAAa,IAAI;AAAA,QACjB,UAAU,IAAI;AAAA,QACd,GAAI,cAAc,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,QACtC,GAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACrC;AACA,iBAAW,SAAS,cAAe,MAAK,KAAK,GAAG,KAAK;AACrD,iBAAW,SAAS,WAAY,MAAK,KAAK,GAAG,KAAK;AAAA,IACpD;AACA,UAAM,cAAc,KAAK,OAAO;AAAA,MAC9B,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,QAAI,CAAC,eAAe,KAAK;AACvB,YAAM,IAAI,MAAM,mDAAmD;AACrE,QAAI,aAAa,KAAK,OAAO,OAAO,QAAQ,aAAa,KAAK,MAAM,EAAE;AAAA,MACpE;AAAA,IACF;AACA,UAAM,eAAe,KAAK,OAAO;AAAA,MAC/B,KAAK;AAAA,MACL,KAAK;AAAA,MACL,SAAS;AAAA,IACX;AACA,QAAI,CAAC,gBAAgB,SAAS;AAC5B,YAAM,IAAI,MAAM,oDAAoD;AACtE,QAAI;AAAA,MACF,KAAK,OAAO,OAAO;AAAA,MACnB;AAAA,MACA,SAAS;AAAA,IACX,EAAE,IAAI,QAAQ;AACd;AAAA,MACE,KAAK,OAAO;AAAA,QACV,KAAK;AAAA,QACL,KAAK;AAAA,QACL;AAAA,QACA,MAAM,cAAc,QAAQ,IAAI;AAAA,MAClC;AAAA,MACA;AAAA,IACF;AACA;AAAA,MACE,KAAK,OAAO;AAAA,QACV,KAAK;AAAA,QACL,KAAK;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MACA;AAAA,IACF;AACA,UAAM,QAAQ,KAAK,OAAO;AAAA,MACxB,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,UAAM,qBAAqB,KAAK,OAAO;AAAA,MACrC,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,IACF;AACA,QAAI,CAAC,sBAAsB;AACzB,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AACF,UAAM,eAAe,IAAI;AAAA,MACvB,KAAK,OAAO,OAAO;AAAA,MACnB;AAAA,MACA,QAAQ;AAAA,IACV;AACA,aAAS,QAAQ,GAAG,QAAQ,OAAO,SAAS;AAC1C,YAAM,WAAW,KAAK,OAAO;AAAA,QAC3B,KAAK;AAAA,QACL,KAAK;AAAA,QACL;AAAA,MACF;AACA,YAAM,OAAO,MAAM,QAAQ;AAC3B,YAAM,OAAO,KAAK,OAAO;AAAA,QACvB,KAAK;AAAA,QACL,KAAK;AAAA,QACL;AAAA,MACF;AACA,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAIF,YAAM,SAAS,QAAQ;AACvB,mBAAa,MAAM,IAAI;AACvB,UAAI,SAAS,GAAG;AACd,YAAI,CAAC,KAAK;AACR,gBAAM,IAAI;AAAA,YACR;AAAA,UACF;AACF,cAAM,SAAS,KAAK,QAAQ;AAAA,UAC1B,OAAO;AAAA,YACL,SAAS,KAAK,OAAO;AAAA,cACnB,KAAK;AAAA,cACL,KAAK;AAAA,cACL;AAAA,YACF;AAAA,YACA,SAAS,KAAK,OAAO;AAAA,cACnB,KAAK;AAAA,cACL,KAAK;AAAA,cACL;AAAA,YACF;AAAA,UACF;AAAA,UACA,QAAQ;AAAA,YACN,SAAS,KAAK,OAAO;AAAA,cACnB,KAAK;AAAA,cACL,KAAK;AAAA,cACL;AAAA,YACF;AAAA,YACA,SAAS,KAAK,OAAO;AAAA,cACnB,KAAK;AAAA,cACL,KAAK;AAAA,cACL;AAAA,YACF;AAAA,UACF;AAAA,QACF,CAAC;AACD,qBAAa,SAAS,CAAC,IAAI,OAAO,OAAO,OAAO,mBAAmB;AACnE,qBAAa,SAAS,CAAC,IAAI,OAAO,OAAO,QAAQ,oBAAoB;AAAA,MACvE,WAAW,SAAS,GAAG;AACrB,YAAI,CAAC,KAAK;AACR,gBAAM,IAAI;AAAA,YACR;AAAA,UACF;AACF,cAAM,SAAS,KAAK,iBAAiB;AACrC,qBAAa,SAAS,CAAC,IAAI;AAAA,UACzB,OAAO;AAAA,UACP;AAAA,QACF;AACA,qBAAa,SAAS,CAAC,IAAI;AAAA,UACzB,OAAO;AAAA,UACP;AAAA,QACF;AACA,qBAAa,SAAS,CAAC,IAAI;AAAA,UACzB,OAAO;AAAA,UACP;AAAA,QACF;AACA,qBAAa,SAAS,CAAC,IAAI;AAAA,UACzB,OAAO;AAAA,UACP;AAAA,QACF;AACA,YACE,aAAa,SAAS,CAAC,IAAI,aAAa,SAAS,CAAC,KAClD,aAAa,SAAS,CAAC,IAAI,aAAa,SAAS,CAAC;AAElD,gBAAM,IAAI;AAAA,YACR;AAAA,UACF;AAAA,MACJ;AACE,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,IACJ;AACA;AAAA,MACE,KAAK,OAAO;AAAA,QACV,KAAK;AAAA,QACL,KAAK;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAIA,QAAI,UAAU;AACd,aAAS,QAAQ,GAAG,SAAS,MAAM,QAAQ,SAAS;AACpD;AAAA,QACE,KAAK,OAAO;AAAA,UACV,KAAK;AAAA,UACL,KAAK;AAAA,QACP;AAAA,QACA;AAAA,MACF;AACA,YAAM,eAAe,KAAK,OAAO;AAAA,QAC/B,KAAK;AAAA,QACL,KAAK;AAAA,MACP;AACA,UAAI,CAAC,cAAc;AAAE,kBAAU;AAAM;AAAA,MAAO;AAC5C;AACE,cAAM,iBAAiB,KAAK,OAAO,oCAAoC,KAAK,SAAS,KAAK,aAAa,YAAY;AACnH,YAAI,CAAC,eAAgB,OAAM,IAAI,MAAM,kEAAkE;AACvG,cAAMC,WAAU,IAAI,aAAa,KAAK,OAAO,OAAO,QAAQ,gBAAgB,eAAe,kBAAkB;AAC7G,iBAAS,QAAQ,GAAG,QAAQ,cAAc,SAAS;AACjD,gBAAM,WAAW,KAAK,OAAO,6BAA6B,KAAK,SAAS,KAAK,aAAa,KAAK;AAC/F,gBAAM,OAAO,MAAM,QAAQ;AAAG,gBAAM,OAAO,KAAK,OAAO,6BAA6B,KAAK,SAAS,KAAK,aAAa,KAAK;AACzH,cAAI,CAAC,KAAM,OAAM,IAAI,MAAM,uEAAuE;AAClG,gBAAM,SAAS,QAAQ;AAAoB,UAAAA,SAAQ,MAAM,IAAI;AAC7D,cAAI,SAAS,GAAG;AACd,gBAAI,CAAC,KAAK,QAAS,OAAM,IAAI,MAAM,gFAAgF;AACnH,kBAAM,SAAS,KAAK,QAAQ,EAAE,OAAO,EAAE,SAAS,KAAK,OAAO,kCAAkC,KAAK,SAAS,KAAK,aAAa,KAAK,GAAG,SAAS,KAAK,OAAO,kCAAkC,KAAK,SAAS,KAAK,aAAa,KAAK,EAAE,GAAG,QAAQ,EAAE,SAAS,KAAK,OAAO,mCAAmC,KAAK,SAAS,KAAK,aAAa,KAAK,GAAG,SAAS,KAAK,OAAO,mCAAmC,KAAK,SAAS,KAAK,aAAa,KAAK,EAAE,EAAE,CAAC;AACnb,YAAAA,SAAQ,SAAS,CAAC,IAAI,OAAO,OAAO,OAAO,2BAA2B;AAAG,YAAAA,SAAQ,SAAS,CAAC,IAAI,OAAO,OAAO,QAAQ,4BAA4B;AAAA,UACnJ,WAAW,SAAS,GAAG;AACrB,gBAAI,CAAC,KAAK,iBAAkB,OAAM,IAAI,MAAM,0FAA0F;AACtI,kBAAM,SAAS,KAAK,iBAAiB;AAAG,YAAAA,SAAQ,SAAS,CAAC,IAAI,OAAO,OAAO,UAAU,iCAAiC;AAAG,YAAAA,SAAQ,SAAS,CAAC,IAAI,OAAO,OAAO,UAAU,iCAAiC;AAAG,YAAAA,SAAQ,SAAS,CAAC,IAAI,OAAO,OAAO,WAAW,kCAAkC;AAAG,YAAAA,SAAQ,SAAS,CAAC,IAAI,OAAO,OAAO,WAAW,kCAAkC;AACjX,gBAAIA,SAAQ,SAAS,CAAC,IAAIA,SAAQ,SAAS,CAAC,KAAKA,SAAQ,SAAS,CAAC,IAAIA,SAAQ,SAAS,CAAC,EAAG,OAAM,IAAI,WAAW,6EAA6E;AAAA,UAChM,MAAO,OAAM,IAAI,MAAM,uEAAuE;AAAA,QAChG;AACA,eAAO,KAAK,OAAO,sBAAsB,KAAK,SAAS,KAAK,aAAa,MAAM,OAAO,MAAM,MAAM,GAAG,eAAe;AAAA,MACtH;AAAA,IACA;AACA,QAAI,CAAC;AACH,YAAM,IAAI,MAAM,6EAA6E,MAAM,SAAS,CAAC,4BAA4B;AAC3I,UAAM,WAAW,KAAK,OAAO;AAAA,MAC3B,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,QAAI,aAAa,MAAM;AACrB,YAAM,IAAI,MAAM,wDAAwD;AAC1E,UAAM,QAAqC,CAAC;AAC5C,aAAS,QAAQ,GAAG,QAAQ,UAAU,SAAS;AAC7C,YAAM,WAAW,KAAK,OAAO;AAAA,QAC3B,KAAK;AAAA,QACL,KAAK;AAAA,QACL;AAAA,MACF;AACA,YAAM,SAAS,MAAM,QAAQ;AAC7B,UAAI,CAAC;AACH,cAAM,IAAI,MAAM,qDAAqD;AACvE,YAAM,MAAM;AAAA,QACV,IAAI,OAAO;AAAA,QACX,GAAG,KAAK,OAAO;AAAA,UACb,KAAK;AAAA,UACL,KAAK;AAAA,UACL;AAAA,QACF;AAAA,QACA,GAAG,KAAK,OAAO;AAAA,UACb,KAAK;AAAA,UACL,KAAK;AAAA,UACL;AAAA,QACF;AAAA,QACA,OAAO,KAAK,OAAO;AAAA,UACjB,KAAK;AAAA,UACL,KAAK;AAAA,UACL;AAAA,QACF;AAAA,QACA,QAAQ,KAAK,OAAO;AAAA,UAClB,KAAK;AAAA,UACL,KAAK;AAAA,UACL;AAAA,QACF;AAAA,MACF;AACA,YAAM,KAAK,GAAG;AAAA,IAChB;AACA,WAAO,OAAO;AAAA,MACZ,MAAM,IAAI,CAAC,QAAQ,OAAO,OAAO,GAAG,CAAC;AAAA,IACvC;AAAA,EACF;AAAA,EACA,UAAgB;AACd,UAAM,SAAS,KAAK;AACpB,QAAI,CAAC,OAAQ;AACb,SAAK,UAAU;AACf,QAAI;AACF,UACE,KAAK,WACL,OAAO,wBAAwB,KAAK,SAAS,KAAK,WAAW,MAAM;AAEnE,cAAM,IAAI,MAAM,yCAAyC;AAAA,IAC7D,UAAE;AACA,WAAK,UAAU;AACf,WAAK,cAAc;AACnB,aAAO,QAAQ;AAAA,IACjB;AAAA,EACF;AACF;AAMO,SAAS,+BAAuD;AACrE,SAAO,IAAI,6BAA6B;AAC1C;",
+  "names": ["count", "settled"]
+}

package/dist/lib/layout/topology.d.ts

@@ -0,0 +1,21 @@
+import type { PibblInstance, PibblRenderTransaction } from '../types.js';
+/**
+ * Root-owned identity ledger for the subset of layout roots that can be
+ * prepared without evaluating an opaque component. It deliberately records
+ * topology only; allocation and geometry remain owned by the matching layout
+ * family until a later publication phase can adopt them atomically.
+ */
+export interface LayoutTopologySlot {
+    readonly topologyOwner: PibblInstance;
+}
+/** Stages one stable prepared-root relationship for commit with its render. */
+export declare function stageLayoutTopology(transaction: PibblRenderTransaction, slot: LayoutTopologySlot, parent: LayoutTopologySlot | undefined): void;
+/** Removes a disposed prepared root and commits the removal immediately. */
+export declare function releaseLayoutTopology(slot: LayoutTopologySlot): void;
+/** Internal diagnostics for focused lifecycle and topology tests. */
+export declare function snapshotLayoutTopology(owner?: PibblInstance): Readonly<{
+    roots: number;
+    records: number;
+    pending: number;
+    revision?: number;
+}>;

package/dist/lib/layout/topology.js

@@ -0,0 +1,113 @@
+const roots = /* @__PURE__ */ new WeakMap();
+const pending = /* @__PURE__ */ new WeakMap();
+const disposedSlots = /* @__PURE__ */ new WeakSet();
+let activeRoots = 0;
+let activeRecords = 0;
+let activePending = 0;
+function interactionRoot(owner) {
+  return owner.interactionRoot ?? owner;
+}
+function topologyFor(owner) {
+  const rootOwner = interactionRoot(owner);
+  let topology = roots.get(rootOwner);
+  if (topology) return topology;
+  const created = {
+    owner: rootOwner,
+    live: true,
+    revision: 0,
+    pending: 0,
+    records: /* @__PURE__ */ new Map(),
+    teardown: () => releaseRoot(rootOwner, created)
+  };
+  roots.set(rootOwner, created);
+  activeRoots++;
+  rootOwner.mainTeardowns.add(created.teardown);
+  return created;
+}
+function releaseRoot(owner, topology) {
+  if (roots.get(owner) !== topology) return;
+  topology.live = false;
+  activeRecords -= topology.records.size;
+  topology.records.clear();
+  roots.delete(owner);
+  activeRoots--;
+}
+function releaseEmptyRoot(topology) {
+  if (!topology.live || topology.records.size || topology.pending) return;
+  topology.owner.mainTeardowns.remove(topology.teardown);
+  releaseRoot(topology.owner, topology);
+}
+function stageLayoutTopology(transaction, slot, parent) {
+  if (disposedSlots.has(slot)) return;
+  const owner = interactionRoot(slot.topologyOwner);
+  let byRoot = pending.get(transaction);
+  if (!byRoot) {
+    byRoot = /* @__PURE__ */ new Map();
+    pending.set(transaction, byRoot);
+    const owned = byRoot;
+    transaction.onFinish((success) => {
+      if (success) {
+        for (const batch2 of owned.values()) commit(batch2);
+      }
+      for (const batch2 of owned.values()) {
+        batch2.root.pending -= batch2.changes.size;
+        activePending -= batch2.changes.size;
+        releaseEmptyRoot(batch2.root);
+      }
+      pending.delete(transaction);
+    });
+  }
+  let batch = byRoot.get(owner);
+  if (!batch) {
+    batch = { root: topologyFor(owner), changes: /* @__PURE__ */ new Map() };
+    byRoot.set(owner, batch);
+  }
+  if (!batch.changes.has(slot)) {
+    batch.root.pending++;
+    activePending++;
+  }
+  batch.changes.set(slot, { slot, parent });
+}
+function commit(batch) {
+  if (!batch.root.live) return;
+  let changed = false;
+  for (const change of batch.changes.values()) {
+    if (disposedSlots.has(change.slot)) continue;
+    const previous = batch.root.records.get(change.slot);
+    if (!previous) {
+      batch.root.records.set(change.slot, { parent: change.parent });
+      activeRecords++;
+      changed = true;
+    } else if (previous.parent !== change.parent) {
+      previous.parent = change.parent;
+      changed = true;
+    }
+  }
+  if (changed) batch.root.revision++;
+}
+function releaseLayoutTopology(slot) {
+  disposedSlots.add(slot);
+  const topology = roots.get(interactionRoot(slot.topologyOwner));
+  if (!topology || !topology.records.delete(slot)) return;
+  activeRecords--;
+  topology.revision++;
+  releaseEmptyRoot(topology);
+}
+function snapshotLayoutTopology(owner) {
+  if (owner) {
+    const topology = roots.get(interactionRoot(owner));
+    return Object.freeze({
+      roots: topology ? 1 : 0,
+      records: topology?.records.size ?? 0,
+      pending: topology?.pending ?? 0,
+      revision: topology?.revision ?? 0
+    });
+  }
+  return Object.freeze({ roots: activeRoots, records: activeRecords, pending: activePending });
+}
+export {
+  releaseLayoutTopology,
+  snapshotLayoutTopology,
+  stageLayoutTopology
+};
+//# sourceMappingURL=topology.js.map

package/dist/lib/layout/topology.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/lib/layout/topology.ts"],
+  "sourcesContent": ["import type { PibblInstance, PibblRenderTransaction } from '../types.js';\n\n/**\n * Root-owned identity ledger for the subset of layout roots that can be\n * prepared without evaluating an opaque component. It deliberately records\n * topology only; allocation and geometry remain owned by the matching layout\n * family until a later publication phase can adopt them atomically.\n */\nexport interface LayoutTopologySlot {\n  readonly topologyOwner: PibblInstance;\n}\n\ninterface TopologyRecord {\n  parent: LayoutTopologySlot | undefined;\n}\n\ninterface PendingTopologyChange {\n  readonly slot: LayoutTopologySlot;\n  readonly parent: LayoutTopologySlot | undefined;\n}\n\ninterface RootTopology {\n  readonly owner: PibblInstance;\n  live: boolean;\n  revision: number;\n  pending: number;\n  readonly records: Map<LayoutTopologySlot, TopologyRecord>;\n  readonly teardown: () => void;\n}\n\ninterface PendingTopologyBatch {\n  readonly root: RootTopology;\n  readonly changes: Map<LayoutTopologySlot, PendingTopologyChange>;\n}\n\nconst roots = new WeakMap<PibblInstance, RootTopology>();\nconst pending = new WeakMap<PibblRenderTransaction, Map<PibblInstance, PendingTopologyBatch>>();\nconst disposedSlots = new WeakSet<LayoutTopologySlot>();\nlet activeRoots = 0;\nlet activeRecords = 0;\nlet activePending = 0;\n\nfunction interactionRoot(owner: PibblInstance): PibblInstance {\n  return owner.interactionRoot ?? owner;\n}\n\nfunction topologyFor(owner: PibblInstance): RootTopology {\n  const rootOwner = interactionRoot(owner);\n  let topology = roots.get(rootOwner);\n  if (topology) return topology;\n  const created: RootTopology = {\n    owner: rootOwner,\n    live: true,\n    revision: 0,\n    pending: 0,\n    records: new Map(),\n    teardown: () => releaseRoot(rootOwner, created),\n  };\n  roots.set(rootOwner, created);\n  activeRoots++;\n  rootOwner.mainTeardowns.add(created.teardown);\n  return created;\n}\n\nfunction releaseRoot(owner: PibblInstance, topology: RootTopology): void {\n  if (roots.get(owner) !== topology) return;\n  topology.live = false;\n  activeRecords -= topology.records.size;\n  topology.records.clear();\n  roots.delete(owner);\n  activeRoots--;\n}\n\nfunction releaseEmptyRoot(topology: RootTopology): void {\n  if (!topology.live || topology.records.size || topology.pending) return;\n  topology.owner.mainTeardowns.remove(topology.teardown);\n  releaseRoot(topology.owner, topology);\n}\n\n/** Stages one stable prepared-root relationship for commit with its render. */\nexport function stageLayoutTopology(\n  transaction: PibblRenderTransaction,\n  slot: LayoutTopologySlot,\n  parent: LayoutTopologySlot | undefined,\n): void {\n  if (disposedSlots.has(slot)) return;\n  const owner = interactionRoot(slot.topologyOwner);\n  let byRoot = pending.get(transaction);\n  if (!byRoot) {\n    byRoot = new Map();\n    pending.set(transaction, byRoot);\n    const owned = byRoot;\n    transaction.onFinish(success => {\n      if (success) {\n        for (const batch of owned.values()) commit(batch);\n      }\n      for (const batch of owned.values()) {\n        batch.root.pending -= batch.changes.size;\n        activePending -= batch.changes.size;\n        releaseEmptyRoot(batch.root);\n      }\n      pending.delete(transaction);\n    });\n  }\n  let batch = byRoot.get(owner);\n  if (!batch) {\n    batch = { root: topologyFor(owner), changes: new Map() };\n    byRoot.set(owner, batch);\n  }\n  if (!batch.changes.has(slot)) { batch.root.pending++; activePending++; }\n  batch.changes.set(slot, { slot, parent });\n}\n\nfunction commit(batch: PendingTopologyBatch): void {\n  // A root may be disposed while a failed/aborted traversal still owns the\n  // transaction. Its later finish callback must not resurrect its records.\n  if (!batch.root.live) return;\n  let changed = false;\n  for (const change of batch.changes.values()) {\n    if (disposedSlots.has(change.slot)) continue;\n    const previous = batch.root.records.get(change.slot);\n    if (!previous) {\n      batch.root.records.set(change.slot, { parent: change.parent });\n      activeRecords++;\n      changed = true;\n    } else if (previous.parent !== change.parent) {\n      previous.parent = change.parent;\n      changed = true;\n    }\n  }\n  if (changed) batch.root.revision++;\n}\n\n/** Removes a disposed prepared root and commits the removal immediately. */\nexport function releaseLayoutTopology(slot: LayoutTopologySlot): void {\n  disposedSlots.add(slot);\n  const topology = roots.get(interactionRoot(slot.topologyOwner));\n  if (!topology || !topology.records.delete(slot)) return;\n  activeRecords--; topology.revision++;\n  releaseEmptyRoot(topology);\n}\n\n/** Internal diagnostics for focused lifecycle and topology tests. */\nexport function snapshotLayoutTopology(owner?: PibblInstance): Readonly<{ roots: number; records: number; pending: number; revision?: number }> {\n  if (owner) {\n    const topology = roots.get(interactionRoot(owner));\n    return Object.freeze({\n      roots: topology ? 1 : 0,\n      records: topology?.records.size ?? 0,\n      pending: topology?.pending ?? 0,\n      revision: topology?.revision ?? 0,\n    });\n  }\n  return Object.freeze({ roots: activeRoots, records: activeRecords, pending: activePending });\n}\n"],
+  "mappings": "AAmCA,MAAM,QAAQ,oBAAI,QAAqC;AACvD,MAAM,UAAU,oBAAI,QAA0E;AAC9F,MAAM,gBAAgB,oBAAI,QAA4B;AACtD,IAAI,cAAc;AAClB,IAAI,gBAAgB;AACpB,IAAI,gBAAgB;AAEpB,SAAS,gBAAgB,OAAqC;AAC5D,SAAO,MAAM,mBAAmB;AAClC;AAEA,SAAS,YAAY,OAAoC;AACvD,QAAM,YAAY,gBAAgB,KAAK;AACvC,MAAI,WAAW,MAAM,IAAI,SAAS;AAClC,MAAI,SAAU,QAAO;AACrB,QAAM,UAAwB;AAAA,IAC5B,OAAO;AAAA,IACP,MAAM;AAAA,IACN,UAAU;AAAA,IACV,SAAS;AAAA,IACT,SAAS,oBAAI,IAAI;AAAA,IACjB,UAAU,MAAM,YAAY,WAAW,OAAO;AAAA,EAChD;AACA,QAAM,IAAI,WAAW,OAAO;AAC5B;AACA,YAAU,cAAc,IAAI,QAAQ,QAAQ;AAC5C,SAAO;AACT;AAEA,SAAS,YAAY,OAAsB,UAA8B;AACvE,MAAI,MAAM,IAAI,KAAK,MAAM,SAAU;AACnC,WAAS,OAAO;AAChB,mBAAiB,SAAS,QAAQ;AAClC,WAAS,QAAQ,MAAM;AACvB,QAAM,OAAO,KAAK;AAClB;AACF;AAEA,SAAS,iBAAiB,UAA8B;AACtD,MAAI,CAAC,SAAS,QAAQ,SAAS,QAAQ,QAAQ,SAAS,QAAS;AACjE,WAAS,MAAM,cAAc,OAAO,SAAS,QAAQ;AACrD,cAAY,SAAS,OAAO,QAAQ;AACtC;AAGO,SAAS,oBACd,aACA,MACA,QACM;AACN,MAAI,cAAc,IAAI,IAAI,EAAG;AAC7B,QAAM,QAAQ,gBAAgB,KAAK,aAAa;AAChD,MAAI,SAAS,QAAQ,IAAI,WAAW;AACpC,MAAI,CAAC,QAAQ;AACX,aAAS,oBAAI,IAAI;AACjB,YAAQ,IAAI,aAAa,MAAM;AAC/B,UAAM,QAAQ;AACd,gBAAY,SAAS,aAAW;AAC9B,UAAI,SAAS;AACX,mBAAWA,UAAS,MAAM,OAAO,EAAG,QAAOA,MAAK;AAAA,MAClD;AACA,iBAAWA,UAAS,MAAM,OAAO,GAAG;AAClC,QAAAA,OAAM,KAAK,WAAWA,OAAM,QAAQ;AACpC,yBAAiBA,OAAM,QAAQ;AAC/B,yBAAiBA,OAAM,IAAI;AAAA,MAC7B;AACA,cAAQ,OAAO,WAAW;AAAA,IAC5B,CAAC;AAAA,EACH;AACA,MAAI,QAAQ,OAAO,IAAI,KAAK;AAC5B,MAAI,CAAC,OAAO;AACV,YAAQ,EAAE,MAAM,YAAY,KAAK,GAAG,SAAS,oBAAI,IAAI,EAAE;AACvD,WAAO,IAAI,OAAO,KAAK;AAAA,EACzB;AACA,MAAI,CAAC,MAAM,QAAQ,IAAI,IAAI,GAAG;AAAE,UAAM,KAAK;AAAW;AAAA,EAAiB;AACvE,QAAM,QAAQ,IAAI,MAAM,EAAE,MAAM,OAAO,CAAC;AAC1C;AAEA,SAAS,OAAO,OAAmC;AAGjD,MAAI,CAAC,MAAM,KAAK,KAAM;AACtB,MAAI,UAAU;AACd,aAAW,UAAU,MAAM,QAAQ,OAAO,GAAG;AAC3C,QAAI,cAAc,IAAI,OAAO,IAAI,EAAG;AACpC,UAAM,WAAW,MAAM,KAAK,QAAQ,IAAI,OAAO,IAAI;AACnD,QAAI,CAAC,UAAU;AACb,YAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,EAAE,QAAQ,OAAO,OAAO,CAAC;AAC7D;AACA,gBAAU;AAAA,IACZ,WAAW,SAAS,WAAW,OAAO,QAAQ;AAC5C,eAAS,SAAS,OAAO;AACzB,gBAAU;AAAA,IACZ;AAAA,EACF;AACA,MAAI,QAAS,OAAM,KAAK;AAC1B;AAGO,SAAS,sBAAsB,MAAgC;AACpE,gBAAc,IAAI,IAAI;AACtB,QAAM,WAAW,MAAM,IAAI,gBAAgB,KAAK,aAAa,CAAC;AAC9D,MAAI,CAAC,YAAY,CAAC,SAAS,QAAQ,OAAO,IAAI,EAAG;AACjD;AAAiB,WAAS;AAC1B,mBAAiB,QAAQ;AAC3B;AAGO,SAAS,uBAAuB,OAAyG;AAC9I,MAAI,OAAO;AACT,UAAM,WAAW,MAAM,IAAI,gBAAgB,KAAK,CAAC;AACjD,WAAO,OAAO,OAAO;AAAA,MACnB,OAAO,WAAW,IAAI;AAAA,MACtB,SAAS,UAAU,QAAQ,QAAQ;AAAA,MACnC,SAAS,UAAU,WAAW;AAAA,MAC9B,UAAU,UAAU,YAAY;AAAA,IAClC,CAAC;AAAA,EACH;AACA,SAAO,OAAO,OAAO,EAAE,OAAO,aAAa,SAAS,eAAe,SAAS,cAAc,CAAC;AAC7F;",
+  "names": ["batch"]
+}

package/dist/lib/layout/types.d.ts

@@ -21,6 +21,10 @@ export interface Size {
 /**
  * Available and limiting dimensions supplied to layout and measurement.
  *
+ * Equal minimum and maximum values require that exact logical content size.
+ * A positive-infinite maximum leaves that axis unbounded; all other values are
+ * finite logical sizes.
+ *
  * @see {@link measureElement}
  * @see {@link resolveBox}
  * @see {@link LayoutDiagnosticContext}
@@ -57,6 +61,7 @@ export interface LayoutBox extends Size {
 }
 /** @internal Temporary render-time allocation and containing-block basis. */
 export interface LayoutContext {
+    layoutDirection?: 'ltr' | 'rtl';
     allocation: Readonly<LayoutBox>;
     percentageBasis: Readonly<LayoutBox>;
 }

package/dist/lib/layout/wasm/artifact.d.ts

@@ -0,0 +1 @@
+export declare const layoutBinaryHash = "8c146d6562f761c241d4683f2db8efba74a915ce254a9924daff3a2dba39af4a";

package/dist/lib/layout/wasm/artifact.js

@@ -0,0 +1,5 @@
+const layoutBinaryHash = "8c146d6562f761c241d4683f2db8efba74a915ce254a9924daff3a2dba39af4a";
+export {
+  layoutBinaryHash
+};
+//# sourceMappingURL=artifact.js.map

package/dist/lib/layout/wasm/artifact.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/lib/layout/wasm/artifact.ts"],
+  "sourcesContent": ["// Generated by tooling/build-layout-wasm.mjs; do not edit.\nexport const layoutBinaryHash = \"8c146d6562f761c241d4683f2db8efba74a915ce254a9924daff3a2dba39af4a\";\n"],
+  "mappings": "AACO,MAAM,mBAAmB;",
+  "names": []
+}