@lerna-lite/core 1.3.0 → 1.4.0

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

@@ -1,59 +1,59 @@
-"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) {
-        var _a;
-        this.name = (_a = pkg === null || pkg === void 0 ? void 0 : pkg.name) !== null && _a !== void 0 ? _a : '';
-        this[PKG] = pkg;
-        // omit raw pkg from default util.inspect() output
-        Object.defineProperty(this, PKG, { enumerable: false });
-        this.externalDependencies = new Map();
-        this.localDependencies = new Map();
-        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;
+"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) {
+        var _a;
+        this.name = (_a = pkg === null || pkg === void 0 ? void 0 : pkg.name) !== null && _a !== void 0 ? _a : '';
+        this[PKG] = pkg;
+        // omit raw pkg from default util.inspect() output
+        Object.defineProperty(this, PKG, { enumerable: false });
+        this.externalDependencies = new Map();
+        this.localDependencies = new Map();
+        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/report-cycles.d.ts

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

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

@@ -1,20 +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;
+"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/package-graph.d.ts

@@ -1,79 +1,79 @@
-import { CyclicPackageGraphNode, PackageGraphNode } from './lib';
-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|'auto'|'force'|'explicit'} [localDependencies] Treatment of local sibling dependencies, default "auto"
-     */
-    constructor(packages: Package[], graphType?: 'allDependencies' | 'dependencies', localDependencies?: boolean | 'auto' | 'force' | 'explicit' | 'forceLocal');
-    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: Package[]): Package[];
-    /**
-     * 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: Package[]): Package[];
-    /**
-     * 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: Package[], nodeProp: 'localDependencies' | 'localDependents'): Package[];
-    /**
-     * 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?: boolean): (Set<PackageGraphNode> | Set<string[]>)[];
-    /**
-     * 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?: boolean): Set<CyclicPackageGraphNode>;
-    /**
-     * Remove cycle nodes.
-     *
-     * @deprecated Spread set into prune() instead.
-     *
-     * @param {Set<PackageGraphNode>} cycleNodes
-     */
-    pruneCycleNodes(cycleNodes: Set<PackageGraphNode>): void;
-    /**
-     * Remove all candidate nodes.
-     * @param {PackageGraphNode[]} candidates
-     */
-    prune(...candidates: PackageGraphNode[]): 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: PackageGraphNode): void;
-}
+import { CyclicPackageGraphNode, PackageGraphNode } from './lib';
+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|'auto'|'force'|'explicit'} [localDependencies] Treatment of local sibling dependencies, default "auto"
+     */
+    constructor(packages: Package[], graphType?: 'allDependencies' | 'dependencies', localDependencies?: boolean | 'auto' | 'force' | 'explicit' | 'forceLocal');
+    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: Package[]): Package[];
+    /**
+     * 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: Package[]): Package[];
+    /**
+     * 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: Package[], nodeProp: 'localDependencies' | 'localDependents'): Package[];
+    /**
+     * 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?: boolean): (Set<PackageGraphNode> | Set<string[]>)[];
+    /**
+     * 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?: boolean): Set<CyclicPackageGraphNode>;
+    /**
+     * Remove cycle nodes.
+     *
+     * @deprecated Spread set into prune() instead.
+     *
+     * @param {Set<PackageGraphNode>} cycleNodes
+     */
+    pruneCycleNodes(cycleNodes: Set<PackageGraphNode>): void;
+    /**
+     * Remove all candidate nodes.
+     * @param {PackageGraphNode[]} candidates
+     */
+    prune(...candidates: PackageGraphNode[]): 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: PackageGraphNode): void;
+}