@shadow-js/web 1.0.5 → 1.1.0

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.
package/CHANGELOG.md CHANGED
@@ -1,5 +1,17 @@
1
1
  # Changelog
2
2
 
3
+ ## 1.1.0
4
+
5
+ ### Changed
6
+
7
+ - Released at 1.1.0 with the other packages. No change to this package.
8
+
9
+ ## 1.0.6
10
+
11
+ ### Fixed
12
+
13
+ - A `<select value={...}>` takes its value again when the options inside it change. Options that a `<For>`, a `<Show>` or an `<optgroup>` adds or replaces after the value was set no longer leave the browser's first option selected; this holds for a value that changes before the options exist and for the array of a `multiple` select.
14
+
3
15
  ## 1.0.5
4
16
 
5
17
  ### Fixed
package/README.md CHANGED
@@ -175,7 +175,7 @@ type tests are in `packages/web/test-types`.
175
175
  ## Dependencies
176
176
 
177
177
  - Runtime: none.
178
- - Peers: `@shadow-js/core` `^1.0.5`: the reactive primitives the renderer is built on.
178
+ - Peers: `@shadow-js/core` `^1.1.0`: the reactive primitives the renderer is built on.
179
179
 
180
180
  ## Types
181
181
 
@@ -120,6 +120,14 @@ function watchCommits(parent, run) {
120
120
  set.delete(run);
121
121
  });
122
122
  }
123
+ /**
124
+ * Like {@link watchCommits}, for a watch that lives as long as `parent` does: it is not tied to the owner that is
125
+ * current, so a binding that runs again does not end it. The select's value (see `setSelectValue`) uses it.
126
+ * @internal
127
+ */
128
+ function keepWatchingCommits(parent, run) {
129
+ commitWatchers.set(parent, (commitWatchers.get(parent) ?? /* @__PURE__ */ new Set()).add(run));
130
+ }
123
131
  /** Applies a flattened value to a region. */
