@astrale-os/kernel-client 0.5.0 → 0.6.0-beta.1

package/dist/store/shapes.d.ts

@@ -1,92 +0,0 @@
-/**
- * ShapeStore (FRONTEND §5.2) + shape materialization.
- *
- * Each entry is keyed by `(scope, shapeKey)` and holds resolved roots, ordered
- * membership (node ids / edge keys), the cursor window (the existing next()
- * fold), a staleness flag, an in-flight dedupe handle, observer count and GC
- * state. `materialize` derives a `Graph` view over the confirmed store ⊕
- * overlay; ordering under `order:` is computed from current props (so an
- * update re-sorts) — approximate per gather until the selections sidecar (§6.4).
- */
-import type { EdgeKey, GraphNodeWire, GetResultWire, QueryASTInput } from '../graph/index.js';
-import type { EntityStore } from './entities.js';
-import type { ShapeView } from './invalidate.js';
-import type { Overlay } from './overlay.js';
-import type { LiveResult, MaterializedShape, ShapeMeta } from './types.js';
-type NodeId = GraphNodeWire['id'];
-/** A standing shape (cache/liveness/invalidation unit). */
-export interface ShapeEntry {
-    key: string;
-    readonly scope: string;
-    readonly baseAst: QueryASTInput;
-    readonly meta: ShapeMeta;
-    /** Raw root addresses as written in the AST (provisional-form identity). */
-    readonly inputRootPaths: string[];
-    /** Window growth policy. */
-    window: 'append' | 'paged';
-    resolvedRoots: NodeId[];
-    nodeMembers: NodeId[];
-    memberSet: Set<NodeId>;
-    edgeKeys: EdgeKey[];
-    edgeKeySet: Set<EdgeKey>;
-    next: GetResultWire['next'];
-    contAst: QueryASTInput | null;
-    exhausted: boolean;
-    /**
-     * Pages accumulated in the current window (1 after the first evaluation, +1
-     * per `append` continuation). A window-preserving reconcile (§5.7) re-requests
-     * `baseLimit × windowPages` so an 'append' window never collapses to page 1.
-     */
-    windowPages: number;
-    hasData: boolean;
-    stale: boolean;
-    seq: number;
-    error: unknown;
-    inflight: Promise<GetResultWire> | null;
-    observers: number;
-    releasedAt: number | null;
-    /** Snapshot cache (rebuilt only when `dirty`), for referential stability. */
-    dirty: boolean;
-    result: LiveResult | null;
-    listeners: Set<() => void>;
-}
-export declare class ShapeStore {
-    private readonly entries;
-    /** Provisional (raw-root) key → resolved (re-anchored) key. */
-    private readonly aliases;
-    /** Follow provisional→resolved aliasing to the canonical key. */
-    canonical(key: string): string;
-    get(key: string): ShapeEntry | undefined;
-    all(): Iterable<ShapeEntry>;
-    ensure(key: string, scope: string, ast: QueryASTInput, inputRootPaths: string[]): ShapeEntry;
-    /**
-     * Re-home an entry under its resolved key once roots resolve (§5.4 step 3),
-     * and return the surviving entry. When another entry already lives at the
-     * resolved key (two provisional roots collapsing onto one — a concurrent /
-     * StrictMode cold mount), the incoming `entry` is MERGED into the existing
-     * one rather than clobbering it, so neither entry's subscribers or membership
-     * are orphaned. Callers must continue with the returned entry; subscription
-     * closures re-resolve their entry through {@link get} (which follows the
-     * provisional→resolved alias), so a merge does not strand their listeners.
-     */
-    rehome(entry: ShapeEntry, resolvedKey: string): ShapeEntry;
-    delete(entry: ShapeEntry): void;
-    /** Union of every retained shape's members + roots — the GC reachability set. */
-    reachable(): {
-        nodes: Set<NodeId>;
-        edges: Set<EdgeKey>;
-    };
-}
-/**
- * Fold a page into a shape's membership. `replace` resets the window (a fresh
- * evaluation), `append` accumulates (a `more.load` continuation).
- */
-export declare function integrateShape(entry: ShapeEntry, wire: GetResultWire, seq: number, mode: 'replace' | 'append'): void;
-/** Derive a shape's structural metadata from its canonical AST (once, on ensure). */
-export declare function deriveMeta(ast: QueryASTInput): ShapeMeta;
-/** Adapt an entry to the {@link ShapeView} the invalidation matcher consumes. */
-export declare function shapeViewOf(entry: ShapeEntry, store: EntityStore): ShapeView;
-/** Build the derived `Graph` view of a shape over the confirmed store ⊕ overlay. */
-export declare function materialize(entry: ShapeEntry, store: EntityStore, overlay: Overlay): MaterializedShape;
-export {};
-//# sourceMappingURL=shapes.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"shapes.d.ts","sourceRoot":"","sources":["../../src/store/shapes.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAMH,OAAO,KAAK,EACV,OAAO,EACP,aAAa,EACb,aAAa,EAEb,aAAa,EACd,MAAM,mBAAmB,CAAA;AAC1B,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,eAAe,CAAA;AAChD,OAAO,KAAK,EAAc,SAAS,EAAE,MAAM,iBAAiB,CAAA;AAC5D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAC3C,OAAO,KAAK,EAAc,UAAU,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,YAAY,CAAA;AAMtF,KAAK,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;AAEjC,2DAA2D;AAC3D,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,MAAM,CAAA;IACX,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAA;IAC/B,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;IACxB,4EAA4E;IAC5E,QAAQ,CAAC,cAAc,EAAE,MAAM,EAAE,CAAA;IACjC,4BAA4B;IAC5B,MAAM,EAAE,QAAQ,GAAG,OAAO,CAAA;IAE1B,aAAa,EAAE,MAAM,EAAE,CAAA;IACvB,WAAW,EAAE,MAAM,EAAE,CAAA;IACrB,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACtB,QAAQ,EAAE,OAAO,EAAE,CAAA;IACnB,UAAU,EAAE,GAAG,CAAC,OAAO,CAAC,CAAA;IAExB,IAAI,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IAC3B,OAAO,EAAE,aAAa,GAAG,IAAI,CAAA;IAC7B,SAAS,EAAE,OAAO,CAAA;IAClB;;;;OAIG;IACH,WAAW,EAAE,MAAM,CAAA;IAEnB,OAAO,EAAE,OAAO,CAAA;IAChB,KAAK,EAAE,OAAO,CAAA;IACd,GAAG,EAAE,MAAM,CAAA;IACX,KAAK,EAAE,OAAO,CAAA;IACd,QAAQ,EAAE,OAAO,CAAC,aAAa,CAAC,GAAG,IAAI,CAAA;IAEvC,SAAS,EAAE,MAAM,CAAA;IACjB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAA;IAEzB,6EAA6E;IAC7E,KAAK,EAAE,OAAO,CAAA;IACd,MAAM,EAAE,UAAU,GAAG,IAAI,CAAA;IACzB,SAAS,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC,CAAA;CAC3B;AAED,qBAAa,UAAU;IACrB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAgC;IACxD,+DAA+D;IAC/D,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA4B;IAEpD,iEAAiE;IACjE,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAE7B;IAED,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS,CAEvC;IAED,GAAG,IAAI,QAAQ,CAAC,UAAU,CAAC,CAE1B;IAED,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,UAAU,CAiC3F;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,GAAG,UAAU,CAczD;IAED,MAAM,CAAC,KAAK,EAAE,UAAU,GAAG,IAAI,CAE9B;IAED,iFAAiF;IACjF,SAAS,IAAI;QAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QAAC,KAAK,EAAE,GAAG,CAAC,OAAO,CAAC,CAAA;KAAE,CASvD;CACF;AAyCD;;;GAGG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,UAAU,EACjB,IAAI,EAAE,aAAa,EACnB,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,SAAS,GAAG,QAAQ,GACzB,IAAI,CAgCN;AAeD,qFAAqF;AACrF,wBAAgB,UAAU,CAAC,GAAG,EAAE,aAAa,GAAG,SAAS,CAsBxD;AAoBD,iFAAiF;AACjF,wBAAgB,WAAW,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,GAAG,SAAS,CAiB5E;AAID,oFAAoF;AACpF,wBAAgB,WAAW,CACzB,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,WAAW,EAClB,OAAO,EAAE,OAAO,GACf,iBAAiB,CA0CnB"}

