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

package/dist/graph/query/lower.js

@@ -1,171 +0,0 @@
-/**
- * `lowerToGet` — compile a `QueryASTInput` down to a `function.get` input, or
- * throw naming the exact capability function.get is missing. The seam that
- * lets the permissive builder run against the narrow function.get.
- *
- * THROW, NEVER DEGRADE: function.get paginates *before* any client post-filter
- * would run, so a filtered page under-fills and its cursor lies — a degraded
- * result is wrong, not merely slow. The same chain that throws today starts
- * working with zero client change the day the structured `function.query`
- * syscall lands.
- *
- * The get-normal-form (§5.6):
- *   from:   Root[1..100]
- *   steps:  [0..1] MOVE   { edge: has_parent, dir 'in', depth ≤ 5,
- *                           filter? = pure {class} arm, page?, order? }
- *           [0..N] GATHER { edge?, dir, depth 1|undefined, as, page?, order?,
- *                           NO filter } → one edges[] selector each
- *   with:   absent | 'READ'
- * The MOVE, if present, must be the FIRST step: get anchors every gather on
- * the one walked subtree. Caps mirror function.get's zod (100/5/500) so a
- * violation reports identically on either side of the wire.
- */
-import { rawOf } from '@astrale-os/kernel-core';
-import { describeEdge, resolveEdgeMatch } from './edge-ref.js';
-import { HAS_PARENT_CLASS } from './edges.js';
-import { InvalidQueryError, UnsupportedQueryError } from './errors.js';
-// Same numbers as function.get's zod (`schema/functions/get.ts`) — independent
-// literals so the client rejects with the verdict the syscall boundary would.
-const MAX_ROOTS = 100;
-const MAX_DEPTH = 5;
-const MAX_LIMIT = 500;
-/**
- * Lower a v1 AST to a `function.get` input. Pure and synchronous — exported so
- * callers can pre-flight an AST (does a saved view still lower?) without a
- * transport.
- */
-export function lowerToGet(ast) {
-    const from = ast.from;
-    if (from.length === 0) {
-        // Structural, not a function.get gap: core's zod pins `from.min(1)`.
-        throw new InvalidQueryError('a query must seed at least one root');
-    }
-    if (from.length > MAX_ROOTS) {
-        throw new UnsupportedQueryError(`root count ${from.length} exceeds the get cap of ${MAX_ROOTS}`, 'roots-cap', 'query-fn');
-    }
-    if (ast.with !== undefined && ast.with !== 'READ') {
-        throw new UnsupportedQueryError(`visibility permission '${ast.with}' is not yet lit up — function.get threads READ only; ` +
-            `'USE' is the cheapest kernel unlock (un-hardcode get's visibility perm)`, 'visibility-perm', 'get-perm');
-    }
-    const roots = from.map(rawOf);
-    let depth = 0;
-    let children;
-    const edges = [];
-    // Each `as` keys a `(root × as)` cursor, so two gathers sharing one alias
-    // would fold a single cursor onto both steps.
-    const seenAliases = new Set();
-    const steps = ast.steps ?? [];
-    for (let i = 0; i < steps.length; i++) {
-        const step = steps[i];
-        if (!('expand' in step)) {
-            throw new UnsupportedQueryError('a standalone filter step needs the structured query syscall — function.get returns every visible root unconditionally', 'filter-step', 'query-fn');
-        }
-        const expand = step.expand;
-        if (expand.as === undefined) {
-            if (i !== 0) {
-                throw new UnsupportedQueryError('a move (unnamed expand) must be the first step — function.get anchors every gather ' +
-                    'on the single walked subtree, so it cannot chain past the seed frontier', 'move-chaining', 'query-fn');
-            }
-            ;
-            ({ depth, children } = lowerMove(expand));
-        }
-        else {
-            if (seenAliases.has(expand.as)) {
-                throw new InvalidQueryError(`duplicate gather alias '${expand.as}' — two gathers share the same \`as\`, which ` +
-                    'collides their (root × as) cursor keys; every gather needs a distinct alias');
-            }
-            seenAliases.add(expand.as);
-            edges.push(lowerGather(expand));
-        }
-    }
-    const input = { roots, depth };
-    if (children !== undefined)
-        input.children = children;
-    if (edges.length === 1)
-        input.edges = edges[0];
-    else if (edges.length > 1)
-        input.edges = edges;
-    return input;
-}
-/** The MOVE → `depth` + `children`. Throws on any non-has_parent-descent shape. */
-function lowerMove(expand) {
-    const resolved = resolveEdgeMatch(expand.edge);
-    const isHasParent = resolved !== undefined && resolved.length === 1 && resolved[0] === HAS_PARENT_CLASS;
-    if (!isHasParent) {
-        throw new UnsupportedQueryError(`the only move function.get expresses is the has_parent subtree descent; got ${describeEdge(expand.edge)}`, 'move-chaining', 'query-fn');
-    }
-    if (expand.dir !== 'in') {
-        throw new UnsupportedQueryError(`function.get descends only (has_parent inbound); dir '${expand.dir}' walks upward`, 'upward-walk', 'query-fn');
-    }
-    const depth = expand.depth ?? 1;
-    if (depth > MAX_DEPTH) {
-        throw new UnsupportedQueryError(`descent depth ${depth} exceeds the get cap of ${MAX_DEPTH}`, 'depth-cap', 'query-fn');
-    }
-    const classes = expand.filter !== undefined ? moveClassArm(expand.filter) : undefined;
-    const limit = expand.page?.limit;
-    if (limit !== undefined && limit > MAX_LIMIT) {
-        throw new UnsupportedQueryError(`children limit ${limit} exceeds the get cap of ${MAX_LIMIT}`, 'limit-cap', 'query-fn');
-    }
-    const cursor = expand.page?.cursor;
-    const order = expand.order;
-    const children = classes === undefined && limit === undefined && cursor === undefined && order === undefined
-        ? undefined
-        : {
-            ...(classes !== undefined ? { classes } : {}),
-            ...(limit !== undefined ? { limit } : {}),
-            ...(cursor !== undefined ? { cursor } : {}),
-            ...(order !== undefined ? { order } : {}),
-        };
-    return { depth, children };
-}
-/** A GATHER → one edges[] selector. Throws on a filter or a multi-hop depth. */
-function lowerGather(expand) {
-    if (expand.filter !== undefined)
-        throwGatherFilter(expand.filter);
-    if (expand.depth !== undefined && expand.depth !== 1) {
-        throw new UnsupportedQueryError(`function.get gathers a single hop; depth ${expand.depth} needs the structured query syscall`, 'gather-depth', 'query-fn');
-    }
-    const classes = resolveEdgeMatch(expand.edge);
-    const limit = expand.page?.limit;
-    if (limit !== undefined && limit > MAX_LIMIT) {
-        throw new UnsupportedQueryError(`gather limit ${limit} exceeds the get cap of ${MAX_LIMIT}`, 'limit-cap', 'query-fn');
-    }
-    const cursor = expand.page?.cursor;
-    const order = expand.order;
-    return {
-        as: expand.as,
-        ...(classes !== undefined ? { classes } : {}),
-        direction: expand.dir,
-        ...(limit !== undefined ? { limit } : {}),
-        ...(cursor !== undefined ? { cursor } : {}),
-        ...(order !== undefined ? { order } : {}),
-    };
-}
-// ─── Filter handling ─────────────────────────────────────────────────────────
-/**
- * The move's filter is admissible only as a pure `{ class }` arm →
- * `children.classes`; every other arm throws, named by what it is.
- */
-function moveClassArm(filter) {
-    const f = filter;
-    if ('class' in f)
-        return normalizeClasses(f.class);
-    if ('hasEdge' in f) {
-        throw new UnsupportedQueryError('a reachability (hasEdge) filter on a descent needs the structured query syscall', 'has-edge', 'query-fn');
-    }
-    throw new UnsupportedQueryError('function.get restricts a descent by class only — a property or boolean filter needs the structured query syscall', 'expand-filter', 'query-fn');
-}
-/** A gather carries no filter under get; classify the offending arm and throw. */
-function throwGatherFilter(filter) {
-    const f = filter;
-    if ('hasEdge' in f) {
-        throw new UnsupportedQueryError('a reachability (hasEdge) filter on a gather needs the structured query syscall', 'has-edge', 'query-fn');
-    }
-    throw new UnsupportedQueryError('function.get cannot filter gathered endpoints — a gather takes no filter', 'expand-filter', 'query-fn');
-}
-/** Normalize a class filter's value (one path or a union) to raw strings. */
-function normalizeClasses(cls) {
-    const list = Array.isArray(cls) ? cls : [cls];
-    return list.map((c) => rawOf(c));
-}
-//# sourceMappingURL=lower.js.map

