@seljs/runtime 1.0.0

package/CHANGELOG.md

@@ -0,0 +1,8 @@
+# Changelog
+
+## 1.0.0 (2026-03-13)
+
+
+### Features
+
+* first implementation of seljs ([7548fe0](https://github.com/abinnovision/seljs/commit/7548fe06cbb22ec6b74b20e38ef07d026b3f8def))

package/LICENSE.md

@@ -0,0 +1,190 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1.  Definitions.
+
+    "License" shall mean the terms and conditions for use, reproduction,
+    and distribution as defined by Sections 1 through 9 of this document.
+
+    "Licensor" shall mean the copyright owner or entity authorized by
+    the copyright owner that is granting the License.
+
+    "Legal Entity" shall mean the union of the acting entity and all
+    other entities that control, are controlled by, or are under common
+    control with that entity. For the purposes of this definition,
+    "control" means (i) the power, direct or indirect, to cause the
+    direction or management of such entity, whether by contract or
+    otherwise, or (ii) ownership of fifty percent (50%) or more of the
+    outstanding shares, or (iii) beneficial ownership of such entity.
+
+    "You" (or "Your") shall mean an individual or Legal Entity
+    exercising permissions granted by this License.
+
+    "Source" form shall mean the preferred form for making modifications,
+    including but not limited to software source code, documentation
+    source, and configuration files.
+
+    "Object" form shall mean any form resulting from mechanical
+    transformation or translation of a Source form, including but
+    not limited to compiled object code, generated documentation,
+    and conversions to other media types.
+
+    "Work" shall mean the work of authorship, whether in Source or
+    Object form, made available under the License, as indicated by a
+    copyright notice that is included in or attached to the work
+    (an example is provided in the Appendix below).
+
+    "Derivative Works" shall mean any work, whether in Source or Object
+    form, that is based on (or derived from) the Work and for which the
+    editorial revisions, annotations, elaborations, or other modifications
+    represent, as a whole, an original work of authorship. For the purposes
+    of this License, Derivative Works shall not include works that remain
+    separable from, or merely link (or bind by name) to the interfaces of,
+    the Work and Derivative Works thereof.
+
+    "Contribution" shall mean any work of authorship, including
+    the original version of the Work and any modifications or additions
+    to that Work or Derivative Works thereof, that is intentionally
+    submitted to Licensor for inclusion in the Work by the copyright owner
+    or by an individual or Legal Entity authorized to submit on behalf of
+    the copyright owner. For the purposes of this definition, "submitted"
+    means any form of electronic, verbal, or written communication sent
+    to the Licensor or its representatives, including but not limited to
+    communication on electronic mailing lists, source code control systems,
+    and issue tracking systems that are managed by, or on behalf of, the
+    Licensor for the purpose of discussing and improving the Work, but
+    excluding communication that is conspicuously marked or otherwise
+    designated in writing by the copyright owner as "Not a Contribution."
+
+    "Contributor" shall mean Licensor and any individual or Legal Entity
+    on behalf of whom a Contribution has been received by Licensor and
+    subsequently incorporated within the Work.
+
+2.  Grant of Copyright License. Subject to the terms and conditions of
+    this License, each Contributor hereby grants to You a perpetual,
+    worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+    copyright license to reproduce, prepare Derivative Works of,
+    publicly display, publicly perform, sublicense, and distribute the
+    Work and such Derivative Works in Source or Object form.
+
+3.  Grant of Patent License. Subject to the terms and conditions of
+    this License, each Contributor hereby grants to You a perpetual,
+    worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+    (except as stated in this section) patent license to make, have made,
+    use, offer to sell, sell, import, and otherwise transfer the Work,
+    where such license applies only to those patent claims licensable
+    by such Contributor that are necessarily infringed by their
+    Contribution(s) alone or by combination of their Contribution(s)
+    with the Work to which such Contribution(s) was submitted. If You
+    institute patent litigation against any entity (including a
+    cross-claim or counterclaim in a lawsuit) alleging that the Work
+    or a Contribution incorporated within the Work constitutes direct
+    or contributory patent infringement, then any patent licenses
+    granted to You under this License for that Work shall terminate
+    as of the date such litigation is filed.
+
+4.  Redistribution. You may reproduce and distribute copies of the
+    Work or Derivative Works thereof in any medium, with or without
+    modifications, and in Source or Object form, provided that You
+    meet the following conditions:
+
+    (a) You must give any other recipients of the Work or
+    Derivative Works a copy of this License; and
+
+    (b) You must cause any modified files to carry prominent notices
+    stating that You changed the files; and
+
+    (c) You must retain, in the Source form of any Derivative Works
+    that You distribute, all copyright, patent, trademark, and
+    attribution notices from the Source form of the Work,
+    excluding those notices that do not pertain to any part of
+    the Derivative Works; and
+
+    (d) If the Work includes a "NOTICE" text file as part of its
+    distribution, then any Derivative Works that You distribute must
+    include a readable copy of the attribution notices contained
+    within such NOTICE file, excluding those notices that do not
+    pertain to any part of the Derivative Works, in at least one
+    of the following places: within a NOTICE text file distributed
+    as part of the Derivative Works; within the Source form or
+    documentation, if provided along with the Derivative Works; or,
+    within a display generated by the Derivative Works, if and
+    wherever such third-party notices normally appear. The contents
+    of the NOTICE file are for informational purposes only and
+    do not modify the License. You may add Your own attribution
+    notices within Derivative Works that You distribute, alongside
+    or as an addendum to the NOTICE text from the Work, provided
+    that such additional attribution notices cannot be construed
+    as modifying the License.
+
+    You may add Your own copyright statement to Your modifications and
+    may provide additional or different license terms and conditions
+    for use, reproduction, or distribution of Your modifications, or
+    for any such Derivative Works as a whole, provided Your use,
+    reproduction, and distribution of the Work otherwise complies with
+    the conditions stated in this License.
+
+5.  Submission of Contributions. Unless You explicitly state otherwise,
+    any Contribution intentionally submitted for inclusion in the Work
+    by You to the Licensor shall be under the terms and conditions of
+    this License, without any additional terms or conditions.
+    Notwithstanding the above, nothing herein shall supersede or modify
+    the terms of any separate license agreement you may have executed
+    with Licensor regarding such Contributions.
+
+6.  Trademarks. This License does not grant permission to use the trade
+    names, trademarks, service marks, or product names of the Licensor,
+    except as required for reasonable and customary use in describing the
+    origin of the Work and reproducing the content of the NOTICE file.
+
+7.  Disclaimer of Warranty. Unless required by applicable law or
+    agreed to in writing, Licensor provides the Work (and each
+    Contributor provides its Contributions) on an "AS IS" BASIS,
+    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+    implied, including, without limitation, any warranties or conditions
+    of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+    PARTICULAR PURPOSE. You are solely responsible for determining the
+    appropriateness of using or redistributing the Work and assume any
+    risks associated with Your exercise of permissions under this License.
+
+8.  Limitation of Liability. In no event and under no legal theory,
+    whether in tort (including negligence), contract, or otherwise,
+    unless required by applicable law (such as deliberate and grossly
+    negligent acts) or agreed to in writing, shall any Contributor be
+    liable to You for damages, including any direct, indirect, special,
+    incidental, or consequential damages of any character arising as a
+    result of this License or out of the use or inability to use the
+    Work (including but not limited to damages for loss of goodwill,
+    work stoppage, computer failure or malfunction, or any and all
+    other commercial damages or losses), even if such Contributor
+    has been advised of the possibility of such damages.
+
+9.  Accepting Warranty or Additional Liability. While redistributing
+    the Work or Derivative Works thereof, You may choose to offer,
+    and charge a fee for, acceptance of support, warranty, indemnity,
+    or other liability obligations and/or rights consistent with this
+    License. However, in accepting such obligations, You may act only
+    on Your own behalf and on Your sole responsibility, not on behalf
+    of any other Contributor, and only if You agree to indemnify,
+    defend, and hold each Contributor harmless for any liability
+    incurred by, or claims asserted against, such Contributor by reason
+    of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+Copyright 2026 abi group GmbH
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.

package/README.md

@@ -0,0 +1,5 @@
+# sel-core
+
+Runtime execution engine. Evaluates SEL expressions against live contract data with full 256-bit precision. Handles contract calling, value wrapping/unwrapping, and multi-round dependency resolution.
+
+Depends on all other SEL packages.

package/dist/analysis/call-collector.d.ts

@@ -0,0 +1,20 @@
+import type { CollectedCall } from "./types.js";
+import type { ASTNode } from "@marcbachmann/cel-js";
+/** Minimal interface required by collectCalls for contract lookup. */
+export interface ContractLookup {
+    get: (name: string) => unknown;
+}
+/**
+ * Collects contract calls from a CEL AST by traversing the tree.
+ *
+ * Walks the AST looking for `rcall` nodes whose receiver matches a registered
+ * contract. For each matched call, classifies arguments as literals, variable
+ * references, or results of other contract calls (creating dependency edges).
+ * Skips `cel.bind()` calls while still collecting any nested contract calls.
+ *
+ * @param ast The root AST node from a parsed CEL expression
+ * @param registry Contract lookup to validate receiver names against
+ * @returns Array of collected calls with dependency information
+ */
+export declare const collectCalls: (ast: ASTNode, registry: ContractLookup) => CollectedCall[];
+//# sourceMappingURL=call-collector.d.ts.map

package/dist/analysis/call-collector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"call-collector.d.ts","sourceRoot":"","sources":["../../src/analysis/call-collector.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAgB,aAAa,EAAE,MAAM,YAAY,CAAC;AAC9D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAEpD,sEAAsE;AACtE,MAAM,WAAW,cAAc;IAC9B,GAAG,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC;CAC/B;AAwHD;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,YAAY,GACxB,KAAK,OAAO,EACZ,UAAU,cAAc,KACtB,aAAa,EA2Nf,CAAC"}

package/dist/analysis/call-collector.js

@@ -0,0 +1,272 @@
+import { COMPREHENSION_MACROS, SCALAR_WRAPPER_FUNCTIONS } from "@seljs/checker";
+import { isAstNode } from "@seljs/common";
+import { createLogger } from "../debug.js";
+const debug = createLogger("analysis:collect");
+/**
+ * Generates a deterministic call identifier from contract name, method, and arguments.
+ *
+ * Format: "contract:method:arg1,arg2,..."
+ * Used for deduplication and dependency tracking between calls.
+ */
+const generateCallId = (contract, method, args) => {
+    const argKey = args
+        .map((arg) => {
+        if (arg.variableName !== undefined) {
+            return arg.variableName;
+        }
+        if (arg.value !== undefined) {
+            const v = arg.value;
+            return typeof v === "string" ||
+                typeof v === "number" ||
+                typeof v === "boolean" ||
+                typeof v === "bigint"
+                ? String(v)
+                : "?";
+        }
+        if (arg.dependsOnCallId !== undefined) {
+            return arg.dependsOnCallId;
+        }
+        return "?";
+    })
+        .join(",");
+    return `${contract}:${method}:${argKey}`;
+};
+/**
+ * Attempts to extract a scalar argument from a Solidity cast/wrapper call
+ * (e.g. `uint256(42)`, `solAddress("0x...")`, `int256(tokenId)`).
+ *
+ * Handles both literal values and variable references.
+ * Returns undefined if the node is not a recognized scalar wrapper.
+ */
+const collectScalarArgument = (argNode) => {
+    if (!isAstNode(argNode) || argNode.op !== "call") {
+        return undefined;
+    }
+    // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition
+    if (!Array.isArray(argNode.args) || argNode.args.length !== 2) {
+        return undefined;
+    }
+    const fnName = argNode.args[0];
+    const fnArgs = argNode.args[1];
+    if (typeof fnName !== "string" ||
+        !Array.isArray(fnArgs) ||
+        fnArgs.length !== 1 ||
+        !SCALAR_WRAPPER_FUNCTIONS.has(fnName)) {
+        return undefined;
+    }
+    const inner = fnArgs[0];
+    if (!isAstNode(inner)) {
+        return undefined;
+    }
+    if (inner.op === "value") {
+        return { type: "literal", value: inner.args };
+    }
+    if (inner.op === "id" && typeof inner.args === "string") {
+        return { type: "variable", variableName: inner.args };
+    }
+    return undefined;
+};
+/**
+ * Extracts the method name, receiver identifier, and argument nodes from an rcall AST node.
+ *
+ * An rcall node has the structure: `["methodName", receiverNode, [argNodes...]]`
+ */
+const getRCallArgs = (node) => {
+    if (!Array.isArray(node.args) || node.args.length < 3) {
+        return undefined;
+    }
+    const methodNode = node.args[0];
+    const receiverNode = node.args[1];
+    const argNodes = node.args[2];
+    if (typeof methodNode !== "string" || !Array.isArray(argNodes)) {
+        return undefined;
+    }
+    let receiverName;
+    if (isAstNode(receiverNode) &&
+        receiverNode.op === "id" &&
+        typeof receiverNode.args === "string") {
+        receiverName = receiverNode.args;
+    }
+    return { method: methodNode, receiverName, args: argNodes };
+};
+/**
+ * Collects contract calls from a CEL AST by traversing the tree.
+ *
+ * Walks the AST looking for `rcall` nodes whose receiver matches a registered
+ * contract. For each matched call, classifies arguments as literals, variable
+ * references, or results of other contract calls (creating dependency edges).
+ * Skips `cel.bind()` calls while still collecting any nested contract calls.
+ *
+ * @param ast The root AST node from a parsed CEL expression
+ * @param registry Contract lookup to validate receiver names against
+ * @returns Array of collected calls with dependency information
+ */
+export const collectCalls = (ast, registry) => {
+    const calls = [];
+    /** Variable names that are scoped (comprehension iteration vars, cel.bind vars) — NOT user context */
+    const scopedVars = new Set();
+    /** rcall AST nodes skipped because they have unresolvable args */
+    const deferredNodes = new WeakSet();
+    const traverse = (node) => {
+        if (Array.isArray(node)) {
+            for (const item of node) {
+                traverse(item);
+            }
+            return;
+        }
+        if (!isAstNode(node)) {
+            return;
+        }
+        if (node.op === "rcall") {
+            collectRCall(node);
+            return;
+        }
+        traverse(node.args);
+    };
+    /**
+     * Handles cel.bind() — registers the bind variable name for the body scope,
+     * traverses the initializer and body, then removes the scoped var.
+     */
+    const handleCelBind = (args) => {
+        if (args.length >= 3) {
+            const nameNode = args[0];
+            if (isAstNode(nameNode) &&
+                nameNode.op === "id" &&
+                typeof nameNode.args === "string") {
+                traverse(args[1]);
+                scopedVars.add(nameNode.args);
+                traverse(args[2]);
+                scopedVars.delete(nameNode.args);
+                return;
+            }
+        }
+        for (const argNode of args) {
+            traverse(argNode);
+        }
+    };
+    /**
+     * Handles rcall nodes whose receiver is NOT a registered contract.
+     * Traverses the receiver node and args, registering comprehension
+     * iteration variables for their body scope.
+     */
+    const handleNonContractRCall = (node, method, args) => {
+        // Always traverse the receiver to collect contract calls within it
+        if (Array.isArray(node.args) && node.args.length >= 2) {
+            traverse(node.args[1]);
+        }
+        // Comprehension macros: register iteration variable for body scope
+        if (COMPREHENSION_MACROS.has(method) && args.length >= 2) {
+            const iterVarNode = args[0];
+            if (isAstNode(iterVarNode) &&
+                iterVarNode.op === "id" &&
+                typeof iterVarNode.args === "string") {
+                scopedVars.add(iterVarNode.args);
+                for (let i = 1; i < args.length; i++) {
+                    traverse(args[i]);
+                }
+                scopedVars.delete(iterVarNode.args);
+                return;
+            }
+        }
+        for (const argNode of args) {
+            traverse(argNode);
+        }
+    };
+    /**
+     * Classifies a single argument node, returning the resolved CallArgument
+     * or `undefined` if unresolvable. When `undefined` is returned, the caller
+     * should mark the parent call as deferred.
+     */
+    const classifyArg = (argNode) => {
+        const scalarArg = collectScalarArgument(argNode);
+        if (scalarArg) {
+            return { arg: scalarArg, traversed: false };
+        }
+        if (isAstNode(argNode) && argNode.op === "value") {
+            return {
+                arg: { type: "literal", value: argNode.args },
+                traversed: false,
+            };
+        }
+        if (isAstNode(argNode) &&
+            argNode.op === "id" &&
+            typeof argNode.args === "string") {
+            if (scopedVars.has(argNode.args)) {
+                return { arg: undefined, traversed: false };
+            }
+            return {
+                arg: { type: "variable", variableName: argNode.args },
+                traversed: false,
+            };
+        }
+        if (isAstNode(argNode) && argNode.op === "rcall") {
+            const innerCall = collectRCall(argNode);
+            if (innerCall) {
+                return {
+                    arg: { type: "call_result", dependsOnCallId: innerCall.id },
+                    traversed: true,
+                };
+            }
+            // Inner rcall was not collected — check if it was deferred
+            if (deferredNodes.has(argNode)) {
+                // inner calls already collected by recursive collectRCall
+                return { arg: undefined, traversed: true };
+            }
+        }
+        return { arg: undefined, traversed: false };
+    };
+    /**
+     * Processes an rcall AST node, collecting it as a contract call if the
+     * receiver is a registered contract. Recursively processes nested rcalls
+     * in arguments to build dependency chains.
+     */
+    const collectRCall = (node) => {
+        const callArgs = getRCallArgs(node);
+        if (!callArgs) {
+            traverse(node.args);
+            return undefined;
+        }
+        const { method, receiverName, args } = callArgs;
+        if (receiverName === "cel" && method === "bind") {
+            handleCelBind(args);
+            return undefined;
+        }
+        if (!receiverName || !registry.get(receiverName)) {
+            handleNonContractRCall(node, method, args);
+            return undefined;
+        }
+        const collectedArgs = [];
+        let hasUnresolvableArg = false;
+        for (const argNode of args) {
+            const { arg, traversed } = classifyArg(argNode);
+            if (arg) {
+                collectedArgs.push(arg);
+            }
+            else {
+                hasUnresolvableArg = true;
+                if (!traversed) {
+                    traverse(argNode);
+                }
+            }
+        }
+        if (hasUnresolvableArg) {
+            deferredNodes.add(node);
+            debug("deferred %s.%s (unresolvable args)", receiverName, method);
+            return undefined;
+        }
+        const call = {
+            id: generateCallId(receiverName, method, collectedArgs),
+            contract: receiverName,
+            method,
+            args: collectedArgs,
+            astNode: node,
+        };
+        calls.push(call);
+        debug("found %s.%s (id=%s)", receiverName, method, call.id);
+        return call;
+    };
+    // Start traversal from the root of the AST
+    traverse(ast);
+    debug("collected %d total calls", calls.length);
+    return calls;
+};

package/dist/analysis/dependency-analyzer.d.ts

@@ -0,0 +1,14 @@
+import type { CollectedCall, DependencyGraph } from "./types.js";
+/**
+ * Builds a dependency graph from collected contract calls.
+ *
+ * Creates a directed graph where nodes represent contract calls and edges
+ * represent data dependencies (when one call's argument is the result of
+ * another call). Validates that no circular dependencies exist.
+ *
+ * @param calls - Array of collected contract calls from AST traversal
+ * @returns A dependency graph with nodes and directed edges
+ * @throws {@link CircularDependencyError} If a circular dependency is detected between calls
+ */
+export declare const analyzeDependencies: (calls: CollectedCall[]) => DependencyGraph;
+//# sourceMappingURL=dependency-analyzer.d.ts.map

package/dist/analysis/dependency-analyzer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-analyzer.d.ts","sourceRoot":"","sources":["../../src/analysis/dependency-analyzer.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,aAAa,EAAE,eAAe,EAAa,MAAM,YAAY,CAAC;AAiD5E;;;;;;;;;;GAUG;AACH,eAAO,MAAM,mBAAmB,GAC/B,OAAO,aAAa,EAAE,KACpB,eAwCF,CAAC"}

package/dist/analysis/dependency-analyzer.js

@@ -0,0 +1,76 @@
+import { createLogger } from "../debug.js";
+import { CircularDependencyError } from "../errors/index.js";
+const debug = createLogger("analysis:dependency");
+/**
+ * Detects circular dependencies in the graph using DFS with a recursion stack.
+ *
+ * @throws {@link CircularDependencyError} If a cycle is found, including the call IDs forming the cycle
+ */
+const detectCycles = (nodes, edges) => {
+    const visited = new Set();
+    const inStack = new Set();
+    const dfs = (nodeId, path) => {
+        if (inStack.has(nodeId)) {
+            const cycleStart = path.indexOf(nodeId);
+            const cycle = path.slice(cycleStart);
+            throw new CircularDependencyError(`Circular dependency detected: ${cycle.join(" -> ")} -> ${nodeId}`, { callIds: cycle });
+        }
+        if (visited.has(nodeId)) {
+            return;
+        }
+        visited.add(nodeId);
+        inStack.add(nodeId);
+        path.push(nodeId);
+        for (const depId of edges.get(nodeId) ?? []) {
+            dfs(depId, path);
+        }
+        path.pop();
+        inStack.delete(nodeId);
+    };
+    for (const nodeId of nodes.keys()) {
+        if (!visited.has(nodeId)) {
+            dfs(nodeId, []);
+        }
+    }
+};
+/**
+ * Builds a dependency graph from collected contract calls.
+ *
+ * Creates a directed graph where nodes represent contract calls and edges
+ * represent data dependencies (when one call's argument is the result of
+ * another call). Validates that no circular dependencies exist.
+ *
+ * @param calls - Array of collected contract calls from AST traversal
+ * @returns A dependency graph with nodes and directed edges
+ * @throws {@link CircularDependencyError} If a circular dependency is detected between calls
+ */
+export const analyzeDependencies = (calls) => {
+    const nodes = new Map();
+    const edges = new Map();
+    // First pass: create a node and empty edge set for each call
+    for (const call of calls) {
+        nodes.set(call.id, { call, dependsOn: [], dependedOnBy: [] });
+        edges.set(call.id, new Set());
+    }
+    // Second pass: wire up dependency edges from call_result arguments
+    for (const call of calls) {
+        for (const arg of call.args) {
+            if (arg.type === "call_result" && arg.dependsOnCallId) {
+                const depId = arg.dependsOnCallId;
+                edges.get(call.id)?.add(depId);
+                const callNode = nodes.get(call.id);
+                if (callNode && !callNode.dependsOn.includes(depId)) {
+                    callNode.dependsOn.push(depId);
+                }
+                const depNode = nodes.get(depId);
+                if (depNode && !depNode.dependedOnBy.includes(call.id)) {
+                    depNode.dependedOnBy.push(call.id);
+                }
+            }
+        }
+    }
+    // Run cycle detection to ensure there are no circular dependencies in the graph.
+    detectCycles(nodes, edges);
+    debug("graph: %d nodes, %d edges", nodes.size, [...edges.values()].reduce((sum, deps) => sum + deps.size, 0));
+    return { nodes, edges };
+};

package/dist/analysis/index.d.ts

@@ -0,0 +1,2 @@
+export type * from "./types.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/analysis/index.ts"],"names":[],"mappings":"AAAA,mBAAmB,YAAY,CAAC"}

