@astrale-os/kernel-client 0.5.1 → 0.6.0-beta.2

package/dist/store/invalidate.js

@@ -1,117 +0,0 @@
-/**
- * Tier-0 invalidation matching (FRONTEND §5.6 / §5.7).
- *
- * Because the runnable algebra is closed (a single `has_parent` descent + N
- * single-hop gathers), "does patch P affect shape S" is decidable client-side
- * with no kernel change. This module is pure over a {@link ShapeView} — the
- * ShapeStore supplies the view, the overlay/memory apply the matches.
- *
- * SHIM CONTRACT (§5.7): this is a deliberately OVER-BROAD disposable shim, the
- * whole reason SAFE MODE is "slow but never wrong". A false positive costs one
- * needless refetch; a false NEGATIVE is a shape that silently never reconciles —
- * a stale view and hours of debugging, and is FORBIDDEN. So every arm biases to
- * "affected" the instant it is uncertain (an unresolved class, an unknown edge
- * selector, a path form it cannot compare). Do NOT grow this toward faithful
- * query semantics to shave refetches — `function.watch` (§7) deletes it whole,
- * and with it the whole dual-semantics burden.
- */
-/** The set of shape ids a patch affects. */
-export function affectedShapes(patch, shapes, ctx) {
-    const out = new Set();
-    for (const shape of shapes) {
-        if (shapeAffected(shape, patch, ctx))
-            out.add(shape.id);
-    }
-    return out;
-}
-function shapeAffected(shape, patch, ctx) {
-    // node create/delete — ancestor-chain + class-filter test against resolved roots
-    for (const c of patch.nodes.create) {
-        if (matchesNodeStructural(shape, c.at, c.class))
-            return true;
-    }
-    for (const d of patch.nodes.delete) {
-        if (matchesNodeStructural(shape, d.path, d.class))
-            return true;
-        const id = ctx.resolve(d.path);
-        if (id !== undefined && shape.hasNode(id))
-            return true;
-    }
-    // node update — membership (order re-sort is handled by the resulting recompute)
-    for (const u of patch.nodes.update) {
-        const id = ctx.resolve(u.path);
-        if (id !== undefined && shape.hasNode(id))
-            return true;
-    }
-    // edge create/update/delete — gather selector + endpoint-in-roots; has_parent
-    // additionally re-tests subtree membership at the child endpoint
-    for (const e of [...patch.edges.create, ...patch.edges.update, ...patch.edges.delete]) {
-        if (matchesEdge(shape, e.class, e.source, e.target, ctx.hasParentClass))
-            return true;
-    }
-    return false;
-}
-/**
- * A node create/delete at `pRaw` (class `cls`) affects a shape when `pRaw`
- * falls in a root's subtree within `depth` and the move's class filter admits
- * it (the root itself is never class-filtered — it is the seed, not a child).
- */
-export function matchesNodeStructural(shape, pRaw, cls) {
-    for (const root of shape.rootPaths) {
-        const delta = subtreeDelta(root, pRaw);
-        if (delta === null || delta > shape.depth)
-            continue;
-        // Bias to affected (§5.7): the root is never class-filtered, an all-classes
-        // move admits everything, and an UNKNOWN class (`cls === undefined`) is
-        // treated as admitted — a possible false positive (one refetch), never a
-        // false negative (a class we couldn't read silently excluding a real child).
-        const admits = delta === 0 ||
-            shape.moveClasses === undefined ||
-            cls === undefined ||
-            shape.moveClasses.includes(cls);
-        if (admits)
-            return true;
-    }
-    return false;
-}
-/**
- * An edge op affects a shape when some gather selector matches its class and a
- * root is the near endpoint; a `has_parent` edge additionally re-tests subtree
- * membership at its child (source) endpoint.
- */
-export function matchesEdge(shape, edgeClass, sourceRaw, targetRaw, hasParentClass) {
-    if (edgeClass === hasParentClass && matchesNodeStructural(shape, sourceRaw, undefined))
-        return true;
-    for (const g of shape.gathers) {
-        if (g.edgeClasses !== undefined && !g.edgeClasses.includes(edgeClass))
-            continue;
-        if (endpointInRoots(shape.rootPaths, g.dir, sourceRaw, targetRaw))
-            return true;
-    }
-    return false;
-}
-function endpointInRoots(rootPaths, dir, sourceRaw, targetRaw) {
-    const near = dir === 'out' ? [sourceRaw] : dir === 'in' ? [targetRaw] : [sourceRaw, targetRaw];
-    return near.some((p) => rootPaths.includes(p));
-}
-/**
- * Depth of `pRaw` below `rootRaw` in the tree (0 = the root itself), or `null`
- * when `pRaw` is not within the root's subtree. Slug-segment prefix test.
- */
-export function subtreeDelta(rootRaw, pRaw) {
-    if (rootRaw === pRaw)
-        return 0;
-    const rs = segments(rootRaw);
-    const ps = segments(pRaw);
-    if (ps.length <= rs.length)
-        return null;
-    for (let i = 0; i < rs.length; i++) {
-        if (rs[i] !== ps[i])
-            return null;
-    }
-    return ps.length - rs.length;
-}
-function segments(raw) {
-    return raw.split('/').filter((s) => s.length > 0);
-}
-//# sourceMappingURL=invalidate.js.map

