@scrolled/nav-graph 0.1.0-dev.2dfa085

package/dist/json/index.d.ts

@@ -0,0 +1,3 @@
+export { toJSON } from './toJSON';
+export type { NavGraphJSON } from './toJSON';
+//# sourceMappingURL=index.d.ts.map

package/dist/json/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/json/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,YAAY,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC"}

package/dist/json/index.js

@@ -0,0 +1,2 @@
+export { toJSON } from './toJSON';
+//# sourceMappingURL=index.js.map

package/dist/json/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/json/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC"}

package/dist/json/toJSON.d.ts

@@ -0,0 +1,5 @@
+import type { NavGraph } from '../compile/compileGraph';
+import type { NavGraphSource } from '../ir/types';
+export type NavGraphJSON = NavGraphSource;
+export declare function toJSON(graph: NavGraph): NavGraphJSON;
+//# sourceMappingURL=toJSON.d.ts.map

package/dist/json/toJSON.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"toJSON.d.ts","sourceRoot":"","sources":["../../src/json/toJSON.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAElD,MAAM,MAAM,YAAY,GAAG,cAAc,CAAC;AAE1C,wBAAgB,MAAM,CAAC,KAAK,EAAE,QAAQ,GAAG,YAAY,CAIpD"}

package/dist/json/toJSON.js

@@ -0,0 +1,10 @@
+// Portability: serialize a compiled NavGraph back to its plain authored source.
+// The JSON contract IS NavGraphSource — no extra runtime fields leak out, so
+// the artifact can be re-loaded by a non-TS target and round-tripped through
+// `navGraphSourceSchema.parse(...) → compileGraph(...)` without information loss.
+export function toJSON(graph) {
+    // `graph.source` was produced by Zod's parser, so it's already a clean object
+    // tree. Re-emitting it without mutation keeps the round-trip contract honest.
+    return graph.source;
+}
+//# sourceMappingURL=toJSON.js.map

package/dist/json/toJSON.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"toJSON.js","sourceRoot":"","sources":["../../src/json/toJSON.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,6EAA6E;AAC7E,6EAA6E;AAC7E,kFAAkF;AAOlF,MAAM,UAAU,MAAM,CAAC,KAAe;IACpC,8EAA8E;IAC9E,8EAA8E;IAC9E,OAAO,KAAK,CAAC,MAAM,CAAC;AACtB,CAAC"}

package/dist/path/eligibility.d.ts

@@ -0,0 +1,10 @@
+import type { TravelEdge } from '../ir/types';
+export interface UserCapability {
+    level?: number;
+    mesos?: number;
+    questsCompleted?: ReadonlySet<number>;
+    /** itemId → quantity held. */
+    itemsHeld?: ReadonlyMap<number, number>;
+}
+export declare function eligibilityFilter(state: UserCapability): (edge: TravelEdge) => boolean;
+//# sourceMappingURL=eligibility.d.ts.map

package/dist/path/eligibility.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"eligibility.d.ts","sourceRoot":"","sources":["../../src/path/eligibility.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAe,UAAU,EAAE,MAAM,aAAa,CAAC;AAE3D,MAAM,WAAW,cAAc;IAC7B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,eAAe,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACtC,8BAA8B;IAC9B,SAAS,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACzC;AAED,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,cAAc,GACpB,CAAC,IAAI,EAAE,UAAU,KAAK,OAAO,CAK/B"}

package/dist/path/eligibility.js

