agentic-qe 2.6.5 → 2.6.6

package/dist/code-intelligence/analysis/mincut/JsMinCut.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"JsMinCut.js","sourceRoot":"","sources":["../../../../src/code-intelligence/analysis/mincut/JsMinCut.ts"],"names":[],"mappings":";;;AACA,wDAAkD;AAElD,MAAM,MAAM,GAAG,kBAAM,CAAC,WAAW,EAAE,CAAC;AAEpC;;;;;;;;GAQG;AACH,MAAa,QAAQ;IACnB;;;;;;OAMG;IACI,aAAa,CAAC,KAAuB,EAAE,gBAAgB,GAAG,IAAI;QACnE,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,2CAA2C;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;QAEvD,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QACrC,CAAC;QAED,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACjD,CAAC;QAED,6BAA6B;QAC7B,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAEnE,iBAAiB;QACjB,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAElE,MAAM,iBAAiB,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAExD,OAAO;YACL,QAAQ,EAAE,MAAM;YAChB,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;YAClC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;YAClC,QAAQ;YACR,aAAa,EAAE,cAAc;YAC7B,iBAAiB;SAClB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,KAAuB,EAAE,gBAAyB;QACnE,MAAM,SAAS,GAAG,IAAI,GAAG,EAA+B,CAAC;QACzD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,6BAA6B;QAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACpC,CAAC;QAED,oCAAoC;QACpC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,gBAAgB,EAAE,CAAC;YACrB,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,CAAC;QAED,2CAA2C;QAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YAExE,mDAAmD;YACnD,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7C,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAE7C,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC;gBAC3B,sCAAsC;gBACtC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;gBACvE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;QAED,OAAO;YACL,SAAS;YACT,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC;YAC1B,SAAS,EAAE,OAAO,CAAC,IAAI;SACxB,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,WAAW,CAAC,KAAkB;QAKpC,4DAA4D;QAC5D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;QAClD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QAED,iCAAiC;QACjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAA+B,CAAC;QAC1D,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;YACtE,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;QAED,IAAI,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,WAAW,GAAG,QAAQ,CAAC;QAC3B,IAAI,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,IAAI,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEvC,uCAAuC;QACvC,OAAO,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC5B,wCAAwC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;YAE5D,yDAAyD;YACzD,IAAI,KAAK,CAAC,QAAQ,GAAG,WAAW,EAAE,CAAC;gBACjC,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC;gBAE7B,uDAAuD;gBACvD,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAE,CAAC;gBACtD,cAAc,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;gBACtC,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;gBAEnC,MAAM,eAAe,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAChD,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;oBACnC,IAAI,IAAI,KAAK,KAAK,CAAC,UAAU,EAAE,CAAC;wBAC9B,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;wBACpC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBACrC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACjD,CAAC;gBACH,CAAC;YACH,CAAC;YAED,sCAAsC;YACtC,IAAI,CAAC,UAAU,CACb,UAAU,EACV,WAAW,EACX,UAAU,EACV,KAAK,CAAC,UAAU,EAChB,KAAK,CAAC,UAAU,CACjB,CAAC;QACJ,CAAC;QAED,OAAO;YACL,MAAM,EAAE,WAAW;YACnB,UAAU,EAAE,cAAc;YAC1B,UAAU,EAAE,cAAc;SAC3B,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,eAAe,CACrB,SAA2C,EAC3C,WAAwB;QAExB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAEtC,+BAA+B;QAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,CAAC,CAAC;QAEzC,2DAA2D;QAC3D,IAAI,YAAY,GAAG,SAAS,CAAC;QAC7B,IAAI,QAAQ,GAAG,SAAS,CAAC;QAEzB,yCAAyC;QACzC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE1C,qCAAqC;QACrC,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,mDAAmD;QACnD,OAAO,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YAC/B,uCAAuC;YACvC,IAAI,SAAS,GAAG,CAAC,QAAQ,CAAC;YAC1B,IAAI,OAAO,GAAG,EAAE,CAAC;YAEjB,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;YACnD,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;gBAC1C,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;oBACzC,SAAS,GAAG,MAAM,CAAC;oBACnB,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;YAED,yCAAyC;YACzC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACjB,YAAY,GAAG,QAAQ,CAAC;YACxB,QAAQ,GAAG,OAAO,CAAC;YAEnB,gEAAgE;YAChE,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;YAC3C,MAAM,eAAe,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;YACzD,KAAK,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,IAAI,eAAe,EAAE,CAAC;gBACrD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACvB,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;gBACnE,CAAC;YACH,CAAC;QACH,CAAC;QAED,uEAAuE;QACvE,mEAAmE;QACnE,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAE5C,OAAO;YACL,QAAQ;YACR,UAAU,EAAE,QAAQ;YACpB,UAAU,EAAE,YAAY;SACzB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,UAAU,CAChB,SAA2C,EAC3C,WAAwB,EACxB,UAAoC,EACpC,UAAkB,EAClB,UAAkB;QAElB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;QAC7C,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;QAE7C,8CAA8C;QAC9C,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;QACvD,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,cAAc,EAAE,CAAC;YAChD,IAAI,QAAQ,KAAK,UAAU;gBAAE,SAAS,CAAC,iBAAiB;YAExD,iDAAiD;YACjD,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACnD,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,aAAa,GAAG,MAAM,CAAC,CAAC;YAEhD,sBAAsB;YACtB,MAAM,WAAW,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YAC7C,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC/B,WAAW,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;QAC3E,CAAC;QAED,oBAAoB;QACpB,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;QAChD,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;QAChD,MAAM,gBAAgB,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACjD,gBAAgB,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAExD,qBAAqB;QACrB,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC7B,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC/B,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,KAAuB,EACvB,UAAuB,EACvB,UAAuB;QAEvB,MAAM,QAAQ,GAAG,EAAE,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC9C,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAE9C,gEAAgE;YAChE,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,QAAQ,CAAC,IAAI,CAAC;oBACZ,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ;iBACxB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,SAAiB;QACnC,OAAO;YACL,QAAQ,EAAE,CAAC;YACX,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,EAAE;YACZ,aAAa,EAAE,cAAc;YAC7B,iBAAiB,EAAE,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS;SACjD,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,KAAkB,EAAE,SAAiB;QAC5D,OAAO;YACL,QAAQ,EAAE,CAAC;YACX,UAAU,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,EAAE;YACZ,aAAa,EAAE,cAAc;YAC7B,iBAAiB,EAAE,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS;SACjD,CAAC;IACJ,CAAC;CACF;AA5TD,4BA4TC"}

