@baseplate-dev/utils 0.1.1

package/dist/toposort/toposort-local.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"toposort-local.d.ts","sourceRoot":"","sources":["../../src/toposort/toposort-local.ts"],"names":[],"mappings":"AAkHA,UAAU,eAAe,CAAC,CAAC;IACzB;;;;OAIG;IACH,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;CACtC;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,KAAK,EAAE,CAAC,EAAE,EACV,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EACf,OAAO,GAAE,eAAe,CAAC,CAAC,CAAM,GAC/B,CAAC,EAAE,CA2DL"}

package/dist/toposort/toposort-local.js

@@ -0,0 +1,152 @@
+import { ToposortCyclicalDependencyError, ToposortUnknownNodeError, } from './errors.js';
+/**
+ * Creates a map of inbound edges from node indices to their source indices
+ */
+function makeInboundEdges(nodes, edgeArr) {
+    const inboundEdgesMap = new Map();
+    for (const edge of edgeArr) {
+        const [source, target] = edge;
+        const sourceIndex = nodes.get(source);
+        const targetIndex = nodes.get(target);
+        // Check both source and target exist in the provided nodes set
+        if (sourceIndex === undefined)
+            throw new ToposortUnknownNodeError(source);
+        if (targetIndex === undefined)
+            throw new ToposortUnknownNodeError(target);
+        const targetEdges = inboundEdgesMap.get(targetIndex);
+        if (targetEdges) {
+            targetEdges.add(sourceIndex);
+        }
+        else {
+            inboundEdgesMap.set(targetIndex, new Set([sourceIndex]));
+        }
+    }
+    return inboundEdgesMap;
+}
+/**
+ * Creates a map of node indices to their out-degree
+ */
+function makeNodeOutDegrees(inboundEdgesMap, nodeLength) {
+    const nodeOutDegrees = Array.from({ length: nodeLength }, () => 0);
+    for (const [, sources] of inboundEdgesMap.entries()) {
+        for (const source of sources) {
+            nodeOutDegrees[source]++;
+        }
+    }
+    return nodeOutDegrees;
+}
+/**
+ * Detects cycles in a graph by checking if all nodes are included in the topological sort
+ */
+function detectCycle(nodes, visited, edges) {
+    // If all nodes were visited, no cycle exists
+    if (visited.size === nodes.length) {
+        return [];
+    }
+    // Run DFS from any unvisited node to find a cycle
+    const path = [];
+    const visitSet = new Set();
+    function dfs(node) {
+        if (visitSet.has(node)) {
+            path.push(node);
+            return true;
+        }
+        if (visited.has(node)) {
+            return false;
+        }
+        visitSet.add(node);
+        path.push(node);
+        const neighbors = edges.get(node) ?? new Set();
+        for (const neighbor of neighbors) {
+            if (dfs(neighbor)) {
+                return true;
+            }
+        }
+        path.pop();
+        visitSet.delete(node);
+        return false;
+    }
+    // For cycle detection, we need to find nodes that weren't visited
+    const unvistedNodeIdx = nodes.findIndex((node, idx) => !visited.has(idx));
+    if (unvistedNodeIdx === -1) {
+        return [];
+    }
+    // Start DFS from any unvisited node
+    dfs(unvistedNodeIdx);
+    // Convert path indices to actual nodes
+    return path.map((idx) => nodes[idx]);
+}
+/**
+ * Default comparison function for stable topological sort
+ */
+function defaultCompareFunc(a, b) {
+    if (typeof a === 'string' && typeof b === 'string') {
+        return a.localeCompare(b);
+    }
+    if (a === b)
+        return 0;
+    return a < b ? -1 : 1;
+}
+/**
+ * Performs a locality-based topological sort on a directed acyclic graph.
+ *
+ * This is a variant of Kahn's algorithm that starts from nodes with no outbound edges first,
+ * and then works its way back.
+ *
+ * This is useful for tasks where we want to process nodes in a way that is consistent with their locality in the graph
+ * such as sorting fragments of a generated code file that depend on each other.
+ *
+ * @param nodes - The nodes to sort
+ * @param edges - The edges of the graph
+ * @param options - Optional options for the topological sort
+ * @returns The sorted nodes
+ */
+export function toposortLocal(nodes, edges, options = {}) {
+    const { compareFunc = defaultCompareFunc } = options;
+    const compareIdx = (a, b) => compareFunc(nodes[a], nodes[b]);
+    // Map each node to its index
+    const nodeIndexMap = new Map(nodes.map((node, index) => [node, index]));
+    // Create a map of outgoing edges from each node
+    const inboundEdgesMap = makeInboundEdges(nodeIndexMap, edges);
+    const nodeOutDegrees = makeNodeOutDegrees(inboundEdgesMap, nodes.length);
+    // Create a stack of nodes with no incoming edges (in-degree == 0)
+    // We use a stack so that the most recently added nodes are processed first
+    const zeroOutDegreeStack = [];
+    for (const [i, nodeOutDegree] of nodeOutDegrees.entries()) {
+        if (nodeOutDegree === 0) {
+            zeroOutDegreeStack.push(i);
+        }
+    }
+    zeroOutDegreeStack.sort(compareIdx);
+    const reverseResult = [];
+    const visited = new Set();
+    // Process nodes in BFS order
+    while (zeroOutDegreeStack.length > 0) {
+        const current = zeroOutDegreeStack.pop();
+        if (current === undefined)
+            break;
+        visited.add(current);
+        reverseResult.push(nodes[current]);
+        // Process all outgoing edges from the current node
+        const incomingEdges = inboundEdgesMap.get(current);
+        const newZeroOutDegreeNodes = [];
+        if (incomingEdges) {
+            for (const source of incomingEdges) {
+                nodeOutDegrees[source]--;
+                // If the target node now has no incoming edges, add it to the queue
+                if (nodeOutDegrees[source] === 0) {
+                    newZeroOutDegreeNodes.push(source);
+                }
+            }
+        }
+        newZeroOutDegreeNodes.sort(compareIdx);
+        zeroOutDegreeStack.push(...newZeroOutDegreeNodes);
+    }
+    // Check for cycles
+    if (reverseResult.length !== nodes.length) {
+        const cyclePath = detectCycle(nodes, visited, inboundEdgesMap);
+        throw new ToposortCyclicalDependencyError(cyclePath.reverse());
+    }
+    return reverseResult.reverse();
+}
+//# sourceMappingURL=toposort-local.js.map

