@manifesto-ai/core 2.6.0 → 2.7.1

package/dist/evaluator/context.d.ts

@@ -1,62 +0,0 @@
-import type { Snapshot } from "../schema/snapshot.js";
-import type { DomainSchema } from "../schema/domain.js";
-import { type TraceContext } from "../schema/trace.js";
-/**
- * Evaluation context for expressions and flows
- */
-export type EvalContext = {
-    /**
-     * Current snapshot state
-     */
-    readonly snapshot: Snapshot;
-    /**
-     * Domain schema
-     */
-    readonly schema: DomainSchema;
-    /**
-     * Current action being processed (if any)
-     */
-    readonly currentAction: string | null;
-    /**
-     * Current node path in the flow (for tracing)
-     */
-    readonly nodePath: string;
-    /**
-     * Intent ID for the current intent (for re-entry safety)
-     */
-    readonly intentId?: string;
-    /**
-     * UUID generator counter (for deterministic UUID generation)
-     */
-    uuidCounter?: number;
-    /**
-     * Trace context for deterministic trace ID generation
-     */
-    readonly trace: TraceContext;
-    /**
-     * Collection context variables (for filter, map, find, etc.)
-     */
-    readonly $item?: unknown;
-    readonly $index?: number;
-    readonly $array?: unknown[];
-};
-/**
- * Create a new evaluation context
- *
- * @param timestampOrTrace - Required timestamp or TraceContext for deterministic tracing.
- *                           MUST be provided by Host via HostContext.now to ensure determinism.
- */
-export declare function createContext(snapshot: Snapshot, schema: DomainSchema, currentAction: string | null, nodePath: string, intentId: string | undefined, timestampOrTrace: number | TraceContext): EvalContext;
-/**
- * Create context with collection variables for filter/map/find/etc.
- */
-export declare function withCollectionContext(ctx: EvalContext, item: unknown, index: number, array: unknown[]): EvalContext;
-/**
- * Update context with new snapshot
- */
-export declare function withSnapshot(ctx: EvalContext, snapshot: Snapshot): EvalContext;
-/**
- * Update context with new node path
- */
-export declare function withNodePath(ctx: EvalContext, nodePath: string): EvalContext;
-//# sourceMappingURL=context.d.ts.map

package/dist/evaluator/context.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"context.d.ts","sourceRoot":"","sources":["../../src/evaluator/context.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACtD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,KAAK,YAAY,EAAsB,MAAM,oBAAoB,CAAC;AAE3E;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG;IACxB;;OAEG;IACH,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAE5B;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAE9B;;OAEG;IACH,QAAQ,CAAC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAEtC;;OAEG;IACH,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAE1B;;OAEG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAE3B;;OAEG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IAErB;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;IAE7B;;OAEG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;IACzB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC;CAC7B,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,QAAQ,EAAE,QAAQ,EAClB,MAAM,EAAE,YAAY,EACpB,aAAa,EAAE,MAAM,GAAG,IAAI,EAC5B,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,gBAAgB,EAAE,MAAM,GAAG,YAAY,GACtC,WAAW,CAYb;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,GAAG,EAAE,WAAW,EAChB,IAAI,EAAE,OAAO,EACb,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,OAAO,EAAE,GACf,WAAW,CAOb;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,GAAG,WAAW,CAE9E;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,WAAW,CAE5E"}

package/dist/evaluator/context.js

@@ -1,44 +0,0 @@
-import { createTraceContext } from "../schema/trace.js";
-/**
- * Create a new evaluation context
- *
- * @param timestampOrTrace - Required timestamp or TraceContext for deterministic tracing.
- *                           MUST be provided by Host via HostContext.now to ensure determinism.
- */
-export function createContext(snapshot, schema, currentAction, nodePath, intentId, timestampOrTrace) {
-    return {
-        snapshot,
-        schema,
-        currentAction,
-        nodePath,
-        intentId,
-        uuidCounter: 0,
-        trace: typeof timestampOrTrace === "object"
-            ? timestampOrTrace
-            : createTraceContext(timestampOrTrace),
-    };
-}
-/**
- * Create context with collection variables for filter/map/find/etc.
- */
-export function withCollectionContext(ctx, item, index, array) {
-    return {
-        ...ctx,
-        $item: item,
-        $index: index,
-        $array: array,
-    };
-}
-/**
- * Update context with new snapshot
- */
-export function withSnapshot(ctx, snapshot) {
-    return { ...ctx, snapshot };
-}
-/**
- * Update context with new node path
- */
-export function withNodePath(ctx, nodePath) {
-    return { ...ctx, nodePath };
-}
-//# sourceMappingURL=context.js.map