package/dist/store/invalidate.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"invalidate.js","sourceRoot":"","sources":["../../src/store/invalidate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAmCH,4CAA4C;AAC5C,MAAM,UAAU,cAAc,CAC5B,KAAkB,EAClB,MAA2B,EAC3B,GAAkB;IAElB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAA;IAC7B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;IACzD,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAS,aAAa,CAAC,KAAgB,EAAE,KAAkB,EAAE,GAAkB;IAC7E,iFAAiF;IACjF,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,qBAAqB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAA;IAC9D,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,qBAAqB,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAA;QAC9D,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAC9B,IAAI,EAAE,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;YAAE,OAAO,IAAI,CAAA;IACxD,CAAC;IACD,iFAAiF;IACjF,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACnC,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAC9B,IAAI,EAAE,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;YAAE,OAAO,IAAI,CAAA;IACxD,CAAC;IACD,8EAA8E;IAC9E,iEAAiE;IACjE,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;QACtF,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,cAAc,CAAC;YAAE,OAAO,IAAI,CAAA;IACtF,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAgB,EAChB,IAAY,EACZ,GAAuB;IAEvB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QACtC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK;YAAE,SAAQ;QACnD,4EAA4E;QAC5E,wEAAwE;QACxE,yEAAyE;QACzE,6EAA6E;QAC7E,MAAM,MAAM,GACV,KAAK,KAAK,CAAC;YACX,KAAK,CAAC,WAAW,KAAK,SAAS;YAC/B,GAAG,KAAK,SAAS;YACjB,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;QACjC,IAAI,MAAM;YAAE,OAAO,IAAI,CAAA;IACzB,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CACzB,KAAgB,EAChB,SAAiB,EACjB,SAAiB,EACjB,SAAiB,EACjB,cAAsB;IAEtB,IAAI,SAAS,KAAK,cAAc,IAAI,qBAAqB,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC;QACpF,OAAO,IAAI,CAAA;IACb,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC;YAAE,SAAQ;QAC/E,IAAI,eAAe,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,EAAE,SAAS,EAAE,SAAS,CAAC;YAAE,OAAO,IAAI,CAAA;IAChF,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,eAAe,CACtB,SAA4B,EAC5B,GAA0B,EAC1B,SAAiB,EACjB,SAAiB;IAEjB,MAAM,IAAI,GAAG,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;IAC9F,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;AAChD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,OAAe,EAAE,IAAY;IACxD,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,CAAC,CAAA;IAC9B,MAAM,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;IAC5B,MAAM,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAA;IACzB,IAAI,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,MAAM;QAAE,OAAO,IAAI,CAAA;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAA;IAClC,CAAC;IACD,OAAO,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,CAAA;AAC9B,CAAC;AAED,SAAS,QAAQ,CAAC,GAAW;IAC3B,OAAO,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AACnD,CAAC"}

package/dist/store/overlay.d.ts

