@lerna-lite/core 0.3.0

package/dist/otplease.js

@@ -0,0 +1,110 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getOneTimePassword = exports.otplease = void 0;
+const prompt_1 = require("./prompt");
+/**
+ * @typedef {object} OneTimePasswordCache - Passed between concurrent executions
+ * @property {string} [otp] The one-time password, passed as an option or received via prompt
+ */
+// basic single-entry semaphore
+const semaphore = {
+    wait() {
+        return new Promise((resolve) => {
+            if (!this._promise) {
+                // not waiting, block other callers until 'release' is called.
+                this._promise = new Promise((release) => {
+                    this._resolve = release;
+                });
+                resolve(undefined);
+            }
+            else {
+                // wait for 'release' to be called and try to lock the semaphore again.
+                resolve(this._promise.then(() => this.wait()));
+            }
+        });
+    },
+    release() {
+        const resolve = this._resolve;
+        // istanbul ignore else
+        if (resolve) {
+            this._resolve = undefined;
+            this._promise = undefined;
+            // notify waiters that the semaphore has been released.
+            resolve();
+        }
+    },
+};
+/**
+ * Attempt to execute Promise callback, prompting for OTP if necessary.
+ * @template {Record<string, unknown>} T
+ * @param {(opts: T) => Promise<unknown>} fn
+ * @param {T} _opts The options to be passed to `fn`
+ * @param {OneTimePasswordCache} otpCache
+ */
+function otplease(fn, _opts, otpCache) {
+    // always prefer explicit config (if present) to cache
+    const opts = { ...otpCache, ..._opts };
+    return attempt(fn, opts, otpCache);
+}
+exports.otplease = otplease;
+/** @returns {Promise<unknown>} */
+function attempt(fn, opts, otpCache) {
+    return new Promise((resolve) => {
+        resolve(fn(opts));
+    }).catch((err) => {
+        if (err.code !== 'EOTP' && !(err.code === 'E401' && /one-time pass/.test(err.body))) {
+            throw err;
+        }
+        else if (!process.stdin.isTTY || !process.stdout.isTTY) {
+            throw err;
+        }
+        else {
+            // check the cache in case a concurrent caller has already updated the otp.
+            if (otpCache !== null && otpCache.otp !== null && otpCache.otp !== opts.otp) {
+                return attempt(fn, { ...opts, ...otpCache }, otpCache);
+            }
+            // only allow one getOneTimePassword attempt at a time to reuse the value
+            // from the preceeding prompt
+            return semaphore.wait().then(() => {
+                // check the cache again in case a previous waiter already updated it.
+                if (otpCache !== null && otpCache.otp !== null && otpCache.otp !== opts.otp) {
+                    semaphore.release();
+                    return attempt(fn, { ...opts, ...otpCache }, otpCache);
+                }
+                return getOneTimePassword()
+                    .then((otp) => {
+                    // update the otp and release the lock so that waiting
+                    // callers can see the updated otp.
+                    if (otpCache !== null) {
+                        // eslint-disable-next-line no-param-reassign
+                        otpCache.otp = otp;
+                    }
+                    semaphore.release();
+                    return otp;
+                }, (promptError) => {
+                    // release the lock and reject the promise.
+                    semaphore.release();
+                    return Promise.reject(promptError);
+                })
+                    .then((otp) => {
+                    return fn({ ...opts, otp });
+                });
+            });
+        }
+    });
+}
+/**
+ * Prompt user for one-time password.
+ * @returns {Promise<string>}
+ */
+function getOneTimePassword(message = 'This operation requires a one-time password:') {
+    // Logic taken from npm internals: https://git.io/fNoMe
+    return prompt_1.PromptUtilities.input(message, {
+        filter: (otp) => otp.replace(/\s+/g, ''),
+        validate: (otp) => (otp && /^[\d ]+$|^[A-Fa-f0-9]{64,64}$/.test(otp)) ||
+            'Must be a valid one-time-password. ' +
+                'See https://docs.npmjs.com/getting-started/using-two-factor-authentication',
+    });
+}
+exports.getOneTimePassword = getOneTimePassword;
+//# sourceMappingURL=otplease.js.map