package/dist/graph/query/lower.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lower.js","sourceRoot":"","sources":["../../../src/graph/query/lower.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAIH,OAAO,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAA;AAE/C,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAA;AAC9D,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAA;AAC7C,OAAO,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAA;AAEtE,+EAA+E;AAC/E,8EAA8E;AAC9E,MAAM,SAAS,GAAG,GAAG,CAAA;AACrB,MAAM,SAAS,GAAG,CAAC,CAAA;AACnB,MAAM,SAAS,GAAG,GAAG,CAAA;AAQrB;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,GAAkB;IAC3C,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAA;IACrB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,qEAAqE;QACrE,MAAM,IAAI,iBAAiB,CAAC,qCAAqC,CAAC,CAAA;IACpE,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;QAC5B,MAAM,IAAI,qBAAqB,CAC7B,cAAc,IAAI,CAAC,MAAM,2BAA2B,SAAS,EAAE,EAC/D,WAAW,EACX,UAAU,CACX,CAAA;IACH,CAAC;IAED,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAClD,MAAM,IAAI,qBAAqB,CAC7B,0BAA0B,GAAG,CAAC,IAAI,wDAAwD;YACxF,yEAAyE,EAC3E,iBAAiB,EACjB,UAAU,CACX,CAAA;IACH,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAC7B,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,QAAiC,CAAA;IACrC,MAAM,KAAK,GAAc,EAAE,CAAA;IAE3B,0EAA0E;IAC1E,8CAA8C;IAC9C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;IAErC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,IAAI,EAAE,CAAA;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAA;QACtB,IAAI,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,qBAAqB,CAC7B,uHAAuH,EACvH,aAAa,EACb,UAAU,CACX,CAAA;QACH,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QAC1B,IAAI,MAAM,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,MAAM,IAAI,qBAAqB,CAC7B,qFAAqF;oBACnF,yEAAyE,EAC3E,eAAe,EACf,UAAU,CACX,CAAA;YACH,CAAC;YACD,CAAC;YAAA,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAA;QAC5C,CAAC;aAAM,CAAC;YACN,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,iBAAiB,CACzB,2BAA2B,MAAM,CAAC,EAAE,+CAA+C;oBACjF,6EAA6E,CAChF,CAAA;YACH,CAAC;YACD,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YAC1B,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAA;QACjC,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;IACxC,IAAI,QAAQ,KAAK,SAAS;QAAE,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAA;IACrD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;SACzC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,CAAC,KAAK,GAAG,KAAK,CAAA;IAC9C,OAAO,KAAK,CAAA;AACd,CAAC;AAED,mFAAmF;AACnF,SAAS,SAAS,CAAC,MAAkB;IACnC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC9C,MAAM,WAAW,GACf,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,gBAAgB,CAAA;IACrF,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,MAAM,IAAI,qBAAqB,CAC7B,+EAA+E,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAC1G,eAAe,EACf,UAAU,CACX,CAAA;IACH,CAAC;IACD,IAAI,MAAM,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC;QACxB,MAAM,IAAI,qBAAqB,CAC7B,yDAAyD,MAAM,CAAC,GAAG,gBAAgB,EACnF,aAAa,EACb,UAAU,CACX,CAAA;IACH,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,CAAC,CAAA;IAC/B,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;QACtB,MAAM,IAAI,qBAAqB,CAC7B,iBAAiB,KAAK,2BAA2B,SAAS,EAAE,EAC5D,WAAW,EACX,UAAU,CACX,CAAA;IACH,CAAC;IAED,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IACrF,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAA;IAChC,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;QAC7C,MAAM,IAAI,qBAAqB,CAC7B,kBAAkB,KAAK,2BAA2B,SAAS,EAAE,EAC7D,WAAW,EACX,UAAU,CACX,CAAA;IACH,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,EAAE,MAAM,CAAA;IAClC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAA;IAE1B,MAAM,QAAQ,GACZ,OAAO,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;QACzF,CAAC,CAAC,SAAS;QACX,CAAC,CAAC;YACE,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7C,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACzC,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3C,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC1C,CAAA;IACP,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAA;AAC5B,CAAC;AAED,gFAAgF;AAChF,SAAS,WAAW,CAAC,MAAkB;IACrC,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS;QAAE,iBAAiB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IACjE,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;QACrD,MAAM,IAAI,qBAAqB,CAC7B,4CAA4C,MAAM,CAAC,KAAK,qCAAqC,EAC7F,cAAc,EACd,UAAU,CACX,CAAA;IACH,CAAC;IACD,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC7C,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAA;IAChC,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;QAC7C,MAAM,IAAI,qBAAqB,CAC7B,gBAAgB,KAAK,2BAA2B,SAAS,EAAE,EAC3D,WAAW,EACX,UAAU,CACX,CAAA;IACH,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,EAAE,MAAM,CAAA;IAClC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAA;IAC1B,OAAO;QACL,EAAE,EAAE,MAAM,CAAC,EAAE;QACb,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7C,SAAS,EAAE,MAAM,CAAC,GAAG;QACrB,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACzC,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1C,CAAA;AACH,CAAC;AAED,gFAAgF;AAEhF;;;GAGG;AACH,SAAS,YAAY,CAAC,MAAe;IACnC,MAAM,CAAC,GAAG,MAAiC,CAAA;IAC3C,IAAI,OAAO,IAAI,CAAC;QAAE,OAAO,gBAAgB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;IAClD,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,qBAAqB,CAC7B,iFAAiF,EACjF,UAAU,EACV,UAAU,CACX,CAAA;IACH,CAAC;IACD,MAAM,IAAI,qBAAqB,CAC7B,kHAAkH,EAClH,eAAe,EACf,UAAU,CACX,CAAA;AACH,CAAC;AAED,kFAAkF;AAClF,SAAS,iBAAiB,CAAC,MAAe;IACxC,MAAM,CAAC,GAAG,MAAiC,CAAA;IAC3C,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,qBAAqB,CAC7B,gFAAgF,EAChF,UAAU,EACV,UAAU,CACX,CAAA;IACH,CAAC;IACD,MAAM,IAAI,qBAAqB,CAC7B,0EAA0E,EAC1E,eAAe,EACf,UAAU,CACX,CAAA;AACH,CAAC;AAED,6EAA6E;AAC7E,SAAS,gBAAgB,CAAC,GAAY;IACpC,MAAM,IAAI,GAAc,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACxD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAa,CAAC,CAAC,CAAA;AAC9C,CAAC"}