@@ -1,118 +0,0 @@
-/**
- * Optimistic overlay (FRONTEND §5.3 / §5.7).
- *
- * A queue of pending `(patch, mutationId)` units applied over the confirmed
- * EntityStore in order; reads always see confirmed ⊕ overlay.
- *
- * SAFE MODE (§5.7): the overlay is DISPLAY-ONLY. It is never folded into the
- * confirmed store — confirmed state comes only from server responses. The
- * memory holds a unit until the reconciling refetch integrates server truth,
- * then drops it. {@link Overlay.commit} (fold authored patch → confirmed) is
- * therefore OFF the Tier-0 write path; it is retained, signature intact, as the
- * §6.3 entry point where a real server delta (not the authored guess) will feed
- * self-confirmation for free once the wire carries one.
- */
-import type { EdgeKey, GraphEdgeWire, GraphNodeWire, MutationResultWire, PatchInput } from '../graph/index.js';
-type NodeId = GraphNodeWire['id'];
-type EdgeId = GraphEdgeWire['id'];
-type Properties = GraphNodeWire['props'];
-/** The store surface the overlay resolves paths and confirmed records against. */
-export interface ConfirmTarget {
-    resolvePathToId(raw: string): NodeId | undefined;
-    node(id: NodeId): {
-        readonly wire: GraphNodeWire;
-    } | undefined;
-    edge(key: EdgeKey): {
-        readonly wire: GraphEdgeWire;
-    } | undefined;
-    confirmNode(wire: GraphNodeWire, seq: number): void;
-    confirmEdge(wire: GraphEdgeWire, seq: number): void;
-    tombstoneNode(id: NodeId, now: number): void;
-    tombstoneEdge(key: EdgeKey, now: number): void;
-}
-interface NNodeCreate {
-    class: string;
-    at: string;
-    props: Properties;
-}
-interface NNodeUpdate {
-    class: string;
-    path: string;
-    props: Properties;
-}
-interface NNodeDelete {
-    class: string;
-    path: string;
-}
-interface NEdge {
-    class: string;
-    source: string;
-    slug?: string;
-    target: string;
-    props: Properties;
-}
-interface NEdgeDelete {
-    class: string;
-    source: string;
-    slug?: string;
-    target: string;
-}
-export interface NormalPatch {
-    nodes: {
-        create: NNodeCreate[];
-        update: NNodeUpdate[];
-        delete: NNodeDelete[];
-    };
-    edges: {
-        create: NEdge[];
-        update: NEdge[];
-        delete: NEdgeDelete[];
-    };
-}
-/** Normalize a wire {@link PatchInput} to raw strings with all arms present. */
-export declare function normalizePatch(patch: PatchInput): NormalPatch;
-/** A pending optimistic write: its patch, its id, and provisional minted ids. */
-export interface OverlayUnit {
-    readonly mutationId: string;
-    readonly patch: NormalPatch;
-    /** `at` path → client-minted provisional node id (swapped for the real id on commit). */
-    readonly provisionalNodes: ReadonlyMap<string, NodeId>;
-    /** provisional edge id per created edge key. */
-    readonly provisionalEdges: ReadonlyMap<EdgeKey, EdgeId>;
-}
-/** Derived effect of the whole pending queue over a confirmed store. */
-export interface OverlayEffects {
-    readonly nodeCreates: Map<NodeId, GraphNodeWire>;
-    readonly nodeUpdates: Map<NodeId, Properties>;
-    readonly nodeDeletes: Set<NodeId>;
-    readonly edgeCreates: Map<EdgeKey, GraphEdgeWire>;
-    readonly edgeUpdates: Map<EdgeKey, Properties>;
-    readonly edgeDeletes: Set<EdgeKey>;
-    /** `at` path → provisional id, for membership insertion (§5.6 create arm). */
-    readonly createdPaths: Map<string, NodeId>;
-}
-export declare class Overlay {
-    private readonly units;
-    get size(): number;
-    has(mutationId: string): boolean;
-    add(unit: OverlayUnit): void;
-    unit(mutationId: string): OverlayUnit | undefined;
-    /** Drop a unit (rollback, or post-commit removal). */
-    drop(mutationId: string): void;
-    /** Recompute the merged effect of every pending unit against `store`. */
-    effects(store: ConfirmTarget): OverlayEffects;
-    /** The effective node wire for `id`: `null` when overlay-deleted, else confirmed ⊕ overlay. */
-    effectiveNode(id: NodeId, store: ConfirmTarget, eff: OverlayEffects): GraphNodeWire | null;
-    effectiveEdge(key: EdgeKey, store: ConfirmTarget, eff: OverlayEffects): GraphEdgeWire | null;
-    /**
-     * §6.3 future path — NOT called on the Tier-0 write path (SAFE MODE reconciles
-     * from a refetch instead, §5.7). Folds a committed unit's authored patch into
-     * the confirmed store using the mutation's minted ids, then drops it; returns
-     * provisional→minted node id swaps so the ShapeStore can repoint membership.
-     * When `result` carries a real `GraphDeltaWire` (§6.3), this is the seam that
-     * folds SERVER truth — self-confirmation returns for free, correct.
-     */
-    commit(mutationId: string, result: MutationResultWire, store: ConfirmTarget, seq: number, now: number): Map<NodeId, NodeId>;
-}
-export {};
-//# sourceMappingURL=overlay.d.ts.map