@@ -0,0 +1,39 @@
+// User-declared state → an eligibility predicate over edges.
+//
+// MVP semantics:
+//   - meso: "can you afford a single use" (not cumulative budget across a trip).
+//     Cumulative meso cost is a future weighted-cost-model concern.
+//   - item(consumed:true): requires `quantity` (or 1) held; not deducted across
+//     steps either, for the same reason.
+//   - quest: must appear in questsCompleted.
+//   - level: user.level must be ≥ min.
+//
+// Any missing field on UserCapability is treated as "not declared" → the
+// corresponding requirement passes by default. With nothing declared, every
+// edge is eligible — this matches FR6 ("no state declared → all edges eligible").
+export function eligibilityFilter(state) {
+    return (edge) => {
+        if (!edge.requirements || edge.requirements.length === 0)
+            return true;
+        return edge.requirements.every((req) => satisfies(req, state));
+    };
+}
+function satisfies(req, state) {
+    switch (req.kind) {
+        case 'meso':
+            return state.mesos === undefined || state.mesos >= req.amount;
+        case 'level':
+            return state.level === undefined || state.level >= req.min;
+        case 'quest':
+            return (state.questsCompleted === undefined ||
+                state.questsCompleted.has(req.questId));
+        case 'item': {
+            if (state.itemsHeld === undefined)
+                return true;
+            const held = state.itemsHeld.get(req.itemId) ?? 0;
+            const needed = req.quantity ?? 1;
+            return held >= needed;
+        }
+    }
+}
+//# sourceMappingURL=eligibility.js.map

package/dist/path/eligibility.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"eligibility.js","sourceRoot":"","sources":["../../src/path/eligibility.ts"],"names":[],"mappings":"AAAA,6DAA6D;AAC7D,EAAE;AACF,iBAAiB;AACjB,iFAAiF;AACjF,oEAAoE;AACpE,gFAAgF;AAChF,yCAAyC;AACzC,6CAA6C;AAC7C,uCAAuC;AACvC,EAAE;AACF,yEAAyE;AACzE,4EAA4E;AAC5E,kFAAkF;AAYlF,MAAM,UAAU,iBAAiB,CAC/B,KAAqB;IAErB,OAAO,CAAC,IAAI,EAAE,EAAE;QACd,IAAI,CAAC,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACtE,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,GAAgB,EAAE,KAAqB;IACxD,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,MAAM;YACT,OAAO,KAAK,CAAC,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC;QAChE,KAAK,OAAO;YACV,OAAO,KAAK,CAAC,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,KAAK,IAAI,GAAG,CAAC,GAAG,CAAC;QAC7D,KAAK,OAAO;YACV,OAAO,CACL,KAAK,CAAC,eAAe,KAAK,SAAS;gBACnC,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CACvC,CAAC;QACJ,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS;gBAAE,OAAO,IAAI,CAAC;YAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAClD,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,IAAI,CAAC,CAAC;YACjC,OAAO,IAAI,IAAI,MAAM,CAAC;QACxB,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/path/findPath.d.ts

@@ -0,0 +1,16 @@
+import type { NavGraph } from '../compile/compileGraph';
+import type { NodeId, TravelEdge } from '../ir/types';
+export interface PathResult {
+    status: 'found' | 'unreachable' | 'unreachable-when-filtered';
+    steps: TravelEdge[];
+    fallback?: {
+        steps: TravelEdge[];
+        /** Indices into `fallback.steps` whose eligibility predicate failed. */
+        blocked: number[];
+    };
+}
+export interface FindPathOptions {
+    eligible?: (edge: TravelEdge) => boolean;
+}
+export declare function findPath(graph: NavGraph, from: NodeId, to: NodeId, opts?: FindPathOptions): PathResult;
+//# sourceMappingURL=findPath.d.ts.map

package/dist/path/findPath.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findPath.d.ts","sourceRoot":"","sources":["../../src/path/findPath.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEtD,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,OAAO,GAAG,aAAa,GAAG,2BAA2B,CAAC;IAC9D,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,QAAQ,CAAC,EAAE;QACT,KAAK,EAAE,UAAU,EAAE,CAAC;QACpB,wEAAwE;QACxE,OAAO,EAAE,MAAM,EAAE,CAAC;KACnB,CAAC;CACH;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,KAAK,OAAO,CAAC;CAC1C;AAED,wBAAgB,QAAQ,CACtB,KAAK,EAAE,QAAQ,EACf,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,EACV,IAAI,GAAE,eAAoB,GACzB,UAAU,CAyBZ"}

package/dist/path/findPath.js