package/dist/store/shapes.js

@@ -1,369 +0,0 @@
-/**
- * ShapeStore (FRONTEND §5.2) + shape materialization.
- *
- * Each entry is keyed by `(scope, shapeKey)` and holds resolved roots, ordered
- * membership (node ids / edge keys), the cursor window (the existing next()
- * fold), a staleness flag, an in-flight dedupe handle, observer count and GC
- * state. `materialize` derives a `Graph` view over the confirmed store ⊕
- * overlay; ordering under `order:` is computed from current props (so an
- * update re-sorts) — approximate per gather until the selections sidecar (§6.4).
- */
-import { Graph } from '@astrale-os/kernel-core';
-import { edgeKey, nextQuery } from '../graph/index.js';
-import { resolveEdgeMatch } from '../graph/query/edge-ref.js';
-import { subtreeDelta } from './invalidate.js';
-export class ShapeStore {
-    entries = new Map();
-    /** Provisional (raw-root) key → resolved (re-anchored) key. */
-    aliases = new Map();
-    /** Follow provisional→resolved aliasing to the canonical key. */
-    canonical(key) {
-        return this.aliases.get(key) ?? key;
-    }
-    get(key) {
-        return this.entries.get(this.canonical(key));
-    }
-    all() {
-        return this.entries.values();
-    }
-    ensure(key, scope, ast, inputRootPaths) {
-        const canon = this.canonical(key);
-        const existing = this.entries.get(canon);
-        if (existing)
-            return existing;
-        const entry = {
-            key: canon,
-            scope,
-            baseAst: ast,
-            meta: deriveMeta(ast),
-            inputRootPaths,
-            window: 'append',
-            resolvedRoots: [],
-            nodeMembers: [],
-            memberSet: new Set(),
-            edgeKeys: [],
-            edgeKeySet: new Set(),
-            next: undefined,
-            contAst: null,
-            exhausted: false,
-            windowPages: 1,
-            hasData: false,
-            stale: false,
-            seq: 0,
-            error: undefined,
-            inflight: null,
-            observers: 0,
-            releasedAt: null,
-            dirty: true,
-            result: null,
-            listeners: new Set(),
-        };
-        this.entries.set(canon, entry);
-        return entry;
-    }
-    /**
-     * Re-home an entry under its resolved key once roots resolve (§5.4 step 3),
-     * and return the surviving entry. When another entry already lives at the
-     * resolved key (two provisional roots collapsing onto one — a concurrent /
-     * StrictMode cold mount), the incoming `entry` is MERGED into the existing
-     * one rather than clobbering it, so neither entry's subscribers or membership
-     * are orphaned. Callers must continue with the returned entry; subscription
-     * closures re-resolve their entry through {@link get} (which follows the
-     * provisional→resolved alias), so a merge does not strand their listeners.
-     */
-    rehome(entry, resolvedKey) {
-        if (resolvedKey === entry.key)
-            return entry;
-        const existing = this.entries.get(resolvedKey);
-        if (existing !== undefined && existing !== entry) {
-            mergeInto(existing, entry);
-            this.aliases.set(entry.key, resolvedKey);
-            this.entries.delete(entry.key);
-            return existing;
-        }
-        this.aliases.set(entry.key, resolvedKey);
-        this.entries.delete(entry.key);
-        entry.key = resolvedKey;
-        this.entries.set(resolvedKey, entry);
-        return entry;
-    }
-    delete(entry) {
-        this.entries.delete(entry.key);
-    }
-    /** Union of every retained shape's members + roots — the GC reachability set. */
-    reachable() {
-        const nodes = new Set();
-        const edges = new Set();
-        for (const entry of this.entries.values()) {
-            for (const id of entry.resolvedRoots)
-                nodes.add(id);
-            for (const id of entry.nodeMembers)
-                nodes.add(id);
-            for (const key of entry.edgeKeys)
-                edges.add(key);
-        }
-        return { nodes, edges };
-    }
-}
-/**
- * Fold `dead` into `survivor` when two provisional entries resolve to one key.
- * Subscribers and observers move over (their unsub closures re-resolve to the
- * survivor via the alias), membership unions, and the fresher window state
- * (by `seq`) wins — the survivor's caller then integrates the arriving page.
- */
-function mergeInto(survivor, dead) {
-    for (const l of dead.listeners)
-        survivor.listeners.add(l);
-    survivor.observers += dead.observers;
-    if (survivor.observers > 0)
-        survivor.releasedAt = null;
-    for (const id of dead.resolvedRoots) {
-        if (!survivor.resolvedRoots.includes(id))
-            survivor.resolvedRoots.push(id);
-    }
-    for (const id of dead.nodeMembers) {
-        if (!survivor.memberSet.has(id)) {
-            survivor.memberSet.add(id);
-            survivor.nodeMembers.push(id);
-        }
-    }
-    for (const key of dead.edgeKeys) {
-        if (!survivor.edgeKeySet.has(key)) {
-            survivor.edgeKeySet.add(key);
-            survivor.edgeKeys.push(key);
-        }
-    }
-    if (dead.seq > survivor.seq) {
-        survivor.next = dead.next;
-        survivor.contAst = dead.contAst;
-        survivor.exhausted = dead.exhausted;
-        survivor.windowPages = dead.windowPages;
-        survivor.seq = dead.seq;
-    }
-    survivor.hasData = survivor.hasData || dead.hasData;
-    survivor.stale = survivor.stale || dead.stale;
-    survivor.dirty = true;
-}
-// ── Integration ──────────────────────────────────────────────────────────────
-/**
- * Fold a page into a shape's membership. `replace` resets the window (a fresh
- * evaluation), `append` accumulates (a `more.load` continuation).
- */
-export function integrateShape(entry, wire, seq, mode) {
-    // Compute the continuation first: an orphan-cursor desync throws here, and it
-    // must NOT half-fold a page — let it surface (revalidate's error channel).
-    const contAst = continuationOf(entry.baseAst, wire);
-    if (mode === 'replace') {
-        entry.nodeMembers = [];
-        entry.memberSet = new Set();
-        entry.edgeKeys = [];
-        entry.edgeKeySet = new Set();
-    }
-    entry.resolvedRoots = wire.roots ?? [];
-    for (const node of wire.nodes) {
-        if (!entry.memberSet.has(node.id)) {
-            entry.memberSet.add(node.id);
-            entry.nodeMembers.push(node.id);
-        }
-    }
-    for (const edge of wire.edges) {
-        const key = edgeKey(edge);
-        if (!entry.edgeKeySet.has(key)) {
-            entry.edgeKeySet.add(key);
-            entry.edgeKeys.push(key);
-        }
-    }
-    entry.next = wire.next;
-    entry.contAst = contAst;
-    entry.exhausted = contAst === null;
-    entry.seq = seq;
-    entry.hasData = true;
-    entry.stale = false;
-    entry.error = undefined;
-    entry.dirty = true;
-}
-/**
- * The continuation AST, or `null` on true exhaustion. Multi-root paging is
- * caller-owned (Tier-0) so it never continues; single-root delegates to
- * `nextQuery`, which THROWS on an orphan cursor (a wire/AST desync) rather than
- * masquerade it as exhaustion — that throw is deliberately not swallowed.
- */
-function continuationOf(ast, wire) {
-    if (ast.from.length !== 1)
-        return null;
-    return nextQuery(ast, wire);
-}
-// ── Metadata derivation ──────────────────────────────────────────────────────
-/** Derive a shape's structural metadata from its canonical AST (once, on ensure). */
-export function deriveMeta(ast) {
-    let moveDepth = 0;
-    let moveClasses;
-    let moveOrder;
-    const gathers = [];
-    for (const step of ast.steps ?? []) {
-        if (!('expand' in step))
-            continue;
-        const e = step.expand;
-        if (e.as === undefined) {
-            moveDepth = e.depth ?? 1;
-            moveClasses = classArm(e.filter);
-            moveOrder = e.order;
-        }
-        else {
-            gathers.push({
-                as: e.as,
-                edgeClasses: safeResolveEdge(e.edge),
-                dir: e.dir,
-                order: e.order,
-            });
-        }
-    }
-    return { moveDepth, moveClasses, moveOrder, gathers };
-}
-function classArm(filter) {
-    if (filter === null || typeof filter !== 'object')
-        return undefined;
-    const f = filter;
-    if (!('class' in f))
-        return undefined;
-    const cls = f.class;
-    return (Array.isArray(cls) ? cls : [cls]).map(String);
-}
-function safeResolveEdge(edge) {
-    try {
-        return resolveEdgeMatch(edge);
-    }
-    catch {
-        return undefined; // unknown sugar — treated as no class restriction for matching
-    }
-}
-// ── ShapeView (for invalidation) ─────────────────────────────────────────────
-/** Adapt an entry to the {@link ShapeView} the invalidation matcher consumes. */
-export function shapeViewOf(entry, store) {
-    const resolvedPaths = entry.resolvedRoots
-        .map((id) => store.node(id)?.wire.path)
-        .filter((p) => p !== undefined);
-    const rootPaths = [...new Set([...resolvedPaths, ...entry.inputRootPaths])];
-    const gathers = entry.meta.gathers.map((g) => ({
-        edgeClasses: g.edgeClasses,
-        dir: g.dir,
-    }));
-    return {
-        id: entry.key,
-        rootPaths,
-        depth: entry.meta.moveDepth,
-        moveClasses: entry.meta.moveClasses,
-        gathers,
-        hasNode: (id) => entry.memberSet.has(id) || entry.resolvedRoots.includes(id),
-    };
-}
-// ── Materialization ──────────────────────────────────────────────────────────
-/** Build the derived `Graph` view of a shape over the confirmed store ⊕ overlay. */
-export function materialize(entry, store, overlay) {
-    const eff = overlay.effects(store);
-    const nodeWires = [];
-    const seenNodes = new Set();
-    for (const id of [...entry.resolvedRoots, ...entry.nodeMembers]) {
-        if (seenNodes.has(id))
-            continue;
-        seenNodes.add(id);
-        const wire = overlay.effectiveNode(id, store, eff);
-        if (wire !== null)
-            nodeWires.push(wire);
-    }
-    const edgeWires = entry.edgeKeys
-        .map((key) => overlay.effectiveEdge(key, store, eff))
-        .filter((w) => w !== null);
-    const graph = Graph.fromWire({ nodes: nodeWires, edges: edgeWires });
-    const byId = (id) => graph.nodes.byId(id) ?? null;
-    const roots = entry.resolvedRoots
-        .map(byId)
-        .filter((n) => n !== null && !eff.nodeDeletes.has(n.id));
-    const rootIds = new Set(roots.map((n) => n.id));
-    const rootPaths = roots.map((n) => n.path.raw);
-    const nodes = dedupeNodes(entry.nodeMembers.map(byId).filter((n) => n !== null));
-    const first = roots[0] ?? null;
-    const children = orderNodes(nodes.filter((n) => !rootIds.has(n.id) && withinAnyRoot(rootPaths, n.path.raw, entry.meta.moveDepth)), entry.meta.moveOrder);
-    const gathered = (alias) => {
-        const meta = entry.meta.gathers.find((g) => g.as === alias);
-        if (meta === undefined)
-            return { nodes: [], first: null };
-        const collected = gatherEndpoints(meta, edgeWires, rootPaths, graph);
-        const ordered = orderNodes(collected, meta.order);
-        return { nodes: ordered, first: ordered[0] ?? null };
-    };
-    return { graph, roots, nodes, first, children, gathered };
-}
-function withinAnyRoot(rootPaths, pRaw, depth) {
-    return rootPaths.some((r) => {
-        const d = subtreeDelta(r, pRaw);
-        return d !== null && d >= 1 && d <= depth;
-    });
-}
-function gatherEndpoints(meta, edgeWires, rootPaths, graph) {
-    const rootSet = new Set(rootPaths);
-    const out = [];
-    const seen = new Set();
-    for (const e of edgeWires) {
-        if (meta.edgeClasses !== undefined && !meta.edgeClasses.includes(e.class))
-            continue;
-        const farPath = farEndpoint(meta.dir, e, rootSet);
-        if (farPath === null)
-            continue;
-        const node = graph.nodes.at(farPath) ?? graph.nodes.get(farPath);
-        if (node !== null && node !== undefined && !seen.has(node.id)) {
-            seen.add(node.id);
-            out.push(node);
-        }
-    }
-    return out;
-}
-/** The far endpoint path when a root is the near endpoint (per gather direction). */
-function farEndpoint(dir, e, rootSet) {
-    if (dir === 'out')
-        return rootSet.has(e.source) ? e.target : null;
-    if (dir === 'in')
-        return rootSet.has(e.target) ? e.source : null;
-    if (rootSet.has(e.source))
-        return e.target;
-    if (rootSet.has(e.target))
-        return e.source;
-    return null;
-}
-function dedupeNodes(nodes) {
-    const seen = new Set();
-    const out = [];
-    for (const n of nodes) {
-        if (seen.has(n.id))
-            continue;
-        seen.add(n.id);
-        out.push(n);
-    }
-    return out;
-}
-/** Stable order by the shape's `order` — `'id'` or a qualified prop key; ties keep input order. */
-function orderNodes(nodes, order) {
-    if (order === undefined)
-        return nodes;
-    const dir = order.dir === 'desc' ? -1 : 1;
-    const keyOf = (n) => (order.by === 'id' ? n.id : n.props[order.by]);
-    return nodes
-        .map((n, i) => ({ n, i }))
-        .sort((a, b) => {
-        const cmp = compare(keyOf(a.n), keyOf(b.n));
-        return cmp !== 0 ? cmp * dir : a.i - b.i;
-    })
-        .map((x) => x.n);
-}
-function compare(a, b) {
-    if (a === b)
-        return 0;
-    if (a === undefined || a === null)
-        return 1;
-    if (b === undefined || b === null)
-        return -1;
-    if (typeof a === 'number' && typeof b === 'number')
-        return a - b;
-    return String(a).localeCompare(String(b));
-}
-//# sourceMappingURL=shapes.js.map