package/dist/otplease.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"otplease.js","sourceRoot":"","sources":["../src/otplease.ts"],"names":[],"mappings":";;;AAAA,qCAA2C;AAE3C;;;GAGG;AAGH,+BAA+B;AAC/B,MAAM,SAAS,GAAQ;IACrB,IAAI;QACF,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAC7B,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;gBAClB,8DAA8D;gBAC9D,IAAI,CAAC,QAAQ,GAAG,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;oBACtC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;gBAC1B,CAAC,CAAC,CAAC;gBACH,OAAO,CAAC,SAAS,CAAC,CAAC;aACpB;iBAAM;gBACL,uEAAuE;gBACvE,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;aAChD;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IACD,OAAO;QACL,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,uBAAuB;QACvB,IAAI,OAAO,EAAE;YACX,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC1B,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC1B,uDAAuD;YACvD,OAAO,EAAE,CAAC;SACX;IACH,CAAC;CACF,CAAC;AAEF;;;;;;GAMG;AACH,SAAgB,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,QAAQ;IAC1C,sDAAsD;IACtD,MAAM,IAAI,GAAG,EAAE,GAAG,QAAQ,EAAE,GAAG,KAAK,EAAE,CAAC;IACvC,OAAO,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;AACrC,CAAC;AAJD,4BAIC;AAED,kCAAkC;AAClC,SAAS,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ;IACjC,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;QAC7B,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;QACf,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE;YACnF,MAAM,GAAG,CAAC;SACX;aAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE;YACxD,MAAM,GAAG,CAAC;SACX;aAAM;YACL,2EAA2E;YAC3E,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,CAAC,GAAG,KAAK,IAAI,IAAI,QAAQ,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,EAAE;gBAC3E,OAAO,OAAO,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,GAAG,QAAQ,EAAE,EAAE,QAAQ,CAAC,CAAC;aACxD;YACD,yEAAyE;YACzE,6BAA6B;YAC7B,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE;gBAChC,sEAAsE;gBACtE,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,CAAC,GAAG,KAAK,IAAI,IAAI,QAAQ,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,EAAE;oBAC3E,SAAS,CAAC,OAAO,EAAE,CAAC;oBACpB,OAAO,OAAO,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,GAAG,QAAQ,EAAE,EAAE,QAAQ,CAAC,CAAC;iBACxD;gBACD,OAAO,kBAAkB,EAAE;qBACxB,IAAI,CACH,CAAC,GAAG,EAAE,EAAE;oBACN,sDAAsD;oBACtD,mCAAmC;oBACnC,IAAI,QAAQ,KAAK,IAAI,EAAE;wBACrB,6CAA6C;wBAC7C,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAC;qBACpB;oBACD,SAAS,CAAC,OAAO,EAAE,CAAC;oBACpB,OAAO,GAAG,CAAC;gBACb,CAAC,EACD,CAAC,WAAW,EAAE,EAAE;oBACd,2CAA2C;oBAC3C,SAAS,CAAC,OAAO,EAAE,CAAC;oBACpB,OAAO,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;gBACrC,CAAC,CACF;qBACA,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE;oBACZ,OAAO,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC9B,CAAC,CAAC,CAAC;YACP,CAAC,CAAC,CAAC;SACJ;IACH,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,SAAgB,kBAAkB,CAAC,OAAO,GAAG,8CAA8C;IACzF,uDAAuD;IACvD,OAAO,wBAAe,CAAC,KAAK,CAAC,OAAO,EAAE;QACpC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,QAAQ,EAAE,CAAC,GAAG,EAAE,EAAE,CAChB,CAAC,GAAG,IAAI,+BAA+B,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClD,qCAAqC;gBACrC,4EAA4E;KAC/E,CAAC,CAAC;AACL,CAAC;AATD,gDASC"}

