typekro 0.1.0

package/dist/core/dependencies/graph.js

@@ -0,0 +1,220 @@
+/**
+ * Dependency Graph Data Structure
+ *
+ * Represents dependencies between Kubernetes resources and provides
+ * efficient traversal and topological sorting capabilities.
+ */
+import { CircularDependencyError } from '../errors.js';
+export class DependencyGraph {
+    nodes = new Map();
+    /**
+     * Add a node to the dependency graph
+     */
+    addNode(id, resource) {
+        if (this.nodes.has(id)) {
+            throw new Error(`Node with id '${id}' already exists in dependency graph`);
+        }
+        this.nodes.set(id, {
+            id,
+            resource,
+            dependencies: new Set(),
+            dependents: new Set(),
+        });
+    }
+    /**
+     * Add a dependency edge from dependent to dependency
+     * @param dependentId - The resource that depends on another
+     * @param dependencyId - The resource being depended upon
+     */
+    addEdge(dependentId, dependencyId) {
+        const dependent = this.nodes.get(dependentId);
+        const dependency = this.nodes.get(dependencyId);
+        if (!dependent) {
+            throw new Error(`Dependent node '${dependentId}' not found in graph`);
+        }
+        if (!dependency) {
+            throw new Error(`Dependency node '${dependencyId}' not found in graph`);
+        }
+        dependent.dependencies.add(dependencyId);
+        dependency.dependents.add(dependentId);
+    }
+    /**
+     * Get all nodes in the graph
+     */
+    getNodes() {
+        return new Map(this.nodes);
+    }
+    /**
+     * Get a specific node by ID
+     */
+    getNode(id) {
+        return this.nodes.get(id);
+    }
+    /**
+     * Get all dependencies of a node
+     */
+    getDependencies(id) {
+        const node = this.nodes.get(id);
+        return node ? Array.from(node.dependencies) : [];
+    }
+    /**
+     * Get all dependents of a node
+     */
+    getDependents(id) {
+        const node = this.nodes.get(id);
+        return node ? Array.from(node.dependents) : [];
+    }
+    /**
+     * Check if the graph has any cycles
+     */
+    hasCycles() {
+        try {
+            this.getTopologicalOrder();
+            return false;
+        }
+        catch (error) {
+            return error instanceof CircularDependencyError;
+        }
+    }
+    /**
+     * Find cycles in the graph
+     */
+    findCycles() {
+        const visited = new Set();
+        const recursionStack = new Set();
+        const cycles = [];
+        const dfs = (nodeId, path) => {
+            if (recursionStack.has(nodeId)) {
+                // Found a cycle
+                const cycleStart = path.indexOf(nodeId);
+                cycles.push(path.slice(cycleStart).concat(nodeId));
+                return;
+            }
+            if (visited.has(nodeId)) {
+                return;
+            }
+            visited.add(nodeId);
+            recursionStack.add(nodeId);
+            path.push(nodeId);
+            const node = this.nodes.get(nodeId);
+            if (node) {
+                for (const dependencyId of node.dependencies) {
+                    dfs(dependencyId, [...path]);
+                }
+            }
+            recursionStack.delete(nodeId);
+            path.pop();
+        };
+        for (const nodeId of this.nodes.keys()) {
+            if (!visited.has(nodeId)) {
+                dfs(nodeId, []);
+            }
+        }
+        return cycles;
+    }
+    /**
+     * Get topological ordering of nodes
+     * Throws CircularDependencyError if cycles are detected
+     */
+    getTopologicalOrder() {
+        const inDegree = new Map();
+        const queue = [];
+        const result = [];
+        // Initialize in-degree count
+        for (const [nodeId, node] of this.nodes) {
+            inDegree.set(nodeId, node.dependencies.size);
+            if (node.dependencies.size === 0) {
+                queue.push(nodeId);
+            }
+        }
+        // Process nodes with no dependencies
+        while (queue.length > 0) {
+            const nodeId = queue.shift();
+            if (!nodeId)
+                break;
+            result.push(nodeId);
+            const node = this.nodes.get(nodeId);
+            if (!node)
+                continue;
+            for (const dependentId of node.dependents) {
+                const currentInDegree = inDegree.get(dependentId);
+                if (currentInDegree === undefined)
+                    continue;
+                const newInDegree = currentInDegree - 1;
+                inDegree.set(dependentId, newInDegree);
+                if (newInDegree === 0) {
+                    queue.push(dependentId);
+                }
+            }
+        }
+        // Check for cycles
+        if (result.length !== this.nodes.size) {
+            const cycles = this.findCycles();
+            const cycle = cycles[0] || [];
+            const cycleStr = `${cycle.join(' -> ')} -> ${cycle[0]}`;
+            throw new CircularDependencyError(`Circular dependency detected: ${cycleStr}`, cycle);
+        }
+        return result;
+    }
+    /**
+     * Get nodes that have no dependencies (can be deployed first)
+     */
+    getRootNodes() {
+        return Array.from(this.nodes.entries())
+            .filter(([_, node]) => node.dependencies.size === 0)
+            .map(([id, _]) => id);
+    }
+    /**
+     * Get nodes that have no dependents (can be deleted first during rollback)
+     */
+    getLeafNodes() {
+        return Array.from(this.nodes.entries())
+            .filter(([_, node]) => node.dependents.size === 0)
+            .map(([id, _]) => id);
+    }
+    /**
+     * Clone the dependency graph
+     */
+    clone() {
+        const cloned = new DependencyGraph();
+        // Add all nodes
+        for (const [id, node] of this.nodes) {
+            cloned.addNode(id, node.resource);
+        }
+        // Add all edges
+        for (const [id, node] of this.nodes) {
+            for (const dependencyId of node.dependencies) {
+                cloned.addEdge(id, dependencyId);
+            }
+        }
+        return cloned;
+    }
+    /**
+     * Get a subgraph containing only the specified nodes and their relationships
+     */
+    getSubgraph(nodeIds) {
+        const subgraph = new DependencyGraph();
+        const nodeIdSet = new Set(nodeIds);
+        // Add nodes that exist in the original graph
+        for (const nodeId of nodeIds) {
+            const node = this.nodes.get(nodeId);
+            if (node) {
+                subgraph.addNode(nodeId, node.resource);
+            }
+        }
+        // Add edges between nodes in the subgraph
+        for (const nodeId of nodeIds) {
+            const node = this.nodes.get(nodeId);
+            if (node) {
+                for (const dependencyId of node.dependencies) {
+                    if (nodeIdSet.has(dependencyId)) {
+                        subgraph.addEdge(nodeId, dependencyId);
+                    }
+                }
+            }
+        }
+        return subgraph;
+    }
+}
+// CircularDependencyError is now imported from ../errors.js
+//# sourceMappingURL=graph.js.map