package/dist/code-intelligence/analysis/mincut/MinCutAnalyzer.d.ts

@@ -0,0 +1,92 @@
+import { MinCutResult, MinCutGraphInput, MinCutConfig } from './types.js';
+/**
+ * MinCut analyzer using the Stoer-Wagner algorithm.
+ *
+ * This is a pure JavaScript implementation optimized for code intelligence
+ * and fleet topology analysis. The algorithm runs in O(V³) time complexity
+ * and O(V²) space complexity.
+ *
+ * @example
+ * ```typescript
+ * const analyzer = new MinCutAnalyzer();
+ * const result = await analyzer.computeMinCut({
+ *   nodes: [{ id: 'A', label: 'A' }, { id: 'B', label: 'B' }],
+ *   edges: [{ source: 'A', target: 'B', weight: 1.0 }],
+ *   directed: false,
+ * });
+ * console.log('Min cut value:', result.cutValue);
+ * console.log('Partitions:', result.partition1, result.partition2);
+ * ```
+ *
+ * @see JsMinCut for the underlying Stoer-Wagner implementation
+ */
+export declare class MinCutAnalyzer {
+    private config;
+    private jsMinCut;
+    /**
+     * Create a new MinCutAnalyzer
+     *
+     * @param config - Partial configuration (merged with defaults)
+     */
+    constructor(config?: Partial<MinCutConfig>);
+    /**
+     * Compute the minimum cut of a graph using the Stoer-Wagner algorithm
+     *
+     * @param graph - Input graph with nodes and edges
+     * @returns Promise resolving to MinCutResult
+     * @throws Error if graph exceeds maxNodes limit or computation times out
+     */
+    computeMinCut(graph: MinCutGraphInput): Promise<MinCutResult>;
+    /**
+     * Find multiple minimum cuts by iteratively removing cut edges
+     *
+     * This is useful for identifying alternative module boundaries or
+     * finding all equally optimal partitions.
+     *
+     * @param graph - Input graph
+     * @param maxCuts - Maximum number of cuts to find (default: 3)
+     * @returns Promise resolving to array of MinCutResults, sorted by cut value
+     */
+    findAllMinCuts(graph: MinCutGraphInput, maxCuts?: number): Promise<MinCutResult[]>;
+    /**
+     * Validate graph constraints
+     */
+    private validateGraph;
+    /**
+     * Compute min cut using Stoer-Wagner JS implementation
+     */
+    private computeJS;
+    /**
+     * Wrap computation with timeout
+     */
+    private computeWithTimeout;
+    /**
+     * Clone graph for iterative cut finding
+     */
+    private cloneGraph;
+    /**
+     * Remove cut edges from graph
+     */
+    private removeCutEdges;
+    /**
+     * Get current configuration
+     */
+    getConfig(): Readonly<MinCutConfig>;
+    /**
+     * Check if native bindings are available.
+     *
+     * Currently always returns false as the implementation uses
+     * pure JavaScript Stoer-Wagner algorithm which is performant
+     * for graphs up to ~500 nodes.
+     */
+    isNativeAvailable(): boolean;
+    /**
+     * Get algorithm information
+     */
+    getAlgorithmInfo(): {
+        name: string;
+        complexity: string;
+        implementation: string;
+    };
+}
+//# sourceMappingURL=MinCutAnalyzer.d.ts.map