package/dist/store/overlay.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"overlay.d.ts","sourceRoot":"","sources":["../../src/store/overlay.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EACV,OAAO,EACP,aAAa,EACb,aAAa,EACb,kBAAkB,EAClB,UAAU,EACX,MAAM,mBAAmB,CAAA;AAI1B,KAAK,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;AACjC,KAAK,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;AACjC,KAAK,UAAU,GAAG,aAAa,CAAC,OAAO,CAAC,CAAA;AAExC,kFAAkF;AAClF,MAAM,WAAW,aAAa;IAC5B,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAA;IAChD,IAAI,CAAC,EAAE,EAAE,MAAM,GAAG;QAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAA;KAAE,GAAG,SAAS,CAAA;IAC9D,IAAI,CAAC,GAAG,EAAE,OAAO,GAAG;QAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAA;KAAE,GAAG,SAAS,CAAA;IAChE,WAAW,CAAC,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAAA;IACnD,WAAW,CAAC,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAAA;IACnD,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAAA;IAC5C,aAAa,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAAA;CAC/C;AAID,UAAU,WAAW;IACnB,KAAK,EAAE,MAAM,CAAA;IACb,EAAE,EAAE,MAAM,CAAA;IACV,KAAK,EAAE,UAAU,CAAA;CAClB;AACD,UAAU,WAAW;IACnB,KAAK,EAAE,MAAM,CAAA;IACb,IAAI,EAAE,MAAM,CAAA;IACZ,KAAK,EAAE,UAAU,CAAA;CAClB;AACD,UAAU,WAAW;IACnB,KAAK,EAAE,MAAM,CAAA;IACb,IAAI,EAAE,MAAM,CAAA;CACb;AACD,UAAU,KAAK;IACb,KAAK,EAAE,MAAM,CAAA;IACb,MAAM,EAAE,MAAM,CAAA;IACd,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,MAAM,EAAE,MAAM,CAAA;IACd,KAAK,EAAE,UAAU,CAAA;CAClB;AACD,UAAU,WAAW;IACnB,KAAK,EAAE,MAAM,CAAA;IACb,MAAM,EAAE,MAAM,CAAA;IACd,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,MAAM,EAAE,MAAM,CAAA;CACf;AACD,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE;QAAE,MAAM,EAAE,WAAW,EAAE,CAAC;QAAC,MAAM,EAAE,WAAW,EAAE,CAAC;QAAC,MAAM,EAAE,WAAW,EAAE,CAAA;KAAE,CAAA;IAC9E,KAAK,EAAE;QAAE,MAAM,EAAE,KAAK,EAAE,CAAC;QAAC,MAAM,EAAE,KAAK,EAAE,CAAC;QAAC,MAAM,EAAE,WAAW,EAAE,CAAA;KAAE,CAAA;CACnE;AAED,gFAAgF;AAChF,wBAAgB,cAAc,CAAC,KAAK,EAAE,UAAU,GAAG,WAAW,CAuB7D;AAkCD,iFAAiF;AACjF,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAA;IAC3B,yFAAyF;IACzF,QAAQ,CAAC,gBAAgB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACtD,gDAAgD;IAChD,QAAQ,CAAC,gBAAgB,EAAE,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAA;CACxD;AAED,wEAAwE;AACxE,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAA;IAChD,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;IAC7C,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACjC,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC,CAAA;IACjD,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAA;IAC9C,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,OAAO,CAAC,CAAA;IAClC,8EAA8E;IAC9E,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAC3C;AAED,qBAAa,OAAO;IAClB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAoB;IAE1C,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,GAAG,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAE/B;IAED,GAAG,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI,CAE3B;IAED,IAAI,CAAC,UAAU,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS,CAEhD;IAED,sDAAsD;IACtD,IAAI,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAG7B;IAID,yEAAyE;IACzE,OAAO,CAAC,KAAK,EAAE,aAAa,GAAG,cAAc,CA2D5C;IAED,+FAA+F;IAC/F,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,EAAE,cAAc,GAAG,aAAa,GAAG,IAAI,CAQzF;IAED,aAAa,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,EAAE,cAAc,GAAG,aAAa,GAAG,IAAI,CAQ3F;IAID;;;;;;;OAOG;IACH,MAAM,CACJ,UAAU,EAAE,MAAM,EAClB,MAAM,EAAE,kBAAkB,EAC1B,KAAK,EAAE,aAAa,EACpB,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,GACV,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAsCrB;CACF"}

package/dist/store/overlay.js