package/dist/store/shapes.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"shapes.js","sourceRoot":"","sources":["../../src/store/shapes.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,OAAO,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAA;AAc/C,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AACtD,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAA;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAA;AA8C9C,MAAM,OAAO,UAAU;IACJ,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAA;IACxD,+DAA+D;IAC9C,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAA;IAEpD,iEAAiE;IACjE,SAAS,CAAC,GAAW;QACnB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,CAAA;IACrC,CAAC;IAED,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAA;IAC9C,CAAC;IAED,GAAG;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAA;IAC9B,CAAC;IAED,MAAM,CAAC,GAAW,EAAE,KAAa,EAAE,GAAkB,EAAE,cAAwB;QAC7E,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACxC,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAA;QAC7B,MAAM,KAAK,GAAe;YACxB,GAAG,EAAE,KAAK;YACV,KAAK;YACL,OAAO,EAAE,GAAG;YACZ,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC;YACrB,cAAc;YACd,MAAM,EAAE,QAAQ;YAChB,aAAa,EAAE,EAAE;YACjB,WAAW,EAAE,EAAE;YACf,SAAS,EAAE,IAAI,GAAG,EAAE;YACpB,QAAQ,EAAE,EAAE;YACZ,UAAU,EAAE,IAAI,GAAG,EAAE;YACrB,IAAI,EAAE,SAAS;YACf,OAAO,EAAE,IAAI;YACb,SAAS,EAAE,KAAK;YAChB,WAAW,EAAE,CAAC;YACd,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,KAAK;YACZ,GAAG,EAAE,CAAC;YACN,KAAK,EAAE,SAAS;YAChB,QAAQ,EAAE,IAAI;YACd,SAAS,EAAE,CAAC;YACZ,UAAU,EAAE,IAAI;YAChB,KAAK,EAAE,IAAI;YACX,MAAM,EAAE,IAAI;YACZ,SAAS,EAAE,IAAI,GAAG,EAAE;SACrB,CAAA;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QAC9B,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,KAAiB,EAAE,WAAmB;QAC3C,IAAI,WAAW,KAAK,KAAK,CAAC,GAAG;YAAE,OAAO,KAAK,CAAA;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;QAC9C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;YACjD,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;YAC1B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,WAAW,CAAC,CAAA;YACxC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YAC9B,OAAO,QAAQ,CAAA;QACjB,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,WAAW,CAAC,CAAA;QACxC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QAC9B,KAAK,CAAC,GAAG,GAAG,WAAW,CAAA;QACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAA;QACpC,OAAO,KAAK,CAAA;IACd,CAAC;IAED,MAAM,CAAC,KAAiB;QACtB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IAChC,CAAC;IAED,iFAAiF;IACjF,SAAS;QACP,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;QAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAW,CAAA;QAChC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,aAAa;gBAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACnD,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,WAAW;gBAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACjD,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,QAAQ;gBAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAClD,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;IACzB,CAAC;CACF;AAED;;;;;GAKG;AACH,SAAS,SAAS,CAAC,QAAoB,EAAE,IAAgB;IACvD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS;QAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACzD,QAAQ,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAA;IACpC,IAAI,QAAQ,CAAC,SAAS,GAAG,CAAC;QAAE,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAA;IACtD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;QACpC,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAE,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC3E,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QAClC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAChC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YAC1B,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC/B,CAAC;IACH,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAClC,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC5B,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IACD,IAAI,IAAI,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC;QAC5B,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACzB,QAAQ,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAA;QAC/B,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAA;QACnC,QAAQ,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAA;QACvC,QAAQ,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAA;IACzB,CAAC;IACD,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAA;IACnD,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAA;IAC7C,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAA;AACvB,CAAC;AAED,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAiB,EACjB,IAAmB,EACnB,GAAW,EACX,IAA0B;IAE1B,8EAA8E;IAC9E,2EAA2E;IAC3E,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;IACnD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,KAAK,CAAC,WAAW,GAAG,EAAE,CAAA;QACtB,KAAK,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE,CAAA;QAC3B,KAAK,CAAC,QAAQ,GAAG,EAAE,CAAA;QACnB,KAAK,CAAC,UAAU,GAAG,IAAI,GAAG,EAAE,CAAA;IAC9B,CAAC;IACD,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAA;IACtC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAClC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC5B,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACjC,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;QACzB,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/B,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACzB,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAC1B,CAAC;IACH,CAAC;IACD,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;IACtB,KAAK,CAAC,OAAO,GAAG,OAAO,CAAA;IACvB,KAAK,CAAC,SAAS,GAAG,OAAO,KAAK,IAAI,CAAA;IAClC,KAAK,CAAC,GAAG,GAAG,GAAG,CAAA;IACf,KAAK,CAAC,OAAO,GAAG,IAAI,CAAA;IACpB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAA;IACnB,KAAK,CAAC,KAAK,GAAG,SAAS,CAAA;IACvB,KAAK,CAAC,KAAK,GAAG,IAAI,CAAA;AACpB,CAAC;AAED;;;;;GAKG;AACH,SAAS,cAAc,CAAC,GAAkB,EAAE,IAAmB;IAC7D,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACtC,OAAO,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;AAC7B,CAAC;AAED,gFAAgF;AAEhF,qFAAqF;AACrF,MAAM,UAAU,UAAU,CAAC,GAAkB;IAC3C,IAAI,SAAS,GAAG,CAAC,CAAA;IACjB,IAAI,WAAiC,CAAA;IACrC,IAAI,SAAiC,CAAA;IACrC,MAAM,OAAO,GAAiB,EAAE,CAAA;IAChC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;QACnC,IAAI,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC;YAAE,SAAQ;QACjC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;QACrB,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;YACvB,SAAS,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAA;YACxB,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;YAChC,SAAS,GAAG,CAAC,CAAC,KAAK,CAAA;QACrB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CAAC;gBACX,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC;gBACpC,GAAG,EAAE,CAAC,CAAC,GAAG;gBACV,KAAK,EAAE,CAAC,CAAC,KAAK;aACf,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,SAAS,EAAE,OAAO,EAAE,CAAA;AACvD,CAAC;AAED,SAAS,QAAQ,CAAC,MAAe;IAC/B,IAAI,MAAM,KAAK,IAAI,IAAI,OAAO,MAAM,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAA;IACnE,MAAM,CAAC,GAAG,MAAiC,CAAA;IAC3C,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC;QAAE,OAAO,SAAS,CAAA;IACrC,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAA;IACnB,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;AACvD,CAAC;AAED,SAAS,eAAe,CAAC,IAAa;IACpC,IAAI,CAAC;QACH,OAAO,gBAAgB,CAAC,IAAqC,CAAC,CAAA;IAChE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAA,CAAC,+DAA+D;IAClF,CAAC;AACH,CAAC;AAED,gFAAgF;AAEhF,iFAAiF;AACjF,MAAM,UAAU,WAAW,CAAC,KAAiB,EAAE,KAAkB;IAC/D,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa;SACtC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC;SACtC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAA;IAC9C,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,aAAa,EAAE,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAA;IAC3E,MAAM,OAAO,GAAiB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3D,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,GAAG,EAAE,CAAC,CAAC,GAAG;KACX,CAAC,CAAC,CAAA;IACH,OAAO;QACL,EAAE,EAAE,KAAK,CAAC,GAAG;QACb,SAAS;QACT,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,SAAS;QAC3B,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,WAAW;QACnC,OAAO;QACP,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,aAAa,CAAC,QAAQ,CAAC,EAAE,CAAC;KAC7E,CAAA;AACH,CAAC;AAED,gFAAgF;AAEhF,oFAAoF;AACpF,MAAM,UAAU,WAAW,CACzB,KAAiB,EACjB,KAAkB,EAClB,OAAgB;IAEhB,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;IAClC,MAAM,SAAS,GAAoB,EAAE,CAAA;IACrC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAA;IACnC,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,KAAK,CAAC,aAAa,EAAE,GAAG,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC;QAChE,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAQ;QAC/B,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACjB,MAAM,IAAI,GAAG,OAAO,CAAC,aAAa,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,CAAA;QAClD,IAAI,IAAI,KAAK,IAAI;YAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACzC,CAAC;IACD,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ;SAC7B,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;SACpD,MAAM,CAAC,CAAC,CAAC,EAA8B,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAA;IAExD,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAA;IACpE,MAAM,IAAI,GAAG,CAAC,EAAU,EAAe,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAA;IAEtE,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa;SAC9B,GAAG,CAAC,IAAI,CAAC;SACT,MAAM,CAAC,CAAC,CAAC,EAAa,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACrE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC/C,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAE9C,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAa,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAA;IAC3F,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAA;IAE9B,MAAM,QAAQ,GAAG,UAAU,CACzB,KAAK,CAAC,MAAM,CACV,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,aAAa,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CACxF,EACD,KAAK,CAAC,IAAI,CAAC,SAAS,CACrB,CAAA;IAED,MAAM,QAAQ,GAAG,CAAC,KAAa,EAAyC,EAAE;QACxE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,CAAA;QAC3D,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;QACzD,MAAM,SAAS,GAAG,eAAe,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,CAAA;QACpE,MAAM,OAAO,GAAG,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QACjD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAA;IACtD,CAAC,CAAA;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAA;AAC3D,CAAC;AAED,SAAS,aAAa,CAAC,SAA4B,EAAE,IAAY,EAAE,KAAa;IAC9E,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;QAC/B,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAA;IAC3C,CAAC,CAAC,CAAA;AACJ,CAAC;AAED,SAAS,eAAe,CACtB,IAAgB,EAChB,SAAuE,EACvE,SAA4B,EAC5B,KAAY;IAEZ,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAA;IAClC,MAAM,GAAG,GAAW,EAAE,CAAA;IACtB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,SAAQ;QACnF,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,OAAO,CAAC,CAAA;QACjD,IAAI,OAAO,KAAK,IAAI;YAAE,SAAQ;QAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAChE,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC9D,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACjB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAChB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,qFAAqF;AACrF,SAAS,WAAW,CAClB,GAA0B,EAC1B,CAAqC,EACrC,OAA4B;IAE5B,IAAI,GAAG,KAAK,KAAK;QAAE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAA;IACjE,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAA;IAChE,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAA;IAC1C,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAA;IAC1C,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,WAAW,CAAC,KAAa;IAChC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,MAAM,GAAG,GAAW,EAAE,CAAA;IACtB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,SAAQ;QAC5B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;QACd,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACb,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,mGAAmG;AACnG,SAAS,UAAU,CAAC,KAAa,EAAE,KAA6B;IAC9D,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAA;IACrC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACzC,MAAM,KAAK,GAAG,CAAC,CAAO,EAAW,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;IAClF,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACzB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACb,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC3C,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC1C,CAAC,CAAC;SACD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACpB,CAAC;AAED,SAAS,OAAO,CAAC,CAAU,EAAE,CAAU;IACrC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IACrB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,CAAC,CAAA;IAC3C,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC,CAAA;IAC5C,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,CAAC,GAAG,CAAC,CAAA;IAChE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;AAC3C,CAAC"}

