@framers/agentos 0.1.68 → 0.1.70

package/dist/orchestration/runtime/StateManager.js

@@ -0,0 +1,243 @@
+/**
+ * @file StateManager.ts
+ * @description Manages the mutable {@link GraphState} partitions for an active graph run.
+ *
+ * Responsibilities:
+ *  - Creating a clean initial state from caller-supplied input.
+ *  - Applying node output patches to the `scratch` partition, honoring per-field
+ *    {@link StateReducers} for deterministic conflict resolution.
+ *  - Applying node output patches to the `artifacts` partition (last-write-wins by default).
+ *  - Merging states produced by parallel branches using the same reducer logic.
+ *  - Tracking the ordered list of visited node ids and the global iteration counter.
+ *
+ * `StateManager` is intentionally stateless between calls — it receives the current
+ * {@link GraphState} as an argument and returns a *new* object; it never mutates in place.
+ * This makes it straightforward to unit-test and safe to use in concurrent contexts.
+ */
+// ---------------------------------------------------------------------------
+// StateManager
+// ---------------------------------------------------------------------------
+/**
+ * Manages the {@link GraphState} partitions (`input`, `scratch`, `artifacts`,
+ * `memory`, `diagnostics`) for a single graph run.
+ *
+ * All methods return a *new* `GraphState` object; the original is never mutated.
+ *
+ * @example
+ * ```ts
+ * const manager = new StateManager({ 'scratch.messages': 'concat' });
+ * let state = manager.initialize({ prompt: 'Hello' });
+ * state = manager.updateScratch(state, { messages: ['first'] });
+ * state = manager.updateScratch(state, { messages: ['second'] });
+ * // state.scratch.messages === ['first', 'second']
+ * ```
+ */
+export class StateManager {
+    /**
+     * @param reducers - Field-level reducer configuration keyed by dot-notation paths
+     *                   (e.g. `'scratch.messages'`).  Determines how conflicting values
+     *                   are merged during {@link updateScratch} and {@link mergeParallelBranches}.
+     */
+    constructor(reducers) {
+        this.reducers = reducers;
+    }
+    // ---------------------------------------------------------------------------
+    // Public API
+    // ---------------------------------------------------------------------------
+    /**
+     * Create a clean initial {@link GraphState} from the caller-supplied `input` value.
+     *
+     * The `input` partition is frozen with {@link Object.freeze} so that no node can
+     * accidentally mutate it.  All other partitions start empty.
+     *
+     * @param input - Arbitrary value provided by the graph caller; becomes `state.input`.
+     * @returns A fully initialised `GraphState` ready for the first node execution.
+     */
+    initialize(input) {
+        return {
+            input: Object.freeze(input),
+            scratch: {},
+            memory: this.emptyMemoryView(),
+            artifacts: {},
+            diagnostics: this.emptyDiagnostics(),
+            currentNodeId: '',
+            visitedNodes: [],
+            iteration: 0,
+        };
+    }
+    /**
+     * Apply a `patch` to the `scratch` partition, honoring any registered reducers.
+     *
+     * For each key in `patch`:
+     *  - If a reducer is registered at `scratch.<key>` **and** the key already exists
+     *    in the current scratch, the reducer is called to merge the existing and incoming
+     *    values.
+     *  - Otherwise the incoming value simply overwrites (last-write-wins semantics).
+     *
+     * @param state - Current graph state (not mutated).
+     * @param patch - Partial scratch update emitted by a completed node.
+     * @returns New `GraphState` with the merged scratch partition.
+     */
+    updateScratch(state, patch) {
+        const newScratch = { ...state.scratch };
+        for (const [key, value] of Object.entries(patch)) {
+            const reducerKey = `scratch.${key}`;
+            const reducer = this.reducers[reducerKey];
+            if (reducer !== undefined && newScratch[key] !== undefined) {
+                // A reducer is configured and a prior value exists — merge them.
+                newScratch[key] = this.applyReducer(reducer, newScratch[key], value);
+            }
+            else {
+                // No reducer or no prior value — overwrite.
+                newScratch[key] = value;
+            }
+        }
+        return { ...state, scratch: newScratch };
+    }
+    /**
+     * Apply a `patch` to the `artifacts` partition using last-write-wins semantics.
+     *
+     * Artifact fields are intended for caller-facing outputs and are not subject to
+     * reducer logic in this method.  If you need reducer-aware artifact merging, use
+     * {@link mergeParallelBranches} instead.
+     *
+     * @param state - Current graph state (not mutated).
+     * @param patch - Partial artifacts update emitted by a completed node.
+     * @returns New `GraphState` with the updated artifacts partition.
+     */
+    updateArtifacts(state, patch) {
+        return {
+            ...state,
+            artifacts: { ...state.artifacts, ...patch },
+        };
+    }
+    /**
+     * Record that execution has entered `nodeId`.
+     *
+     * Updates `currentNodeId`, appends to `visitedNodes`, and increments `iteration`.
+     *
+     * @param state  - Current graph state (not mutated).
+     * @param nodeId - Id of the node that is about to execute.
+     * @returns New `GraphState` reflecting the visit.
+     */
+    recordNodeVisit(state, nodeId) {
+        return {
+            ...state,
+            currentNodeId: nodeId,
+            visitedNodes: [...state.visitedNodes, nodeId],
+            iteration: state.iteration + 1,
+        };
+    }
+    /**
+     * Merge the `scratch` partitions of one or more parallel branch states back into
+     * a single `GraphState`.
+     *
+     * The algorithm walks every key present in any branch's scratch object and applies
+     * the registered reducer for that key (if any) against the accumulator.  When no
+     * reducer is registered, the last branch's value wins.
+     *
+     * The `artifacts`, `memory`, `diagnostics`, `visitedNodes`, and `iteration` fields
+     * of `baseState` are preserved unchanged — the caller is responsible for merging
+     * those separately if needed.
+     *
+     * @param baseState    - State prior to the parallel fan-out (provides the baseline scratch).
+     * @param branchStates - States produced by each parallel branch.
+     * @returns New `GraphState` with the merged scratch partition.
+     */
+    mergeParallelBranches(baseState, branchStates) {
+        let merged = { ...baseState.scratch };
+        for (const branch of branchStates) {
+            const branchScratch = branch.scratch;
+            for (const key of Object.keys(branchScratch)) {
+                const reducerKey = `scratch.${key}`;
+                const reducer = this.reducers[reducerKey];
+                if (reducer !== undefined && merged[key] !== undefined) {
+                    merged[key] = this.applyReducer(reducer, merged[key], branchScratch[key]);
+                }
+                else {
+                    merged[key] = branchScratch[key];
+                }
+            }
+        }
+        return { ...baseState, scratch: merged };
+    }
+    // ---------------------------------------------------------------------------
+    // Private helpers
+    // ---------------------------------------------------------------------------
+    /**
+     * Dispatch to a {@link BuiltinReducer} strategy or call a custom {@link ReducerFn}.
+     *
+     * @param reducer  - The reducer to apply.
+     * @param existing - Value currently stored in `GraphState`.
+     * @param incoming - New value emitted by the most recently completed node.
+     * @returns The merged value.
+     */
+    applyReducer(reducer, existing, incoming) {
+        if (typeof reducer === 'function') {
+            return reducer(existing, incoming);
+        }
+        switch (reducer) {
+            case 'concat':
+                // Concatenate arrays; fall back to empty array for non-array operands.
+                return [
+                    ...(Array.isArray(existing) ? existing : []),
+                    ...(Array.isArray(incoming) ? incoming : []),
+                ];
+            case 'merge':
+                // Shallow-merge objects; right (incoming) wins on key collision.
+                return {
+                    ...(typeof existing === 'object' && existing !== null ? existing : {}),
+                    ...(typeof incoming === 'object' && incoming !== null ? incoming : {}),
+                };
+            case 'max':
+                return Math.max(existing, incoming);
+            case 'min':
+                return Math.min(existing, incoming);
+            case 'avg':
+                return (existing + incoming) / 2;
+            case 'sum':
+                return existing + incoming;
+            case 'last':
+                // Always overwrite — this is the default `scratch` field semantics.
+                return incoming;
+            case 'first':
+                // Preserve the first value ever written; ignore subsequent writes.
+                return existing;
+            case 'longest':
+                // Keep whichever operand has the greater string length (or array length).
+                return String(existing).length >= String(incoming).length ? existing : incoming;
+            default: {
+                // Exhaustiveness guard — should be unreachable at runtime if types are respected.
+                const _exhaustive = reducer;
+                return incoming;
+            }
+        }
+    }
+    /**
+     * Construct an empty {@link MemoryView} used during state initialisation.
+     */
+    emptyMemoryView() {
+        return {
+            traces: [],
+            pendingWrites: [],
+            totalTracesRead: 0,
+            readLatencyMs: 0,
+        };
+    }
+    /**
+     * Construct a zeroed {@link DiagnosticsView} used during state initialisation.
+     */
+    emptyDiagnostics() {
+        return {
+            totalTokensUsed: 0,
+            totalDurationMs: 0,
+            nodeTimings: {},
+            discoveryResults: {},
+            guardrailResults: {},
+            checkpointsSaved: 0,
+            memoryReads: 0,
+            memoryWrites: 0,
+        };
+    }
+}
+//# sourceMappingURL=StateManager.js.map

