@lerna-lite/core 1.1.0 → 1.4.0

package/dist/package-graph/package-graph.js

@@ -1,249 +1,277 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.PackageGraph = void 0;
-const npm_package_arg_1 = __importDefault(require("npm-package-arg"));
-const lib_1 = require("./lib");
-const validation_error_1 = require("../validation-error");
-/**
- * A graph of packages in the current project.
- *
- * @extends {Map<string, PackageGraphNode>}
- */
-class PackageGraph extends Map {
-    /**
-     * @param {import("@lerna/package").Package[]} packages An array of Packages to build the graph out of.
-     * @param {'allDependencies'|'dependencies'} [graphType]
-     *    Pass "dependencies" to create a graph of only dependencies,
-     *    excluding the devDependencies that would normally be included.
-     * @param {boolean} [forceLocal] Force all local dependencies to be linked.
-     */
-    constructor(packages, graphType = 'allDependencies', forceLocal) {
-        // @ts-ignore
-        super(packages.map((pkg) => { var _a; return [(_a = pkg === null || pkg === void 0 ? void 0 : pkg.name) !== null && _a !== void 0 ? _a : '', new lib_1.PackageGraphNode(pkg)]; }));
-        if (packages.length !== this.size) {
-            // weed out the duplicates
-            const seen = new Map();
-            for (const { name, location } of packages) {
-                if (seen.has(name)) {
-                    seen.get(name).push(location);
-                }
-                else {
-                    seen.set(name, [location]);
-                }
-            }
-            for (const [name, locations] of seen) {
-                if (locations.length > 1) {
-                    throw new validation_error_1.ValidationError('ENAME', [`Package name "${name}" used in multiple packages:`, ...locations].join('\n\t'));
-                }
-            }
-        }
-        this.forEach((currentNode, currentName) => {
-            const graphDependencies = graphType === 'dependencies'
-                ? Object.assign({}, currentNode.pkg.optionalDependencies, currentNode.pkg.dependencies)
-                : Object.assign({}, currentNode.pkg.devDependencies, currentNode.pkg.optionalDependencies, currentNode.pkg.dependencies);
-            Object.keys(graphDependencies).forEach((depName) => {
-                const depNode = this.get(depName);
-                // Yarn decided to ignore https://github.com/npm/npm/pull/15900 and implemented "link:"
-                // As they apparently have no intention of being compatible, we have to do it for them.
-                // @see https://github.com/yarnpkg/yarn/issues/4212
-                const spec = graphDependencies[depName].replace(/^link:/, 'file:');
-                const resolved = npm_package_arg_1.default.resolve(depName, spec, currentNode.location);
-                if (!depNode) {
-                    // it's an external dependency, store the resolution and bail
-                    return currentNode.externalDependencies.set(depName, resolved);
-                }
-                if (forceLocal || resolved.fetchSpec === depNode.location || depNode.satisfies(resolved)) {
-                    // a local file: specifier OR a matching semver
-                    currentNode.localDependencies.set(depName, resolved);
-                    depNode.localDependents.set(currentName, currentNode);
-                }
-                else {
-                    // non-matching semver of a local dependency
-                    currentNode.externalDependencies.set(depName, resolved);
-                }
-            });
-        });
-    }
-    get rawPackageList() {
-        return Array.from(this.values()).map((node) => node.pkg);
-    }
-    /**
-     * Takes a list of Packages and returns a list of those same Packages with any Packages
-     * they depend on. i.e if packageA depended on packageB `graph.addDependencies([packageA])`
-     * would return [packageA, packageB].
-     *
-     * @param {import("@lerna/package").Package[]} filteredPackages The packages to include dependencies for.
-     */
-    addDependencies(filteredPackages) {
-        return this.extendList(filteredPackages, 'localDependencies');
-    }
-    /**
-     * Takes a list of Packages and returns a list of those same Packages with any Packages
-     * that depend on them. i.e if packageC depended on packageD `graph.addDependents([packageD])`
-     * would return [packageD, packageC].
-     *
-     * @param {import("@lerna/package").Package[]} filteredPackages The packages to include dependents for.
-     */
-    addDependents(filteredPackages) {
-        return this.extendList(filteredPackages, 'localDependents');
-    }
-    /**
-     * Extends a list of packages by traversing on a given property, which must refer to a
-     * `PackageGraphNode` property that is a collection of `PackageGraphNode`s.
-     * Returns input packages with any additional packages found by traversing `nodeProp`.
-     *
-     * @param {import("@lerna/package").Package[]} packageList The list of packages to extend
-     * @param {'localDependencies'|'localDependents'} nodeProp The property on `PackageGraphNode` used to traverse
-     */
-    extendList(packageList, nodeProp) {
-        // the current list of packages we are expanding using breadth-first-search
-        const search = new Set(packageList.map(({ name }) => this.get(name)));
-        // an intermediate list of matched PackageGraphNodes
-        /** @type {PackageGraphNode[]} */
-        const result = [];
-        search.forEach((currentNode) => {
-            // anything searched for is always a result
-            result.push(currentNode);
-            currentNode[nodeProp].forEach((meta, depName) => {
-                const depNode = this.get(depName);
-                if (depNode !== currentNode && !search.has(depNode)) {
-                    search.add(depNode);
-                }
-            });
-        });
-        // actual Package instances, not PackageGraphNodes
-        return result.map((node) => node.pkg);
-    }
-    /**
-     * Return a tuple of cycle paths and nodes.
-     *
-     * @deprecated Use collapseCycles instead.
-     *
-     * @param {boolean} rejectCycles Whether or not to reject cycles
-     * @returns {[Set<string[]>, Set<PackageGraphNode>]}
-     */
-    partitionCycles(rejectCycles) {
-        const cyclePaths = new Set();
-        const cycleNodes = new Set();
-        this.forEach((currentNode, currentName) => {
-            const seen = new Set();
-            const visits = (walk) => (dependentNode, dependentName, siblingDependents) => {
-                const step = walk.concat(dependentName);
-                if (seen.has(dependentNode)) {
-                    return;
-                }
-                seen.add(dependentNode);
-                if (dependentNode === currentNode) {
-                    // a direct cycle
-                    cycleNodes.add(currentNode);
-                    cyclePaths.add(step);
-                    return;
-                }
-                if (siblingDependents.has(currentName)) {
-                    // a transitive cycle
-                    const cycleDependentName = Array.from(dependentNode.localDependencies.keys()).find((key) => currentNode.localDependents.has(key));
-                    const pathToCycle = step.slice().reverse().concat(cycleDependentName);
-                    cycleNodes.add(dependentNode);
-                    cyclePaths.add(pathToCycle);
-                }
-                dependentNode.localDependents.forEach(visits(step));
-            };
-            currentNode.localDependents.forEach(visits([currentName]));
-        });
-        (0, lib_1.reportCycles)(Array.from(cyclePaths, (cycle) => cycle.join(' -> ')), rejectCycles);
-        return [cyclePaths, cycleNodes];
-    }
-    /**
-     * Returns the cycles of this graph. If two cycles share some elements, they will
-     * be returned as a single cycle.
-     *
-     * @param {boolean} rejectCycles Whether or not to reject cycles
-     * @returns {Set<CyclicPackageGraphNode>}
-     */
-    collapseCycles(rejectCycles) {
-        const cyclePaths = [];
-        const nodeToCycle = new Map();
-        const cycles = new Set();
-        const alreadyVisited = new Set();
-        const walkStack = [];
-        function visits(baseNode, dependentNode) {
-            if (nodeToCycle.has(baseNode)) {
-                return;
-            }
-            let topLevelDependent = dependentNode;
-            while (nodeToCycle.has(topLevelDependent)) {
-                topLevelDependent = nodeToCycle.get(topLevelDependent);
-            }
-            // Otherwise the same node is checked multiple times which is very wasteful in a large repository
-            if (alreadyVisited.has(topLevelDependent)) {
-                return;
-            }
-            alreadyVisited.add(topLevelDependent);
-            if (topLevelDependent === baseNode ||
-                (topLevelDependent.isCycle && topLevelDependent.has(baseNode.name))) {
-                const cycle = new lib_1.CyclicPackageGraphNode();
-                walkStack.forEach((nodeInCycle) => {
-                    nodeToCycle.set(nodeInCycle, cycle);
-                    cycle.insert(nodeInCycle);
-                    cycles.delete(nodeInCycle);
-                });
-                cycles.add(cycle);
-                // @ts-ignore
-                cyclePaths.push(cycle.toString());
-                return;
-            }
-            if (walkStack.indexOf(topLevelDependent) === -1) {
-                // eslint-disable-next-line no-use-before-define
-                visitWithStack(baseNode, topLevelDependent);
-            }
-        }
-        function visitWithStack(baseNode, currentNode = baseNode) {
-            walkStack.push(currentNode);
-            currentNode.localDependents.forEach(visits.bind(null, baseNode));
-            walkStack.pop();
-        }
-        this.forEach((currentNode) => visitWithStack(currentNode));
-        cycles.forEach((collapsedNode) => visitWithStack(collapsedNode));
-        (0, lib_1.reportCycles)(cyclePaths, rejectCycles);
-        return cycles;
-    }
-    /**
-     * Remove cycle nodes.
-     *
-     * @deprecated Spread set into prune() instead.
-     *
-     * @param {Set<PackageGraphNode>} cycleNodes
-     */
-    pruneCycleNodes(cycleNodes) {
-        return this.prune(...cycleNodes);
-    }
-    /**
-     * Remove all candidate nodes.
-     * @param {PackageGraphNode[]} candidates
-     */
-    prune(...candidates) {
-        if (candidates.length === this.size) {
-            return this.clear();
-        }
-        candidates.forEach((node) => this.remove(node));
-    }
-    /**
-     * Delete by value (instead of key), as well as removing pointers
-     * to itself in the other node's internal collections.
-     * @param {PackageGraphNode} candidateNode instance to remove
-     */
-    remove(candidateNode) {
-        this.delete(candidateNode.name);
-        this.forEach((node) => {
-            // remove incoming edges ("indegree")
-            node.localDependencies.delete(candidateNode.name);
-            // remove outgoing edges ("outdegree")
-            node.localDependents.delete(candidateNode.name);
-        });
-    }
-}
-exports.PackageGraph = PackageGraph;
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PackageGraph = void 0;
+const npm_package_arg_1 = __importDefault(require("npm-package-arg"));
+const lib_1 = require("./lib");
+const validation_error_1 = require("../validation-error");
+/**
+ * A graph of packages in the current project.
+ *
+ * @extends {Map<string, PackageGraphNode>}
+ */
+class PackageGraph extends Map {
+    /**
+     * @param {import("@lerna/package").Package[]} packages An array of Packages to build the graph out of.
+     * @param {'allDependencies'|'dependencies'} [graphType]
+     *    Pass "dependencies" to create a graph of only dependencies,
+     *    excluding the devDependencies that would normally be included.
+     * @param {boolean|'auto'|'force'|'explicit'} [localDependencies] Treatment of local sibling dependencies, default "auto"
+     */
+    constructor(packages, graphType = 'allDependencies', localDependencies = 'auto') {
+        // For backward compatibility
+        if (localDependencies === true || localDependencies === 'forceLocal') {
+            localDependencies = 'force'; // eslint-disable-line
+        }
+        // @ts-ignore
+        super(packages.map((pkg) => { var _a; return [(_a = pkg === null || pkg === void 0 ? void 0 : pkg.name) !== null && _a !== void 0 ? _a : '', new lib_1.PackageGraphNode(pkg)]; }));
+        if (packages.length !== this.size) {
+            // weed out the duplicates
+            const seen = new Map();
+            for (const { name, location } of packages) {
+                if (seen.has(name)) {
+                    seen.get(name).push(location);
+                }
+                else {
+                    seen.set(name, [location]);
+                }
+            }
+            for (const [name, locations] of seen) {
+                if (locations.length > 1) {
+                    throw new validation_error_1.ValidationError('ENAME', [`Package name "${name}" used in multiple packages:`, ...locations].join('\n\t'));
+                }
+            }
+        }
+        this.forEach((currentNode, currentName) => {
+            const graphDependencies = graphType === 'dependencies'
+                ? Object.assign({}, currentNode.pkg.optionalDependencies, currentNode.pkg.dependencies)
+                : Object.assign({}, currentNode.pkg.devDependencies, currentNode.pkg.optionalDependencies, currentNode.pkg.dependencies);
+            Object.keys(graphDependencies).forEach((depName) => {
+                const depNode = this.get(depName);
+                // Yarn decided to ignore https://github.com/npm/npm/pull/15900 and implemented "link:"
+                // As they apparently have no intention of being compatible, we have to do it for them.
+                // @see https://github.com/yarnpkg/yarn/issues/4212
+                let spec = graphDependencies[depName].replace(/^link:/, 'file:');
+                // npa doesn't support the explicit workspace: protocol, supported by
+                // pnpm and Yarn.
+                const explicitWorkspace = /^workspace:/.test(spec);
+                let workspaceTarget;
+                if (explicitWorkspace) {
+                    workspaceTarget = spec;
+                    spec = spec.replace(/^workspace:/, '');
+                    // when dependency is defined as target workspace, like `workspace:*`,
+                    // we'll have to pull the version from its parent package version property
+                    // example with `1.5.0`, ws:* => "1.5.0", ws:^ => "^1.5.0", ws:~ => "~1.5.0", ws:^1.5.0 => "^1.5.0"
+                    if (spec === '*' || spec === '^' || spec === '~') {
+                        const depPkg = packages.find(pkg => pkg.name === depName);
+                        const version = depPkg === null || depPkg === void 0 ? void 0 : depPkg.version;
+                        const specTarget = spec === '*' ? '' : spec;
+                        spec = depPkg ? `${specTarget}${version}` : '';
+                    }
+                }
+                const resolved = npm_package_arg_1.default.resolve(depName, spec, currentNode.location);
+                resolved.explicitWorkspace = explicitWorkspace;
+                if (resolved.explicitWorkspace) {
+                    resolved.workspaceTarget = workspaceTarget;
+                }
+                if (!depNode) {
+                    // it's an external dependency, store the resolution and bail
+                    return currentNode.externalDependencies.set(depName, resolved);
+                }
+                if (explicitWorkspace ||
+                    localDependencies === 'force' ||
+                    resolved.fetchSpec === depNode.location ||
+                    (localDependencies !== 'explicit' && depNode.satisfies(resolved))) {
+                    // a local file: specifier, a matching semver or a workspace: version
+                    currentNode.localDependencies.set(depName, resolved);
+                    depNode.localDependents.set(currentName, currentNode);
+                }
+                else {
+                    // non-matching semver of a local dependency
+                    currentNode.externalDependencies.set(depName, resolved);
+                }
+            });
+        });
+    }
+    get rawPackageList() {
+        return Array.from(this.values()).map((node) => node.pkg);
+    }
+    /**
+     * Takes a list of Packages and returns a list of those same Packages with any Packages
+     * they depend on. i.e if packageA depended on packageB `graph.addDependencies([packageA])`
+     * would return [packageA, packageB].
+     *
+     * @param {import("@lerna/package").Package[]} filteredPackages The packages to include dependencies for.
+     */
+    addDependencies(filteredPackages) {
+        return this.extendList(filteredPackages, 'localDependencies');
+    }
+    /**
+     * Takes a list of Packages and returns a list of those same Packages with any Packages
+     * that depend on them. i.e if packageC depended on packageD `graph.addDependents([packageD])`
+     * would return [packageD, packageC].
+     *
+     * @param {import("@lerna/package").Package[]} filteredPackages The packages to include dependents for.
+     */
+    addDependents(filteredPackages) {
+        return this.extendList(filteredPackages, 'localDependents');
+    }
+    /**
+     * Extends a list of packages by traversing on a given property, which must refer to a
+     * `PackageGraphNode` property that is a collection of `PackageGraphNode`s.
+     * Returns input packages with any additional packages found by traversing `nodeProp`.
+     *
+     * @param {import("@lerna/package").Package[]} packageList The list of packages to extend
+     * @param {'localDependencies'|'localDependents'} nodeProp The property on `PackageGraphNode` used to traverse
+     */
+    extendList(packageList, nodeProp) {
+        // the current list of packages we are expanding using breadth-first-search
+        const search = new Set(packageList.map(({ name }) => this.get(name)));
+        // an intermediate list of matched PackageGraphNodes
+        /** @type {PackageGraphNode[]} */
+        const result = [];
+        search.forEach((currentNode) => {
+            // anything searched for is always a result
+            result.push(currentNode);
+            currentNode[nodeProp].forEach((meta, depName) => {
+                const depNode = this.get(depName);
+                if (depNode !== currentNode && !search.has(depNode)) {
+                    search.add(depNode);
+                }
+            });
+        });
+        // actual Package instances, not PackageGraphNodes
+        return result.map((node) => node.pkg);
+    }
+    /**
+     * Return a tuple of cycle paths and nodes.
+     *
+     * @deprecated Use collapseCycles instead.
+     *
+     * @param {boolean} rejectCycles Whether or not to reject cycles
+     * @returns {[Set<string[]>, Set<PackageGraphNode>]}
+     */
+    partitionCycles(rejectCycles) {
+        const cyclePaths = new Set();
+        const cycleNodes = new Set();
+        this.forEach((currentNode, currentName) => {
+            const seen = new Set();
+            const visits = (walk) => (dependentNode, dependentName, siblingDependents) => {
+                const step = walk.concat(dependentName);
+                if (seen.has(dependentNode)) {
+                    return;
+                }
+                seen.add(dependentNode);
+                if (dependentNode === currentNode) {
+                    // a direct cycle
+                    cycleNodes.add(currentNode);
+                    cyclePaths.add(step);
+                    return;
+                }
+                if (siblingDependents.has(currentName)) {
+                    // a transitive cycle
+                    const cycleDependentName = Array.from(dependentNode.localDependencies.keys()).find((key) => currentNode.localDependents.has(key));
+                    const pathToCycle = step.slice().reverse().concat(cycleDependentName);
+                    cycleNodes.add(dependentNode);
+                    cyclePaths.add(pathToCycle);
+                }
+                dependentNode.localDependents.forEach(visits(step));
+            };
+            currentNode.localDependents.forEach(visits([currentName]));
+        });
+        (0, lib_1.reportCycles)(Array.from(cyclePaths, (cycle) => cycle.join(' -> ')), rejectCycles);
+        return [cyclePaths, cycleNodes];
+    }
+    /**
+     * Returns the cycles of this graph. If two cycles share some elements, they will
+     * be returned as a single cycle.
+     *
+     * @param {boolean} rejectCycles Whether or not to reject cycles
+     * @returns {Set<CyclicPackageGraphNode>}
+     */
+    collapseCycles(rejectCycles) {
+        const cyclePaths = [];
+        const nodeToCycle = new Map();
+        const cycles = new Set();
+        const alreadyVisited = new Set();
+        const walkStack = [];
+        function visits(baseNode, dependentNode) {
+            if (nodeToCycle.has(baseNode)) {
+                return;
+            }
+            let topLevelDependent = dependentNode;
+            while (nodeToCycle.has(topLevelDependent)) {
+                topLevelDependent = nodeToCycle.get(topLevelDependent);
+            }
+            // Otherwise the same node is checked multiple times which is very wasteful in a large repository
+            if (alreadyVisited.has(topLevelDependent)) {
+                return;
+            }
+            alreadyVisited.add(topLevelDependent);
+            if (topLevelDependent === baseNode ||
+                (topLevelDependent.isCycle && topLevelDependent.has(baseNode.name))) {
+                const cycle = new lib_1.CyclicPackageGraphNode();
+                walkStack.forEach((nodeInCycle) => {
+                    nodeToCycle.set(nodeInCycle, cycle);
+                    cycle.insert(nodeInCycle);
+                    cycles.delete(nodeInCycle);
+                });
+                cycles.add(cycle);
+                // @ts-ignore
+                cyclePaths.push(cycle.toString());
+                return;
+            }
+            if (walkStack.indexOf(topLevelDependent) === -1) {
+                // eslint-disable-next-line no-use-before-define
+                visitWithStack(baseNode, topLevelDependent);
+            }
+        }
+        function visitWithStack(baseNode, currentNode = baseNode) {
+            walkStack.push(currentNode);
+            currentNode.localDependents.forEach(visits.bind(null, baseNode));
+            walkStack.pop();
+        }
+        this.forEach((currentNode) => visitWithStack(currentNode));
+        cycles.forEach((collapsedNode) => visitWithStack(collapsedNode));
+        (0, lib_1.reportCycles)(cyclePaths, rejectCycles);
+        return cycles;
+    }
+    /**
+     * Remove cycle nodes.
+     *
+     * @deprecated Spread set into prune() instead.
+     *
+     * @param {Set<PackageGraphNode>} cycleNodes
+     */
+    pruneCycleNodes(cycleNodes) {
+        return this.prune(...cycleNodes);
+    }
+    /**
+     * Remove all candidate nodes.
+     * @param {PackageGraphNode[]} candidates
+     */
+    prune(...candidates) {
+        if (candidates.length === this.size) {
+            return this.clear();
+        }
+        candidates.forEach((node) => this.remove(node));
+    }
+    /**
+     * Delete by value (instead of key), as well as removing pointers
+     * to itself in the other node's internal collections.
+     * @param {PackageGraphNode} candidateNode instance to remove
+     */
+    remove(candidateNode) {
+        this.delete(candidateNode.name);
+        this.forEach((node) => {
+            // remove incoming edges ("indegree")
+            node.localDependencies.delete(candidateNode.name);
+            // remove outgoing edges ("outdegree")
+            node.localDependents.delete(candidateNode.name);
+        });
+    }
+}
+exports.PackageGraph = PackageGraph;
 //# sourceMappingURL=package-graph.js.map

