@gyral/core 0.1.0 → 0.3.0

package/dist/view/render/list.js

@@ -0,0 +1,156 @@
+// Lists in child holes: `each` (view/03-lists.md "Reconciliation", "Fast paths") and
+// positional arrays (view/02-bindings.md "Child values"). Rows are child parts tracked by their
+// node range, with no markers. Fast paths: create into empty (one fragment), clear
+// (replaceChildren when the list is its parent's only content), the common prefix and suffix,
+// insert-only (append, prepend, insert) and remove-only. What remains is reordered by
+// reorder.ts. Rows commit in document order. `each` is here: its result carries `commitList`,
+// so the keyed path (this, rows.ts, reorder.ts, place.ts) is bundled only by apps that call it.
+import { DEV } from '#view-dev';
+import { ChildPart, EMPTY, ITEMS, LIST } from './child-part.js';
+import { checkKeys, recheckRows } from './dev-check.js';
+import { reorder } from './reorder.js';
+import { firstFrom, List, newRow, updateRow } from './rows.js';
+import { EACH } from './values.js';
+export { List } from './rows.js';
+function listOf(part, kind) {
+    if (part.kind === kind)
+        return part.content;
+    if (part.kind !== EMPTY)
+        part.clear();
+    const list = new List(part);
+    part.kind = kind;
+    part.content = list;
+    return list;
+}
+/** Removes every row; the list's part keeps its (now empty) list. */
+export function clearList(part, list) {
+    if (part.sole && part.parentNode !== null)
+        part.parentNode.replaceChildren();
+    else
+        for (const row of list.rows)
+            row.clear();
+    list.rows = [];
+}
+/**
+ * Creates rows for `l.items[from…to]` (keys from `keys[i - from]` when given) into one
+ * fragment, pushes them onto `rows` and inserts the fragment before `end`.
+ */
+export function createRows(part, list, l, rows, from, to, end, keys) {
+    const frag = document.createDocumentFragment();
+    list.building = frag;
+    try {
+        for (let i = from; i <= to; i++) {
+            const item = l.items[i];
+            const key = keys === undefined ? l.key(item) : keys[i - from];
+            rows.push(newRow(list, null, l, item, key, i));
+        }
+    }
+    finally {
+        list.building = null;
+    }
+    part.parent().insertBefore(frag, end);
+}
+export function each(items, key, row, pick) {
+    if (DEV && typeof key !== 'function') {
+        throw new TypeError('gyral: each() needs a key function as its second argument: ' +
+            'each(items, (x) => x.id, Row) (docs/design-docs/view/03-lists.md "Keys", rule 9).');
+    }
+    return {
+        [EACH]: commitList,
+        items,
+        key: key,
+        row: row,
+        pick: pick,
+    };
+}
+function commitList(part, l) {
+    const list = listOf(part, LIST);
+    const n = l.items.length;
+    if (DEV)
+        checkKeys(l.items, l.key);
+    if (list.rows.length === 0) {
+        if (n > 0) {
+            const rows = [];
+            createRows(part, list, l, rows, 0, n - 1, part.end());
+            list.rows = rows;
+        }
+    }
+    else if (n === 0)
+        clearList(part, list);
+    else
+        reconcile(part, list, l);
+    if (DEV)
+        recheckRows(list, l);
+}
+function reconcile(part, list, l) {
+    const { items, key } = l;
+    const old = list.rows;
+    const n = items.length;
+    const on = old.length;
+    const m = n < on ? n : on;
+    let s = 0;
+    for (; s < m; s++) {
+        const item = items[s];
+        const row = old[s];
+        if (key(item) !== row.key)
+            break;
+        updateRow(row, item, l);
+    }
+    if (s === n && s === on)
+        return;
+    let oe = on - 1;
+    let ne = n - 1;
+    while (oe >= s && ne >= s && key(items[ne]) === old[oe].key) {
+        oe--;
+        ne--;
+    }
+    const rows = old.slice(0, s);
+    if (s > oe)
+        createRows(part, list, l, rows, s, ne, firstFrom(old, oe + 1, part));
+    else if (s > ne)
+        for (let j = s; j <= oe; j++)
+            old[j].clear();
+    else
+        reorder(part, list, l, rows, s, oe, ne);
+    for (let j = oe + 1; j < on; j++)
+        rows.push(old[j]);
+    list.rows = rows;
+    for (let i = s; i < n; i++)
+        rows[i].index = i;
+    for (let i = ne + 1; i < n; i++)
+        updateRow(rows[i], items[i], l);
+}
+/** A positional array: items reused by index (view/02-bindings.md "Child values"). */
+export function commitItems(part, values) {
+    const list = listOf(part, ITEMS);
+    const rows = list.rows;
+    const n = values.length;
+    if (n === 0) {
+        if (rows.length > 0)
+            clearList(part, list);
+        return;
+    }
+    const common = n < rows.length ? n : rows.length;
+    for (let i = 0; i < common; i++)
+        rows[i].commit(values[i]);
+    if (n > rows.length) {
+        const end = part.end();
+        const frag = document.createDocumentFragment();
+        list.building = frag;
+        try {
+            for (let i = rows.length; i < n; i++) {
+                const row = new ChildPart(null, null, list, i, false, -1);
+                rows.push(row);
+                row.commit(values[i]);
+            }
+        }
+        finally {
+            list.building = null;
+        }
+        part.parent().insertBefore(frag, end);
+    }
+    else
+        while (rows.length > n)
+            rows.pop().clear();
+}
+//# sourceMappingURL=list.js.map