package/dist/graph/query/shorthands.d.ts

@@ -1,34 +0,0 @@
-import type { Node, PathLike, QueryASTInput } from '@astrale-os/kernel-core';
-import type { Paged } from '../result/index.js';
-import type { GetResultWire } from '../wire.js';
-import type { OrderInput } from './builder.js';
-/** Options for {@link ReadShorthands.children}. */
-export interface ChildrenOpts {
-    /** Restrict children to these classes. */
-    classes?: PathLike[];
-    /** Page size — continue via `result.next()` or `opts.cursor`. */
-    limit?: number;
-    /** Opaque children cursor returned by `result.cursor()`. */
-    cursor?: string;
-    /** Children ordering, matching the query builder's move ordering. */
-    order?: OrderInput;
-}
-/** The read half of {@link GraphApi} — kept as its own contract so `GraphApi` can extend it. */
-export interface ReadShorthands {
-    /** One node by path, or `null` when missing or masked. */
-    get(path: PathLike): Promise<Node | null>;
-    /** One node by path; throws `NodeUnavailableError` when missing or masked. */
-    getOrThrow(path: PathLike, context?: string): Promise<Node>;
-    /** A node's direct children; `result.nodes` excludes the parent. */
-    children(path: PathLike, opts?: ChildrenOpts): Promise<Paged>;
-    /** Far endpoints across one edge class, lazily paged — `result.nodes` is the first page; `.all()` drains, `.next()` steps. */
-    neighbors(path: PathLike, edge: PathLike, direction: 'out' | 'in', opts?: {
-        cursor?: string;
-    }): Promise<Paged>;
-}
-/** A NOT_FOUND-folding AST runner (`read ∘ lowerToGet`) — the one capability the shorthands need. */
-type Run = (ast: QueryASTInput) => Promise<GetResultWire>;
-/** Build the read shorthands over a shared AST runner. */
-export declare function makeReadShorthands(run: Run): ReadShorthands;
-export {};
-//# sourceMappingURL=shorthands.d.ts.map

package/dist/graph/query/shorthands.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"shorthands.d.ts","sourceRoot":"","sources":["../../../src/graph/query/shorthands.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAS,IAAI,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAA;AAInF,OAAO,KAAK,EAAQ,KAAK,EAAE,MAAM,oBAAoB,CAAA;AACrD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAA;AAC/C,OAAO,KAAK,EAAE,UAAU,EAAY,MAAM,cAAc,CAAA;AAQxD,mDAAmD;AACnD,MAAM,WAAW,YAAY;IAC3B,0CAA0C;IAC1C,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAA;IACpB,iEAAiE;IACjE,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,4DAA4D;IAC5D,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,qEAAqE;IACrE,KAAK,CAAC,EAAE,UAAU,CAAA;CACnB;AAED,gGAAgG;AAChG,MAAM,WAAW,cAAc;IAC7B,0DAA0D;IAC1D,GAAG,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,CAAA;IACzC,8EAA8E;IAC9E,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;IAC3D,oEAAoE;IACpE,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,CAAA;IAC7D,8HAA8H;IAC9H,SAAS,CACP,IAAI,EAAE,QAAQ,EACd,IAAI,EAAE,QAAQ,EACd,SAAS,EAAE,KAAK,GAAG,IAAI,EACvB,IAAI,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,GACzB,OAAO,CAAC,KAAK,CAAC,CAAA;CAClB;AAED,qGAAqG;AACrG,KAAK,GAAG,GAAG,CAAC,GAAG,EAAE,aAAa,KAAK,OAAO,CAAC,aAAa,CAAC,CAAA;AAEzD,0DAA0D;AAC1D,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,GAAG,GAAG,cAAc,CA6C3D"}

package/dist/graph/query/shorthands.js