package/dist/package-graph/index.d.ts

@@ -0,0 +1,2 @@
+export * from './package-graph';
+export * from './lib';

package/dist/package-graph/index.js

@@ -0,0 +1,15 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./package-graph"), exports);
+__exportStar(require("./lib"), exports);
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/package-graph/index.ts"],"names":[],"mappings":";;;;;;;;;;;;AAAA,kDAAgC;AAChC,wCAAsB"}

package/dist/package-graph/lib/cyclic-package-graph-node.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Represents a cyclic collection of nodes in a PackageGraph.
+ * It is meant to be used as a black box, where the only exposed
+ * information are the connections to the other nodes of the graph.
+ * It can contain either `PackageGraphNode`s or other `CyclicPackageGraphNode`s.
+ *
+ * @extends {Map<string, import('..').PackageGraphNode | CyclicPackageGraphNode>}
+ */
+export declare class CyclicPackageGraphNode extends Map {
+    name: string;
+    localDependencies: Map<string, any>;
+    localDependents: Map<string, any>;
+    constructor();
+    get isCycle(): boolean;
+    /**
+     * @returns {string} A representation of a cycle, like like `A -> B -> C -> A`.
+     */
+    toString(): string;
+    /**
+     * Flattens a CyclicPackageGraphNode (which can have multiple level of cycles).
+     */
+    flatten(): any[];
+    /**
+     * Checks if a given node is contained in this cycle (or in a nested one)
+     *
+     * @param {string} name The name of the package to search in this cycle
+     * @returns {boolean}
+     */
+    contains(name: any): boolean;
+    /**
+     * Adds a graph node, or a nested cycle, to this group.
+     *
+     * @param {import('..').PackageGraphNode | CyclicPackageGraphNode} node
+     */
+    insert(node: any): void;
+    /**
+     * Remove pointers to candidate node from internal collections.
+     * @param {import('..').PackageGraphNode | CyclicPackageGraphNode} candidateNode instance to unlink
+     */
+    unlink(candidateNode: any): void;
+}

package/dist/package-graph/lib/cyclic-package-graph-node.js

