rea-agents 6.2.0 → 6.4.0

package/dist/domain/javascript/javascriptSemanticMemberMutations.js

@@ -1,64 +1,315 @@
 import * as t from "@babel/types";
 import { resolveSemanticBindingState, } from "./javascriptSemanticState.js";
-import { evaluateSemanticBinding } from "./javascriptSemanticValues.js";
-import { traverseJavaScriptAst } from "./javascriptSemanticTraversal.js";
-import { semanticStaticPropertyKey } from "./javascriptAstValues.js";
-/** Keep explicit property mutations outside the initializer-only value lattice. */
-export const collectSemanticMemberMutations = (program, state) => {
-    const parents = new WeakMap();
-    traverseJavaScriptAst(program, {
-        enter: (node, parent) => {
-            if (parent !== null)
-                parents.set(node, parent);
-        },
-    });
-    const markValue = (node, path, bindings, mutation) => {
-        if (t.isIdentifier(node)) {
-            const binding = resolveSemanticBindingState(state, node, node.name);
-            if (binding === undefined || bindings.has(binding.bindingId))
-                return;
-            const value = evaluateSemanticBinding(binding, state);
-            if (value.status === "literal" || value.status === "union")
-                return;
-            binding.mutatedPaths.push(path);
-            const nested = new Set([...bindings, binding.bindingId]);
-            for (const initializer of mutationInitializers(binding, mutation, parents))
-                markValue(initializer.node, [...initializer.projection, ...path], nested, mutation);
+import { clearSemanticPrimitiveBindingValues, evaluateSemanticBinding, evaluateSemanticExpression, } from "./javascriptSemanticValues.js";
+import { semanticContainer, semanticSlotAtPath, } from "./javascriptSemanticSlots.js";
+import { semanticClassCandidates, semanticClassPropertyReferences, semanticObjectPropertyReferences, } from "./javascriptSemanticObjectReferences.js";
+import { semanticIterationSources } from "./javascriptSemanticIterationSources.js";
+import { semanticCallableResultExpressions } from "./javascriptSemanticCallableResults.js";
+import { createSemanticReturnedReferences } from "./javascriptSemanticReturnedReferences.js";
+import { semanticMutationInitializers } from "./javascriptSemanticMutationInitializers.js";
+import { semanticArrayIndex, SemanticPropertyPathCoverage, semanticPropertyPathKeyMatches, } from "./javascriptSemanticPropertyPaths.js";
+import { compareUnicodeCodePoints } from "../unicodeCodePointOrder.js";
+import { traverseJavaScriptAstSteps } from "./javascriptSemanticTraversal.js";
+import { semanticStaticPropertyKey, semanticMemberWriteTargets, unwrapJavaScriptExpression, } from "./javascriptAstValues.js";
+/** Preserve uncertainty from property writes and references exposed to calls, yielding during traversal and fixpoint iteration. */
+export function* collectSemanticMemberMutationsSteps(program, state) {
+    const parents = state.parentsByNode;
+    const normalizePath = observableMutationPaths(state);
+    const returnedReferences = createSemanticReturnedReferences(state);
+    const recordedEffects = new Set();
+    const selections = new Map();
+    const coveringPaths = new Map();
+    let arrayIterationUnknown = false;
+    const pendingReferences = [];
+    const iterableReferences = [];
+    const iterableReferenceKeys = new WeakMap();
+    const deferIterable = (reference) => {
+        const keys = iterableReferenceKeys.get(reference.node) ?? new Set();
+        const key = JSON.stringify([
+            reference.projection,
+            reference.path,
+            reference.fallbackPath,
+            reference.effect,
+            reference.mutation?.start,
+            reference.mutation?.end,
+            reference.originAt?.start,
+            reference.originAt?.end,
+            reference.iterationOnly,
+            reference.requiredSources?.map((source) => [
+                source.node.start,
+                source.node.end,
+                source.projection,
+            ]),
+            reference.fallbackSources?.map((source) => [
+                source.node.start,
+                source.node.end,
+                source.projection,
+            ]),
+            [...reference.bindings].sort(compareUnicodeCodePoints),
+        ]);
+        if (keys.has(key))
             return;
+        keys.add(key);
+        iterableReferenceKeys.set(reference.node, keys);
+        iterableReferences.push(reference);
+    };
+    const markValue = (node, path, bindings, effect = "write", mutation, originAt = mutation) => {
+        const pending = [{ node, path, bindings, originAt }];
+        // Visit shallower alias traversals first so their exact prefixes suppress
+        // longer loop paths before those paths enumerate every assignment order.
+        for (let cursor = 0; cursor < pending.length; cursor++) {
+            const current = pending[cursor];
+            if (current === undefined)
+                break;
+            const expression = unwrapJavaScriptExpression(current.node).node;
+            if (t.isIdentifier(expression)) {
+                const binding = resolveSemanticBindingState(state, expression, expression.name);
+                if (binding === undefined) {
+                    if ((expression.name === "Array" &&
+                        (current.path[0] === "prototype" || current.path[0] === null)) ||
+                        (["globalThis", "global", "window", "self"].includes(expression.name) &&
+                            (current.path[0] === "Array" || current.path[0] === null) &&
+                            (current.path[1] === "prototype" || current.path[1] === null)))
+                        arrayIterationUnknown = true;
+                    continue;
+                }
+                // An alias restored from a saved reference can revisit the same binding
+                // at an earlier capture or a shorter getter-receiver path. Only a
+                // repeated capture and path closes a cycle.
+                const lifetime = JSON.stringify([
+                    binding.bindingId,
+                    current.originAt?.start,
+                    current.originAt?.end,
+                    current.path,
+                ]);
+                if (current.bindings.has(lifetime))
+                    continue;
+                // Union compatible copied-slot selections at each binding. Carrying every
+                // combination of exclusions through branch diamonds is exponential.
+                // Preserve paths that can change observed slots or Array prototype
+                // effects; canonicalize suffixes that cannot distinguish lattice facts.
+                let path = normalizePath(binding.bindingId, current.path, effect);
+                if (path === null)
+                    continue;
+                const selectorIndex = path.findIndex((key) => key !== null && typeof key === "object");
+                const selector = path[selectorIndex];
+                if (selector !== null && typeof selector === "object") {
+                    const selectionIdentity = JSON.stringify([
+                        binding.bindingId,
+                        effect,
+                        path.map((key, index) => index === selectorIndex
+                            ? { startIndex: selector.startIndex }
+                            : key),
+                        mutation?.start,
+                        mutation?.end,
+                        current.originAt?.start,
+                        current.originAt?.end,
+                    ]);
+                    const previous = selections.get(selectionIdentity);
+                    const excludedKeys = previous === undefined
+                        ? selector.excludedKeys
+                        : previous.filter((key) => selector.excludedKeys.includes(key));
+                    if (previous !== undefined && excludedKeys.length === previous.length)
+                        continue;
+                    selections.set(selectionIdentity, excludedKeys);
+                    path = path.map((key, index) => index === selectorIndex ? { ...selector, excludedKeys } : key);
+                }
+                // Keep an antichain of exact paths. Widening distinct member keys would
+                // also invalidate unrelated siblings that never reach this effect.
+                const pathState = JSON.stringify([
+                    binding.bindingId,
+                    effect,
+                    // Short writes stop at owned literal slots, whereas longer writes
+                    // reach shared children. Only equal-depth writes cover one another.
+                    effect === "write" ? path.length : null,
+                    mutation?.start,
+                    mutation?.end,
+                    current.originAt?.start,
+                    current.originAt?.end,
+                ]);
+                let covering = coveringPaths.get(pathState);
+                if (covering === undefined) {
+                    covering = new SemanticPropertyPathCoverage();
+                    coveringPaths.set(pathState, covering);
+                }
+                if (!covering.retain(path))
+                    continue;
+                const identity = JSON.stringify([
+                    binding.bindingId,
+                    effect,
+                    path,
+                    mutation?.start,
+                    mutation?.end,
+                    current.originAt?.start,
+                    current.originAt?.end,
+                ]);
+                if (recordedEffects.has(identity))
+                    continue;
+                // A recorded write invalidates the binding to a non-primitive value, so
+                // only its first write can target a primitive. Re-evaluating it would
+                // replay every earlier write and make repeated writes superlinear.
+                const value = effect === "write" && binding.mutatedPaths.length === 0
+                    ? evaluateSemanticBinding(binding, state)
+                    : undefined;
+                const primitiveWrite = value?.status === "literal" || value?.status === "union";
+                recordedEffects.add(identity);
+                const nested = new Set([...current.bindings, lifetime]);
+                const origins = current.originAt === undefined
+                    ? binding
+                    : semanticMutationInitializers(binding, current.originAt, parents);
+                if (!primitiveWrite) {
+                    if (effect === "escape")
+                        binding.escapedPaths.push({ path, node: mutation });
+                    else
+                        binding.mutatedPaths.push(path);
+                    clearSemanticPrimitiveBindingValues(state);
+                    for (const initializer of origins.initializers)
+                        pending.push({
+                            node: initializer.node,
+                            path: [...initializer.projection, ...path],
+                            bindings: nested,
+                            originAt: initializer.node,
+                        });
+                }
+                for (const initializer of origins.referenceInitializers) {
+                    const copiedPath = copiedReferencePath(initializer, path, effect);
+                    if (copiedPath === null)
+                        continue;
+                    pendingReferences.push({
+                        initializer,
+                        path: copiedPath,
+                        bindings: nested,
+                        effect,
+                        originAt: initializer.node,
+                        ...(mutation === undefined ? {} : { mutation }),
+                    });
+                }
+            }
+            else if (t.isMemberExpression(expression) ||
+                t.isOptionalMemberExpression(expression)) {
+                pending.push({
+                    node: expression.object,
+                    path: [
+                        semanticStaticPropertyKey(expression.property, expression.computed),
+                        ...current.path,
+                    ],
+                    bindings: current.bindings,
+                    originAt: current.originAt,
+                });
+            }
+            else {
+                for (const value of effect === "escape"
+                    ? escapedReferenceLeaves(expression, current.path)
+                    : expandedValues(expression, current.path, effect)) {
+                    if (value.iterableFallbackPath !== undefined)
+                        deferIterable({
+                            node: value.node,
+                            projection: [],
+                            path: value.path,
+                            fallbackPath: value.iterableFallbackPath,
+                            bindings: current.bindings,
+                            effect,
+                            originAt: current.originAt,
+                            ...(mutation === undefined ? {} : { mutation }),
+                        });
+                    else
+                        pending.push({
+                            ...value,
+                            bindings: current.bindings,
+                            originAt: current.originAt,
+                        });
+                }
+            }
         }
-        if (t.isMemberExpression(node) || t.isOptionalMemberExpression(node)) {
-            const members = [];
-            let current = node;
-            while (t.isMemberExpression(current) ||
-                t.isOptionalMemberExpression(current)) {
-                members.push(semanticStaticPropertyKey(current.property, current.computed));
-                current = current.object;
+    };
+    const markEscaped = (node, mutation, path = []) => markValue(node, path, new Set(), "escape", mutation);
+    function expandedValues(expression, path, effect) {
+        if (t.isArrayExpression(expression) &&
+            ((path[0] === "__proto__" && (effect === "escape" || path.length > 1)) ||
+                (path[0] === "constructor" && path[1] === "prototype")))
+            arrayIterationUnknown = true;
+        return referencedValues(expression, path, effect, state);
+    }
+    // Expanding a value below its references depends only on syntax, not on the
+    // escape site. Escaping an object reaches every method's results, so
+    // re-expanding it at each call through that object made N calls over N
+    // methods quadratic. Identifiers that resolve to the same binding and path
+    // are processed identically, so one stands for all of them.
+    const escapedLeaves = new WeakMap();
+    function escapedReferenceLeaves(root, rootPath) {
+        // Parser recovery can leave an argument hole, which expands to nothing.
+        if (!t.isNode(root))
+            return [];
+        const rootKey = JSON.stringify(rootPath);
+        const cached = escapedLeaves.get(root)?.get(rootKey);
+        if (cached !== undefined)
+            return cached;
+        const leaves = [];
+        const leafIdentities = new Set();
+        const expanded = new WeakMap();
+        const pending = [...expandedValues(root, rootPath, "escape")];
+        for (let cursor = 0; cursor < pending.length; cursor++) {
+            const value = pending[cursor];
+            if (value === undefined)
+                break;
+            const node = unwrapJavaScriptExpression(value.node).node;
+            if (!t.isNode(node))
+                continue;
+            const pathKey = JSON.stringify(value.path);
+            if (t.isIdentifier(node) && value.iterableFallbackPath === undefined) {
+                const binding = resolveSemanticBindingState(state, node, node.name);
+                const identity = JSON.stringify([
+                    binding === undefined ? null : binding.bindingId,
+                    binding === undefined ? node.name : null,
+                    pathKey,
+                ]);
+                if (leafIdentities.has(identity))
+                    continue;
+                leafIdentities.add(identity);
+                leaves.push(value);
+            }
+            else if (value.iterableFallbackPath !== undefined ||
+                t.isIdentifier(node) ||
+                t.isMemberExpression(node) ||
+                t.isOptionalMemberExpression(node))
+                leaves.push(value);
+            else {
+                const paths = expanded.get(node) ?? new Set();
+                if (paths.has(pathKey))
+                    continue;
+                paths.add(pathKey);
+                expanded.set(node, paths);
+                for (const reference of expandedValues(node, value.path, "escape"))
+                    pending.push(reference);
             }
-            markValue(current, [...members.reverse(), ...path], bindings, mutation);
-            return;
         }
-        for (const value of referencedValues(node, path))
-            markValue(value.node, value.path, bindings, mutation);
+        const byPath = escapedLeaves.get(root) ?? new Map();
+        byPath.set(rootKey, leaves);
+        escapedLeaves.set(root, byPath);
+        return leaves;
+    }
+    const markReceiver = (callee, mutation) => {
+        const expression = unwrapJavaScriptExpression(callee).node;
+        if (t.isMemberExpression(expression) ||
+            t.isOptionalMemberExpression(expression))
+            markEscaped(expression.object, mutation);
     };
     const markTarget = (node, mutation) => {
-        if (t.isMemberExpression(node) || t.isOptionalMemberExpression(node))
-            markValue(node.object, [semanticStaticPropertyKey(node.property, node.computed)], new Set(), mutation);
-        else if (t.isRestElement(node))
-            markTarget(node.argument, mutation);
-        else if (t.isAssignmentPattern(node))
-            markTarget(node.left, mutation);
-        else if (t.isArrayPattern(node)) {
-            for (const element of node.elements)
-                if (element !== null)
-                    markTarget(element, mutation);
-        }
-        else if (t.isObjectPattern(node)) {
-            for (const property of node.properties)
-                markTarget(t.isRestElement(property) ? property.argument : property.value, mutation);
-        }
+        for (const target of semanticMemberWriteTargets(node))
+            markValue(target.object, [semanticStaticPropertyKey(target.property, target.computed)], new Set(), "write", mutation);
     };
-    traverseJavaScriptAst(program, {
-        enter: (node) => {
+    yield* traverseJavaScriptAstSteps(program, {
+        enter: (node, parent) => {
+            for (const source of semanticIterationSources(node, parent))
+                deferIterable({
+                    ...source,
+                    path: source.projection,
+                    fallbackPath: source.projection,
+                    bindings: new Set(),
+                    effect: "escape",
+                    originAt: source.mutation,
+                    iterationOnly: source.kind === "iteration",
+                });
             if (t.isAssignmentExpression(node))
                 markTarget(node.left, node);
             else if (t.isUpdateExpression(node))
@@ -67,96 +318,209 @@ export const collectSemanticMemberMutations = (program, state) => {
                 markTarget(node.argument, node);
             else if (t.isForOfStatement(node) || t.isForInStatement(node))
                 markTarget(node.left, node);
+            else if (t.isCallExpression(node) ||
+                t.isOptionalCallExpression(node) ||
+                t.isNewExpression(node)) {
+                for (const source of returnedReferences(node.callee))
+                    markEscaped(source.node, node, source.projection);
+                for (const argument of node.arguments)
+                    if (t.isSpreadElement(argument))
+                        deferIterable({
+                            node: argument.argument,
+                            projection: [],
+                            path: [null],
+                            fallbackPath: [],
+                            bindings: new Set(),
+                            effect: "escape",
+                            mutation: node,
+                            originAt: node,
+                        });
+                    else
+                        markEscaped(argument, node);
+                // Constructing a member does not pass its container as `this`.
+                if (!t.isNewExpression(node))
+                    markReceiver(node.callee, node);
+            }
+            else if (t.isTaggedTemplateExpression(node)) {
+                markReceiver(node.tag, node);
+                for (const expression of node.quasi.expressions)
+                    markEscaped(expression, node);
+            }
         },
     });
-};
-const statementPosition = (statement, parents) => {
-    const parent = parents.get(statement);
-    if (!t.isProgram(parent) && !t.isBlockStatement(parent))
-        return null;
-    const index = parent.body.indexOf(statement);
-    return index < 0 ? null : { body: parent.body, index };
-};
-const directInitializerPosition = (node, parents) => {
-    const parent = parents.get(node);
-    if (t.isVariableDeclarator(parent) && parent.init === node) {
-        const declaration = parents.get(parent);
-        return t.isVariableDeclaration(declaration)
-            ? statementPosition(declaration, parents)
-            : null;
-    }
-    if (t.isAssignmentExpression(parent) &&
-        parent.operator === "=" &&
-        parent.right === node &&
-        t.isIdentifier(parent.left)) {
-        const statement = parents.get(parent);
-        return t.isExpressionStatement(statement) && statement.expression === parent
-            ? statementPosition(statement, parents)
-            : null;
+    // A later effect can make a previously defined destructuring source uncertain.
+    // Reconsider defaults and iterable origins until their effects are stable.
+    while (pendingReferences.length > 0 || iterableReferences.length > 0) {
+        const effectsBefore = recordedEffects.size;
+        const iterablesBefore = iterableReferences.length;
+        const iterationBefore = arrayIterationUnknown;
+        for (const [index, reference] of pendingReferences.splice(0).entries()) {
+            if (index % 64 === 0)
+                yield;
+            const { initializer } = reference;
+            if (referenceSourcesInactive(initializer, state))
+                pendingReferences.push(reference);
+            else if (t.isForOfStatement(initializer.node))
+                deferIterable({
+                    node: initializer.node.right,
+                    projection: [],
+                    path: [null, ...reference.path],
+                    fallbackPath: [],
+                    bindings: reference.bindings,
+                    effect: reference.effect,
+                    originAt: initializer.node,
+                    ...(reference.mutation === undefined
+                        ? {}
+                        : { mutation: reference.mutation }),
+                });
+            else if (initializer.copyKind === "array-rest" &&
+                initializer.copyProjectionOffset !== undefined) {
+                const offset = initializer.copyProjectionOffset;
+                const projection = initializer.projection.slice(0, offset);
+                deferIterable({
+                    node: initializer.node,
+                    projection,
+                    path: reference.path,
+                    fallbackPath: projection,
+                    bindings: reference.bindings,
+                    effect: reference.effect,
+                    originAt: reference.originAt,
+                    ...(reference.mutation === undefined
+                        ? {}
+                        : { mutation: reference.mutation }),
+                });
+            }
+            else
+                markValue(initializer.node, reference.path, reference.bindings, reference.effect, reference.mutation, reference.originAt);
+        }
+        for (const [index, reference] of [...iterableReferences].entries()) {
+            if (index % 64 === 0)
+                yield;
+            if (referenceSourcesInactive(reference, state))
+                continue;
+            if (reference.iterationOnly) {
+                const expanded = expandedIterationReferences(reference, state);
+                if (expanded !== null) {
+                    for (const selected of expanded)
+                        deferIterable(selected);
+                    continue;
+                }
+            }
+            const slot = selectedReferenceSlot(reference, state);
+            // Custom iteration can yield the iterable itself as well as any child.
+            // Treat its root as escaped, including writes through yielded references.
+            const knownArray = !arrayIterationUnknown &&
+                slot?.value.status === "array" &&
+                slot.value.items.every((item) => semanticArrayIndex(item.name) !== null);
+            if (knownArray && reference.iterationOnly)
+                continue;
+            markValue(reference.node, knownArray ? reference.path : reference.fallbackPath, reference.bindings, knownArray ? reference.effect : "escape", reference.mutation, reference.originAt);
+        }
+        if (recordedEffects.size === effectsBefore &&
+            iterableReferences.length === iterablesBefore &&
+            arrayIterationUnknown === iterationBefore)
+            break;
     }
-    return null;
-};
-const directMutationPosition = (node, parents) => {
-    if (!t.isAssignmentExpression(node) &&
-        !t.isUpdateExpression(node) &&
-        !t.isUnaryExpression(node, { operator: "delete" }))
+    // Gathering effects can evaluate a primitive projection before its object
+    // escapes. Final values must use the completed mutation state.
+    clearSemanticPrimitiveBindingValues(state);
+}
+const referenceSourcesInactive = (reference, state) => reference.requiredSources?.some((source) => selectedReferenceSlot(source, state, source.node)?.presence === "absent") === true ||
+    reference.fallbackSources?.some((source) => {
+        // Selection precedes effects through the chosen reference. A later escape
+        // cannot make a fallback that was excluded at destructuring reachable.
+        const slot = selectedReferenceSlot(source, state, source.node);
+        return (slot?.presence === "present" &&
+            (slot.value.status === "literal" ||
+                slot.value.status === "union" ||
+                slot.value.status === "object" ||
+                slot.value.status === "array"));
+    }) === true;
+const expandedIterationReferences = (reference, state) => {
+    if (!t.isForOfStatement(reference.mutation))
         return null;
-    const statement = parents.get(node);
-    return t.isExpressionStatement(statement) && statement.expression === node
-        ? statementPosition(statement, parents)
-        : null;
-};
-const mutationInitializers = (binding, mutation, parents) => {
-    if (binding.initializers.length < 2)
-        return binding.initializers;
-    const mutationPosition = directMutationPosition(mutation, parents);
-    if (mutationPosition === null)
-        return binding.initializers;
-    const positions = binding.initializers.map(({ node }) => directInitializerPosition(node, parents));
-    if (positions.some((position) => position === null ||
-        position.body !== mutationPosition.body ||
-        position.index >= mutationPosition.index))
-        return binding.initializers;
-    const latestIndex = positions.reduce((latest, position) => Math.max(latest, position?.index ?? -1), -1);
-    return binding.initializers.filter((_, index) => positions[index]?.index === latestIndex);
+    const iterable = reference.mutation.right;
+    // Expand only the loop's yielded-item selector. Enumerating dynamic property
+    // selections would multiply paths through shared object aliases.
+    const source = [
+        reference,
+        ...(reference.requiredSources ?? []),
+        ...(reference.fallbackSources ?? []),
+    ].find((source) => source.node === iterable && source.projection[0] === null);
+    if (source === undefined)
+        return null;
+    const slot = selectedReferenceSlot({ node: iterable, projection: [] }, state);
+    const container = slot === undefined ? null : semanticContainer(slot.value);
+    if (container?.coverage.status !== "complete")
+        return null;
+    const select = (candidate, name) => ({
+        ...candidate,
+        projection: candidate.node === iterable && candidate.projection[0] === null
+            ? [name, ...candidate.projection.slice(1)]
+            : candidate.projection,
+    });
+    return container.slots.map((slot) => {
+        const { projection } = select(reference, slot.name);
+        return {
+            ...reference,
+            projection,
+            path: projection,
+            fallbackPath: projection,
+            ...(reference.requiredSources === undefined
+                ? {}
+                : {
+                    requiredSources: reference.requiredSources.map((source) => select(source, slot.name)),
+                }),
+            ...(reference.fallbackSources === undefined
+                ? {}
+                : {
+                    fallbackSources: reference.fallbackSources.map((source) => select(source, slot.name)),
+                }),
+        };
+    });
 };
-const referencedValues = (node, path) => {
-    const [key, ...remaining] = path;
+const referencedValues = (node, path, effect, state) => {
+    if (effect === "escape" && t.isFunction(node))
+        return semanticCallableResultExpressions(node).flatMap(({ node, delegated }) => node === null ? [] : [{ node, path: delegated ? [null] : [] }]);
     // An initializer owns its slots; only deeper writes can affect shared children.
-    if (t.isObjectExpression(node))
-        return path.length < 2
-            ? []
-            : node.properties.flatMap((property) => {
-                if (t.isSpreadElement(property))
-                    return [{ node: property.argument, path }];
-                if (!t.isObjectProperty(property))
-                    return [];
-                const name = semanticStaticPropertyKey(property.key, property.computed);
-                return key === null || name === null || String(key) === name
-                    ? [{ node: property.value, path: remaining }]
-                    : [];
-            });
-    if (t.isArrayExpression(node)) {
-        if (path.length < 2)
+    if (t.isObjectExpression(node) || t.isArrayExpression(node)) {
+        if (effect === "write" && path.length < 2)
             return [];
-        let uncertainIndex = false;
-        return node.elements.flatMap((element, index) => {
-            if (element === null)
-                return [];
-            if (t.isSpreadElement(element)) {
-                uncertainIndex = true;
-                return [{ node: element.argument, path: [null, ...remaining] }];
-            }
-            return uncertainIndex || key === null || String(key) === String(index)
-                ? [{ node: element, path: remaining }]
-                : [];
-        });
+        return t.isObjectExpression(node)
+            ? semanticObjectPropertyReferences(node, path, state)
+            : arrayReferencedValues(node, path);
+    }
+    if (t.isClass(node)) {
+        const [key, ...remaining] = path;
+        if (key === undefined)
+            return [];
+        // Replacing or deleting the getter's property does not use the value it
+        // would return. Only a deeper path can mutate the returned object.
+        if (effect === "write" && remaining.length === 0)
+            return [];
+        return semanticClassPropertyReferences({ owner: node, kind: "static" }, [key, ...remaining], state);
+    }
+    if (t.isNewExpression(node)) {
+        const [key, ...remaining] = path;
+        if (key === undefined)
+            return [];
+        if (effect === "write" && remaining.length === 0)
+            return [];
+        return semanticClassCandidates(node.callee, state).flatMap((klass) => semanticClassPropertyReferences({ owner: klass, kind: "instance" }, [key, ...remaining], state));
+    }
+    if (t.isAssignmentExpression(node))
+        return node.operator === "||=" || node.operator === "??="
+            ? [
+                { node: node.left, path },
+                { node: node.right, path },
+            ]
+            : [{ node: node.right, path }];
+    if (t.isAwaitExpression(node))
+        return [{ node: node.argument, path }];
+    if (t.isSequenceExpression(node)) {
+        const last = node.expressions.at(-1);
+        return last === undefined ? [] : [{ node: last, path }];
     }
-    if (t.isTSAsExpression(node) ||
-        t.isTSTypeAssertion(node) ||
-        t.isTSSatisfiesExpression(node) ||
-        t.isTSNonNullExpression(node))
-        return [{ node: node.expression, path }];
     if (t.isConditionalExpression(node))
         return [
             { node: node.consequent, path },
@@ -167,7 +531,281 @@ const referencedValues = (node, path) => {
             { node: node.left, path },
             { node: node.right, path },
         ];
-    if (t.isAssignmentExpression(node, { operator: "&&=" }))
-        return [{ node: node.right, path }];
     return [];
 };
+const observableMutationPaths = (state) => {
+    const bindingNodes = new Map();
+    const expressions = new WeakMap();
+    const pendingExpressions = [];
+    const pending = [];
+    const queued = new Set();
+    const schedule = (node) => {
+        if (queued.has(node))
+            return;
+        queued.add(node);
+        pending.push(node);
+    };
+    const create = (read) => 
+    // Most bindings have no object origin or property projection. Materialize
+    // each collection only when it contains a fact or relationship.
+    read === undefined ? {} : { read };
+    const link = (source, target) => {
+        if (target.sources?.has(source) === true)
+            return;
+        (target.sources ??= new Set()).add(source);
+        (source.dependents ??= new Set()).add(target);
+        schedule(target);
+    };
+    const expressionNode = (node) => {
+        const expression = unwrapJavaScriptExpression(node).node;
+        const existing = expressions.get(expression);
+        if (existing !== undefined)
+            return existing;
+        const observer = create();
+        expressions.set(expression, observer);
+        pendingExpressions.push({ expression, observer });
+        return observer;
+    };
+    const project = (source, path) => {
+        let observer = source;
+        for (const key of path) {
+            const identity = JSON.stringify(key === null || typeof key === "object" ? key : String(key));
+            let selected = observer.projections?.get(identity);
+            if (selected === undefined) {
+                selected = create({ source: observer, key });
+                (observer.projections ??= new Map()).set(identity, selected);
+                (observer.dependents ??= new Set()).add(selected);
+                schedule(selected);
+            }
+            observer = selected;
+        }
+        return observer;
+    };
+    for (const binding of state.bindingsById.values())
+        bindingNodes.set(binding.bindingId, create());
+    for (const binding of state.bindingsById.values()) {
+        const observer = bindingNodes.get(binding.bindingId);
+        if (observer === undefined)
+            continue;
+        for (const initializer of binding.initializers) {
+            const expression = unwrapJavaScriptExpression(initializer.node).node;
+            // Preserve member paths through class values and local instances so
+            // getter-result aliases can be resolved at the accessor boundary.
+            if (t.isClass(expression) || t.isNewExpression(expression))
+                (observer.origins ??= new Set()).add("opaque");
+            link(project(expressionNode(initializer.node), initializer.projection), observer);
+        }
+        // Preserve exact paths where copies, defaults or iteration need their
+        // reference-specific projections; an opaque origin prevents pruning.
+        if (binding.referenceInitializers.length > 0)
+            (observer.origins ??= new Set()).add("opaque");
+        for (const initializer of binding.referenceInitializers) {
+            for (const source of [
+                initializer,
+                ...(initializer.requiredSources ?? []),
+                ...(initializer.fallbackSources ?? []),
+            ])
+                link(expressionNode(source.node), observer);
+        }
+    }
+    const settle = () => {
+        while (pendingExpressions.length > 0 || pending.length > 0) {
+            while (pendingExpressions.length > 0) {
+                const selected = pendingExpressions.pop();
+                if (selected === undefined)
+                    break;
+                const { expression, observer } = selected;
+                if (t.isObjectExpression(expression) || t.isArrayExpression(expression))
+                    (observer.origins ??= new Set()).add(expression);
+                else if (t.isIdentifier(expression)) {
+                    const binding = resolveSemanticBindingState(state, expression, expression.name);
+                    if (binding !== undefined) {
+                        const origin = bindingNodes.get(binding.bindingId);
+                        if (origin !== undefined)
+                            link(origin, observer);
+                    }
+                    else if (expression.name === "Array")
+                        (observer.origins ??= new Set()).add("array");
+                    else if (["globalThis", "global", "window", "self"].includes(expression.name))
+                        (observer.origins ??= new Set()).add("ambient");
+                }
+                else if (t.isMemberExpression(expression) ||
+                    t.isOptionalMemberExpression(expression))
+                    link(project(expressionNode(expression.object), [
+                        semanticStaticPropertyKey(expression.property, expression.computed),
+                    ]), observer);
+                else
+                    for (const reference of referencedValues(expression, [], "escape", state))
+                        link(project(expressionNode(reference.node), reference.path), observer);
+                schedule(observer);
+            }
+            const observer = pending.pop();
+            if (observer === undefined)
+                continue;
+            queued.delete(observer);
+            let changed = false;
+            const add = (origin) => {
+                if (observer.origins?.has(origin) === true)
+                    return;
+                (observer.origins ??= new Set()).add(origin);
+                changed = true;
+            };
+            for (const source of observer.sources ?? [])
+                for (const origin of source.origins ?? [])
+                    add(origin);
+            if (observer.read !== undefined) {
+                const { source, key } = observer.read;
+                if (key === null || typeof key === "object") {
+                    // Dynamic keys and copied-slot masks retain their original paths.
+                    // Enumerating their exclusion combinations would recreate the growth
+                    // that the mutation collector's selection union already prevents.
+                    if ((source.origins?.size ?? 0) > 0)
+                        add("opaque");
+                }
+                else
+                    for (const origin of source.origins ?? []) {
+                        if (typeof origin === "string") {
+                            if (origin === "array-prototype" || origin === "opaque")
+                                add(origin);
+                            else if (origin === "ambient" &&
+                                semanticPropertyPathKeyMatches(key, "Array"))
+                                add("array");
+                            else if (origin === "array" &&
+                                semanticPropertyPathKeyMatches(key, "prototype"))
+                                add("array-prototype");
+                        }
+                        else {
+                            for (const reference of referencedValues(origin, [key], "escape", state)) {
+                                link(project(expressionNode(reference.node), reference.path), observer);
+                                if (reference.iterableFallbackPath !== undefined)
+                                    link(project(expressionNode(reference.node), reference.iterableFallbackPath), observer);
+                            }
+                        }
+                    }
+            }
+            if (changed)
+                for (const dependent of observer.dependents ?? [])
+                    schedule(dependent);
+        }
+    };
+    settle();
+    return (bindingId, path, effect) => {
+        let observer = bindingNodes.get(bindingId);
+        if (observer === undefined)
+            return path;
+        if (path.some((key) => key !== null && typeof key === "object"))
+            return path;
+        if (effect === "escape") {
+            observer = project(observer, path);
+            settle();
+            return (observer.origins?.size ?? 0) === 0 ? null : path;
+        }
+        if ((observer.origins?.size ?? 0) === 0)
+            return path.length === 0 ? path : [null];
+        for (let offset = 0; offset < path.length; offset++) {
+            const key = path[offset];
+            if (key === undefined)
+                break;
+            observer = project(observer, [key]);
+            settle();
+            if ((observer.origins?.size ?? 0) === 0 && offset + 1 < path.length)
+                return [...path.slice(0, offset + 1), null];
+        }
+        return path;
+    };
+};
+const arrayReferencedValues = (node, path) => {
+    const [key, ...remaining] = path;
+    const selected = key ?? null;
+    const selectedIndex = typeof selected === "object" ? null : semanticArrayIndex(selected);
+    if (typeof selected !== "object" && selectedIndex === null)
+        return [];
+    const references = [];
+    let minimumIndex = 0;
+    let uncertainIndex = false;
+    for (const element of node.elements) {
+        if (t.isSpreadElement(element)) {
+            if (selectedIndex === null || selectedIndex >= minimumIndex) {
+                let sourceKey = null;
+                if (!uncertainIndex) {
+                    if (selectedIndex !== null)
+                        sourceKey = selectedIndex - minimumIndex;
+                    else if (selected !== null && typeof selected === "object")
+                        sourceKey = {
+                            excludedKeys: selected.excludedKeys.flatMap((name) => {
+                                const index = semanticArrayIndex(name);
+                                return index === null || index < minimumIndex
+                                    ? []
+                                    : [String(index - minimumIndex)];
+                            }),
+                            startIndex: Math.max(0, (selected.startIndex ?? 0) - minimumIndex),
+                        };
+                }
+                references.push({
+                    node: element.argument,
+                    path: [sourceKey, ...remaining],
+                    iterableFallbackPath: [],
+                });
+            }
+            uncertainIndex = true;
+            continue;
+        }
+        if (element !== null &&
+            (uncertainIndex
+                ? selectedIndex === null || selectedIndex >= minimumIndex
+                : semanticPropertyPathKeyMatches(selected, String(minimumIndex))))
+            references.push({ node: element, path: remaining });
+        minimumIndex++;
+    }
+    return references;
+};
+const copiedReferencePath = (initializer, path, effect) => {
+    const offset = initializer.copyProjectionOffset;
+    if (offset === undefined)
+        return [...initializer.projection, ...path];
+    const copiedPath = [...initializer.projection.slice(offset + 1), ...path];
+    if (effect === "write" && copiedPath.length < 2)
+        return null;
+    let [key, ...remaining] = copiedPath;
+    if (initializer.copyKind === "array-rest") {
+        const startIndex = initializer.copyStartIndex ?? 0;
+        if (key === undefined || key === null)
+            key = { excludedKeys: [], startIndex };
+        else if (typeof key === "object")
+            key = {
+                excludedKeys: key.excludedKeys.flatMap((name) => {
+                    const index = semanticArrayIndex(name);
+                    return index === null ? [] : [String(index + startIndex)];
+                }),
+                startIndex: (key.startIndex ?? 0) + startIndex,
+            };
+        else {
+            const index = semanticArrayIndex(key);
+            if (index === null)
+                return null;
+            key = index + startIndex;
+        }
+    }
+    else {
+        const excludedKeys = initializer.copyExcludedKeys ?? [];
+        if (key === undefined || key === null)
+            key = { excludedKeys };
+        else if (typeof key === "object")
+            key = {
+                ...key,
+                excludedKeys: [...new Set([...key.excludedKeys, ...excludedKeys])].sort(compareUnicodeCodePoints),
+            };
+        else if (excludedKeys.includes(String(key)))
+            return null;
+    }
+    return [...initializer.projection.slice(0, offset), key, ...remaining];
+};
+const selectedReferenceSlot = (source, state, capturePoint) => {
+    const path = [];
+    for (const key of source.projection) {
+        if (key === null || typeof key === "object")
+            return undefined;
+        path.push(String(key));
+    }
+    return semanticSlotAtPath(evaluateSemanticExpression(source.node, state, capturePoint), path);
+};