package/dist/view/render/list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"list.js","sourceRoot":"","sources":["../../../src/view/render/list.ts"],"names":[],"mappings":"AAAA,qFAAqF;AACrF,gGAAgG;AAChG,mFAAmF;AACnF,8FAA8F;AAC9F,sFAAsF;AACtF,8FAA8F;AAC9F,gGAAgG;AAChG,OAAO,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AAChC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAChE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAC/D,OAAO,EAAE,IAAI,EAAoC,MAAM,aAAa,CAAC;AAErE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,SAAS,MAAM,CAAC,IAAe,EAAE,IAAY;IAC3C,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC,OAAe,CAAC;IACpD,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,IAAI,CAAC,KAAK,EAAE,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACjB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACpB,OAAO,IAAI,CAAC;AACd,CAAC;AAED,qEAAqE;AACrE,MAAM,UAAU,SAAS,CAAC,IAAe,EAAE,IAAU;IACnD,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI;QAAG,IAAI,CAAC,UAAsB,CAAC,eAAe,EAAE,CAAC;;QACrF,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI;YAAE,GAAG,CAAC,KAAK,EAAE,CAAC;IAC9C,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CACxB,IAAe,EACf,IAAU,EACV,CAAa,EACb,IAAiB,EACjB,IAAY,EACZ,EAAU,EACV,GAAgB,EAChB,IAAyB;IAEzB,MAAM,IAAI,GAAG,QAAQ,CAAC,sBAAsB,EAAE,CAAC;IAC/C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;IACrB,IAAI,CAAC;QACH,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,GAAG,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;YAC9D,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;YAAS,CAAC;QACT,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;IACvB,CAAC;IACD,IAAI,CAAC,MAAM,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACxC,CAAC;AAkBD,MAAM,UAAU,IAAI,CAClB,KAAmB,EACnB,GAAiC,EACjC,GAAuC,EACvC,IAAqB;IAErB,IAAI,GAAG,IAAI,OAAO,GAAG,KAAK,UAAU,EAAE,CAAC;QACrC,MAAM,IAAI,SAAS,CACjB,6DAA6D;YAC3D,mFAAmF,CACtF,CAAC;IACJ,CAAC;IACD,OAAO;QACL,CAAC,IAAI,CAAC,EAAE,UAAU;QAClB,KAAK;QACL,GAAG,EAAE,GAAiC;QACtC,GAAG,EAAE,GAAkD;QACvD,IAAI,EAAE,IAAgD;KACvD,CAAC;AACJ,CAAC;AAED,SAAS,UAAU,CAAC,IAAe,EAAE,CAAa;IAChD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IACzB,IAAI,GAAG;QAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACnC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,GAAgB,EAAE,CAAC;YAC7B,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;YACtD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;IACH,CAAC;SAAM,IAAI,CAAC,KAAK,CAAC;QAAE,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;;QACrC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAC9B,IAAI,GAAG;QAAE,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAChC,CAAC;AAED,SAAS,SAAS,CAAC,IAAe,EAAE,IAAU,EAAE,CAAa;IAC3D,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACzB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;IACtB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC;IACtB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAClB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAc,CAAC;QAChC,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG;YAAE,MAAM;QACjC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO;IAChC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAChB,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACf,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAM,GAAG,CAAC,EAAE,CAAe,CAAC,GAAG,EAAE,CAAC;QAC3E,EAAE,EAAE,CAAC;QACL,EAAE,EAAE,CAAC;IACP,CAAC;IACD,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,IAAI,CAAC,GAAG,EAAE;QAAE,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;SAC5E,IAAI,CAAC,GAAG,EAAE;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;YAAG,GAAG,CAAC,CAAC,CAAe,CAAC,KAAK,EAAE,CAAC;;QACxE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAc,CAAC,CAAC;IACjE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAG,IAAI,CAAC,CAAC,CAAe,CAAC,KAAK,GAAG,CAAC,CAAC;IAC7D,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAc,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAChF,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,WAAW,CAAC,IAAe,EAAE,MAA0B;IACrE,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3C,OAAO;IACT,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;QAAG,IAAI,CAAC,CAAC,CAAe,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,QAAQ,CAAC,sBAAsB,EAAE,CAAC;QAC/C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC;YACH,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC1D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACf,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACvB,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACxC,CAAC;;QAAM,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC;YAAG,IAAI,CAAC,GAAG,EAAgB,CAAC,KAAK,EAAE,CAAC;AACnE,CAAC","sourcesContent":["// Lists in child holes: `each` (view/03-lists.md \"Reconciliation\", \"Fast paths\") and\n// positional arrays (view/02-bindings.md \"Child values\"). Rows are child parts tracked by their\n// node range, with no markers. Fast paths: create into empty (one fragment), clear\n// (replaceChildren when the list is its parent's only content), the common prefix and suffix,\n// insert-only (append, prepend, insert) and remove-only. What remains is reordered by\n// reorder.ts. Rows commit in document order. `each` is here: its result carries `commitList`,\n// so the keyed path (this, rows.ts, reorder.ts, place.ts) is bundled only by apps that call it.\nimport { DEV } from '#view-dev';\nimport { ChildPart, EMPTY, ITEMS, LIST } from './child-part.js';\nimport { checkKeys, recheckRows } from './dev-check.js';\nimport { reorder } from './reorder.js';\nimport { firstFrom, List, newRow, updateRow } from './rows.js';\nimport { EACH, type ChildValue, type ListResult } from './values.js';\n\nexport { List } from './rows.js';\n\nfunction listOf(part: ChildPart, kind: number): List {\n  if (part.kind === kind) return part.content as List;\n  if (part.kind !== EMPTY) part.clear();\n  const list = new List(part);\n  part.kind = kind;\n  part.content = list;\n  return list;\n}\n\n/** Removes every row; the list's part keeps its (now empty) list. */\nexport function clearList(part: ChildPart, list: List): void {\n  if (part.sole && part.parentNode !== null) (part.parentNode as Element).replaceChildren();\n  else for (const row of list.rows) row.clear();\n  list.rows = [];\n}\n\n/**\n * Creates rows for `l.items[from…to]` (keys from `keys[i - from]` when given) into one\n * fragment, pushes them onto `rows` and inserts the fragment before `end`.\n */\nexport function createRows(\n  part: ChildPart,\n  list: List,\n  l: ListResult,\n  rows: ChildPart[],\n  from: number,\n  to: number,\n  end: Node | null,\n  keys?: readonly unknown[],\n): void {\n  const frag = document.createDocumentFragment();\n  list.building = frag;\n  try {\n    for (let i = from; i <= to; i++) {\n      const item = l.items[i];\n      const key = keys === undefined ? l.key(item) : keys[i - from];\n      rows.push(newRow(list, null, l, item, key, i));\n    }\n  } finally {\n    list.building = null;\n  }\n  part.parent().insertBefore(frag, end);\n}\n\n/**\n * A keyed list (view/03-lists.md). `key` must give each item a unique string or number; `row`\n * must depend only on its arguments: a row re-renders only when its item object or its `pick`\n * result changes.\n */\nexport function each<T>(\n  items: readonly T[],\n  key: (item: T) => string | number,\n  row: (item: T) => ChildValue,\n): ListResult;\nexport function each<T, P>(\n  items: readonly T[],\n  key: (item: T) => string | number,\n  row: (item: T, picked: P) => ChildValue,\n  pick: (item: T) => P,\n): ListResult;\nexport function each<T, P>(\n  items: readonly T[],\n  key: (item: T) => string | number,\n  row: (item: T, picked: P) => ChildValue,\n  pick?: (item: T) => P,\n): ListResult {\n  if (DEV && typeof key !== 'function') {\n    throw new TypeError(\n      'gyral: each() needs a key function as its second argument: ' +\n        'each(items, (x) => x.id, Row) (docs/design-docs/view/03-lists.md \"Keys\", rule 9).',\n    );\n  }\n  return {\n    [EACH]: commitList,\n    items,\n    key: key as (item: unknown) => unknown,\n    row: row as (item: unknown, picked: unknown) => unknown,\n    pick: pick as ((item: unknown) => unknown) | undefined,\n  };\n}\n\nfunction commitList(part: ChildPart, l: ListResult): void {\n  const list = listOf(part, LIST);\n  const n = l.items.length;\n  if (DEV) checkKeys(l.items, l.key);\n  if (list.rows.length === 0) {\n    if (n > 0) {\n      const rows: ChildPart[] = [];\n      createRows(part, list, l, rows, 0, n - 1, part.end());\n      list.rows = rows;\n    }\n  } else if (n === 0) clearList(part, list);\n  else reconcile(part, list, l);\n  if (DEV) recheckRows(list, l);\n}\n\nfunction reconcile(part: ChildPart, list: List, l: ListResult): void {\n  const { items, key } = l;\n  const old = list.rows;\n  const n = items.length;\n  const on = old.length;\n  const m = n < on ? n : on;\n  let s = 0;\n  for (; s < m; s++) {\n    const item = items[s];\n    const row = old[s] as ChildPart;\n    if (key(item) !== row.key) break;\n    updateRow(row, item, l);\n  }\n  if (s === n && s === on) return;\n  let oe = on - 1;\n  let ne = n - 1;\n  while (oe >= s && ne >= s && key(items[ne]) === (old[oe] as ChildPart).key) {\n    oe--;\n    ne--;\n  }\n  const rows = old.slice(0, s);\n  if (s > oe) createRows(part, list, l, rows, s, ne, firstFrom(old, oe + 1, part));\n  else if (s > ne) for (let j = s; j <= oe; j++) (old[j] as ChildPart).clear();\n  else reorder(part, list, l, rows, s, oe, ne);\n  for (let j = oe + 1; j < on; j++) rows.push(old[j] as ChildPart);\n  list.rows = rows;\n  for (let i = s; i < n; i++) (rows[i] as ChildPart).index = i;\n  for (let i = ne + 1; i < n; i++) updateRow(rows[i] as ChildPart, items[i], l);\n}\n\n/** A positional array: items reused by index (view/02-bindings.md \"Child values\"). */\nexport function commitItems(part: ChildPart, values: readonly unknown[]): void {\n  const list = listOf(part, ITEMS);\n  const rows = list.rows;\n  const n = values.length;\n  if (n === 0) {\n    if (rows.length > 0) clearList(part, list);\n    return;\n  }\n  const common = n < rows.length ? n : rows.length;\n  for (let i = 0; i < common; i++) (rows[i] as ChildPart).commit(values[i]);\n  if (n > rows.length) {\n    const end = part.end();\n    const frag = document.createDocumentFragment();\n    list.building = frag;\n    try {\n      for (let i = rows.length; i < n; i++) {\n        const row = new ChildPart(null, null, list, i, false, -1);\n        rows.push(row);\n        row.commit(values[i]);\n      }\n    } finally {\n      list.building = null;\n    }\n    part.parent().insertBefore(frag, end);\n  } else while (rows.length > n) (rows.pop() as ChildPart).clear();\n}\n"]}