package/dist/code-intelligence/analysis/mincut/MinCutAnalyzer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MinCutAnalyzer.d.ts","sourceRoot":"","sources":["../../../../src/code-intelligence/analysis/mincut/MinCutAnalyzer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,YAAY,EAAyB,MAAM,YAAY,CAAC;AAMjG;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,MAAM,CAAe;IAC7B,OAAO,CAAC,QAAQ,CAAW;IAE3B;;;;OAIG;gBACS,MAAM,GAAE,OAAO,CAAC,YAAY,CAAM;IAW9C;;;;;;OAMG;IACU,aAAa,CAAC,KAAK,EAAE,gBAAgB,GAAG,OAAO,CAAC,YAAY,CAAC;IAU1E;;;;;;;;;OASG;IACU,cAAc,CACzB,KAAK,EAAE,gBAAgB,EACvB,OAAO,SAAI,GACV,OAAO,CAAC,YAAY,EAAE,CAAC;IA+B1B;;OAEG;IACH,OAAO,CAAC,aAAa;IA0BrB;;OAEG;YACW,SAAS;IAavB;;OAEG;YACW,kBAAkB;IAoBhC;;OAEG;IACH,OAAO,CAAC,UAAU;IAQlB;;OAEG;IACH,OAAO,CAAC,cAAc;IAqBtB;;OAEG;IACI,SAAS,IAAI,QAAQ,CAAC,YAAY,CAAC;IAI1C;;;;;;OAMG;IACI,iBAAiB,IAAI,OAAO;IAInC;;OAEG;IACI,gBAAgB,IAAI;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,cAAc,EAAE,MAAM,CAAA;KAAE;CAOxF"}

package/dist/code-intelligence/analysis/mincut/MinCutAnalyzer.js