@@ -0,0 +1,101 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CyclicPackageGraphNode = void 0;
+let lastCollapsedNodeId = 0;
+/**
+ * Represents a cyclic collection of nodes in a PackageGraph.
+ * It is meant to be used as a black box, where the only exposed
+ * information are the connections to the other nodes of the graph.
+ * It can contain either `PackageGraphNode`s or other `CyclicPackageGraphNode`s.
+ *
+ * @extends {Map<string, import('..').PackageGraphNode | CyclicPackageGraphNode>}
+ */
+class CyclicPackageGraphNode extends Map {
+    constructor() {
+        super();
+        this.name = `(cycle) ${(lastCollapsedNodeId += 1)}`;
+        /** @type {Map<string, import('..').PackageGraphNode | CyclicPackageGraphNode>} */
+        this.localDependencies = new Map();
+        /** @type {Map<string, import('..').PackageGraphNode | CyclicPackageGraphNode>} */
+        this.localDependents = new Map();
+    }
+    // eslint-disable-next-line class-methods-use-this
+    get isCycle() {
+        return true;
+    }
+    /**
+     * @returns {string} A representation of a cycle, like like `A -> B -> C -> A`.
+     */
+    toString() {
+        const parts = Array.from(this, ([key, node]) => node.isCycle ? `(nested cycle: ${node.toString()})` : key);
+        // start from the origin
+        parts.push(parts[0]);
+        return parts.reverse().join(' -> ');
+    }
+    /**
+     * Flattens a CyclicPackageGraphNode (which can have multiple level of cycles).
+     */
+    flatten() {
+        /** @type {import('..').PackageGraphNode[]} */
+        const result = [];
+        for (const node of this.values()) {
+            if (node.isCycle) {
+                result.push(...node.flatten());
+            }
+            else {
+                result.push(node);
+            }
+        }
+        return result;
+    }
+    /**
+     * Checks if a given node is contained in this cycle (or in a nested one)
+     *
+     * @param {string} name The name of the package to search in this cycle
+     * @returns {boolean}
+     */
+    contains(name) {
+        for (const [currentName, currentNode] of this) {
+            if (currentNode.isCycle) {
+                if (currentNode.contains(name)) {
+                    return true;
+                }
+            }
+            else if (currentName === name) {
+                return true;
+            }
+        }
+        return false;
+    }
+    /**
+     * Adds a graph node, or a nested cycle, to this group.
+     *
+     * @param {import('..').PackageGraphNode | CyclicPackageGraphNode} node
+     */
+    insert(node) {
+        this.set(node.name, node);
+        this.unlink(node);
+        for (const [dependencyName, dependencyNode] of node.localDependencies) {
+            if (!this.contains(dependencyName)) {
+                this.localDependencies.set(dependencyName, dependencyNode);
+            }
+        }
+        for (const [dependentName, dependentNode] of node.localDependents) {
+            if (!this.contains(dependentName)) {
+                this.localDependents.set(dependentName, dependentNode);
+            }
+        }
+    }
+    /**
+     * Remove pointers to candidate node from internal collections.
+     * @param {import('..').PackageGraphNode | CyclicPackageGraphNode} candidateNode instance to unlink
+     */
+    unlink(candidateNode) {
+        // remove incoming edges ("indegree")
+        this.localDependencies.delete(candidateNode.name);
+        // remove outgoing edges ("outdegree")
+        this.localDependents.delete(candidateNode.name);
+    }
+}
+exports.CyclicPackageGraphNode = CyclicPackageGraphNode;
+//# sourceMappingURL=cyclic-package-graph-node.js.map

package/dist/package-graph/lib/cyclic-package-graph-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cyclic-package-graph-node.js","sourceRoot":"","sources":["../../../src/package-graph/lib/cyclic-package-graph-node.ts"],"names":[],"mappings":";;;AAAA,IAAI,mBAAmB,GAAG,CAAC,CAAC;AAE5B;;;;;;;GAOG;AACH,MAAa,sBAAuB,SAAQ,GAAG;IAK7C;QACE,KAAK,EAAE,CAAC;QAER,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC,mBAAmB,IAAI,CAAC,CAAC,EAAE,CAAC;QAEpD,kFAAkF;QAClF,IAAI,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;QAEnC,kFAAkF;QAClF,IAAI,CAAC,eAAe,GAAG,IAAI,GAAG,EAAE,CAAC;IACnC,CAAC;IAED,kDAAkD;IAClD,IAAI,OAAO;QACT,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,CAC7C,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,kBAAkB,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAC1D,CAAC;QAEF,wBAAwB;QACxB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAErB,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,OAAO;QACL,8CAA8C;QAC9C,MAAM,MAAM,GAAU,EAAE,CAAC;QAEzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YAChC,IAAI,IAAI,CAAC,OAAO,EAAE;gBAChB,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;aAChC;iBAAM;gBACL,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACnB;SACF;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,IAAI;QACX,KAAK,MAAM,CAAC,WAAW,EAAE,WAAW,CAAC,IAAI,IAAI,EAAE;YAC7C,IAAI,WAAW,CAAC,OAAO,EAAE;gBACvB,IAAI,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE;oBAC9B,OAAO,IAAI,CAAC;iBACb;aACF;iBAAM,IAAI,WAAW,KAAK,IAAI,EAAE;gBAC/B,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,IAAI;QACT,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAElB,KAAK,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE;YACrE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE;gBAClC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;aAC5D;SACF;QAED,KAAK,MAAM,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE;YACjE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE;gBACjC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;aACxD;SACF;IACH,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,aAAa;QAClB,qCAAqC;QACrC,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAElD,sCAAsC;QACtC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;CACF;AA1GD,wDA0GC"}