package/dist/toposort/toposort-local.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"toposort-local.js","sourceRoot":"","sources":["../../src/toposort/toposort-local.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,+BAA+B,EAC/B,wBAAwB,GACzB,MAAM,aAAa,CAAC;AAErB;;GAEG;AACH,SAAS,gBAAgB,CACvB,KAAqB,EACrB,OAAiB;IAEjB,MAAM,eAAe,GAAG,IAAI,GAAG,EAAuB,CAAC;IACvD,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;QAC9B,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,+DAA+D;QAC/D,IAAI,WAAW,KAAK,SAAS;YAAE,MAAM,IAAI,wBAAwB,CAAC,MAAM,CAAC,CAAC;QAC1E,IAAI,WAAW,KAAK,SAAS;YAAE,MAAM,IAAI,wBAAwB,CAAC,MAAM,CAAC,CAAC;QAE1E,MAAM,WAAW,GAAG,eAAe,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACrD,IAAI,WAAW,EAAE,CAAC;YAChB,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,eAAe,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IACD,OAAO,eAAe,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CACzB,eAAyC,EACzC,UAAkB;IAElB,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACnE,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;QACpD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,cAAc,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAClB,KAAU,EACV,OAAoB,EACpB,KAA+B;IAE/B,6CAA6C;IAC7C,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QAClC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,kDAAkD;IAClD,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,SAAS,GAAG,CAAC,IAAY;QACvB,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEhB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACvD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAClB,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,kEAAkE;IAClE,MAAM,eAAe,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAE1E,IAAI,eAAe,KAAK,CAAC,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,oCAAoC;IACpC,GAAG,CAAC,eAAe,CAAC,CAAC;IAErB,uCAAuC;IACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAI,CAAI,EAAE,CAAI;IACvC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;QACnD,OAAO,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAWD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAU,EACV,KAAe,EACf,UAA8B,EAAE;IAEhC,MAAM,EAAE,WAAW,GAAG,kBAAkB,EAAE,GAAG,OAAO,CAAC;IACrD,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAClD,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAElC,6BAA6B;IAC7B,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAC1C,CAAC;IAEF,gDAAgD;IAChD,MAAM,eAAe,GAAG,gBAAgB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IAC9D,MAAM,cAAc,GAAG,kBAAkB,CAAC,eAAe,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAEzE,kEAAkE;IAClE,2EAA2E;IAC3E,MAAM,kBAAkB,GAAa,EAAE,CAAC;IAExC,KAAK,MAAM,CAAC,CAAC,EAAE,aAAa,CAAC,IAAI,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC;QAC1D,IAAI,aAAa,KAAK,CAAC,EAAE,CAAC;YACxB,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,kBAAkB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAEpC,MAAM,aAAa,GAAQ,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,6BAA6B;IAC7B,OAAO,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,kBAAkB,CAAC,GAAG,EAAE,CAAC;QACzC,IAAI,OAAO,KAAK,SAAS;YAAE,MAAM;QACjC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACrB,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAEnC,mDAAmD;QACnD,MAAM,aAAa,GAAG,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACnD,MAAM,qBAAqB,GAAa,EAAE,CAAC;QAC3C,IAAI,aAAa,EAAE,CAAC;YAClB,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;gBACnC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;gBAEzB,oEAAoE;gBACpE,IAAI,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;oBACjC,qBAAqB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;QACD,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,kBAAkB,CAAC,IAAI,CAAC,GAAG,qBAAqB,CAAC,CAAC;IACpD,CAAC;IAED,mBAAmB;IACnB,IAAI,aAAa,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,eAAe,CAAC,CAAC;QAC/D,MAAM,IAAI,+BAA+B,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;IACjE,CAAC;IAED,OAAO,aAAa,CAAC,OAAO,EAAE,CAAC;AACjC,CAAC"}