package/dist/view/render/mismatch.d.ts

@@ -0,0 +1,10 @@
+/** The server's DOM doesn't match the component's first client render. */
+export declare class HydrationMismatch extends Error {
+    constructor(message: string);
+}
+/**
+ * Throws a mismatch. `expected` describes what the walk needed; `found` is the DOM node there,
+ * a description, or null when `at` (the parent) had no more children. `host` names the
+ * component and `loc` the template's call site.
+ */
+export declare function mismatch(expected: string, found: Node | string | null, at: Node, root: Node, host: string, loc: string | undefined): never;

package/dist/view/render/mismatch.js

@@ -0,0 +1,53 @@
+// Hydration mismatches (view/07-hydration.md "Mismatches"): the server DOM differs from what
+// the first client render needs. The message names the component, the template's call site
+// (development builds know it), the path from the root to the node, and what was expected
+// and found. Development throws it; production recovers the one component (core's caller).
+import { DEV } from '#view-dev';
+/** The server's DOM doesn't match the component's first client render. */
+export class HydrationMismatch extends Error {
+    constructor(message) {
+        super(message);
+        this.name = 'HydrationMismatch';
+    }
+}
+/** A short description of a DOM node. */
+function describe(node) {
+    if (node.nodeType === 3)
+        return `text ${JSON.stringify(node.data.slice(0, 40))}`;
+    if (node.nodeType === 8)
+        return `<!--${node.data}-->`;
+    return node.nodeType === 1 ? `<${node.localName}>` : 'the root';
+}
+/** `div[0] › ul[2] › li[1]`: local names and child indexes from `root` down to `node`. */
+function pathOf(node, root) {
+    const steps = [];
+    for (let n = node; n !== null && n !== root; n = n.parentNode) {
+        let index = 0;
+        for (let s = n.previousSibling; s !== null; s = s.previousSibling)
+            index++;
+        steps.unshift(`${n.nodeType === 1 ? n.localName : n.nodeName}[${String(index)}]`);
+    }
+    return steps.length === 0 ? 'the root' : steps.join(' › ');
+}
+/**
+ * Throws a mismatch. `expected` describes what the walk needed; `found` is the DOM node there,
+ * a description, or null when `at` (the parent) had no more children. `host` names the
+ * component and `loc` the template's call site.
+ */
+export function mismatch(expected, found, at, root, host, loc) {
+    const where = typeof found === 'object' && found !== null ? found : at;
+    const what = found === null
+        ? `the end of ${describe(at)}`
+        : typeof found === 'string'
+            ? found
+            : describe(found);
+    throw new HydrationMismatch(`gyral: hydration mismatch in ${host}${loc === undefined ? '' : ` (template at ${loc})`} ` +
+        `at ${pathOf(where, root)}: expected ${expected}, found ${what}.` +
+        (DEV
+            ? " The server's HTML differs from the first client render: a view that isn't " +
+                'deterministic (Date.now(), locale), a third party that changed the DOM before ' +
+                'scripts ran, or a stale cached page (docs/design-docs/view/07-hydration.md ' +
+                '"Mismatches").'
+            : ''));
+}
+//# sourceMappingURL=mismatch.js.map