@@ -1,71 +0,0 @@
-import { rawOf } from '@astrale-os/kernel-core';
-import { NodeUnavailableError } from '../../errors/errors.js';
-import { makeGraphResult, makePaged } from '../result/index.js';
-import { Q } from './builder.js';
-import { resolveNeighborsPage } from './traverse.js';
-/** Build the read shorthands over a shared AST runner. */
-export function makeReadShorthands(run) {
-    async function read(path) {
-        const ast = Q.from(path).toAST();
-        return makeGraphResult(run, ast, await run(ast)).first;
-    }
-    return {
-        get: read,
-        async getOrThrow(path, context) {
-            const node = await read(path);
-            if (node === null)
-                throw new NodeUnavailableError(rawOf(path), context);
-            return node;
-        },
-        async children(path, opts) {
-            const first = await resolveChildrenPage(path, opts, run);
-            return makePaged(first, (cursor) => resolveChildrenPage(path, { ...opts, cursor }, run));
-        },
-        async neighbors(path, edge, direction, opts) {
-            const query = {
-                query: async (build) => {
-                    const ast = build(Q).toAST();
-                    return makeGraphResult(run, ast, await run(ast));
-                },
-            };
-            const first = await resolveNeighborsPage({ path: { raw: rawOf(path) } }, rawOf(edge), direction, { read: query }, opts?.cursor);
-            return makePaged(first, (cursor) => resolveNeighborsPage({ path: { raw: rawOf(path) } }, rawOf(edge), direction, { read: query }, cursor));
-        },
-    };
-}
-// ─── Internals ───────────────────────────────────────────────────────────────
-async function resolveChildrenPage(path, opts, run) {
-    const ast = Q.from(path).children(walkOpts(opts)).toAST();
-    const result = makeGraphResult(run, ast, await run(ast));
-    return {
-        nodes: childrenOf(result),
-        cursor: childrenCursor(result.wire.next, rawOf(path)),
-    };
-}
-function childrenOf(result) {
-    const roots = new Set(result.roots.map((n) => n.id));
-    return result.graph.nodes.filter((n) => !roots.has(n.id));
-}
-function childrenCursor(next, root) {
-    if (next === undefined)
-        return null;
-    if (root !== undefined)
-        return next[root]?.children ?? null;
-    return Object.values(next)[0]?.children ?? null;
-}
-/** {@link ChildrenOpts} → the builder's {@link WalkOpts}; `undefined` when empty. */
-function walkOpts(opts) {
-    if (opts?.classes === undefined &&
-        opts?.limit === undefined &&
-        opts?.cursor === undefined &&
-        opts?.order === undefined) {
-        return undefined;
-    }
-    return {
-        ...(opts.classes !== undefined ? { classes: opts.classes.map(rawOf) } : {}),
-        ...(opts.limit !== undefined ? { limit: opts.limit } : {}),
-        ...(opts.cursor !== undefined ? { cursor: opts.cursor } : {}),
-        ...(opts.order !== undefined ? { order: opts.order } : {}),
-    };
-}
-//# sourceMappingURL=shorthands.js.map

package/dist/graph/query/shorthands.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"shorthands.js","sourceRoot":"","sources":["../../../src/graph/query/shorthands.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAA;AAO/C,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAA;AAC7D,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAA;AAC/D,OAAO,EAAE,CAAC,EAAE,MAAM,cAAc,CAAA;AAChC,OAAO,EAAE,oBAAoB,EAAE,MAAM,eAAe,CAAA;AAkCpD,0DAA0D;AAC1D,MAAM,UAAU,kBAAkB,CAAC,GAAQ;IACzC,KAAK,UAAU,IAAI,CAAC,IAAc;QAChC,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAA;QAChC,OAAO,eAAe,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAA;IACxD,CAAC;IAED,OAAO;QACL,GAAG,EAAE,IAAI;QAET,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO;YAC5B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,CAAA;YAC7B,IAAI,IAAI,KAAK,IAAI;gBAAE,MAAM,IAAI,oBAAoB,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,CAAA;YACvE,OAAO,IAAI,CAAA;QACb,CAAC;QAED,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI;YACvB,MAAM,KAAK,GAAG,MAAM,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;YACxD,OAAO,SAAS,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,mBAAmB,CAAC,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,EAAE,GAAG,CAAC,CAAC,CAAA;QAC1F,CAAC;QAED,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI;YACzC,MAAM,KAAK,GAAkB;gBAC3B,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;oBACrB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAA;oBAC5B,OAAO,eAAe,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;gBAClD,CAAC;aACF,CAAA;YACD,MAAM,KAAK,GAAG,MAAM,oBAAoB,CACtC,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAC9B,KAAK,CAAC,IAAI,CAAC,EACX,SAAS,EACT,EAAE,IAAI,EAAE,KAAK,EAAE,EACf,IAAI,EAAE,MAAM,CACb,CAAA;YACD,OAAO,SAAS,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,EAAE,CACjC,oBAAoB,CAClB,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAC9B,KAAK,CAAC,IAAI,CAAC,EACX,SAAS,EACT,EAAE,IAAI,EAAE,KAAK,EAAE,EACf,MAAM,CACP,CACF,CAAA;QACH,CAAC;KACF,CAAA;AACH,CAAC;AAED,gFAAgF;AAEhF,KAAK,UAAU,mBAAmB,CAChC,IAAc,EACd,IAA8B,EAC9B,GAAQ;IAER,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAA;IACzD,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IACxD,OAAO;QACL,KAAK,EAAE,UAAU,CAAC,MAAM,CAAC;QACzB,MAAM,EAAE,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;KACtD,CAAA;AACH,CAAC;AAED,SAAS,UAAU,CAAC,MAAuC;IACzD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAC3D,CAAC;AAED,SAAS,cAAc,CAAC,IAA2B,EAAE,IAAwB;IAC3E,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAA;IACnC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,QAAQ,IAAI,IAAI,CAAA;IAC3D,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,IAAI,IAAI,CAAA;AACjD,CAAC;AAED,qFAAqF;AACrF,SAAS,QAAQ,CAAC,IAAmB;IACnC,IACE,IAAI,EAAE,OAAO,KAAK,SAAS;QAC3B,IAAI,EAAE,KAAK,KAAK,SAAS;QACzB,IAAI,EAAE,MAAM,KAAK,SAAS;QAC1B,IAAI,EAAE,KAAK,KAAK,SAAS,EACzB,CAAC;QACD,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,OAAO;QACL,GAAG,CAAC,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3E,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7D,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC3D,CAAA;AACH,CAAC"}

package/dist/graph/query/traverse.d.ts