package/dist/toposort/toposort.d.ts

@@ -0,0 +1,30 @@
+interface ToposortOptions<T> {
+    /**
+     * Optional custom comparison function to break ties between nodes with the same topological level
+     *
+     * This allows for a stable topological sort that is consistent with the input order of nodes with the same topological level.
+     */
+    compareFunc?: (a: T, b: T) => number;
+}
+/**
+ * Performs a topological sort on a directed acyclic graph.
+ *
+ * @param nodes - The nodes to sort
+ * @param edges - The edges of the graph
+ * @param options - Optional options for the topological sort
+ * @returns The sorted nodes
+ */
+export declare function toposort<T>(nodes: T[], edges: [T, T][], options?: ToposortOptions<T>): T[];
+/**
+ * Performs a topological sort on a directed acyclic graph, always selecting
+ * the smallest available node according to the provided comparison function,
+ * yielding the lexicographically minimal ordering.
+ *
+ * @param nodes - The nodes to sort
+ * @param edges - The edges of the graph
+ * @param compareFunc - Optional custom comparison function to break ties between nodes with the same topological level (default is string comparison)
+ * @returns The sorted nodes
+ */
+export declare function toposortOrdered<T>(nodes: T[], edges: [T, T][], compareFunc?: (a: T, b: T) => number): T[];
+export {};
+//# sourceMappingURL=toposort.d.ts.map

package/dist/toposort/toposort.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"toposort.d.ts","sourceRoot":"","sources":["../../src/toposort/toposort.ts"],"names":[],"mappings":"AAoHA,UAAU,eAAe,CAAC,CAAC;IACzB;;;;OAIG;IACH,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;CACtC;AAED;;;;;;;GAOG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EACxB,KAAK,EAAE,CAAC,EAAE,EACV,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EACf,OAAO,GAAE,eAAe,CAAC,CAAC,CAAM,GAC/B,CAAC,EAAE,CAsDL;AAED;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAC/B,KAAK,EAAE,CAAC,EAAE,EACV,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EACf,WAAW,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAA2B,GACvD,CAAC,EAAE,CAEL"}

package/dist/toposort/toposort.js