package/dist/view/render/mismatch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mismatch.js","sourceRoot":"","sources":["../../../src/view/render/mismatch.ts"],"names":[],"mappings":"AAAA,6FAA6F;AAC7F,2FAA2F;AAC3F,0FAA0F;AAC1F,2FAA2F;AAC3F,OAAO,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AAEhC,0EAA0E;AAC1E,MAAM,OAAO,iBAAkB,SAAQ,KAAK;IAC1C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,mBAAmB,CAAC;IAClC,CAAC;CACF;AAED,yCAAyC;AACzC,SAAS,QAAQ,CAAC,IAAU;IAC1B,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC;QAAE,OAAO,QAAQ,IAAI,CAAC,SAAS,CAAE,IAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;IAC3F,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC;QAAE,OAAO,OAAQ,IAAgB,CAAC,IAAI,KAAK,CAAC;IACnE,OAAO,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,IAAK,IAAgB,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC;AAC/E,CAAC;AAED,0FAA0F;AAC1F,SAAS,MAAM,CAAC,IAAU,EAAE,IAAU;IACpC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAgB,IAAI,EAAE,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC;QAC3E,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,eAAe,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,eAAe;YAAE,KAAK,EAAE,CAAC;QAC3E,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAE,CAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACjG,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC7D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CACtB,QAAgB,EAChB,KAA2B,EAC3B,EAAQ,EACR,IAAU,EACV,IAAY,EACZ,GAAuB;IAEvB,MAAM,KAAK,GAAG,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACvE,MAAM,IAAI,GACR,KAAK,KAAK,IAAI;QACZ,CAAC,CAAC,cAAc,QAAQ,CAAC,EAAE,CAAC,EAAE;QAC9B,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ;YACzB,CAAC,CAAC,KAAK;YACP,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACxB,MAAM,IAAI,iBAAiB,CACzB,gCAAgC,IAAI,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,iBAAiB,GAAG,GAAG,GAAG;QACxF,MAAM,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,cAAc,QAAQ,WAAW,IAAI,GAAG;QACjE,CAAC,GAAG;YACF,CAAC,CAAC,6EAA6E;gBAC7E,gFAAgF;gBAChF,6EAA6E;gBAC7E,gBAAgB;YAClB,CAAC,CAAC,EAAE,CAAC,CACV,CAAC;AACJ,CAAC","sourcesContent":["// Hydration mismatches (view/07-hydration.md \"Mismatches\"): the server DOM differs from what\n// the first client render needs. The message names the component, the template's call site\n// (development builds know it), the path from the root to the node, and what was expected\n// and found. Development throws it; production recovers the one component (core's caller).\nimport { DEV } from '#view-dev';\n\n/** The server's DOM doesn't match the component's first client render. */\nexport class HydrationMismatch extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'HydrationMismatch';\n  }\n}\n\n/** A short description of a DOM node. */\nfunction describe(node: Node): string {\n  if (node.nodeType === 3) return `text ${JSON.stringify((node as Text).data.slice(0, 40))}`;\n  if (node.nodeType === 8) return `<!--${(node as Comment).data}-->`;\n  return node.nodeType === 1 ? `<${(node as Element).localName}>` : 'the root';\n}\n\n/** `div[0] › ul[2] › li[1]`: local names and child indexes from `root` down to `node`. */\nfunction pathOf(node: Node, root: Node): string {\n  const steps: string[] = [];\n  for (let n: Node | null = node; n !== null && n !== root; n = n.parentNode) {\n    let index = 0;\n    for (let s = n.previousSibling; s !== null; s = s.previousSibling) index++;\n    steps.unshift(`${n.nodeType === 1 ? (n as Element).localName : n.nodeName}[${String(index)}]`);\n  }\n  return steps.length === 0 ? 'the root' : steps.join(' › ');\n}\n\n/**\n * Throws a mismatch. `expected` describes what the walk needed; `found` is the DOM node there,\n * a description, or null when `at` (the parent) had no more children. `host` names the\n * component and `loc` the template's call site.\n */\nexport function mismatch(\n  expected: string,\n  found: Node | string | null,\n  at: Node,\n  root: Node,\n  host: string,\n  loc: string | undefined,\n): never {\n  const where = typeof found === 'object' && found !== null ? found : at;\n  const what =\n    found === null\n      ? `the end of ${describe(at)}`\n      : typeof found === 'string'\n        ? found\n        : describe(found);\n  throw new HydrationMismatch(\n    `gyral: hydration mismatch in ${host}${loc === undefined ? '' : ` (template at ${loc})`} ` +\n      `at ${pathOf(where, root)}: expected ${expected}, found ${what}.` +\n      (DEV\n        ? \" The server's HTML differs from the first client render: a view that isn't \" +\n          'deterministic (Date.now(), locale), a third party that changed the DOM before ' +\n          'scripts ran, or a stale cached page (docs/design-docs/view/07-hydration.md ' +\n          '\"Mismatches\").'\n        : ''),\n  );\n}\n"]}

package/dist/view/render/nodes.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Whether moves into `parent` can use `moveBefore` (not Baseline yet: detected on the parent,
+ * once per reorder): the browser has it and the parent is in a document (state worth keeping
+ * only exists there, and both ends share a root).
+ */
+export declare const canMove: (parent: Node) => boolean;
+/** Moves the nodes `first`…`last` (siblings, in order) before `ref` in `parent`. */
+export declare function moveRange(parent: Node, first: Node, last: Node, ref: Node | null, move: boolean): void;
+/** Removes the nodes `first`…`last` (siblings, in order). */
+export declare function removeRange(first: Node, last: Node): void;

package/dist/view/render/nodes.js

@@ -0,0 +1,37 @@
+// Moving and removing node ranges (view/03-lists.md "Row boundaries", reconciliation step 4).
+// A row or instance is tracked by its first and last node, with no markers. Moves use
+// `moveBefore()` where the browser has it (it keeps focus, selection, animations, iframe and
+// media state); elsewhere `insertBefore` (ADR 0003 tier 2: an inline fallback).
+/**
+ * Whether moves into `parent` can use `moveBefore` (not Baseline yet: detected on the parent,
+ * once per reorder): the browser has it and the parent is in a document (state worth keeping
+ * only exists there, and both ends share a root).
+ */
+export const canMove = (parent) => 'moveBefore' in parent && parent.isConnected;
+/** Moves the nodes `first`…`last` (siblings, in order) before `ref` in `parent`. */
+export function moveRange(parent, first, last, ref, move) {
+    for (let node = first;;) {
+        const next = node.nextSibling;
+        if (move)
+            parent.moveBefore(node, ref);
+        else
+            parent.insertBefore(node, ref);
+        if (node === last || next === null)
+            return;
+        node = next;
+    }
+}
+/** Removes the nodes `first`…`last` (siblings, in order). */
+export function removeRange(first, last) {
+    const parent = first.parentNode;
+    if (parent === null)
+        return;
+    for (let node = first;;) {
+        const next = node.nextSibling;
+        parent.removeChild(node);
+        if (node === last || next === null)
+            return;
+        node = next;
+    }
+}
+//# sourceMappingURL=nodes.js.map