@@ -0,0 +1,200 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MinCutAnalyzer = void 0;
+const types_js_1 = require("./types.js");
+const JsMinCut_js_1 = require("./JsMinCut.js");
+const Logger_js_1 = require("../../../utils/Logger.js");
+const logger = Logger_js_1.Logger.getInstance();
+/**
+ * MinCut analyzer using the Stoer-Wagner algorithm.
+ *
+ * This is a pure JavaScript implementation optimized for code intelligence
+ * and fleet topology analysis. The algorithm runs in O(V³) time complexity
+ * and O(V²) space complexity.
+ *
+ * @example
+ * ```typescript
+ * const analyzer = new MinCutAnalyzer();
+ * const result = await analyzer.computeMinCut({
+ *   nodes: [{ id: 'A', label: 'A' }, { id: 'B', label: 'B' }],
+ *   edges: [{ source: 'A', target: 'B', weight: 1.0 }],
+ *   directed: false,
+ * });
+ * console.log('Min cut value:', result.cutValue);
+ * console.log('Partitions:', result.partition1, result.partition2);
+ * ```
+ *
+ * @see JsMinCut for the underlying Stoer-Wagner implementation
+ */
+class MinCutAnalyzer {
+    /**
+     * Create a new MinCutAnalyzer
+     *
+     * @param config - Partial configuration (merged with defaults)
+     */
+    constructor(config = {}) {
+        this.config = { ...types_js_1.DEFAULT_MINCUT_CONFIG, ...config };
+        this.jsMinCut = new JsMinCut_js_1.JsMinCut();
+        logger.info('MinCutAnalyzer initialized (Stoer-Wagner algorithm)', {
+            maxNodes: this.config.maxNodes,
+            timeout: this.config.timeout,
+            normalizeWeights: this.config.normalizeWeights,
+        });
+    }
+    /**
+     * Compute the minimum cut of a graph using the Stoer-Wagner algorithm
+     *
+     * @param graph - Input graph with nodes and edges
+     * @returns Promise resolving to MinCutResult
+     * @throws Error if graph exceeds maxNodes limit or computation times out
+     */
+    async computeMinCut(graph) {
+        // Validate graph size
+        this.validateGraph(graph);
+        // Use Stoer-Wagner JS implementation with timeout protection
+        return await this.computeWithTimeout(() => this.computeJS(graph));
+    }
+    /**
+     * Find multiple minimum cuts by iteratively removing cut edges
+     *
+     * This is useful for identifying alternative module boundaries or
+     * finding all equally optimal partitions.
+     *
+     * @param graph - Input graph
+     * @param maxCuts - Maximum number of cuts to find (default: 3)
+     * @returns Promise resolving to array of MinCutResults, sorted by cut value
+     */
+    async findAllMinCuts(graph, maxCuts = 3) {
+        const results = [];
+        let workingGraph = this.cloneGraph(graph);
+        for (let i = 0; i < maxCuts; i++) {
+            try {
+                const result = await this.computeMinCut(workingGraph);
+                results.push(result);
+                // If no cut was found or cut value is infinite, stop
+                if (result.cutValue === 0 || result.cutValue === Infinity) {
+                    break;
+                }
+                // Remove cut edges for next iteration
+                workingGraph = this.removeCutEdges(workingGraph, result.cutEdges);
+                // If graph becomes disconnected or empty, stop
+                if (workingGraph.edges.length === 0) {
+                    break;
+                }
+            }
+            catch (error) {
+                logger.warn('Failed to find additional min cut', { iteration: i, error });
+                break;
+            }
+        }
+        // Sort by cut value (ascending)
+        return results.sort((a, b) => a.cutValue - b.cutValue);
+    }
+    /**
+     * Validate graph constraints
+     */
+    validateGraph(graph) {
+        if (graph.nodes.length > this.config.maxNodes) {
+            throw new Error(`Graph has ${graph.nodes.length} nodes, exceeding limit of ${this.config.maxNodes}`);
+        }
+        if (graph.nodes.length === 0) {
+            throw new Error('Graph must have at least one node');
+        }
+        // Check for invalid edges
+        const nodeIds = new Set(graph.nodes.map(n => n.id));
+        for (const edge of graph.edges) {
+            if (!nodeIds.has(edge.source)) {
+                throw new Error(`Edge source '${edge.source}' not found in nodes`);
+            }
+            if (!nodeIds.has(edge.target)) {
+                throw new Error(`Edge target '${edge.target}' not found in nodes`);
+            }
+            if (edge.weight < 0) {
+                throw new Error(`Edge weight must be non-negative, got ${edge.weight}`);
+            }
+        }
+    }
+    /**
+     * Compute min cut using Stoer-Wagner JS implementation
+     */
+    async computeJS(graph) {
+        // Run in next tick to allow for async timeout handling
+        return new Promise((resolve) => {
+            setImmediate(() => {
+                const result = this.jsMinCut.computeMinCut(graph, this.config.normalizeWeights);
+                resolve(result);
+            });
+        });
+    }
+    /**
+     * Wrap computation with timeout
+     */
+    async computeWithTimeout(fn) {
+        return new Promise((resolve, reject) => {
+            const timer = setTimeout(() => {
+                reject(new Error(`MinCut computation exceeded timeout of ${this.config.timeout}ms`));
+            }, this.config.timeout);
+            fn()
+                .then((result) => {
+                clearTimeout(timer);
+                resolve(result);
+            })
+                .catch((error) => {
+                clearTimeout(timer);
+                reject(error);
+            });
+        });
+    }
+    /**
+     * Clone graph for iterative cut finding
+     */
+    cloneGraph(graph) {
+        return {
+            nodes: graph.nodes.map(n => ({ ...n })),
+            edges: graph.edges.map(e => ({ ...e })),
+            directed: graph.directed,
+        };
+    }
+    /**
+     * Remove cut edges from graph
+     */
+    removeCutEdges(graph, cutEdges) {
+        const cutSet = new Set(cutEdges.map(e => `${e.source}->${e.target}`));
+        // Also add reverse direction for undirected graphs
+        cutEdges.forEach(e => {
+            cutSet.add(`${e.target}->${e.source}`);
+        });
+        return {
+            ...graph,
+            edges: graph.edges.filter(e => !cutSet.has(`${e.source}->${e.target}`)),
+        };
+    }
+    /**
+     * Get current configuration
+     */
+    getConfig() {
+        return { ...this.config };
+    }
+    /**
+     * Check if native bindings are available.
+     *
+     * Currently always returns false as the implementation uses
+     * pure JavaScript Stoer-Wagner algorithm which is performant
+     * for graphs up to ~500 nodes.
+     */
+    isNativeAvailable() {
+        return false;
+    }
+    /**
+     * Get algorithm information
+     */
+    getAlgorithmInfo() {
+        return {
+            name: 'Stoer-Wagner',
+            complexity: 'O(V³) time, O(V²) space',
+            implementation: 'pure-javascript',
+        };
+    }
+}
+exports.MinCutAnalyzer = MinCutAnalyzer;
+//# sourceMappingURL=MinCutAnalyzer.js.map