package/dist/core/dependencies/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../../src/core/dependencies/graph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AAIvD,MAAM,OAAO,eAAe;IAClB,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;IAElD;;OAEG;IACH,OAAO,CAAC,EAAU,EAAE,QAA2D;QAC7E,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE,sCAAsC,CAAC,CAAC;QAC7E,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE;YACjB,EAAE;YACF,QAAQ;YACR,YAAY,EAAE,IAAI,GAAG,EAAE;YACvB,UAAU,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,WAAmB,EAAE,YAAoB;QAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAEhD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,mBAAmB,WAAW,sBAAsB,CAAC,CAAC;QACxE,CAAC;QACD,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,oBAAoB,YAAY,sBAAsB,CAAC,CAAC;QAC1E,CAAC;QAED,SAAS,CAAC,YAAY,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACzC,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,EAAU;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACnD,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,EAAU;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,SAAS;QACP,IAAI,CAAC;YACH,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,KAAK,YAAY,uBAAuB,CAAC;QAClD,CAAC;IACH,CAAC;IAED;;OAEG;IACH,UAAU;QACR,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,MAAM,GAAe,EAAE,CAAC;QAE9B,MAAM,GAAG,GAAG,CAAC,MAAc,EAAE,IAAc,EAAQ,EAAE;YACnD,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC/B,gBAAgB;gBAChB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;gBACnD,OAAO;YACT,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxB,OAAO;YACT,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAElB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,MAAM,YAAY,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;oBAC7C,GAAG,CAAC,YAAY,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;YAED,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC9B,IAAI,CAAC,GAAG,EAAE,CAAC;QACb,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,mBAAmB;QACjB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,6BAA6B;QAC7B,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACxC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YAC7C,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACjC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM;gBAAE,MAAM;YACnB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEpB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBAC1C,MAAM,eAAe,GAAG,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBAClD,IAAI,eAAe,KAAK,SAAS;oBAAE,SAAS;gBAC5C,MAAM,WAAW,GAAG,eAAe,GAAG,CAAC,CAAC;gBACxC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;gBAEvC,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QAED,mBAAmB;QACnB,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC9B,MAAM,QAAQ,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACxD,MAAM,IAAI,uBAAuB,CAAC,iCAAiC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC;QACxF,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,YAAY;QACV,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;aACpC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,KAAK,CAAC,CAAC;aACnD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,YAAY;QACV,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;aACpC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,CAAC;aACjD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QAErC,gBAAgB;QAChB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACpC,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,CAAC;QAED,gBAAgB;QAChB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACpC,KAAK,MAAM,YAAY,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBAC7C,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,OAAiB;QAC3B,MAAM,QAAQ,GAAG,IAAI,eAAe,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QAEnC,6CAA6C;QAC7C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,IAAI,EAAE,CAAC;gBACT,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,MAAM,YAAY,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;oBAC7C,IAAI,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;wBAChC,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;oBACzC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAED,4DAA4D"}