124
132
  function commit(region, parts) {
125
133
  if (region.claimed !== void 0) {
@@ -138,6 +146,9 @@ function commit(region, parts) {
138
146
  commitWatchers.get(parent)?.forEach((run) => {
139
147
  run();
140
148
  });
149
+ if (parent.nodeName === "OPTGROUP" && parent.parentNode !== null) commitWatchers.get(parent.parentNode)?.forEach((run) => {
150
+ run();
151
+ });
141
152
  }
142
153
  /**
143
154
  * Applies a resolved value to a region. A string or number is the common case (a dynamic text): when the region
@@ -372,6 +383,6 @@ function insert(parent, value, anchorNode, initial) {
372
383
  const resolvedAnchor = anchorNode ?? null;
373
384
  return bindRegion(createRegion(parent, resolvedAnchor, initial === void 0 ? claims.current.takeRegion(parent, resolvedAnchor) : initial), value, resolvedAnchor === null);
374
385
  }
375
- export { anchor, bindRegion, createRegion, insert, moveRegion, removeRegion, watchCommits };
386
+ export { anchor, bindRegion, createRegion, insert, keepWatchingCommits, moveRegion, removeRegion, watchCommits };
376
387
 
377
388
  //# sourceMappingURL=insert.js.map
@@ -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 { 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"}
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/**\n * Like {@link watchCommits}, for a watch that lives as long as `parent` does: it is not tied to the owner that is\n * current, so a binding that runs again does not end it. The select's value (see `setSelectValue`) uses it.\n * @internal\n */\nexport function keepWatchingCommits(parent: Node, run: () => void): void {\n commitWatchers.set(parent, (commitWatchers.get(parent) ?? new Set<() => void>()).add(run));\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 // The options of an optgroup are the select's options.\n if (parent.nodeName === \"OPTGROUP\" && parent.parentNode !== null) {\n commitWatchers.get(parent.parentNode)?.forEach((run) => {\n run();\n });\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;;;;;;AAOA,SAAgB,oBAAoB,QAAc,KAAuB;CACvE,eAAe,IAAI,SAAS,eAAe,IAAI,MAAM,qBAAK,IAAI,IAAgB,EAAA,CAAG,IAAI,GAAG,CAAC;AAC3F;;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;CAED,IAAI,OAAO,aAAa,cAAc,OAAO,eAAe,MAC1D,eAAe,IAAI,OAAO,UAAU,CAAC,EAAE,SAAS,QAAQ;EACtD,IAAI;CACN,CAAC;AAEL;;;;;;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"}
@@ -2,7 +2,9 @@
2
2
  * Selects the options a `value` stands for. The compiler calls it for `<select value={...}>`. A
3
3
  * single value behaves like `select.value = value` (`null` and `undefined` are the empty string).
4
4
  * On a `<select multiple>` an array selects exactly the options whose value it lists and clears
5
- * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`).
5
+ * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`). The select
6
+ * takes the value again whenever the nodes inside it change (the options of a `<For>`, a `<Show>` or an optgroup), so
7
+ * options that arrive or are replaced after the value keep it selected.
6
8
  *
7
9
  * @param select The select element; its options must already be in it.
8
10
  * @param value A string or number (written as `String(value)`), or `null`/`undefined` (written as
@@ -1,4 +1,7 @@
1
+ import { keepWatchingCommits } from "./insert.js";
1
2
  // src/select-value.ts
3
+ /** The value each select was last given, which it takes again when its options change (see {@link setSelectValue}). */
4
+ const bound = /* @__PURE__ */ new WeakMap();
2
5
  /** The values an array stands for, as strings; null and undefined entries are skipped. */
3
6
  function listed(value) {
4
7
  return new Set(value.filter((item) => item !== null && item !== void 0).map(String));
@@ -11,7 +14,9 @@ function plainText(value) {
11
14
  * Selects the options a `value` stands for. The compiler calls it for `<select value={...}>`. A
12
15
  * single value behaves like `select.value = value` (`null` and `undefined` are the empty string).
13
16
  * On a `<select multiple>` an array selects exactly the options whose value it lists and clears
14
- * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`).
17
+ * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`). The select
18
+ * takes the value again whenever the nodes inside it change (the options of a `<For>`, a `<Show>` or an optgroup), so
19
+ * options that arrive or are replaced after the value keep it selected.
15
20
  *
16
21
  * @param select The select element; its options must already be in it.
17
22
  * @param value A string or number (written as `String(value)`), or `null`/`undefined` (written as
@@ -28,6 +33,11 @@ function plainText(value) {
28
33
  * @since 1.0.0
29
34
  */
30
35
  function setSelectValue(select, value) {
36
+ if (!bound.has(select)) keepWatchingCommits(select, () => apply(select, bound.get(select)));
37
+ bound.set(select, value);
38
+ apply(select, value);
39
+ }
40
+ function apply(select, value) {
31
41
  if (select.multiple && Array.isArray(value)) {
32
42
  const wanted = listed(value);
33
43
  for (const option of Array.from(select.options)) option.selected = wanted.has(option.value);
@@ -1 +1 @@
1
- {"version":3,"file":"select-value.js","names":[],"sources":["../../src/select-value.ts"],"sourcesContent":["/** The values an array stands for, as strings; null and undefined entries are skipped. */\nfunction listed(value: readonly unknown[]): Set<string> {\n return new Set(value.filter((item) => item !== null && item !== undefined).map(String));\n}\n\n/** The string a value assigns to `select.value`, `innerHTML` or `textContent`; null and undefined are empty. @internal */\nexport function plainText(value: unknown): string {\n return value === null || value === undefined ? \"\" : String(value);\n}\n\n/**\n * Selects the options a `value` stands for. The compiler calls it for `<select value={...}>`. A\n * single value behaves like `select.value = value` (`null` and `undefined` are the empty string).\n * On a `<select multiple>` an array selects exactly the options whose value it lists and clears\n * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`).\n *\n * @param select The select element; its options must already be in it.\n * @param value A string or number (written as `String(value)`), or `null`/`undefined` (written as\n * `\"\"`: an option with an empty value is selected, otherwise none). For a `multiple` select, an array of them: `null` and `undefined`\n * entries are skipped. An array on a single select is written as `String(array)`.\n * @example\n * import { setSelectValue } from \"@shadow-js/web\";\n *\n * const select = document.createElement(\"select\");\n * select.multiple = true;\n * select.append(new Option(\"A\", \"a\"), new Option(\"B\", \"b\"), new Option(\"C\", \"c\"));\n * setSelectValue(select, [\"a\", \"c\"]); // A and C selected, B cleared\n * @see ssrSelectValue\n * @since 1.0.0\n */\nexport function setSelectValue(select: HTMLSelectElement, value: unknown): void {\n if (select.multiple && Array.isArray(value)) {\n const wanted = listed(value);\n for (const option of Array.from(select.options)) option.selected = wanted.has(option.value);\n return;\n }\n select.value = plainText(value);\n}\n"],"mappings":";;AACA,SAAS,OAAO,OAAwC;CACtD,OAAO,IAAI,IAAI,MAAM,QAAQ,SAAS,SAAS,QAAQ,SAAS,KAAA,CAAS,CAAC,CAAC,IAAI,MAAM,CAAC;AACxF;;AAGA,SAAgB,UAAU,OAAwB;CAChD,OAAO,UAAU,QAAQ,UAAU,KAAA,IAAY,KAAK,OAAO,KAAK;AAClE;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,eAAe,QAA2B,OAAsB;CAC9E,IAAI,OAAO,YAAY,MAAM,QAAQ,KAAK,GAAG;EAC3C,MAAM,SAAS,OAAO,KAAK;EAC3B,KAAK,MAAM,UAAU,MAAM,KAAK,OAAO,OAAO,GAAG,OAAO,WAAW,OAAO,IAAI,OAAO,KAAK;EAC1F;CACF;CACA,OAAO,QAAQ,UAAU,KAAK;AAChC"}
1
+ {"version":3,"file":"select-value.js","names":[],"sources":["../../src/select-value.ts"],"sourcesContent":["import { keepWatchingCommits } from \"./insert\";\n\n/** The value each select was last given, which it takes again when its options change (see {@link setSelectValue}). */\nconst bound = new WeakMap<HTMLSelectElement, unknown>();\n\n/** The values an array stands for, as strings; null and undefined entries are skipped. */\nfunction listed(value: readonly unknown[]): Set<string> {\n return new Set(value.filter((item) => item !== null && item !== undefined).map(String));\n}\n\n/** The string a value assigns to `select.value`, `innerHTML` or `textContent`; null and undefined are empty. @internal */\nexport function plainText(value: unknown): string {\n return value === null || value === undefined ? \"\" : String(value);\n}\n\n/**\n * Selects the options a `value` stands for. The compiler calls it for `<select value={...}>`. A\n * single value behaves like `select.value = value` (`null` and `undefined` are the empty string).\n * On a `<select multiple>` an array selects exactly the options whose value it lists and clears\n * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`). The select\n * takes the value again whenever the nodes inside it change (the options of a `<For>`, a `<Show>` or an optgroup), so\n * options that arrive or are replaced after the value keep it selected.\n *\n * @param select The select element; its options must already be in it.\n * @param value A string or number (written as `String(value)`), or `null`/`undefined` (written as\n * `\"\"`: an option with an empty value is selected, otherwise none). For a `multiple` select, an array of them: `null` and `undefined`\n * entries are skipped. An array on a single select is written as `String(array)`.\n * @example\n * import { setSelectValue } from \"@shadow-js/web\";\n *\n * const select = document.createElement(\"select\");\n * select.multiple = true;\n * select.append(new Option(\"A\", \"a\"), new Option(\"B\", \"b\"), new Option(\"C\", \"c\"));\n * setSelectValue(select, [\"a\", \"c\"]); // A and C selected, B cleared\n * @see ssrSelectValue\n * @since 1.0.0\n */\nexport function setSelectValue(select: HTMLSelectElement, value: unknown): void {\n // Options that arrive or are replaced after this call (a `<For>` inside the select) leave the browser's own pick, the\n // first option: the select takes its value again after each commit to its children, as React's does.\n if (!bound.has(select)) keepWatchingCommits(select, () => apply(select, bound.get(select)));\n bound.set(select, value);\n apply(select, value);\n}\n\nfunction apply(select: HTMLSelectElement, value: unknown): void {\n if (select.multiple && Array.isArray(value)) {\n const wanted = listed(value);\n for (const option of Array.from(select.options)) option.selected = wanted.has(option.value);\n return;\n }\n select.value = plainText(value);\n}\n"],"mappings":";;;AAGA,MAAM,wBAAQ,IAAI,QAAoC;;AAGtD,SAAS,OAAO,OAAwC;CACtD,OAAO,IAAI,IAAI,MAAM,QAAQ,SAAS,SAAS,QAAQ,SAAS,KAAA,CAAS,CAAC,CAAC,IAAI,MAAM,CAAC;AACxF;;AAGA,SAAgB,UAAU,OAAwB;CAChD,OAAO,UAAU,QAAQ,UAAU,KAAA,IAAY,KAAK,OAAO,KAAK;AAClE;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,eAAe,QAA2B,OAAsB;CAG9E,IAAI,CAAC,MAAM,IAAI,MAAM,GAAG,oBAAoB,cAAc,MAAM,QAAQ,MAAM,IAAI,MAAM,CAAC,CAAC;CAC1F,MAAM,IAAI,QAAQ,KAAK;CACvB,MAAM,QAAQ,KAAK;AACrB;AAEA,SAAS,MAAM,QAA2B,OAAsB;CAC9D,IAAI,OAAO,YAAY,MAAM,QAAQ,KAAK,GAAG;EAC3C,MAAM,SAAS,OAAO,KAAK;EAC3B,KAAK,MAAM,UAAU,MAAM,KAAK,OAAO,OAAO,GAAG,OAAO,WAAW,OAAO,IAAI,OAAO,KAAK;EAC1F;CACF;CACA,OAAO,QAAQ,UAAU,KAAK;AAChC"}
@@ -1,2 +1,2 @@
1
- import{leaves as e}from"./internal/accessor.js";import{claims as t}from"./internal/hydration-hooks.js";import{keepFocus as n,reconcileNodes as r}from"./internal/reconcile.js";import{onCleanup as i,useRenderEffect as a}from"@shadow-js/core";import{addCleanup as o,createComputation as s,currentOwner as c,disposeOwner as l,readComputation as u}from"@shadow-js/core/extend";const d=/* @__PURE__ */ new WeakMap;function f(e){return e instanceof Document?e:e.ownerDocument??document}function p(e,t){let n=e.texts;return n===t||n instanceof Set&&n.has(t)}function m(e,t){let n=e.texts;n===null?e.texts=t:n instanceof Set?n.add(t):n!==t&&(e.texts=/* @__PURE__ */ new Set([n,t]))}function h(e,t){let n=e.texts;if(n!==null){if(n instanceof Set){let e=new Set(t);for(let t of n)e.has(t)||n.delete(t)}else t.includes(n)||(e.texts=null)}}const g=/* @__PURE__ */ new WeakMap;function _(t,n){let r=[];for(let i of e(t,`SHADOW_INSERT_CYCLE`,n))if(i!=null&&typeof i!=`boolean`){if(i instanceof DocumentFragment){let e=g.get(i)??[...i.childNodes];g.set(i,e);for(let t of e)r.push(t)}else r.push(i instanceof Node?i:String(i))}return r}function v(e){let t=/* @__PURE__ */ new Map;for(let n of e.nodes){if(!(n instanceof Text)||!p(e,n))continue;let r=t.get(n.data);r===void 0?t.set(n.data,[n]):r.push(n)}return t}function y(e,t){let n=t.length===1?t[0]:void 0;if(typeof n==`string`){let t=e.nodes.length===1?e.nodes[0]:void 0;if(t instanceof Text&&p(e,t))return t.data!==n&&(t.data=n),[t]}let r=Array(t.length),i=0,a=/* @__PURE__ */ new Set,o;for(let n of t)if(typeof n==`string`){o??=v(e);let t=o.get(n)?.pop();t===void 0&&(t=f(e.parent).createTextNode(n),m(e,t)),a.add(t),r[i]=t,i+=1}else a.has(n)||(a.add(n),r[i]=n,i+=1);return r.length=i,r}function b(e,t){if(e.anchor!==null)return e.anchor;if(t!==void 0)return t.nextSibling;let n=e.marker;return n===null?e.parent.firstChild:n.parentNode===e.parent?n.nextSibling:null}const x=/* @__PURE__ */ new WeakMap;function S(e,t){let n=x.get(e)??/* @__PURE__ */ new Set;x.set(e,n.add(t)),i(()=>{n.delete(t)})}function C(e,t){let n=y(e,t),i=e.parent,a=e.nodes.filter(e=>e.parentNode===i),o=a[0],s=b(e,a.at(-1));n.length===0&&o!==void 0&&(e.marker=o.previousSibling),r(i,a,n,s),e.nodes=n,h(e,n),x.get(i)?.forEach(e=>{e()})}function w(e,t){if(typeof t==`string`||typeof t==`number`){let n=e.nodes,r=String(t);if(n.length===1){let t=n[0];if(t instanceof Text&&t.parentNode===e.parent&&p(e,t)){t.data!==r&&(t.data=r);return}}else if(n.length===0){let t=f(e.parent).createTextNode(r);m(e,t),e.parent.insertBefore(t,b(e,void 0)),e.nodes=[t];return}}C(e,_(t))}function T(e,t,n){let r=[];if(n!==void 0){let t=/* @__PURE__ */ new Set;for(let i of _(n))typeof i==`string`||t.has(i)||i.parentNode!==e||(t.add(i),r.push(i))}let i={parent:e,anchor:t,marker:r.length>0?r[0].previousSibling:e.lastChild,nodes:r,texts:null};for(let e of r)e instanceof Text&&m(i,e);return i}function E(e){let t=e.parent,n=d.get(t);e.owner=c(),d.set(t,e);let r=e.nodes[0]??null;if(n===void 0||n.owner?.disposed||b(n,n.nodes.at(-1))!==r)return;let i=j(t,r);n.anchor=e.marker=i,n.owner&&o(n.owner,()=>i.remove())}function D(e){if(typeof e==`function`)return!0;if(!Array.isArray(e))return!1;let t=[e],n=/* @__PURE__ */ new Set([e]);for(;t.length>0;){let e=t.pop();for(let r of e){if(typeof r==`function`)return!0;Array.isArray(r)&&!n.has(r)&&(n.add(r),t.push(r))}}return!1}function O(e,t,n){if(!D(t))return w(e,t),t instanceof DocumentFragment?[...e.nodes]:t;let r;return n===!0&&E(e),a(typeof t==`function`?t:()=>t,t=>{if(r=t,D(t)){let n=c(),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Set,o=e=>{i.add(e);let t=r.get(e);return t===void 0&&(t=s({kind:`memo`,fn:()=>e(),allowWrites:!0,owner:n}),r.set(e,t)),u(t)};a(()=>{i=/* @__PURE__ */ new Set;let e=_(t,o);for(let[e,t]of r)i.has(e)||(r.delete(e),l(t));return e},t=>{C(e,t)})}else w(e,t)}),r}function k(e,t,r){let i=e.nodes.filter(t=>t.parentNode===e.parent);n(e.parent,()=>{for(let e of i)r(e)}),e.parent=t,e.marker=i[0]?.previousSibling??t.lastChild}function A(e){for(let t of e.nodes)t.parentNode===e.parent&&e.parent.removeChild(t);e.nodes=[],e.texts=null}function j(e,t){let n=f(e).createTextNode(``);return e.insertBefore(n,t),n}function M(e,n,r,i){let a=r??null;return O(T(e,a,i===void 0?t.current.takeRegion(e,a):i),n,a===null)}export{j as anchor,O as bindRegion,T as createRegion,M as insert,k as moveRegion,A as removeRegion,S as watchCommits};
1
+ import{leaves as e}from"./internal/accessor.js";import{claims as t}from"./internal/hydration-hooks.js";import{keepFocus as n,reconcileNodes as r}from"./internal/reconcile.js";import{onCleanup as i,useRenderEffect as a}from"@shadow-js/core";import{addCleanup as o,createComputation as s,currentOwner as c,disposeOwner as l,readComputation as u}from"@shadow-js/core/extend";const d=/* @__PURE__ */ new WeakMap;function f(e){return e instanceof Document?e:e.ownerDocument??document}function p(e,t){let n=e.texts;return n===t||n instanceof Set&&n.has(t)}function m(e,t){let n=e.texts;n===null?e.texts=t:n instanceof Set?n.add(t):n!==t&&(e.texts=/* @__PURE__ */ new Set([n,t]))}function h(e,t){let n=e.texts;if(n!==null){if(n instanceof Set){let e=new Set(t);for(let t of n)e.has(t)||n.delete(t)}else t.includes(n)||(e.texts=null)}}const g=/* @__PURE__ */ new WeakMap;function _(t,n){let r=[];for(let i of e(t,`SHADOW_INSERT_CYCLE`,n))if(i!=null&&typeof i!=`boolean`){if(i instanceof DocumentFragment){let e=g.get(i)??[...i.childNodes];g.set(i,e);for(let t of e)r.push(t)}else r.push(i instanceof Node?i:String(i))}return r}function v(e){let t=/* @__PURE__ */ new Map;for(let n of e.nodes){if(!(n instanceof Text)||!p(e,n))continue;let r=t.get(n.data);r===void 0?t.set(n.data,[n]):r.push(n)}return t}function y(e,t){let n=t.length===1?t[0]:void 0;if(typeof n==`string`){let t=e.nodes.length===1?e.nodes[0]:void 0;if(t instanceof Text&&p(e,t))return t.data!==n&&(t.data=n),[t]}let r=Array(t.length),i=0,a=/* @__PURE__ */ new Set,o;for(let n of t)if(typeof n==`string`){o??=v(e);let t=o.get(n)?.pop();t===void 0&&(t=f(e.parent).createTextNode(n),m(e,t)),a.add(t),r[i]=t,i+=1}else a.has(n)||(a.add(n),r[i]=n,i+=1);return r.length=i,r}function b(e,t){if(e.anchor!==null)return e.anchor;if(t!==void 0)return t.nextSibling;let n=e.marker;return n===null?e.parent.firstChild:n.parentNode===e.parent?n.nextSibling:null}const x=/* @__PURE__ */ new WeakMap;function S(e,t){let n=x.get(e)??/* @__PURE__ */ new Set;x.set(e,n.add(t)),i(()=>{n.delete(t)})}function C(e,t){x.set(e,(x.get(e)??/* @__PURE__ */ new Set).add(t))}function w(e,t){let n=y(e,t),i=e.parent,a=e.nodes.filter(e=>e.parentNode===i),o=a[0],s=b(e,a.at(-1));n.length===0&&o!==void 0&&(e.marker=o.previousSibling),r(i,a,n,s),e.nodes=n,h(e,n),x.get(i)?.forEach(e=>{e()}),i.nodeName===`OPTGROUP`&&i.parentNode!==null&&x.get(i.parentNode)?.forEach(e=>{e()})}function T(e,t){if(typeof t==`string`||typeof t==`number`){let n=e.nodes,r=String(t);if(n.length===1){let t=n[0];if(t instanceof Text&&t.parentNode===e.parent&&p(e,t)){t.data!==r&&(t.data=r);return}}else if(n.length===0){let t=f(e.parent).createTextNode(r);m(e,t),e.parent.insertBefore(t,b(e,void 0)),e.nodes=[t];return}}w(e,_(t))}function E(e,t,n){let r=[];if(n!==void 0){let t=/* @__PURE__ */ new Set;for(let i of _(n))typeof i==`string`||t.has(i)||i.parentNode!==e||(t.add(i),r.push(i))}let i={parent:e,anchor:t,marker:r.length>0?r[0].previousSibling:e.lastChild,nodes:r,texts:null};for(let e of r)e instanceof Text&&m(i,e);return i}function D(e){let t=e.parent,n=d.get(t);e.owner=c(),d.set(t,e);let r=e.nodes[0]??null;if(n===void 0||n.owner?.disposed||b(n,n.nodes.at(-1))!==r)return;let i=M(t,r);n.anchor=e.marker=i,n.owner&&o(n.owner,()=>i.remove())}function O(e){if(typeof e==`function`)return!0;if(!Array.isArray(e))return!1;let t=[e],n=/* @__PURE__ */ new Set([e]);for(;t.length>0;){let e=t.pop();for(let r of e){if(typeof r==`function`)return!0;Array.isArray(r)&&!n.has(r)&&(n.add(r),t.push(r))}}return!1}function k(e,t,n){if(!O(t))return T(e,t),t instanceof DocumentFragment?[...e.nodes]:t;let r;return n===!0&&D(e),a(typeof t==`function`?t:()=>t,t=>{if(r=t,O(t)){let n=c(),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Set,o=e=>{i.add(e);let t=r.get(e);return t===void 0&&(t=s({kind:`memo`,fn:()=>e(),allowWrites:!0,owner:n}),r.set(e,t)),u(t)};a(()=>{i=/* @__PURE__ */ new Set;let e=_(t,o);for(let[e,t]of r)i.has(e)||(r.delete(e),l(t));return e},t=>{w(e,t)})}else T(e,t)}),r}function A(e,t,r){let i=e.nodes.filter(t=>t.parentNode===e.parent);n(e.parent,()=>{for(let e of i)r(e)}),e.parent=t,e.marker=i[0]?.previousSibling??t.lastChild}function j(e){for(let t of e.nodes)t.parentNode===e.parent&&e.parent.removeChild(t);e.nodes=[],e.texts=null}function M(e,t){let n=f(e).createTextNode(``);return e.insertBefore(n,t),n}function N(e,n,r,i){let a=r??null;return k(E(e,a,i===void 0?t.current.takeRegion(e,a):i),n,a===null)}export{M as anchor,k as bindRegion,E as createRegion,N as insert,C as keepWatchingCommits,A as moveRegion,j as removeRegion,S as watchCommits};
2
2
  //# sourceMappingURL=insert.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"insert.js","names":["tails","documentOf","node","ownsText","texts","region","addText","text","pruneTexts","kept","keep","fragmentChildren","flatten","parts","item","leaves","root","call","kids","child","reusablePool","pool","list","materialize","only","current","nodes","count","seen","part","endOf","last","marker","commitWatchers","watchCommits","set","parent","run","onCleanup","commit","next","attached","first","end","reconcileNodes","commitValue","raw","created","createRegion","initial","anchorNode","linkRegion","tail","currentOwner","start","anchor","addCleanup","containsFunction","stack","frame","bindRegion","value","latest","ordered","useRenderEffect","owner","memos","touched","fn","createComputation","readComputation","disposeOwner","moveRegion","keepFocus","move","removeRegion","before","insert","resolvedAnchor","claims"],"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":"A,oXA+CA,MAAMA,kBAAQ,IAAI,QAGlB,SAASC,EAAW,EAAsB,CACxC,OAAOC,aAAgB,SAAWA,EAAQA,EAAK,eAAiB,QAClE,CAGA,SAASC,EAAS,EAAgB,EAAqB,CACrD,IAAMC,EAAQC,EAAO,MACrB,OAAOD,IAAUF,GAASE,aAAiB,KAAOA,EAAM,IAAIF,CAAY,CAC1E,CAGA,SAASI,EAAQ,EAAgB,EAAkB,CACjD,IAAMF,EAAQC,EAAO,MACjBD,IAAU,KAAM,EAAO,MAAQG,EAC1BH,aAAiB,IAAKA,EAAM,IAAIG,CAAI,EACpCH,IAAUG,IAAM,EAAO,sBAAQ,IAAI,IAAI,CAACH,EAAOG,CAAI,CAAC,EAC/D,CAGA,SAASC,EAAW,EAAgB,EAA6B,CAC/D,IAAMJ,EAAQC,EAAO,MACrB,GAAID,IAAU,KACd,IAAIA,aAAiB,IAAK,CACxB,IAAMK,EAAO,IAAI,IAAUC,CAAI,EAC/B,IAAK,IAAMH,KAAQH,EACZK,EAAK,IAAIF,CAAI,GAAGH,EAAM,OAAOG,CAAI,CAE1C,MAAYG,EAAK,SAASN,CAAK,IAAG,EAAO,MAAQ,KAAA,CACnD,CAMA,MAAMO,kBAAmB,IAAI,QAM7B,SAASC,EAAQ,EAAe,EAA+C,CAC7E,IAAMC,EAAgB,CAAC,EAEvB,IAAK,IAAMC,KAAQC,EAAOC,EAAM,sBAAOC,CAAI,EACzC,GAAIH,GAAS,MAA8B,OAAOA,GAAS,UAC3D,IAAIA,aAAgB,iBAAkB,CACpC,IAAMI,EAAOP,EAAiB,IAAIG,CAAI,GAAK,CAAC,GAAGA,EAAK,UAAU,EAC9DH,EAAiB,IAAIG,EAAMI,CAAI,EAC/B,IAAK,IAAMC,KAASD,EAAML,EAAM,KAAKM,CAAK,CAC5C,MAAON,EAAM,KAAKC,aAAgB,KAAOA,EAAO,OAAOA,CAAI,CAAC,CAAA,CAE9D,OAAOD,CACT,CAGA,SAASO,EAAa,EAAqC,CACzD,IAAMC,kBAAO,IAAI,IACjB,IAAK,IAAMnB,KAAQG,EAAO,MAAO,CAC/B,GAAI,EAAEH,aAAgB,OAAS,CAACC,EAASE,EAAQH,CAAI,EAAG,SACxD,IAAMoB,EAAOD,EAAK,IAAInB,EAAK,IAAI,EAC3BoB,IAAS,IAAA,GAAWD,EAAK,IAAInB,EAAK,KAAM,CAACA,CAAI,CAAC,EAC7CoB,EAAK,KAAKpB,CAAI,CACrB,CACA,OAAOmB,CACT,CAGA,SAASE,EAAY,EAAgB,EAAgC,CACnE,IAAMC,EAAOX,EAAM,SAAW,EAAIA,EAAM,GAAK,IAAA,GAC7C,GAAI,OAAOW,GAAS,SAAU,CAC5B,IAAMC,EAAUpB,EAAO,MAAM,SAAW,EAAIA,EAAO,MAAM,GAAK,IAAA,GAC9D,GAAIoB,aAAmB,MAAQtB,EAASE,EAAQoB,CAAO,EAErD,OADIA,EAAQ,OAASD,IAAM,EAAQ,KAAOA,GACnC,CAACC,CAAO,CAEnB,CAEA,IAAMC,EAAoB,MAAYb,EAAM,MAAM,EAC9Cc,EAAQ,EACNC,kBAAO,IAAI,IACbP,EACJ,IAAK,IAAMQ,KAAQhB,EACjB,GAAI,OAAOgB,GAAS,SAAU,CAC5B,IAAST,EAAaf,CAAM,EAE5B,IAAIE,EADWc,EAAK,IAAIQ,CAAI,CAAC,EAAE,IAAI,EAE/BtB,IAAS,IAAA,KACX,EAAON,EAAWI,EAAO,MAAM,CAAC,CAAC,eAAewB,CAAI,EACpDvB,EAAQD,EAAQE,CAAI,GAEtBqB,EAAK,IAAIrB,CAAI,EACb,EAAMoB,GAASpB,EACf,GAAS,CACX,MAAYqB,EAAK,IAAIC,CAAI,IACvBD,EAAK,IAAIC,CAAI,EACb,EAAMF,GAASE,EACf,GAAS,GAIb,MADA,GAAM,OAASF,EACRD,CACT,CAGA,SAASI,EAAM,EAAgB,EAAqC,CAClE,GAAIzB,EAAO,SAAW,KAAM,OAAOA,EAAO,OAC1C,GAAI0B,IAAS,IAAA,GAAW,OAAOA,EAAK,YACpC,IAAMC,EAAS3B,EAAO,OAGtB,OAFI2B,IAAW,KAAa3B,EAAO,OAAO,WACtC2B,EAAO,aAAe3B,EAAO,OAC1B2B,EAAO,YADkC,IAElD,CAGA,MAAMC,kBAAiB,IAAI,QAQ3B,SAAgBC,EAAa,EAAc,EAAuB,CAChE,IAAMC,EAAMF,EAAe,IAAIG,CAAM,mBAAK,IAAI,IAC9CH,EAAe,IAAIG,EAAQD,EAAI,IAAIE,CAAG,CAAC,EACvCC,MAAgB,CACdH,EAAI,OAAOE,CAAG,CAChB,CAAC,CACH,CAGA,SAASE,EAAO,EAAgB,EAA8B,CAO5D,IAAMC,EAAOjB,EAAYlB,EAAQQ,CAAK,EAChCuB,EAAS/B,EAAO,OAChBoC,EAAWpC,EAAO,MAAM,OAAQ,GAASH,EAAK,aAAekC,CAAM,EACnEM,EAAQD,EAAS,GACjBE,EAAMb,EAAMzB,EAAQoC,EAAS,GAAG,EAAE,CAAC,EACrCD,EAAK,SAAW,GAAKE,IAAU,IAAA,KAAW,EAAO,OAASA,EAAM,iBACpEE,EAAeR,EAAQK,EAAUD,EAAMG,CAAG,EAC1C,EAAO,MAAQH,EACfhC,EAAWH,EAAQmC,CAAI,EACvBP,EAAe,IAAIG,CAAM,CAAC,EAAE,QAAS,GAAQ,CAC3CC,EAAI,CACN,CAAC,CACH,CAOA,SAASQ,EAAY,EAAgB,EAAoB,CACvD,GAAK,OAAOC,GAAQ,UAAY,OAAOA,GAAQ,SAA2C,CACxF,IAAMpB,EAAQrB,EAAO,MACfE,EAAO,OAAOuC,CAAG,EACvB,GAAIpB,EAAM,SAAW,EAAG,CACtB,IAAMD,EAAUC,EAAM,GACtB,GACED,aAAmB,MACnBA,EAAQ,aAAepB,EAAO,QAC9BF,EAASE,EAAQoB,CAAO,EACxB,CACIA,EAAQ,OAASlB,IAAM,EAAQ,KAAOA,GAC1C,MACF,CACF,MAAO,GAAImB,EAAM,SAAW,EAAG,CAC7B,IAAMqB,EAAU9C,EAAWI,EAAO,MAAM,CAAC,CAAC,eAAeE,CAAI,EAC7DD,EAAQD,EAAQ0C,CAAO,EACvB1C,EAAO,OAAO,aAAa0C,EAASjB,EAAMzB,EAAQ,IAAA,EAAS,CAAC,EAC5D,EAAO,MAAQ,CAAC0C,CAAO,EACvB,MACF,CACF,CACAR,EAAOlC,EAAQO,EAAQkC,CAAG,CAAC,CAC7B,CAOA,SAAgBE,EAAa,EAAc,EAAyB,EAA0B,CAE5F,IAAMtB,EAAgB,CAAC,EACvB,GAAIuB,IAAY,IAAA,GAAW,CACzB,IAAMrB,kBAAO,IAAI,IACjB,IAAK,IAAMC,KAAQjB,EAAQqC,CAAO,EAC5B,OAAOpB,GAAS,UAAYD,EAAK,IAAIC,CAAI,GAAKA,EAAK,aAAeO,IACtER,EAAK,IAAIC,CAAI,EACbH,EAAM,KAAKG,CAAI,EAEnB,CAEA,IAAMxB,EAAiB,CACrB,SACA,OAAQ6C,EACR,OAJaxB,EAAM,OAAS,EAAKA,EAAM,EAAE,CAAU,gBAAkBU,EAAO,UAK5E,QACA,MAAO,IACT,EACA,IAAK,IAAMlC,KAAQwB,EAAWxB,aAAgB,MAAMI,EAAQD,EAAQH,CAAI,EAGxE,OAAOG,CACT,CAWA,SAAS8C,EAAW,EAAsB,CACxC,IAAMf,EAAS/B,EAAO,OAChB+C,EAAOpD,EAAM,IAAIoC,CAAM,EAC7B,EAAO,MAAQiB,EAAa,EAC5BrD,EAAM,IAAIoC,EAAQ/B,CAAM,EACxB,IAAMiD,EAAQjD,EAAO,MAAM,IAAM,KACjC,GAAI+C,IAAS,IAAA,IAAaA,EAAK,OAAO,UAAYtB,EAAMsB,EAAMA,EAAK,MAAM,GAAG,EAAE,CAAC,IAAME,EACnF,OACF,IAAM/C,EAAOgD,EAAOnB,EAAQkB,CAAK,EACjC,EAAK,OAAS,EAAO,OAAS/C,EAI1B6C,EAAK,OAAOI,EAAWJ,EAAK,UAAa7C,EAAK,OAAO,CAAC,CAC5D,CAMA,SAASkD,EAAiB,EAAwB,CAChD,GAAI,OAAOzC,GAAS,WAAY,MAAO,GACvC,GAAI,CAAC,MAAM,QAAQA,CAAI,EAAG,MAAO,GACjC,IAAM0C,EAAqB,CAAC1C,CAAI,EAC1BY,kBAAO,IAAI,IAAe,CAACZ,CAAI,CAAC,EACtC,KAAO0C,EAAM,OAAS,GAAG,CACvB,IAAMC,EAAQD,EAAM,IAAI,EACxB,IAAK,IAAM5C,KAAQ6C,EAAO,CACxB,GAAI,OAAO7C,GAAS,WAAY,MAAO,GACnC,MAAM,QAAQA,CAAI,GAAK,CAACc,EAAK,IAAId,CAAI,IACvCc,EAAK,IAAId,CAAI,EACb4C,EAAM,KAAK5C,CAAI,EAEnB,CACF,CACA,MAAO,EACT,CASA,SAAgB8C,EAAW,EAAgB,EAAgB,EAA4B,CACrF,GAAI,CAACH,EAAiBI,CAAK,EAEzB,OADAhB,EAAYxC,EAAQwD,CAAK,EAClBA,aAAiB,iBAAmB,CAAC,GAAGxD,EAAO,KAAK,EAAIwD,EAEjE,IAAIC,EAmDJ,OAlDIC,IAAY,IAAMZ,EAAW9C,CAAM,EAWvC2D,EAViB,OAAOH,GAAU,WAAcA,MAAgCA,EAUrD,GAAQ,CAEjC,GADA,EAASf,EACLW,EAAiBX,CAAG,EAAG,CAKzB,IAAMmB,EAAQZ,EAAa,EACrBa,kBAAQ,IAAI,IACdC,kBAAU,IAAI,IACZlD,EAAQ,GAA+B,CAC3CkD,EAAQ,IAAIC,CAAE,EACd,IAAIlE,EAAOgE,EAAM,IAAIE,CAAE,EAMvB,OALIlE,IAAS,IAAA,KAEX,EAAOmE,EAAkB,CAAE,KAAM,OAAQ,OAAUD,EAAG,EAAG,YAAa,GAAM,OAAM,CAAC,EACnFF,EAAM,IAAIE,EAAIlE,CAAI,GAEboE,EAAgBpE,CAAI,CAC7B,EACA8D,MACQ,CACJ,kBAAU,IAAI,IACd,IAAMnD,EAAQD,EAAQkC,EAAK7B,CAAI,EAC/B,IAAK,GAAM,CAACmD,EAAIlE,KAASgE,EACnBC,EAAQ,IAAIC,CAAE,IAClBF,EAAM,OAAOE,CAAE,EACfG,EAAarE,CAAI,GAEnB,OAAOW,CACT,EACC,GAAU,CACT0B,EAAOlC,EAAQQ,CAAK,CACtB,CACF,CACF,MACEgC,EAAYxC,EAAQyC,CAAG,CAE3B,CAAC,EACMgB,CACT,CAYA,SAAgBU,EAAW,EAAgB,EAAc,EAAkC,CACzF,IAAM/B,EAAWpC,EAAO,MAAM,OAAQ,GAASH,EAAK,aAAeG,EAAO,MAAM,EAEhFoE,EAAUpE,EAAO,WAAc,CAC7B,IAAK,IAAMH,KAAQuC,EAAUiC,EAAKxE,CAAI,CACxC,CAAC,EAED,EAA6B,OAASkC,EACtC,EAAO,OAASK,EAAS,EAAE,EAAE,iBAAmBL,EAAO,SACzD,CAOA,SAAgBuC,EAAa,EAAsB,CACjD,IAAK,IAAMzE,KAAQG,EAAO,MACpBH,EAAK,aAAeG,EAAO,QAAQA,EAAO,OAAO,YAAYH,CAAI,EAEvE,EAAO,MAAQ,CAAC,EAChB,EAAO,MAAQ,IACjB,CAkBA,SAAgBqD,EAAO,EAAc,EAA2B,CAC9D,IAAMhD,EAAON,EAAWmC,CAAM,CAAC,CAAC,eAAe,EAAE,EAEjD,OADAA,EAAO,aAAa7B,EAAMqE,CAAM,EACzBrE,CACT,CAwCA,SAAgBsE,EACd,EACA,EACA,EACA,EACS,CACT,IAAMC,EAAiB5B,GAAc,KAIrC,OAAOU,EADQZ,EAAaZ,EAAQ0C,EADlC7B,IAAY,IAAA,GAAY8B,EAAO,QAAQ,WAAW3C,EAAQ0C,CAAc,EAAI7B,CAEvD,EAAGY,EAAOiB,IAAmB,IAAI,CAC1D,C"}
1
+ {"version":3,"file":"insert.js","names":["tails","documentOf","node","ownsText","texts","region","addText","text","pruneTexts","kept","keep","fragmentChildren","flatten","parts","item","leaves","root","call","kids","child","reusablePool","pool","list","materialize","only","current","nodes","count","seen","part","endOf","last","marker","commitWatchers","watchCommits","set","parent","run","onCleanup","keepWatchingCommits","commit","next","attached","first","end","reconcileNodes","commitValue","raw","created","createRegion","initial","anchorNode","linkRegion","tail","currentOwner","start","anchor","addCleanup","containsFunction","stack","frame","bindRegion","value","latest","ordered","useRenderEffect","owner","memos","touched","fn","createComputation","readComputation","disposeOwner","moveRegion","keepFocus","move","removeRegion","before","insert","resolvedAnchor","claims"],"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/**\n * Like {@link watchCommits}, for a watch that lives as long as `parent` does: it is not tied to the owner that is\n * current, so a binding that runs again does not end it. The select's value (see `setSelectValue`) uses it.\n * @internal\n */\nexport function keepWatchingCommits(parent: Node, run: () => void): void {\n commitWatchers.set(parent, (commitWatchers.get(parent) ?? new Set<() => void>()).add(run));\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 // The options of an optgroup are the select's options.\n if (parent.nodeName === \"OPTGROUP\" && parent.parentNode !== null) {\n commitWatchers.get(parent.parentNode)?.forEach((run) => {\n run();\n });\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":"A,oXA+CA,MAAMA,kBAAQ,IAAI,QAGlB,SAASC,EAAW,EAAsB,CACxC,OAAOC,aAAgB,SAAWA,EAAQA,EAAK,eAAiB,QAClE,CAGA,SAASC,EAAS,EAAgB,EAAqB,CACrD,IAAMC,EAAQC,EAAO,MACrB,OAAOD,IAAUF,GAASE,aAAiB,KAAOA,EAAM,IAAIF,CAAY,CAC1E,CAGA,SAASI,EAAQ,EAAgB,EAAkB,CACjD,IAAMF,EAAQC,EAAO,MACjBD,IAAU,KAAM,EAAO,MAAQG,EAC1BH,aAAiB,IAAKA,EAAM,IAAIG,CAAI,EACpCH,IAAUG,IAAM,EAAO,sBAAQ,IAAI,IAAI,CAACH,EAAOG,CAAI,CAAC,EAC/D,CAGA,SAASC,EAAW,EAAgB,EAA6B,CAC/D,IAAMJ,EAAQC,EAAO,MACrB,GAAID,IAAU,KACd,IAAIA,aAAiB,IAAK,CACxB,IAAMK,EAAO,IAAI,IAAUC,CAAI,EAC/B,IAAK,IAAMH,KAAQH,EACZK,EAAK,IAAIF,CAAI,GAAGH,EAAM,OAAOG,CAAI,CAE1C,MAAYG,EAAK,SAASN,CAAK,IAAG,EAAO,MAAQ,KAAA,CACnD,CAMA,MAAMO,kBAAmB,IAAI,QAM7B,SAASC,EAAQ,EAAe,EAA+C,CAC7E,IAAMC,EAAgB,CAAC,EAEvB,IAAK,IAAMC,KAAQC,EAAOC,EAAM,sBAAOC,CAAI,EACzC,GAAIH,GAAS,MAA8B,OAAOA,GAAS,UAC3D,IAAIA,aAAgB,iBAAkB,CACpC,IAAMI,EAAOP,EAAiB,IAAIG,CAAI,GAAK,CAAC,GAAGA,EAAK,UAAU,EAC9DH,EAAiB,IAAIG,EAAMI,CAAI,EAC/B,IAAK,IAAMC,KAASD,EAAML,EAAM,KAAKM,CAAK,CAC5C,MAAON,EAAM,KAAKC,aAAgB,KAAOA,EAAO,OAAOA,CAAI,CAAC,CAAA,CAE9D,OAAOD,CACT,CAGA,SAASO,EAAa,EAAqC,CACzD,IAAMC,kBAAO,IAAI,IACjB,IAAK,IAAMnB,KAAQG,EAAO,MAAO,CAC/B,GAAI,EAAEH,aAAgB,OAAS,CAACC,EAASE,EAAQH,CAAI,EAAG,SACxD,IAAMoB,EAAOD,EAAK,IAAInB,EAAK,IAAI,EAC3BoB,IAAS,IAAA,GAAWD,EAAK,IAAInB,EAAK,KAAM,CAACA,CAAI,CAAC,EAC7CoB,EAAK,KAAKpB,CAAI,CACrB,CACA,OAAOmB,CACT,CAGA,SAASE,EAAY,EAAgB,EAAgC,CACnE,IAAMC,EAAOX,EAAM,SAAW,EAAIA,EAAM,GAAK,IAAA,GAC7C,GAAI,OAAOW,GAAS,SAAU,CAC5B,IAAMC,EAAUpB,EAAO,MAAM,SAAW,EAAIA,EAAO,MAAM,GAAK,IAAA,GAC9D,GAAIoB,aAAmB,MAAQtB,EAASE,EAAQoB,CAAO,EAErD,OADIA,EAAQ,OAASD,IAAM,EAAQ,KAAOA,GACnC,CAACC,CAAO,CAEnB,CAEA,IAAMC,EAAoB,MAAYb,EAAM,MAAM,EAC9Cc,EAAQ,EACNC,kBAAO,IAAI,IACbP,EACJ,IAAK,IAAMQ,KAAQhB,EACjB,GAAI,OAAOgB,GAAS,SAAU,CAC5B,IAAST,EAAaf,CAAM,EAE5B,IAAIE,EADWc,EAAK,IAAIQ,CAAI,CAAC,EAAE,IAAI,EAE/BtB,IAAS,IAAA,KACX,EAAON,EAAWI,EAAO,MAAM,CAAC,CAAC,eAAewB,CAAI,EACpDvB,EAAQD,EAAQE,CAAI,GAEtBqB,EAAK,IAAIrB,CAAI,EACb,EAAMoB,GAASpB,EACf,GAAS,CACX,MAAYqB,EAAK,IAAIC,CAAI,IACvBD,EAAK,IAAIC,CAAI,EACb,EAAMF,GAASE,EACf,GAAS,GAIb,MADA,GAAM,OAASF,EACRD,CACT,CAGA,SAASI,EAAM,EAAgB,EAAqC,CAClE,GAAIzB,EAAO,SAAW,KAAM,OAAOA,EAAO,OAC1C,GAAI0B,IAAS,IAAA,GAAW,OAAOA,EAAK,YACpC,IAAMC,EAAS3B,EAAO,OAGtB,OAFI2B,IAAW,KAAa3B,EAAO,OAAO,WACtC2B,EAAO,aAAe3B,EAAO,OAC1B2B,EAAO,YADkC,IAElD,CAGA,MAAMC,kBAAiB,IAAI,QAQ3B,SAAgBC,EAAa,EAAc,EAAuB,CAChE,IAAMC,EAAMF,EAAe,IAAIG,CAAM,mBAAK,IAAI,IAC9CH,EAAe,IAAIG,EAAQD,EAAI,IAAIE,CAAG,CAAC,EACvCC,MAAgB,CACdH,EAAI,OAAOE,CAAG,CAChB,CAAC,CACH,CAOA,SAAgBE,EAAoB,EAAc,EAAuB,CACvEN,EAAe,IAAIG,GAASH,EAAe,IAAIG,CAAM,mBAAK,IAAI,IAAgB,CAAG,IAAIC,CAAG,CAAC,CAC3F,CAGA,SAASG,EAAO,EAAgB,EAA8B,CAO5D,IAAMC,EAAOlB,EAAYlB,EAAQQ,CAAK,EAChCuB,EAAS/B,EAAO,OAChBqC,EAAWrC,EAAO,MAAM,OAAQ,GAASH,EAAK,aAAekC,CAAM,EACnEO,EAAQD,EAAS,GACjBE,EAAMd,EAAMzB,EAAQqC,EAAS,GAAG,EAAE,CAAC,EACrCD,EAAK,SAAW,GAAKE,IAAU,IAAA,KAAW,EAAO,OAASA,EAAM,iBACpEE,EAAeT,EAAQM,EAAUD,EAAMG,CAAG,EAC1C,EAAO,MAAQH,EACfjC,EAAWH,EAAQoC,CAAI,EACvBR,EAAe,IAAIG,CAAM,CAAC,EAAE,QAAS,GAAQ,CAC3CC,EAAI,CACN,CAAC,EAEGD,EAAO,WAAa,YAAcA,EAAO,aAAe,MAC1DH,EAAe,IAAIG,EAAO,UAAU,CAAC,EAAE,QAAS,GAAQ,CACtDC,EAAI,CACN,CAAC,CAEL,CAOA,SAASS,EAAY,EAAgB,EAAoB,CACvD,GAAK,OAAOC,GAAQ,UAAY,OAAOA,GAAQ,SAA2C,CACxF,IAAMrB,EAAQrB,EAAO,MACfE,EAAO,OAAOwC,CAAG,EACvB,GAAIrB,EAAM,SAAW,EAAG,CACtB,IAAMD,EAAUC,EAAM,GACtB,GACED,aAAmB,MACnBA,EAAQ,aAAepB,EAAO,QAC9BF,EAASE,EAAQoB,CAAO,EACxB,CACIA,EAAQ,OAASlB,IAAM,EAAQ,KAAOA,GAC1C,MACF,CACF,MAAO,GAAImB,EAAM,SAAW,EAAG,CAC7B,IAAMsB,EAAU/C,EAAWI,EAAO,MAAM,CAAC,CAAC,eAAeE,CAAI,EAC7DD,EAAQD,EAAQ2C,CAAO,EACvB3C,EAAO,OAAO,aAAa2C,EAASlB,EAAMzB,EAAQ,IAAA,EAAS,CAAC,EAC5D,EAAO,MAAQ,CAAC2C,CAAO,EACvB,MACF,CACF,CACAR,EAAOnC,EAAQO,EAAQmC,CAAG,CAAC,CAC7B,CAOA,SAAgBE,EAAa,EAAc,EAAyB,EAA0B,CAE5F,IAAMvB,EAAgB,CAAC,EACvB,GAAIwB,IAAY,IAAA,GAAW,CACzB,IAAMtB,kBAAO,IAAI,IACjB,IAAK,IAAMC,KAAQjB,EAAQsC,CAAO,EAC5B,OAAOrB,GAAS,UAAYD,EAAK,IAAIC,CAAI,GAAKA,EAAK,aAAeO,IACtER,EAAK,IAAIC,CAAI,EACbH,EAAM,KAAKG,CAAI,EAEnB,CAEA,IAAMxB,EAAiB,CACrB,SACA,OAAQ8C,EACR,OAJazB,EAAM,OAAS,EAAKA,EAAM,EAAE,CAAU,gBAAkBU,EAAO,UAK5E,QACA,MAAO,IACT,EACA,IAAK,IAAMlC,KAAQwB,EAAWxB,aAAgB,MAAMI,EAAQD,EAAQH,CAAI,EAGxE,OAAOG,CACT,CAWA,SAAS+C,EAAW,EAAsB,CACxC,IAAMhB,EAAS/B,EAAO,OAChBgD,EAAOrD,EAAM,IAAIoC,CAAM,EAC7B,EAAO,MAAQkB,EAAa,EAC5BtD,EAAM,IAAIoC,EAAQ/B,CAAM,EACxB,IAAMkD,EAAQlD,EAAO,MAAM,IAAM,KACjC,GAAIgD,IAAS,IAAA,IAAaA,EAAK,OAAO,UAAYvB,EAAMuB,EAAMA,EAAK,MAAM,GAAG,EAAE,CAAC,IAAME,EACnF,OACF,IAAMhD,EAAOiD,EAAOpB,EAAQmB,CAAK,EACjC,EAAK,OAAS,EAAO,OAAShD,EAI1B8C,EAAK,OAAOI,EAAWJ,EAAK,UAAa9C,EAAK,OAAO,CAAC,CAC5D,CAMA,SAASmD,EAAiB,EAAwB,CAChD,GAAI,OAAO1C,GAAS,WAAY,MAAO,GACvC,GAAI,CAAC,MAAM,QAAQA,CAAI,EAAG,MAAO,GACjC,IAAM2C,EAAqB,CAAC3C,CAAI,EAC1BY,kBAAO,IAAI,IAAe,CAACZ,CAAI,CAAC,EACtC,KAAO2C,EAAM,OAAS,GAAG,CACvB,IAAMC,EAAQD,EAAM,IAAI,EACxB,IAAK,IAAM7C,KAAQ8C,EAAO,CACxB,GAAI,OAAO9C,GAAS,WAAY,MAAO,GACnC,MAAM,QAAQA,CAAI,GAAK,CAACc,EAAK,IAAId,CAAI,IACvCc,EAAK,IAAId,CAAI,EACb6C,EAAM,KAAK7C,CAAI,EAEnB,CACF,CACA,MAAO,EACT,CASA,SAAgB+C,EAAW,EAAgB,EAAgB,EAA4B,CACrF,GAAI,CAACH,EAAiBI,CAAK,EAEzB,OADAhB,EAAYzC,EAAQyD,CAAK,EAClBA,aAAiB,iBAAmB,CAAC,GAAGzD,EAAO,KAAK,EAAIyD,EAEjE,IAAIC,EAmDJ,OAlDIC,IAAY,IAAMZ,EAAW/C,CAAM,EAWvC4D,EAViB,OAAOH,GAAU,WAAcA,MAAgCA,EAUrD,GAAQ,CAEjC,GADA,EAASf,EACLW,EAAiBX,CAAG,EAAG,CAKzB,IAAMmB,EAAQZ,EAAa,EACrBa,kBAAQ,IAAI,IACdC,kBAAU,IAAI,IACZnD,EAAQ,GAA+B,CAC3CmD,EAAQ,IAAIC,CAAE,EACd,IAAInE,EAAOiE,EAAM,IAAIE,CAAE,EAMvB,OALInE,IAAS,IAAA,KAEX,EAAOoE,EAAkB,CAAE,KAAM,OAAQ,OAAUD,EAAG,EAAG,YAAa,GAAM,OAAM,CAAC,EACnFF,EAAM,IAAIE,EAAInE,CAAI,GAEbqE,EAAgBrE,CAAI,CAC7B,EACA+D,MACQ,CACJ,kBAAU,IAAI,IACd,IAAMpD,EAAQD,EAAQmC,EAAK9B,CAAI,EAC/B,IAAK,GAAM,CAACoD,EAAInE,KAASiE,EACnBC,EAAQ,IAAIC,CAAE,IAClBF,EAAM,OAAOE,CAAE,EACfG,EAAatE,CAAI,GAEnB,OAAOW,CACT,EACC,GAAU,CACT2B,EAAOnC,EAAQQ,CAAK,CACtB,CACF,CACF,MACEiC,EAAYzC,EAAQ0C,CAAG,CAE3B,CAAC,EACMgB,CACT,CAYA,SAAgBU,EAAW,EAAgB,EAAc,EAAkC,CACzF,IAAM/B,EAAWrC,EAAO,MAAM,OAAQ,GAASH,EAAK,aAAeG,EAAO,MAAM,EAEhFqE,EAAUrE,EAAO,WAAc,CAC7B,IAAK,IAAMH,KAAQwC,EAAUiC,EAAKzE,CAAI,CACxC,CAAC,EAED,EAA6B,OAASkC,EACtC,EAAO,OAASM,EAAS,EAAE,EAAE,iBAAmBN,EAAO,SACzD,CAOA,SAAgBwC,EAAa,EAAsB,CACjD,IAAK,IAAM1E,KAAQG,EAAO,MACpBH,EAAK,aAAeG,EAAO,QAAQA,EAAO,OAAO,YAAYH,CAAI,EAEvE,EAAO,MAAQ,CAAC,EAChB,EAAO,MAAQ,IACjB,CAkBA,SAAgBsD,EAAO,EAAc,EAA2B,CAC9D,IAAMjD,EAAON,EAAWmC,CAAM,CAAC,CAAC,eAAe,EAAE,EAEjD,OADAA,EAAO,aAAa7B,EAAMsE,CAAM,EACzBtE,CACT,CAwCA,SAAgBuE,EACd,EACA,EACA,EACA,EACS,CACT,IAAMC,EAAiB5B,GAAc,KAIrC,OAAOU,EADQZ,EAAab,EAAQ2C,EADlC7B,IAAY,IAAA,GAAY8B,EAAO,QAAQ,WAAW5C,EAAQ2C,CAAc,EAAI7B,CAEvD,EAAGY,EAAOiB,IAAmB,IAAI,CAC1D,C"}
@@ -1,2 +1,2 @@
1
- function e(e){return new Set(e.filter(e=>e!=null).map(String))}function t(e){return e==null?``:String(e)}function n(n,r){if(n.multiple&&Array.isArray(r)){let t=e(r);for(let e of Array.from(n.options))e.selected=t.has(e.value)}else n.value=t(r)}export{t as plainText,n as setSelectValue};
1
+ import{keepWatchingCommits as e}from"./insert.js";const t=/* @__PURE__ */ new WeakMap;function n(e){return new Set(e.filter(e=>e!=null).map(String))}function r(e){return e==null?``:String(e)}function i(n,r){t.has(n)||e(n,()=>a(n,t.get(n))),t.set(n,r),a(n,r)}function a(e,t){if(e.multiple&&Array.isArray(t)){let r=n(t);for(let t of Array.from(e.options))t.selected=r.has(t.value)}else e.value=r(t)}export{r as plainText,i as setSelectValue};
2
2
  //# sourceMappingURL=select-value.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"select-value.js","names":["listed","value","item","plainText","setSelectValue","select","wanted","option"],"sources":["../../src/select-value.ts"],"sourcesContent":["/** The values an array stands for, as strings; null and undefined entries are skipped. */\nfunction listed(value: readonly unknown[]): Set<string> {\n return new Set(value.filter((item) => item !== null && item !== undefined).map(String));\n}\n\n/** The string a value assigns to `select.value`, `innerHTML` or `textContent`; null and undefined are empty. @internal */\nexport function plainText(value: unknown): string {\n return value === null || value === undefined ? \"\" : String(value);\n}\n\n/**\n * Selects the options a `value` stands for. The compiler calls it for `<select value={...}>`. A\n * single value behaves like `select.value = value` (`null` and `undefined` are the empty string).\n * On a `<select multiple>` an array selects exactly the options whose value it lists and clears\n * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`).\n *\n * @param select The select element; its options must already be in it.\n * @param value A string or number (written as `String(value)`), or `null`/`undefined` (written as\n * `\"\"`: an option with an empty value is selected, otherwise none). For a `multiple` select, an array of them: `null` and `undefined`\n * entries are skipped. An array on a single select is written as `String(array)`.\n * @example\n * import { setSelectValue } from \"@shadow-js/web\";\n *\n * const select = document.createElement(\"select\");\n * select.multiple = true;\n * select.append(new Option(\"A\", \"a\"), new Option(\"B\", \"b\"), new Option(\"C\", \"c\"));\n * setSelectValue(select, [\"a\", \"c\"]); // A and C selected, B cleared\n * @see ssrSelectValue\n * @since 1.0.0\n */\nexport function setSelectValue(select: HTMLSelectElement, value: unknown): void {\n if (select.multiple && Array.isArray(value)) {\n const wanted = listed(value);\n for (const option of Array.from(select.options)) option.selected = wanted.has(option.value);\n return;\n }\n select.value = plainText(value);\n}\n"],"mappings":"AACA,SAASA,EAAO,EAAwC,CACtD,OAAO,IAAI,IAAIC,EAAM,OAAQ,GAASC,GAAS,IAA0B,CAAC,CAAC,IAAI,MAAM,CAAC,CACxF,CAGA,SAAgBC,EAAU,EAAwB,CAChD,OAAOF,GAAU,KAA8B,GAAK,OAAOA,CAAK,CAClE,CAsBA,SAAgBG,EAAe,EAA2B,EAAsB,CAC9E,GAAIC,EAAO,UAAY,MAAM,QAAQJ,CAAK,EAAG,CAC3C,IAAMK,EAASN,EAAOC,CAAK,EAC3B,IAAK,IAAMM,KAAU,MAAM,KAAKF,EAAO,OAAO,EAAG,EAAO,SAAWC,EAAO,IAAIC,EAAO,KAAK,CAE5F,KACA,GAAO,MAAQJ,EAAUF,CAAK,CAChC,C"}
1
+ {"version":3,"file":"select-value.js","names":["bound","listed","value","item","plainText","setSelectValue","select","keepWatchingCommits","apply","wanted","option"],"sources":["../../src/select-value.ts"],"sourcesContent":["import { keepWatchingCommits } from \"./insert\";\n\n/** The value each select was last given, which it takes again when its options change (see {@link setSelectValue}). */\nconst bound = new WeakMap<HTMLSelectElement, unknown>();\n\n/** The values an array stands for, as strings; null and undefined entries are skipped. */\nfunction listed(value: readonly unknown[]): Set<string> {\n return new Set(value.filter((item) => item !== null && item !== undefined).map(String));\n}\n\n/** The string a value assigns to `select.value`, `innerHTML` or `textContent`; null and undefined are empty. @internal */\nexport function plainText(value: unknown): string {\n return value === null || value === undefined ? \"\" : String(value);\n}\n\n/**\n * Selects the options a `value` stands for. The compiler calls it for `<select value={...}>`. A\n * single value behaves like `select.value = value` (`null` and `undefined` are the empty string).\n * On a `<select multiple>` an array selects exactly the options whose value it lists and clears\n * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`). The select\n * takes the value again whenever the nodes inside it change (the options of a `<For>`, a `<Show>` or an optgroup), so\n * options that arrive or are replaced after the value keep it selected.\n *\n * @param select The select element; its options must already be in it.\n * @param value A string or number (written as `String(value)`), or `null`/`undefined` (written as\n * `\"\"`: an option with an empty value is selected, otherwise none). For a `multiple` select, an array of them: `null` and `undefined`\n * entries are skipped. An array on a single select is written as `String(array)`.\n * @example\n * import { setSelectValue } from \"@shadow-js/web\";\n *\n * const select = document.createElement(\"select\");\n * select.multiple = true;\n * select.append(new Option(\"A\", \"a\"), new Option(\"B\", \"b\"), new Option(\"C\", \"c\"));\n * setSelectValue(select, [\"a\", \"c\"]); // A and C selected, B cleared\n * @see ssrSelectValue\n * @since 1.0.0\n */\nexport function setSelectValue(select: HTMLSelectElement, value: unknown): void {\n // Options that arrive or are replaced after this call (a `<For>` inside the select) leave the browser's own pick, the\n // first option: the select takes its value again after each commit to its children, as React's does.\n if (!bound.has(select)) keepWatchingCommits(select, () => apply(select, bound.get(select)));\n bound.set(select, value);\n apply(select, value);\n}\n\nfunction apply(select: HTMLSelectElement, value: unknown): void {\n if (select.multiple && Array.isArray(value)) {\n const wanted = listed(value);\n for (const option of Array.from(select.options)) option.selected = wanted.has(option.value);\n return;\n }\n select.value = plainText(value);\n}\n"],"mappings":"A,kDAGA,MAAMA,kBAAQ,IAAI,QAGlB,SAASC,EAAO,EAAwC,CACtD,OAAO,IAAI,IAAIC,EAAM,OAAQ,GAASC,GAAS,IAA0B,CAAC,CAAC,IAAI,MAAM,CAAC,CACxF,CAGA,SAAgBC,EAAU,EAAwB,CAChD,OAAOF,GAAU,KAA8B,GAAK,OAAOA,CAAK,CAClE,CAwBA,SAAgBG,EAAe,EAA2B,EAAsB,CAGzEL,EAAM,IAAIM,CAAM,GAAGC,EAAoBD,MAAcE,EAAMF,EAAQN,EAAM,IAAIM,CAAM,CAAC,CAAC,EAC1FN,EAAM,IAAIM,EAAQJ,CAAK,EACvBM,EAAMF,EAAQJ,CAAK,CACrB,CAEA,SAASM,EAAM,EAA2B,EAAsB,CAC9D,GAAIF,EAAO,UAAY,MAAM,QAAQJ,CAAK,EAAG,CAC3C,IAAMO,EAASR,EAAOC,CAAK,EAC3B,IAAK,IAAMQ,KAAU,MAAM,KAAKJ,EAAO,OAAO,EAAG,EAAO,SAAWG,EAAO,IAAIC,EAAO,KAAK,CAE5F,KACA,GAAO,MAAQN,EAAUF,CAAK,CAChC,C"}
@@ -1,2 +1,2 @@
1
- import{leaves as e}from"./internal/accessor.js";import{claims as t}from"./internal/hydration-hooks.js";import{keepFocus as n,reconcileNodes as r}from"./internal/reconcile.js";import{onCleanup as i,useRenderEffect as a}from"@shadow-js/core";import{addCleanup as o,createComputation as s,currentOwner as c,disposeOwner as l,readComputation as u}from"@shadow-js/core/extend";const d=/* @__PURE__ */ new WeakMap;function f(e){return e instanceof Document?e:e.ownerDocument??document}function p(e,t){let n=e.texts;return n===t||n instanceof Set&&n.has(t)}function m(e,t){let n=e.texts;n===null?e.texts=t:n instanceof Set?n.add(t):n!==t&&(e.texts=/* @__PURE__ */ new Set([n,t]))}function h(e,t){let n=e.texts;if(n!==null){if(n instanceof Set){let e=new Set(t);for(let t of n)e.has(t)||n.delete(t)}else t.includes(n)||(e.texts=null)}}const g=/* @__PURE__ */ new WeakMap;function _(t,n){let r=[];for(let i of e(t,`SHADOW_INSERT_CYCLE`,n))if(i!=null&&typeof i!=`boolean`){if(i instanceof DocumentFragment){let e=g.get(i)??[...i.childNodes];g.set(i,e);for(let t of e)r.push(t)}else r.push(i instanceof Node?i:String(i))}return r}function v(e){let t=/* @__PURE__ */ new Map;for(let n of e.nodes){if(!(n instanceof Text)||!p(e,n))continue;let r=t.get(n.data);r===void 0?t.set(n.data,[n]):r.push(n)}return t}function y(e,t){let n=t.length===1?t[0]:void 0;if(typeof n==`string`){let t=e.nodes.length===1?e.nodes[0]:void 0;if(t instanceof Text&&p(e,t))return t.data!==n&&(t.data=n),[t]}let r=Array(t.length),i=0,a=/* @__PURE__ */ new Set,o;for(let n of t)if(typeof n==`string`){o??=v(e);let t=o.get(n)?.pop();t===void 0&&(t=f(e.parent).createTextNode(n),m(e,t)),a.add(t),r[i]=t,i+=1}else a.has(n)||(a.add(n),r[i]=n,i+=1);return r.length=i,r}function b(e,t){if(e.anchor!==null)return e.anchor;if(t!==void 0)return t.nextSibling;let n=e.marker;return n===null?e.parent.firstChild:n.parentNode===e.parent?n.nextSibling:null}const x=/* @__PURE__ */ new WeakMap;function S(e,t){let n=x.get(e)??/* @__PURE__ */ new Set;x.set(e,n.add(t)),i(()=>{n.delete(t)})}function C(e,t){let n=y(e,t),i=e.parent,a=e.nodes.filter(e=>e.parentNode===i),o=a[0],s=b(e,a.at(-1));n.length===0&&o!==void 0&&(e.marker=o.previousSibling),r(i,a,n,s),e.nodes=n,h(e,n),x.get(i)?.forEach(e=>{e()})}function w(e,t){if(typeof t==`string`||typeof t==`number`){let n=e.nodes,r=String(t);if(n.length===1){let t=n[0];if(t instanceof Text&&t.parentNode===e.parent&&p(e,t)){t.data!==r&&(t.data=r);return}}else if(n.length===0){let t=f(e.parent).createTextNode(r);m(e,t),e.parent.insertBefore(t,b(e,void 0)),e.nodes=[t];return}}C(e,_(t))}function T(e,t,n){let r=[];if(n!==void 0){let t=/* @__PURE__ */ new Set;for(let i of _(n))typeof i==`string`||t.has(i)||i.parentNode!==e||(t.add(i),r.push(i))}let i={parent:e,anchor:t,marker:r.length>0?r[0].previousSibling:e.lastChild,nodes:r,texts:null};for(let e of r)e instanceof Text&&m(i,e);return i}function E(e){let t=e.parent,n=d.get(t);e.owner=c(),d.set(t,e);let r=e.nodes[0]??null;if(n===void 0||n.owner?.disposed||b(n,n.nodes.at(-1))!==r)return;let i=j(t,r);n.anchor=e.marker=i,n.owner&&o(n.owner,()=>i.remove())}function D(e){if(typeof e==`function`)return!0;if(!Array.isArray(e))return!1;let t=[e],n=/* @__PURE__ */ new Set([e]);for(;t.length>0;){let e=t.pop();for(let r of e){if(typeof r==`function`)return!0;Array.isArray(r)&&!n.has(r)&&(n.add(r),t.push(r))}}return!1}function O(e,t,n){if(!D(t))return w(e,t),t instanceof DocumentFragment?[...e.nodes]:t;let r;return n===!0&&E(e),a(typeof t==`function`?t:()=>t,t=>{if(r=t,D(t)){let n=c(),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Set,o=e=>{i.add(e);let t=r.get(e);return t===void 0&&(t=s({kind:`memo`,fn:()=>e(),allowWrites:!0,owner:n}),r.set(e,t)),u(t)};a(()=>{i=/* @__PURE__ */ new Set;let e=_(t,o);for(let[e,t]of r)i.has(e)||(r.delete(e),l(t));return e},t=>{C(e,t)})}else w(e,t)}),r}function k(e,t,r){let i=e.nodes.filter(t=>t.parentNode===e.parent);n(e.parent,()=>{for(let e of i)r(e)}),e.parent=t,e.marker=i[0]?.previousSibling??t.lastChild}function A(e){for(let t of e.nodes)t.parentNode===e.parent&&e.parent.removeChild(t);e.nodes=[],e.texts=null}function j(e,t){let n=f(e).createTextNode(``);return e.insertBefore(n,t),n}function M(e,n,r,i){let a=r??null;return O(T(e,a,i===void 0?t.current.takeRegion(e,a):i),n,a===null)}export{j as anchor,O as bindRegion,T as createRegion,M as insert,k as moveRegion,A as removeRegion,S as watchCommits};
1
+ import{leaves as e}from"./internal/accessor.js";import{claims as t}from"./internal/hydration-hooks.js";import{keepFocus as n,reconcileNodes as r}from"./internal/reconcile.js";import{onCleanup as i,useRenderEffect as a}from"@shadow-js/core";import{addCleanup as o,createComputation as s,currentOwner as c,disposeOwner as l,readComputation as u}from"@shadow-js/core/extend";const d=/* @__PURE__ */ new WeakMap;function f(e){return e instanceof Document?e:e.ownerDocument??document}function p(e,t){let n=e.texts;return n===t||n instanceof Set&&n.has(t)}function m(e,t){let n=e.texts;n===null?e.texts=t:n instanceof Set?n.add(t):n!==t&&(e.texts=/* @__PURE__ */ new Set([n,t]))}function h(e,t){let n=e.texts;if(n!==null){if(n instanceof Set){let e=new Set(t);for(let t of n)e.has(t)||n.delete(t)}else t.includes(n)||(e.texts=null)}}const g=/* @__PURE__ */ new WeakMap;function _(t,n){let r=[];for(let i of e(t,`SHADOW_INSERT_CYCLE`,n))if(i!=null&&typeof i!=`boolean`){if(i instanceof DocumentFragment){let e=g.get(i)??[...i.childNodes];g.set(i,e);for(let t of e)r.push(t)}else r.push(i instanceof Node?i:String(i))}return r}function v(e){let t=/* @__PURE__ */ new Map;for(let n of e.nodes){if(!(n instanceof Text)||!p(e,n))continue;let r=t.get(n.data);r===void 0?t.set(n.data,[n]):r.push(n)}return t}function y(e,t){let n=t.length===1?t[0]:void 0;if(typeof n==`string`){let t=e.nodes.length===1?e.nodes[0]:void 0;if(t instanceof Text&&p(e,t))return t.data!==n&&(t.data=n),[t]}let r=Array(t.length),i=0,a=/* @__PURE__ */ new Set,o;for(let n of t)if(typeof n==`string`){o??=v(e);let t=o.get(n)?.pop();t===void 0&&(t=f(e.parent).createTextNode(n),m(e,t)),a.add(t),r[i]=t,i+=1}else a.has(n)||(a.add(n),r[i]=n,i+=1);return r.length=i,r}function b(e,t){if(e.anchor!==null)return e.anchor;if(t!==void 0)return t.nextSibling;let n=e.marker;return n===null?e.parent.firstChild:n.parentNode===e.parent?n.nextSibling:null}const x=/* @__PURE__ */ new WeakMap;function S(e,t){let n=x.get(e)??/* @__PURE__ */ new Set;x.set(e,n.add(t)),i(()=>{n.delete(t)})}function C(e,t){x.set(e,(x.get(e)??/* @__PURE__ */ new Set).add(t))}function w(e,t){let n=y(e,t),i=e.parent,a=e.nodes.filter(e=>e.parentNode===i),o=a[0],s=b(e,a.at(-1));n.length===0&&o!==void 0&&(e.marker=o.previousSibling),r(i,a,n,s),e.nodes=n,h(e,n),x.get(i)?.forEach(e=>{e()}),i.nodeName===`OPTGROUP`&&i.parentNode!==null&&x.get(i.parentNode)?.forEach(e=>{e()})}function T(e,t){if(typeof t==`string`||typeof t==`number`){let n=e.nodes,r=String(t);if(n.length===1){let t=n[0];if(t instanceof Text&&t.parentNode===e.parent&&p(e,t)){t.data!==r&&(t.data=r);return}}else if(n.length===0){let t=f(e.parent).createTextNode(r);m(e,t),e.parent.insertBefore(t,b(e,void 0)),e.nodes=[t];return}}w(e,_(t))}function E(e,t,n){let r=[];if(n!==void 0){let t=/* @__PURE__ */ new Set;for(let i of _(n))typeof i==`string`||t.has(i)||i.parentNode!==e||(t.add(i),r.push(i))}let i={parent:e,anchor:t,marker:r.length>0?r[0].previousSibling:e.lastChild,nodes:r,texts:null};for(let e of r)e instanceof Text&&m(i,e);return i}function D(e){let t=e.parent,n=d.get(t);e.owner=c(),d.set(t,e);let r=e.nodes[0]??null;if(n===void 0||n.owner?.disposed||b(n,n.nodes.at(-1))!==r)return;let i=M(t,r);n.anchor=e.marker=i,n.owner&&o(n.owner,()=>i.remove())}function O(e){if(typeof e==`function`)return!0;if(!Array.isArray(e))return!1;let t=[e],n=/* @__PURE__ */ new Set([e]);for(;t.length>0;){let e=t.pop();for(let r of e){if(typeof r==`function`)return!0;Array.isArray(r)&&!n.has(r)&&(n.add(r),t.push(r))}}return!1}function k(e,t,n){if(!O(t))return T(e,t),t instanceof DocumentFragment?[...e.nodes]:t;let r;return n===!0&&D(e),a(typeof t==`function`?t:()=>t,t=>{if(r=t,O(t)){let n=c(),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Set,o=e=>{i.add(e);let t=r.get(e);return t===void 0&&(t=s({kind:`memo`,fn:()=>e(),allowWrites:!0,owner:n}),r.set(e,t)),u(t)};a(()=>{i=/* @__PURE__ */ new Set;let e=_(t,o);for(let[e,t]of r)i.has(e)||(r.delete(e),l(t));return e},t=>{w(e,t)})}else T(e,t)}),r}function A(e,t,r){let i=e.nodes.filter(t=>t.parentNode===e.parent);n(e.parent,()=>{for(let e of i)r(e)}),e.parent=t,e.marker=i[0]?.previousSibling??t.lastChild}function j(e){for(let t of e.nodes)t.parentNode===e.parent&&e.parent.removeChild(t);e.nodes=[],e.texts=null}function M(e,t){let n=f(e).createTextNode(``);return e.insertBefore(n,t),n}function N(e,n,r,i){let a=r??null;return k(E(e,a,i===void 0?t.current.takeRegion(e,a):i),n,a===null)}export{M as anchor,k as bindRegion,E as createRegion,N as insert,C as keepWatchingCommits,A as moveRegion,j as removeRegion,S as watchCommits};
2
2
  //# sourceMappingURL=insert.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"insert.js","names":["tails","documentOf","node","ownsText","texts","region","addText","text","pruneTexts","kept","keep","fragmentChildren","flatten","parts","item","leaves","root","call","kids","child","reusablePool","pool","list","materialize","only","current","nodes","count","seen","part","endOf","last","marker","commitWatchers","watchCommits","set","parent","run","onCleanup","commit","next","attached","first","end","reconcileNodes","commitValue","raw","created","createRegion","initial","anchorNode","linkRegion","tail","currentOwner","start","anchor","addCleanup","containsFunction","stack","frame","bindRegion","value","latest","ordered","useRenderEffect","owner","memos","touched","fn","createComputation","readComputation","disposeOwner","moveRegion","keepFocus","move","removeRegion","before","insert","resolvedAnchor","claims"],"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":"A,oXA+CA,MAAMA,kBAAQ,IAAI,QAGlB,SAASC,EAAW,EAAsB,CACxC,OAAOC,aAAgB,SAAWA,EAAQA,EAAK,eAAiB,QAClE,CAGA,SAASC,EAAS,EAAgB,EAAqB,CACrD,IAAMC,EAAQC,EAAO,MACrB,OAAOD,IAAUF,GAASE,aAAiB,KAAOA,EAAM,IAAIF,CAAY,CAC1E,CAGA,SAASI,EAAQ,EAAgB,EAAkB,CACjD,IAAMF,EAAQC,EAAO,MACjBD,IAAU,KAAM,EAAO,MAAQG,EAC1BH,aAAiB,IAAKA,EAAM,IAAIG,CAAI,EACpCH,IAAUG,IAAM,EAAO,sBAAQ,IAAI,IAAI,CAACH,EAAOG,CAAI,CAAC,EAC/D,CAGA,SAASC,EAAW,EAAgB,EAA6B,CAC/D,IAAMJ,EAAQC,EAAO,MACrB,GAAID,IAAU,KACd,IAAIA,aAAiB,IAAK,CACxB,IAAMK,EAAO,IAAI,IAAUC,CAAI,EAC/B,IAAK,IAAMH,KAAQH,EACZK,EAAK,IAAIF,CAAI,GAAGH,EAAM,OAAOG,CAAI,CAE1C,MAAYG,EAAK,SAASN,CAAK,IAAG,EAAO,MAAQ,KAAA,CACnD,CAMA,MAAMO,kBAAmB,IAAI,QAM7B,SAASC,EAAQ,EAAe,EAA+C,CAC7E,IAAMC,EAAgB,CAAC,EAEvB,IAAK,IAAMC,KAAQC,EAAOC,EAAM,sBAAOC,CAAI,EACzC,GAAIH,GAAS,MAA8B,OAAOA,GAAS,UAC3D,IAAIA,aAAgB,iBAAkB,CACpC,IAAMI,EAAOP,EAAiB,IAAIG,CAAI,GAAK,CAAC,GAAGA,EAAK,UAAU,EAC9DH,EAAiB,IAAIG,EAAMI,CAAI,EAC/B,IAAK,IAAMC,KAASD,EAAML,EAAM,KAAKM,CAAK,CAC5C,MAAON,EAAM,KAAKC,aAAgB,KAAOA,EAAO,OAAOA,CAAI,CAAC,CAAA,CAE9D,OAAOD,CACT,CAGA,SAASO,EAAa,EAAqC,CACzD,IAAMC,kBAAO,IAAI,IACjB,IAAK,IAAMnB,KAAQG,EAAO,MAAO,CAC/B,GAAI,EAAEH,aAAgB,OAAS,CAACC,EAASE,EAAQH,CAAI,EAAG,SACxD,IAAMoB,EAAOD,EAAK,IAAInB,EAAK,IAAI,EAC3BoB,IAAS,IAAA,GAAWD,EAAK,IAAInB,EAAK,KAAM,CAACA,CAAI,CAAC,EAC7CoB,EAAK,KAAKpB,CAAI,CACrB,CACA,OAAOmB,CACT,CAGA,SAASE,EAAY,EAAgB,EAAgC,CACnE,IAAMC,EAAOX,EAAM,SAAW,EAAIA,EAAM,GAAK,IAAA,GAC7C,GAAI,OAAOW,GAAS,SAAU,CAC5B,IAAMC,EAAUpB,EAAO,MAAM,SAAW,EAAIA,EAAO,MAAM,GAAK,IAAA,GAC9D,GAAIoB,aAAmB,MAAQtB,EAASE,EAAQoB,CAAO,EAErD,OADIA,EAAQ,OAASD,IAAM,EAAQ,KAAOA,GACnC,CAACC,CAAO,CAEnB,CAEA,IAAMC,EAAoB,MAAYb,EAAM,MAAM,EAC9Cc,EAAQ,EACNC,kBAAO,IAAI,IACbP,EACJ,IAAK,IAAMQ,KAAQhB,EACjB,GAAI,OAAOgB,GAAS,SAAU,CAC5B,IAAST,EAAaf,CAAM,EAE5B,IAAIE,EADWc,EAAK,IAAIQ,CAAI,CAAC,EAAE,IAAI,EAE/BtB,IAAS,IAAA,KACX,EAAON,EAAWI,EAAO,MAAM,CAAC,CAAC,eAAewB,CAAI,EACpDvB,EAAQD,EAAQE,CAAI,GAEtBqB,EAAK,IAAIrB,CAAI,EACb,EAAMoB,GAASpB,EACf,GAAS,CACX,MAAYqB,EAAK,IAAIC,CAAI,IACvBD,EAAK,IAAIC,CAAI,EACb,EAAMF,GAASE,EACf,GAAS,GAIb,MADA,GAAM,OAASF,EACRD,CACT,CAGA,SAASI,EAAM,EAAgB,EAAqC,CAClE,GAAIzB,EAAO,SAAW,KAAM,OAAOA,EAAO,OAC1C,GAAI0B,IAAS,IAAA,GAAW,OAAOA,EAAK,YACpC,IAAMC,EAAS3B,EAAO,OAGtB,OAFI2B,IAAW,KAAa3B,EAAO,OAAO,WACtC2B,EAAO,aAAe3B,EAAO,OAC1B2B,EAAO,YADkC,IAElD,CAGA,MAAMC,kBAAiB,IAAI,QAQ3B,SAAgBC,EAAa,EAAc,EAAuB,CAChE,IAAMC,EAAMF,EAAe,IAAIG,CAAM,mBAAK,IAAI,IAC9CH,EAAe,IAAIG,EAAQD,EAAI,IAAIE,CAAG,CAAC,EACvCC,MAAgB,CACdH,EAAI,OAAOE,CAAG,CAChB,CAAC,CACH,CAGA,SAASE,EAAO,EAAgB,EAA8B,CAO5D,IAAMC,EAAOjB,EAAYlB,EAAQQ,CAAK,EAChCuB,EAAS/B,EAAO,OAChBoC,EAAWpC,EAAO,MAAM,OAAQ,GAASH,EAAK,aAAekC,CAAM,EACnEM,EAAQD,EAAS,GACjBE,EAAMb,EAAMzB,EAAQoC,EAAS,GAAG,EAAE,CAAC,EACrCD,EAAK,SAAW,GAAKE,IAAU,IAAA,KAAW,EAAO,OAASA,EAAM,iBACpEE,EAAeR,EAAQK,EAAUD,EAAMG,CAAG,EAC1C,EAAO,MAAQH,EACfhC,EAAWH,EAAQmC,CAAI,EACvBP,EAAe,IAAIG,CAAM,CAAC,EAAE,QAAS,GAAQ,CAC3CC,EAAI,CACN,CAAC,CACH,CAOA,SAASQ,EAAY,EAAgB,EAAoB,CACvD,GAAK,OAAOC,GAAQ,UAAY,OAAOA,GAAQ,SAA2C,CACxF,IAAMpB,EAAQrB,EAAO,MACfE,EAAO,OAAOuC,CAAG,EACvB,GAAIpB,EAAM,SAAW,EAAG,CACtB,IAAMD,EAAUC,EAAM,GACtB,GACED,aAAmB,MACnBA,EAAQ,aAAepB,EAAO,QAC9BF,EAASE,EAAQoB,CAAO,EACxB,CACIA,EAAQ,OAASlB,IAAM,EAAQ,KAAOA,GAC1C,MACF,CACF,MAAO,GAAImB,EAAM,SAAW,EAAG,CAC7B,IAAMqB,EAAU9C,EAAWI,EAAO,MAAM,CAAC,CAAC,eAAeE,CAAI,EAC7DD,EAAQD,EAAQ0C,CAAO,EACvB1C,EAAO,OAAO,aAAa0C,EAASjB,EAAMzB,EAAQ,IAAA,EAAS,CAAC,EAC5D,EAAO,MAAQ,CAAC0C,CAAO,EACvB,MACF,CACF,CACAR,EAAOlC,EAAQO,EAAQkC,CAAG,CAAC,CAC7B,CAOA,SAAgBE,EAAa,EAAc,EAAyB,EAA0B,CAE5F,IAAMtB,EAAgB,CAAC,EACvB,GAAIuB,IAAY,IAAA,GAAW,CACzB,IAAMrB,kBAAO,IAAI,IACjB,IAAK,IAAMC,KAAQjB,EAAQqC,CAAO,EAC5B,OAAOpB,GAAS,UAAYD,EAAK,IAAIC,CAAI,GAAKA,EAAK,aAAeO,IACtER,EAAK,IAAIC,CAAI,EACbH,EAAM,KAAKG,CAAI,EAEnB,CAEA,IAAMxB,EAAiB,CACrB,SACA,OAAQ6C,EACR,OAJaxB,EAAM,OAAS,EAAKA,EAAM,EAAE,CAAU,gBAAkBU,EAAO,UAK5E,QACA,MAAO,IACT,EACA,IAAK,IAAMlC,KAAQwB,EAAWxB,aAAgB,MAAMI,EAAQD,EAAQH,CAAI,EAGxE,OAAOG,CACT,CAWA,SAAS8C,EAAW,EAAsB,CACxC,IAAMf,EAAS/B,EAAO,OAChB+C,EAAOpD,EAAM,IAAIoC,CAAM,EAC7B,EAAO,MAAQiB,EAAa,EAC5BrD,EAAM,IAAIoC,EAAQ/B,CAAM,EACxB,IAAMiD,EAAQjD,EAAO,MAAM,IAAM,KACjC,GAAI+C,IAAS,IAAA,IAAaA,EAAK,OAAO,UAAYtB,EAAMsB,EAAMA,EAAK,MAAM,GAAG,EAAE,CAAC,IAAME,EACnF,OACF,IAAM/C,EAAOgD,EAAOnB,EAAQkB,CAAK,EACjC,EAAK,OAAS,EAAO,OAAS/C,EAI1B6C,EAAK,OAAOI,EAAWJ,EAAK,UAAa7C,EAAK,OAAO,CAAC,CAC5D,CAMA,SAASkD,EAAiB,EAAwB,CAChD,GAAI,OAAOzC,GAAS,WAAY,MAAO,GACvC,GAAI,CAAC,MAAM,QAAQA,CAAI,EAAG,MAAO,GACjC,IAAM0C,EAAqB,CAAC1C,CAAI,EAC1BY,kBAAO,IAAI,IAAe,CAACZ,CAAI,CAAC,EACtC,KAAO0C,EAAM,OAAS,GAAG,CACvB,IAAMC,EAAQD,EAAM,IAAI,EACxB,IAAK,IAAM5C,KAAQ6C,EAAO,CACxB,GAAI,OAAO7C,GAAS,WAAY,MAAO,GACnC,MAAM,QAAQA,CAAI,GAAK,CAACc,EAAK,IAAId,CAAI,IACvCc,EAAK,IAAId,CAAI,EACb4C,EAAM,KAAK5C,CAAI,EAEnB,CACF,CACA,MAAO,EACT,CASA,SAAgB8C,EAAW,EAAgB,EAAgB,EAA4B,CACrF,GAAI,CAACH,EAAiBI,CAAK,EAEzB,OADAhB,EAAYxC,EAAQwD,CAAK,EAClBA,aAAiB,iBAAmB,CAAC,GAAGxD,EAAO,KAAK,EAAIwD,EAEjE,IAAIC,EAmDJ,OAlDIC,IAAY,IAAMZ,EAAW9C,CAAM,EAWvC2D,EAViB,OAAOH,GAAU,WAAcA,MAAgCA,EAUrD,GAAQ,CAEjC,GADA,EAASf,EACLW,EAAiBX,CAAG,EAAG,CAKzB,IAAMmB,EAAQZ,EAAa,EACrBa,kBAAQ,IAAI,IACdC,kBAAU,IAAI,IACZlD,EAAQ,GAA+B,CAC3CkD,EAAQ,IAAIC,CAAE,EACd,IAAIlE,EAAOgE,EAAM,IAAIE,CAAE,EAMvB,OALIlE,IAAS,IAAA,KAEX,EAAOmE,EAAkB,CAAE,KAAM,OAAQ,OAAUD,EAAG,EAAG,YAAa,GAAM,OAAM,CAAC,EACnFF,EAAM,IAAIE,EAAIlE,CAAI,GAEboE,EAAgBpE,CAAI,CAC7B,EACA8D,MACQ,CACJ,kBAAU,IAAI,IACd,IAAMnD,EAAQD,EAAQkC,EAAK7B,CAAI,EAC/B,IAAK,GAAM,CAACmD,EAAIlE,KAASgE,EACnBC,EAAQ,IAAIC,CAAE,IAClBF,EAAM,OAAOE,CAAE,EACfG,EAAarE,CAAI,GAEnB,OAAOW,CACT,EACC,GAAU,CACT0B,EAAOlC,EAAQQ,CAAK,CACtB,CACF,CACF,MACEgC,EAAYxC,EAAQyC,CAAG,CAE3B,CAAC,EACMgB,CACT,CAYA,SAAgBU,EAAW,EAAgB,EAAc,EAAkC,CACzF,IAAM/B,EAAWpC,EAAO,MAAM,OAAQ,GAASH,EAAK,aAAeG,EAAO,MAAM,EAEhFoE,EAAUpE,EAAO,WAAc,CAC7B,IAAK,IAAMH,KAAQuC,EAAUiC,EAAKxE,CAAI,CACxC,CAAC,EAED,EAA6B,OAASkC,EACtC,EAAO,OAASK,EAAS,EAAE,EAAE,iBAAmBL,EAAO,SACzD,CAOA,SAAgBuC,EAAa,EAAsB,CACjD,IAAK,IAAMzE,KAAQG,EAAO,MACpBH,EAAK,aAAeG,EAAO,QAAQA,EAAO,OAAO,YAAYH,CAAI,EAEvE,EAAO,MAAQ,CAAC,EAChB,EAAO,MAAQ,IACjB,CAkBA,SAAgBqD,EAAO,EAAc,EAA2B,CAC9D,IAAMhD,EAAON,EAAWmC,CAAM,CAAC,CAAC,eAAe,EAAE,EAEjD,OADAA,EAAO,aAAa7B,EAAMqE,CAAM,EACzBrE,CACT,CAwCA,SAAgBsE,EACd,EACA,EACA,EACA,EACS,CACT,IAAMC,EAAiB5B,GAAc,KAIrC,OAAOU,EADQZ,EAAaZ,EAAQ0C,EADlC7B,IAAY,IAAA,GAAY8B,EAAO,QAAQ,WAAW3C,EAAQ0C,CAAc,EAAI7B,CAEvD,EAAGY,EAAOiB,IAAmB,IAAI,CAC1D,C"}
1
+ {"version":3,"file":"insert.js","names":["tails","documentOf","node","ownsText","texts","region","addText","text","pruneTexts","kept","keep","fragmentChildren","flatten","parts","item","leaves","root","call","kids","child","reusablePool","pool","list","materialize","only","current","nodes","count","seen","part","endOf","last","marker","commitWatchers","watchCommits","set","parent","run","onCleanup","keepWatchingCommits","commit","next","attached","first","end","reconcileNodes","commitValue","raw","created","createRegion","initial","anchorNode","linkRegion","tail","currentOwner","start","anchor","addCleanup","containsFunction","stack","frame","bindRegion","value","latest","ordered","useRenderEffect","owner","memos","touched","fn","createComputation","readComputation","disposeOwner","moveRegion","keepFocus","move","removeRegion","before","insert","resolvedAnchor","claims"],"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/**\n * Like {@link watchCommits}, for a watch that lives as long as `parent` does: it is not tied to the owner that is\n * current, so a binding that runs again does not end it. The select's value (see `setSelectValue`) uses it.\n * @internal\n */\nexport function keepWatchingCommits(parent: Node, run: () => void): void {\n commitWatchers.set(parent, (commitWatchers.get(parent) ?? new Set<() => void>()).add(run));\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 // The options of an optgroup are the select's options.\n if (parent.nodeName === \"OPTGROUP\" && parent.parentNode !== null) {\n commitWatchers.get(parent.parentNode)?.forEach((run) => {\n run();\n });\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":"A,oXA+CA,MAAMA,kBAAQ,IAAI,QAGlB,SAASC,EAAW,EAAsB,CACxC,OAAOC,aAAgB,SAAWA,EAAQA,EAAK,eAAiB,QAClE,CAGA,SAASC,EAAS,EAAgB,EAAqB,CACrD,IAAMC,EAAQC,EAAO,MACrB,OAAOD,IAAUF,GAASE,aAAiB,KAAOA,EAAM,IAAIF,CAAY,CAC1E,CAGA,SAASI,EAAQ,EAAgB,EAAkB,CACjD,IAAMF,EAAQC,EAAO,MACjBD,IAAU,KAAM,EAAO,MAAQG,EAC1BH,aAAiB,IAAKA,EAAM,IAAIG,CAAI,EACpCH,IAAUG,IAAM,EAAO,sBAAQ,IAAI,IAAI,CAACH,EAAOG,CAAI,CAAC,EAC/D,CAGA,SAASC,EAAW,EAAgB,EAA6B,CAC/D,IAAMJ,EAAQC,EAAO,MACrB,GAAID,IAAU,KACd,IAAIA,aAAiB,IAAK,CACxB,IAAMK,EAAO,IAAI,IAAUC,CAAI,EAC/B,IAAK,IAAMH,KAAQH,EACZK,EAAK,IAAIF,CAAI,GAAGH,EAAM,OAAOG,CAAI,CAE1C,MAAYG,EAAK,SAASN,CAAK,IAAG,EAAO,MAAQ,KAAA,CACnD,CAMA,MAAMO,kBAAmB,IAAI,QAM7B,SAASC,EAAQ,EAAe,EAA+C,CAC7E,IAAMC,EAAgB,CAAC,EAEvB,IAAK,IAAMC,KAAQC,EAAOC,EAAM,sBAAOC,CAAI,EACzC,GAAIH,GAAS,MAA8B,OAAOA,GAAS,UAC3D,IAAIA,aAAgB,iBAAkB,CACpC,IAAMI,EAAOP,EAAiB,IAAIG,CAAI,GAAK,CAAC,GAAGA,EAAK,UAAU,EAC9DH,EAAiB,IAAIG,EAAMI,CAAI,EAC/B,IAAK,IAAMC,KAASD,EAAML,EAAM,KAAKM,CAAK,CAC5C,MAAON,EAAM,KAAKC,aAAgB,KAAOA,EAAO,OAAOA,CAAI,CAAC,CAAA,CAE9D,OAAOD,CACT,CAGA,SAASO,EAAa,EAAqC,CACzD,IAAMC,kBAAO,IAAI,IACjB,IAAK,IAAMnB,KAAQG,EAAO,MAAO,CAC/B,GAAI,EAAEH,aAAgB,OAAS,CAACC,EAASE,EAAQH,CAAI,EAAG,SACxD,IAAMoB,EAAOD,EAAK,IAAInB,EAAK,IAAI,EAC3BoB,IAAS,IAAA,GAAWD,EAAK,IAAInB,EAAK,KAAM,CAACA,CAAI,CAAC,EAC7CoB,EAAK,KAAKpB,CAAI,CACrB,CACA,OAAOmB,CACT,CAGA,SAASE,EAAY,EAAgB,EAAgC,CACnE,IAAMC,EAAOX,EAAM,SAAW,EAAIA,EAAM,GAAK,IAAA,GAC7C,GAAI,OAAOW,GAAS,SAAU,CAC5B,IAAMC,EAAUpB,EAAO,MAAM,SAAW,EAAIA,EAAO,MAAM,GAAK,IAAA,GAC9D,GAAIoB,aAAmB,MAAQtB,EAASE,EAAQoB,CAAO,EAErD,OADIA,EAAQ,OAASD,IAAM,EAAQ,KAAOA,GACnC,CAACC,CAAO,CAEnB,CAEA,IAAMC,EAAoB,MAAYb,EAAM,MAAM,EAC9Cc,EAAQ,EACNC,kBAAO,IAAI,IACbP,EACJ,IAAK,IAAMQ,KAAQhB,EACjB,GAAI,OAAOgB,GAAS,SAAU,CAC5B,IAAST,EAAaf,CAAM,EAE5B,IAAIE,EADWc,EAAK,IAAIQ,CAAI,CAAC,EAAE,IAAI,EAE/BtB,IAAS,IAAA,KACX,EAAON,EAAWI,EAAO,MAAM,CAAC,CAAC,eAAewB,CAAI,EACpDvB,EAAQD,EAAQE,CAAI,GAEtBqB,EAAK,IAAIrB,CAAI,EACb,EAAMoB,GAASpB,EACf,GAAS,CACX,MAAYqB,EAAK,IAAIC,CAAI,IACvBD,EAAK,IAAIC,CAAI,EACb,EAAMF,GAASE,EACf,GAAS,GAIb,MADA,GAAM,OAASF,EACRD,CACT,CAGA,SAASI,EAAM,EAAgB,EAAqC,CAClE,GAAIzB,EAAO,SAAW,KAAM,OAAOA,EAAO,OAC1C,GAAI0B,IAAS,IAAA,GAAW,OAAOA,EAAK,YACpC,IAAMC,EAAS3B,EAAO,OAGtB,OAFI2B,IAAW,KAAa3B,EAAO,OAAO,WACtC2B,EAAO,aAAe3B,EAAO,OAC1B2B,EAAO,YADkC,IAElD,CAGA,MAAMC,kBAAiB,IAAI,QAQ3B,SAAgBC,EAAa,EAAc,EAAuB,CAChE,IAAMC,EAAMF,EAAe,IAAIG,CAAM,mBAAK,IAAI,IAC9CH,EAAe,IAAIG,EAAQD,EAAI,IAAIE,CAAG,CAAC,EACvCC,MAAgB,CACdH,EAAI,OAAOE,CAAG,CAChB,CAAC,CACH,CAOA,SAAgBE,EAAoB,EAAc,EAAuB,CACvEN,EAAe,IAAIG,GAASH,EAAe,IAAIG,CAAM,mBAAK,IAAI,IAAgB,CAAG,IAAIC,CAAG,CAAC,CAC3F,CAGA,SAASG,EAAO,EAAgB,EAA8B,CAO5D,IAAMC,EAAOlB,EAAYlB,EAAQQ,CAAK,EAChCuB,EAAS/B,EAAO,OAChBqC,EAAWrC,EAAO,MAAM,OAAQ,GAASH,EAAK,aAAekC,CAAM,EACnEO,EAAQD,EAAS,GACjBE,EAAMd,EAAMzB,EAAQqC,EAAS,GAAG,EAAE,CAAC,EACrCD,EAAK,SAAW,GAAKE,IAAU,IAAA,KAAW,EAAO,OAASA,EAAM,iBACpEE,EAAeT,EAAQM,EAAUD,EAAMG,CAAG,EAC1C,EAAO,MAAQH,EACfjC,EAAWH,EAAQoC,CAAI,EACvBR,EAAe,IAAIG,CAAM,CAAC,EAAE,QAAS,GAAQ,CAC3CC,EAAI,CACN,CAAC,EAEGD,EAAO,WAAa,YAAcA,EAAO,aAAe,MAC1DH,EAAe,IAAIG,EAAO,UAAU,CAAC,EAAE,QAAS,GAAQ,CACtDC,EAAI,CACN,CAAC,CAEL,CAOA,SAASS,EAAY,EAAgB,EAAoB,CACvD,GAAK,OAAOC,GAAQ,UAAY,OAAOA,GAAQ,SAA2C,CACxF,IAAMrB,EAAQrB,EAAO,MACfE,EAAO,OAAOwC,CAAG,EACvB,GAAIrB,EAAM,SAAW,EAAG,CACtB,IAAMD,EAAUC,EAAM,GACtB,GACED,aAAmB,MACnBA,EAAQ,aAAepB,EAAO,QAC9BF,EAASE,EAAQoB,CAAO,EACxB,CACIA,EAAQ,OAASlB,IAAM,EAAQ,KAAOA,GAC1C,MACF,CACF,MAAO,GAAImB,EAAM,SAAW,EAAG,CAC7B,IAAMsB,EAAU/C,EAAWI,EAAO,MAAM,CAAC,CAAC,eAAeE,CAAI,EAC7DD,EAAQD,EAAQ2C,CAAO,EACvB3C,EAAO,OAAO,aAAa2C,EAASlB,EAAMzB,EAAQ,IAAA,EAAS,CAAC,EAC5D,EAAO,MAAQ,CAAC2C,CAAO,EACvB,MACF,CACF,CACAR,EAAOnC,EAAQO,EAAQmC,CAAG,CAAC,CAC7B,CAOA,SAAgBE,EAAa,EAAc,EAAyB,EAA0B,CAE5F,IAAMvB,EAAgB,CAAC,EACvB,GAAIwB,IAAY,IAAA,GAAW,CACzB,IAAMtB,kBAAO,IAAI,IACjB,IAAK,IAAMC,KAAQjB,EAAQsC,CAAO,EAC5B,OAAOrB,GAAS,UAAYD,EAAK,IAAIC,CAAI,GAAKA,EAAK,aAAeO,IACtER,EAAK,IAAIC,CAAI,EACbH,EAAM,KAAKG,CAAI,EAEnB,CAEA,IAAMxB,EAAiB,CACrB,SACA,OAAQ8C,EACR,OAJazB,EAAM,OAAS,EAAKA,EAAM,EAAE,CAAU,gBAAkBU,EAAO,UAK5E,QACA,MAAO,IACT,EACA,IAAK,IAAMlC,KAAQwB,EAAWxB,aAAgB,MAAMI,EAAQD,EAAQH,CAAI,EAGxE,OAAOG,CACT,CAWA,SAAS+C,EAAW,EAAsB,CACxC,IAAMhB,EAAS/B,EAAO,OAChBgD,EAAOrD,EAAM,IAAIoC,CAAM,EAC7B,EAAO,MAAQkB,EAAa,EAC5BtD,EAAM,IAAIoC,EAAQ/B,CAAM,EACxB,IAAMkD,EAAQlD,EAAO,MAAM,IAAM,KACjC,GAAIgD,IAAS,IAAA,IAAaA,EAAK,OAAO,UAAYvB,EAAMuB,EAAMA,EAAK,MAAM,GAAG,EAAE,CAAC,IAAME,EACnF,OACF,IAAMhD,EAAOiD,EAAOpB,EAAQmB,CAAK,EACjC,EAAK,OAAS,EAAO,OAAShD,EAI1B8C,EAAK,OAAOI,EAAWJ,EAAK,UAAa9C,EAAK,OAAO,CAAC,CAC5D,CAMA,SAASmD,EAAiB,EAAwB,CAChD,GAAI,OAAO1C,GAAS,WAAY,MAAO,GACvC,GAAI,CAAC,MAAM,QAAQA,CAAI,EAAG,MAAO,GACjC,IAAM2C,EAAqB,CAAC3C,CAAI,EAC1BY,kBAAO,IAAI,IAAe,CAACZ,CAAI,CAAC,EACtC,KAAO2C,EAAM,OAAS,GAAG,CACvB,IAAMC,EAAQD,EAAM,IAAI,EACxB,IAAK,IAAM7C,KAAQ8C,EAAO,CACxB,GAAI,OAAO9C,GAAS,WAAY,MAAO,GACnC,MAAM,QAAQA,CAAI,GAAK,CAACc,EAAK,IAAId,CAAI,IACvCc,EAAK,IAAId,CAAI,EACb6C,EAAM,KAAK7C,CAAI,EAEnB,CACF,CACA,MAAO,EACT,CASA,SAAgB+C,EAAW,EAAgB,EAAgB,EAA4B,CACrF,GAAI,CAACH,EAAiBI,CAAK,EAEzB,OADAhB,EAAYzC,EAAQyD,CAAK,EAClBA,aAAiB,iBAAmB,CAAC,GAAGzD,EAAO,KAAK,EAAIyD,EAEjE,IAAIC,EAmDJ,OAlDIC,IAAY,IAAMZ,EAAW/C,CAAM,EAWvC4D,EAViB,OAAOH,GAAU,WAAcA,MAAgCA,EAUrD,GAAQ,CAEjC,GADA,EAASf,EACLW,EAAiBX,CAAG,EAAG,CAKzB,IAAMmB,EAAQZ,EAAa,EACrBa,kBAAQ,IAAI,IACdC,kBAAU,IAAI,IACZnD,EAAQ,GAA+B,CAC3CmD,EAAQ,IAAIC,CAAE,EACd,IAAInE,EAAOiE,EAAM,IAAIE,CAAE,EAMvB,OALInE,IAAS,IAAA,KAEX,EAAOoE,EAAkB,CAAE,KAAM,OAAQ,OAAUD,EAAG,EAAG,YAAa,GAAM,OAAM,CAAC,EACnFF,EAAM,IAAIE,EAAInE,CAAI,GAEbqE,EAAgBrE,CAAI,CAC7B,EACA+D,MACQ,CACJ,kBAAU,IAAI,IACd,IAAMpD,EAAQD,EAAQmC,EAAK9B,CAAI,EAC/B,IAAK,GAAM,CAACoD,EAAInE,KAASiE,EACnBC,EAAQ,IAAIC,CAAE,IAClBF,EAAM,OAAOE,CAAE,EACfG,EAAatE,CAAI,GAEnB,OAAOW,CACT,EACC,GAAU,CACT2B,EAAOnC,EAAQQ,CAAK,CACtB,CACF,CACF,MACEiC,EAAYzC,EAAQ0C,CAAG,CAE3B,CAAC,EACMgB,CACT,CAYA,SAAgBU,EAAW,EAAgB,EAAc,EAAkC,CACzF,IAAM/B,EAAWrC,EAAO,MAAM,OAAQ,GAASH,EAAK,aAAeG,EAAO,MAAM,EAEhFqE,EAAUrE,EAAO,WAAc,CAC7B,IAAK,IAAMH,KAAQwC,EAAUiC,EAAKzE,CAAI,CACxC,CAAC,EAED,EAA6B,OAASkC,EACtC,EAAO,OAASM,EAAS,EAAE,EAAE,iBAAmBN,EAAO,SACzD,CAOA,SAAgBwC,EAAa,EAAsB,CACjD,IAAK,IAAM1E,KAAQG,EAAO,MACpBH,EAAK,aAAeG,EAAO,QAAQA,EAAO,OAAO,YAAYH,CAAI,EAEvE,EAAO,MAAQ,CAAC,EAChB,EAAO,MAAQ,IACjB,CAkBA,SAAgBsD,EAAO,EAAc,EAA2B,CAC9D,IAAMjD,EAAON,EAAWmC,CAAM,CAAC,CAAC,eAAe,EAAE,EAEjD,OADAA,EAAO,aAAa7B,EAAMsE,CAAM,EACzBtE,CACT,CAwCA,SAAgBuE,EACd,EACA,EACA,EACA,EACS,CACT,IAAMC,EAAiB5B,GAAc,KAIrC,OAAOU,EADQZ,EAAab,EAAQ2C,EADlC7B,IAAY,IAAA,GAAY8B,EAAO,QAAQ,WAAW5C,EAAQ2C,CAAc,EAAI7B,CAEvD,EAAGY,EAAOiB,IAAmB,IAAI,CAC1D,C"}
@@ -1,2 +1,2 @@
1
- function e(e){return new Set(e.filter(e=>e!=null).map(String))}function t(e){return e==null?``:String(e)}function n(n,r){if(n.multiple&&Array.isArray(r)){let t=e(r);for(let e of Array.from(n.options))e.selected=t.has(e.value)}else n.value=t(r)}export{t as plainText,n as setSelectValue};
1
+ import{keepWatchingCommits as e}from"./insert.js";const t=/* @__PURE__ */ new WeakMap;function n(e){return new Set(e.filter(e=>e!=null).map(String))}function r(e){return e==null?``:String(e)}function i(n,r){t.has(n)||e(n,()=>a(n,t.get(n))),t.set(n,r),a(n,r)}function a(e,t){if(e.multiple&&Array.isArray(t)){let r=n(t);for(let t of Array.from(e.options))t.selected=r.has(t.value)}else e.value=r(t)}export{r as plainText,i as setSelectValue};
2
2
  //# sourceMappingURL=select-value.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"select-value.js","names":["listed","value","item","plainText","setSelectValue","select","wanted","option"],"sources":["../../src/select-value.ts"],"sourcesContent":["/** The values an array stands for, as strings; null and undefined entries are skipped. */\nfunction listed(value: readonly unknown[]): Set<string> {\n return new Set(value.filter((item) => item !== null && item !== undefined).map(String));\n}\n\n/** The string a value assigns to `select.value`, `innerHTML` or `textContent`; null and undefined are empty. @internal */\nexport function plainText(value: unknown): string {\n return value === null || value === undefined ? \"\" : String(value);\n}\n\n/**\n * Selects the options a `value` stands for. The compiler calls it for `<select value={...}>`. A\n * single value behaves like `select.value = value` (`null` and `undefined` are the empty string).\n * On a `<select multiple>` an array selects exactly the options whose value it lists and clears\n * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`).\n *\n * @param select The select element; its options must already be in it.\n * @param value A string or number (written as `String(value)`), or `null`/`undefined` (written as\n * `\"\"`: an option with an empty value is selected, otherwise none). For a `multiple` select, an array of them: `null` and `undefined`\n * entries are skipped. An array on a single select is written as `String(array)`.\n * @example\n * import { setSelectValue } from \"@shadow-js/web\";\n *\n * const select = document.createElement(\"select\");\n * select.multiple = true;\n * select.append(new Option(\"A\", \"a\"), new Option(\"B\", \"b\"), new Option(\"C\", \"c\"));\n * setSelectValue(select, [\"a\", \"c\"]); // A and C selected, B cleared\n * @see ssrSelectValue\n * @since 1.0.0\n */\nexport function setSelectValue(select: HTMLSelectElement, value: unknown): void {\n if (select.multiple && Array.isArray(value)) {\n const wanted = listed(value);\n for (const option of Array.from(select.options)) option.selected = wanted.has(option.value);\n return;\n }\n select.value = plainText(value);\n}\n"],"mappings":"AACA,SAASA,EAAO,EAAwC,CACtD,OAAO,IAAI,IAAIC,EAAM,OAAQ,GAASC,GAAS,IAA0B,CAAC,CAAC,IAAI,MAAM,CAAC,CACxF,CAGA,SAAgBC,EAAU,EAAwB,CAChD,OAAOF,GAAU,KAA8B,GAAK,OAAOA,CAAK,CAClE,CAsBA,SAAgBG,EAAe,EAA2B,EAAsB,CAC9E,GAAIC,EAAO,UAAY,MAAM,QAAQJ,CAAK,EAAG,CAC3C,IAAMK,EAASN,EAAOC,CAAK,EAC3B,IAAK,IAAMM,KAAU,MAAM,KAAKF,EAAO,OAAO,EAAG,EAAO,SAAWC,EAAO,IAAIC,EAAO,KAAK,CAE5F,KACA,GAAO,MAAQJ,EAAUF,CAAK,CAChC,C"}
1
+ {"version":3,"file":"select-value.js","names":["bound","listed","value","item","plainText","setSelectValue","select","keepWatchingCommits","apply","wanted","option"],"sources":["../../src/select-value.ts"],"sourcesContent":["import { keepWatchingCommits } from \"./insert\";\n\n/** The value each select was last given, which it takes again when its options change (see {@link setSelectValue}). */\nconst bound = new WeakMap<HTMLSelectElement, unknown>();\n\n/** The values an array stands for, as strings; null and undefined entries are skipped. */\nfunction listed(value: readonly unknown[]): Set<string> {\n return new Set(value.filter((item) => item !== null && item !== undefined).map(String));\n}\n\n/** The string a value assigns to `select.value`, `innerHTML` or `textContent`; null and undefined are empty. @internal */\nexport function plainText(value: unknown): string {\n return value === null || value === undefined ? \"\" : String(value);\n}\n\n/**\n * Selects the options a `value` stands for. The compiler calls it for `<select value={...}>`. A\n * single value behaves like `select.value = value` (`null` and `undefined` are the empty string).\n * On a `<select multiple>` an array selects exactly the options whose value it lists and clears\n * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`). The select\n * takes the value again whenever the nodes inside it change (the options of a `<For>`, a `<Show>` or an optgroup), so\n * options that arrive or are replaced after the value keep it selected.\n *\n * @param select The select element; its options must already be in it.\n * @param value A string or number (written as `String(value)`), or `null`/`undefined` (written as\n * `\"\"`: an option with an empty value is selected, otherwise none). For a `multiple` select, an array of them: `null` and `undefined`\n * entries are skipped. An array on a single select is written as `String(array)`.\n * @example\n * import { setSelectValue } from \"@shadow-js/web\";\n *\n * const select = document.createElement(\"select\");\n * select.multiple = true;\n * select.append(new Option(\"A\", \"a\"), new Option(\"B\", \"b\"), new Option(\"C\", \"c\"));\n * setSelectValue(select, [\"a\", \"c\"]); // A and C selected, B cleared\n * @see ssrSelectValue\n * @since 1.0.0\n */\nexport function setSelectValue(select: HTMLSelectElement, value: unknown): void {\n // Options that arrive or are replaced after this call (a `<For>` inside the select) leave the browser's own pick, the\n // first option: the select takes its value again after each commit to its children, as React's does.\n if (!bound.has(select)) keepWatchingCommits(select, () => apply(select, bound.get(select)));\n bound.set(select, value);\n apply(select, value);\n}\n\nfunction apply(select: HTMLSelectElement, value: unknown): void {\n if (select.multiple && Array.isArray(value)) {\n const wanted = listed(value);\n for (const option of Array.from(select.options)) option.selected = wanted.has(option.value);\n return;\n }\n select.value = plainText(value);\n}\n"],"mappings":"A,kDAGA,MAAMA,kBAAQ,IAAI,QAGlB,SAASC,EAAO,EAAwC,CACtD,OAAO,IAAI,IAAIC,EAAM,OAAQ,GAASC,GAAS,IAA0B,CAAC,CAAC,IAAI,MAAM,CAAC,CACxF,CAGA,SAAgBC,EAAU,EAAwB,CAChD,OAAOF,GAAU,KAA8B,GAAK,OAAOA,CAAK,CAClE,CAwBA,SAAgBG,EAAe,EAA2B,EAAsB,CAGzEL,EAAM,IAAIM,CAAM,GAAGC,EAAoBD,MAAcE,EAAMF,EAAQN,EAAM,IAAIM,CAAM,CAAC,CAAC,EAC1FN,EAAM,IAAIM,EAAQJ,CAAK,EACvBM,EAAMF,EAAQJ,CAAK,CACrB,CAEA,SAASM,EAAM,EAA2B,EAAsB,CAC9D,GAAIF,EAAO,UAAY,MAAM,QAAQJ,CAAK,EAAG,CAC3C,IAAMO,EAASR,EAAOC,CAAK,EAC3B,IAAK,IAAMQ,KAAU,MAAM,KAAKJ,EAAO,OAAO,EAAG,EAAO,SAAWG,EAAO,IAAIC,EAAO,KAAK,CAE5F,KACA,GAAO,MAAQN,EAAUF,CAAK,CAChC,C"}
@@ -120,6 +120,14 @@ function watchCommits(parent, run) {
120
120
  set.delete(run);
121
121
  });
122
122
  }
123
+ /**
124
+ * Like {@link watchCommits}, for a watch that lives as long as `parent` does: it is not tied to the owner that is
125
+ * current, so a binding that runs again does not end it. The select's value (see `setSelectValue`) uses it.
126
+ * @internal
127
+ */
128
+ function keepWatchingCommits(parent, run) {
129
+ commitWatchers.set(parent, (commitWatchers.get(parent) ?? /* @__PURE__ */ new Set()).add(run));
130
+ }
123
131
  /** Applies a flattened value to a region. */
124
132
  function commit(region, parts) {
125
133
  if (region.claimed !== void 0) {
@@ -138,6 +146,9 @@ function commit(region, parts) {
138
146
  commitWatchers.get(parent)?.forEach((run) => {
139
147
  run();
140
148
  });
149
+ if (parent.nodeName === "OPTGROUP" && parent.parentNode !== null) commitWatchers.get(parent.parentNode)?.forEach((run) => {
150
+ run();
151
+ });
141
152
  }
142
153
  /**
143
154
  * Applies a resolved value to a region. A string or number is the common case (a dynamic text): when the region
@@ -372,6 +383,6 @@ function insert(parent, value, anchorNode, initial) {
372
383
  const resolvedAnchor = anchorNode ?? null;
373
384
  return bindRegion(createRegion(parent, resolvedAnchor, initial === void 0 ? claims.current.takeRegion(parent, resolvedAnchor) : initial), value, resolvedAnchor === null);
374
385
  }
375
- export { anchor, bindRegion, createRegion, insert, moveRegion, removeRegion, watchCommits };
386
+ export { anchor, bindRegion, createRegion, insert, keepWatchingCommits, moveRegion, removeRegion, watchCommits };
376
387
 
377
388
  //# sourceMappingURL=insert.js.map
@@ -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 { 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"}
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/**\n * Like {@link watchCommits}, for a watch that lives as long as `parent` does: it is not tied to the owner that is\n * current, so a binding that runs again does not end it. The select's value (see `setSelectValue`) uses it.\n * @internal\n */\nexport function keepWatchingCommits(parent: Node, run: () => void): void {\n commitWatchers.set(parent, (commitWatchers.get(parent) ?? new Set<() => void>()).add(run));\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 // The options of an optgroup are the select's options.\n if (parent.nodeName === \"OPTGROUP\" && parent.parentNode !== null) {\n commitWatchers.get(parent.parentNode)?.forEach((run) => {\n run();\n });\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;;;;;;AAOA,SAAgB,oBAAoB,QAAc,KAAuB;CACvE,eAAe,IAAI,SAAS,eAAe,IAAI,MAAM,qBAAK,IAAI,IAAgB,EAAA,CAAG,IAAI,GAAG,CAAC;AAC3F;;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;CAED,IAAI,OAAO,aAAa,cAAc,OAAO,eAAe,MAC1D,eAAe,IAAI,OAAO,UAAU,CAAC,EAAE,SAAS,QAAQ;EACtD,IAAI;CACN,CAAC;AAEL;;;;;;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"}
@@ -1,4 +1,7 @@
1
+ import { keepWatchingCommits } from "./insert.js";
1
2
  // src/select-value.ts
3
+ /** The value each select was last given, which it takes again when its options change (see {@link setSelectValue}). */
4
+ const bound = /* @__PURE__ */ new WeakMap();
2
5
  /** The values an array stands for, as strings; null and undefined entries are skipped. */
3
6
  function listed(value) {
4
7
  return new Set(value.filter((item) => item !== null && item !== void 0).map(String));
@@ -11,7 +14,9 @@ function plainText(value) {
11
14
  * Selects the options a `value` stands for. The compiler calls it for `<select value={...}>`. A
12
15
  * single value behaves like `select.value = value` (`null` and `undefined` are the empty string).
13
16
  * On a `<select multiple>` an array selects exactly the options whose value it lists and clears
14
- * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`).
17
+ * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`). The select
18
+ * takes the value again whenever the nodes inside it change (the options of a `<For>`, a `<Show>` or an optgroup), so
19
+ * options that arrive or are replaced after the value keep it selected.
15
20
  *
16
21
  * @param select The select element; its options must already be in it.
17
22
  * @param value A string or number (written as `String(value)`), or `null`/`undefined` (written as
@@ -28,6 +33,11 @@ function plainText(value) {
28
33
  * @since 1.0.0
29
34
  */
30
35
  function setSelectValue(select, value) {
36
+ if (!bound.has(select)) keepWatchingCommits(select, () => apply(select, bound.get(select)));
37
+ bound.set(select, value);
38
+ apply(select, value);
39
+ }
40
+ function apply(select, value) {
31
41
  if (select.multiple && Array.isArray(value)) {
32
42
  const wanted = listed(value);
33
43
  for (const option of Array.from(select.options)) option.selected = wanted.has(option.value);
@@ -1 +1 @@
1
- {"version":3,"file":"select-value.js","names":[],"sources":["../../src/select-value.ts"],"sourcesContent":["/** The values an array stands for, as strings; null and undefined entries are skipped. */\nfunction listed(value: readonly unknown[]): Set<string> {\n return new Set(value.filter((item) => item !== null && item !== undefined).map(String));\n}\n\n/** The string a value assigns to `select.value`, `innerHTML` or `textContent`; null and undefined are empty. @internal */\nexport function plainText(value: unknown): string {\n return value === null || value === undefined ? \"\" : String(value);\n}\n\n/**\n * Selects the options a `value` stands for. The compiler calls it for `<select value={...}>`. A\n * single value behaves like `select.value = value` (`null` and `undefined` are the empty string).\n * On a `<select multiple>` an array selects exactly the options whose value it lists and clears\n * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`).\n *\n * @param select The select element; its options must already be in it.\n * @param value A string or number (written as `String(value)`), or `null`/`undefined` (written as\n * `\"\"`: an option with an empty value is selected, otherwise none). For a `multiple` select, an array of them: `null` and `undefined`\n * entries are skipped. An array on a single select is written as `String(array)`.\n * @example\n * import { setSelectValue } from \"@shadow-js/web\";\n *\n * const select = document.createElement(\"select\");\n * select.multiple = true;\n * select.append(new Option(\"A\", \"a\"), new Option(\"B\", \"b\"), new Option(\"C\", \"c\"));\n * setSelectValue(select, [\"a\", \"c\"]); // A and C selected, B cleared\n * @see ssrSelectValue\n * @since 1.0.0\n */\nexport function setSelectValue(select: HTMLSelectElement, value: unknown): void {\n if (select.multiple && Array.isArray(value)) {\n const wanted = listed(value);\n for (const option of Array.from(select.options)) option.selected = wanted.has(option.value);\n return;\n }\n select.value = plainText(value);\n}\n"],"mappings":";;AACA,SAAS,OAAO,OAAwC;CACtD,OAAO,IAAI,IAAI,MAAM,QAAQ,SAAS,SAAS,QAAQ,SAAS,KAAA,CAAS,CAAC,CAAC,IAAI,MAAM,CAAC;AACxF;;AAGA,SAAgB,UAAU,OAAwB;CAChD,OAAO,UAAU,QAAQ,UAAU,KAAA,IAAY,KAAK,OAAO,KAAK;AAClE;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,eAAe,QAA2B,OAAsB;CAC9E,IAAI,OAAO,YAAY,MAAM,QAAQ,KAAK,GAAG;EAC3C,MAAM,SAAS,OAAO,KAAK;EAC3B,KAAK,MAAM,UAAU,MAAM,KAAK,OAAO,OAAO,GAAG,OAAO,WAAW,OAAO,IAAI,OAAO,KAAK;EAC1F;CACF;CACA,OAAO,QAAQ,UAAU,KAAK;AAChC"}
1
+ {"version":3,"file":"select-value.js","names":[],"sources":["../../src/select-value.ts"],"sourcesContent":["import { keepWatchingCommits } from \"./insert\";\n\n/** The value each select was last given, which it takes again when its options change (see {@link setSelectValue}). */\nconst bound = new WeakMap<HTMLSelectElement, unknown>();\n\n/** The values an array stands for, as strings; null and undefined entries are skipped. */\nfunction listed(value: readonly unknown[]): Set<string> {\n return new Set(value.filter((item) => item !== null && item !== undefined).map(String));\n}\n\n/** The string a value assigns to `select.value`, `innerHTML` or `textContent`; null and undefined are empty. @internal */\nexport function plainText(value: unknown): string {\n return value === null || value === undefined ? \"\" : String(value);\n}\n\n/**\n * Selects the options a `value` stands for. The compiler calls it for `<select value={...}>`. A\n * single value behaves like `select.value = value` (`null` and `undefined` are the empty string).\n * On a `<select multiple>` an array selects exactly the options whose value it lists and clears\n * the others. The server writes the same state as `selected` on the options (`ssrSelectValue`). The select\n * takes the value again whenever the nodes inside it change (the options of a `<For>`, a `<Show>` or an optgroup), so\n * options that arrive or are replaced after the value keep it selected.\n *\n * @param select The select element; its options must already be in it.\n * @param value A string or number (written as `String(value)`), or `null`/`undefined` (written as\n * `\"\"`: an option with an empty value is selected, otherwise none). For a `multiple` select, an array of them: `null` and `undefined`\n * entries are skipped. An array on a single select is written as `String(array)`.\n * @example\n * import { setSelectValue } from \"@shadow-js/web\";\n *\n * const select = document.createElement(\"select\");\n * select.multiple = true;\n * select.append(new Option(\"A\", \"a\"), new Option(\"B\", \"b\"), new Option(\"C\", \"c\"));\n * setSelectValue(select, [\"a\", \"c\"]); // A and C selected, B cleared\n * @see ssrSelectValue\n * @since 1.0.0\n */\nexport function setSelectValue(select: HTMLSelectElement, value: unknown): void {\n // Options that arrive or are replaced after this call (a `<For>` inside the select) leave the browser's own pick, the\n // first option: the select takes its value again after each commit to its children, as React's does.\n if (!bound.has(select)) keepWatchingCommits(select, () => apply(select, bound.get(select)));\n bound.set(select, value);\n apply(select, value);\n}\n\nfunction apply(select: HTMLSelectElement, value: unknown): void {\n if (select.multiple && Array.isArray(value)) {\n const wanted = listed(value);\n for (const option of Array.from(select.options)) option.selected = wanted.has(option.value);\n return;\n }\n select.value = plainText(value);\n}\n"],"mappings":";;;AAGA,MAAM,wBAAQ,IAAI,QAAoC;;AAGtD,SAAS,OAAO,OAAwC;CACtD,OAAO,IAAI,IAAI,MAAM,QAAQ,SAAS,SAAS,QAAQ,SAAS,KAAA,CAAS,CAAC,CAAC,IAAI,MAAM,CAAC;AACxF;;AAGA,SAAgB,UAAU,OAAwB;CAChD,OAAO,UAAU,QAAQ,UAAU,KAAA,IAAY,KAAK,OAAO,KAAK;AAClE;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,eAAe,QAA2B,OAAsB;CAG9E,IAAI,CAAC,MAAM,IAAI,MAAM,GAAG,oBAAoB,cAAc,MAAM,QAAQ,MAAM,IAAI,MAAM,CAAC,CAAC;CAC1F,MAAM,IAAI,QAAQ,KAAK;CACvB,MAAM,QAAQ,KAAK;AACrB;AAEA,SAAS,MAAM,QAA2B,OAAsB;CAC9D,IAAI,OAAO,YAAY,MAAM,QAAQ,KAAK,GAAG;EAC3C,MAAM,SAAS,OAAO,KAAK;EAC3B,KAAK,MAAM,UAAU,MAAM,KAAK,OAAO,OAAO,GAAG,OAAO,WAAW,OAAO,IAAI,OAAO,KAAK;EAC1F;CACF;CACA,OAAO,QAAQ,UAAU,KAAK;AAChC"}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@shadow-js/web",
3
- "version": "1.0.5",
3
+ "version": "1.1.0",
4
4
  "description": "A DOM renderer with no virtual DOM, plus control flow, server rendering and hydration",
5
5
  "license": "MIT",
6
6
  "type": "module",
@@ -109,7 +109,7 @@
109
109
  "typecheck": "tsc -p tsconfig.json && tsc -p tsconfig.test-types.json"
110
110
  },
111
111
  "peerDependencies": {
112
- "@shadow-js/core": "^1.0.5"
112
+ "@shadow-js/core": "^1.1.0"
113
113
  },
114
114
  "devDependencies": {
115
115
  "@biomejs/biome": "2.5.15",