@@ -1,59 +0,0 @@
-/**
- * The ONE edge-gather algorithm shared by the schema-free `neighbors`
- * read-shorthand and the schema-bound `.out(Edge)`/`.in(Edge)` traversal.
- *
- * An edge gather is one builder-form `query` (lowering to `function.get`); the
- * far endpoints of the gathered edges are then hydrated by ONE batched
- * multi-root `query`. `function.get` PAGES the gather (server default page,
- * hard max 500), so a high-degree node spans several pages. The core resolves
- * ONE page at a time (`resolveNeighborsPage` → far endpoints + a continuation
- * cursor); the two public surfaces consume that differently:
- *   - `neighbors` returns a generic `Paged` result — the caller decides how far to walk and truncation
- *     is never silent;
- *   - the bound `.out`/`.in` DRAIN every page into one typed array.
- *
- * Per-page round-trip contract:
- *   - 0 RT when the minting envelope already gathered the edge class AND all
- *     endpoints are present in-envelope — a gathered envelope holds the WHOLE
- *     class for the node, so it is always a single, complete page;
- *   - else ≤2 RT flat per page — ONE edges get + ONE batched multi-root get for
- *     the page's endpoints — NEVER per-node N+1. Endpoint hydration chunks at
- *     {@link MAX_HYDRATION_ROOTS} so it never trips `function.get`'s root cap.
- *
- * `edgeClass` is a full edge-class `ClassPath.raw`. `direction` picks the
- * near/far endpoints: `out` walks source→target, `in` walks target→source.
- */
-import type { Graph, Node } from '@astrale-os/kernel-core';
-import type { GraphResult, Page } from '../result/index.js';
-import type { GatherBuilder, QuerySource } from './builder.js';
-/**
- * The minimal read capability a gather needs — the builder-form `query`.
- * Kept local so this core never imports the shorthands/bound surface it serves.
- */
-export interface NeighborsRead {
-    query(build: (q: QuerySource) => GatherBuilder): Promise<GraphResult>;
-}
-/** The node whose neighbors we resolve — only its `@id`/path ref is needed. */
-export interface TraverseNode {
-    id?: string;
-    path: {
-        raw: string;
-    };
-}
-/** Ambient resolution context: the read plus an optional minting envelope. */
-export interface TraverseCtx {
-    read: NeighborsRead;
-    /** Minting envelope for in-envelope (0-RT) traversal. */
-    envelope?: Graph;
-    /** Edge `ClassPath.raw`s the mint's `GetInput` gathered — the exact 0-RT signal. */
-    gathered?: ReadonlySet<string>;
-}
-/** Resolve ONE page of far endpoints. `cursor` continues a prior page's gather. */
-export declare function resolveNeighborsPage(node: TraverseNode, edgeClass: string, direction: 'out' | 'in', ctx: TraverseCtx, cursor?: string): Promise<Page>;
-/**
- * Drain every page of a neighbor gather into one deduped, order-preserving
- * array — the schema-bound `.out`/`.in` surface, which keeps its typed
- * cardinality shape and so must be complete, not a page.
- */
-export declare function resolveNeighbors(node: TraverseNode, edgeClass: string, direction: 'out' | 'in', ctx: TraverseCtx): Promise<Node[]>;
-//# sourceMappingURL=traverse.d.ts.map

package/dist/graph/query/traverse.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"traverse.d.ts","sourceRoot":"","sources":["../../../src/graph/query/traverse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAAQ,KAAK,EAAE,IAAI,EAAE,MAAM,yBAAyB,CAAA;AAIhE,OAAO,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,oBAAoB,CAAA;AAE3D,OAAO,KAAK,EAAE,aAAa,EAAW,WAAW,EAAE,MAAM,cAAc,CAAA;AASvE;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,WAAW,KAAK,aAAa,GAAG,OAAO,CAAC,WAAW,CAAC,CAAA;CACtE;AAED,+EAA+E;AAC/E,MAAM,WAAW,YAAY;IAC3B,EAAE,CAAC,EAAE,MAAM,CAAA;IACX,IAAI,EAAE;QAAE,GAAG,EAAE,MAAM,CAAA;KAAE,CAAA;CACtB;AAED,8EAA8E;AAC9E,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,aAAa,CAAA;IACnB,yDAAyD;IACzD,QAAQ,CAAC,EAAE,KAAK,CAAA;IAChB,oFAAoF;IACpF,QAAQ,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAA;CAC/B;AAED,mFAAmF;AACnF,wBAAsB,oBAAoB,CACxC,IAAI,EAAE,YAAY,EAClB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,KAAK,GAAG,IAAI,EACvB,GAAG,EAAE,WAAW,EAChB,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC,IAAI,CAAC,CAcf;AAED;;;;GAIG;AACH,wBAAsB,gBAAgB,CACpC,IAAI,EAAE,YAAY,EAClB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,KAAK,GAAG,IAAI,EACvB,GAAG,EAAE,WAAW,GACf,OAAO,CAAC,IAAI,EAAE,CAAC,CAejB"}

package/dist/graph/query/traverse.js