package/dist/core/dependencies/index.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Dependencies module exports
+ */
+export type { DependencyNode } from '../types/dependencies.js';
+export { DependencyGraph } from './graph.js';
+export { DependencyResolver } from './resolver.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/core/dependencies/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/dependencies/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,YAAY,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAE/D,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAE7C,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC"}

package/dist/core/dependencies/index.js

@@ -0,0 +1,8 @@
+/**
+ * Dependencies module exports
+ */
+// Dependency graph
+export { DependencyGraph } from './graph.js';
+// Dependency resolution
+export { DependencyResolver } from './resolver.js';
+//# sourceMappingURL=index.js.map

package/dist/core/dependencies/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/dependencies/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH,mBAAmB;AACnB,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC7C,wBAAwB;AACxB,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC"}

package/dist/core/dependencies/resolver.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Dependency Resolution Engine
+ *
+ * Analyzes Kubernetes resources to build dependency graphs and provides
+ * topological ordering for deployment.
+ */
+import type { DeployableK8sResource, Enhanced } from '../types/kubernetes.js';
+import { DependencyGraph } from './graph.js';
+export declare class DependencyResolver {
+    private logger;
+    /**
+     * Build a dependency graph from a collection of Kubernetes resources
+     */
+    buildDependencyGraph(resources: DeployableK8sResource<Enhanced<unknown, unknown>>[]): DependencyGraph;
+    /**
+     * Get topological ordering of resources for deployment
+     */
+    getTopologicalOrder(graph: DependencyGraph): string[];
+    /**
+     * Validate that the dependency graph has no cycles
+     */
+    validateNoCycles(graph: DependencyGraph): void;
+    /**
+     * Extract all references from a resource
+     */
+    private extractReferences;
+    /**
+     * Parse CEL expressions to extract resource references
+     */
+    private parseCelReferences;
+    /**
+     * Analyze deployment order and identify parallelizable resources
+     */
+    analyzeDeploymentOrder(graph: DependencyGraph): DeploymentPlan;
+    /**
+     * Get rollback order (reverse of deployment order)
+     */
+    getRollbackOrder(graph: DependencyGraph): string[];
+    /**
+     * Find resources that can be deployed independently
+     */
+    findIndependentResources(graph: DependencyGraph): string[];
+    /**
+     * Find resources that nothing else depends on
+     */
+    findTerminalResources(graph: DependencyGraph): string[];
+}
+export interface DeploymentPlan {
+    levels: string[][];
+    totalResources: number;
+    maxParallelism: number;
+}
+//# sourceMappingURL=resolver.d.ts.map