package/dist/package-graph/package-graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"package-graph.js","sourceRoot":"","sources":["../../src/package-graph/package-graph.ts"],"names":[],"mappings":";;;;;;AAAA,sEAAkC;AAElC,+BAA+E;AAE/E,0DAAsD;AAEtD;;;;GAIG;AACH,MAAa,YAAa,SAAQ,GAAG;IACnC;;;;;;OAMG;IACH,YAAY,QAAmB,EAAE,YAAgD,iBAAiB,EAAE,UAAoB;QACtH,aAAa;QACb,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAY,EAAE,EAAE,WAAC,OAAA,CAAC,MAAA,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,IAAI,mCAAI,EAAE,EAAE,IAAI,sBAAgB,CAAC,GAAG,CAAC,CAAC,CAAA,EAAA,CAAC,CAAC,CAAC;QAEpF,IAAI,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,EAAE;YACjC,0BAA0B;YAC1B,MAAM,IAAI,GAAqB,IAAI,GAAG,EAAE,CAAC;YAEzC,KAAK,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,QAAQ,EAAE;gBACzC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;oBAClB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBAC/B;qBAAM;oBACL,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;iBAC5B;aACF;YAED,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,IAAI,EAAE;gBACpC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;oBACxB,MAAM,IAAI,kCAAe,CACvB,OAAO,EACP,CAAC,iBAAiB,IAAI,8BAA8B,EAAE,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CACjF,CAAC;iBACH;aACF;SACF;QAED,IAAI,CAAC,OAAO,CAAC,CAAC,WAA6B,EAAE,WAAmB,EAAE,EAAE;YAClE,MAAM,iBAAiB,GACrB,SAAS,KAAK,cAAc;gBAC1B,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,GAAG,CAAC,oBAAoB,EAAE,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC;gBACvF,CAAC,CAAC,MAAM,CAAC,MAAM,CACb,EAAE,EACF,WAAW,CAAC,GAAG,CAAC,eAAe,EAC/B,WAAW,CAAC,GAAG,CAAC,oBAAoB,EACpC,WAAW,CAAC,GAAG,CAAC,YAAY,CAC7B,CAAC;YAEN,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;gBACjD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAClC,uFAAuF;gBACvF,uFAAuF;gBACvF,mDAAmD;gBACnD,MAAM,IAAI,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;gBACnE,MAAM,QAAQ,GAAG,yBAAG,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;gBAElE,IAAI,CAAC,OAAO,EAAE;oBACZ,6DAA6D;oBAC7D,OAAO,WAAW,CAAC,oBAAoB,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;iBAChE;gBAED,IAAI,UAAU,IAAI,QAAQ,CAAC,SAAS,KAAK,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE;oBACxF,+CAA+C;oBAC/C,WAAW,CAAC,iBAAiB,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;oBACrD,OAAO,CAAC,eAAe,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;iBACvD;qBAAM;oBACL,4CAA4C;oBAC5C,WAAW,CAAC,oBAAoB,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;iBACzD;YACH,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED,IAAI,cAAc;QAChB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CAAC,gBAA2B;QACzC,OAAO,IAAI,CAAC,UAAU,CAAC,gBAAgB,EAAE,mBAAmB,CAAC,CAAC;IAChE,CAAC;IAED;;;;;;OAMG;IACH,aAAa,CAAC,gBAA2B;QACvC,OAAO,IAAI,CAAC,UAAU,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAC;IAC9D,CAAC;IAED;;;;;;;OAOG;IACH,UAAU,CAAC,WAAsB,EAAE,QAAiD;QAClF,2EAA2E;QAC3E,MAAM,MAAM,GAAG,IAAI,GAAG,CAAmB,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAExF,oDAAoD;QACpD,iCAAiC;QACjC,MAAM,MAAM,GAAuB,EAAE,CAAC;QAEtC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE;YAC7B,2CAA2C;YAC3C,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAEzB,WAAW,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE;gBAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAElC,IAAI,OAAO,KAAK,WAAW,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;oBACnD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;iBACrB;YACH,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,kDAAkD;QAClD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxC,CAAC;IAED;;;;;;;OAOG;IACH,eAAe,CAAC,YAAsB;QACpC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAY,CAAC;QACvC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;QAE/C,IAAI,CAAC,OAAO,CAAC,CAAC,WAA6B,EAAE,WAAmB,EAAE,EAAE;YAClE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;YAEzC,MAAM,MAAM,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,aAA+B,EAAE,aAAqB,EAAE,iBAAsB,EAAE,EAAE;gBAC1G,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;gBAExC,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE;oBAC3B,OAAO;iBACR;gBAED,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;gBAExB,IAAI,aAAa,KAAK,WAAW,EAAE;oBACjC,iBAAiB;oBACjB,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBAC5B,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAErB,OAAO;iBACR;gBAED,IAAI,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE;oBACtC,qBAAqB;oBACrB,MAAM,kBAAkB,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CACzF,WAAW,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CACrC,CAAC;oBACF,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;oBAEtE,UAAU,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;oBAC9B,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;iBAC7B;gBAED,aAAa,CAAC,eAAe,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACtD,CAAC,CAAC;YAEF,WAAW,CAAC,eAAe,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,IAAA,kBAAY,EACV,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EACrD,YAAY,CACb,CAAC;QAEF,OAAO,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAClC,CAAC;IAED;;;;;;OAMG;IACH,cAAc,CAAC,YAAsB;QACnC,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,MAAM,WAAW,GAAG,IAAI,GAAG,EAA4C,CAAC;QACxE,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;QACjD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAoB,CAAC;QACnD,MAAM,SAAS,GAAqD,EAAE,CAAC;QAEvE,SAAS,MAAM,CAAC,QAAQ,EAAE,aAAa;YACrC,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC7B,OAAO;aACR;YAED,IAAI,iBAAiB,GAAG,aAAa,CAAC;YACtC,OAAO,WAAW,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE;gBACzC,iBAAiB,GAAG,WAAW,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;aACxD;YAED,iGAAiG;YACjG,IAAI,cAAc,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE;gBACzC,OAAO;aACR;YACD,cAAc,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;YAEtC,IACE,iBAAiB,KAAK,QAAQ;gBAC9B,CAAC,iBAAiB,CAAC,OAAO,IAAI,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EACnE;gBACA,MAAM,KAAK,GAAQ,IAAI,4BAAsB,EAAE,CAAC;gBAEhD,SAAS,CAAC,OAAO,CAAC,CAAC,WAAsD,EAAE,EAAE;oBAC3E,WAAW,CAAC,GAAG,CAAC,WAA+B,EAAE,KAAK,CAAC,CAAC;oBACxD,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;oBAC1B,MAAM,CAAC,MAAM,CAAC,WAAqC,CAAC,CAAC;gBACvD,CAAC,CAAC,CAAC;gBAEH,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAClB,aAAa;gBACb,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;gBAElC,OAAO;aACR;YAED,IAAI,SAAS,CAAC,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE;gBAC/C,gDAAgD;gBAChD,cAAc,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;aAC7C;QACH,CAAC;QAED,SAAS,cAAc,CAAC,QAAQ,EAAE,WAAW,GAAG,QAAQ;YACtD,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC5B,WAAW,CAAC,eAAe,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC;YACjE,SAAS,CAAC,GAAG,EAAE,CAAC;QAClB,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC;QAC3D,MAAM,CAAC,OAAO,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,CAAC;QAEjE,IAAA,kBAAY,EAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAEvC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CAAC,UAAiC;QAC/C,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,GAAG,UAA8B;QACrC,IAAI,UAAU,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,EAAE;YACnC,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;SACrB;QAED,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAClD,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,aAA+B;QACpC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAEhC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAsB,EAAE,EAAE;YACtC,qCAAqC;YACrC,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;YAElD,sCAAsC;YACtC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAtSD,oCAsSC"}
+{"version":3,"file":"package-graph.js","sourceRoot":"","sources":["../../src/package-graph/package-graph.ts"],"names":[],"mappings":";;;;;;AAAA,sEAAkC;AAElC,+BAA+E;AAE/E,0DAAsD;AAGtD;;;;GAIG;AACH,MAAa,YAAa,SAAQ,GAAG;IACnC;;;;;;OAMG;IACH,YAAY,QAAmB,EAAE,YAAgD,iBAAiB,EAAE,oBAA4E,MAAM;QACpL,6BAA6B;QAC7B,IAAI,iBAAiB,KAAK,IAAI,IAAI,iBAAiB,KAAK,YAAY,EAAE;YACpE,iBAAiB,GAAG,OAAO,CAAC,CAAC,sBAAsB;SACpD;QAED,aAAa;QACb,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAY,EAAE,EAAE,WAAC,OAAA,CAAC,MAAA,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,IAAI,mCAAI,EAAE,EAAE,IAAI,sBAAgB,CAAC,GAAG,CAAC,CAAC,CAAA,EAAA,CAAC,CAAC,CAAC;QAEpF,IAAI,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,EAAE;YACjC,0BAA0B;YAC1B,MAAM,IAAI,GAAqB,IAAI,GAAG,EAAE,CAAC;YAEzC,KAAK,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,QAAQ,EAAE;gBACzC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;oBAClB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBAC/B;qBAAM;oBACL,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;iBAC5B;aACF;YAED,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,IAAI,EAAE;gBACpC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;oBACxB,MAAM,IAAI,kCAAe,CACvB,OAAO,EACP,CAAC,iBAAiB,IAAI,8BAA8B,EAAE,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CACjF,CAAC;iBACH;aACF;SACF;QAED,IAAI,CAAC,OAAO,CAAC,CAAC,WAA6B,EAAE,WAAmB,EAAE,EAAE;YAClE,MAAM,iBAAiB,GACrB,SAAS,KAAK,cAAc;gBAC1B,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,GAAG,CAAC,oBAAoB,EAAE,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC;gBACvF,CAAC,CAAC,MAAM,CAAC,MAAM,CACb,EAAE,EACF,WAAW,CAAC,GAAG,CAAC,eAAe,EAC/B,WAAW,CAAC,GAAG,CAAC,oBAAoB,EACpC,WAAW,CAAC,GAAG,CAAC,YAAY,CAC7B,CAAC;YAEN,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;gBACjD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAClC,uFAAuF;gBACvF,uFAAuF;gBACvF,mDAAmD;gBACnD,IAAI,IAAI,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;gBAEjE,qEAAqE;gBACrE,iBAAiB;gBACjB,MAAM,iBAAiB,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnD,IAAI,eAAmC,CAAC;gBACxC,IAAI,iBAAiB,EAAE;oBACrB,eAAe,GAAG,IAAI,CAAC;oBACvB,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;oBAEvC,sEAAsE;oBACtE,0EAA0E;oBAC1E,mGAAmG;oBACnG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE;wBAChD,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;wBAC1D,MAAM,OAAO,GAAG,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,OAAO,CAAC;wBAChC,MAAM,UAAU,GAAG,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;wBAC5C,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,UAAU,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;qBAChD;iBACF;gBAED,MAAM,QAAQ,GAAqB,yBAAG,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;gBACpF,QAAQ,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;gBAC/C,IAAI,QAAQ,CAAC,iBAAiB,EAAE;oBAC9B,QAAQ,CAAC,eAAe,GAAG,eAAe,CAAC;iBAC5C;gBAED,IAAI,CAAC,OAAO,EAAE;oBACZ,6DAA6D;oBAC7D,OAAO,WAAW,CAAC,oBAAoB,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;iBAChE;gBAED,IACE,iBAAiB;oBACjB,iBAAiB,KAAK,OAAO;oBAC7B,QAAQ,CAAC,SAAS,KAAK,OAAO,CAAC,QAAQ;oBACvC,CAAC,iBAAiB,KAAK,UAAU,IAAI,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,EACjE;oBACA,qEAAqE;oBACrE,WAAW,CAAC,iBAAiB,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;oBACrD,OAAO,CAAC,eAAe,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;iBACvD;qBAAM;oBACL,4CAA4C;oBAC5C,WAAW,CAAC,oBAAoB,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;iBACzD;YACH,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED,IAAI,cAAc;QAChB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CAAC,gBAA2B;QACzC,OAAO,IAAI,CAAC,UAAU,CAAC,gBAAgB,EAAE,mBAAmB,CAAC,CAAC;IAChE,CAAC;IAED;;;;;;OAMG;IACH,aAAa,CAAC,gBAA2B;QACvC,OAAO,IAAI,CAAC,UAAU,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAC;IAC9D,CAAC;IAED;;;;;;;OAOG;IACH,UAAU,CAAC,WAAsB,EAAE,QAAiD;QAClF,2EAA2E;QAC3E,MAAM,MAAM,GAAG,IAAI,GAAG,CAAmB,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAExF,oDAAoD;QACpD,iCAAiC;QACjC,MAAM,MAAM,GAAuB,EAAE,CAAC;QAEtC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE;YAC7B,2CAA2C;YAC3C,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAEzB,WAAW,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE;gBAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAElC,IAAI,OAAO,KAAK,WAAW,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;oBACnD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;iBACrB;YACH,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,kDAAkD;QAClD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxC,CAAC;IAED;;;;;;;OAOG;IACH,eAAe,CAAC,YAAsB;QACpC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAY,CAAC;QACvC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;QAE/C,IAAI,CAAC,OAAO,CAAC,CAAC,WAA6B,EAAE,WAAmB,EAAE,EAAE;YAClE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;YAEzC,MAAM,MAAM,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,aAA+B,EAAE,aAAqB,EAAE,iBAAsB,EAAE,EAAE;gBAC1G,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;gBAExC,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE;oBAC3B,OAAO;iBACR;gBAED,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;gBAExB,IAAI,aAAa,KAAK,WAAW,EAAE;oBACjC,iBAAiB;oBACjB,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBAC5B,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAErB,OAAO;iBACR;gBAED,IAAI,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE;oBACtC,qBAAqB;oBACrB,MAAM,kBAAkB,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CACzF,WAAW,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CACrC,CAAC;oBACF,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;oBAEtE,UAAU,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;oBAC9B,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;iBAC7B;gBAED,aAAa,CAAC,eAAe,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACtD,CAAC,CAAC;YAEF,WAAW,CAAC,eAAe,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,IAAA,kBAAY,EACV,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EACrD,YAAY,CACb,CAAC;QAEF,OAAO,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAClC,CAAC;IAED;;;;;;OAMG;IACH,cAAc,CAAC,YAAsB;QACnC,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,MAAM,WAAW,GAAG,IAAI,GAAG,EAA4C,CAAC;QACxE,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;QACjD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAoB,CAAC;QACnD,MAAM,SAAS,GAAqD,EAAE,CAAC;QAEvE,SAAS,MAAM,CAAC,QAAQ,EAAE,aAAa;YACrC,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC7B,OAAO;aACR;YAED,IAAI,iBAAiB,GAAG,aAAa,CAAC;YACtC,OAAO,WAAW,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE;gBACzC,iBAAiB,GAAG,WAAW,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;aACxD;YAED,iGAAiG;YACjG,IAAI,cAAc,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE;gBACzC,OAAO;aACR;YACD,cAAc,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;YAEtC,IACE,iBAAiB,KAAK,QAAQ;gBAC9B,CAAC,iBAAiB,CAAC,OAAO,IAAI,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EACnE;gBACA,MAAM,KAAK,GAAQ,IAAI,4BAAsB,EAAE,CAAC;gBAEhD,SAAS,CAAC,OAAO,CAAC,CAAC,WAAsD,EAAE,EAAE;oBAC3E,WAAW,CAAC,GAAG,CAAC,WAA+B,EAAE,KAAK,CAAC,CAAC;oBACxD,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;oBAC1B,MAAM,CAAC,MAAM,CAAC,WAAqC,CAAC,CAAC;gBACvD,CAAC,CAAC,CAAC;gBAEH,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAClB,aAAa;gBACb,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;gBAElC,OAAO;aACR;YAED,IAAI,SAAS,CAAC,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE;gBAC/C,gDAAgD;gBAChD,cAAc,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;aAC7C;QACH,CAAC;QAED,SAAS,cAAc,CAAC,QAAQ,EAAE,WAAW,GAAG,QAAQ;YACtD,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC5B,WAAW,CAAC,eAAe,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC;YACjE,SAAS,CAAC,GAAG,EAAE,CAAC;QAClB,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC;QAC3D,MAAM,CAAC,OAAO,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,CAAC;QAEjE,IAAA,kBAAY,EAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAEvC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CAAC,UAAiC;QAC/C,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,GAAG,UAA8B;QACrC,IAAI,UAAU,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,EAAE;YACnC,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;SACrB;QAED,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAClD,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,aAA+B;QACpC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAEhC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAsB,EAAE,EAAE;YACtC,qCAAqC;YACrC,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;YAElD,sCAAsC;YACtC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAxUD,oCAwUC"}