package/dist/view/render/nodes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodes.js","sourceRoot":"","sources":["../../../src/view/render/nodes.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAC9F,sFAAsF;AACtF,6FAA6F;AAC7F,gFAAgF;AAMhF;;;;GAIG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,MAAY,EAAW,EAAE,CAAC,YAAY,IAAI,MAAM,IAAI,MAAM,CAAC,WAAW,CAAC;AAE/F,oFAAoF;AACpF,MAAM,UAAU,SAAS,CACvB,MAAY,EACZ,KAAW,EACX,IAAU,EACV,GAAgB,EAChB,IAAa;IAEb,KAAK,IAAI,IAAI,GAAG,KAAK,IAAK,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;QAC9B,IAAI,IAAI;YAAG,MAAkC,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;;YAC/D,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACpC,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC3C,IAAI,GAAG,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,WAAW,CAAC,KAAW,EAAE,IAAU;IACjD,MAAM,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC;IAChC,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO;IAC5B,KAAK,IAAI,IAAI,GAAG,KAAK,IAAK,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;QAC9B,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC3C,IAAI,GAAG,IAAI,CAAC;IACd,CAAC;AACH,CAAC","sourcesContent":["// Moving and removing node ranges (view/03-lists.md \"Row boundaries\", reconciliation step 4).\n// A row or instance is tracked by its first and last node, with no markers. Moves use\n// `moveBefore()` where the browser has it (it keeps focus, selection, animations, iframe and\n// media state); elsewhere `insertBefore` (ADR 0003 tier 2: an inline fallback).\n\ninterface MovingParent {\n  moveBefore(node: Node, child: Node | null): void;\n}\n\n/**\n * Whether moves into `parent` can use `moveBefore` (not Baseline yet: detected on the parent,\n * once per reorder): the browser has it and the parent is in a document (state worth keeping\n * only exists there, and both ends share a root).\n */\nexport const canMove = (parent: Node): boolean => 'moveBefore' in parent && parent.isConnected;\n\n/** Moves the nodes `first`…`last` (siblings, in order) before `ref` in `parent`. */\nexport function moveRange(\n  parent: Node,\n  first: Node,\n  last: Node,\n  ref: Node | null,\n  move: boolean,\n): void {\n  for (let node = first; ;) {\n    const next = node.nextSibling;\n    if (move) (parent as unknown as MovingParent).moveBefore(node, ref);\n    else parent.insertBefore(node, ref);\n    if (node === last || next === null) return;\n    node = next;\n  }\n}\n\n/** Removes the nodes `first`…`last` (siblings, in order). */\nexport function removeRange(first: Node, last: Node): void {\n  const parent = first.parentNode;\n  if (parent === null) return;\n  for (let node = first; ;) {\n    const next = node.nextSibling;\n    parent.removeChild(node);\n    if (node === last || next === null) return;\n    node = next;\n  }\n}\n"]}

package/dist/view/render/place.d.ts

@@ -0,0 +1,18 @@
+/** A row, as far as placing it goes. */
+export interface Placeable {
+    first(): Node | null;
+    last(): Node | null;
+}
+/**
+ * Marks (1) the positions of one longest strictly increasing subsequence of `src`, ignoring
+ * negative entries (new rows). O(n log n).
+ */
+export declare function lis(src: Int32Array): Uint8Array;
+/**
+ * Places `rows[from..to]` before `end` in `parent`, back to front. `src[i - from]` is the old
+ * position of a reused row, or -1 for a new row (its nodes wait in a fragment). Reused rows
+ * marked in `keep` stay (all of them when `keep` is undefined: they are already in order); the
+ * others move. Rows that stay cost two array reads; only a row that moves looks up its
+ * reference node.
+ */
+export declare function placeRows(parent: Node, rows: readonly Placeable[], from: number, to: number, src: Int32Array, keep: Uint8Array | undefined, end: Node | null): void;

package/dist/view/render/place.js

@@ -0,0 +1,69 @@
+// Putting a list's reordered rows in place with the fewest DOM moves (view/03-lists.md
+// "Reconciliation", step 3): the rows whose old positions form a longest increasing
+// subsequence (or that a two-ended scan matched in place) stay; every other reused row moves,
+// and new rows are inserted. The benchmark behind the plan is recorded in the spec.
+import { canMove, moveRange } from './nodes.js';
+/**
+ * Marks (1) the positions of one longest strictly increasing subsequence of `src`, ignoring
+ * negative entries (new rows). O(n log n).
+ */
+export function lis(src) {
+    const n = src.length;
+    const tails = new Int32Array(n);
+    const prev = new Int32Array(n);
+    let len = 0;
+    for (let i = 0; i < n; i++) {
+        const v = src[i];
+        if (v < 0)
+            continue;
+        let lo = 0;
+        let hi = len;
+        while (lo < hi) {
+            const mid = (lo + hi) >> 1;
+            if (src[tails[mid]] < v)
+                lo = mid + 1;
+            else
+                hi = mid;
+        }
+        prev[i] = lo > 0 ? tails[lo - 1] : -1;
+        tails[lo] = i;
+        if (lo === len)
+            len++;
+    }
+    const keep = new Uint8Array(n);
+    for (let k = len > 0 ? tails[len - 1] : -1; k >= 0; k = prev[k]) {
+        keep[k] = 1;
+    }
+    return keep;
+}
+/** The first node of `rows[from…to]` (already placed), or `end`. */
+function nodeAfter(rows, from, to, end) {
+    for (let i = from; i <= to; i++) {
+        const node = rows[i].first();
+        if (node !== null)
+            return node;
+    }
+    return end;
+}
+/**
+ * Places `rows[from..to]` before `end` in `parent`, back to front. `src[i - from]` is the old
+ * position of a reused row, or -1 for a new row (its nodes wait in a fragment). Reused rows
+ * marked in `keep` stay (all of them when `keep` is undefined: they are already in order); the
+ * others move. Rows that stay cost two array reads; only a row that moves looks up its
+ * reference node.
+ */
+export function placeRows(parent, rows, from, to, src, keep, end) {
+    const move = canMove(parent);
+    for (let i = to; i >= from; i--) {
+        const fresh = src[i - from] < 0;
+        if (!fresh && (keep === undefined || keep[i - from] === 1))
+            continue;
+        const row = rows[i];
+        const first = row.first();
+        if (first === null)
+            continue;
+        const ref = nodeAfter(rows, i + 1, to, end);
+        moveRange(parent, first, row.last(), ref, !fresh && move);
+    }
+}
+//# sourceMappingURL=place.js.map