package/dist/orchestration/runtime/StateManager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"StateManager.js","sourceRoot":"","sources":["../../../src/orchestration/runtime/StateManager.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAWH,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,YAAY;IACvB;;;;OAIG;IACH,YAA6B,QAAuB;QAAvB,aAAQ,GAAR,QAAQ,CAAe;IAAG,CAAC;IAExD,8EAA8E;IAC9E,aAAa;IACb,8EAA8E;IAE9E;;;;;;;;OAQG;IACH,UAAU,CAAC,KAAc;QACvB,OAAO;YACL,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAQ;YAClC,OAAO,EAAE,EAAS;YAClB,MAAM,EAAE,IAAI,CAAC,eAAe,EAAE;YAC9B,SAAS,EAAE,EAAS;YACpB,WAAW,EAAE,IAAI,CAAC,gBAAgB,EAAE;YACpC,aAAa,EAAE,EAAE;YACjB,YAAY,EAAE,EAAE;YAChB,SAAS,EAAE,CAAC;SACb,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,aAAa,CAAC,KAAiB,EAAE,KAA8B;QAC7D,MAAM,UAAU,GAAG,EAAE,GAAI,KAAK,CAAC,OAAe,EAAE,CAAC;QAEjD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACjD,MAAM,UAAU,GAAG,WAAW,GAAG,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAE1C,IAAI,OAAO,KAAK,SAAS,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC3D,iEAAiE;gBACjE,UAAU,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;YACvE,CAAC;iBAAM,CAAC;gBACN,4CAA4C;gBAC5C,UAAU,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;IAC3C,CAAC;IAED;;;;;;;;;;OAUG;IACH,eAAe,CAAC,KAAiB,EAAE,KAA8B;QAC/D,OAAO;YACL,GAAG,KAAK;YACR,SAAS,EAAE,EAAE,GAAI,KAAK,CAAC,SAAiB,EAAE,GAAG,KAAK,EAAE;SACrD,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACH,eAAe,CAAC,KAAiB,EAAE,MAAc;QAC/C,OAAO;YACL,GAAG,KAAK;YACR,aAAa,EAAE,MAAM;YACrB,YAAY,EAAE,CAAC,GAAG,KAAK,CAAC,YAAY,EAAE,MAAM,CAAC;YAC7C,SAAS,EAAE,KAAK,CAAC,SAAS,GAAG,CAAC;SAC/B,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,qBAAqB,CAAC,SAAqB,EAAE,YAA0B;QACrE,IAAI,MAAM,GAAG,EAAE,GAAI,SAAS,CAAC,OAAe,EAAE,CAAC;QAE/C,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;YAClC,MAAM,aAAa,GAAG,MAAM,CAAC,OAAc,CAAC;YAE5C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;gBAC7C,MAAM,UAAU,GAAG,WAAW,GAAG,EAAE,CAAC;gBACpC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;gBAE1C,IAAI,OAAO,KAAK,SAAS,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;oBACvD,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC5E,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,GAAG,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IAC3C,CAAC;IAED,8EAA8E;IAC9E,kBAAkB;IAClB,8EAA8E;IAE9E;;;;;;;OAOG;IACK,YAAY,CAClB,OAAmC,EACnC,QAAiB,EACjB,QAAiB;QAEjB,IAAI,OAAO,OAAO,KAAK,UAAU,EAAE,CAAC;YAClC,OAAO,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACrC,CAAC;QAED,QAAQ,OAAO,EAAE,CAAC;YAChB,KAAK,QAAQ;gBACX,uEAAuE;gBACvE,OAAO;oBACL,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC5C,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;iBAC7C,CAAC;YAEJ,KAAK,OAAO;gBACV,iEAAiE;gBACjE,OAAO;oBACL,GAAG,CAAC,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAE,QAAmB,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClF,GAAG,CAAC,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAE,QAAmB,CAAC,CAAC,CAAC,EAAE,CAAC;iBACnF,CAAC;YAEJ,KAAK,KAAK;gBACR,OAAO,IAAI,CAAC,GAAG,CAAC,QAAkB,EAAE,QAAkB,CAAC,CAAC;YAE1D,KAAK,KAAK;gBACR,OAAO,IAAI,CAAC,GAAG,CAAC,QAAkB,EAAE,QAAkB,CAAC,CAAC;YAE1D,KAAK,KAAK;gBACR,OAAO,CAAE,QAAmB,GAAI,QAAmB,CAAC,GAAG,CAAC,CAAC;YAE3D,KAAK,KAAK;gBACR,OAAQ,QAAmB,GAAI,QAAmB,CAAC;YAErD,KAAK,MAAM;gBACT,oEAAoE;gBACpE,OAAO,QAAQ,CAAC;YAElB,KAAK,OAAO;gBACV,mEAAmE;gBACnE,OAAO,QAAQ,CAAC;YAElB,KAAK,SAAS;gBACZ,0EAA0E;gBAC1E,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;YAElF,OAAO,CAAC,CAAC,CAAC;gBACR,kFAAkF;gBAClF,MAAM,WAAW,GAAU,OAAO,CAAC;gBACnC,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,eAAe;QACrB,OAAO;YACL,MAAM,EAAE,EAAE;YACV,aAAa,EAAE,EAAE;YACjB,eAAe,EAAE,CAAC;YAClB,aAAa,EAAE,CAAC;SACjB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,gBAAgB;QACtB,OAAO;YACL,eAAe,EAAE,CAAC;YAClB,eAAe,EAAE,CAAC;YAClB,WAAW,EAAE,EAAE;YACf,gBAAgB,EAAE,EAAE;YACpB,gBAAgB,EAAE,EAAE;YACpB,gBAAgB,EAAE,CAAC;YACnB,WAAW,EAAE,CAAC;YACd,YAAY,EAAE,CAAC;SAChB,CAAC;IACJ,CAAC;CACF"}