package/dist/code-intelligence/analysis/mincut/MinCutAnalyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MinCutAnalyzer.js","sourceRoot":"","sources":["../../../../src/code-intelligence/analysis/mincut/MinCutAnalyzer.ts"],"names":[],"mappings":";;;AAAA,yCAAiG;AACjG,+CAAyC;AACzC,wDAAkD;AAElD,MAAM,MAAM,GAAG,kBAAM,CAAC,WAAW,EAAE,CAAC;AAEpC;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAa,cAAc;IAIzB;;;;OAIG;IACH,YAAY,SAAgC,EAAE;QAC5C,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,gCAAqB,EAAE,GAAG,MAAM,EAAE,CAAC;QACtD,IAAI,CAAC,QAAQ,GAAG,IAAI,sBAAQ,EAAE,CAAC;QAE/B,MAAM,CAAC,IAAI,CAAC,qDAAqD,EAAE;YACjE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ;YAC9B,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;YAC5B,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,gBAAgB;SAC/C,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACI,KAAK,CAAC,aAAa,CAAC,KAAuB;QAChD,sBAAsB;QACtB,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAE1B,6DAA6D;QAC7D,OAAO,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,CACxC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CACtB,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACI,KAAK,CAAC,cAAc,CACzB,KAAuB,EACvB,OAAO,GAAG,CAAC;QAEX,MAAM,OAAO,GAAmB,EAAE,CAAC;QACnC,IAAI,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAE1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;gBACtD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAErB,qDAAqD;gBACrD,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC,IAAI,MAAM,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;oBAC1D,MAAM;gBACR,CAAC;gBAED,sCAAsC;gBACtC,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,YAAY,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAElE,+CAA+C;gBAC/C,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACpC,MAAM;gBACR,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,mCAAmC,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC1E,MAAM;YACR,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IACzD,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,KAAuB;QAC3C,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC9C,MAAM,IAAI,KAAK,CACb,aAAa,KAAK,CAAC,KAAK,CAAC,MAAM,8BAA8B,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CACpF,CAAC;QACJ,CAAC;QAED,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACvD,CAAC;QAED,0BAA0B;QAC1B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,MAAM,IAAI,KAAK,CAAC,gBAAgB,IAAI,CAAC,MAAM,sBAAsB,CAAC,CAAC;YACrE,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,MAAM,IAAI,KAAK,CAAC,gBAAgB,IAAI,CAAC,MAAM,sBAAsB,CAAC,CAAC;YACrE,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,IAAI,KAAK,CAAC,yCAAyC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YAC1E,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,SAAS,CAAC,KAAuB;QAC7C,uDAAuD;QACvD,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAC7B,YAAY,CAAC,GAAG,EAAE;gBAChB,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,CACxC,KAAK,EACL,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAC7B,CAAC;gBACF,OAAO,CAAC,MAAM,CAAC,CAAC;YAClB,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,kBAAkB,CAC9B,EAAoB;QAEpB,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACrC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;gBAC5B,MAAM,CAAC,IAAI,KAAK,CAAC,0CAA0C,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;YACvF,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAExB,EAAE,EAAE;iBACD,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE;gBACf,YAAY,CAAC,KAAK,CAAC,CAAC;gBACpB,OAAO,CAAC,MAAM,CAAC,CAAC;YAClB,CAAC,CAAC;iBACD,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;gBACf,YAAY,CAAC,KAAK,CAAC,CAAC;gBACpB,MAAM,CAAC,KAAK,CAAC,CAAC;YAChB,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,KAAuB;QACxC,OAAO;YACL,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACvC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACvC,QAAQ,EAAE,KAAK,CAAC,QAAQ;SACzB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,cAAc,CACpB,KAAuB,EACvB,QAAmD;QAEnD,MAAM,MAAM,GAAG,IAAI,GAAG,CACpB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC,CAC9C,CAAC;QAEF,mDAAmD;QACnD,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACnB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,OAAO;YACL,GAAG,KAAK;YACR,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAC5B,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC,CACxC;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,SAAS;QACd,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;IAED;;;;;;OAMG;IACI,iBAAiB;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACI,gBAAgB;QACrB,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,UAAU,EAAE,yBAAyB;YACrC,cAAc,EAAE,iBAAiB;SAClC,CAAC;IACJ,CAAC;CACF;AApND,wCAoNC"}