package/dist/analysis/index.js

@@ -0,0 +1 @@
+export {};

package/dist/analysis/round-planner.d.ts

@@ -0,0 +1,32 @@
+import type { DependencyGraph, ExecutionPlan } from "./types.js";
+/**
+ * Defines limits for the round planner to prevent excessive execution.
+ */
+export interface RoundPlannerLimits {
+    /**
+     * Upper limit on the number of execution rounds.
+     *
+     * @default 10
+     */
+    maxRounds?: number;
+    /**
+     * Upper limit on the total number of calls in the graph.
+     *
+     * @default 100
+     */
+    maxCalls?: number;
+}
+/**
+ * Plans execution rounds from a dependency graph using topological sorting.
+ *
+ * Groups independent calls into parallel rounds, ensuring all dependencies
+ * of a call are executed in previous rounds. Enforces limits on the number
+ * of rounds and total calls to prevent excessive execution.
+ *
+ * @param graph Dependency graph representing calls and their relationships.
+ * @param limits Optional limits for maximum rounds and total calls.
+ * @returns Execution plan containing planned rounds, total calls, and maximum depth.
+ * @throws ExecutionLimitError If total calls exceed maxCalls or rounds exceed maxRounds.
+ */
+export declare const planRounds: (graph: DependencyGraph, limits?: RoundPlannerLimits) => ExecutionPlan;
+//# sourceMappingURL=round-planner.d.ts.map

package/dist/analysis/round-planner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"round-planner.d.ts","sourceRoot":"","sources":["../../src/analysis/round-planner.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EACX,eAAe,EACf,aAAa,EAEb,MAAM,YAAY,CAAC;AAIpB;;GAEG;AACH,MAAM,WAAW,kBAAkB;IAClC;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,UAAU,GACtB,OAAO,eAAe,EACtB,SAAQ,kBAAuB,KAC7B,aA6EF,CAAC"}