package/dist/package-graph/lib/index.d.ts

@@ -0,0 +1,3 @@
+export * from './cyclic-package-graph-node';
+export * from './package-graph-node';
+export * from './report-cycles';

package/dist/package-graph/lib/index.js

@@ -0,0 +1,16 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./cyclic-package-graph-node"), exports);
+__exportStar(require("./package-graph-node"), exports);
+__exportStar(require("./report-cycles"), exports);
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/package-graph/lib/index.ts"],"names":[],"mappings":";;;;;;;;;;;;AAAA,8DAA4C;AAC5C,uDAAqC;AACrC,kDAAgC"}

package/dist/package-graph/lib/package-graph-node.d.ts

@@ -0,0 +1,35 @@
+/**
+ * A node in a PackageGraph.
+ */
+export declare class PackageGraphNode {
+    name: string;
+    externalDependencies: Map<string, any>;
+    localDependencies: Map<string, any>;
+    localDependents: Map<string, any>;
+    /**
+     * @param {import("@lerna/package").Package} pkg
+     */
+    constructor(pkg: any);
+    get location(): any;
+    get pkg(): any;
+    get prereleaseId(): string | undefined;
+    get version(): any;
+    /**
+     * Determine if the Node satisfies a resolved semver range.
+     * @see https://github.com/npm/npm-package-arg#result-object
+     *
+     * @param {!Result} resolved npm-package-arg Result object
+     * @returns {Boolean}
+     */
+    satisfies({ gitCommittish, gitRange, fetchSpec }: {
+        gitCommittish: any;
+        gitRange: any;
+        fetchSpec: any;
+    }): boolean;
+    /**
+     * Returns a string representation of this node (its name)
+     *
+     * @returns {String}
+     */
+    toString(): string;
+}

package/dist/package-graph/lib/package-graph-node.js

@@ -0,0 +1,61 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PackageGraphNode = void 0;
+const semver_1 = __importDefault(require("semver"));
+const prerelease_id_from_version_1 = require("../../utils/prerelease-id-from-version");
+const PKG = Symbol('pkg');
+/**
+ * A node in a PackageGraph.
+ */
+class PackageGraphNode {
+    /**
+     * @param {import("@lerna/package").Package} pkg
+     */
+    constructor(pkg) {
+        this.name = pkg.name;
+        this[PKG] = pkg;
+        // omit raw pkg from default util.inspect() output
+        Object.defineProperty(this, PKG, { enumerable: false });
+        /** @type {Map<string, import("npm-package-arg").Result>} */
+        this.externalDependencies = new Map();
+        /** @type {Map<string, import("npm-package-arg").Result>} */
+        this.localDependencies = new Map();
+        /** @type {Map<string, PackageGraphNode>} */
+        this.localDependents = new Map();
+    }
+    get location() {
+        return this[PKG].location;
+    }
+    get pkg() {
+        return this[PKG];
+    }
+    get prereleaseId() {
+        return (0, prerelease_id_from_version_1.prereleaseIdFromVersion)(this.version);
+    }
+    get version() {
+        return this[PKG].version;
+    }
+    /**
+     * Determine if the Node satisfies a resolved semver range.
+     * @see https://github.com/npm/npm-package-arg#result-object
+     *
+     * @param {!Result} resolved npm-package-arg Result object
+     * @returns {Boolean}
+     */
+    satisfies({ gitCommittish, gitRange, fetchSpec }) {
+        return semver_1.default.satisfies(this.version, gitCommittish || gitRange || fetchSpec);
+    }
+    /**
+     * Returns a string representation of this node (its name)
+     *
+     * @returns {String}
+     */
+    toString() {
+        return this.name;
+    }
+}
+exports.PackageGraphNode = PackageGraphNode;
+//# sourceMappingURL=package-graph-node.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"package-graph-node.js","sourceRoot":"","sources":["../../../src/package-graph/lib/package-graph-node.ts"],"names":[],"mappings":";;;;;;AAAA,oDAA4B;AAE5B,uFAAiF;AAEjF,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;AAE1B;;GAEG;AACH,MAAa,gBAAgB;IAM3B;;OAEG;IACH,YAAY,GAAG;QACb,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;QACrB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;QAEhB,kDAAkD;QAClD,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;QAExD,4DAA4D;QAC5D,IAAI,CAAC,oBAAoB,GAAG,IAAI,GAAG,EAAE,CAAC;QAEtC,4DAA4D;QAC5D,IAAI,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;QAEnC,4CAA4C;QAC5C,IAAI,CAAC,eAAe,GAAG,IAAI,GAAG,EAAE,CAAC;IACnC,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC;IAC5B,CAAC;IAED,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,IAAI,YAAY;QACd,OAAO,IAAA,oDAAuB,EAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/C,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;IAC3B,CAAC;IAED;;;;;;OAMG;IACH,SAAS,CAAC,EAAE,aAAa,EAAE,QAAQ,EAAE,SAAS,EAAE;QAC9C,OAAO,gBAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,aAAa,IAAI,QAAQ,IAAI,SAAS,CAAC,CAAC;IAChF,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;CACF;AA7DD,4CA6DC"}