package/dist/orchestration/runtime/index.d.ts

@@ -0,0 +1,16 @@
+/**
+ * @file index.ts
+ * @description Barrel re-exports for the orchestration runtime subsystem.
+ *
+ * Consumers should import from this module rather than from individual files
+ * to keep import paths stable across internal refactors.
+ */
+export { StateManager } from './StateManager.js';
+export { NodeScheduler } from './NodeScheduler.js';
+export { LoopController } from './LoopController.js';
+export type { LoopConfig, LoopContext, LoopEvent } from './LoopController.js';
+export { NodeExecutor } from './NodeExecutor.js';
+export type { NodeExecutionResult } from './NodeExecutor.js';
+export { GraphRuntime } from './GraphRuntime.js';
+export type { GraphRuntimeConfig } from './GraphRuntime.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/orchestration/runtime/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/orchestration/runtime/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAC9E,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,YAAY,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,YAAY,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/orchestration/runtime/index.js

@@ -0,0 +1,13 @@
+/**
+ * @file index.ts
+ * @description Barrel re-exports for the orchestration runtime subsystem.
+ *
+ * Consumers should import from this module rather than from individual files
+ * to keep import paths stable across internal refactors.
+ */
+export { StateManager } from './StateManager.js';
+export { NodeScheduler } from './NodeScheduler.js';
+export { LoopController } from './LoopController.js';
+export { NodeExecutor } from './NodeExecutor.js';
+export { GraphRuntime } from './GraphRuntime.js';
+//# sourceMappingURL=index.js.map