@@ -1,237 +0,0 @@
-/**
- * Optimistic overlay (FRONTEND §5.3 / §5.7).
- *
- * A queue of pending `(patch, mutationId)` units applied over the confirmed
- * EntityStore in order; reads always see confirmed ⊕ overlay.
- *
- * SAFE MODE (§5.7): the overlay is DISPLAY-ONLY. It is never folded into the
- * confirmed store — confirmed state comes only from server responses. The
- * memory holds a unit until the reconciling refetch integrates server truth,
- * then drops it. {@link Overlay.commit} (fold authored patch → confirmed) is
- * therefore OFF the Tier-0 write path; it is retained, signature intact, as the
- * §6.3 entry point where a real server delta (not the authored guess) will feed
- * self-confirmation for free once the wire carries one.
- */
-import { edgeKey, rawOf } from '../graph/index.js';
-/** Normalize a wire {@link PatchInput} to raw strings with all arms present. */
-export function normalizePatch(patch) {
-    const n = patch.nodes ?? {};
-    const e = patch.edges ?? {};
-    return {
-        nodes: {
-            create: (n.create ?? []).map((c) => ({
-                class: rawOf(c.class),
-                at: rawOf(c.at),
-                props: { ...c.props },
-            })),
-            update: (n.update ?? []).map((u) => ({
-                class: rawOf(u.class),
-                path: rawOf(u.path),
-                props: { ...u.props },
-            })),
-            delete: (n.delete ?? []).map((d) => ({ class: rawOf(d.class), path: rawOf(d.path) })),
-        },
-        edges: {
-            create: (e.create ?? []).map(normEdge),
-            update: (e.update ?? []).map(normEdge),
-            delete: (e.delete ?? []).map(normEdgeDelete),
-        },
-    };
-}
-function normEdge(e) {
-    return {
-        class: rawOf(e.class),
-        source: rawOf(e.source),
-        ...(e.slug !== undefined ? { slug: e.slug } : {}),
-        target: rawOf(e.target),
-        props: { ...e.props },
-    };
-}
-function normEdgeDelete(e) {
-    return {
-        class: rawOf(e.class),
-        source: rawOf(e.source),
-        ...(e.slug !== undefined ? { slug: e.slug } : {}),
-        target: rawOf(e.target),
-    };
-}
-export class Overlay {
-    units = [];
-    get size() {
-        return this.units.length;
-    }
-    has(mutationId) {
-        return this.units.some((u) => u.mutationId === mutationId);
-    }
-    add(unit) {
-        this.units.push(unit);
-    }
-    unit(mutationId) {
-        return this.units.find((u) => u.mutationId === mutationId);
-    }
-    /** Drop a unit (rollback, or post-commit removal). */
-    drop(mutationId) {
-        const i = this.units.findIndex((u) => u.mutationId === mutationId);
-        if (i >= 0)
-            this.units.splice(i, 1);
-    }
-    // ── Effective reads (confirmed ⊕ overlay) ──────────────────────────────────
-    /** Recompute the merged effect of every pending unit against `store`. */
-    effects(store) {
-        const eff = {
-            nodeCreates: new Map(),
-            nodeUpdates: new Map(),
-            nodeDeletes: new Set(),
-            edgeCreates: new Map(),
-            edgeUpdates: new Map(),
-            edgeDeletes: new Set(),
-            createdPaths: new Map(),
-        };
-        const resolve = (path) => eff.createdPaths.get(path) ?? store.resolvePathToId(path);
-        for (const unit of this.units) {
-            for (const c of unit.patch.nodes.create) {
-                const id = unit.provisionalNodes.get(c.at);
-                if (id === undefined)
-                    continue;
-                eff.nodeCreates.set(id, { id, class: c.class, path: c.at, props: { ...c.props } });
-                eff.createdPaths.set(c.at, id);
-                eff.nodeDeletes.delete(id);
-            }
-            for (const u of unit.patch.nodes.update) {
-                const id = resolve(u.path);
-                if (id === undefined)
-                    continue;
-                const created = eff.nodeCreates.get(id);
-                if (created) {
-                    eff.nodeCreates.set(id, { ...created, props: { ...created.props, ...u.props } });
-                }
-                else {
-                    eff.nodeUpdates.set(id, { ...eff.nodeUpdates.get(id), ...u.props });
-                }
-            }
-            for (const d of unit.patch.nodes.delete) {
-                const id = resolve(d.path);
-                if (id === undefined)
-                    continue;
-                eff.nodeDeletes.add(id);
-                eff.nodeCreates.delete(id);
-                eff.nodeUpdates.delete(id);
-            }
-            for (const c of unit.patch.edges.create) {
-                const key = edgeKey(c);
-                const id = unit.provisionalEdges.get(key) ?? `optimistic-edge:${key}`;
-                eff.edgeCreates.set(key, synthEdge(id, c));
-                eff.edgeDeletes.delete(key);
-            }
-            for (const u of unit.patch.edges.update) {
-                const key = edgeKey(u);
-                const created = eff.edgeCreates.get(key);
-                if (created)
-                    eff.edgeCreates.set(key, { ...created, props: { ...created.props, ...u.props } });
-                else
-                    eff.edgeUpdates.set(key, { ...eff.edgeUpdates.get(key), ...u.props });
-            }
-            for (const d of unit.patch.edges.delete) {
-                const key = edgeKey(d);
-                eff.edgeDeletes.add(key);
-                eff.edgeCreates.delete(key);
-                eff.edgeUpdates.delete(key);
-            }
-        }
-        return eff;
-    }
-    /** The effective node wire for `id`: `null` when overlay-deleted, else confirmed ⊕ overlay. */
-    effectiveNode(id, store, eff) {
-        if (eff.nodeDeletes.has(id))
-            return null;
-        const created = eff.nodeCreates.get(id);
-        if (created)
-            return created;
-        const base = store.node(id)?.wire;
-        if (base === undefined)
-            return null;
-        const patch = eff.nodeUpdates.get(id);
-        return patch ? { ...base, props: { ...base.props, ...patch } } : base;
-    }
-    effectiveEdge(key, store, eff) {
-        if (eff.edgeDeletes.has(key))
-            return null;
-        const created = eff.edgeCreates.get(key);
-        if (created)
-            return created;
-        const base = store.edge(key)?.wire;
-        if (base === undefined)
-            return null;
-        const patch = eff.edgeUpdates.get(key);
-        return patch ? { ...base, props: { ...base.props, ...patch } } : base;
-    }
-    // ── Commit (fold authored patch into confirmed) ────────────────────────────
-    /**
-     * §6.3 future path — NOT called on the Tier-0 write path (SAFE MODE reconciles
-     * from a refetch instead, §5.7). Folds a committed unit's authored patch into
-     * the confirmed store using the mutation's minted ids, then drops it; returns
-     * provisional→minted node id swaps so the ShapeStore can repoint membership.
-     * When `result` carries a real `GraphDeltaWire` (§6.3), this is the seam that
-     * folds SERVER truth — self-confirmation returns for free, correct.
-     */
-    commit(mutationId, result, store, seq, now) {
-        const unit = this.unit(mutationId);
-        const swaps = new Map();
-        if (unit === undefined)
-            return swaps;
-        for (const c of unit.patch.nodes.create) {
-            const minted = result.createdNodes[c.at];
-            if (minted === undefined)
-                continue;
-            const provisional = unit.provisionalNodes.get(c.at);
-            if (provisional !== undefined)
-                swaps.set(provisional, minted);
-            store.confirmNode({ id: minted, class: c.class, path: c.at, props: { ...c.props } }, seq);
-        }
-        for (const u of unit.patch.nodes.update) {
-            const id = store.resolvePathToId(u.path);
-            const base = id !== undefined ? store.node(id)?.wire : undefined;
-            if (base !== undefined)
-                store.confirmNode({ ...base, props: { ...base.props, ...u.props } }, seq);
-        }
-        for (const d of unit.patch.nodes.delete) {
-            const id = store.resolvePathToId(d.path);
-            if (id !== undefined)
-                store.tombstoneNode(id, now);
-        }
-        for (const c of unit.patch.edges.create) {
-            const key = edgeKey(c);
-            const minted = result.createdEdges[key] ?? soleValue(result.createdEdges);
-            if (minted !== undefined)
-                store.confirmEdge(synthEdge(minted, c), seq);
-        }
-        for (const u of unit.patch.edges.update) {
-            const key = edgeKey(u);
-            const base = store.edge(key)?.wire;
-            if (base !== undefined)
-                store.confirmEdge({ ...base, props: { ...base.props, ...u.props } }, seq);
-        }
-        for (const d of unit.patch.edges.delete) {
-            store.tombstoneEdge(edgeKey(d), now);
-        }
-        this.drop(mutationId);
-        return swaps;
-    }
-}
-// ── helpers ──────────────────────────────────────────────────────────────────
-function synthEdge(id, e) {
-    return {
-        id,
-        class: e.class,
-        source: e.source,
-        target: e.target,
-        ...(e.slug !== undefined ? { slug: e.slug } : {}),
-        props: { ...e.props },
-    };
-}
-/** When the mint map has exactly one entry, key normalization is unambiguous. */
-function soleValue(map) {
-    const values = Object.values(map);
-    return values.length === 1 ? values[0] : undefined;
-}
-//# sourceMappingURL=overlay.js.map