package/dist/core/dependencies/resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolver.d.ts","sourceRoot":"","sources":["../../../src/core/dependencies/resolver.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,OAAO,KAAK,EAAE,qBAAqB,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAC9E,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAE7C,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,MAAM,CAA6C;IAE3D;;OAEG;IACH,oBAAoB,CAClB,SAAS,EAAE,qBAAqB,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,GAC7D,eAAe;IAgClB;;OAEG;IACH,mBAAmB,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,EAAE;IAIrD;;OAEG;IACH,gBAAgB,CAAC,KAAK,EAAE,eAAe,GAAG,IAAI;IAS9C;;OAEG;IACH,OAAO,CAAC,iBAAiB;IA+BzB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAuB1B;;OAEG;IACH,sBAAsB,CAAC,KAAK,EAAE,eAAe,GAAG,cAAc;IAsC9D;;OAEG;IACH,gBAAgB,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,EAAE;IAKlD;;OAEG;IACH,wBAAwB,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,EAAE;IAI1D;;OAEG;IACH,qBAAqB,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,EAAE;CAGxD;AAED,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;CACxB"}

package/dist/core/dependencies/resolver.js

@@ -0,0 +1,167 @@
+/**
+ * Dependency Resolution Engine
+ *
+ * Analyzes Kubernetes resources to build dependency graphs and provides
+ * topological ordering for deployment.
+ */
+import { isCelExpression, isKubernetesRef } from './type-guards.js';
+import { CircularDependencyError } from '../errors.js';
+import { getComponentLogger } from '../logging/index.js';
+import { KUBERNETES_REF_BRAND } from '../constants/brands.js';
+import { DependencyGraph } from './graph.js';
+export class DependencyResolver {
+    logger = getComponentLogger('dependency-resolver');
+    /**
+     * Build a dependency graph from a collection of Kubernetes resources
+     */
+    buildDependencyGraph(resources) {
+        const graph = new DependencyGraph();
+        // Add all resources as nodes first
+        for (const resource of resources) {
+            graph.addNode(resource.id, resource);
+        }
+        // Analyze each resource for references and add edges
+        for (const resource of resources) {
+            const references = this.extractReferences(resource);
+            for (const ref of references) {
+                // Skip schema references (these are internal TypeKro references)
+                if (ref.resourceId !== '__schema__') {
+                    try {
+                        graph.addEdge(resource.id, ref.resourceId);
+                    }
+                    catch {
+                        // Log warning if referenced resource doesn't exist in the graph
+                        // This might be an external reference that will be resolved at runtime
+                        this.logger.warn('Reference to unknown resource', {
+                            referencedResourceId: ref.resourceId,
+                            sourceResourceId: resource.id
+                        });
+                    }
+                }
+            }
+        }
+        return graph;
+    }
+    /**
+     * Get topological ordering of resources for deployment
+     */
+    getTopologicalOrder(graph) {
+        return graph.getTopologicalOrder();
+    }
+    /**
+     * Validate that the dependency graph has no cycles
+     */
+    validateNoCycles(graph) {
+        if (graph.hasCycles()) {
+            const cycles = graph.findCycles();
+            const cycle = cycles[0] || [];
+            const cycleStr = `${cycle.join(' -> ')} -> ${cycle[0]}`;
+            throw new CircularDependencyError(`Circular dependency detected: ${cycleStr}`, cycle);
+        }
+    }
+    /**
+     * Extract all references from a resource
+     */
+    extractReferences(resource) {
+        const refs = [];
+        const traverse = (obj, path = '') => {
+            if (obj === null || obj === undefined) {
+                return;
+            }
+            if (isKubernetesRef(obj)) {
+                refs.push(obj);
+            }
+            else if (isCelExpression(obj)) {
+                // Parse CEL expression for references
+                const celRefs = this.parseCelReferences(obj.expression);
+                refs.push(...celRefs);
+            }
+            else if (Array.isArray(obj)) {
+                obj.forEach((item, index) => {
+                    traverse(item, `${path}[${index}]`);
+                });
+            }
+            else if (typeof obj === 'object') {
+                for (const [key, value] of Object.entries(obj)) {
+                    traverse(value, path ? `${path}.${key}` : key);
+                }
+            }
+        };
+        traverse(resource);
+        return refs;
+    }
+    /**
+     * Parse CEL expressions to extract resource references
+     */
+    parseCelReferences(expression) {
+        const refs = [];
+        // Simple regex to find resource references in CEL expressions
+        // Pattern: resourceId.section.field (e.g., database.status.endpoint)
+        const refPattern = /(\w+)\.(\w+)\.(\w+)/g;
+        let match = refPattern.exec(expression);
+        while (match !== null) {
+            const [, resourceId, section, field] = match;
+            refs.push({
+                [KUBERNETES_REF_BRAND]: true,
+                resourceId,
+                fieldPath: `${section}.${field}`,
+            });
+            match = refPattern.exec(expression);
+        }
+        return refs;
+    }
+    /**
+     * Analyze deployment order and identify parallelizable resources
+     */
+    analyzeDeploymentOrder(graph) {
+        const topologicalOrder = graph.getTopologicalOrder();
+        const levels = [];
+        const processed = new Set();
+        // Group resources by dependency level
+        while (processed.size < topologicalOrder.length) {
+            const currentLevel = [];
+            for (const resourceId of topologicalOrder) {
+                if (processed.has(resourceId)) {
+                    continue;
+                }
+                // Check if all dependencies are already processed
+                const dependencies = graph.getDependencies(resourceId);
+                const allDependenciesProcessed = dependencies.every((dep) => processed.has(dep));
+                if (allDependenciesProcessed) {
+                    currentLevel.push(resourceId);
+                }
+            }
+            if (currentLevel.length === 0) {
+                throw new Error('Unable to determine deployment order - possible circular dependency');
+            }
+            levels.push(currentLevel);
+            currentLevel.forEach((id) => processed.add(id));
+        }
+        return {
+            levels,
+            totalResources: topologicalOrder.length,
+            maxParallelism: Math.max(...levels.map((level) => level.length)),
+        };
+    }
+    /**
+     * Get rollback order (reverse of deployment order)
+     */
+    getRollbackOrder(graph) {
+        const deploymentOrder = graph.getTopologicalOrder();
+        return deploymentOrder.reverse();
+    }
+    /**
+     * Find resources that can be deployed independently
+     */
+    findIndependentResources(graph) {
+        return graph.getRootNodes();
+    }
+    /**
+     * Find resources that nothing else depends on
+     */
+    findTerminalResources(graph) {
+        return graph.getLeafNodes();
+    }
+}
+// CircularDependencyError is now imported from ../errors.js
+//# sourceMappingURL=resolver.js.map