package/dist/evaluator/context.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"context.js","sourceRoot":"","sources":["../../src/evaluator/context.ts"],"names":[],"mappings":"AAEA,OAAO,EAAqB,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAiD3E;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC3B,QAAkB,EAClB,MAAoB,EACpB,aAA4B,EAC5B,QAAgB,EAChB,QAA4B,EAC5B,gBAAuC;IAEvC,OAAO;QACL,QAAQ;QACR,MAAM;QACN,aAAa;QACb,QAAQ;QACR,QAAQ;QACR,WAAW,EAAE,CAAC;QACd,KAAK,EAAE,OAAO,gBAAgB,KAAK,QAAQ;YACzC,CAAC,CAAC,gBAAgB;YAClB,CAAC,CAAC,kBAAkB,CAAC,gBAAgB,CAAC;KACzC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACnC,GAAgB,EAChB,IAAa,EACb,KAAa,EACb,KAAgB;IAEhB,OAAO;QACL,GAAG,GAAG;QACN,KAAK,EAAE,IAAI;QACX,MAAM,EAAE,KAAK;QACb,MAAM,EAAE,KAAK;KACd,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,GAAgB,EAAE,QAAkB;IAC/D,OAAO,EAAE,GAAG,GAAG,EAAE,QAAQ,EAAE,CAAC;AAC9B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,GAAgB,EAAE,QAAgB;IAC7D,OAAO,EAAE,GAAG,GAAG,EAAE,QAAQ,EAAE,CAAC;AAC9B,CAAC"}

package/dist/evaluator/dag.d.ts

@@ -1,30 +0,0 @@
-import type { ComputedSpec } from "../schema/computed.js";
-import type { SemanticPath } from "../schema/common.js";
-import type { Result } from "../schema/common.js";
-import type { ValidationError } from "../schema/result.js";
-/**
- * Dependency graph for computed values
- */
-export type DependencyGraph = {
-    readonly nodes: readonly SemanticPath[];
-    readonly edges: ReadonlyMap<SemanticPath, readonly SemanticPath[]>;
-};
-/**
- * Build a dependency graph from ComputedSpec
- */
-export declare function buildDependencyGraph(computed: ComputedSpec): DependencyGraph;
-/**
- * Topological sort using Kahn's algorithm
- * Returns sorted order or error if cycles detected
- */
-export declare function topologicalSort(graph: DependencyGraph): Result<SemanticPath[], ValidationError>;
-/**
- * Detect cycles in the dependency graph
- * Returns array of cycle paths or null if no cycles
- */
-export declare function detectCycles(graph: DependencyGraph): SemanticPath[][] | null;
-/**
- * Get all dependencies (transitive) for a given node
- */
-export declare function getTransitiveDeps(graph: DependencyGraph, node: SemanticPath): Set<SemanticPath>;
-//# sourceMappingURL=dag.d.ts.map

package/dist/evaluator/dag.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"dag.d.ts","sourceRoot":"","sources":["../../src/evaluator/dag.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAG3D;;GAEG;AACH,MAAM,MAAM,eAAe,GAAG;IAC5B,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAC;IACxC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,YAAY,EAAE,SAAS,YAAY,EAAE,CAAC,CAAC;CACpE,CAAC;AAEF;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,YAAY,GAAG,eAAe,CAW5E;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,CAAC,YAAY,EAAE,EAAE,eAAe,CAAC,CAuD/F;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,eAAe,GAAG,YAAY,EAAE,EAAE,GAAG,IAAI,CAqC5E;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,eAAe,EACtB,IAAI,EAAE,YAAY,GACjB,GAAG,CAAC,YAAY,CAAC,CAanB"}

package/dist/evaluator/dag.js