package/dist/store/overlay.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"overlay.js","sourceRoot":"","sources":["../../src/store/overlay.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAUH,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAA;AAmDlD,gFAAgF;AAChF,MAAM,UAAU,cAAc,CAAC,KAAiB;IAC9C,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,IAAI,EAAE,CAAA;IAC3B,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,IAAI,EAAE,CAAA;IAC3B,OAAO;QACL,KAAK,EAAE;YACL,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACnC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;gBACrB,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACf,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE;aACtB,CAAC,CAAC;YACH,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACnC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;gBACrB,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;gBACnB,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE;aACtB,CAAC,CAAC;YACH,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACtF;QACD,KAAK,EAAE;YACL,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC;YACtC,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC;YACtC,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,cAAc,CAAC;SAC7C;KACF,CAAA;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,CAMjB;IACC,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAc,CAAC;QAC9B,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,MAAe,CAAC;QAChC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,MAAe,CAAC;QAChC,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE;KACtB,CAAA;AACH,CAAC;AAED,SAAS,cAAc,CAAC,CAKvB;IACC,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAc,CAAC;QAC9B,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,MAAe,CAAC;QAChC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,MAAe,CAAC;KACjC,CAAA;AACH,CAAC;AA0BD,MAAM,OAAO,OAAO;IACD,KAAK,GAAkB,EAAE,CAAA;IAE1C,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAA;IAC1B,CAAC;IAED,GAAG,CAAC,UAAkB;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,UAAU,CAAC,CAAA;IAC5D,CAAC;IAED,GAAG,CAAC,IAAiB;QACnB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACvB,CAAC;IAED,IAAI,CAAC,UAAkB;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,UAAU,CAAC,CAAA;IAC5D,CAAC;IAED,sDAAsD;IACtD,IAAI,CAAC,UAAkB;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,UAAU,CAAC,CAAA;QAClE,IAAI,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACrC,CAAC;IAED,8EAA8E;IAE9E,yEAAyE;IACzE,OAAO,CAAC,KAAoB;QAC1B,MAAM,GAAG,GAAmB;YAC1B,WAAW,EAAE,IAAI,GAAG,EAAE;YACtB,WAAW,EAAE,IAAI,GAAG,EAAE;YACtB,WAAW,EAAE,IAAI,GAAG,EAAE;YACtB,WAAW,EAAE,IAAI,GAAG,EAAE;YACtB,WAAW,EAAE,IAAI,GAAG,EAAE;YACtB,WAAW,EAAE,IAAI,GAAG,EAAE;YACtB,YAAY,EAAE,IAAI,GAAG,EAAE;SACxB,CAAA;QACD,MAAM,OAAO,GAAG,CAAC,IAAY,EAAsB,EAAE,CACnD,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAAA;QAE3D,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBACxC,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gBAC1C,IAAI,EAAE,KAAK,SAAS;oBAAE,SAAQ;gBAC9B,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;gBAClF,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;gBAC9B,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YAC5B,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBACxC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;gBAC1B,IAAI,EAAE,KAAK,SAAS;oBAAE,SAAQ;gBAC9B,MAAM,OAAO,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBACvC,IAAI,OAAO,EAAE,CAAC;oBACZ,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE,GAAG,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;gBAClF,CAAC;qBAAM,CAAC;oBACN,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAA;gBACrE,CAAC;YACH,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBACxC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;gBAC1B,IAAI,EAAE,KAAK,SAAS;oBAAE,SAAQ;gBAC9B,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBACvB,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;gBAC1B,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YAC5B,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBACxC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;gBACtB,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAK,mBAAmB,GAAG,EAAa,CAAA;gBACjF,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;gBAC1C,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAC7B,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBACxC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;gBACtB,MAAM,OAAO,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACxC,IAAI,OAAO;oBACT,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE,GAAG,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;;oBAC9E,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAA;YAC5E,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBACxC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;gBACtB,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACxB,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;gBAC3B,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAC7B,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,+FAA+F;IAC/F,aAAa,CAAC,EAAU,EAAE,KAAoB,EAAE,GAAmB;QACjE,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,IAAI,CAAA;QACxC,MAAM,OAAO,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACvC,IAAI,OAAO;YAAE,OAAO,OAAO,CAAA;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAA;QACjC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAA;QACnC,MAAM,KAAK,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACrC,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAA;IACvE,CAAC;IAED,aAAa,CAAC,GAAY,EAAE,KAAoB,EAAE,GAAmB;QACnE,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAA;QACzC,MAAM,OAAO,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACxC,IAAI,OAAO;YAAE,OAAO,OAAO,CAAA;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAA;QAClC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAA;QACnC,MAAM,KAAK,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACtC,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAA;IACvE,CAAC;IAED,8EAA8E;IAE9E;;;;;;;OAOG;IACH,MAAM,CACJ,UAAkB,EAClB,MAA0B,EAC1B,KAAoB,EACpB,GAAW,EACX,GAAW;QAEX,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;QAClC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAA;QACvC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,CAAA;QAEpC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;YACxC,IAAI,MAAM,KAAK,SAAS;gBAAE,SAAQ;YAClC,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;YACnD,IAAI,WAAW,KAAK,SAAS;gBAAE,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAA;YAC7D,KAAK,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,CAAA;QAC3F,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACxC,MAAM,EAAE,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YACxC,MAAM,IAAI,GAAG,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,SAAS,CAAA;YAChE,IAAI,IAAI,KAAK,SAAS;gBACpB,KAAK,CAAC,WAAW,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,CAAA;QAC7E,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACxC,MAAM,EAAE,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YACxC,IAAI,EAAE,KAAK,SAAS;gBAAE,KAAK,CAAC,aAAa,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;QACpD,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACxC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;YACtB,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,CAAC,YAAY,CAAC,CAAA;YACzE,IAAI,MAAM,KAAK,SAAS;gBAAE,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;QACxE,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACxC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;YACtB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAA;YAClC,IAAI,IAAI,KAAK,SAAS;gBACpB,KAAK,CAAC,WAAW,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,CAAA;QAC7E,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACxC,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;QACtC,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;QACrB,OAAO,KAAK,CAAA;IACd,CAAC;CACF;AAED,gFAAgF;AAEhF,SAAS,SAAS,CAAC,EAAU,EAAE,CAAQ;IACrC,OAAO;QACL,EAAE;QACF,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE;KACL,CAAA;AACpB,CAAC;AAED,iFAAiF;AACjF,SAAS,SAAS,CAAC,GAA2B;IAC5C,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IACjC,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;AACpD,CAAC"}