@@ -0,0 +1,156 @@
+import TinyQueue from 'tinyqueue';
+import { ToposortCyclicalDependencyError, ToposortUnknownNodeError, } from './errors.js';
+/**
+ * Creates a map of outgoing edges from node indices to their target indices
+ */
+function makeOutgoingEdges(nodes, edgeArr) {
+    const outgoingEdgesMap = new Map();
+    for (const edge of edgeArr) {
+        const [source, target] = edge;
+        const sourceIndex = nodes.get(source);
+        const targetIndex = nodes.get(target);
+        // Check both source and target exist in the provided nodes set
+        if (sourceIndex === undefined)
+            throw new ToposortUnknownNodeError(source);
+        if (targetIndex === undefined)
+            throw new ToposortUnknownNodeError(target);
+        const sourceEdges = outgoingEdgesMap.get(sourceIndex);
+        if (sourceEdges) {
+            sourceEdges.add(targetIndex);
+        }
+        else {
+            outgoingEdgesMap.set(sourceIndex, new Set([targetIndex]));
+        }
+    }
+    return outgoingEdgesMap;
+}
+/**
+ * Creates a map of node indices to their in-degree
+ */
+function makeNodeInDegrees(outgoingEdgesMap, nodeLength) {
+    const nodeInDegrees = Array.from({ length: nodeLength }, () => 0);
+    for (const [, targets] of outgoingEdgesMap.entries()) {
+        for (const target of targets) {
+            nodeInDegrees[target]++;
+        }
+    }
+    return nodeInDegrees;
+}
+/**
+ * Detects cycles in a graph by checking if all nodes are included in the topological sort
+ */
+function detectCycle(nodes, visited, edges) {
+    // If all nodes were visited, no cycle exists
+    if (visited.size === nodes.length) {
+        return [];
+    }
+    // Run DFS from any unvisited node to find a cycle
+    const path = [];
+    const visitSet = new Set();
+    function dfs(node) {
+        if (visitSet.has(node)) {
+            path.push(node);
+            return true;
+        }
+        if (visited.has(node)) {
+            return false;
+        }
+        visitSet.add(node);
+        path.push(node);
+        const neighbors = edges.get(node) ?? new Set();
+        for (const neighbor of neighbors) {
+            if (dfs(neighbor)) {
+                return true;
+            }
+        }
+        path.pop();
+        visitSet.delete(node);
+        return false;
+    }
+    // For cycle detection, we need to find nodes that weren't visited
+    const unvistedNodeIdx = nodes.findIndex((node, idx) => !visited.has(idx));
+    if (unvistedNodeIdx === -1) {
+        return [];
+    }
+    // Start DFS from any unvisited node
+    dfs(unvistedNodeIdx);
+    // Convert path indices to actual nodes
+    return path.map((idx) => nodes[idx]);
+}
+/**
+ * Default comparison function for stable topological sort
+ */
+function defaultCompareFunc(a, b) {
+    if (typeof a === 'string' && typeof b === 'string') {
+        return a.localeCompare(b);
+    }
+    if (a === b)
+        return 0;
+    return a < b ? -1 : 1;
+}
+/**
+ * Performs a topological sort on a directed acyclic graph.
+ *
+ * @param nodes - The nodes to sort
+ * @param edges - The edges of the graph
+ * @param options - Optional options for the topological sort
+ * @returns The sorted nodes
+ */
+export function toposort(nodes, edges, options = {}) {
+    const { compareFunc } = options;
+    // Map each node to its index
+    const nodeIndexMap = new Map(nodes.map((node, index) => [node, index]));
+    // Create a map of outgoing edges from each node
+    const outgoingEdgesMap = makeOutgoingEdges(nodeIndexMap, edges);
+    const nodeInDegrees = makeNodeInDegrees(outgoingEdgesMap, nodes.length);
+    // Create a queue of nodes with no incoming edges (in-degree == 0)
+    const zeroInDegreeQueue = compareFunc
+        ? new TinyQueue([], (a, b) => compareFunc(nodes[a], nodes[b]))
+        : [];
+    for (const [i, nodeInDegree] of nodeInDegrees.entries()) {
+        if (nodeInDegree === 0) {
+            zeroInDegreeQueue.push(i);
+        }
+    }
+    const result = [];
+    const visited = new Set();
+    // Process nodes in BFS order
+    while (zeroInDegreeQueue.length > 0) {
+        const current = zeroInDegreeQueue.pop();
+        if (current === undefined)
+            break;
+        visited.add(current);
+        result.push(nodes[current]);
+        // Process all outgoing edges from the current node
+        const outgoingEdges = outgoingEdgesMap.get(current);
+        if (outgoingEdges) {
+            for (const target of outgoingEdges) {
+                nodeInDegrees[target]--;
+                // If the target node now has no incoming edges, add it to the queue
+                if (nodeInDegrees[target] === 0) {
+                    zeroInDegreeQueue.push(target);
+                }
+            }
+        }
+    }
+    // Check for cycles
+    if (result.length !== nodes.length) {
+        const cyclePath = detectCycle(nodes, visited, outgoingEdgesMap);
+        throw new ToposortCyclicalDependencyError(cyclePath);
+    }
+    return result;
+}
+/**
+ * Performs a topological sort on a directed acyclic graph, always selecting
+ * the smallest available node according to the provided comparison function,
+ * yielding the lexicographically minimal ordering.
+ *
+ * @param nodes - The nodes to sort
+ * @param edges - The edges of the graph
+ * @param compareFunc - Optional custom comparison function to break ties between nodes with the same topological level (default is string comparison)
+ * @returns The sorted nodes
+ */
+export function toposortOrdered(nodes, edges, compareFunc = defaultCompareFunc) {
+    return toposort(nodes, edges, { compareFunc });
+}
+//# sourceMappingURL=toposort.js.map