package/dist/package-graph/lib/report-cycles.d.ts

@@ -0,0 +1 @@
+export declare function reportCycles(paths: any, rejectCycles: any): void;

package/dist/package-graph/lib/report-cycles.js

@@ -0,0 +1,20 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.reportCycles = void 0;
+const npmlog_1 = __importDefault(require("npmlog"));
+const validation_error_1 = require("../../validation-error");
+function reportCycles(paths, rejectCycles) {
+    if (!paths.length) {
+        return;
+    }
+    const cycleMessage = ['Dependency cycles detected, you should fix these!'].concat(paths).join('\n');
+    if (rejectCycles) {
+        throw new validation_error_1.ValidationError('ECYCLE', cycleMessage);
+    }
+    npmlog_1.default.warn('ECYCLE', cycleMessage);
+}
+exports.reportCycles = reportCycles;
+//# sourceMappingURL=report-cycles.js.map

package/dist/package-graph/lib/report-cycles.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"report-cycles.js","sourceRoot":"","sources":["../../../src/package-graph/lib/report-cycles.ts"],"names":[],"mappings":";;;;;;AAAA,oDAAyB;AAEzB,6DAAyD;AAEzD,SAAgB,YAAY,CAAC,KAAK,EAAE,YAAY;IAC9C,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;QACjB,OAAO;KACR;IAED,MAAM,YAAY,GAAG,CAAC,mDAAmD,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEpG,IAAI,YAAY,EAAE;QAChB,MAAM,IAAI,kCAAe,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;KACnD;IAED,gBAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;AACnC,CAAC;AAZD,oCAYC"}

package/dist/package-graph/package-graph.d.ts

@@ -0,0 +1,78 @@
+import { Package } from '../package';
+/**
+ * A graph of packages in the current project.
+ *
+ * @extends {Map<string, PackageGraphNode>}
+ */
+export declare 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: Package[], graphType?: string, forceLocal?: boolean);
+    get rawPackageList(): any[];
+    /**
+     * 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: any): any[];
+    /**
+     * 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: any): any[];
+    /**
+     * 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: any, nodeProp: any): any[];
+    /**
+     * 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: any): Set<unknown>[];
+    /**
+     * 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: any): Set<unknown>;
+    /**
+     * Remove cycle nodes.
+     *
+     * @deprecated Spread set into prune() instead.
+     *
+     * @param {Set<PackageGraphNode>} cycleNodes
+     */
+    pruneCycleNodes(cycleNodes: any): void;
+    /**
+     * Remove all candidate nodes.
+     * @param {PackageGraphNode[]} candidates
+     */
+    prune(...candidates: any[]): void;
+    /**
+     * 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: any): void;
+}