@shadow-js/web 1.0.3 → 1.0.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (58) hide show
  1. package/CHANGELOG.md +7 -0
  2. package/README.md +2 -3
  3. package/dist/dev/attributes.js +1 -5
  4. package/dist/dev/attributes.js.map +1 -1
  5. package/dist/dev/class-style.js +9 -12
  6. package/dist/dev/class-style.js.map +1 -1
  7. package/dist/dev/element.js +8 -25
  8. package/dist/dev/element.js.map +1 -1
  9. package/dist/dev/events.js +64 -80
  10. package/dist/dev/events.js.map +1 -1
  11. package/dist/dev/insert.js +50 -68
  12. package/dist/dev/insert.js.map +1 -1
  13. package/dist/dev/internal/reconcile.d.ts +2 -1
  14. package/dist/dev/internal/reconcile.js +19 -2
  15. package/dist/dev/internal/reconcile.js.map +1 -1
  16. package/dist/dev/spread.js +47 -80
  17. package/dist/dev/spread.js.map +1 -1
  18. package/dist/prod/attributes.js +1 -1
  19. package/dist/prod/attributes.js.map +1 -1
  20. package/dist/prod/class-style.js +1 -1
  21. package/dist/prod/class-style.js.map +1 -1
  22. package/dist/prod/element.js +1 -1
  23. package/dist/prod/element.js.map +1 -1
  24. package/dist/prod/events.js +1 -1
  25. package/dist/prod/events.js.map +1 -1
  26. package/dist/prod/insert.js +1 -1
  27. package/dist/prod/insert.js.map +1 -1
  28. package/dist/prod/internal/reconcile.js +1 -1
  29. package/dist/prod/internal/reconcile.js.map +1 -1
  30. package/dist/prod/spread.js +1 -1
  31. package/dist/prod/spread.js.map +1 -1
  32. package/dist/server/attributes.js +1 -1
  33. package/dist/server/attributes.js.map +1 -1
  34. package/dist/server/class-style.js +1 -1
  35. package/dist/server/class-style.js.map +1 -1
  36. package/dist/server/element.js.map +1 -1
  37. package/dist/server/events.js +1 -1
  38. package/dist/server/events.js.map +1 -1
  39. package/dist/server/insert.js +1 -1
  40. package/dist/server/insert.js.map +1 -1
  41. package/dist/server/internal/reconcile.js +1 -1
  42. package/dist/server/internal/reconcile.js.map +1 -1
  43. package/dist/server/spread.js +1 -1
  44. package/dist/server/spread.js.map +1 -1
  45. package/dist/server-dev/attributes.js +1 -5
  46. package/dist/server-dev/attributes.js.map +1 -1
  47. package/dist/server-dev/class-style.js +9 -12
  48. package/dist/server-dev/class-style.js.map +1 -1
  49. package/dist/server-dev/element.js.map +1 -1
  50. package/dist/server-dev/events.js +64 -80
  51. package/dist/server-dev/events.js.map +1 -1
  52. package/dist/server-dev/insert.js +50 -68
  53. package/dist/server-dev/insert.js.map +1 -1
  54. package/dist/server-dev/internal/reconcile.js +19 -2
  55. package/dist/server-dev/internal/reconcile.js.map +1 -1
  56. package/dist/server-dev/spread.js +47 -80
  57. package/dist/server-dev/spread.js.map +1 -1
  58. package/package.json +2 -2
@@ -1,7 +1,7 @@
1
1
  import { leaves } from "./internal/accessor.js";
2
2
  import { checkClaimedText } from "./internal/claim.js";
3
3
  import { claims } from "./internal/hydration-hooks.js";
4
- import { reconcileNodes } from "./internal/reconcile.js";
4
+ import { keepFocus, reconcileNodes } from "./internal/reconcile.js";
5
5
  import { onCleanup, useRenderEffect } from "@shadow-js/core";
6
6
  import { addCleanup, createComputation, currentOwner, disposeOwner, readComputation } from "@shadow-js/core/extend";
7
7
  // src/insert.ts
@@ -120,12 +120,17 @@ function watchCommits(parent, run) {
120
120
  set.delete(run);
121
121
  });
122
122
  }
123
- /** Makes the DOM show `next` for this region. */
124
- function reconcileRegion(region, next) {
123
+ /** Applies a flattened value to a region. */
124
+ function commit(region, parts) {
125
+ if (region.claimed !== void 0) {
126
+ checkClaimedText(region.claimed, parts);
127
+ region.claimed = void 0;
128
+ }
129
+ const next = materialize(region, parts);
125
130
  const parent = region.parent;
126
131
  const attached = region.nodes.filter((node) => node.parentNode === parent);
127
- const end = endOf(region, attached.at(-1));
128
132
  const first = attached[0];
133
+ const end = endOf(region, attached.at(-1));
129
134
  if (next.length === 0 && first !== void 0) region.marker = first.previousSibling;
130
135
  reconcileNodes(parent, attached, next, end);
131
136
  region.nodes = next;
@@ -134,14 +139,6 @@ function reconcileRegion(region, next) {
134
139
  run();
135
140
  });
136
141
  }
137
- /** Applies a flattened value to a region. */
138
- function commit(region, parts) {
139
- if (region.claimed !== void 0) {
140
- checkClaimedText(region.claimed, parts);
141
- region.claimed = void 0;
142
- }
143
- reconcileRegion(region, materialize(region, parts));
144
- }
145
142
  /**
146
143
  * Applies a resolved value to a region. A string or number is the common case (a dynamic text): when the region
147
144
  * already shows its own Text node only the data is rewritten, and an empty region gets one new Text node, with none of
@@ -150,7 +147,7 @@ function commit(region, parts) {
150
147
  function commitValue(region, raw) {
151
148
  if ((typeof raw === "string" || typeof raw === "number") && !region.claimed) {
152
149
  const nodes = region.nodes;
153
- const text = typeof raw === "string" ? raw : String(raw);
150
+ const text = String(raw);
154
151
  if (nodes.length === 1) {
155
152
  const current = nodes[0];
156
153
  if (current instanceof Text && current.parentNode === region.parent && ownsText(region, current)) {
@@ -167,28 +164,25 @@ function commitValue(region, raw) {
167
164
  }
168
165
  commit(region, flatten(raw));
169
166
  }
170
- /** Nodes of `initial` (already in the parent) that the region adopts as its current content. */
171
- function adoptInitial(parent, initial) {
172
- const adopted = [];
173
- const seen = /* @__PURE__ */ new Set();
174
- for (const part of flatten(initial)) {
175
- if (typeof part === "string" || seen.has(part) || part.parentNode !== parent) continue;
176
- seen.add(part);
177
- adopted.push(part);
178
- }
179
- return adopted;
180
- }
181
167
  /**
182
168
  * Creates the state of a region in `parent`. `anchorNode` (null to append) and `initial` (nodes
183
169
  * already in the DOM, from hydration or splitText) are both optional.
184
170
  * @internal
185
171
  */