package/dist/toposort/toposort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"toposort.js","sourceRoot":"","sources":["../../src/toposort/toposort.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,WAAW,CAAC;AAElC,OAAO,EACL,+BAA+B,EAC/B,wBAAwB,GACzB,MAAM,aAAa,CAAC;AAErB;;GAEG;AACH,SAAS,iBAAiB,CACxB,KAAqB,EACrB,OAAiB;IAEjB,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAuB,CAAC;IACxD,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;QAC9B,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,+DAA+D;QAC/D,IAAI,WAAW,KAAK,SAAS;YAAE,MAAM,IAAI,wBAAwB,CAAC,MAAM,CAAC,CAAC;QAC1E,IAAI,WAAW,KAAK,SAAS;YAAE,MAAM,IAAI,wBAAwB,CAAC,MAAM,CAAC,CAAC;QAE1E,MAAM,WAAW,GAAG,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACtD,IAAI,WAAW,EAAE,CAAC;YAChB,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,gBAAgB,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IACD,OAAO,gBAAgB,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CACxB,gBAA0C,EAC1C,UAAkB;IAElB,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAClE,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,gBAAgB,CAAC,OAAO,EAAE,EAAE,CAAC;QACrD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAClB,KAAU,EACV,OAAoB,EACpB,KAA+B;IAE/B,6CAA6C;IAC7C,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QAClC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,kDAAkD;IAClD,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,SAAS,GAAG,CAAC,IAAY;QACvB,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEhB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACvD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAClB,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,kEAAkE;IAClE,MAAM,eAAe,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAE1E,IAAI,eAAe,KAAK,CAAC,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,oCAAoC;IACpC,GAAG,CAAC,eAAe,CAAC,CAAC;IAErB,uCAAuC;IACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAI,CAAI,EAAE,CAAI;IACvC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;QACnD,OAAO,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAWD;;;;;;;GAOG;AACH,MAAM,UAAU,QAAQ,CACtB,KAAU,EACV,KAAe,EACf,UAA8B,EAAE;IAEhC,MAAM,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC;IAEhC,6BAA6B;IAC7B,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAC1C,CAAC;IAEF,gDAAgD;IAChD,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IAChE,MAAM,aAAa,GAAG,iBAAiB,CAAC,gBAAgB,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAExE,kEAAkE;IAClE,MAAM,iBAAiB,GAAG,WAAW;QACnC,CAAC,CAAC,IAAI,SAAS,CAAS,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,CAAC,CAAE,EAAe,CAAC;IAErB,KAAK,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC;QACxD,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;YACvB,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,6BAA6B;IAC7B,OAAO,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,EAAE,CAAC;QACxC,IAAI,OAAO,KAAK,SAAS;YAAE,MAAM;QACjC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACrB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAE5B,mDAAmD;QACnD,MAAM,aAAa,GAAG,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACpD,IAAI,aAAa,EAAE,CAAC;YAClB,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;gBACnC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;gBAExB,oEAAoE;gBACpE,IAAI,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;oBAChC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC;QAChE,MAAM,IAAI,+BAA+B,CAAC,SAAS,CAAC,CAAC;IACvD,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAU,EACV,KAAe,EACf,cAAsC,kBAAkB;IAExD,OAAO,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC;AACjD,CAAC"}