package/dist/core/dependencies/resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolver.js","sourceRoot":"","sources":["../../../src/core/dependencies/resolver.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACpE,OAAO,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AACvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAG9D,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAE7C,MAAM,OAAO,kBAAkB;IACrB,MAAM,GAAG,kBAAkB,CAAC,qBAAqB,CAAC,CAAC;IAE3D;;OAEG;IACH,oBAAoB,CAClB,SAA8D;QAE9D,MAAM,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAEpC,mCAAmC;QACnC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QACvC,CAAC;QAED,qDAAqD;QACrD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;YAEpD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;gBAC7B,iEAAiE;gBACjE,IAAI,GAAG,CAAC,UAAU,KAAK,YAAY,EAAE,CAAC;oBACpC,IAAI,CAAC;wBACH,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;oBAC7C,CAAC;oBAAC,MAAM,CAAC;wBACP,gEAAgE;wBAChE,uEAAuE;wBACvE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,+BAA+B,EAAE;4BAChD,oBAAoB,EAAE,GAAG,CAAC,UAAU;4BACpC,gBAAgB,EAAE,QAAQ,CAAC,EAAE;yBAC9B,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,KAAsB;QACxC,OAAO,KAAK,CAAC,mBAAmB,EAAE,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,KAAsB;QACrC,IAAI,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC;YACtB,MAAM,MAAM,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC9B,MAAM,QAAQ,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACxD,MAAM,IAAI,uBAAuB,CAAC,iCAAiC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC;QACxF,CAAC;IACH,CAAC;IAED;;OAEG;IACK,iBAAiB,CACvB,QAA2D;QAE3D,MAAM,IAAI,GAAoB,EAAE,CAAC;QAEjC,MAAM,QAAQ,GAAG,CAAC,GAAY,EAAE,OAAe,EAAE,EAAQ,EAAE;YACzD,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACtC,OAAO;YACT,CAAC;YAED,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC;iBAAM,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC;gBAChC,sCAAsC;gBACtC,MAAM,OAAO,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBACxD,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;YACxB,CAAC;iBAAM,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC9B,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;oBAC1B,QAAQ,CAAC,IAAI,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC;gBACtC,CAAC,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;gBACnC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC/C,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,UAAkB;QAC3C,MAAM,IAAI,GAAoB,EAAE,CAAC;QAEjC,8DAA8D;QAC9D,qEAAqE;QACrE,MAAM,UAAU,GAAG,sBAAsB,CAAC;QAC1C,IAAI,KAAK,GAA2B,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEhE,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;YACtB,MAAM,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC;YAE7C,IAAI,CAAC,IAAI,CAAC;gBACR,CAAC,oBAAoB,CAAC,EAAE,IAAI;gBAC5B,UAAU;gBACV,SAAS,EAAE,GAAG,OAAO,IAAI,KAAK,EAAE;aAChB,CAAC,CAAC;YAEpB,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACtC,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,sBAAsB,CAAC,KAAsB;QAC3C,MAAM,gBAAgB,GAAG,KAAK,CAAC,mBAAmB,EAAE,CAAC;QACrD,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,sCAAsC;QACtC,OAAO,SAAS,CAAC,IAAI,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC;YAChD,MAAM,YAAY,GAAa,EAAE,CAAC;YAElC,KAAK,MAAM,UAAU,IAAI,gBAAgB,EAAE,CAAC;gBAC1C,IAAI,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC9B,SAAS;gBACX,CAAC;gBAED,kDAAkD;gBAClD,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;gBACvD,MAAM,wBAAwB,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBAEjF,IAAI,wBAAwB,EAAE,CAAC;oBAC7B,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;YAED,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC9B,MAAM,IAAI,KAAK,CAAC,qEAAqE,CAAC,CAAC;YACzF,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC1B,YAAY,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,OAAO;YACL,MAAM;YACN,cAAc,EAAE,gBAAgB,CAAC,MAAM;YACvC,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;SACjE,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,KAAsB;QACrC,MAAM,eAAe,GAAG,KAAK,CAAC,mBAAmB,EAAE,CAAC;QACpD,OAAO,eAAe,CAAC,OAAO,EAAE,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,wBAAwB,CAAC,KAAsB;QAC7C,OAAO,KAAK,CAAC,YAAY,EAAE,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,qBAAqB,CAAC,KAAsB;QAC1C,OAAO,KAAK,CAAC,YAAY,EAAE,CAAC;IAC9B,CAAC;CACF;AAQD,4DAA4D"}