@@ -0,0 +1,78 @@
+// MVP pathfinding: fewest-hops BFS over the compiled adjacency.
+//
+// When an eligibility predicate is supplied:
+//   1. Run BFS with the predicate pruning candidate edges.
+//   2. If the destination is reachable that way, return `status: 'found'`.
+//   3. Otherwise run BFS again *without* the filter. If a path exists, return
+//      `status: 'unreachable-when-filtered'` with the unfiltered path as
+//      `fallback` and the step indices the filter blocked. This is FR7 — the
+//      app never has to surface a blank "no path" state when the graph itself
+//      is connected.
+//   4. If the unfiltered BFS also fails, return `status: 'unreachable'`.
+export function findPath(graph, from, to, opts = {}) {
+    assertNodeKnown(graph, from, 'from');
+    assertNodeKnown(graph, to, 'to');
+    if (from === to)
+        return { status: 'found', steps: [] };
+    const filtered = opts.eligible ? bfs(graph, from, to, opts.eligible) : null;
+    if (filtered)
+        return { status: 'found', steps: filtered };
+    const unfiltered = bfs(graph, from, to);
+    if (!unfiltered)
+        return { status: 'unreachable', steps: [] };
+    if (!opts.eligible) {
+        return { status: 'found', steps: unfiltered };
+    }
+    const blocked = [];
+    unfiltered.forEach((edge, i) => {
+        if (!opts.eligible(edge))
+            blocked.push(i);
+    });
+    return {
+        status: 'unreachable-when-filtered',
+        steps: [],
+        fallback: { steps: unfiltered, blocked },
+    };
+}
+function assertNodeKnown(graph, id, label) {
+    if (!graph.nodes.has(id)) {
+        throw new Error(`findPath ${label} references undeclared node "${id}".`);
+    }
+}
+function bfs(graph, from, to, eligible) {
+    const cameFrom = new Map();
+    const visited = new Set([from]);
+    const queue = [from];
+    while (queue.length > 0) {
+        const node = queue.shift();
+        if (node === to)
+            return reconstruct(cameFrom, from, to);
+        const out = graph.adjacency.get(node) ?? [];
+        for (const edge of out) {
+            if (eligible && !eligible(edge))
+                continue;
+            if (visited.has(edge.to))
+                continue;
+            visited.add(edge.to);
+            cameFrom.set(edge.to, edge);
+            queue.push(edge.to);
+        }
+    }
+    return null;
+}
+function reconstruct(cameFrom, from, to) {
+    const steps = [];
+    let cursor = to;
+    while (cursor !== from) {
+        const edge = cameFrom.get(cursor);
+        if (!edge) {
+            // Defensive: BFS only stores cameFrom for reachable nodes, so this
+            // branch is unreachable in practice — but typing the lookup demands it.
+            throw new Error(`Path reconstruction broke at "${cursor}".`);
+        }
+        steps.push(edge);
+        cursor = edge.from;
+    }
+    return steps.reverse();
+}
+//# sourceMappingURL=findPath.js.map

package/dist/path/findPath.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findPath.js","sourceRoot":"","sources":["../../src/path/findPath.ts"],"names":[],"mappings":"AAAA,gEAAgE;AAChE,EAAE;AACF,6CAA6C;AAC7C,2DAA2D;AAC3D,2EAA2E;AAC3E,8EAA8E;AAC9E,yEAAyE;AACzE,6EAA6E;AAC7E,8EAA8E;AAC9E,qBAAqB;AACrB,yEAAyE;AAmBzE,MAAM,UAAU,QAAQ,CACtB,KAAe,EACf,IAAY,EACZ,EAAU,EACV,OAAwB,EAAE;IAE1B,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IACrC,eAAe,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;IAEjC,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAEvD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC5E,IAAI,QAAQ;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;IAE1D,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;IACxC,IAAI,CAAC,UAAU;QAAE,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAE7D,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACnB,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IAChD,CAAC;IAED,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAC7B,IAAI,CAAC,IAAI,CAAC,QAAS,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IACH,OAAO;QACL,MAAM,EAAE,2BAA2B;QACnC,KAAK,EAAE,EAAE;QACT,QAAQ,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE;KACzC,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,KAAe,EAAE,EAAU,EAAE,KAAoB;IACxE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,YAAY,KAAK,gCAAgC,EAAE,IAAI,CAAC,CAAC;IAC3E,CAAC;AACH,CAAC;AAED,SAAS,GAAG,CACV,KAAe,EACf,IAAY,EACZ,EAAU,EACV,QAAwC;IAExC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IACxC,MAAM,KAAK,GAAa,CAAC,IAAI,CAAC,CAAC;IAE/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,IAAI,IAAI,KAAK,EAAE;YAAE,OAAO,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;QAExD,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC1C,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YACnC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC5B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAClB,QAAiC,EACjC,IAAY,EACZ,EAAU;IAEV,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,IAAI,MAAM,GAAW,EAAE,CAAC;IACxB,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,mEAAmE;YACnE,wEAAwE;YACxE,MAAM,IAAI,KAAK,CAAC,iCAAiC,MAAM,IAAI,CAAC,CAAC;QAC/D,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IACD,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AACzB,CAAC"}