package/dist/store/schedule.d.ts

@@ -1,31 +0,0 @@
-/**
- * Post-mutation revalidation coalescing (FRONTEND §5.7 — operational).
- *
- * SAFE MODE reconciles every write by refetching the shapes it touched. A burst
- * of writes (or straddle-restales) in one tick would otherwise fire one fetch
- * per (write × shape); this queue coalesces them to the next microtask, deduped
- * per key (latest task wins), and drains under a small concurrency cap so a wide
- * fan-out never opens an unbounded number of sockets. `request` resolves when
- * that key's next drained task settles — the memory awaits it to know when a
- * held display overlay may drop (the reconciling refetch has landed).
- */
-/** Coalesce per-key async tasks to the next microtask with a concurrency cap. */
-export declare class TaskQueue<K> {
-    private readonly cap;
-    private readonly schedule;
-    private readonly tasks;
-    private readonly waiters;
-    private inflight;
-    private flushScheduled;
-    /**
-     * @param cap max tasks in flight at once.
-     * @param schedule defers the drain — `queueMicrotask` in prod, an injectable
-     *   step in tests for deterministic interleavings.
-     */
-    constructor(cap: number, schedule?: (fn: () => void) => void);
-    /** Enqueue (or replace) `key`'s task; resolves when its next drain settles. */
-    request(key: K, task: () => Promise<void>): Promise<void>;
-    private ensureFlush;
-    private pump;
-}
-//# sourceMappingURL=schedule.d.ts.map

package/dist/store/schedule.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"schedule.d.ts","sourceRoot":"","sources":["../../src/store/schedule.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAeH,iFAAiF;AACjF,qBAAa,SAAS,CAAC,CAAC;IAYpB,OAAO,CAAC,QAAQ,CAAC,GAAG;IACpB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAZ3B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAoC;IAC1D,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAyB;IACjD,OAAO,CAAC,QAAQ,CAAI;IACpB,OAAO,CAAC,cAAc,CAAQ;IAE9B;;;;OAIG;IACH,YACmB,GAAG,EAAE,MAAM,EACX,QAAQ,GAAE,CAAC,EAAE,EAAE,MAAM,IAAI,KAAK,IAAqB,EAClE;IAEJ,+EAA+E;IAC/E,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CASxD;IAED,OAAO,CAAC,WAAW;IAMnB,OAAO,CAAC,IAAI;CAuBb"}

package/dist/store/schedule.js