package/dist/type-guards/index.d.ts

@@ -0,0 +1,2 @@
+export * from './not-empty.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/type-guards/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/type-guards/index.ts"],"names":[],"mappings":"AAAA,cAAc,gBAAgB,CAAC"}

package/dist/type-guards/index.js

@@ -0,0 +1,2 @@
+export * from './not-empty.js';
+//# sourceMappingURL=index.js.map

package/dist/type-guards/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/type-guards/index.ts"],"names":[],"mappings":"AAAA,cAAc,gBAAgB,CAAC"}

package/dist/type-guards/not-empty.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Type guard to check if a value is not null or undefined.
+ */
+export declare function notEmpty<TValue>(value: TValue | null | undefined): value is TValue;
+//# sourceMappingURL=not-empty.d.ts.map

package/dist/type-guards/not-empty.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"not-empty.d.ts","sourceRoot":"","sources":["../../src/type-guards/not-empty.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAC7B,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAC/B,KAAK,IAAI,MAAM,CAEjB"}

package/dist/type-guards/not-empty.js

@@ -0,0 +1,7 @@
+/**
+ * Type guard to check if a value is not null or undefined.
+ */
+export function notEmpty(value) {
+    return value !== null && value !== undefined;
+}
+//# sourceMappingURL=not-empty.js.map

package/dist/type-guards/not-empty.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"not-empty.js","sourceRoot":"","sources":["../../src/type-guards/not-empty.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,UAAU,QAAQ,CACtB,KAAgC;IAEhC,OAAO,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,CAAC;AAC/C,CAAC"}

package/dist/validators/case-validators.d.ts

@@ -0,0 +1,36 @@
+import { z } from 'zod';
+/**
+ * Regex for validating kebab case, e.g. "my-project".
+ */
+export declare const KEBAB_CASE_REGEX: RegExp;
+/**
+ * Regex for validating pascal case, e.g. "MyProject".
+ */
+export declare const PASCAL_CASE_REGEX: RegExp;
+/**
+ * Regex for validating camel case, e.g. "myProject".
+ */
+export declare const CAMEL_CASE_REGEX: RegExp;
+/**
+ * Regex for validating constant case, e.g. "MY_PROJECT".
+ */
+export declare const CONSTANT_CASE_REGEX: RegExp;
+export declare const CASE_VALIDATORS: {
+    /**
+     * Zod validator for validating kebab case, e.g. "my-project".
+     */
+    readonly KEBAB_CASE: z.ZodString;
+    /**
+     * Zod validator for validating pascal case, e.g. "MyProject".
+     */
+    readonly PASCAL_CASE: z.ZodString;
+    /**
+     * Zod validator for validating camel case, e.g. "myProject".
+     */
+    readonly CAMEL_CASE: z.ZodString;
+    /**
+     * Zod validator for validating constant case, e.g. "MY_PROJECT".
+     */
+    readonly CONSTANT_CASE: z.ZodString;
+};
+//# sourceMappingURL=case-validators.d.ts.map

package/dist/validators/case-validators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"case-validators.d.ts","sourceRoot":"","sources":["../../src/validators/case-validators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB;;GAEG;AACH,eAAO,MAAM,gBAAgB,QAAiB,CAAC;AAE/C;;GAEG;AACH,eAAO,MAAM,iBAAiB,QAAwB,CAAC;AAEvD;;GAEG;AACH,eAAO,MAAM,gBAAgB,QAAwB,CAAC;AAEtD;;GAEG;AACH,eAAO,MAAM,mBAAmB,QAAsB,CAAC;AAEvD,eAAO,MAAM,eAAe;IAC1B;;OAEG;;IAEH;;OAEG;;IAEH;;OAEG;;IAEH;;OAEG;;CAEK,CAAC"}