package/dist/view/render/place.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"place.js","sourceRoot":"","sources":["../../../src/view/render/place.ts"],"names":[],"mappings":"AAAA,uFAAuF;AACvF,oFAAoF;AACpF,8FAA8F;AAC9F,oFAAoF;AACpF,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAQhD;;;GAGG;AACH,MAAM,UAAU,GAAG,CAAC,GAAe;IACjC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IACrB,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAW,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC;YAAE,SAAS;QACpB,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,GAAG,CAAC;QACb,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAK,GAAG,CAAC,KAAK,CAAC,GAAG,CAAW,CAAY,GAAG,CAAC;gBAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;gBACvD,EAAE,GAAG,GAAG,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAE,KAAK,CAAC,EAAE,GAAG,CAAC,CAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,EAAE,KAAK,GAAG;YAAE,GAAG,EAAE,CAAC;IACxB,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAE,KAAK,CAAC,GAAG,GAAG,CAAC,CAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAW,EAAE,CAAC;QACtF,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACd,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,oEAAoE;AACpE,SAAS,SAAS,CAChB,IAA0B,EAC1B,IAAY,EACZ,EAAU,EACV,GAAgB;IAEhB,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,IAAI,GAAI,IAAI,CAAC,CAAC,CAAe,CAAC,KAAK,EAAE,CAAC;QAC5C,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;IACjC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CACvB,MAAY,EACZ,IAA0B,EAC1B,IAAY,EACZ,EAAU,EACV,GAAe,EACf,IAA4B,EAC5B,GAAgB;IAEhB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,KAAK,GAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAY,GAAG,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,SAAS;QACrE,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAc,CAAC;QACjC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,KAAK,KAAK,IAAI;YAAE,SAAS;QAC7B,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;QAC5C,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,IAAI,EAAU,EAAE,GAAG,EAAE,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;IACpE,CAAC;AACH,CAAC","sourcesContent":["// Putting a list's reordered rows in place with the fewest DOM moves (view/03-lists.md\n// \"Reconciliation\", step 3): the rows whose old positions form a longest increasing\n// subsequence (or that a two-ended scan matched in place) stay; every other reused row moves,\n// and new rows are inserted. The benchmark behind the plan is recorded in the spec.\nimport { canMove, moveRange } from './nodes.js';\n\n/** A row, as far as placing it goes. */\nexport interface Placeable {\n  first(): Node | null;\n  last(): Node | null;\n}\n\n/**\n * Marks (1) the positions of one longest strictly increasing subsequence of `src`, ignoring\n * negative entries (new rows). O(n log n).\n */\nexport function lis(src: Int32Array): Uint8Array {\n  const n = src.length;\n  const tails = new Int32Array(n);\n  const prev = new Int32Array(n);\n  let len = 0;\n  for (let i = 0; i < n; i++) {\n    const v = src[i] as number;\n    if (v < 0) continue;\n    let lo = 0;\n    let hi = len;\n    while (lo < hi) {\n      const mid = (lo + hi) >> 1;\n      if ((src[tails[mid] as number] as number) < v) lo = mid + 1;\n      else hi = mid;\n    }\n    prev[i] = lo > 0 ? (tails[lo - 1] as number) : -1;\n    tails[lo] = i;\n    if (lo === len) len++;\n  }\n  const keep = new Uint8Array(n);\n  for (let k = len > 0 ? (tails[len - 1] as number) : -1; k >= 0; k = prev[k] as number) {\n    keep[k] = 1;\n  }\n  return keep;\n}\n\n/** The first node of `rows[from…to]` (already placed), or `end`. */\nfunction nodeAfter(\n  rows: readonly Placeable[],\n  from: number,\n  to: number,\n  end: Node | null,\n): Node | null {\n  for (let i = from; i <= to; i++) {\n    const node = (rows[i] as Placeable).first();\n    if (node !== null) return node;\n  }\n  return end;\n}\n\n/**\n * Places `rows[from..to]` before `end` in `parent`, back to front. `src[i - from]` is the old\n * position of a reused row, or -1 for a new row (its nodes wait in a fragment). Reused rows\n * marked in `keep` stay (all of them when `keep` is undefined: they are already in order); the\n * others move. Rows that stay cost two array reads; only a row that moves looks up its\n * reference node.\n */\nexport function placeRows(\n  parent: Node,\n  rows: readonly Placeable[],\n  from: number,\n  to: number,\n  src: Int32Array,\n  keep: Uint8Array | undefined,\n  end: Node | null,\n): void {\n  const move = canMove(parent);\n  for (let i = to; i >= from; i--) {\n    const fresh = (src[i - from] as number) < 0;\n    if (!fresh && (keep === undefined || keep[i - from] === 1)) continue;\n    const row = rows[i] as Placeable;\n    const first = row.first();\n    if (first === null) continue;\n    const ref = nodeAfter(rows, i + 1, to, end);\n    moveRange(parent, first, row.last() as Node, ref, !fresh && move);\n  }\n}\n"]}

package/dist/view/render/plan.d.ts

@@ -0,0 +1,26 @@
+import { type TemplateObject } from '../normalize/types.js';
+/** Plan kinds of child parts (element parts use their attr-parts.ts kind, ≥ 0). */
+export declare const CHILD = -1;
+export declare const SOLE = -2;
+export declare const ROOT = -3;
+export interface Plan {
+    readonly content: DocumentFragment;
+    /** One root node and no root-level holes: clone that node instead of the fragment. */
+    readonly single: boolean;
+    /** Per target node, in document order: keep depth, sibling skip (-1: none), n, n indexes. */
+    readonly ops: readonly number[];
+    readonly targets: number;
+    /** Per part: its element's (or child part's parent's) target, its reference node's target. */
+    readonly a: readonly number[];
+    readonly b: readonly number[];
+    /** Per part: the index of its (first) value, and its kind. */
+    readonly at: readonly number[];
+    readonly kinds: readonly number[];
+}
+/** Scratch space for walks (never re-entrant: nested instances are created after the walk). */
+export declare const stack: Node[];
+export declare const nodes: Node[];
+/** Fills `nodes` with each target of `plan`, walking from `stack[0]` (or `stack[1]`). */
+export declare function walk(plan: Plan): void;
+/** The plan of `template` (one-entry cache in front of the WeakMap: rows repeat a template). */
+export declare function planOf(template: TemplateObject): Plan;

package/dist/view/render/plan.js