@@ -1,76 +0,0 @@
-/**
- * Post-mutation revalidation coalescing (FRONTEND §5.7 — operational).
- *
- * SAFE MODE reconciles every write by refetching the shapes it touched. A burst
- * of writes (or straddle-restales) in one tick would otherwise fire one fetch
- * per (write × shape); this queue coalesces them to the next microtask, deduped
- * per key (latest task wins), and drains under a small concurrency cap so a wide
- * fan-out never opens an unbounded number of sockets. `request` resolves when
- * that key's next drained task settles — the memory awaits it to know when a
- * held display overlay may drop (the reconciling refetch has landed).
- */
-function deferred() {
-    let resolve;
-    const promise = new Promise((r) => {
-        resolve = r;
-    });
-    return { promise, resolve };
-}
-/** Coalesce per-key async tasks to the next microtask with a concurrency cap. */
-export class TaskQueue {
-    cap;
-    schedule;
-    tasks = new Map();
-    waiters = new Map();
-    inflight = 0;
-    flushScheduled = false;
-    /**
-     * @param cap max tasks in flight at once.
-     * @param schedule defers the drain — `queueMicrotask` in prod, an injectable
-     *   step in tests for deterministic interleavings.
-     */
-    constructor(cap, schedule = queueMicrotask) {
-        this.cap = cap;
-        this.schedule = schedule;
-    }
-    /** Enqueue (or replace) `key`'s task; resolves when its next drain settles. */
-    request(key, task) {
-        this.tasks.set(key, task); // latest task for a key wins — no stale duplicate fetch
-        let w = this.waiters.get(key);
-        if (w === undefined) {
-            w = deferred();
-            this.waiters.set(key, w);
-        }
-        this.ensureFlush();
-        return w.promise;
-    }
-    ensureFlush() {
-        if (this.flushScheduled)
-            return;
-        this.flushScheduled = true;
-        this.schedule(() => this.pump());
-    }
-    pump() {
-        this.flushScheduled = false;
-        while (this.inflight < this.cap && this.tasks.size > 0) {
-            const first = this.tasks.entries().next();
-            if (first.done === true)
-                break;
-            const [key, task] = first.value;
-            this.tasks.delete(key);
-            const w = this.waiters.get(key);
-            this.waiters.delete(key);
-            this.inflight++;
-            void task()
-                .then(() => { }, () => { })
-                .finally(() => {
-                this.inflight--;
-                w?.resolve();
-                if (this.tasks.size > 0)
-                    this.ensureFlush();
-            });
-        }
-        // Cap hit with tasks remaining → a running task's `finally` reschedules.
-    }
-}
-//# sourceMappingURL=schedule.js.map

package/dist/store/schedule.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"schedule.js","sourceRoot":"","sources":["../../src/store/schedule.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAOH,SAAS,QAAQ;IACf,IAAI,OAAoB,CAAA;IACxB,MAAM,OAAO,GAAG,IAAI,OAAO,CAAO,CAAC,CAAC,EAAE,EAAE;QACtC,OAAO,GAAG,CAAC,CAAA;IACb,CAAC,CAAC,CAAA;IACF,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAA;AAC7B,CAAC;AAED,iFAAiF;AACjF,MAAM,OAAO,SAAS;IAYD,GAAG;IACH,QAAQ;IAZV,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAA;IACzC,OAAO,GAAG,IAAI,GAAG,EAAe,CAAA;IACzC,QAAQ,GAAG,CAAC,CAAA;IACZ,cAAc,GAAG,KAAK,CAAA;IAE9B;;;;OAIG;IACH,YACmB,GAAW,EACX,QAAQ,GAA6B,cAAc;mBADnD,GAAG;wBACH,QAAQ;IACxB,CAAC;IAEJ,+EAA+E;IAC/E,OAAO,CAAC,GAAM,EAAE,IAAyB;QACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA,CAAC,wDAAwD;QAClF,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC7B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,CAAC,GAAG,QAAQ,EAAE,CAAA;YACd,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QAC1B,CAAC;QACD,IAAI,CAAC,WAAW,EAAE,CAAA;QAClB,OAAO,CAAC,CAAC,OAAO,CAAA;IAClB,CAAC;IAEO,WAAW;QACjB,IAAI,IAAI,CAAC,cAAc;YAAE,OAAM;QAC/B,IAAI,CAAC,cAAc,GAAG,IAAI,CAAA;QAC1B,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;IAClC,CAAC;IAEO,IAAI;QACV,IAAI,CAAC,cAAc,GAAG,KAAK,CAAA;QAC3B,OAAO,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACvD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAA;YACzC,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI;gBAAE,MAAK;YAC9B,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAA;YAC/B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACtB,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC/B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACxB,IAAI,CAAC,QAAQ,EAAE,CAAA;YACf,KAAK,IAAI,EAAE;iBACR,IAAI,CACH,GAAG,EAAE,GAAE,CAAC,EACR,GAAG,EAAE,GAAE,CAAC,CACT;iBACA,OAAO,CAAC,GAAG,EAAE;gBACZ,IAAI,CAAC,QAAQ,EAAE,CAAA;gBACf,CAAC,EAAE,OAAO,EAAE,CAAA;gBACZ,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC;oBAAE,IAAI,CAAC,WAAW,EAAE,CAAA;YAC7C,CAAC,CAAC,CAAA;QACN,CAAC;QACD,yEAAyE;IAC3E,CAAC;CACF"}