package/dist/core/dependencies/type-guards.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Type Guards for Dependency Resolution
+ *
+ * This module provides type guard functions specifically for dependency resolution
+ * without importing from core types to avoid circular dependencies.
+ */
+import type { KubernetesRef, CelExpression } from '../types/common.js';
+/**
+ * Type guard to check if a value is a compile-time KubernetesRef.
+* Note: At runtime, these are the objects created by the proxy.
+*/
+export declare function isKubernetesRef(obj: unknown): obj is KubernetesRef<unknown>;
+/**
+ * Type guard to check if a value is a CelExpression
+ */
+export declare function isCelExpression(value: unknown): value is CelExpression;
+//# sourceMappingURL=type-guards.d.ts.map

package/dist/core/dependencies/type-guards.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-guards.d.ts","sourceRoot":"","sources":["../../../src/core/dependencies/type-guards.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAEvE;;;EAGE;AACF,wBAAgB,eAAe,CAAC,GAAG,EAAE,OAAO,GAAG,GAAG,IAAI,aAAa,CAAC,OAAO,CAAC,CAS3E;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,aAAa,CAatE"}

package/dist/core/dependencies/type-guards.js

@@ -0,0 +1,35 @@
+/**
+ * Type Guards for Dependency Resolution
+ *
+ * This module provides type guard functions specifically for dependency resolution
+ * without importing from core types to avoid circular dependencies.
+ */
+import { KUBERNETES_REF_BRAND, CEL_EXPRESSION_BRAND } from '../constants/brands.js';
+/**
+ * Type guard to check if a value is a compile-time KubernetesRef.
+* Note: At runtime, these are the objects created by the proxy.
+*/
+export function isKubernetesRef(obj) {
+    // A KubernetesRef is an object that has our specific brand property.
+    // We check for the function type as well, since our ref factory is a proxy around a function.
+    // Note: We access the property directly since it's defined as non-enumerable
+    // FIX: Use Reflect.get to reliably trigger the proxy's 'get' trap instead of relying on the 'in' operator, which needs a 'has' trap.
+    if ((typeof obj !== 'object' && typeof obj !== 'function') || obj === null) {
+        return false;
+    }
+    return Reflect.get(obj, KUBERNETES_REF_BRAND) === true;
+}
+/**
+ * Type guard to check if a value is a CelExpression
+ */
+export function isCelExpression(value) {
+    if (typeof value !== 'object' || value === null) {
+        return false;
+    }
+    const obj = value;
+    return (CEL_EXPRESSION_BRAND in obj &&
+        obj[CEL_EXPRESSION_BRAND] === true &&
+        'expression' in obj &&
+        typeof obj.expression === 'string');
+}
+//# sourceMappingURL=type-guards.js.map