@@ -1,121 +0,0 @@
-import { ok, err } from "../schema/common.js";
-/**
- * Build a dependency graph from ComputedSpec
- */
-export function buildDependencyGraph(computed) {
-    const nodes = Object.keys(computed.fields);
-    const edges = new Map();
-    for (const [path, spec] of Object.entries(computed.fields)) {
-        // Filter deps to only include other computed fields
-        const computedDeps = spec.deps.filter((dep) => dep in computed.fields);
-        edges.set(path, computedDeps);
-    }
-    return { nodes, edges };
-}
-/**
- * Topological sort using Kahn's algorithm
- * Returns sorted order or error if cycles detected
- */
-export function topologicalSort(graph) {
-    const inDegree = new Map();
-    const adjacency = new Map();
-    // Initialize in-degree and adjacency list
-    for (const node of graph.nodes) {
-        inDegree.set(node, 0);
-        adjacency.set(node, []);
-    }
-    // Build reverse edges (who depends on whom)
-    for (const [node, deps] of graph.edges) {
-        for (const dep of deps) {
-            if (adjacency.has(dep)) {
-                adjacency.get(dep).push(node);
-            }
-            inDegree.set(node, (inDegree.get(node) ?? 0) + 1);
-        }
-    }
-    // Find all nodes with no dependencies
-    const queue = [];
-    for (const [node, degree] of inDegree) {
-        if (degree === 0) {
-            queue.push(node);
-        }
-    }
-    const sorted = [];
-    while (queue.length > 0) {
-        const node = queue.shift();
-        sorted.push(node);
-        // Reduce in-degree of dependent nodes
-        for (const dependent of adjacency.get(node) ?? []) {
-            const newDegree = (inDegree.get(dependent) ?? 1) - 1;
-            inDegree.set(dependent, newDegree);
-            if (newDegree === 0) {
-                queue.push(dependent);
-            }
-        }
-    }
-    // If not all nodes are sorted, there's a cycle
-    if (sorted.length !== graph.nodes.length) {
-        const remaining = graph.nodes.filter((n) => !sorted.includes(n));
-        return err({
-            code: "V-002",
-            message: `Cyclic dependency detected in computed fields: ${remaining.join(", ")}`,
-            path: remaining[0],
-        });
-    }
-    return ok(sorted);
-}
-/**
- * Detect cycles in the dependency graph
- * Returns array of cycle paths or null if no cycles
- */
-export function detectCycles(graph) {
-    const visited = new Set();
-    const recursionStack = new Set();
-    const cycles = [];
-    function dfs(node, path) {
-        visited.add(node);
-        recursionStack.add(node);
-        const deps = graph.edges.get(node) ?? [];
-        for (const dep of deps) {
-            if (!visited.has(dep)) {
-                if (dfs(dep, [...path, dep])) {
-                    return true;
-                }
-            }
-            else if (recursionStack.has(dep)) {
-                // Found a cycle
-                const cycleStart = path.indexOf(dep);
-                if (cycleStart !== -1) {
-                    cycles.push([...path.slice(cycleStart), dep]);
-                }
-                else {
-                    cycles.push([...path, dep]);
-                }
-            }
-        }
-        recursionStack.delete(node);
-        return false;
-    }
-    for (const node of graph.nodes) {
-        if (!visited.has(node)) {
-            dfs(node, [node]);
-        }
-    }
-    return cycles.length > 0 ? cycles : null;
-}
-/**
- * Get all dependencies (transitive) for a given node
- */
-export function getTransitiveDeps(graph, node) {
-    const deps = new Set();
-    const queue = [...(graph.edges.get(node) ?? [])];
-    while (queue.length > 0) {
-        const dep = queue.shift();
-        if (!deps.has(dep)) {
-            deps.add(dep);
-            queue.push(...(graph.edges.get(dep) ?? []));
-        }
-    }
-    return deps;
-}
-//# sourceMappingURL=dag.js.map

package/dist/evaluator/dag.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dag.js","sourceRoot":"","sources":["../../src/evaluator/dag.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,qBAAqB,CAAC;AAU9C;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,QAAsB;IACzD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgC,CAAC;IAEtD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3D,oDAAoD;QACpD,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;QACvE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,KAAsB;IACpD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;IACjD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAgC,CAAC;IAE1D,0CAA0C;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACtB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAC1B,CAAC;IAED,4CAA4C;IAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACvC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvB,SAAS,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACtC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAmB,EAAE,CAAC;IAElC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAElB,sCAAsC;QACtC,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAClD,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACrD,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACnC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,+CAA+C;IAC/C,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,OAAO,GAAG,CAAC;YACT,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,kDAAkD,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YACjF,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;SACnB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAsB;IACjD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;IACxC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAgB,CAAC;IAC/C,MAAM,MAAM,GAAqB,EAAE,CAAC;IAEpC,SAAS,GAAG,CAAC,IAAkB,EAAE,IAAoB;QACnD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEzB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACzC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;oBAC7B,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;iBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnC,gBAAgB;gBAChB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBACrC,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;oBACtB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBAChD,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5B,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAsB,EACtB,IAAkB;IAElB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAgB,CAAC;IACrC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAEjD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/evaluator/expr.d.ts

@@ -1,11 +0,0 @@
-import type { ExprNode } from "../schema/expr.js";
-import type { ErrorValue } from "../schema/snapshot.js";
-import type { Result } from "../schema/common.js";
-import { type EvalContext } from "./context.js";
-export type ExprResult = Result<unknown, ErrorValue>;
-/**
- * Evaluate an expression node
- * All expressions are pure and total (always return a value or error)
- */
-export declare function evaluateExpr(expr: ExprNode, ctx: EvalContext): ExprResult;
-//# sourceMappingURL=expr.d.ts.map

package/dist/evaluator/expr.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"expr.d.ts","sourceRoot":"","sources":["../../src/evaluator/expr.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAIlD,OAAO,EAAE,KAAK,WAAW,EAAyB,MAAM,cAAc,CAAC;AAEvE,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AAErD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,WAAW,GAAG,UAAU,CAgLzE"}