package/dist/validators/case-validators.js

@@ -0,0 +1,36 @@
+import { z } from 'zod';
+/**
+ * Regex for validating kebab case, e.g. "my-project".
+ */
+export const KEBAB_CASE_REGEX = /^[a-z0-9-]+$/;
+/**
+ * Regex for validating pascal case, e.g. "MyProject".
+ */
+export const PASCAL_CASE_REGEX = /^[A-Z][a-zA-Z0-9]*$/;
+/**
+ * Regex for validating camel case, e.g. "myProject".
+ */
+export const CAMEL_CASE_REGEX = /^[a-z][a-zA-Z0-9]*$/;
+/**
+ * Regex for validating constant case, e.g. "MY_PROJECT".
+ */
+export const CONSTANT_CASE_REGEX = /^[A-Z][A-Z0-9_]*$/;
+export const CASE_VALIDATORS = {
+    /**
+     * Zod validator for validating kebab case, e.g. "my-project".
+     */
+    KEBAB_CASE: z.string().regex(KEBAB_CASE_REGEX),
+    /**
+     * Zod validator for validating pascal case, e.g. "MyProject".
+     */
+    PASCAL_CASE: z.string().regex(PASCAL_CASE_REGEX),
+    /**
+     * Zod validator for validating camel case, e.g. "myProject".
+     */
+    CAMEL_CASE: z.string().regex(CAMEL_CASE_REGEX),
+    /**
+     * Zod validator for validating constant case, e.g. "MY_PROJECT".
+     */
+    CONSTANT_CASE: z.string().regex(CONSTANT_CASE_REGEX),
+};
+//# sourceMappingURL=case-validators.js.map

package/dist/validators/case-validators.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"case-validators.js","sourceRoot":"","sources":["../../src/validators/case-validators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB;;GAEG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,cAAc,CAAC;AAE/C;;GAEG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,qBAAqB,CAAC;AAEvD;;GAEG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,qBAAqB,CAAC;AAEtD;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,mBAAmB,CAAC;AAEvD,MAAM,CAAC,MAAM,eAAe,GAAG;IAC7B;;OAEG;IACH,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,gBAAgB,CAAC;IAC9C;;OAEG;IACH,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC;IAChD;;OAEG;IACH,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,gBAAgB,CAAC;IAC9C;;OAEG;IACH,aAAa,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,mBAAmB,CAAC;CAC5C,CAAC"}

package/dist/validators/index.d.ts

@@ -0,0 +1,4 @@
+export * from './case-validators.js';
+export * from './number-validators.js';
+export * from './transform-with-dynamic-schema.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/validators/index.ts"],"names":[],"mappings":"AAAA,cAAc,sBAAsB,CAAC;AACrC,cAAc,wBAAwB,CAAC;AACvC,cAAc,oCAAoC,CAAC"}

package/dist/validators/index.js

@@ -0,0 +1,4 @@
+export * from './case-validators.js';
+export * from './number-validators.js';
+export * from './transform-with-dynamic-schema.js';
+//# sourceMappingURL=index.js.map

package/dist/validators/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/validators/index.ts"],"names":[],"mappings":"AAAA,cAAc,sBAAsB,CAAC;AACrC,cAAc,wBAAwB,CAAC;AACvC,cAAc,oCAAoC,CAAC"}

package/dist/validators/number-validators.d.ts

@@ -0,0 +1,8 @@
+import { z } from 'zod';
+/**
+ * Zod number validators.
+ */
+export declare const NUMBER_VALIDATORS: {
+    POSITIVE_INT: z.ZodNumber;
+};
+//# sourceMappingURL=number-validators.d.ts.map

package/dist/validators/number-validators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"number-validators.d.ts","sourceRoot":"","sources":["../../src/validators/number-validators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAOxB;;GAEG;AACH,eAAO,MAAM,iBAAiB;;CAE7B,CAAC"}

package/dist/validators/number-validators.js