package/dist/store/types.d.ts

@@ -1,168 +0,0 @@
-/**
- * Shared value shapes for the memory store — the read envelope, read/write
- * options, and the materialized-shape projection. The `GraphMemory` facade
- * itself lives in `memory.ts`.
- */
-import type { Graph, Node, PermName } from '@astrale-os/kernel-core';
-import type { MutationResultWire, OrderInput, PatchBuilder } from '../graph/index.js';
-/**
- * Read options (FRONTEND §4.3 / SHELL_REACT §1.5). The store honors `live`,
- * `window`, and `with` (folded into the shape AST — it participates in the
- * shape key). `suspend`/`keepPrevious` are render-time concerns honored by the
- * React bindings, not the store. Isolation (`scope`) is via `forScope`, not a
- * per-read option; retention is a `createMemory` / `preload` concern.
- */
-export interface ReadOptions {
-    /** default true — a subscribed shape self-invalidates (Tier 0). false = one-shot. */
-    live?: boolean;
-    /** default true — cold shapes await first data (React bindings only). */
-    suspend?: boolean;
-    /** show the previous shape's data while a new one confirms (React bindings only). */
-    keepPrevious?: boolean;
-    /** visibility permission — folded onto the AST, so it keys the shape (READ-only lit up today). */
-    with?: PermName;
-    /** window growth: 'append' (default, infinite) vs 'paged' (replace). */
-    window?: 'append' | 'paged';
-}
-/**
- * Write options (FRONTEND §4.4 / SHELL_REACT §5). Optimistic-auto by default:
- * the authored patch IS the overlay (the six patch arms). `false` skips the
- * overlay and reconciles from the server (server-computed effects); a function
- * supplies a MANUAL overlay patch decoupled from what is dispatched (§1.6 —
- * method dispatch that knows its effect shape).
- */
-export interface MutateOptions {
-    /** default 'auto'. false = no overlay (reconcile from server). fn = manual overlay patch. */
-    optimistic?: 'auto' | false | ((overlay: PatchBuilder) => void);
-    /** default 'auto'. false = keep the overlay on failure (caller reconciles). */
-    rollback?: 'auto' | false;
-    /** invoked with the mutation result once the write commits. */
-    onCommit?: (result: MutationResultWire) => void;
-    /** invoked with the failure once the write rejects (in addition to the error channel). */
-    onError?: (error: unknown) => void;
-    scope?: string;
-}
-/** Window continuation (SHELL_REACT §1.1 `Windowed`). */
-export interface Windowed {
-    readonly more: {
-        readonly has: boolean;
-        load(): Promise<void>;
-        readonly pending: boolean;
-    };
-}
-/**
- * The live read envelope (FRONTEND §4.2). One unified shape carries every
- * accessor; the React bindings project the relevant subset (`node`, `children`,
- * `nodes`/`roots`/`gathered`). `seq` is 0 until the wire carries one (§6.1).
- */
-export interface LiveResult extends Windowed {
-    readonly graph: Graph;
-    readonly roots: readonly Node[];
-    readonly nodes: readonly Node[];
-    readonly first: Node | null;
-    /** `first` — the point-read projection (`useNode`). */
-    readonly node: Node | null;
-    /** ordered descendants under the shape's roots (`useChildren`). */
-    readonly children: readonly Node[];
-    gathered(alias: string): {
-        readonly nodes: readonly Node[];
-        readonly first: Node | null;
-    };
-    /** a (re)validation is in flight; data shown is last-good (stale-while-revalidate). */
-    readonly pending: boolean;
-    /** data is known-stale (a revalidation is due or in flight); last-good shown. */
-    readonly stale: boolean;
-    /** last refresh failure; last-good data retained. */
-    readonly error: unknown;
-    /** Tier-0 self-invalidation active for this shape (observed). */
-    readonly live: boolean;
-    readonly seq: number;
-    refetch(): Promise<void>;
-}
-/** The derived data half of a {@link LiveResult}, built by `materialize`. */
-export interface MaterializedShape {
-    readonly graph: Graph;
-    readonly roots: Node[];
-    readonly nodes: Node[];
-    readonly first: Node | null;
-    readonly children: Node[];
-    gathered(alias: string): {
-        nodes: Node[];
-        first: Node | null;
-    };
-}
-/** One gather step's derived metadata. */
-export interface GatherMeta {
-    readonly as: string;
-    readonly edgeClasses?: string[];
-    readonly dir: 'in' | 'out' | 'both';
-    readonly order?: OrderInput;
-}
-/** A shape's structural metadata, derived once from its canonical AST. */
-export interface ShapeMeta {
-    readonly moveDepth: number;
-    readonly moveClasses?: string[];
-    readonly moveOrder?: OrderInput;
-    readonly gathers: GatherMeta[];
-}
-/** Options for `createMemory`. */
-export interface MemoryOptions {
-    /** default principal/isolation key. */
-    scope?: string;
-    /** retain an unobserved shape this long before release (GC). Default 30s. */
-    ttlMs?: number;
-    /** retain a tombstone this long before sweeping. Default 5min. */
-    tombstoneTtlMs?: number;
-    /** injectable clock (tests). Default `Date.now`. */
-    now?: () => number;
-    /**
-     * Event channel (FRONTEND §5.7 loudness) — warm-read refresh failures,
-     * rolled-back mutations, DIVERGENCE (a dropped overlay differed from the
-     * refetched truth), and (in `dev`) invariant violations.
-     */
-    onError?: (event: MemoryEvent) => void;
-    /**
-     * Enable dev-mode invariant checks after each notify batch (§5.7): no
-     * optimistic ids survive in settled membership, every membership id resolves
-     * in the entity store, listener count == observer count. Violations surface
-     * on {@link MemoryOptions.onError} as `{ kind: 'invariant' }`. Default off.
-     */
-    dev?: boolean;
-    /** max coalesced revalidations in flight per drain (§5.7 operational). Default 4. */
-    concurrency?: number;
-    /** amortized `sweep()` cadence: run GC every N memory ops. Default 128. */
-    sweepEvery?: number;
-}
-/**
- * A surfaced memory event (SHELL_REACT `ShellError` superset). The channel is
- * widened past pure errors so a Tier-0 misprediction is LOUD: when a held
- * display overlay is dropped and the reconciling refetch disagreed with what it
- * showed, a `divergence` event fires. `invariant` events only fire under
- * `dev`. When §6/§7 land and structural optimism returns, `divergence` remains
- * the tripwire that a prediction was wrong.
- */
-export type MemoryEvent = {
-    kind: 'refresh';
-    shape: string;
-    error: unknown;
-} | {
-    kind: 'mutation';
-    mutationId: string;
-    error: unknown;
-} | {
-    kind: 'divergence';
-    shape: string;
-    id: string;
-    detail: string;
-} | {
-    kind: 'invariant';
-    shape: string;
-    detail: string;
-};
-/**
- * Back-compat alias — the event channel was `MemoryError` before it widened to
- * carry divergence/invariant events. A handler that only switches on `refresh`
- * / `mutation` still type-checks; an exhaustive one gains two new arms.
- */
-export type MemoryError = MemoryEvent;
-//# sourceMappingURL=types.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/store/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAA;AAEpE,OAAO,KAAK,EAAE,kBAAkB,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAA;AAErF;;;;;;GAMG;AACH,MAAM,WAAW,WAAW;IAC1B,qFAAqF;IACrF,IAAI,CAAC,EAAE,OAAO,CAAA;IACd,yEAAyE;IACzE,OAAO,CAAC,EAAE,OAAO,CAAA;IACjB,qFAAqF;IACrF,YAAY,CAAC,EAAE,OAAO,CAAA;IACtB,kGAAkG;IAClG,IAAI,CAAC,EAAE,QAAQ,CAAA;IACf,wEAAwE;IACxE,MAAM,CAAC,EAAE,QAAQ,GAAG,OAAO,CAAA;CAC5B;AAED;;;;;;GAMG;AACH,MAAM,WAAW,aAAa;IAC5B,6FAA6F;IAC7F,UAAU,CAAC,EAAE,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC,OAAO,EAAE,YAAY,KAAK,IAAI,CAAC,CAAA;IAC/D,+EAA+E;IAC/E,QAAQ,CAAC,EAAE,MAAM,GAAG,KAAK,CAAA;IACzB,+DAA+D;IAC/D,QAAQ,CAAC,EAAE,CAAC,MAAM,EAAE,kBAAkB,KAAK,IAAI,CAAA;IAC/C,0FAA0F;IAC1F,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,CAAA;IAClC,KAAK,CAAC,EAAE,MAAM,CAAA;CACf;AAED,yDAAyD;AACzD,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,IAAI,EAAE;QACb,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAA;QACrB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAA;QACrB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;KAC1B,CAAA;CACF;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAW,SAAQ,QAAQ;IAC1C,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,CAAA;IAC/B,QAAQ,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,CAAA;IAC/B,QAAQ,CAAC,KAAK,EAAE,IAAI,GAAG,IAAI,CAAA;IAC3B,uDAAuD;IACvD,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAA;IAC1B,mEAAmE;IACnE,QAAQ,CAAC,QAAQ,EAAE,SAAS,IAAI,EAAE,CAAA;IAClC,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG;QAAE,QAAQ,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,GAAG,IAAI,CAAA;KAAE,CAAA;IACzF,uFAAuF;IACvF,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;IACzB,iFAAiF;IACjF,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;IACvB,qDAAqD;IACrD,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;IACvB,iEAAiE;IACjE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;IACpB,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAA;CACzB;AAED,6EAA6E;AAC7E,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,CAAA;IACtB,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,CAAA;IACtB,QAAQ,CAAC,KAAK,EAAE,IAAI,GAAG,IAAI,CAAA;IAC3B,QAAQ,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAA;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG;QAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QAAC,KAAK,EAAE,IAAI,GAAG,IAAI,CAAA;KAAE,CAAA;CAC/D;AAED,0CAA0C;AAC1C,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,EAAE,CAAA;IAC/B,QAAQ,CAAC,GAAG,EAAE,IAAI,GAAG,KAAK,GAAG,MAAM,CAAA;IACnC,QAAQ,CAAC,KAAK,CAAC,EAAE,UAAU,CAAA;CAC5B;AAED,0EAA0E;AAC1E,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,EAAE,CAAA;IAC/B,QAAQ,CAAC,SAAS,CAAC,EAAE,UAAU,CAAA;IAC/B,QAAQ,CAAC,OAAO,EAAE,UAAU,EAAE,CAAA;CAC/B;AAED,kCAAkC;AAClC,MAAM,WAAW,aAAa;IAC5B,uCAAuC;IACvC,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,6EAA6E;IAC7E,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,kEAAkE;IAClE,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,oDAAoD;IACpD,GAAG,CAAC,EAAE,MAAM,MAAM,CAAA;IAClB;;;;OAIG;IACH,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,WAAW,KAAK,IAAI,CAAA;IACtC;;;;;OAKG;IACH,GAAG,CAAC,EAAE,OAAO,CAAA;IACb,qFAAqF;IACrF,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,2EAA2E;IAC3E,UAAU,CAAC,EAAE,MAAM,CAAA;CACpB;AAED;;;;;;;GAOG;AACH,MAAM,MAAM,WAAW,GACnB;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GACxD;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GACjE;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAA;AAExD;;;;GAIG;AACH,MAAM,MAAM,WAAW,GAAG,WAAW,CAAA"}