186
172
  function createRegion(parent, anchorNode, initial) {
187
- const nodes = initial === void 0 ? [] : adoptInitial(parent, initial);
173
+ const nodes = [];
174
+ if (initial !== void 0) {
175
+ const seen = /* @__PURE__ */ new Set();
176
+ for (const part of flatten(initial)) {
177
+ if (typeof part === "string" || seen.has(part) || part.parentNode !== parent) continue;
178
+ seen.add(part);
179
+ nodes.push(part);
180
+ }
181
+ }
188
182
  const region = {
189
183
  parent,
190
184
  anchor: anchorNode,
191
- marker: nodes.length > 0 ? nodes[0]?.previousSibling ?? null : parent.lastChild,
185
+ marker: nodes.length > 0 ? nodes[0].previousSibling : parent.lastChild,
192
186
  nodes,
193
187
  texts: null
194
188
  };
@@ -201,7 +195,9 @@ function createRegion(parent, anchorNode, initial) {
201
195
  * and ends exactly where this one starts, that region gets an empty Text node there as its anchor. Its content then
202
196
  * always goes before that node, and this region's marker is the node, so no region has a marker that a sibling
203
197
  * region can replace: the order of the calls holds however the regions change. A region with static content
204
- * between it and this one needs nothing, because its marker and its end are the static nodes.
198
+ * between it and this one needs nothing, because its marker and its end are the static nodes. (A function of its
199
+ * own, so the cleanup it registers holds nothing but the anchor: a closure made inside `bindRegion` would keep
200
+ * the regions of that call alive as long as the parent's owner.)
205
201
  */
206
202
  function linkRegion(region) {
207
203
  const parent = region.parent;
@@ -236,42 +232,6 @@ function containsFunction(root) {
236
232
  return false;
237
233
  }
238
234
  /**
239
- * One memo per accessor function, owned by `owner` (the effect that evaluates the region's expression,
240
- * so a new result drops them all; the effect that resolves the result runs many times and must not
241
- * own them). `prune` disposes the memos of accessors the last
242
- * run did not meet, which bounds the cache by what the region currently shows.
243
- */
244
- function createCallCache(owner) {
245
- const memos = /* @__PURE__ */ new Map();
246
- let touched = /* @__PURE__ */ new Set();
247
- return {
248
- begin() {
249
- touched = /* @__PURE__ */ new Set();
250
- },
251
- call(fn) {
252
- touched.add(fn);
253
- let node = memos.get(fn);
254
- if (node === void 0) {
255
- node = createComputation({
256
- kind: "memo",
257
- fn: () => fn(),
258
- allowWrites: true,
259
- owner
260
- });
261
- memos.set(fn, node);
262
- }
263
- return readComputation(node);
264
- },
265
- prune() {
266
- for (const [fn, node] of memos) {
267
- if (touched.has(fn)) continue;
268
- memos.delete(fn);
269
- disposeOwner(node);
270
- }
271
- }
272
- };
273
- }
274
- /**
275
235
  * Keeps a region in sync with `value`. A value that is or contains a function (an accessor, or an
276
236
  * array with accessor members) runs inside a render effect, so its reads are tracked. Anything
277
237
  * else is inserted once. `ordered` is for `insert()` without an anchor: a region that keeps changing then keeps
@@ -288,11 +248,31 @@ function bindRegion(region, value, ordered) {
288
248
  useRenderEffect(typeof value === "function" ? value : () => value, (raw) => {
289
249
  latest = raw;
290
250
  if (containsFunction(raw)) {
291
- const cache = createCallCache(currentOwner());
251
+ const owner = currentOwner();
252
+ const memos = /* @__PURE__ */ new Map();
253
+ let touched = /* @__PURE__ */ new Set();
254
+ const call = (fn) => {
255
+ touched.add(fn);
256
+ let node = memos.get(fn);
257
+ if (node === void 0) {
258
+ node = createComputation({
259
+ kind: "memo",
260
+ fn: () => fn(),
261
+ allowWrites: true,
262
+ owner
263
+ });
264
+ memos.set(fn, node);
265
+ }
266
+ return readComputation(node);
267
+ };
292
268
  useRenderEffect(() => {
293
- cache.begin();
294
- const parts = flatten(raw, cache.call);
295
- cache.prune();
269
+ touched = /* @__PURE__ */ new Set();
270
+ const parts = flatten(raw, call);
271
+ for (const [fn, node] of memos) {
272
+ if (touched.has(fn)) continue;
273
+ memos.delete(fn);
274
+ disposeOwner(node);
275
+ }
296
276
  return parts;
297
277
  }, (parts) => {
298
278
  commit(region, parts);
@@ -313,7 +293,9 @@ function bindRegion(region, value, ordered) {
313
293
  */
314
294
  function moveRegion(region, parent, move) {
315
295
  const attached = region.nodes.filter((node) => node.parentNode === region.parent);
316
- for (const node of attached) move(node);
296
+ keepFocus(region.parent, () => {
297
+ for (const node of attached) move(node);
298
+ });
317
299
  region.parent = parent;
318
300
  region.marker = attached[0]?.previousSibling ?? parent.lastChild;
319
301
  }
@@ -1 +1 @@
1
- {"version":3,"file":"insert.js","names":[],"sources":["../../src/insert.ts"],"sourcesContent":["import { onCleanup, useRenderEffect } from \"@shadow-js/core\";\nimport {\n addCleanup,\n type ComputationNode,\n createComputation,\n currentOwner,\n disposeOwner,\n type Owner,\n readComputation,\n} from \"@shadow-js/core/extend\";\nimport { leaves } from \"./internal/accessor\";\nimport { checkClaimedText } from \"./internal/claim\";\nimport { claims } from \"./internal/hydration-hooks\";\nimport { reconcileNodes } from \"./internal/reconcile\";\n\n/** One piece of a value after flattening: a DOM node, or text to be turned into a Text node. */\ntype Part = Node | string;\n\n/**\n * State of one dynamic child region. `nodes` are the DOM nodes the region owns, in order. When\n * `anchor` is set, content goes before it. Without one, an empty region is placed after `marker`\n * (the node that preceded it), so it keeps its position while it is empty. A marker can be a node\n * another region owns and later replaces, so the region created right behind another one on the same parent\n * gives that one an anchor of its own (see `linkRegion`): the marker of every region is then either static\n * content or an anchor nobody replaces.\n * @internal\n */\nexport interface Region {\n readonly parent: Node;\n anchor: Node | null;\n marker: Node | null;\n /** The owner of the effect that keeps a reactive region up to date; unset until then (and for a static region). */\n owner?: Owner | null;\n nodes: Node[];\n /**\n * Text nodes this region created or adopted; only these may be reused by string updates. Null for none, the node\n * itself for one (the usual region: a single dynamic text), a Set for more, so most regions allocate no Set.\n */\n texts: Text | Set<Text> | null;\n /**\n * Development only: the server nodes a hydration pass handed this region, kept until its first\n * commit compares their text with the value (`checkClaimedText`).\n */\n claimed?: readonly Node[] | undefined;\n}\n\n/** The newest reactive unanchored region of each parent: the one the next such region may have to give an anchor. */\nconst tails = new WeakMap<Node, Region>();\n\n/** The document a node belongs to (a Document is its own document). */\nfunction documentOf(node: Node): Document {\n return node instanceof Document ? node : (node.ownerDocument ?? document);\n}\n\n/** True when the region created or adopted `node`. */\nfunction ownsText(region: Region, node: Node): boolean {\n const texts = region.texts;\n return texts === node || (texts instanceof Set && texts.has(node as Text));\n}\n\n/** Records that the region owns `text`. */\nfunction addText(region: Region, text: Text): void {\n const texts = region.texts;\n if (texts === null) region.texts = text;\n else if (texts instanceof Set) texts.add(text);\n else if (texts !== text) region.texts = new Set([texts, text]);\n}\n\n/** Forgets the Text nodes of the region that are not in `keep`. */\nfunction pruneTexts(region: Region, keep: readonly Node[]): void {\n const texts = region.texts;\n if (texts === null) return;\n if (texts instanceof Set) {\n const kept = new Set<Node>(keep);\n for (const text of texts) {\n if (!kept.has(text)) texts.delete(text);\n }\n } else if (!keep.includes(texts)) region.texts = null;\n}\n\n/**\n * The children a fragment held when it was first inserted. Inserting empties a fragment, and an effect\n * that runs again flattens the same fragment value once more: it must still give those nodes.\n */\nconst fragmentChildren = new WeakMap<DocumentFragment, Node[]>();\n\n/**\n * Flattens a value into parts without recursion. Functions are called (and their results unwrapped)\n * through `call`, which runs inside the render effect that owns the value, so reads are tracked.\n */\nfunction flatten(root: unknown, call?: (fn: () => unknown) => unknown): Part[] {\n const parts: Part[] = [];\n const cycle = __DEV__ ? \"insert(): a value contains itself.\" : \"SHADOW_INSERT_CYCLE\";\n for (const item of leaves(root, cycle, call)) {\n if (item === null || item === undefined || typeof item === \"boolean\") continue;\n if (item instanceof DocumentFragment) {\n const kids = fragmentChildren.get(item) ?? [...item.childNodes];\n fragmentChildren.set(item, kids);\n for (const child of kids) parts.push(child);\n } else parts.push(item instanceof Node ? item : String(item)); // strings, numbers and anything else that is text\n }\n return parts;\n}\n\n/** Text nodes the region currently owns, keyed by their data, for reuse by equal strings. */\nfunction reusablePool(region: Region): Map<string, Text[]> {\n const pool = new Map<string, Text[]>();\n for (const node of region.nodes) {\n if (!(node instanceof Text) || !ownsText(region, node)) continue;\n const list = pool.get(node.data);\n if (list === undefined) pool.set(node.data, [node]);\n else list.push(node);\n }\n return pool;\n}\n\n/** Turns parts into the nodes the region should hold, reusing its own Text nodes where possible. */\nfunction materialize(region: Region, parts: readonly Part[]): Node[] {\n const only = parts.length === 1 ? parts[0] : undefined;\n if (typeof only === \"string\") {\n const current = region.nodes.length === 1 ? region.nodes[0] : undefined;\n if (current instanceof Text && ownsText(region, current)) {\n if (current.data !== only) current.data = only;\n return [current];\n }\n }\n // Sized to the parts: `[]` and `push` would reserve room for sixteen nodes in every dynamic child (a row has two).\n const nodes: Node[] = new Array<Node>(parts.length);\n let count = 0;\n const seen = new Set<Node>();\n let pool: Map<string, Text[]> | undefined;\n for (const part of parts) {\n if (typeof part === \"string\") {\n pool ??= reusablePool(region);\n const reused = pool.get(part)?.pop();\n let text = reused;\n if (text === undefined) {\n text = documentOf(region.parent).createTextNode(part);\n addText(region, text);\n }\n seen.add(text);\n nodes[count] = text;\n count += 1;\n } else if (!seen.has(part)) {\n seen.add(part);\n nodes[count] = part;\n count += 1;\n }\n }\n nodes.length = count;\n return nodes;\n}\n\n/** The node after the region: its anchor, or the node after its last attached child (`last`), or its marker. */\nfunction endOf(region: Region, last: Node | undefined): Node | null {\n if (region.anchor !== null) return region.anchor;\n if (last !== undefined) return last.nextSibling;\n const marker = region.marker;\n if (marker === null) return region.parent.firstChild;\n if (marker.parentNode !== region.parent) return null;\n return marker.nextSibling;\n}\n\n/** Callbacks to run after a region of a parent has committed (see `watchCommits`). */\nconst commitWatchers = new WeakMap<Node, Set<() => void>>();\n\n/**\n * Runs `run` after every commit to a region of `parent`, so code that depends on which nodes the\n * parent holds (a name on the first element of a content region) can follow a change of content.\n * The watch ends with the owner that is current when this is called.\n * @internal\n */\nexport function watchCommits(parent: Node, run: () => void): void {\n const set = commitWatchers.get(parent) ?? new Set<() => void>();\n commitWatchers.set(parent, set.add(run));\n onCleanup(() => {\n set.delete(run);\n });\n}\n\n/** Makes the DOM show `next` for this region. */\nfunction reconcileRegion(region: Region, next: Node[]): void {\n const parent = region.parent;\n const attached = region.nodes.filter((node) => node.parentNode === parent);\n const end = endOf(region, attached.at(-1));\n const first = attached[0];\n if (next.length === 0 && first !== undefined) region.marker = first.previousSibling;\n reconcileNodes(parent, attached, next, end);\n region.nodes = next;\n pruneTexts(region, next);\n commitWatchers.get(parent)?.forEach((run) => {\n run();\n });\n}\n\n/** Applies a flattened value to a region. */\nfunction commit(region: Region, parts: readonly Part[]): void {\n if (__DEV__ && region.claimed !== undefined) {\n // Only the first commit of a claimed region is compared; later changes are ordinary updates.\n checkClaimedText(region.claimed, parts);\n region.claimed = undefined;\n }\n reconcileRegion(region, materialize(region, parts));\n}\n\n/**\n * Applies a resolved value to a region. A string or number is the common case (a dynamic text): when the region\n * already shows its own Text node only the data is rewritten, and an empty region gets one new Text node, with none of\n * the flattening and reconciling a general value needs.\n */\nfunction commitValue(region: Region, raw: unknown): void {\n if ((typeof raw === \"string\" || typeof raw === \"number\") && !(__DEV__ && region.claimed)) {\n const nodes = region.nodes;\n const text = typeof raw === \"string\" ? raw : String(raw);\n if (nodes.length === 1) {\n const current = nodes[0];\n if (\n current instanceof Text &&\n current.parentNode === region.parent &&\n ownsText(region, current)\n ) {\n if (current.data !== text) current.data = text;\n return;\n }\n } else if (nodes.length === 0) {\n const created = documentOf(region.parent).createTextNode(text);\n addText(region, created);\n region.parent.insertBefore(created, endOf(region, undefined));\n region.nodes = [created];\n return;\n }\n }\n commit(region, flatten(raw));\n}\n\n/** Nodes of `initial` (already in the parent) that the region adopts as its current content. */\nfunction adoptInitial(parent: Node, initial: unknown): Node[] {\n const adopted: Node[] = [];\n const seen = new Set<Node>();\n for (const part of flatten(initial)) {\n if (typeof part === \"string\" || seen.has(part) || part.parentNode !== parent) continue;\n seen.add(part);\n adopted.push(part);\n }\n return adopted;\n}\n\n/**\n * Creates the state of a region in `parent`. `anchorNode` (null to append) and `initial` (nodes\n * already in the DOM, from hydration or splitText) are both optional.\n * @internal\n */\nexport function createRegion(parent: Node, anchorNode: Node | null, initial: unknown): Region {\n const nodes = initial === undefined ? [] : adoptInitial(parent, initial);\n const marker = nodes.length > 0 ? (nodes[0]?.previousSibling ?? null) : parent.lastChild;\n const region: Region = {\n parent,\n anchor: anchorNode,\n marker,\n nodes,\n texts: null,\n };\n for (const node of nodes) if (node instanceof Text) addText(region, node);\n // A region that adopts server nodes during a hydration pass is checked against its first commit.\n if (__DEV__ && initial !== undefined && claims.current.isClaiming()) region.claimed = nodes;\n return region;\n}\n\n/**\n * Called for a region that keeps changing and has no anchor. When the previous such region of the parent is alive\n * and ends exactly where this one starts, that region gets an empty Text node there as its anchor. Its content then\n * always goes before that node, and this region's marker is the node, so no region has a marker that a sibling\n * region can replace: the order of the calls holds however the regions change. A region with static content\n * between it and this one needs nothing, because its marker and its end are the static nodes.\n */\nfunction linkRegion(region: Region): void {\n const parent = region.parent;\n const tail = tails.get(parent);\n region.owner = currentOwner();\n tails.set(parent, region);\n const start = region.nodes[0] ?? null;\n if (tail === undefined || tail.owner?.disposed || endOf(tail, tail.nodes.at(-1)) !== start)\n return;\n const text = anchor(parent, start);\n tail.anchor = region.marker = text;\n // The anchor is the tail's alone and goes with it, so a region replaced by another one over and over adds\n // nothing to the parent. The region behind it, if empty, is then placed at the end like any region whose marker\n // is gone.\n if (tail.owner) addCleanup(tail.owner, () => text.remove());\n}\n\n/**\n * True when a function appears anywhere in `root`, at any array depth. Scans without calling\n * anything; `seen` stops it from looping on cyclic arrays (flatten reports those).\n */\nfunction containsFunction(root: unknown): boolean {\n if (typeof root === \"function\") return true;\n if (!Array.isArray(root)) return false;\n const stack: unknown[][] = [root];\n const seen = new Set<unknown[]>([root]);\n while (stack.length > 0) {\n const frame = stack.pop() as unknown[];\n for (const item of frame) {\n if (typeof item === \"function\") return true;\n if (Array.isArray(item) && !seen.has(item)) {\n seen.add(item);\n stack.push(item);\n }\n }\n }\n return false;\n}\n\n/**\n * One memo per accessor function, owned by `owner` (the effect that evaluates the region's expression,\n * so a new result drops them all; the effect that resolves the result runs many times and must not\n * own them). `prune` disposes the memos of accessors the last\n * run did not meet, which bounds the cache by what the region currently shows.\n */\nfunction createCallCache(owner: ReturnType<typeof currentOwner>): {\n begin(): void;\n call(fn: () => unknown): unknown;\n prune(): void;\n} {\n const memos = new Map<() => unknown, ComputationNode>();\n let touched = new Set<() => unknown>();\n return {\n begin(): void {\n touched = new Set();\n },\n call(fn: () => unknown): unknown {\n touched.add(fn);\n let node = memos.get(fn);\n if (node === undefined) {\n // Component setup runs inside these memos, which may write the state it owns.\n node = createComputation({ kind: \"memo\", fn: () => fn(), allowWrites: true, owner });\n memos.set(fn, node);\n }\n return readComputation(node);\n },\n prune(): void {\n for (const [fn, node] of memos) {\n if (touched.has(fn)) continue;\n memos.delete(fn);\n disposeOwner(node);\n }\n },\n };\n}\n\n/**\n * Keeps a region in sync with `value`. A value that is or contains a function (an accessor, or an\n * array with accessor members) runs inside a render effect, so its reads are tracked. Anything\n * else is inserted once. `ordered` is for `insert()` without an anchor: a region that keeps changing then keeps\n * its place among the other such regions of its parent (see `linkRegion`).\n * @internal\n */\nexport function bindRegion(region: Region, value: unknown, ordered?: boolean): unknown {\n if (!containsFunction(value)) {\n commitValue(region, value);\n return value instanceof DocumentFragment ? [...region.nodes] : value;\n }\n let latest: unknown;\n if (ordered === true) linkRegion(region);\n const accessor = typeof value === \"function\" ? (value as () => unknown) : () => value;\n // Every accessor met while resolving the result is evaluated by a memo of its own, kept between\n // runs. An accessor that builds components (`() => show() ? <Late /> : null`) then runs again\n // only when what it reads changes, not whenever something it returned (the component's own\n // accessor, reading its own data) does.\n // Two stages. The outer effect runs the expression and tracks only what the expression itself\n // reads. When the result holds accessors (a component returned one, or `props.children` did),\n // a nested effect resolves them, so a change inside the result re-renders the result but never\n // re-runs the expression: re-running `() => props.children` would build the child components\n // again, discarding their state.\n useRenderEffect(accessor, (raw) => {\n latest = raw;\n if (containsFunction(raw)) {\n const cache = createCallCache(currentOwner());\n useRenderEffect(\n () => {\n cache.begin();\n const parts = flatten(raw, cache.call);\n cache.prune();\n return parts;\n },\n (parts) => {\n commit(region, parts);\n },\n );\n } else {\n commitValue(region, raw);\n }\n });\n return latest;\n}\n\n/**\n * Moves a region to a new parent: its nodes still in the old parent go through `move` (which puts\n * each at the end of `parent`), and later commits reconcile there. The region keeps its effects, so\n * what it shows is not built again. Only for a region without an anchor.\n * @param region The region to move.\n * @param parent The node that receives the region's nodes.\n * @param move Puts one node at the end of `parent` (`appendChild`, or `moveBefore` where it exists).\n * @since 1.0.3\n * @internal\n */\nexport function moveRegion(region: Region, parent: Node, move: (node: Node) => void): void {\n const attached = region.nodes.filter((node) => node.parentNode === region.parent);\n for (const node of attached) move(node);\n // Read-only for everyone else: only a move changes where a region lives.\n (region as { parent: Node }).parent = parent;\n region.marker = attached[0]?.previousSibling ?? parent.lastChild;\n}\n\n/**\n * Removes a region's nodes from its parent. Anchors and nodes that were moved elsewhere are not\n * touched.\n * @internal\n */\nexport function removeRegion(region: Region): void {\n for (const node of region.nodes) {\n if (node.parentNode === region.parent) region.parent.removeChild(node);\n }\n region.nodes = [];\n region.texts = null;\n}\n\n/**\n * Creates a text anchor: an empty Text node placed before `before` (appended when null). Use it as\n * the stable insertion point between two dynamic regions; it is never removed by the runtime.\n *\n * @param parent Node that receives the anchor.\n * @param before Node the anchor goes before, or null to append.\n * @returns The new empty Text node.\n * @example\n * import { anchor, insert } from \"@shadow-js/web\";\n *\n * const list = document.createElement(\"ul\");\n * const slot = anchor(list, null);\n * insert(list, \"first\", slot); // goes before the anchor\n * @see insert\n * @since 1.0.0\n */\nexport function anchor(parent: Node, before: Node | null): Text {\n const text = documentOf(parent).createTextNode(\"\");\n parent.insertBefore(text, before);\n return text;\n}\n\n/**\n * Reactive child insertion: keeps the content of a region in sync with `value`.\n *\n * - A function is an accessor, wrapped in a render effect; it re-runs when its dependencies change.\n * - `null`, `undefined`, booleans render nothing. Strings and numbers become one Text node, reused\n * when the region already holds one. A Node is inserted itself. A DocumentFragment inserts a\n * snapshot of its children. Arrays are flattened, nested arrays included.\n * - Content goes before `anchorNode`, or at the end when it is null or omitted. Regions without an\n * anchor on one parent keep the order of the calls, whatever they show and however often a sibling\n * region replaces its nodes: when a reactive region is created right where the previous one ends, the\n * previous one gets an empty Text node as its anchor there (removed again when that region is disposed).\n * - Arrays are reconciled in place: nodes that remain are never removed and re-added.\n * - `initial` lists nodes already in the DOM (from hydration or splitText) so nothing is recreated.\n * - During `hydrate()`, a region that adopted server text is compared with its first commit: in\n * development, different text warns `HYDRATION_TEXT_MISMATCH` (on the console and in devtools) and\n * the region shows the value computed by the client.\n *\n * @param parent Node that holds the region.\n * @param value The value or an accessor returning it.\n * @param anchorNode Node the content goes before; null or omitted appends.\n * @param initial Nodes already in place for this region. Undefined adopts the server's nodes while\n * hydrating and starts empty otherwise.\n * @returns The value as accepted (a fragment yields the array of its nodes).\n * @throws TypeError (production message `SHADOW_INSERT_CYCLE`) when an array contains itself, and\n * (`SHADOW_INSERT_DEPTH`) when an accessor returns accessors more than 10,000 levels deep. When the\n * value is reactive, the error is raised inside its render effect and goes to the owner's error\n * handler, like any effect error.\n * @example\n * import { useSignal } from \"@shadow-js/core\";\n * import { anchor, insert } from \"@shadow-js/web\";\n *\n * const list = document.createElement(\"ul\");\n * const end = anchor(list, null);\n * const [items] = useSignal([\"a\", \"b\"]);\n * insert(list, () => items().map((name) => document.createTextNode(name)), end);\n * @see anchor\n * @since 1.0.0\n */\nexport function insert(\n parent: Node,\n value: unknown,\n anchorNode?: Node | null,\n initial?: unknown,\n): unknown {\n const resolvedAnchor = anchorNode ?? null;\n const adopted =\n initial === undefined ? claims.current.takeRegion(parent, resolvedAnchor) : initial;\n const region = createRegion(parent, resolvedAnchor, adopted);\n return bindRegion(region, value, resolvedAnchor === null);\n}\n"],"mappings":";;;;;;;;AA+CA,MAAM,wBAAQ,IAAI,QAAsB;;AAGxC,SAAS,WAAW,MAAsB;CACxC,OAAO,gBAAgB,WAAW,OAAQ,KAAK,iBAAiB;AAClE;;AAGA,SAAS,SAAS,QAAgB,MAAqB;CACrD,MAAM,QAAQ,OAAO;CACrB,OAAO,UAAU,QAAS,iBAAiB,OAAO,MAAM,IAAI,IAAY;AAC1E;;AAGA,SAAS,QAAQ,QAAgB,MAAkB;CACjD,MAAM,QAAQ,OAAO;CACrB,IAAI,UAAU,MAAM,OAAO,QAAQ;MAC9B,IAAI,iBAAiB,KAAK,MAAM,IAAI,IAAI;MACxC,IAAI,UAAU,MAAM,OAAO,wBAAQ,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC;AAC/D;;AAGA,SAAS,WAAW,QAAgB,MAA6B;CAC/D,MAAM,QAAQ,OAAO;CACrB,IAAI,UAAU,MAAM;CACpB,IAAI,iBAAiB,KAAK;EACxB,MAAM,OAAO,IAAI,IAAU,IAAI;EAC/B,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,KAAK,IAAI,IAAI,GAAG,MAAM,OAAO,IAAI;CAE1C,OAAO,IAAI,CAAC,KAAK,SAAS,KAAK,GAAG,OAAO,QAAQ;AACnD;;;;;AAMA,MAAM,mCAAmB,IAAI,QAAkC;;;;;AAM/D,SAAS,QAAQ,MAAe,MAA+C;CAC7E,MAAM,QAAgB,CAAC;CAEvB,KAAK,MAAM,QAAQ,OAAO,MAAM,sCAAO,IAAI,GAAG;EAC5C,IAAI,SAAS,QAAQ,SAAS,KAAA,KAAa,OAAO,SAAS,WAAW;EACtE,IAAI,gBAAgB,kBAAkB;GACpC,MAAM,OAAO,iBAAiB,IAAI,IAAI,KAAK,CAAC,GAAG,KAAK,UAAU;GAC9D,iBAAiB,IAAI,MAAM,IAAI;GAC/B,KAAK,MAAM,SAAS,MAAM,MAAM,KAAK,KAAK;EAC5C,OAAO,MAAM,KAAK,gBAAgB,OAAO,OAAO,OAAO,IAAI,CAAC;CAC9D;CACA,OAAO;AACT;;AAGA,SAAS,aAAa,QAAqC;CACzD,MAAM,uBAAO,IAAI,IAAoB;CACrC,KAAK,MAAM,QAAQ,OAAO,OAAO;EAC/B,IAAI,EAAE,gBAAgB,SAAS,CAAC,SAAS,QAAQ,IAAI,GAAG;EACxD,MAAM,OAAO,KAAK,IAAI,KAAK,IAAI;EAC/B,IAAI,SAAS,KAAA,GAAW,KAAK,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC;OAC7C,KAAK,KAAK,IAAI;CACrB;CACA,OAAO;AACT;;AAGA,SAAS,YAAY,QAAgB,OAAgC;CACnE,MAAM,OAAO,MAAM,WAAW,IAAI,MAAM,KAAK,KAAA;CAC7C,IAAI,OAAO,SAAS,UAAU;EAC5B,MAAM,UAAU,OAAO,MAAM,WAAW,IAAI,OAAO,MAAM,KAAK,KAAA;EAC9D,IAAI,mBAAmB,QAAQ,SAAS,QAAQ,OAAO,GAAG;GACxD,IAAI,QAAQ,SAAS,MAAM,QAAQ,OAAO;GAC1C,OAAO,CAAC,OAAO;EACjB;CACF;CAEA,MAAM,QAAgB,IAAI,MAAY,MAAM,MAAM;CAClD,IAAI,QAAQ;CACZ,MAAM,uBAAO,IAAI,IAAU;CAC3B,IAAI;CACJ,KAAK,MAAM,QAAQ,OACjB,IAAI,OAAO,SAAS,UAAU;EAC5B,SAAS,aAAa,MAAM;EAE5B,IAAI,OADW,KAAK,IAAI,IAAI,CAAC,EAAE,IAAI;EAEnC,IAAI,SAAS,KAAA,GAAW;GACtB,OAAO,WAAW,OAAO,MAAM,CAAC,CAAC,eAAe,IAAI;GACpD,QAAQ,QAAQ,IAAI;EACtB;EACA,KAAK,IAAI,IAAI;EACb,MAAM,SAAS;EACf,SAAS;CACX,OAAO,IAAI,CAAC,KAAK,IAAI,IAAI,GAAG;EAC1B,KAAK,IAAI,IAAI;EACb,MAAM,SAAS;EACf,SAAS;CACX;CAEF,MAAM,SAAS;CACf,OAAO;AACT;;AAGA,SAAS,MAAM,QAAgB,MAAqC;CAClE,IAAI,OAAO,WAAW,MAAM,OAAO,OAAO;CAC1C,IAAI,SAAS,KAAA,GAAW,OAAO,KAAK;CACpC,MAAM,SAAS,OAAO;CACtB,IAAI,WAAW,MAAM,OAAO,OAAO,OAAO;CAC1C,IAAI,OAAO,eAAe,OAAO,QAAQ,OAAO;CAChD,OAAO,OAAO;AAChB;;AAGA,MAAM,iCAAiB,IAAI,QAA+B;;;;;;;AAQ1D,SAAgB,aAAa,QAAc,KAAuB;CAChE,MAAM,MAAM,eAAe,IAAI,MAAM,qBAAK,IAAI,IAAgB;CAC9D,eAAe,IAAI,QAAQ,IAAI,IAAI,GAAG,CAAC;CACvC,gBAAgB;EACd,IAAI,OAAO,GAAG;CAChB,CAAC;AACH;;AAGA,SAAS,gBAAgB,QAAgB,MAAoB;CAC3D,MAAM,SAAS,OAAO;CACtB,MAAM,WAAW,OAAO,MAAM,QAAQ,SAAS,KAAK,eAAe,MAAM;CACzE,MAAM,MAAM,MAAM,QAAQ,SAAS,GAAG,EAAE,CAAC;CACzC,MAAM,QAAQ,SAAS;CACvB,IAAI,KAAK,WAAW,KAAK,UAAU,KAAA,GAAW,OAAO,SAAS,MAAM;CACpE,eAAe,QAAQ,UAAU,MAAM,GAAG;CAC1C,OAAO,QAAQ;CACf,WAAW,QAAQ,IAAI;CACvB,eAAe,IAAI,MAAM,CAAC,EAAE,SAAS,QAAQ;EAC3C,IAAI;CACN,CAAC;AACH;;AAGA,SAAS,OAAO,QAAgB,OAA8B;CAC5D,IAAe,OAAO,YAAY,KAAA,GAAW;EAE3C,iBAAiB,OAAO,SAAS,KAAK;EACtC,OAAO,UAAU,KAAA;CACnB;CACA,gBAAgB,QAAQ,YAAY,QAAQ,KAAK,CAAC;AACpD;;;;;;AAOA,SAAS,YAAY,QAAgB,KAAoB;CACvD,KAAK,OAAO,QAAQ,YAAY,OAAO,QAAQ,aAAa,CAAa,OAAO,SAAU;EACxF,MAAM,QAAQ,OAAO;EACrB,MAAM,OAAO,OAAO,QAAQ,WAAW,MAAM,OAAO,GAAG;EACvD,IAAI,MAAM,WAAW,GAAG;GACtB,MAAM,UAAU,MAAM;GACtB,IACE,mBAAmB,QACnB,QAAQ,eAAe,OAAO,UAC9B,SAAS,QAAQ,OAAO,GACxB;IACA,IAAI,QAAQ,SAAS,MAAM,QAAQ,OAAO;IAC1C;GACF;EACF,OAAO,IAAI,MAAM,WAAW,GAAG;GAC7B,MAAM,UAAU,WAAW,OAAO,MAAM,CAAC,CAAC,eAAe,IAAI;GAC7D,QAAQ,QAAQ,OAAO;GACvB,OAAO,OAAO,aAAa,SAAS,MAAM,QAAQ,KAAA,CAAS,CAAC;GAC5D,OAAO,QAAQ,CAAC,OAAO;GACvB;EACF;CACF;CACA,OAAO,QAAQ,QAAQ,GAAG,CAAC;AAC7B;;AAGA,SAAS,aAAa,QAAc,SAA0B;CAC5D,MAAM,UAAkB,CAAC;CACzB,MAAM,uBAAO,IAAI,IAAU;CAC3B,KAAK,MAAM,QAAQ,QAAQ,OAAO,GAAG;EACnC,IAAI,OAAO,SAAS,YAAY,KAAK,IAAI,IAAI,KAAK,KAAK,eAAe,QAAQ;EAC9E,KAAK,IAAI,IAAI;EACb,QAAQ,KAAK,IAAI;CACnB;CACA,OAAO;AACT;;;;;;AAOA,SAAgB,aAAa,QAAc,YAAyB,SAA0B;CAC5F,MAAM,QAAQ,YAAY,KAAA,IAAY,CAAC,IAAI,aAAa,QAAQ,OAAO;CAEvE,MAAM,SAAiB;EACrB;EACA,QAAQ;EACR,QAJa,MAAM,SAAS,IAAK,MAAM,EAAE,EAAE,mBAAmB,OAAQ,OAAO;EAK7E;EACA,OAAO;CACT;CACA,KAAK,MAAM,QAAQ,OAAO,IAAI,gBAAgB,MAAM,QAAQ,QAAQ,IAAI;CAExE,IAAe,YAAY,KAAA,KAAa,OAAO,QAAQ,WAAW,GAAG,OAAO,UAAU;CACtF,OAAO;AACT;;;;;;;;AASA,SAAS,WAAW,QAAsB;CACxC,MAAM,SAAS,OAAO;CACtB,MAAM,OAAO,MAAM,IAAI,MAAM;CAC7B,OAAO,QAAQ,aAAa;CAC5B,MAAM,IAAI,QAAQ,MAAM;CACxB,MAAM,QAAQ,OAAO,MAAM,MAAM;CACjC,IAAI,SAAS,KAAA,KAAa,KAAK,OAAO,YAAY,MAAM,MAAM,KAAK,MAAM,GAAG,EAAE,CAAC,MAAM,OACnF;CACF,MAAM,OAAO,OAAO,QAAQ,KAAK;CACjC,KAAK,SAAS,OAAO,SAAS;CAI9B,IAAI,KAAK,OAAO,WAAW,KAAK,aAAa,KAAK,OAAO,CAAC;AAC5D;;;;;AAMA,SAAS,iBAAiB,MAAwB;CAChD,IAAI,OAAO,SAAS,YAAY,OAAO;CACvC,IAAI,CAAC,MAAM,QAAQ,IAAI,GAAG,OAAO;CACjC,MAAM,QAAqB,CAAC,IAAI;CAChC,MAAM,uBAAO,IAAI,IAAe,CAAC,IAAI,CAAC;CACtC,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,QAAQ,MAAM,IAAI;EACxB,KAAK,MAAM,QAAQ,OAAO;GACxB,IAAI,OAAO,SAAS,YAAY,OAAO;GACvC,IAAI,MAAM,QAAQ,IAAI,KAAK,CAAC,KAAK,IAAI,IAAI,GAAG;IAC1C,KAAK,IAAI,IAAI;IACb,MAAM,KAAK,IAAI;GACjB;EACF;CACF;CACA,OAAO;AACT;;;;;;;AAQA,SAAS,gBAAgB,OAIvB;CACA,MAAM,wBAAQ,IAAI,IAAoC;CACtD,IAAI,0BAAU,IAAI,IAAmB;CACrC,OAAO;EACL,QAAc;GACZ,0BAAU,IAAI,IAAI;EACpB;EACA,KAAK,IAA4B;GAC/B,QAAQ,IAAI,EAAE;GACd,IAAI,OAAO,MAAM,IAAI,EAAE;GACvB,IAAI,SAAS,KAAA,GAAW;IAEtB,OAAO,kBAAkB;KAAE,MAAM;KAAQ,UAAU,GAAG;KAAG,aAAa;KAAM;IAAM,CAAC;IACnF,MAAM,IAAI,IAAI,IAAI;GACpB;GACA,OAAO,gBAAgB,IAAI;EAC7B;EACA,QAAc;GACZ,KAAK,MAAM,CAAC,IAAI,SAAS,OAAO;IAC9B,IAAI,QAAQ,IAAI,EAAE,GAAG;IACrB,MAAM,OAAO,EAAE;IACf,aAAa,IAAI;GACnB;EACF;CACF;AACF;;;;;;;;AASA,SAAgB,WAAW,QAAgB,OAAgB,SAA4B;CACrF,IAAI,CAAC,iBAAiB,KAAK,GAAG;EAC5B,YAAY,QAAQ,KAAK;EACzB,OAAO,iBAAiB,mBAAmB,CAAC,GAAG,OAAO,KAAK,IAAI;CACjE;CACA,IAAI;CACJ,IAAI,YAAY,MAAM,WAAW,MAAM;CAWvC,gBAViB,OAAO,UAAU,aAAc,cAAgC,QAUrD,QAAQ;EACjC,SAAS;EACT,IAAI,iBAAiB,GAAG,GAAG;GACzB,MAAM,QAAQ,gBAAgB,aAAa,CAAC;GAC5C,sBACQ;IACJ,MAAM,MAAM;IACZ,MAAM,QAAQ,QAAQ,KAAK,MAAM,IAAI;IACrC,MAAM,MAAM;IACZ,OAAO;GACT,IACC,UAAU;IACT,OAAO,QAAQ,KAAK;GACtB,CACF;EACF,OACE,YAAY,QAAQ,GAAG;CAE3B,CAAC;CACD,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,WAAW,QAAgB,QAAc,MAAkC;CACzF,MAAM,WAAW,OAAO,MAAM,QAAQ,SAAS,KAAK,eAAe,OAAO,MAAM;CAChF,KAAK,MAAM,QAAQ,UAAU,KAAK,IAAI;CAEtC,OAA6B,SAAS;CACtC,OAAO,SAAS,SAAS,EAAE,EAAE,mBAAmB,OAAO;AACzD;;;;;;AAOA,SAAgB,aAAa,QAAsB;CACjD,KAAK,MAAM,QAAQ,OAAO,OACxB,IAAI,KAAK,eAAe,OAAO,QAAQ,OAAO,OAAO,YAAY,IAAI;CAEvE,OAAO,QAAQ,CAAC;CAChB,OAAO,QAAQ;AACjB;;;;;;;;;;;;;;;;;AAkBA,SAAgB,OAAO,QAAc,QAA2B;CAC9D,MAAM,OAAO,WAAW,MAAM,CAAC,CAAC,eAAe,EAAE;CACjD,OAAO,aAAa,MAAM,MAAM;CAChC,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwCA,SAAgB,OACd,QACA,OACA,YACA,SACS;CACT,MAAM,iBAAiB,cAAc;CAIrC,OAAO,WADQ,aAAa,QAAQ,gBADlC,YAAY,KAAA,IAAY,OAAO,QAAQ,WAAW,QAAQ,cAAc,IAAI,OAEvD,GAAG,OAAO,mBAAmB,IAAI;AAC1D"}
1
+ {"version":3,"file":"insert.js","names":[],"sources":["../../src/insert.ts"],"sourcesContent":["import { onCleanup, useRenderEffect } from \"@shadow-js/core\";\nimport {\n addCleanup,\n type ComputationNode,\n createComputation,\n currentOwner,\n disposeOwner,\n type Owner,\n readComputation,\n} from \"@shadow-js/core/extend\";\nimport { leaves } from \"./internal/accessor\";\nimport { checkClaimedText } from \"./internal/claim\";\nimport { claims } from \"./internal/hydration-hooks\";\nimport { keepFocus, reconcileNodes } from \"./internal/reconcile\";\n\n/** One piece of a value after flattening: a DOM node, or text to be turned into a Text node. */\ntype Part = Node | string;\n\n/**\n * State of one dynamic child region. `nodes` are the DOM nodes the region owns, in order. When\n * `anchor` is set, content goes before it. Without one, an empty region is placed after `marker`\n * (the node that preceded it), so it keeps its position while it is empty. A marker can be a node\n * another region owns and later replaces, so the region created right behind another one on the same parent\n * gives that one an anchor of its own (see `linkRegion`): the marker of every region is then either static\n * content or an anchor nobody replaces.\n * @internal\n */\nexport interface Region {\n readonly parent: Node;\n anchor: Node | null;\n marker: Node | null;\n /** The owner of the effect that keeps a reactive region up to date; unset until then (and for a static region). */\n owner?: Owner | null;\n nodes: Node[];\n /**\n * Text nodes this region created or adopted; only these may be reused by string updates. Null for none, the node\n * itself for one (the usual region: a single dynamic text), a Set for more, so most regions allocate no Set.\n */\n texts: Text | Set<Text> | null;\n /**\n * Development only: the server nodes a hydration pass handed this region, kept until its first\n * commit compares their text with the value (`checkClaimedText`).\n */\n claimed?: readonly Node[] | undefined;\n}\n\n/** The newest reactive unanchored region of each parent: the one the next such region may have to give an anchor. */\nconst tails = new WeakMap<Node, Region>();\n\n/** The document a node belongs to (a Document is its own document). */\nfunction documentOf(node: Node): Document {\n return node instanceof Document ? node : (node.ownerDocument ?? document);\n}\n\n/** True when the region created or adopted `node`. */\nfunction ownsText(region: Region, node: Node): boolean {\n const texts = region.texts;\n return texts === node || (texts instanceof Set && texts.has(node as Text));\n}\n\n/** Records that the region owns `text`. */\nfunction addText(region: Region, text: Text): void {\n const texts = region.texts;\n if (texts === null) region.texts = text;\n else if (texts instanceof Set) texts.add(text);\n else if (texts !== text) region.texts = new Set([texts, text]);\n}\n\n/** Forgets the Text nodes of the region that are not in `keep`. */\nfunction pruneTexts(region: Region, keep: readonly Node[]): void {\n const texts = region.texts;\n if (texts === null) return;\n if (texts instanceof Set) {\n const kept = new Set<Node>(keep);\n for (const text of texts) {\n if (!kept.has(text)) texts.delete(text);\n }\n } else if (!keep.includes(texts)) region.texts = null;\n}\n\n/**\n * The children a fragment held when it was first inserted. Inserting empties a fragment, and an effect\n * that runs again flattens the same fragment value once more: it must still give those nodes.\n */\nconst fragmentChildren = new WeakMap<DocumentFragment, Node[]>();\n\n/**\n * Flattens a value into parts without recursion. Functions are called (and their results unwrapped)\n * through `call`, which runs inside the render effect that owns the value, so reads are tracked.\n */\nfunction flatten(root: unknown, call?: (fn: () => unknown) => unknown): Part[] {\n const parts: Part[] = [];\n const cycle = __DEV__ ? \"insert(): a value contains itself.\" : \"SHADOW_INSERT_CYCLE\";\n for (const item of leaves(root, cycle, call)) {\n if (item === null || item === undefined || typeof item === \"boolean\") continue;\n if (item instanceof DocumentFragment) {\n const kids = fragmentChildren.get(item) ?? [...item.childNodes];\n fragmentChildren.set(item, kids);\n for (const child of kids) parts.push(child);\n } else parts.push(item instanceof Node ? item : String(item)); // strings, numbers and anything else that is text\n }\n return parts;\n}\n\n/** Text nodes the region currently owns, keyed by their data, for reuse by equal strings. */\nfunction reusablePool(region: Region): Map<string, Text[]> {\n const pool = new Map<string, Text[]>();\n for (const node of region.nodes) {\n if (!(node instanceof Text) || !ownsText(region, node)) continue;\n const list = pool.get(node.data);\n if (list === undefined) pool.set(node.data, [node]);\n else list.push(node);\n }\n return pool;\n}\n\n/** Turns parts into the nodes the region should hold, reusing its own Text nodes where possible. */\nfunction materialize(region: Region, parts: readonly Part[]): Node[] {\n const only = parts.length === 1 ? parts[0] : undefined;\n if (typeof only === \"string\") {\n const current = region.nodes.length === 1 ? region.nodes[0] : undefined;\n if (current instanceof Text && ownsText(region, current)) {\n if (current.data !== only) current.data = only;\n return [current];\n }\n }\n // Sized to the parts: `[]` and `push` would reserve room for sixteen nodes in every dynamic child (a row has two).\n const nodes: Node[] = new Array<Node>(parts.length);\n let count = 0;\n const seen = new Set<Node>();\n let pool: Map<string, Text[]> | undefined;\n for (const part of parts) {\n if (typeof part === \"string\") {\n pool ??= reusablePool(region);\n const reused = pool.get(part)?.pop();\n let text = reused;\n if (text === undefined) {\n text = documentOf(region.parent).createTextNode(part);\n addText(region, text);\n }\n seen.add(text);\n nodes[count] = text;\n count += 1;\n } else if (!seen.has(part)) {\n seen.add(part);\n nodes[count] = part;\n count += 1;\n }\n }\n nodes.length = count;\n return nodes;\n}\n\n/** The node after the region: its anchor, or the node after its last attached child (`last`), or its marker. */\nfunction endOf(region: Region, last: Node | undefined): Node | null {\n if (region.anchor !== null) return region.anchor;\n if (last !== undefined) return last.nextSibling;\n const marker = region.marker;\n if (marker === null) return region.parent.firstChild;\n if (marker.parentNode !== region.parent) return null;\n return marker.nextSibling;\n}\n\n/** Callbacks to run after a region of a parent has committed (see `watchCommits`). */\nconst commitWatchers = new WeakMap<Node, Set<() => void>>();\n\n/**\n * Runs `run` after every commit to a region of `parent`, so code that depends on which nodes the\n * parent holds (a name on the first element of a content region) can follow a change of content.\n * The watch ends with the owner that is current when this is called.\n * @internal\n */\nexport function watchCommits(parent: Node, run: () => void): void {\n const set = commitWatchers.get(parent) ?? new Set<() => void>();\n commitWatchers.set(parent, set.add(run));\n onCleanup(() => {\n set.delete(run);\n });\n}\n\n/** Applies a flattened value to a region. */\nfunction commit(region: Region, parts: readonly Part[]): void {\n if (__DEV__ && region.claimed !== undefined) {\n // Only the first commit of a claimed region is compared; later changes are ordinary updates.\n checkClaimedText(region.claimed, parts);\n region.claimed = undefined;\n }\n // Makes the DOM show the new nodes for this region.\n const next = materialize(region, parts);\n const parent = region.parent;\n const attached = region.nodes.filter((node) => node.parentNode === parent);\n const first = attached[0];\n const end = endOf(region, attached.at(-1));\n if (next.length === 0 && first !== undefined) region.marker = first.previousSibling;\n reconcileNodes(parent, attached, next, end);\n region.nodes = next;\n pruneTexts(region, next);\n commitWatchers.get(parent)?.forEach((run) => {\n run();\n });\n}\n\n/**\n * Applies a resolved value to a region. A string or number is the common case (a dynamic text): when the region\n * already shows its own Text node only the data is rewritten, and an empty region gets one new Text node, with none of\n * the flattening and reconciling a general value needs.\n */\nfunction commitValue(region: Region, raw: unknown): void {\n if ((typeof raw === \"string\" || typeof raw === \"number\") && !(__DEV__ && region.claimed)) {\n const nodes = region.nodes;\n const text = String(raw);\n if (nodes.length === 1) {\n const current = nodes[0];\n if (\n current instanceof Text &&\n current.parentNode === region.parent &&\n ownsText(region, current)\n ) {\n if (current.data !== text) current.data = text;\n return;\n }\n } else if (nodes.length === 0) {\n const created = documentOf(region.parent).createTextNode(text);\n addText(region, created);\n region.parent.insertBefore(created, endOf(region, undefined));\n region.nodes = [created];\n return;\n }\n }\n commit(region, flatten(raw));\n}\n\n/**\n * Creates the state of a region in `parent`. `anchorNode` (null to append) and `initial` (nodes\n * already in the DOM, from hydration or splitText) are both optional.\n * @internal\n */\nexport function createRegion(parent: Node, anchorNode: Node | null, initial: unknown): Region {\n // The nodes of `initial` (already in the parent) that the region adopts as its current content.\n const nodes: Node[] = [];\n if (initial !== undefined) {\n const seen = new Set<Node>();\n for (const part of flatten(initial)) {\n if (typeof part === \"string\" || seen.has(part) || part.parentNode !== parent) continue;\n seen.add(part);\n nodes.push(part);\n }\n }\n const marker = nodes.length > 0 ? (nodes[0] as Node).previousSibling : parent.lastChild;\n const region: Region = {\n parent,\n anchor: anchorNode,\n marker,\n nodes,\n texts: null,\n };\n for (const node of nodes) if (node instanceof Text) addText(region, node);\n // A region that adopts server nodes during a hydration pass is checked against its first commit.\n if (__DEV__ && initial !== undefined && claims.current.isClaiming()) region.claimed = nodes;\n return region;\n}\n\n/**\n * Called for a region that keeps changing and has no anchor. When the previous such region of the parent is alive\n * and ends exactly where this one starts, that region gets an empty Text node there as its anchor. Its content then\n * always goes before that node, and this region's marker is the node, so no region has a marker that a sibling\n * region can replace: the order of the calls holds however the regions change. A region with static content\n * between it and this one needs nothing, because its marker and its end are the static nodes. (A function of its\n * own, so the cleanup it registers holds nothing but the anchor: a closure made inside `bindRegion` would keep\n * the regions of that call alive as long as the parent's owner.)\n */\nfunction linkRegion(region: Region): void {\n const parent = region.parent;\n const tail = tails.get(parent);\n region.owner = currentOwner();\n tails.set(parent, region);\n const start = region.nodes[0] ?? null;\n if (tail === undefined || tail.owner?.disposed || endOf(tail, tail.nodes.at(-1)) !== start)\n return;\n const text = anchor(parent, start);\n tail.anchor = region.marker = text;\n // The anchor is the tail's alone and goes with it, so a region replaced by another one over and over adds\n // nothing to the parent. The region behind it, if empty, is then placed at the end like any region whose marker\n // is gone.\n if (tail.owner) addCleanup(tail.owner, () => text.remove());\n}\n\n/**\n * True when a function appears anywhere in `root`, at any array depth. Scans without calling\n * anything; `seen` stops it from looping on cyclic arrays (flatten reports those).\n */\nfunction containsFunction(root: unknown): boolean {\n if (typeof root === \"function\") return true;\n if (!Array.isArray(root)) return false;\n const stack: unknown[][] = [root];\n const seen = new Set<unknown[]>([root]);\n while (stack.length > 0) {\n const frame = stack.pop() as unknown[];\n for (const item of frame) {\n if (typeof item === \"function\") return true;\n if (Array.isArray(item) && !seen.has(item)) {\n seen.add(item);\n stack.push(item);\n }\n }\n }\n return false;\n}\n\n/**\n * Keeps a region in sync with `value`. A value that is or contains a function (an accessor, or an\n * array with accessor members) runs inside a render effect, so its reads are tracked. Anything\n * else is inserted once. `ordered` is for `insert()` without an anchor: a region that keeps changing then keeps\n * its place among the other such regions of its parent (see `linkRegion`).\n * @internal\n */\nexport function bindRegion(region: Region, value: unknown, ordered?: boolean): unknown {\n if (!containsFunction(value)) {\n commitValue(region, value);\n return value instanceof DocumentFragment ? [...region.nodes] : value;\n }\n let latest: unknown;\n if (ordered === true) linkRegion(region);\n const accessor = typeof value === \"function\" ? (value as () => unknown) : () => value;\n // Every accessor met while resolving the result is evaluated by a memo of its own, kept between\n // runs. An accessor that builds components (`() => show() ? <Late /> : null`) then runs again\n // only when what it reads changes, not whenever something it returned (the component's own\n // accessor, reading its own data) does.\n // Two stages. The outer effect runs the expression and tracks only what the expression itself\n // reads. When the result holds accessors (a component returned one, or `props.children` did),\n // a nested effect resolves them, so a change inside the result re-renders the result but never\n // re-runs the expression: re-running `() => props.children` would build the child components\n // again, discarding their state.\n useRenderEffect(accessor, (raw) => {\n latest = raw;\n if (containsFunction(raw)) {\n // One memo per accessor function, owned by this effect (the effect that evaluates the region's expression,\n // so a new result drops them all; the effect that resolves the result runs many times and must not own\n // them). The memos of accessors the last run did not meet are disposed, which bounds the cache by what the\n // region currently shows.\n const owner = currentOwner();\n const memos = new Map<() => unknown, ComputationNode>();\n let touched = new Set<() => unknown>();\n const call = (fn: () => unknown): unknown => {\n touched.add(fn);\n let node = memos.get(fn);\n if (node === undefined) {\n // Component setup runs inside these memos, which may write the state it owns.\n node = createComputation({ kind: \"memo\", fn: () => fn(), allowWrites: true, owner });\n memos.set(fn, node);\n }\n return readComputation(node);\n };\n useRenderEffect(\n () => {\n touched = new Set();\n const parts = flatten(raw, call);\n for (const [fn, node] of memos) {\n if (touched.has(fn)) continue;\n memos.delete(fn);\n disposeOwner(node);\n }\n return parts;\n },\n (parts) => {\n commit(region, parts);\n },\n );\n } else {\n commitValue(region, raw);\n }\n });\n return latest;\n}\n\n/**\n * Moves a region to a new parent: its nodes still in the old parent go through `move` (which puts\n * each at the end of `parent`), and later commits reconcile there. The region keeps its effects, so\n * what it shows is not built again. Only for a region without an anchor.\n * @param region The region to move.\n * @param parent The node that receives the region's nodes.\n * @param move Puts one node at the end of `parent` (`appendChild`, or `moveBefore` where it exists).\n * @since 1.0.3\n * @internal\n */\nexport function moveRegion(region: Region, parent: Node, move: (node: Node) => void): void {\n const attached = region.nodes.filter((node) => node.parentNode === region.parent);\n // A move that is not in place (appendChild) blurs a focused input: it gets the focus back.\n keepFocus(region.parent, () => {\n for (const node of attached) move(node);\n });\n // Read-only for everyone else: only a move changes where a region lives.\n (region as { parent: Node }).parent = parent;\n region.marker = attached[0]?.previousSibling ?? parent.lastChild;\n}\n\n/**\n * Removes a region's nodes from its parent. Anchors and nodes that were moved elsewhere are not\n * touched.\n * @internal\n */\nexport function removeRegion(region: Region): void {\n for (const node of region.nodes) {\n if (node.parentNode === region.parent) region.parent.removeChild(node);\n }\n region.nodes = [];\n region.texts = null;\n}\n\n/**\n * Creates a text anchor: an empty Text node placed before `before` (appended when null). Use it as\n * the stable insertion point between two dynamic regions; it is never removed by the runtime.\n *\n * @param parent Node that receives the anchor.\n * @param before Node the anchor goes before, or null to append.\n * @returns The new empty Text node.\n * @example\n * import { anchor, insert } from \"@shadow-js/web\";\n *\n * const list = document.createElement(\"ul\");\n * const slot = anchor(list, null);\n * insert(list, \"first\", slot); // goes before the anchor\n * @see insert\n * @since 1.0.0\n */\nexport function anchor(parent: Node, before: Node | null): Text {\n const text = documentOf(parent).createTextNode(\"\");\n parent.insertBefore(text, before);\n return text;\n}\n\n/**\n * Reactive child insertion: keeps the content of a region in sync with `value`.\n *\n * - A function is an accessor, wrapped in a render effect; it re-runs when its dependencies change.\n * - `null`, `undefined`, booleans render nothing. Strings and numbers become one Text node, reused\n * when the region already holds one. A Node is inserted itself. A DocumentFragment inserts a\n * snapshot of its children. Arrays are flattened, nested arrays included.\n * - Content goes before `anchorNode`, or at the end when it is null or omitted. Regions without an\n * anchor on one parent keep the order of the calls, whatever they show and however often a sibling\n * region replaces its nodes: when a reactive region is created right where the previous one ends, the\n * previous one gets an empty Text node as its anchor there (removed again when that region is disposed).\n * - Arrays are reconciled in place: nodes that remain are never removed and re-added.\n * - `initial` lists nodes already in the DOM (from hydration or splitText) so nothing is recreated.\n * - During `hydrate()`, a region that adopted server text is compared with its first commit: in\n * development, different text warns `HYDRATION_TEXT_MISMATCH` (on the console and in devtools) and\n * the region shows the value computed by the client.\n *\n * @param parent Node that holds the region.\n * @param value The value or an accessor returning it.\n * @param anchorNode Node the content goes before; null or omitted appends.\n * @param initial Nodes already in place for this region. Undefined adopts the server's nodes while\n * hydrating and starts empty otherwise.\n * @returns The value as accepted (a fragment yields the array of its nodes).\n * @throws TypeError (production message `SHADOW_INSERT_CYCLE`) when an array contains itself, and\n * (`SHADOW_INSERT_DEPTH`) when an accessor returns accessors more than 10,000 levels deep. When the\n * value is reactive, the error is raised inside its render effect and goes to the owner's error\n * handler, like any effect error.\n * @example\n * import { useSignal } from \"@shadow-js/core\";\n * import { anchor, insert } from \"@shadow-js/web\";\n *\n * const list = document.createElement(\"ul\");\n * const end = anchor(list, null);\n * const [items] = useSignal([\"a\", \"b\"]);\n * insert(list, () => items().map((name) => document.createTextNode(name)), end);\n * @see anchor\n * @since 1.0.0\n */\nexport function insert(\n parent: Node,\n value: unknown,\n anchorNode?: Node | null,\n initial?: unknown,\n): unknown {\n const resolvedAnchor = anchorNode ?? null;\n const adopted =\n initial === undefined ? claims.current.takeRegion(parent, resolvedAnchor) : initial;\n const region = createRegion(parent, resolvedAnchor, adopted);\n return bindRegion(region, value, resolvedAnchor === null);\n}\n"],"mappings":";;;;;;;;AA+CA,MAAM,wBAAQ,IAAI,QAAsB;;AAGxC,SAAS,WAAW,MAAsB;CACxC,OAAO,gBAAgB,WAAW,OAAQ,KAAK,iBAAiB;AAClE;;AAGA,SAAS,SAAS,QAAgB,MAAqB;CACrD,MAAM,QAAQ,OAAO;CACrB,OAAO,UAAU,QAAS,iBAAiB,OAAO,MAAM,IAAI,IAAY;AAC1E;;AAGA,SAAS,QAAQ,QAAgB,MAAkB;CACjD,MAAM,QAAQ,OAAO;CACrB,IAAI,UAAU,MAAM,OAAO,QAAQ;MAC9B,IAAI,iBAAiB,KAAK,MAAM,IAAI,IAAI;MACxC,IAAI,UAAU,MAAM,OAAO,wBAAQ,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC;AAC/D;;AAGA,SAAS,WAAW,QAAgB,MAA6B;CAC/D,MAAM,QAAQ,OAAO;CACrB,IAAI,UAAU,MAAM;CACpB,IAAI,iBAAiB,KAAK;EACxB,MAAM,OAAO,IAAI,IAAU,IAAI;EAC/B,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,KAAK,IAAI,IAAI,GAAG,MAAM,OAAO,IAAI;CAE1C,OAAO,IAAI,CAAC,KAAK,SAAS,KAAK,GAAG,OAAO,QAAQ;AACnD;;;;;AAMA,MAAM,mCAAmB,IAAI,QAAkC;;;;;AAM/D,SAAS,QAAQ,MAAe,MAA+C;CAC7E,MAAM,QAAgB,CAAC;CAEvB,KAAK,MAAM,QAAQ,OAAO,MAAM,sCAAO,IAAI,GAAG;EAC5C,IAAI,SAAS,QAAQ,SAAS,KAAA,KAAa,OAAO,SAAS,WAAW;EACtE,IAAI,gBAAgB,kBAAkB;GACpC,MAAM,OAAO,iBAAiB,IAAI,IAAI,KAAK,CAAC,GAAG,KAAK,UAAU;GAC9D,iBAAiB,IAAI,MAAM,IAAI;GAC/B,KAAK,MAAM,SAAS,MAAM,MAAM,KAAK,KAAK;EAC5C,OAAO,MAAM,KAAK,gBAAgB,OAAO,OAAO,OAAO,IAAI,CAAC;CAC9D;CACA,OAAO;AACT;;AAGA,SAAS,aAAa,QAAqC;CACzD,MAAM,uBAAO,IAAI,IAAoB;CACrC,KAAK,MAAM,QAAQ,OAAO,OAAO;EAC/B,IAAI,EAAE,gBAAgB,SAAS,CAAC,SAAS,QAAQ,IAAI,GAAG;EACxD,MAAM,OAAO,KAAK,IAAI,KAAK,IAAI;EAC/B,IAAI,SAAS,KAAA,GAAW,KAAK,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC;OAC7C,KAAK,KAAK,IAAI;CACrB;CACA,OAAO;AACT;;AAGA,SAAS,YAAY,QAAgB,OAAgC;CACnE,MAAM,OAAO,MAAM,WAAW,IAAI,MAAM,KAAK,KAAA;CAC7C,IAAI,OAAO,SAAS,UAAU;EAC5B,MAAM,UAAU,OAAO,MAAM,WAAW,IAAI,OAAO,MAAM,KAAK,KAAA;EAC9D,IAAI,mBAAmB,QAAQ,SAAS,QAAQ,OAAO,GAAG;GACxD,IAAI,QAAQ,SAAS,MAAM,QAAQ,OAAO;GAC1C,OAAO,CAAC,OAAO;EACjB;CACF;CAEA,MAAM,QAAgB,IAAI,MAAY,MAAM,MAAM;CAClD,IAAI,QAAQ;CACZ,MAAM,uBAAO,IAAI,IAAU;CAC3B,IAAI;CACJ,KAAK,MAAM,QAAQ,OACjB,IAAI,OAAO,SAAS,UAAU;EAC5B,SAAS,aAAa,MAAM;EAE5B,IAAI,OADW,KAAK,IAAI,IAAI,CAAC,EAAE,IAAI;EAEnC,IAAI,SAAS,KAAA,GAAW;GACtB,OAAO,WAAW,OAAO,MAAM,CAAC,CAAC,eAAe,IAAI;GACpD,QAAQ,QAAQ,IAAI;EACtB;EACA,KAAK,IAAI,IAAI;EACb,MAAM,SAAS;EACf,SAAS;CACX,OAAO,IAAI,CAAC,KAAK,IAAI,IAAI,GAAG;EAC1B,KAAK,IAAI,IAAI;EACb,MAAM,SAAS;EACf,SAAS;CACX;CAEF,MAAM,SAAS;CACf,OAAO;AACT;;AAGA,SAAS,MAAM,QAAgB,MAAqC;CAClE,IAAI,OAAO,WAAW,MAAM,OAAO,OAAO;CAC1C,IAAI,SAAS,KAAA,GAAW,OAAO,KAAK;CACpC,MAAM,SAAS,OAAO;CACtB,IAAI,WAAW,MAAM,OAAO,OAAO,OAAO;CAC1C,IAAI,OAAO,eAAe,OAAO,QAAQ,OAAO;CAChD,OAAO,OAAO;AAChB;;AAGA,MAAM,iCAAiB,IAAI,QAA+B;;;;;;;AAQ1D,SAAgB,aAAa,QAAc,KAAuB;CAChE,MAAM,MAAM,eAAe,IAAI,MAAM,qBAAK,IAAI,IAAgB;CAC9D,eAAe,IAAI,QAAQ,IAAI,IAAI,GAAG,CAAC;CACvC,gBAAgB;EACd,IAAI,OAAO,GAAG;CAChB,CAAC;AACH;;AAGA,SAAS,OAAO,QAAgB,OAA8B;CAC5D,IAAe,OAAO,YAAY,KAAA,GAAW;EAE3C,iBAAiB,OAAO,SAAS,KAAK;EACtC,OAAO,UAAU,KAAA;CACnB;CAEA,MAAM,OAAO,YAAY,QAAQ,KAAK;CACtC,MAAM,SAAS,OAAO;CACtB,MAAM,WAAW,OAAO,MAAM,QAAQ,SAAS,KAAK,eAAe,MAAM;CACzE,MAAM,QAAQ,SAAS;CACvB,MAAM,MAAM,MAAM,QAAQ,SAAS,GAAG,EAAE,CAAC;CACzC,IAAI,KAAK,WAAW,KAAK,UAAU,KAAA,GAAW,OAAO,SAAS,MAAM;CACpE,eAAe,QAAQ,UAAU,MAAM,GAAG;CAC1C,OAAO,QAAQ;CACf,WAAW,QAAQ,IAAI;CACvB,eAAe,IAAI,MAAM,CAAC,EAAE,SAAS,QAAQ;EAC3C,IAAI;CACN,CAAC;AACH;;;;;;AAOA,SAAS,YAAY,QAAgB,KAAoB;CACvD,KAAK,OAAO,QAAQ,YAAY,OAAO,QAAQ,aAAa,CAAa,OAAO,SAAU;EACxF,MAAM,QAAQ,OAAO;EACrB,MAAM,OAAO,OAAO,GAAG;EACvB,IAAI,MAAM,WAAW,GAAG;GACtB,MAAM,UAAU,MAAM;GACtB,IACE,mBAAmB,QACnB,QAAQ,eAAe,OAAO,UAC9B,SAAS,QAAQ,OAAO,GACxB;IACA,IAAI,QAAQ,SAAS,MAAM,QAAQ,OAAO;IAC1C;GACF;EACF,OAAO,IAAI,MAAM,WAAW,GAAG;GAC7B,MAAM,UAAU,WAAW,OAAO,MAAM,CAAC,CAAC,eAAe,IAAI;GAC7D,QAAQ,QAAQ,OAAO;GACvB,OAAO,OAAO,aAAa,SAAS,MAAM,QAAQ,KAAA,CAAS,CAAC;GAC5D,OAAO,QAAQ,CAAC,OAAO;GACvB;EACF;CACF;CACA,OAAO,QAAQ,QAAQ,GAAG,CAAC;AAC7B;;;;;;AAOA,SAAgB,aAAa,QAAc,YAAyB,SAA0B;CAE5F,MAAM,QAAgB,CAAC;CACvB,IAAI,YAAY,KAAA,GAAW;EACzB,MAAM,uBAAO,IAAI,IAAU;EAC3B,KAAK,MAAM,QAAQ,QAAQ,OAAO,GAAG;GACnC,IAAI,OAAO,SAAS,YAAY,KAAK,IAAI,IAAI,KAAK,KAAK,eAAe,QAAQ;GAC9E,KAAK,IAAI,IAAI;GACb,MAAM,KAAK,IAAI;EACjB;CACF;CAEA,MAAM,SAAiB;EACrB;EACA,QAAQ;EACR,QAJa,MAAM,SAAS,IAAK,MAAM,EAAE,CAAU,kBAAkB,OAAO;EAK5E;EACA,OAAO;CACT;CACA,KAAK,MAAM,QAAQ,OAAO,IAAI,gBAAgB,MAAM,QAAQ,QAAQ,IAAI;CAExE,IAAe,YAAY,KAAA,KAAa,OAAO,QAAQ,WAAW,GAAG,OAAO,UAAU;CACtF,OAAO;AACT;;;;;;;;;;AAWA,SAAS,WAAW,QAAsB;CACxC,MAAM,SAAS,OAAO;CACtB,MAAM,OAAO,MAAM,IAAI,MAAM;CAC7B,OAAO,QAAQ,aAAa;CAC5B,MAAM,IAAI,QAAQ,MAAM;CACxB,MAAM,QAAQ,OAAO,MAAM,MAAM;CACjC,IAAI,SAAS,KAAA,KAAa,KAAK,OAAO,YAAY,MAAM,MAAM,KAAK,MAAM,GAAG,EAAE,CAAC,MAAM,OACnF;CACF,MAAM,OAAO,OAAO,QAAQ,KAAK;CACjC,KAAK,SAAS,OAAO,SAAS;CAI9B,IAAI,KAAK,OAAO,WAAW,KAAK,aAAa,KAAK,OAAO,CAAC;AAC5D;;;;;AAMA,SAAS,iBAAiB,MAAwB;CAChD,IAAI,OAAO,SAAS,YAAY,OAAO;CACvC,IAAI,CAAC,MAAM,QAAQ,IAAI,GAAG,OAAO;CACjC,MAAM,QAAqB,CAAC,IAAI;CAChC,MAAM,uBAAO,IAAI,IAAe,CAAC,IAAI,CAAC;CACtC,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,QAAQ,MAAM,IAAI;EACxB,KAAK,MAAM,QAAQ,OAAO;GACxB,IAAI,OAAO,SAAS,YAAY,OAAO;GACvC,IAAI,MAAM,QAAQ,IAAI,KAAK,CAAC,KAAK,IAAI,IAAI,GAAG;IAC1C,KAAK,IAAI,IAAI;IACb,MAAM,KAAK,IAAI;GACjB;EACF;CACF;CACA,OAAO;AACT;;;;;;;;AASA,SAAgB,WAAW,QAAgB,OAAgB,SAA4B;CACrF,IAAI,CAAC,iBAAiB,KAAK,GAAG;EAC5B,YAAY,QAAQ,KAAK;EACzB,OAAO,iBAAiB,mBAAmB,CAAC,GAAG,OAAO,KAAK,IAAI;CACjE;CACA,IAAI;CACJ,IAAI,YAAY,MAAM,WAAW,MAAM;CAWvC,gBAViB,OAAO,UAAU,aAAc,cAAgC,QAUrD,QAAQ;EACjC,SAAS;EACT,IAAI,iBAAiB,GAAG,GAAG;GAKzB,MAAM,QAAQ,aAAa;GAC3B,MAAM,wBAAQ,IAAI,IAAoC;GACtD,IAAI,0BAAU,IAAI,IAAmB;GACrC,MAAM,QAAQ,OAA+B;IAC3C,QAAQ,IAAI,EAAE;IACd,IAAI,OAAO,MAAM,IAAI,EAAE;IACvB,IAAI,SAAS,KAAA,GAAW;KAEtB,OAAO,kBAAkB;MAAE,MAAM;MAAQ,UAAU,GAAG;MAAG,aAAa;MAAM;KAAM,CAAC;KACnF,MAAM,IAAI,IAAI,IAAI;IACpB;IACA,OAAO,gBAAgB,IAAI;GAC7B;GACA,sBACQ;IACJ,0BAAU,IAAI,IAAI;IAClB,MAAM,QAAQ,QAAQ,KAAK,IAAI;IAC/B,KAAK,MAAM,CAAC,IAAI,SAAS,OAAO;KAC9B,IAAI,QAAQ,IAAI,EAAE,GAAG;KACrB,MAAM,OAAO,EAAE;KACf,aAAa,IAAI;IACnB;IACA,OAAO;GACT,IACC,UAAU;IACT,OAAO,QAAQ,KAAK;GACtB,CACF;EACF,OACE,YAAY,QAAQ,GAAG;CAE3B,CAAC;CACD,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,WAAW,QAAgB,QAAc,MAAkC;CACzF,MAAM,WAAW,OAAO,MAAM,QAAQ,SAAS,KAAK,eAAe,OAAO,MAAM;CAEhF,UAAU,OAAO,cAAc;EAC7B,KAAK,MAAM,QAAQ,UAAU,KAAK,IAAI;CACxC,CAAC;CAED,OAA6B,SAAS;CACtC,OAAO,SAAS,SAAS,EAAE,EAAE,mBAAmB,OAAO;AACzD;;;;;;AAOA,SAAgB,aAAa,QAAsB;CACjD,KAAK,MAAM,QAAQ,OAAO,OACxB,IAAI,KAAK,eAAe,OAAO,QAAQ,OAAO,OAAO,YAAY,IAAI;CAEvE,OAAO,QAAQ,CAAC;CAChB,OAAO,QAAQ;AACjB;;;;;;;;;;;;;;;;;AAkBA,SAAgB,OAAO,QAAc,QAA2B;CAC9D,MAAM,OAAO,WAAW,MAAM,CAAC,CAAC,eAAe,EAAE;CACjD,OAAO,aAAa,MAAM,MAAM;CAChC,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwCA,SAAgB,OACd,QACA,OACA,YACA,SACS;CACT,MAAM,iBAAiB,cAAc;CAIrC,OAAO,WADQ,aAAa,QAAQ,gBADlC,YAAY,KAAA,IAAY,OAAO,QAAQ,WAAW,QAAQ,cAAc,IAAI,OAEvD,GAAG,OAAO,mBAAmB,IAAI;AAC1D"}
@@ -13,7 +13,8 @@
13
13
  * 3. Place the rest from the end of `next` backwards. Nodes on a longest increasing subsequence of
14
14
  * surviving positions stay where they are; every other node is moved (or inserted) directly
15
15
  * before the node that follows it in `next`. Moves use `moveBefore` when the parent has it,
16
- * which keeps focus and iframe state, and `insertBefore` otherwise. Each node moves at most once,
16
+ * which keeps focus and iframe state, and `insertBefore` otherwise (a focused element that the move
17
+ * blurred gets the focus back). Each node moves at most once,
17
18
  * and the number of moves is minimal for the surviving order.
18
19
  *
19
20
  * @param parent The parent of the region.
@@ -1,4 +1,17 @@
1
1
  // src/internal/reconcile.ts
2
+ /**
3
+ * Runs `run`, which moves nodes in the tree of `at` without `moveBefore`: a browser blurs a focused
4
+ * element that `insertBefore` moves, so a focused element of that tree that lost the focus gets it
5
+ * back, without scrolling. A text control keeps its selection across the move, and `focus()` keeps
6
+ * it. The focused element is read once, before `run`.
7
+ * @internal
8
+ */
9
+ function keepFocus(at, run) {
10
+ const root = at.getRootNode();
11
+ const active = root.activeElement;
12
+ run();
13
+ if (active != null && root.activeElement !== active) active.focus({ preventScroll: true });
14
+ }
2
15
  /** Removes `node` only when it is still a child of `parent`, so detached nodes are ignored. */
3
16
  function removeNode(parent, node) {
4
17
  if (node !== void 0 && node.parentNode === parent) parent.removeChild(node);
@@ -44,7 +57,8 @@ function markLongestIncreasing(values, offset, marks) {
44
57
  * 3. Place the rest from the end of `next` backwards. Nodes on a longest increasing subsequence of
45
58
  * surviving positions stay where they are; every other node is moved (or inserted) directly
46
59
  * before the node that follows it in `next`. Moves use `moveBefore` when the parent has it,
47
- * which keeps focus and iframe state, and `insertBefore` otherwise. Each node moves at most once,
60
+ * which keeps focus and iframe state, and `insertBefore` otherwise (a focused element that the move
61
+ * blurred gets the focus back). Each node moves at most once,
48
62
  * and the number of moves is minimal for the surviving order.
49
63
  *
50
64
  * @param parent The parent of the region.
@@ -101,6 +115,8 @@ function reconcileNodes(parent, prev, next, end) {
101
115
  const stable = new Uint8Array(nextTail - head);
102
116
  markLongestIncreasing(survivors, head, stable);
103
117
  const movable = typeof parent.moveBefore === "function";
118
+ const root = parent.getRootNode();
119
+ const active = movable ? null : root.activeElement;
104
120
  let anchorNode = before;
105
121
  for (let index = nextTail - 1; index >= head; index -= 1) {
106
122
  const node = next[index];
@@ -110,7 +126,8 @@ function reconcileNodes(parent, prev, next, end) {
110
126
  }
111
127
  anchorNode = node;
112
128
  }
129
+ if (active != null && root.activeElement !== active) active.focus({ preventScroll: true });
113
130
  }
114
- export { reconcileNodes };
131
+ export { keepFocus, reconcileNodes };
115
132
 
116
133
  //# sourceMappingURL=reconcile.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"reconcile.js","names":[],"sources":["../../../src/internal/reconcile.ts"],"sourcesContent":["/** A parent that can move a child in place (Element.prototype.moveBefore, where implemented). */\ninterface MovableParent extends Node {\n moveBefore(node: Node, child: Node | null): void;\n}\n\n/** Removes `node` only when it is still a child of `parent`, so detached nodes are ignored. */\nfunction removeNode(parent: Node, node: Node | undefined): void {\n if (node !== undefined && node.parentNode === parent) parent.removeChild(node);\n}\n\n/**\n * Marks the members of one longest strictly increasing subsequence of `values` in `marks`, where\n * `values[k]` is the target position of the k-th surviving node and `marks[v - offset]` is set for\n * target position `v`. Patience sorting: O(n log n).\n */\nfunction markLongestIncreasing(values: readonly number[], offset: number, marks: Uint8Array): void {\n // tails[k]: index into `values` of the smallest tail of an increasing run of length k + 1.\n const tails: number[] = [];\n const previous: number[] = values.map(() => -1);\n for (let index = 0; index < values.length; index += 1) {\n const value = values[index] as number;\n let low = 0;\n let high = tails.length;\n while (low < high) {\n const middle = (low + high) >> 1;\n const probe = values[tails[middle] as number] as number;\n if (probe < value) low = middle + 1;\n else high = middle;\n }\n // `tails[-1]` is undefined, which reads as no predecessor.\n previous[index] = tails[low - 1] ?? -1;\n tails[low] = index;\n }\n let cursor = tails.at(-1) ?? -1;\n while (cursor !== -1) {\n marks[(values[cursor] as number) - offset] = 1;\n cursor = previous[cursor] as number;\n }\n}\n\n/**\n * Updates one region of `parent`'s children from the nodes `prev` to the nodes `next`, keeping every\n * node that stays and moving as few as possible: the list reconciliation `insert` performs for arrays\n * (and so for `For`). Use it in a custom list renderer.\n *\n * Preconditions: `prev` are the nodes this region owns, in DOM order and all children of `parent`;\n * `next` holds no duplicates; `end` is the node after the region (null for the end of `parent`).\n *\n * Strategy, in three steps:\n * 1. Trim the common prefix and suffix: appends, prepends, and removals at either end touch\n * only the nodes that changed (no move at all).\n * 2. Remove the nodes that left the value. A node that is still present is never removed.\n * 3. Place the rest from the end of `next` backwards. Nodes on a longest increasing subsequence of\n * surviving positions stay where they are; every other node is moved (or inserted) directly\n * before the node that follows it in `next`. Moves use `moveBefore` when the parent has it,\n * which keeps focus and iframe state, and `insertBefore` otherwise. Each node moves at most once,\n * and the number of moves is minimal for the surviving order.\n *\n * @param parent The parent of the region.\n * @param prev The nodes the region holds now, in DOM order, all children of `parent`.\n * @param next The nodes the region must hold, in order, without duplicates. A node of `prev` that is\n * not in `next` is removed; a node of `next` that is not in `prev` is inserted.\n * @param end The node right after the region; `null` when the region runs to the end of `parent`.\n * @example\n * import { reconcileNodes } from \"@shadow-js/web/extend\";\n *\n * const item = (text: string): HTMLLIElement =>\n * Object.assign(document.createElement(\"li\"), { textContent: text });\n * const list = document.createElement(\"ul\");\n * const a = item(\"a\");\n * const b = item(\"b\");\n * const c = item(\"c\");\n * list.append(a, b, c);\n * reconcileNodes(list, [a, b, c], [c, a], null); // removes b, moves c before a\n * @since 1.0.0\n */\nexport function reconcileNodes(\n parent: Node,\n prev: readonly Node[],\n next: readonly Node[],\n end: Node | null,\n): void {\n const prevLength = prev.length;\n const nextLength = next.length;\n\n let head = 0;\n while (head < prevLength && head < nextLength && prev[head] === next[head]) head += 1;\n let prevTail = prevLength;\n let nextTail = nextLength;\n while (prevTail > head && nextTail > head && prev[prevTail - 1] === next[nextTail - 1]) {\n prevTail -= 1;\n nextTail -= 1;\n }\n if (prevTail === head && nextTail === head) return;\n\n // Everything in the common suffix is already in place, so the middle goes before its first node.\n const before = nextTail < nextLength ? (next[nextTail] ?? null) : end;\n\n if (nextTail === head) {\n for (let index = head; index < prevTail; index += 1) removeNode(parent, prev[index]);\n return;\n }\n\n const target = new Map<Node, number>();\n for (let index = head; index < nextTail; index += 1) {\n const node = next[index];\n if (node !== undefined) target.set(node, index);\n }\n\n const survivors: number[] = [];\n for (let index = head; index < prevTail; index += 1) {\n const node = prev[index] as Node;\n const position = target.get(node);\n if (position === undefined) removeNode(parent, node);\n else survivors.push(position);\n }\n\n // Nothing survived: the new nodes go in document order. Inserting them back to front (the move loop below)\n // ends with the same tree but not the same steps, and a `<select>` picks its shown option while its options\n // arrive, so a replaced option list would show the wrong value.\n if (survivors.length === 0) {\n for (const node of next.slice(head, nextTail)) parent.insertBefore(node, before);\n return;\n }\n\n const stable = new Uint8Array(nextTail - head);\n markLongestIncreasing(survivors, head, stable);\n const movable = typeof (parent as Partial<MovableParent>).moveBefore === \"function\";\n\n let anchorNode = before;\n for (let index = nextTail - 1; index >= head; index -= 1) {\n const node = next[index] as Node;\n if (stable[index - head] !== 1) {\n if (movable && node.parentNode === parent)\n (parent as MovableParent).moveBefore(node, anchorNode);\n else parent.insertBefore(node, anchorNode);\n }\n anchorNode = node;\n }\n}\n"],"mappings":";;AAMA,SAAS,WAAW,QAAc,MAA8B;CAC9D,IAAI,SAAS,KAAA,KAAa,KAAK,eAAe,QAAQ,OAAO,YAAY,IAAI;AAC/E;;;;;;AAOA,SAAS,sBAAsB,QAA2B,QAAgB,OAAyB;CAEjG,MAAM,QAAkB,CAAC;CACzB,MAAM,WAAqB,OAAO,UAAU,EAAE;CAC9C,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;EACrD,MAAM,QAAQ,OAAO;EACrB,IAAI,MAAM;EACV,IAAI,OAAO,MAAM;EACjB,OAAO,MAAM,MAAM;GACjB,MAAM,SAAU,MAAM,QAAS;GAE/B,IADc,OAAO,MAAM,WACf,OAAO,MAAM,SAAS;QAC7B,OAAO;EACd;EAEA,SAAS,SAAS,MAAM,MAAM,MAAM;EACpC,MAAM,OAAO;CACf;CACA,IAAI,SAAS,MAAM,GAAG,EAAE,KAAK;CAC7B,OAAO,WAAW,IAAI;EACpB,MAAO,OAAO,UAAqB,UAAU;EAC7C,SAAS,SAAS;CACpB;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCA,SAAgB,eACd,QACA,MACA,MACA,KACM;CACN,MAAM,aAAa,KAAK;CACxB,MAAM,aAAa,KAAK;CAExB,IAAI,OAAO;CACX,OAAO,OAAO,cAAc,OAAO,cAAc,KAAK,UAAU,KAAK,OAAO,QAAQ;CACpF,IAAI,WAAW;CACf,IAAI,WAAW;CACf,OAAO,WAAW,QAAQ,WAAW,QAAQ,KAAK,WAAW,OAAO,KAAK,WAAW,IAAI;EACtF,YAAY;EACZ,YAAY;CACd;CACA,IAAI,aAAa,QAAQ,aAAa,MAAM;CAG5C,MAAM,SAAS,WAAW,aAAc,KAAK,aAAa,OAAQ;CAElE,IAAI,aAAa,MAAM;EACrB,KAAK,IAAI,QAAQ,MAAM,QAAQ,UAAU,SAAS,GAAG,WAAW,QAAQ,KAAK,MAAM;EACnF;CACF;CAEA,MAAM,yBAAS,IAAI,IAAkB;CACrC,KAAK,IAAI,QAAQ,MAAM,QAAQ,UAAU,SAAS,GAAG;EACnD,MAAM,OAAO,KAAK;EAClB,IAAI,SAAS,KAAA,GAAW,OAAO,IAAI,MAAM,KAAK;CAChD;CAEA,MAAM,YAAsB,CAAC;CAC7B,KAAK,IAAI,QAAQ,MAAM,QAAQ,UAAU,SAAS,GAAG;EACnD,MAAM,OAAO,KAAK;EAClB,MAAM,WAAW,OAAO,IAAI,IAAI;EAChC,IAAI,aAAa,KAAA,GAAW,WAAW,QAAQ,IAAI;OAC9C,UAAU,KAAK,QAAQ;CAC9B;CAKA,IAAI,UAAU,WAAW,GAAG;EAC1B,KAAK,MAAM,QAAQ,KAAK,MAAM,MAAM,QAAQ,GAAG,OAAO,aAAa,MAAM,MAAM;EAC/E;CACF;CAEA,MAAM,SAAS,IAAI,WAAW,WAAW,IAAI;CAC7C,sBAAsB,WAAW,MAAM,MAAM;CAC7C,MAAM,UAAU,OAAQ,OAAkC,eAAe;CAEzE,IAAI,aAAa;CACjB,KAAK,IAAI,QAAQ,WAAW,GAAG,SAAS,MAAM,SAAS,GAAG;EACxD,MAAM,OAAO,KAAK;EAClB,IAAI,OAAO,QAAQ,UAAU,GAAG;GAC9B,IAAI,WAAW,KAAK,eAAe,QACjC,OAA0B,WAAW,MAAM,UAAU;QAClD,OAAO,aAAa,MAAM,UAAU;EAC3C;EACA,aAAa;CACf;AACF"}
1
+ {"version":3,"file":"reconcile.js","names":[],"sources":["../../../src/internal/reconcile.ts"],"sourcesContent":["/** A parent that can move a child in place (Element.prototype.moveBefore, where implemented). */\ninterface MovableParent extends Node {\n moveBefore(node: Node, child: Node | null): void;\n}\n\n/**\n * Runs `run`, which moves nodes in the tree of `at` without `moveBefore`: a browser blurs a focused\n * element that `insertBefore` moves, so a focused element of that tree that lost the focus gets it\n * back, without scrolling. A text control keeps its selection across the move, and `focus()` keeps\n * it. The focused element is read once, before `run`.\n * @internal\n */\nexport function keepFocus(at: Node, run: () => void): void {\n const root = at.getRootNode() as Partial<DocumentOrShadowRoot>;\n const active = root.activeElement as HTMLElement | null | undefined;\n run();\n if (active != null && root.activeElement !== active) active.focus({ preventScroll: true });\n}\n\n/** Removes `node` only when it is still a child of `parent`, so detached nodes are ignored. */\nfunction removeNode(parent: Node, node: Node | undefined): void {\n if (node !== undefined && node.parentNode === parent) parent.removeChild(node);\n}\n\n/**\n * Marks the members of one longest strictly increasing subsequence of `values` in `marks`, where\n * `values[k]` is the target position of the k-th surviving node and `marks[v - offset]` is set for\n * target position `v`. Patience sorting: O(n log n).\n */\nfunction markLongestIncreasing(values: readonly number[], offset: number, marks: Uint8Array): void {\n // tails[k]: index into `values` of the smallest tail of an increasing run of length k + 1.\n const tails: number[] = [];\n const previous: number[] = values.map(() => -1);\n for (let index = 0; index < values.length; index += 1) {\n const value = values[index] as number;\n let low = 0;\n let high = tails.length;\n while (low < high) {\n const middle = (low + high) >> 1;\n const probe = values[tails[middle] as number] as number;\n if (probe < value) low = middle + 1;\n else high = middle;\n }\n // `tails[-1]` is undefined, which reads as no predecessor.\n previous[index] = tails[low - 1] ?? -1;\n tails[low] = index;\n }\n let cursor = tails.at(-1) ?? -1;\n while (cursor !== -1) {\n marks[(values[cursor] as number) - offset] = 1;\n cursor = previous[cursor] as number;\n }\n}\n\n/**\n * Updates one region of `parent`'s children from the nodes `prev` to the nodes `next`, keeping every\n * node that stays and moving as few as possible: the list reconciliation `insert` performs for arrays\n * (and so for `For`). Use it in a custom list renderer.\n *\n * Preconditions: `prev` are the nodes this region owns, in DOM order and all children of `parent`;\n * `next` holds no duplicates; `end` is the node after the region (null for the end of `parent`).\n *\n * Strategy, in three steps:\n * 1. Trim the common prefix and suffix: appends, prepends, and removals at either end touch\n * only the nodes that changed (no move at all).\n * 2. Remove the nodes that left the value. A node that is still present is never removed.\n * 3. Place the rest from the end of `next` backwards. Nodes on a longest increasing subsequence of\n * surviving positions stay where they are; every other node is moved (or inserted) directly\n * before the node that follows it in `next`. Moves use `moveBefore` when the parent has it,\n * which keeps focus and iframe state, and `insertBefore` otherwise (a focused element that the move\n * blurred gets the focus back). Each node moves at most once,\n * and the number of moves is minimal for the surviving order.\n *\n * @param parent The parent of the region.\n * @param prev The nodes the region holds now, in DOM order, all children of `parent`.\n * @param next The nodes the region must hold, in order, without duplicates. A node of `prev` that is\n * not in `next` is removed; a node of `next` that is not in `prev` is inserted.\n * @param end The node right after the region; `null` when the region runs to the end of `parent`.\n * @example\n * import { reconcileNodes } from \"@shadow-js/web/extend\";\n *\n * const item = (text: string): HTMLLIElement =>\n * Object.assign(document.createElement(\"li\"), { textContent: text });\n * const list = document.createElement(\"ul\");\n * const a = item(\"a\");\n * const b = item(\"b\");\n * const c = item(\"c\");\n * list.append(a, b, c);\n * reconcileNodes(list, [a, b, c], [c, a], null); // removes b, moves c before a\n * @since 1.0.0\n */\nexport function reconcileNodes(\n parent: Node,\n prev: readonly Node[],\n next: readonly Node[],\n end: Node | null,\n): void {\n const prevLength = prev.length;\n const nextLength = next.length;\n\n let head = 0;\n while (head < prevLength && head < nextLength && prev[head] === next[head]) head += 1;\n let prevTail = prevLength;\n let nextTail = nextLength;\n while (prevTail > head && nextTail > head && prev[prevTail - 1] === next[nextTail - 1]) {\n prevTail -= 1;\n nextTail -= 1;\n }\n if (prevTail === head && nextTail === head) return;\n\n // Everything in the common suffix is already in place, so the middle goes before its first node.\n const before = nextTail < nextLength ? (next[nextTail] ?? null) : end;\n\n if (nextTail === head) {\n for (let index = head; index < prevTail; index += 1) removeNode(parent, prev[index]);\n return;\n }\n\n const target = new Map<Node, number>();\n for (let index = head; index < nextTail; index += 1) {\n const node = next[index];\n if (node !== undefined) target.set(node, index);\n }\n\n const survivors: number[] = [];\n for (let index = head; index < prevTail; index += 1) {\n const node = prev[index] as Node;\n const position = target.get(node);\n if (position === undefined) removeNode(parent, node);\n else survivors.push(position);\n }\n\n // Nothing survived: the new nodes go in document order. Inserting them back to front (the move loop below)\n // ends with the same tree but not the same steps, and a `<select>` picks its shown option while its options\n // arrive, so a replaced option list would show the wrong value.\n if (survivors.length === 0) {\n for (const node of next.slice(head, nextTail)) parent.insertBefore(node, before);\n return;\n }\n\n const stable = new Uint8Array(nextTail - head);\n markLongestIncreasing(survivors, head, stable);\n const movable = typeof (parent as Partial<MovableParent>).moveBefore === \"function\";\n\n // Without moveBefore, insertBefore blurs a focused element it moves: the focused element is read once\n // for the pass and gets the focus back (without scrolling) when the moves took it.\n const root = parent.getRootNode() as Partial<DocumentOrShadowRoot>;\n const active = movable ? null : (root.activeElement as HTMLElement | null | undefined);\n let anchorNode = before;\n for (let index = nextTail - 1; index >= head; index -= 1) {\n const node = next[index] as Node;\n if (stable[index - head] !== 1) {\n if (movable && node.parentNode === parent)\n (parent as MovableParent).moveBefore(node, anchorNode);\n else parent.insertBefore(node, anchorNode);\n }\n anchorNode = node;\n }\n if (active != null && root.activeElement !== active) active.focus({ preventScroll: true });\n}\n"],"mappings":";;;;;;;;AAYA,SAAgB,UAAU,IAAU,KAAuB;CACzD,MAAM,OAAO,GAAG,YAAY;CAC5B,MAAM,SAAS,KAAK;CACpB,IAAI;CACJ,IAAI,UAAU,QAAQ,KAAK,kBAAkB,QAAQ,OAAO,MAAM,EAAE,eAAe,KAAK,CAAC;AAC3F;;AAGA,SAAS,WAAW,QAAc,MAA8B;CAC9D,IAAI,SAAS,KAAA,KAAa,KAAK,eAAe,QAAQ,OAAO,YAAY,IAAI;AAC/E;;;;;;AAOA,SAAS,sBAAsB,QAA2B,QAAgB,OAAyB;CAEjG,MAAM,QAAkB,CAAC;CACzB,MAAM,WAAqB,OAAO,UAAU,EAAE;CAC9C,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;EACrD,MAAM,QAAQ,OAAO;EACrB,IAAI,MAAM;EACV,IAAI,OAAO,MAAM;EACjB,OAAO,MAAM,MAAM;GACjB,MAAM,SAAU,MAAM,QAAS;GAE/B,IADc,OAAO,MAAM,WACf,OAAO,MAAM,SAAS;QAC7B,OAAO;EACd;EAEA,SAAS,SAAS,MAAM,MAAM,MAAM;EACpC,MAAM,OAAO;CACf;CACA,IAAI,SAAS,MAAM,GAAG,EAAE,KAAK;CAC7B,OAAO,WAAW,IAAI;EACpB,MAAO,OAAO,UAAqB,UAAU;EAC7C,SAAS,SAAS;CACpB;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCA,SAAgB,eACd,QACA,MACA,MACA,KACM;CACN,MAAM,aAAa,KAAK;CACxB,MAAM,aAAa,KAAK;CAExB,IAAI,OAAO;CACX,OAAO,OAAO,cAAc,OAAO,cAAc,KAAK,UAAU,KAAK,OAAO,QAAQ;CACpF,IAAI,WAAW;CACf,IAAI,WAAW;CACf,OAAO,WAAW,QAAQ,WAAW,QAAQ,KAAK,WAAW,OAAO,KAAK,WAAW,IAAI;EACtF,YAAY;EACZ,YAAY;CACd;CACA,IAAI,aAAa,QAAQ,aAAa,MAAM;CAG5C,MAAM,SAAS,WAAW,aAAc,KAAK,aAAa,OAAQ;CAElE,IAAI,aAAa,MAAM;EACrB,KAAK,IAAI,QAAQ,MAAM,QAAQ,UAAU,SAAS,GAAG,WAAW,QAAQ,KAAK,MAAM;EACnF;CACF;CAEA,MAAM,yBAAS,IAAI,IAAkB;CACrC,KAAK,IAAI,QAAQ,MAAM,QAAQ,UAAU,SAAS,GAAG;EACnD,MAAM,OAAO,KAAK;EAClB,IAAI,SAAS,KAAA,GAAW,OAAO,IAAI,MAAM,KAAK;CAChD;CAEA,MAAM,YAAsB,CAAC;CAC7B,KAAK,IAAI,QAAQ,MAAM,QAAQ,UAAU,SAAS,GAAG;EACnD,MAAM,OAAO,KAAK;EAClB,MAAM,WAAW,OAAO,IAAI,IAAI;EAChC,IAAI,aAAa,KAAA,GAAW,WAAW,QAAQ,IAAI;OAC9C,UAAU,KAAK,QAAQ;CAC9B;CAKA,IAAI,UAAU,WAAW,GAAG;EAC1B,KAAK,MAAM,QAAQ,KAAK,MAAM,MAAM,QAAQ,GAAG,OAAO,aAAa,MAAM,MAAM;EAC/E;CACF;CAEA,MAAM,SAAS,IAAI,WAAW,WAAW,IAAI;CAC7C,sBAAsB,WAAW,MAAM,MAAM;CAC7C,MAAM,UAAU,OAAQ,OAAkC,eAAe;CAIzE,MAAM,OAAO,OAAO,YAAY;CAChC,MAAM,SAAS,UAAU,OAAQ,KAAK;CACtC,IAAI,aAAa;CACjB,KAAK,IAAI,QAAQ,WAAW,GAAG,SAAS,MAAM,SAAS,GAAG;EACxD,MAAM,OAAO,KAAK;EAClB,IAAI,OAAO,QAAQ,UAAU,GAAG;GAC9B,IAAI,WAAW,KAAK,eAAe,QACjC,OAA0B,WAAW,MAAM,UAAU;QAClD,OAAO,aAAa,MAAM,UAAU;EAC3C;EACA,aAAa;CACf;CACA,IAAI,UAAU,QAAQ,KAAK,kBAAkB,QAAQ,OAAO,MAAM,EAAE,eAAe,KAAK,CAAC;AAC3F"}
@@ -10,47 +10,13 @@ import { onCleanup, untrack, useRenderEffect } from "@shadow-js/core";
10
10
  // src/spread.ts
11
11
  /** The namespace of `xlink:` attributes (SVG's legacy links). */
12
12
  const XLINK_NS = "http://www.w3.org/1999/xlink";
13
- /** The HTML of a `dangerouslySetInnerHTML` value (`{ __html }`); null and undefined mean empty. */
14
- function innerHtmlValue(value) {
15
- if (value === null || typeof value !== "object") return "";
16
- return plainText(Reflect.get(value, "__html"));
17
- }
18
13
  /** Keys that would reach a prototype if written as properties. Ignored everywhere. */
19
14
  const FORBIDDEN_NAMES = /^(?:__proto__|constructor|prototype)$/;
20
- /** True for `on*` keys, which bind event handlers. */
21
- function isEventKey(key) {
22
- return key.length > 2 && key.startsWith("on");
23
- }
24
- /** The name after a `prop:`, `attr:` or `bool:` namespace, or the whole key. */
25
- function nameOf(key) {
26
- const colon = key.indexOf(":");
27
- return colon === -1 ? key : key.slice(colon + 1);
28
- }
29
- /** Reads every prop except children, inside the render effect so each read is tracked. */
30
- function readEntries(props, textarea) {
31
- const entries = [];
32
- if (props === null || typeof props !== "object") return entries;
33
- let value;
34
- let hasValue = false;
35
- for (const key of Object.keys(props)) {
36
- if (FORBIDDEN_NAMES.test(nameOf(key)) || IGNORED_KEYS.test(key)) continue;
37
- if (key === "children") {
38
- if (textarea) {
39
- value = Reflect.get(props, key);
40
- hasValue = true;
41
- }
42
- continue;
43
- }
44
- entries.push([key, Reflect.get(props, key)]);
45
- }
46
- if (hasValue && !entries.some(([key]) => key === "value")) entries.push(["value", value]);
47
- return entries;
48
- }
49
15
  /** Runs and forgets the cleanup the last ref callback returned, if any. */
50
16
  function runRefCleanup(state) {
51
- const cleanup = state.refCleanup;
17
+ const cleanup = state.unref;
52
18
  if (cleanup === void 0) return;
53
- state.refCleanup = void 0;
19
+ state.unref = void 0;
54
20
  untrack(cleanup);
55
21
  }
56
22
  /** Applies one prop that is new or changed. */
@@ -60,13 +26,13 @@ function applyKey(el, key, value, state, svg) {
60
26
  if (typeof value === "function") {
61
27
  const callRef = value;
62
28
  const cleanup = untrack(() => callRef(el));
63
- if (typeof cleanup === "function") state.refCleanup = cleanup;
29
+ if (typeof cleanup === "function") state.unref = cleanup;
64
30
  }
65
31
  return;
66
32
  }
67
33
  if (key === "autoFocus") {
68
- if (!state.autoFocused) {
69
- state.autoFocused = true;
34
+ if (!state.focused) {
35
+ state.focused = true;
70
36
  autoFocus(el, value);
71
37
  }
72
38
  return;
@@ -76,27 +42,27 @@ function applyKey(el, key, value, state, svg) {
76
42
  return;
77
43
  }
78
44
  if (key === "style") {
79
- state.styleValue = style(el, value, state.styleValue);
45
+ state.styled = style(el, value, state.styled);
80
46
  return;
81
47
  }
82
48
  if (key === "classList") {
83
- state.classListValue = classList(el, asRecord(value), state.classListValue);
49
+ state.listed = classList(el, asRecord(value), state.listed);
84
50
  return;
85
51
  }
86
- if (isEventKey(key)) {
87
- state.unbinders.get(key)?.();
88
- state.unbinders.delete(key);
52
+ if (key.length > 2 && key.startsWith("on")) {
53
+ state.unbind.get(key)?.();
54
+ state.unbind.delete(key);
89
55
  const plan = eventPlan(key, el.localName, el.getAttribute("type")?.toLowerCase() ?? null);
90
56
  const handler = plan.passive && typeof value === "function" ? {
91
57
  handleEvent: value,
92
58
  passive: true
93
59
  } : value;
94
60
  const unbind = bindEvent(el, plan.type, handler, true, plan.capture);
95
- if (unbind !== void 0) state.unbinders.set(key, unbind);
61
+ if (unbind !== void 0) state.unbind.set(key, unbind);
96
62
  return;
97
63
  }
98
64
  if (key === "innerHTML" || key === "dangerouslySetInnerHTML") {
99
- el.innerHTML = key === "innerHTML" ? plainText(value) : innerHtmlValue(value);
65
+ el.innerHTML = plainText(key === "innerHTML" ? value : value !== null && typeof value === "object" ? Reflect.get(value, "__html") : void 0);
100
66
  return;
101
67
  }
102
68
  if (key === "textContent") {
@@ -112,14 +78,6 @@ function applyKey(el, key, value, state, svg) {
112
78
  if (key === "value" && el instanceof HTMLInputElement) el.defaultValue = plainText(value);
113
79
  return;
114
80
  }
115
- writeKey(el, key, value, svg);
116
- }
117
- /**
118
- * Writes one prop by its key: a `prop:` property, an `attr:` or `bool:` attribute, or an attribute
119
- * under its React name. An `undefined` value removes the attribute or resets the property, which is how
120
- * a prop that disappeared is undone.
121
- */
122
- function writeKey(el, key, value, svg) {
123
81
  if (key.startsWith("prop:")) Reflect.set(el, key.slice(5), value);
124
82
  else if (key.startsWith("attr:")) setAttribute(el, key.slice(5), value);
125
83
  else if (key.startsWith("bool:")) setBoolAttribute(el, key.slice(5), value);
@@ -145,24 +103,6 @@ function liveDiffers(el, key, value, svg) {
145
103
  return STRING_PROPERTIES.test(key) ? live !== plainText(value) : live !== Boolean(value);
146
104
  }
147
105
  /**
148
- * Applies the entries that changed since the last run and undoes the ones that disappeared.
149
- * Unchanged values are skipped by identity, so only changed keys touch the DOM.
150
- */
151
- function applyEntries(el, entries, state, svg) {
152
- const current = /* @__PURE__ */ new Set();
153
- for (const [key, value] of entries) {
154
- current.add(key);
155
- if (state.values.has(key) && Object.is(state.values.get(key), value) && !liveDiffers(el, key, value, svg)) continue;
156
- state.values.set(key, value);
157
- applyKey(el, key, value, state, svg);
158
- }
159
- for (const key of [...state.values.keys()]) {
160
- if (current.has(key)) continue;
161
- state.values.delete(key);
162
- applyKey(el, key, void 0, state, svg);
163
- }
164
- }
165
- /**
166
106
  * Applies a whole props object to an element and keeps it in sync: the helper compiled JSX calls for
167
107
  * `{...props}` on an element. The props are read inside a render effect, so a getter (or the props
168
108
  * accessor) that changes rewrites only the keys whose values changed, and a key that disappears is
@@ -235,10 +175,7 @@ function followOptions(el, isSVG, state) {
235
175
  function newState() {
236
176
  return {
237
177
  values: /* @__PURE__ */ new Map(),
238
- unbinders: /* @__PURE__ */ new Map(),
239
- styleValue: void 0,
240
- classListValue: void 0,
241
- refCleanup: void 0
178
+ unbind: /* @__PURE__ */ new Map()
242
179
  };
243
180
  }
244
181
  /**
@@ -257,12 +194,42 @@ function spreadProps(el, props, isSVG) {
257
194
  function applyProps(el, read, isSVG, state) {
258
195
  const textarea = el.localName === "textarea";
259
196
  onCleanup(() => {
260
- for (const unbind of state.unbinders.values()) unbind();
261
- state.unbinders.clear();
197
+ for (const unbind of state.unbind.values()) unbind();
198
+ state.unbind.clear();
262
199
  runRefCleanup(state);
263
200
  });
264
- useRenderEffect(() => readEntries(read(), textarea), (entries) => {
265
- applyEntries(el, entries, state, isSVG);
201
+ useRenderEffect(() => {
202
+ const props = read();
203
+ const entries = [];
204
+ if (props === null || typeof props !== "object") return entries;
205
+ let value;
206
+ let hasValue = false;
207
+ for (const key of Object.keys(props)) {
208
+ if (FORBIDDEN_NAMES.test(key.slice(key.indexOf(":") + 1)) || IGNORED_KEYS.test(key)) continue;
209
+ if (key === "children") {
210
+ if (textarea) {
211
+ value = Reflect.get(props, key);
212
+ hasValue = true;
213
+ }
214
+ continue;
215
+ }
216
+ entries.push([key, Reflect.get(props, key)]);
217
+ }
218
+ if (hasValue && !entries.some(([key]) => key === "value")) entries.push(["value", value]);
219
+ return entries;
220
+ }, (entries) => {
221
+ const current = /* @__PURE__ */ new Set();
222
+ for (const [key, value] of entries) {
223
+ current.add(key);
224
+ if (state.values.has(key) && Object.is(state.values.get(key), value) && !liveDiffers(el, key, value, isSVG)) continue;
225
+ state.values.set(key, value);
226
+ applyKey(el, key, value, state, isSVG);
227
+ }
228
+ for (const key of [...state.values.keys()]) {
229
+ if (current.has(key)) continue;
230
+ state.values.delete(key);
231
+ applyKey(el, key, void 0, state, isSVG);
232
+ }
266
233
  });
267
234
  }
268
235
  export { spread, spreadProps };