@@ -0,0 +1,12 @@
+import { z } from 'zod';
+/**
+ * Zod validator for a positive integer.
+ */
+const POSITIVE_INT = z.number().int().positive();
+/**
+ * Zod number validators.
+ */
+export const NUMBER_VALIDATORS = {
+    POSITIVE_INT,
+};
+//# sourceMappingURL=number-validators.js.map

package/dist/validators/number-validators.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"number-validators.js","sourceRoot":"","sources":["../../src/validators/number-validators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB;;GAEG;AACH,MAAM,YAAY,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC;AAEjD;;GAEG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,YAAY;CACb,CAAC"}

package/dist/validators/transform-with-dynamic-schema.d.ts

@@ -0,0 +1,10 @@
+import { type RefinementCtx, type ZodTypeAny } from 'zod';
+/**
+ * Transforms a value using a dynamic schema and forwards any issues to transform context.
+ *
+ * Note: This does not change the return type of the schema.
+ *
+ * @param schemaFn - A function returning a Zod schema based on the current object.
+ */
+export declare function transformWithDynamicSchema<TData extends object>(schemaFn: (data: TData) => ZodTypeAny | undefined, valuePath?: keyof TData): (data: TData, ctx: RefinementCtx) => TData;
+//# sourceMappingURL=transform-with-dynamic-schema.d.ts.map

package/dist/validators/transform-with-dynamic-schema.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"transform-with-dynamic-schema.d.ts","sourceRoot":"","sources":["../../src/validators/transform-with-dynamic-schema.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,aAAa,EAAK,KAAK,UAAU,EAAE,MAAM,KAAK,CAAC;AAE7D;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CAAC,KAAK,SAAS,MAAM,EAC7D,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,KAAK,UAAU,GAAG,SAAS,EACjD,SAAS,CAAC,EAAE,MAAM,KAAK,GACtB,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,aAAa,KAAK,KAAK,CA6B5C"}

package/dist/validators/transform-with-dynamic-schema.js

@@ -0,0 +1,33 @@
+import { z } from 'zod';
+/**
+ * Transforms a value using a dynamic schema and forwards any issues to transform context.
+ *
+ * Note: This does not change the return type of the schema.
+ *
+ * @param schemaFn - A function returning a Zod schema based on the current object.
+ */
+export function transformWithDynamicSchema(schemaFn, valuePath) {
+    return (data, ctx) => {
+        const schema = schemaFn(data);
+        if (!schema) {
+            return data;
+        }
+        const result = schema.safeParse((valuePath ? data[valuePath] : data) ?? undefined);
+        if (!result.success) {
+            for (const issue of result.error.issues) {
+                ctx.addIssue({
+                    ...issue,
+                    path: [...(valuePath ? [valuePath] : []), ...issue.path],
+                });
+            }
+            return z.NEVER;
+        }
+        return valuePath
+            ? {
+                ...data,
+                [valuePath]: result.data,
+            }
+            : result.data;
+    };
+}
+//# sourceMappingURL=transform-with-dynamic-schema.js.map

package/dist/validators/transform-with-dynamic-schema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"transform-with-dynamic-schema.js","sourceRoot":"","sources":["../../src/validators/transform-with-dynamic-schema.ts"],"names":[],"mappings":"AAAA,OAAO,EAAsB,CAAC,EAAmB,MAAM,KAAK,CAAC;AAE7D;;;;;;GAMG;AACH,MAAM,UAAU,0BAA0B,CACxC,QAAiD,EACjD,SAAuB;IAEvB,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QACnB,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAE9B,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAC7B,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,SAAS,CAClD,CAAC;QAEF,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBACxC,GAAG,CAAC,QAAQ,CAAC;oBACX,GAAG,KAAK;oBACR,IAAI,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAmB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC;iBACnE,CAAC,CAAC;YACL,CAAC;YACD,OAAO,CAAC,CAAC,KAAK,CAAC;QACjB,CAAC;QAED,OAAO,SAAS;YACd,CAAC,CAAC;gBACE,GAAG,IAAI;gBACP,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,IAA+B;aACpD;YACH,CAAC,CAAE,MAAM,CAAC,IAAc,CAAC;IAC7B,CAAC,CAAC;AACJ,CAAC"}