package/dist/code-intelligence/analysis/mincut/ModuleCouplingAnalyzer.d.ts

@@ -0,0 +1,157 @@
+/**
+ * Module Coupling Analyzer
+ *
+ * High-level analyzer for module coupling that provides actionable insights
+ * for code quality improvement. Uses MinCut analysis to identify optimal
+ * module boundaries and coupling reduction points.
+ *
+ * @example
+ * ```typescript
+ * const graph = graphBuilder.exportGraph();
+ * const analyzer = new ModuleCouplingAnalyzer(graph, {
+ *   moduleGrouping: 'directory',
+ *   minCouplingThreshold: 0.1
+ * });
+ *
+ * // Analyze coupling between two modules
+ * const result = await analyzer.analyzeCoupling('src/auth', 'src/user');
+ * console.log('Coupling strength:', result.couplingStrength);
+ * console.log('Recommendations:', result.recommendations);
+ *
+ * // Find all highly coupled module pairs
+ * const coupled = await analyzer.findHighlyCoupledModules(0.7);
+ * ```
+ */
+import { ModuleCouplingResult, MinCutConfig } from './types.js';
+import { CodeGraph } from '../../graph/types.js';
+/**
+ * Options for module coupling analysis
+ */
+export interface ModuleCouplingOptions {
+    /** Configuration for MinCut analyzer */
+    minCutConfig?: Partial<MinCutConfig>;
+    /** How to group code into modules */
+    moduleGrouping?: 'directory' | 'file' | 'custom';
+    /** Custom function to extract module identifier from file path */
+    customModuleExtractor?: (filePath: string) => string;
+    /** Minimum coupling threshold - ignore pairs below this value */
+    minCouplingThreshold?: number;
+}
+/**
+ * ModuleCouplingAnalyzer - High-level analyzer for module coupling
+ *
+ * Provides actionable insights about module coupling and recommendations
+ * for improving code quality through better module boundaries.
+ */
+export declare class ModuleCouplingAnalyzer {
+    private graph;
+    private analyzer;
+    private options;
+    /**
+     * Create a new ModuleCouplingAnalyzer
+     *
+     * @param graph - Code graph to analyze (from GraphBuilder.exportGraph())
+     * @param options - Analysis options
+     */
+    constructor(graph: CodeGraph, options?: ModuleCouplingOptions);
+    /**
+     * Analyze coupling between two specific modules
+     *
+     * @param module1Path - Path to first module
+     * @param module2Path - Path to second module
+     * @returns Promise resolving to coupling analysis result
+     *
+     * @example
+     * ```typescript
+     * const result = await analyzer.analyzeCoupling('src/auth', 'src/user');
+     * if (result.couplingStrength > 0.7) {
+     *   console.log('High coupling detected!');
+     *   console.log('Recommendations:', result.recommendations);
+     * }
+     * ```
+     */
+    analyzeCoupling(module1Path: string, module2Path: string): Promise<ModuleCouplingResult>;
+    /**
+     * Find all highly coupled module pairs
+     *
+     * @param threshold - Minimum coupling strength to include (0-1, default 0.7)
+     * @returns Promise resolving to array of coupling results, sorted by strength
+     *
+     * @example
+     * ```typescript
+     * const coupled = await analyzer.findHighlyCoupledModules(0.7);
+     * for (const pair of coupled) {
+     *   console.log(`${pair.module1} <-> ${pair.module2}: ${pair.couplingStrength}`);
+     * }
+     * ```
+     */
+    findHighlyCoupledModules(threshold?: number): Promise<ModuleCouplingResult[]>;
+    /**
+     * Get a coupling summary for the entire codebase
+     *
+     * @returns Promise resolving to overall coupling statistics and recommendations
+     *
+     * @example
+     * ```typescript
+     * const overview = await analyzer.getCouplingOverview();
+     * console.log('Average coupling:', overview.averageCoupling);
+     * console.log('Recommendations:', overview.recommendations);
+     * ```
+     */
+    getCouplingOverview(): Promise<{
+        averageCoupling: number;
+        maxCoupling: number;
+        highlyCoupledPairs: number;
+        circularDependencies: number;
+        recommendations: string[];
+    }>;
+    /**
+     * Get all nodes belonging to a module
+     */
+    private getModuleNodes;
+    /**
+     * Extract module subgraph containing only specified nodes
+     */
+    private extractModuleSubgraph;
+    /**
+     * Calculate coupling strength from MinCut result
+     *
+     * Coupling strength is calculated as:
+     * - If cutValue is 0: coupling = 0 (no connection)
+     * - Otherwise: coupling = normalized based on cut edges and graph structure
+     */
+    private calculateCouplingStrength;
+    /**
+     * Check if there's a circular dependency between module nodes
+     */
+    private hasCircularDependency;
+    /**
+     * Find dependencies shared by both modules
+     */
+    private findSharedDependencies;
+    /**
+     * Generate actionable recommendations based on coupling analysis
+     */
+    private generateRecommendations;
+    /**
+     * Get unique module identifiers from the graph
+     */
+    private getUniqueModules;
+    /**
+     * Extract module path from file path based on grouping strategy
+     */
+    private extractModulePath;
+    /**
+     * Default module extractor - extracts directory path
+     */
+    private defaultModuleExtractor;
+    /**
+     * Get current analysis options
+     */
+    getOptions(): Readonly<Required<ModuleCouplingOptions>>;
+    /**
+     * Get the underlying graph
+     */
+    getGraph(): Readonly<CodeGraph>;
+}
+//# sourceMappingURL=ModuleCouplingAnalyzer.d.ts.map