package/dist/core/dependencies/type-guards.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-guards.js","sourceRoot":"","sources":["../../../src/core/dependencies/type-guards.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,oBAAoB,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAGpF;;;EAGE;AACF,MAAM,UAAU,eAAe,CAAC,GAAY;IAC1C,qEAAqE;IACvE,8FAA8F;IAC5F,6EAA6E;IAC7E,qIAAqI;IACrI,IAAI,CAAC,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,UAAU,CAAC,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;QAC3E,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,oBAAoB,CAAC,KAAK,IAAI,CAAC;AACzD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,KAAc;IAC5C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAChD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,GAAG,GAAG,KAAyC,CAAC;IAEtD,OAAO,CACL,oBAAoB,IAAI,GAAG;QAC3B,GAAG,CAAC,oBAAoB,CAAC,KAAK,IAAI;QAClC,YAAY,IAAI,GAAG;QACnB,OAAO,GAAG,CAAC,UAAU,KAAK,QAAQ,CACnC,CAAC;AACJ,CAAC"}

package/dist/core/deployment/deployment-strategies.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Deployment Strategies
+ *
+ * This module provides a strategy pattern for different deployment modes,
+ * consolidating the common deployment orchestration logic.
+ *
+ * This is now a re-export module that imports from focused strategy modules
+ * to maintain backward compatibility while improving code organization.
+ */
+export type { DeploymentStrategy } from './strategies/index.js';
+export { BaseDeploymentStrategy, DirectDeploymentStrategy, KroDeploymentStrategy, AlchemyDeploymentStrategy } from './strategies/index.js';
+//# sourceMappingURL=deployment-strategies.d.ts.map

package/dist/core/deployment/deployment-strategies.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"deployment-strategies.d.ts","sourceRoot":"","sources":["../../../src/core/deployment/deployment-strategies.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,YAAY,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAChE,OAAO,EACL,sBAAsB,EACtB,wBAAwB,EACxB,qBAAqB,EACrB,yBAAyB,EAC1B,MAAM,uBAAuB,CAAC"}

package/dist/core/deployment/deployment-strategies.js

@@ -0,0 +1,11 @@
+/**
+ * Deployment Strategies
+ *
+ * This module provides a strategy pattern for different deployment modes,
+ * consolidating the common deployment orchestration logic.
+ *
+ * This is now a re-export module that imports from focused strategy modules
+ * to maintain backward compatibility while improving code organization.
+ */
+export { BaseDeploymentStrategy, DirectDeploymentStrategy, KroDeploymentStrategy, AlchemyDeploymentStrategy } from './strategies/index.js';
+//# sourceMappingURL=deployment-strategies.js.map

package/dist/core/deployment/deployment-strategies.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deployment-strategies.js","sourceRoot":"","sources":["../../../src/core/deployment/deployment-strategies.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,EACL,sBAAsB,EACtB,wBAAwB,EACxB,qBAAqB,EACrB,yBAAyB,EAC1B,MAAM,uBAAuB,CAAC"}