@@ -1,144 +0,0 @@
-/**
- * The ONE edge-gather algorithm shared by the schema-free `neighbors`
- * read-shorthand and the schema-bound `.out(Edge)`/`.in(Edge)` traversal.
- *
- * An edge gather is one builder-form `query` (lowering to `function.get`); the
- * far endpoints of the gathered edges are then hydrated by ONE batched
- * multi-root `query`. `function.get` PAGES the gather (server default page,
- * hard max 500), so a high-degree node spans several pages. The core resolves
- * ONE page at a time (`resolveNeighborsPage` → far endpoints + a continuation
- * cursor); the two public surfaces consume that differently:
- *   - `neighbors` returns a generic `Paged` result — the caller decides how far to walk and truncation
- *     is never silent;
- *   - the bound `.out`/`.in` DRAIN every page into one typed array.
- *
- * Per-page round-trip contract:
- *   - 0 RT when the minting envelope already gathered the edge class AND all
- *     endpoints are present in-envelope — a gathered envelope holds the WHOLE
- *     class for the node, so it is always a single, complete page;
- *   - else ≤2 RT flat per page — ONE edges get + ONE batched multi-root get for
- *     the page's endpoints — NEVER per-node N+1. Endpoint hydration chunks at
- *     {@link MAX_HYDRATION_ROOTS} so it never trips `function.get`'s root cap.
- *
- * `edgeClass` is a full edge-class `ClassPath.raw`. `direction` picks the
- * near/far endpoints: `out` walks source→target, `in` walks target→source.
- */
-import { rawOf } from '@astrale-os/kernel-core';
-/**
- * `function.get` REJECTS an over-cap multi-root read rather than truncating it,
- * so endpoint hydration is chunked to stay at or below the syscall's `MAX_ROOTS`
- * (100). A client-side policy literal, not a mirror of the server constant.
- */
-const MAX_HYDRATION_ROOTS = 100;
-/** Resolve ONE page of far endpoints. `cursor` continues a prior page's gather. */
-export async function resolveNeighborsPage(node, edgeClass, direction, ctx, cursor) {
-    // A gathered minting envelope holds the WHOLE edge class for this node — one
-    // complete page, no cursor. Absence of `gathered` is a cache miss, NOT a cue
-    // to trust whatever edges of this class happen to sit in the envelope (they
-    // may have been gathered for a different root); such reads go remote. A
-    // continuation (cursor set) always goes remote.
-    const inEnvelope = cursor === undefined && ctx.envelope !== undefined && ctx.gathered?.has(edgeClass) === true;
-    if (inEnvelope && ctx.envelope) {
-        const nodes = await resolveFromEnvelope(node, edgeClass, direction, ctx.envelope, ctx.read);
-        return { nodes, cursor: null };
-    }
-    return resolveRemotePage(node, edgeClass, direction, ctx.read, cursor);
-}
-/**
- * Drain every page of a neighbor gather into one deduped, order-preserving
- * array — the schema-bound `.out`/`.in` surface, which keeps its typed
- * cardinality shape and so must be complete, not a page.
- */
-export async function resolveNeighbors(node, edgeClass, direction, ctx) {
-    const seen = new Set();
-    const out = [];
-    let cursor;
-    do {
-        const page = await resolveNeighborsPage(node, edgeClass, direction, ctx, cursor);
-        for (const n of page.nodes) {
-            const key = nodeKey(n);
-            if (seen.has(key))
-                continue;
-            seen.add(key);
-            out.push(n);
-        }
-        cursor = page.cursor ?? undefined;
-    } while (cursor !== undefined);
-    return out;
-}
-// ─── Internals ───────────────────────────────────────────────────────────────
-/** In-envelope path: keep edges incident to this node, resolve far endpoints (0 RT, else 1 batched get). */
-async function resolveFromEnvelope(node, edgeClass, direction, envelope, read) {
-    const incident = envelope.edges
-        .byClass(edgeClass)
-        .filter((e) => envelope.nodes.get(nearOf(e, direction))?.id === node.id);
-    const farRefs = dedupe(incident.map((e) => rawOf(farOf(e, direction))));
-    return resolveRefs(farRefs, envelope, read);
-}
-/** Remote page: ONE edges get (optionally continuing `cursor`) + chunked endpoint hydration. */
-async function resolveRemotePage(node, edgeClass, direction, read, cursor) {
-    const selfRef = node.id ? `@${node.id}` : node.path.raw;
-    const hop = cursor !== undefined ? { cursor } : undefined;
-    const result = await read.query((q) => direction === 'out' ? q.from(selfRef).out(edgeClass, hop) : q.from(selfRef).in(edgeClass, hop));
-    const matching = result.graph.edges.filter((e) => rawOf(e.class) === edgeClass);
-    const farRefs = dedupe(matching.map((e) => rawOf(farOf(e, direction))));
-    const nodes = await resolveRefs(farRefs, result.graph, read);
-    return { nodes, cursor: gatherCursor(result.wire.next) };
-}
-/**
- * Resolve a deduped, order-preserving list of endpoint refs — local graph
- * first, then batched `get`s (chunked at {@link MAX_HYDRATION_ROOTS}) for
- * whatever is still missing. Masked/absent endpoints are simply dropped.
- */
-async function resolveRefs(refs, local, read) {
-    const resolved = new Map();
-    const missing = [];
-    for (const ref of refs) {
-        const hit = local.nodes.get(ref);
-        if (hit)
-            resolved.set(ref, hit);
-        else
-            missing.push(ref);
-    }
-    for (let i = 0; i < missing.length; i += MAX_HYDRATION_ROOTS) {
-        const batch = missing.slice(i, i + MAX_HYDRATION_ROOTS);
-        const fetched = (await read.query((q) => q.from(...batch))).graph;
-        for (const ref of batch) {
-            const hit = fetched.nodes.get(ref);
-            if (hit)
-                resolved.set(ref, hit);
-        }
-    }
-    const out = [];
-    for (const ref of refs) {
-        const hit = resolved.get(ref);
-        if (hit)
-            out.push(hit);
-    }
-    return out;
-}
-/** The single gather's continuation cursor from a get result, or `null` when exhausted. */
-function gatherCursor(next) {
-    if (next === undefined)
-        return null;
-    const root = Object.values(next)[0];
-    const edges = root?.edges;
-    if (edges === undefined)
-        return null;
-    return Object.values(edges)[0] ?? null;
-}
-const nodeKey = (n) => n.id ?? n.path.raw;
-const nearOf = (e, direction) => (direction === 'out' ? e.source : e.target);
-const farOf = (e, direction) => (direction === 'out' ? e.target : e.source);
-function dedupe(refs) {
-    const seen = new Set();
-    const out = [];
-    for (const ref of refs) {
-        if (seen.has(ref))
-            continue;
-        seen.add(ref);
-        out.push(ref);
-    }
-    return out;
-}
-//# sourceMappingURL=traverse.js.map