package/dist/code-intelligence/analysis/mincut/ModuleCouplingAnalyzer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ModuleCouplingAnalyzer.d.ts","sourceRoot":"","sources":["../../../../src/code-intelligence/analysis/mincut/ModuleCouplingAnalyzer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAIH,OAAO,EAAE,oBAAoB,EAAE,YAAY,EAAgB,MAAM,YAAY,CAAC;AAC9E,OAAO,EAAE,SAAS,EAAwB,MAAM,sBAAsB,CAAC;AAKvE;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,wCAAwC;IACxC,YAAY,CAAC,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC;IAErC,qCAAqC;IACrC,cAAc,CAAC,EAAE,WAAW,GAAG,MAAM,GAAG,QAAQ,CAAC;IAEjD,kEAAkE;IAClE,qBAAqB,CAAC,EAAE,CAAC,QAAQ,EAAE,MAAM,KAAK,MAAM,CAAC;IAErD,iEAAiE;IACjE,oBAAoB,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED;;;;;GAKG;AACH,qBAAa,sBAAsB;IACjC,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,QAAQ,CAAiB;IACjC,OAAO,CAAC,OAAO,CAAkC;IAEjD;;;;;OAKG;gBACS,KAAK,EAAE,SAAS,EAAE,OAAO,GAAE,qBAA0B;IAiBjE;;;;;;;;;;;;;;;OAeG;IACG,eAAe,CACnB,WAAW,EAAE,MAAM,EACnB,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC,oBAAoB,CAAC;IAmFhC;;;;;;;;;;;;;OAaG;IACG,wBAAwB,CAC5B,SAAS,SAAM,GACd,OAAO,CAAC,oBAAoB,EAAE,CAAC;IA8BlC;;;;;;;;;;;OAWG;IACG,mBAAmB,IAAI,OAAO,CAAC;QACnC,eAAe,EAAE,MAAM,CAAC;QACxB,WAAW,EAAE,MAAM,CAAC;QACpB,kBAAkB,EAAE,MAAM,CAAC;QAC3B,oBAAoB,EAAE,MAAM,CAAC;QAC7B,eAAe,EAAE,MAAM,EAAE,CAAC;KAC3B,CAAC;IAuDF;;OAEG;IACH,OAAO,CAAC,cAAc;IAatB;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAkB7B;;;;;;OAMG;IACH,OAAO,CAAC,yBAAyB;IAuBjC;;OAEG;IACH,OAAO,CAAC,qBAAqB;IA8B7B;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAsC9B;;OAEG;IACH,OAAO,CAAC,uBAAuB;IA8C/B;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAWxB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAazB;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAU9B;;OAEG;IACI,UAAU,IAAI,QAAQ,CAAC,QAAQ,CAAC,qBAAqB,CAAC,CAAC;IAI9D;;OAEG;IACI,QAAQ,IAAI,QAAQ,CAAC,SAAS,CAAC;CAGvC"}