@@ -0,0 +1,124 @@
+// Instantiation plans (view/01-templates.md "Instantiation"): computed once per template object,
+// they say how to reach every part's nodes in a clone by child-index paths, following
+// firstChild/nextSibling and sharing prefixes (no TreeWalker, no marker search), and what each
+// part is. Part kinds that depend on the element (live form state) are decided here, from the
+// template's own parsed content, so creating an instance only walks and allocates.
+import { ATTR_PART, BOOL_PART, CHILD_BEFORE, CHILD_SOLE, MULTI_PART, PROP_PART, HOOK_PART, TEXT_PART, } from '../normalize/types.js';
+import { templateElement } from '../template-element.js';
+import { attrKind, HOOK, MULTI, PROP, TEXTAREA, TITLE } from './attr-parts.js';
+/** Plan kinds of child parts (element parts use their attr-parts.ts kind, ≥ 0). */
+export const CHILD = -1;
+export const SOLE = -2;
+export const ROOT = -3;
+/** Scratch space for walks (never re-entrant: nested instances are created after the walk). */
+export const stack = [];
+export const nodes = [];
+/** Fills `nodes` with each target of `plan`, walking from `stack[0]` (or `stack[1]`). */
+export function walk(plan) {
+    const ops = plan.ops;
+    let k = 0;
+    for (let t = 0; t < plan.targets; t++) {
+        const keep = ops[k];
+        const skip = ops[k + 1];
+        const n = ops[k + 2];
+        k += 3;
+        let depth = keep;
+        let node = stack[keep];
+        if (skip >= 0) {
+            node = stack[++depth];
+            for (let s = 0; s < skip; s++)
+                node = node.nextSibling;
+            stack[depth] = node;
+        }
+        for (let j = 0; j < n; j++) {
+            node = node.firstChild;
+            for (let s = ops[k++]; s > 0; s--)
+                node = node.nextSibling;
+            stack[++depth] = node;
+        }
+        nodes[t] = node;
+    }
+}
+function build(template) {
+    const content = templateElement(template).content;
+    const single = content.childNodes.length === 1 && template.parts.every((p) => p[1].length > 0);
+    const ids = new Map();
+    const ops = [];
+    let cursor = single ? [0] : [];
+    const target = (path) => {
+        const id = path.join();
+        const known = ids.get(id);
+        if (known !== undefined)
+            return known;
+        let keep = 0;
+        while (keep < path.length && path[keep] === cursor[keep])
+            keep++;
+        if (keep === path.length) {
+            ops.push(keep, -1, 0); // an ancestor of the cursor (or the cursor itself)
+        }
+        else {
+            const from = (cursor[keep] ?? Infinity) < path[keep] ? keep + 1 : keep;
+            const skip = from > keep ? path[keep] - cursor[keep] : -1;
+            ops.push(keep, skip, path.length - from, ...path.slice(from));
+            cursor = path;
+        }
+        ids.set(id, ids.size);
+        return ids.size - 1;
+    };
+    const a = [];
+    const b = [];
+    const at = [];
+    let value = 0;
+    for (const spec of template.parts) {
+        a.push(target(spec[1]));
+        b.push(spec[0] === CHILD_BEFORE ? target([...spec[1], spec[2]]) : -1);
+        at.push(value);
+        value += spec[0] === MULTI_PART ? spec[3].length - 1 : 1;
+    }
+    const kinds = [];
+    const plan = { content, single, ops, targets: ids.size, a, b, at, kinds };
+    // Walk the template's own content once to decide the element-dependent kinds.
+    stack[0] = content;
+    if (single)
+        stack[1] = content.firstChild;
+    walk(plan);
+    template.parts.forEach((spec, i) => {
+        kinds.push(kindOf(spec, nodes[a[i]]));
+    });
+    return plan;
+}
+function kindOf(spec, el) {
+    switch (spec[0]) {
+        case ATTR_PART:
+            return attrKind(el, spec[2], false);
+        case MULTI_PART:
+            return MULTI;
+        case BOOL_PART:
+            return attrKind(el, spec[2], true);
+        case PROP_PART:
+            return PROP;
+        case HOOK_PART:
+            return HOOK;
+        case TEXT_PART:
+            return el.localName === 'textarea' ? TEXTAREA : TITLE;
+        default:
+            return spec[1].length === 0 ? ROOT : spec[0] === CHILD_SOLE ? SOLE : CHILD;
+    }
+}
+const plans = new WeakMap();
+let lastTemplate;
+let lastPlan;
+/** The plan of `template` (one-entry cache in front of the WeakMap: rows repeat a template). */
+export function planOf(template) {
+    if (template === lastTemplate)
+        return lastPlan;
+    let plan = plans.get(template);
+    if (plan === undefined) {
+        plan = build(template);
+        plans.set(template, plan);
+    }
+    lastTemplate = template;
+    lastPlan = plan;
+    return plan;
+}
+//# sourceMappingURL=plan.js.map