package/dist/graph/query/traverse.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"traverse.js","sourceRoot":"","sources":["../../../src/graph/query/traverse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAIH,OAAO,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAA;AAM/C;;;;GAIG;AACH,MAAM,mBAAmB,GAAG,GAAG,CAAA;AAyB/B,mFAAmF;AACnF,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,IAAkB,EAClB,SAAiB,EACjB,SAAuB,EACvB,GAAgB,EAChB,MAAe;IAEf,6EAA6E;IAC7E,6EAA6E;IAC7E,4EAA4E;IAC5E,wEAAwE;IACxE,gDAAgD;IAChD,MAAM,UAAU,GACd,MAAM,KAAK,SAAS,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,SAAS,CAAC,KAAK,IAAI,CAAA;IAE7F,IAAI,UAAU,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,MAAM,mBAAmB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,IAAI,CAAC,CAAA;QAC3F,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAA;IAChC,CAAC;IACD,OAAO,iBAAiB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;AACxE,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,IAAkB,EAClB,SAAiB,EACjB,SAAuB,EACvB,GAAgB;IAEhB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,MAAM,GAAG,GAAW,EAAE,CAAA;IACtB,IAAI,MAA0B,CAAA;IAC9B,GAAG,CAAC;QACF,MAAM,IAAI,GAAG,MAAM,oBAAoB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,CAAC,CAAA;QAChF,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;YACtB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAQ;YAC3B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACb,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACb,CAAC;QACD,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,SAAS,CAAA;IACnC,CAAC,QAAQ,MAAM,KAAK,SAAS,EAAC;IAC9B,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,gFAAgF;AAEhF,4GAA4G;AAC5G,KAAK,UAAU,mBAAmB,CAChC,IAAkB,EAClB,SAAiB,EACjB,SAAuB,EACvB,QAAe,EACf,IAAmB;IAEnB,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK;SAC5B,OAAO,CAAC,SAAS,CAAC;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAA;IAC1E,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;IACvE,OAAO,WAAW,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;AAC7C,CAAC;AAED,gGAAgG;AAChG,KAAK,UAAU,iBAAiB,CAC9B,IAAkB,EAClB,SAAiB,EACjB,SAAuB,EACvB,IAAmB,EACnB,MAAe;IAEf,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAA;IACvD,MAAM,GAAG,GAAwB,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAAA;IAC9E,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CACpC,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,SAAS,EAAE,GAAG,CAAC,CAC/F,CAAA;IACD,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,SAAS,CAAC,CAAA;IAC/E,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;IACvE,MAAM,KAAK,GAAG,MAAM,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;IAC5D,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAA;AAC1D,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,WAAW,CAAC,IAAc,EAAE,KAAY,EAAE,IAAmB;IAC1E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAgB,CAAA;IACxC,MAAM,OAAO,GAAa,EAAE,CAAA;IAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAChC,IAAI,GAAG;YAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;;YAC1B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACxB,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,mBAAmB,EAAE,CAAC;QAC7D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,mBAAmB,CAAC,CAAA;QACvD,MAAM,OAAO,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;QACjE,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAClC,IAAI,GAAG;gBAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QACjC,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAW,EAAE,CAAA;IACtB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC7B,IAAI,GAAG;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACxB,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,2FAA2F;AAC3F,SAAS,YAAY,CAAC,IAA2B;IAC/C,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAA;IACnC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IACnC,MAAM,KAAK,GAAG,IAAI,EAAE,KAAK,CAAA;IACzB,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,IAAI,CAAA;IACpC,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAA;AACxC,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,CAAO,EAAU,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAA;AACvD,MAAM,MAAM,GAAG,CAAC,CAAO,EAAE,SAAuB,EAAE,EAAE,CAAC,CAAC,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;AAChG,MAAM,KAAK,GAAG,CAAC,CAAO,EAAE,SAAuB,EAAE,EAAE,CAAC,CAAC,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;AAE/F,SAAS,MAAM,CAAC,IAAc;IAC5B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,MAAM,GAAG,GAAa,EAAE,CAAA;IACxB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAQ;QAC3B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACb,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACf,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC"}

package/dist/graph/reconcile/execute.d.ts

@@ -1,8 +0,0 @@
-import type { GetInput, MutationResult, PatchDataInput } from '@astrale-os/kernel-core';
-import type { GetResultWire } from '../wire.js';
-import type { ReconcileFn } from './input.js';
-type Read = (input: GetInput) => Promise<GetResultWire>;
-type Commit = (patch: PatchDataInput) => Promise<MutationResult>;
-export declare function makeReconcile(read: Read, commit: Commit): ReconcileFn;
-export {};
-//# sourceMappingURL=execute.d.ts.map

package/dist/graph/reconcile/execute.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"execute.d.ts","sourceRoot":"","sources":["../../../src/graph/reconcile/execute.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAc,QAAQ,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAYnG,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAA;AAC/C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA;AAiB7C,KAAK,IAAI,GAAG,CAAC,KAAK,EAAE,QAAQ,KAAK,OAAO,CAAC,aAAa,CAAC,CAAA;AACvD,KAAK,MAAM,GAAG,CAAC,KAAK,EAAE,cAAc,KAAK,OAAO,CAAC,cAAc,CAAC,CAAA;AAEhE,wBAAgB,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,GAAG,WAAW,CAuCrE"}

package/dist/graph/reconcile/execute.js

@@ -1,56 +0,0 @@
-import { diff, Graph, MatchingStrategy, reconcile as reconcileChanges, setAliases, SYSTEM_PROPERTY_KEYS, toEdgeKey, } from '@astrale-os/kernel-core';
-import { normalizeReconcileInput } from './normalize.js';
-import { applyResult, dryRunResult, emptyApplyResult, isPatchEmpty, toPatchInput, } from './result.js';
-import { assertNoSpecClassMismatches, filterOwnedBase, resolveExistingSpecNodeIds, } from './scope.js';
-export function makeReconcile(read, commit) {
-    return async (input) => {
-        const normalized = normalizeReconcileInput(input);
-        const baseWire = await read(readInput(normalized));
-        const base = Graph.fromWire(baseWire);
-        assertNoSpecClassMismatches(base, normalized.spec);
-        const scopedBase = filterOwnedBase(base, normalized.scope, normalized.specEdgeKeys);
-        const existingNodes = resolveExistingSpecNodeIds(base, normalized.specNodePaths);
-        const spec = Graph.fromWire({
-            nodes: normalized.spec.nodes,
-            edges: normalized.spec.edges,
-        });
-        const changes = diff(scopedBase, spec, {
-            nodes: MatchingStrategy.byPath,
-            edges: MatchingStrategy.byEdgeIdentity,
-            nodeConflict: (node) => normalized.nodeConflictByPath.get(node.path.raw),
-            edgeConflict: (edge) => normalized.edgeConflictByKey.get(toEdgeKey(edge)),
-            ignoredProperties: SYSTEM_PROPERTY_KEYS,
-        });
-        const patch = toPatchInput(setAliases(reconcileChanges(changes, {
-            defaultStrategy: normalized.policy.onConflict,
-            removed: normalized.policy.onRemoved,
-            ...(normalized.policy.onUntracked !== undefined
-                ? { untracked: normalized.policy.onUntracked }
-                : {}),
-        }), spec));
-        if (normalized.dryRun)
-            return dryRunResult(patch, existingNodes);
-        if (isPatchEmpty(patch))
-            return emptyApplyResult(patch, existingNodes);
-        return applyResult(patch, existingNodes, await commit(patch));
-    };
-}
-function readInput(input) {
-    const edgeSelector = edgeReadSelector(input);
-    return {
-        roots: [...input.scope.roots],
-        depth: input.scope.depth,
-        ...(edgeSelector !== undefined ? { edges: edgeSelector } : {}),
-    };
-}
-function edgeReadSelector(input) {
-    if (input.spec.edges.length === 0 && input.policy.onRemoved.edges === 'preserve')
-        return undefined;
-    if (input.policy.onRemoved.edges !== 'preserve')
-        return { direction: 'both' };
-    return {
-        direction: 'both',
-        ...(input.specEdgeClasses.length > 0 ? { classes: input.specEdgeClasses } : {}),
-    };
-}
-//# sourceMappingURL=execute.js.map