package/dist/orchestration/runtime/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/orchestration/runtime/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAErD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEjD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@framers/agentos",
-  "version": "0.1.68",
+  "version": "0.1.70",
   "description": "Modular AgentOS orchestration library",
   "type": "module",
   "main": "dist/index.js",
@@ -103,6 +103,11 @@
       "default": "./dist/discovery/index.js",
       "types": "./dist/discovery/index.d.ts"
     },
+    "./orchestration": {
+      "import": "./dist/orchestration/index.js",
+      "default": "./dist/orchestration/index.js",
+      "types": "./dist/orchestration/index.d.ts"
+    },
     "./memory/index": {
       "import": "./dist/memory/index.js",
       "default": "./dist/memory/index.js",
@@ -170,8 +175,8 @@
   "author": "Voice Chat Assistant Team",
   "license": "Apache-2.0",
   "optionalDependencies": {
-    "compromise": "^14.15.0",
-    "@huggingface/transformers": "^3.8.1"
+    "@huggingface/transformers": "^3.8.1",
+    "compromise": "^14.15.0"
   },
   "devDependencies": {
     "@eslint/js": "^9.11.0",
@@ -213,7 +218,8 @@
     "openredaction": "^1.1.2",
     "pino": "^9.14.0",
     "uuid": "^11.1.0",
-    "yaml": "^2.8.1"
+    "yaml": "^2.8.1",
+    "zod": "^4.3.6"
   },
   "peerDependencies": {
     "@framers/sql-storage-adapter": ">=0.5.0",

package/dist/api/tool-adapter.d.ts

@@ -1,12 +0,0 @@
-import type { ITool } from '../core/tools/ITool.js';
-export interface ToolDefinition {
-    description?: string;
-    parameters?: Record<string, unknown>;
-    execute?: (args: any) => Promise<any>;
-}
-export type ToolDefinitionMap = Record<string, ToolDefinition | ITool>;
-/**
- * Adapts Zod schemas, JSON Schema objects, and ITool instances into ITool[].
- */
-export declare function adaptTools(tools: ToolDefinitionMap | undefined): ITool[];
-//# sourceMappingURL=tool-adapter.d.ts.map

package/dist/api/tool-adapter.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"tool-adapter.d.ts","sourceRoot":"","sources":["../../src/api/tool-adapter.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,KAAK,EAA+D,MAAM,wBAAwB,CAAC;AAEjH,MAAM,WAAW,cAAc;IAC7B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACrC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC;CACvC;AAED,MAAM,MAAM,iBAAiB,GAAG,MAAM,CAAC,MAAM,EAAE,cAAc,GAAG,KAAK,CAAC,CAAC;AAEvE;;GAEG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,iBAAiB,GAAG,SAAS,GAAG,KAAK,EAAE,CAgDxE"}

package/dist/api/tool-adapter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tool-adapter.js","sourceRoot":"","sources":["../../src/api/tool-adapter.ts"],"names":[],"mappings":"AAWA;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,KAAoC;IAC7D,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IACtB,MAAM,MAAM,GAAY,EAAE,CAAC;IAE3B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAChD,oEAAoE;QACpE,IAAI,aAAa,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,GAAY,CAAC,CAAC;YAC1B,SAAS;QACX,CAAC;QAED,MAAM,EAAE,GAAG,GAAqB,CAAC;QACjC,IAAI,MAAwB,CAAC;QAE7B,IAAI,EAAE,CAAC,UAAU,IAAI,MAAM,IAAK,EAAE,CAAC,UAAkB,EAAE,CAAC;YACtD,sCAAsC;YACtC,IAAI,CAAC;gBACH,MAAM,EAAE,eAAe,EAAE,GAAG,OAAO,CAAC,oBAAoB,CAAQ,CAAC;gBACjE,MAAM,GAAG,eAAe,CAAC,EAAE,CAAC,UAAU,CAAqB,CAAC;YAC9D,CAAC;YAAC,MAAM,CAAC;gBACP,0DAA0D;gBAC1D,MAAM,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;YAC9C,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,CAAC,EAAE,CAAC,UAAU,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE,CAAqB,CAAC;QACrF,CAAC;QAED,MAAM,SAAS,GAAG,EAAE,CAAC,OAAO,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAElE,MAAM,CAAC,IAAI,CAAC;YACV,EAAE,EAAE,GAAG,IAAI,KAAK;YAChB,IAAI;YACJ,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,EAAE;YACvF,WAAW,EAAE,EAAE,CAAC,WAAW,IAAI,EAAE;YACjC,WAAW,EAAE,MAAM;YACnB,cAAc,EAAE,KAAK;YACrB,KAAK,CAAC,OAAO,CAAC,IAAS,EAAE,IAA0B;gBACjD,IAAI,CAAC;oBACH,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,CAAC;oBACrC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;gBACnC,CAAC;gBAAC,OAAO,GAAQ,EAAE,CAAC;oBAClB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBAChE,CAAC;YACH,CAAC;SACF,CAAC,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}