package/dist/view/render/plan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"plan.js","sourceRoot":"","sources":["../../../src/view/render/plan.ts"],"names":[],"mappings":"AAAA,iGAAiG;AACjG,sFAAsF;AACtF,+FAA+F;AAC/F,8FAA8F;AAC9F,mFAAmF;AACnF,OAAO,EACL,SAAS,EACT,SAAS,EACT,YAAY,EACZ,UAAU,EACV,UAAU,EACV,SAAS,EACT,SAAS,EACT,SAAS,GAGV,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAE/E,mFAAmF;AACnF,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC;AACxB,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC;AACvB,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC;AAiBvB,+FAA+F;AAC/F,MAAM,CAAC,MAAM,KAAK,GAAW,EAAE,CAAC;AAChC,MAAM,CAAC,MAAM,KAAK,GAAW,EAAE,CAAC;AAEhC,yFAAyF;AACzF,MAAM,UAAU,IAAI,CAAC,IAAU;IAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;IACrB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAW,CAAC;QAC9B,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;QAClC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;QAC/B,CAAC,IAAI,CAAC,CAAC;QACP,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAS,CAAC;QAC/B,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;YACd,IAAI,GAAG,KAAK,CAAC,EAAE,KAAK,CAAS,CAAC;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;gBAAE,IAAI,GAAG,IAAI,CAAC,WAAmB,CAAC;YAC/D,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;QACtB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,GAAG,IAAI,CAAC,UAAkB,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAW,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,IAAI,GAAG,IAAI,CAAC,WAAmB,CAAC;YAC7E,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;QACxB,CAAC;QACD,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAClB,CAAC;AACH,CAAC;AAED,SAAS,KAAK,CAAC,QAAwB;IACrC,MAAM,OAAO,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;IAClD,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/F,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,MAAM,GAAsB,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAClD,MAAM,MAAM,GAAG,CAAC,IAAuB,EAAU,EAAE;QACjD,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACtC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC;YAAE,IAAI,EAAE,CAAC;QACjE,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YACzB,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mDAAmD;QAC5E,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,GAAI,IAAI,CAAC,IAAI,CAAY,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACnF,MAAM,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC,IAAI,CAAY,GAAI,MAAM,CAAC,IAAI,CAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClF,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9D,MAAM,GAAG,IAAI,CAAC;QAChB,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;IACtB,CAAC,CAAC;IACF,MAAM,CAAC,GAAa,EAAE,CAAC;IACvB,MAAM,CAAC,GAAa,EAAE,CAAC;IACvB,MAAM,EAAE,GAAa,EAAE,CAAC;IACxB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAClC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACf,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC;IACD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAS,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC;IAChF,8EAA8E;IAC9E,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;IACnB,IAAI,MAAM;QAAE,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,UAAkB,CAAC;IAClD,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QACjC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAW,CAAY,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IACH,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,MAAM,CAAC,IAAc,EAAE,EAAW;IACzC,QAAQ,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QAChB,KAAK,SAAS;YACZ,OAAO,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACtC,KAAK,UAAU;YACb,OAAO,KAAK,CAAC;QACf,KAAK,SAAS;YACZ,OAAO,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACrC,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC;QACd,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC;QACd,KAAK,SAAS;YACZ,OAAO,EAAE,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;QACxD;YACE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;IAC/E,CAAC;AACH,CAAC;AAED,MAAM,KAAK,GAAG,IAAI,OAAO,EAAwB,CAAC;AAClD,IAAI,YAAwC,CAAC;AAC7C,IAAI,QAA0B,CAAC;AAE/B,gGAAgG;AAChG,MAAM,UAAU,MAAM,CAAC,QAAwB;IAC7C,IAAI,QAAQ,KAAK,YAAY;QAAE,OAAO,QAAgB,CAAC;IACvD,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC/B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvB,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD,YAAY,GAAG,QAAQ,CAAC;IACxB,QAAQ,GAAG,IAAI,CAAC;IAChB,OAAO,IAAI,CAAC;AACd,CAAC","sourcesContent":["// Instantiation plans (view/01-templates.md \"Instantiation\"): computed once per template object,\n// they say how to reach every part's nodes in a clone by child-index paths, following\n// firstChild/nextSibling and sharing prefixes (no TreeWalker, no marker search), and what each\n// part is. Part kinds that depend on the element (live form state) are decided here, from the\n// template's own parsed content, so creating an instance only walks and allocates.\nimport {\n  ATTR_PART,\n  BOOL_PART,\n  CHILD_BEFORE,\n  CHILD_SOLE,\n  MULTI_PART,\n  PROP_PART,\n  HOOK_PART,\n  TEXT_PART,\n  type PartSpec,\n  type TemplateObject,\n} from '../normalize/types.js';\nimport { templateElement } from '../template-element.js';\nimport { attrKind, HOOK, MULTI, PROP, TEXTAREA, TITLE } from './attr-parts.js';\n\n/** Plan kinds of child parts (element parts use their attr-parts.ts kind, ≥ 0). */\nexport const CHILD = -1;\nexport const SOLE = -2;\nexport const ROOT = -3;\n\nexport interface Plan {\n  readonly content: DocumentFragment;\n  /** One root node and no root-level holes: clone that node instead of the fragment. */\n  readonly single: boolean;\n  /** Per target node, in document order: keep depth, sibling skip (-1: none), n, n indexes. */\n  readonly ops: readonly number[];\n  readonly targets: number;\n  /** Per part: its element's (or child part's parent's) target, its reference node's target. */\n  readonly a: readonly number[];\n  readonly b: readonly number[];\n  /** Per part: the index of its (first) value, and its kind. */\n  readonly at: readonly number[];\n  readonly kinds: readonly number[];\n}\n\n/** Scratch space for walks (never re-entrant: nested instances are created after the walk). */\nexport const stack: Node[] = [];\nexport const nodes: Node[] = [];\n\n/** Fills `nodes` with each target of `plan`, walking from `stack[0]` (or `stack[1]`). */\nexport function walk(plan: Plan): void {\n  const ops = plan.ops;\n  let k = 0;\n  for (let t = 0; t < plan.targets; t++) {\n    const keep = ops[k] as number;\n    const skip = ops[k + 1] as number;\n    const n = ops[k + 2] as number;\n    k += 3;\n    let depth = keep;\n    let node = stack[keep] as Node;\n    if (skip >= 0) {\n      node = stack[++depth] as Node;\n      for (let s = 0; s < skip; s++) node = node.nextSibling as Node;\n      stack[depth] = node;\n    }\n    for (let j = 0; j < n; j++) {\n      node = node.firstChild as Node;\n      for (let s = ops[k++] as number; s > 0; s--) node = node.nextSibling as Node;\n      stack[++depth] = node;\n    }\n    nodes[t] = node;\n  }\n}\n\nfunction build(template: TemplateObject): Plan {\n  const content = templateElement(template).content;\n  const single = content.childNodes.length === 1 && template.parts.every((p) => p[1].length > 0);\n  const ids = new Map<string, number>();\n  const ops: number[] = [];\n  let cursor: readonly number[] = single ? [0] : [];\n  const target = (path: readonly number[]): number => {\n    const id = path.join();\n    const known = ids.get(id);\n    if (known !== undefined) return known;\n    let keep = 0;\n    while (keep < path.length && path[keep] === cursor[keep]) keep++;\n    if (keep === path.length) {\n      ops.push(keep, -1, 0); // an ancestor of the cursor (or the cursor itself)\n    } else {\n      const from = (cursor[keep] ?? Infinity) < (path[keep] as number) ? keep + 1 : keep;\n      const skip = from > keep ? (path[keep] as number) - (cursor[keep] as number) : -1;\n      ops.push(keep, skip, path.length - from, ...path.slice(from));\n      cursor = path;\n    }\n    ids.set(id, ids.size);\n    return ids.size - 1;\n  };\n  const a: number[] = [];\n  const b: number[] = [];\n  const at: number[] = [];\n  let value = 0;\n  for (const spec of template.parts) {\n    a.push(target(spec[1]));\n    b.push(spec[0] === CHILD_BEFORE ? target([...spec[1], spec[2]]) : -1);\n    at.push(value);\n    value += spec[0] === MULTI_PART ? spec[3].length - 1 : 1;\n  }\n  const kinds: number[] = [];\n  const plan: Plan = { content, single, ops, targets: ids.size, a, b, at, kinds };\n  // Walk the template's own content once to decide the element-dependent kinds.\n  stack[0] = content;\n  if (single) stack[1] = content.firstChild as Node;\n  walk(plan);\n  template.parts.forEach((spec, i) => {\n    kinds.push(kindOf(spec, nodes[a[i] as number] as Element));\n  });\n  return plan;\n}\n\nfunction kindOf(spec: PartSpec, el: Element): number {\n  switch (spec[0]) {\n    case ATTR_PART:\n      return attrKind(el, spec[2], false);\n    case MULTI_PART:\n      return MULTI;\n    case BOOL_PART:\n      return attrKind(el, spec[2], true);\n    case PROP_PART:\n      return PROP;\n    case HOOK_PART:\n      return HOOK;\n    case TEXT_PART:\n      return el.localName === 'textarea' ? TEXTAREA : TITLE;\n    default:\n      return spec[1].length === 0 ? ROOT : spec[0] === CHILD_SOLE ? SOLE : CHILD;\n  }\n}\n\nconst plans = new WeakMap<TemplateObject, Plan>();\nlet lastTemplate: TemplateObject | undefined;\nlet lastPlan: Plan | undefined;\n\n/** The plan of `template` (one-entry cache in front of the WeakMap: rows repeat a template). */\nexport function planOf(template: TemplateObject): Plan {\n  if (template === lastTemplate) return lastPlan as Plan;\n  let plan = plans.get(template);\n  if (plan === undefined) {\n    plan = build(template);\n    plans.set(template, plan);\n  }\n  lastTemplate = template;\n  lastPlan = plan;\n  return plan;\n}\n"]}

package/dist/view/render/raw.d.ts

@@ -0,0 +1,18 @@
+import { type RawResult } from './values.js';
+/** Parsed `raw()` markup: the start anchor, the last node, and the string. */
+export declare class RawRange {
+    readonly start: Comment;
+    end: Node;
+    html: string;
+    constructor(start: Comment, end: Node, html: string);
+    first(): Node;
+    last(): Node;
+    remove(): void;
+}
+/** `html` parsed by a <template> (its content is reused: read it before the next call). */
+export declare function parse(html: string): DocumentFragment;
+/**
+ * Trusted markup from your own code (Markdown output, JSON-LD), parsed in a child hole and
+ * re-parsed only when the string changes. Never pass user input.
+ */
+export declare function raw(html: string): RawResult;