package/dist/graph/reconcile/execute.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"execute.js","sourceRoot":"","sources":["../../../src/graph/reconcile/execute.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,IAAI,EACJ,KAAK,EACL,gBAAgB,EAChB,SAAS,IAAI,gBAAgB,EAC7B,UAAU,EACV,oBAAoB,EACpB,SAAS,GACV,MAAM,yBAAyB,CAAA;AAMhC,OAAO,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAA;AACxD,OAAO,EACL,WAAW,EACX,YAAY,EACZ,gBAAgB,EAChB,YAAY,EACZ,YAAY,GACb,MAAM,aAAa,CAAA;AACpB,OAAO,EACL,2BAA2B,EAC3B,eAAe,EACf,0BAA0B,GAC3B,MAAM,YAAY,CAAA;AAKnB,MAAM,UAAU,aAAa,CAAC,IAAU,EAAE,MAAc;IACtD,OAAO,KAAK,EAAE,KAAK,EAA4B,EAAE;QAC/C,MAAM,UAAU,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAA;QACjD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAA;QAClD,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAA;QACrC,2BAA2B,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,CAAA;QAElD,MAAM,UAAU,GAAG,eAAe,CAAC,IAAI,EAAE,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,YAAY,CAAC,CAAA;QACnF,MAAM,aAAa,GAAG,0BAA0B,CAAC,IAAI,EAAE,UAAU,CAAC,aAAa,CAAC,CAAA;QAChF,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC;YAC1B,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,KAAK;YAC5B,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,KAAK;SAC7B,CAAC,CAAA;QAEF,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE;YACrC,KAAK,EAAE,gBAAgB,CAAC,MAAM;YAC9B,KAAK,EAAE,gBAAgB,CAAC,cAAc;YACtC,YAAY,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;YACxE,YAAY,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACzE,iBAAiB,EAAE,oBAAoB;SACnB,CAAC,CAAA;QAEvB,MAAM,KAAK,GAAG,YAAY,CACxB,UAAU,CACR,gBAAgB,CAAC,OAAO,EAAE;YACxB,eAAe,EAAE,UAAU,CAAC,MAAM,CAAC,UAAU;YAC7C,OAAO,EAAE,UAAU,CAAC,MAAM,CAAC,SAAS;YACpC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,WAAW,KAAK,SAAS;gBAC7C,CAAC,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,MAAM,CAAC,WAAW,EAAE;gBAC9C,CAAC,CAAC,EAAE,CAAC;SACR,CAAC,EACF,IAAI,CACL,CACF,CAAA;QAED,IAAI,UAAU,CAAC,MAAM;YAAE,OAAO,YAAY,CAAC,KAAK,EAAE,aAAa,CAAC,CAAA;QAChE,IAAI,YAAY,CAAC,KAAK,CAAC;YAAE,OAAO,gBAAgB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAA;QACtE,OAAO,WAAW,CAAC,KAAK,EAAE,aAAa,EAAE,MAAM,MAAM,CAAC,KAAK,CAAC,CAAC,CAAA;IAC/D,CAAC,CAAA;AACH,CAAC;AAED,SAAS,SAAS,CAAC,KAAiD;IAClE,MAAM,YAAY,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAA;IAC5C,OAAO;QACL,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC;QAC7B,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK;QACxB,GAAG,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC/D,CAAA;AACH,CAAC;AAED,SAAS,gBAAgB,CACvB,KAAiD;IAEjD,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,KAAK,UAAU;QAAE,OAAO,SAAS,CAAA;IAClG,IAAI,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,KAAK,UAAU;QAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAuB,CAAA;IAClG,OAAO;QACL,SAAS,EAAE,MAAM;QACjB,GAAG,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC3D,CAAA;AACxB,CAAC"}

package/dist/graph/reconcile/index.d.ts

@@ -1,5 +0,0 @@
-export { makeReconcile } from './execute.js';
-export { DEFAULT_CLIENT_RECONCILE_POLICY } from './input.js';
-export type { NormalizedReconcileEdge, NormalizedReconcileInput, NormalizedReconcileNode, NormalizedReconcileScope, ReconcileEdgeInput, ReconcileFn, ReconcileInput, ReconcileNodeInput, ReconcilePolicyInput, ReconcileScopeInput, ReconcileSpecInput, } from './input.js';
-export type { ReconcileResult } from './result.js';
-//# sourceMappingURL=index.d.ts.map

package/dist/graph/reconcile/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/graph/reconcile/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AAC5C,OAAO,EAAE,+BAA+B,EAAE,MAAM,YAAY,CAAA;AAC5D,YAAY,EACV,uBAAuB,EACvB,wBAAwB,EACxB,uBAAuB,EACvB,wBAAwB,EACxB,kBAAkB,EAClB,WAAW,EACX,cAAc,EACd,kBAAkB,EAClB,oBAAoB,EACpB,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,YAAY,CAAA;AACnB,YAAY,EAAE,eAAe,EAAE,MAAM,aAAa,CAAA"}

package/dist/graph/reconcile/index.js

@@ -1,3 +0,0 @@
-export { makeReconcile } from './execute.js';
-export { DEFAULT_CLIENT_RECONCILE_POLICY } from './input.js';
-//# sourceMappingURL=index.js.map

package/dist/graph/reconcile/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/graph/reconcile/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AAC5C,OAAO,EAAE,+BAA+B,EAAE,MAAM,YAAY,CAAA"}