package/dist/path/index.d.ts

@@ -0,0 +1,5 @@
+export { eligibilityFilter } from './eligibility';
+export type { UserCapability } from './eligibility';
+export { findPath } from './findPath';
+export type { FindPathOptions, PathResult } from './findPath';
+//# sourceMappingURL=index.d.ts.map

package/dist/path/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/path/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAClD,YAAY,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,YAAY,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}

package/dist/path/index.js

@@ -0,0 +1,3 @@
+export { eligibilityFilter } from './eligibility';
+export { findPath } from './findPath';
+//# sourceMappingURL=index.js.map

package/dist/path/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/path/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAElD,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC"}

package/package.json

@@ -0,0 +1,75 @@
+{
+  "name": "@scrolled/nav-graph",
+  "version": "0.1.0-dev.2dfa085",
+  "type": "module",
+  "description": "Framework-agnostic graph core: IR types + Zod schema, an authoring DSL, a compiler (IR → runtime adjacency), and pathfinding (BFS + eligibility). The engine behind Scrolled Navigator; usable standalone in Node and the browser.",
+  "license": "Apache-2.0",
+  "author": "Nicholas Thomson (RedbackThomson)",
+  "homepage": "https://github.com/RedbackThomson/scrolled/tree/main/packages/nav-graph",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/RedbackThomson/scrolled.git",
+    "directory": "packages/nav-graph"
+  },
+  "bugs": "https://github.com/RedbackThomson/scrolled/issues",
+  "keywords": [
+    "graph",
+    "directed-graph",
+    "pathfinding",
+    "bfs",
+    "navigation",
+    "navigator",
+    "scrolled"
+  ],
+  "engines": {
+    "node": ">=20"
+  },
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE"
+  ],
+  "exports": {
+    ".": "./src/index.ts",
+    "./ir": "./src/ir/index.ts",
+    "./dsl": "./src/dsl/index.ts"
+  },
+  "publishConfig": {
+    "access": "public",
+    "main": "./dist/index.js",
+    "module": "./dist/index.js",
+    "types": "./dist/index.d.ts",
+    "exports": {
+      ".": {
+        "types": "./dist/index.d.ts",
+        "import": "./dist/index.js"
+      },
+      "./ir": {
+        "types": "./dist/ir/index.d.ts",
+        "import": "./dist/ir/index.js"
+      },
+      "./dsl": {
+        "types": "./dist/dsl/index.d.ts",
+        "import": "./dist/dsl/index.js"
+      }
+    }
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.build.json",
+    "clean": "rm -rf dist LICENSE",
+    "export": "vite-node src/cli/export.ts",
+    "test": "vitest run --passWithNoTests",
+    "typecheck": "tsc --noEmit",
+    "lint": "eslint .",
+    "prepublishOnly": "pnpm run typecheck && pnpm run test && pnpm run clean && pnpm run build && cp ../../LICENSE LICENSE"
+  },
+  "dependencies": {
+    "zod": "^3.23.8"
+  },
+  "devDependencies": {
+    "@types/node": "^22.7.4",
+    "vite": "^5.4.8",
+    "vite-node": "^2.1.2",
+    "vitest": "^2.1.2"
+  }
+}