@lerna-lite/core 1.15.1 → 1.16.1

package/dist/utils/collect-updates/collect-updates.js

@@ -1,90 +1,90 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.collectUpdates = void 0;
-const npmlog_1 = __importDefault(require("npmlog"));
-const describe_ref_1 = require("../describe-ref");
-const collect_packages_1 = require("./lib/collect-packages");
-const get_packages_for_option_1 = require("./lib/get-packages-for-option");
-const has_tags_1 = require("./lib/has-tags");
-const make_diff_predicate_1 = require("./lib/make-diff-predicate");
-/**
- * Create a list of graph nodes representing packages changed since the previous release, tagged or otherwise.
- * @param {import("@lerna/package").Package[]} filteredPackages
- * @param {import("@lerna/package-graph").PackageGraph} packageGraph
- * @param {import("@lerna/child-process").ExecOpts} execOpts
- * @param {UpdateCollectorOptions} commandOptions
- */
-function collectUpdates(filteredPackages, packageGraph, execOpts, commandOptions, dryRun = false) {
-    const { forcePublish, conventionalCommits, conventionalGraduate, excludeDependents, isIndependent } = commandOptions;
-    // If --conventional-commits and --conventional-graduate are both set, ignore --force-publish
-    const useConventionalGraduate = conventionalCommits && conventionalGraduate;
-    const forced = (0, get_packages_for_option_1.getPackagesForOption)(useConventionalGraduate ? conventionalGraduate : forcePublish);
-    const packages = filteredPackages.length === packageGraph.size
-        ? packageGraph
-        : new Map(filteredPackages.map(({ name }) => [name, packageGraph.get(name)]));
-    let committish = commandOptions.since;
-    const tagPattern = isIndependent ? '*@*' : '';
-    if ((0, has_tags_1.hasTags)(execOpts, tagPattern)) {
-        const describeOptions = {
-            ...execOpts,
-        };
-        if (isIndependent) {
-            describeOptions.match = tagPattern;
-        }
-        // describe the last annotated tag in the current branch
-        const { sha, refCount, lastTagName } = (0, describe_ref_1.describeRefSync)(describeOptions, commandOptions.includeMergedTags, dryRun);
-        // TODO: warn about dirty tree?
-        if (refCount === '0' && forced.size === 0 && !committish) {
-            // no commits since previous release
-            npmlog_1.default.notice('', 'Current HEAD is already released, skipping change detection.');
-            return [];
-        }
-        if (commandOptions.canary) {
-            // if it's a merge commit, it will return all the commits that were part of the merge
-            // ex: If `ab7533e` had 2 commits, ab7533e^..ab7533e would contain 2 commits + the merge commit
-            committish = `${sha}^..${sha}`;
-        }
-        else if (!committish) {
-            // if no tags found, this will be undefined and we'll use the initial commit
-            committish = lastTagName;
-        }
-    }
-    if (forced.size) {
-        // "warn" might seem a bit loud, but it is appropriate for logging anything _forced_
-        npmlog_1.default.warn(useConventionalGraduate ? 'conventional-graduate' : 'force-publish', forced.has('*') ? 'all packages' : Array.from(forced.values()).join('\n'));
-    }
-    if (useConventionalGraduate) {
-        // --conventional-commits --conventional-graduate
-        if (forced.has('*')) {
-            npmlog_1.default.info('', 'Graduating all prereleased packages');
-        }
-        else {
-            npmlog_1.default.info('', 'Graduating prereleased packages');
-        }
-    }
-    else if (!committish || forced.has('*')) {
-        // --force-publish or no tag
-        npmlog_1.default.info('', 'Assuming all packages changed');
-        return (0, collect_packages_1.collectPackages)(packages, {
-            onInclude: (name) => npmlog_1.default.verbose('updated', name),
-            excludeDependents,
-        });
-    }
-    npmlog_1.default.info('', `Looking for changed packages since ${committish}`);
-    const hasDiff = (0, make_diff_predicate_1.makeDiffPredicate)(committish, execOpts, commandOptions.ignoreChanges);
-    const needsBump = !commandOptions.bump || commandOptions.bump.startsWith('pre')
-        ? () => false
-        : /* skip packages that have not been previously prereleased */
-            (node) => node.prereleaseId;
-    const isForced = (node, name) => (forced.has('*') || forced.has(name)) && (useConventionalGraduate ? node.prereleaseId : true);
-    return (0, collect_packages_1.collectPackages)(packages, {
-        isCandidate: (node, name) => isForced(node, name) || needsBump(node) || hasDiff(node),
-        onInclude: (name) => npmlog_1.default.verbose('updated', name),
-        excludeDependents,
-    });
-}
-exports.collectUpdates = collectUpdates;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.collectUpdates = void 0;
+const tslib_1 = require("tslib");
+const npmlog_1 = tslib_1.__importDefault(require("npmlog"));
+const describe_ref_1 = require("../describe-ref");
+const collect_packages_1 = require("./lib/collect-packages");
+const get_packages_for_option_1 = require("./lib/get-packages-for-option");
+const has_tags_1 = require("./lib/has-tags");
+const make_diff_predicate_1 = require("./lib/make-diff-predicate");
+/**
+ * Create a list of graph nodes representing packages changed since the previous release, tagged or otherwise.
+ * @param {import("@lerna/package").Package[]} filteredPackages
+ * @param {import("@lerna/package-graph").PackageGraph} packageGraph
+ * @param {import("@lerna/child-process").ExecOpts} execOpts
+ * @param {UpdateCollectorOptions} commandOptions
+ */
+function collectUpdates(filteredPackages, packageGraph, execOpts, commandOptions, dryRun = false) {
+    const { forcePublish, conventionalCommits, conventionalGraduate, excludeDependents, independentSubpackages, isIndependent, } = commandOptions;
+    // If --conventional-commits and --conventional-graduate are both set, ignore --force-publish
+    const useConventionalGraduate = conventionalCommits && conventionalGraduate;
+    const forced = (0, get_packages_for_option_1.getPackagesForOption)(useConventionalGraduate ? conventionalGraduate : forcePublish);
+    const packages = filteredPackages.length === packageGraph.size
+        ? packageGraph
+        : new Map(filteredPackages.map(({ name }) => [name, packageGraph.get(name)]));
+    let committish = commandOptions.since;
+    const tagPattern = isIndependent ? '*@*' : '';
+    if ((0, has_tags_1.hasTags)(execOpts, tagPattern)) {
+        const describeOptions = {
+            ...execOpts,
+        };
+        if (isIndependent) {
+            describeOptions.match = tagPattern;
+        }
+        // describe the last annotated tag in the current branch
+        const { sha, refCount, lastTagName } = (0, describe_ref_1.describeRefSync)(describeOptions, commandOptions.includeMergedTags, dryRun);
+        // TODO: warn about dirty tree?
+        if (refCount === '0' && forced.size === 0 && !committish) {
+            // no commits since previous release
+            npmlog_1.default.notice('', 'Current HEAD is already released, skipping change detection.');
+            return [];
+        }
+        if (commandOptions.canary) {
+            // if it's a merge commit, it will return all the commits that were part of the merge
+            // ex: If `ab7533e` had 2 commits, ab7533e^..ab7533e would contain 2 commits + the merge commit
+            committish = `${sha}^..${sha}`;
+        }
+        else if (!committish) {
+            // if no tags found, this will be undefined and we'll use the initial commit
+            committish = lastTagName;
+        }
+    }
+    if (forced.size) {
+        // "warn" might seem a bit loud, but it is appropriate for logging anything _forced_
+        npmlog_1.default.warn(useConventionalGraduate ? 'conventional-graduate' : 'force-publish', forced.has('*') ? 'all packages' : Array.from(forced.values()).join('\n'));
+    }
+    if (useConventionalGraduate) {
+        // --conventional-commits --conventional-graduate
+        if (forced.has('*')) {
+            npmlog_1.default.info('', 'Graduating all prereleased packages');
+        }
+        else {
+            npmlog_1.default.info('', 'Graduating prereleased packages');
+        }
+    }
+    else if (!committish || forced.has('*')) {
+        // --force-publish or no tag
+        npmlog_1.default.info('', 'Assuming all packages changed');
+        return (0, collect_packages_1.collectPackages)(packages, {
+            onInclude: (name) => npmlog_1.default.verbose('updated', name),
+            excludeDependents,
+        });
+    }
+    npmlog_1.default.info('', `Looking for changed packages since ${committish}`);
+    const hasDiff = (0, make_diff_predicate_1.makeDiffPredicate)(committish, execOpts, commandOptions.ignoreChanges, {
+        independentSubpackages,
+    });
+    const needsBump = !commandOptions.bump || commandOptions.bump.startsWith('pre')
+        ? () => false
+        : /* skip packages that have not been previously prereleased */
+            (node) => node.prereleaseId;
+    const isForced = (node, name) => (forced.has('*') || forced.has(name)) && (useConventionalGraduate ? node.prereleaseId : true);
+    return (0, collect_packages_1.collectPackages)(packages, {
+        isCandidate: (node, name) => isForced(node, name) || needsBump(node) || hasDiff(node),
+        onInclude: (name) => npmlog_1.default.verbose('updated', name),
+        excludeDependents,
+    });
+}
+exports.collectUpdates = collectUpdates;
 //# sourceMappingURL=collect-updates.js.map

package/dist/utils/collect-updates/collect-updates.js.map

@@ -1 +1 @@
-{"version":3,"file":"collect-updates.js","sourceRoot":"","sources":["../../../src/utils/collect-updates/collect-updates.ts"],"names":[],"mappings":";;;;;;AAAA,oDAAyB;AAKzB,kDAAkD;AAClD,6DAAyD;AACzD,2EAAqE;AACrE,6CAAyC;AACzC,mEAA8D;AAE9D;;;;;;GAMG;AACH,SAAgB,cAAc,CAC5B,gBAA2B,EAC3B,YAA0B,EAC1B,QAAkB,EAClB,cAAsC,EACtC,MAAM,GAAG,KAAK;IAEd,MAAM,EAAE,YAAY,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,iBAAiB,EAAE,aAAa,EAAE,GAAG,cAAc,CAAC;IAErH,6FAA6F;IAC7F,MAAM,uBAAuB,GAAG,mBAAmB,IAAI,oBAAoB,CAAC;IAC5E,MAAM,MAAM,GAAG,IAAA,8CAAoB,EACjC,uBAAuB,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAE,YAAmC,CACtF,CAAC;IAEF,MAAM,QAAQ,GACZ,gBAAgB,CAAC,MAAM,KAAK,YAAY,CAAC,IAAI;QAC3C,CAAC,CAAC,YAAY;QACd,CAAC,CAAC,IAAI,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAElF,IAAI,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC;IACtC,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IAE9C,IAAI,IAAA,kBAAO,EAAC,QAAQ,EAAE,UAAU,CAAC,EAAE;QACjC,MAAM,eAAe,GAAuB;YAC1C,GAAG,QAAQ;SACZ,CAAC;QAEF,IAAI,aAAa,EAAE;YACjB,eAAe,CAAC,KAAK,GAAG,UAAU,CAAC;SACpC;QAED,wDAAwD;QACxD,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,IAAA,8BAAe,EAAC,eAAe,EAAE,cAAc,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;QAClH,+BAA+B;QAE/B,IAAI,QAAQ,KAAK,GAAG,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE;YACxD,oCAAoC;YACpC,gBAAG,CAAC,MAAM,CAAC,EAAE,EAAE,8DAA8D,CAAC,CAAC;YAE/E,OAAO,EAAE,CAAC;SACX;QAED,IAAI,cAAc,CAAC,MAAM,EAAE;YACzB,qFAAqF;YACrF,+FAA+F;YAC/F,UAAU,GAAG,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC;SAChC;aAAM,IAAI,CAAC,UAAU,EAAE;YACtB,4EAA4E;YAC5E,UAAU,GAAG,WAAW,CAAC;SAC1B;KACF;IAED,IAAI,MAAM,CAAC,IAAI,EAAE;QACf,oFAAoF;QACpF,gBAAG,CAAC,IAAI,CACN,uBAAuB,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,eAAe,EACnE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAC1E,CAAC;KACH;IAED,IAAI,uBAAuB,EAAE;QAC3B,iDAAiD;QACjD,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACnB,gBAAG,CAAC,IAAI,CAAC,EAAE,EAAE,qCAAqC,CAAC,CAAC;SACrD;aAAM;YACL,gBAAG,CAAC,IAAI,CAAC,EAAE,EAAE,iCAAiC,CAAC,CAAC;SACjD;KACF;SAAM,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;QACzC,4BAA4B;QAC5B,gBAAG,CAAC,IAAI,CAAC,EAAE,EAAE,+BAA+B,CAAC,CAAC;QAE9C,OAAO,IAAA,kCAAe,EAAC,QAAQ,EAAE;YAC/B,SAAS,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,gBAAG,CAAC,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC;YACjD,iBAAiB;SAClB,CAAC,CAAC;KACJ;IAED,gBAAG,CAAC,IAAI,CAAC,EAAE,EAAE,sCAAsC,UAAU,EAAE,CAAC,CAAC;IAEjE,MAAM,OAAO,GAAG,IAAA,uCAAiB,EAAC,UAAoB,EAAE,QAAQ,EAAE,cAAc,CAAC,aAAyB,CAAC,CAAC;IAC5G,MAAM,SAAS,GACb,CAAC,cAAc,CAAC,IAAI,IAAI,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;QAC3D,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK;QACb,CAAC,CAAC,6DAA6D;YAC7D,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC;IAClC,MAAM,QAAQ,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAC9B,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAEhG,OAAO,IAAA,kCAAe,EAAC,QAAQ,EAAE;QAC/B,WAAW,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC;QACrF,SAAS,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,gBAAG,CAAC,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC;QACjD,iBAAiB;KAClB,CAAC,CAAC;AACL,CAAC;AA9FD,wCA8FC"}
+{"version":3,"file":"collect-updates.js","sourceRoot":"","sources":["../../../src/utils/collect-updates/collect-updates.ts"],"names":[],"mappings":";;;;AAAA,4DAAyB;AAKzB,kDAAkD;AAClD,6DAAyD;AACzD,2EAAqE;AACrE,6CAAyC;AACzC,mEAA8D;AAE9D;;;;;;GAMG;AACH,SAAgB,cAAc,CAC5B,gBAA2B,EAC3B,YAA0B,EAC1B,QAAkB,EAClB,cAAsC,EACtC,MAAM,GAAG,KAAK;IAEd,MAAM,EACJ,YAAY,EACZ,mBAAmB,EACnB,oBAAoB,EACpB,iBAAiB,EACjB,sBAAsB,EACtB,aAAa,GACd,GAAG,cAAc,CAAC;IAEnB,6FAA6F;IAC7F,MAAM,uBAAuB,GAAG,mBAAmB,IAAI,oBAAoB,CAAC;IAC5E,MAAM,MAAM,GAAG,IAAA,8CAAoB,EACjC,uBAAuB,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAE,YAAmC,CACtF,CAAC;IAEF,MAAM,QAAQ,GACZ,gBAAgB,CAAC,MAAM,KAAK,YAAY,CAAC,IAAI;QAC3C,CAAC,CAAC,YAAY;QACd,CAAC,CAAC,IAAI,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAElF,IAAI,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC;IACtC,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IAE9C,IAAI,IAAA,kBAAO,EAAC,QAAQ,EAAE,UAAU,CAAC,EAAE;QACjC,MAAM,eAAe,GAAuB;YAC1C,GAAG,QAAQ;SACZ,CAAC;QAEF,IAAI,aAAa,EAAE;YACjB,eAAe,CAAC,KAAK,GAAG,UAAU,CAAC;SACpC;QAED,wDAAwD;QACxD,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,IAAA,8BAAe,EAAC,eAAe,EAAE,cAAc,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;QAClH,+BAA+B;QAE/B,IAAI,QAAQ,KAAK,GAAG,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE;YACxD,oCAAoC;YACpC,gBAAG,CAAC,MAAM,CAAC,EAAE,EAAE,8DAA8D,CAAC,CAAC;YAE/E,OAAO,EAAE,CAAC;SACX;QAED,IAAI,cAAc,CAAC,MAAM,EAAE;YACzB,qFAAqF;YACrF,+FAA+F;YAC/F,UAAU,GAAG,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC;SAChC;aAAM,IAAI,CAAC,UAAU,EAAE;YACtB,4EAA4E;YAC5E,UAAU,GAAG,WAAW,CAAC;SAC1B;KACF;IAED,IAAI,MAAM,CAAC,IAAI,EAAE;QACf,oFAAoF;QACpF,gBAAG,CAAC,IAAI,CACN,uBAAuB,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,eAAe,EACnE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAC1E,CAAC;KACH;IAED,IAAI,uBAAuB,EAAE;QAC3B,iDAAiD;QACjD,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACnB,gBAAG,CAAC,IAAI,CAAC,EAAE,EAAE,qCAAqC,CAAC,CAAC;SACrD;aAAM;YACL,gBAAG,CAAC,IAAI,CAAC,EAAE,EAAE,iCAAiC,CAAC,CAAC;SACjD;KACF;SAAM,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;QACzC,4BAA4B;QAC5B,gBAAG,CAAC,IAAI,CAAC,EAAE,EAAE,+BAA+B,CAAC,CAAC;QAE9C,OAAO,IAAA,kCAAe,EAAC,QAAQ,EAAE;YAC/B,SAAS,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,gBAAG,CAAC,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC;YACjD,iBAAiB;SAClB,CAAC,CAAC;KACJ;IAED,gBAAG,CAAC,IAAI,CAAC,EAAE,EAAE,sCAAsC,UAAU,EAAE,CAAC,CAAC;IAEjE,MAAM,OAAO,GAAG,IAAA,uCAAiB,EAAC,UAAoB,EAAE,QAAQ,EAAE,cAAc,CAAC,aAAyB,EAAE;QAC1G,sBAAsB;KACvB,CAAC,CAAC;IACH,MAAM,SAAS,GACb,CAAC,cAAc,CAAC,IAAI,IAAI,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;QAC3D,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK;QACb,CAAC,CAAC,6DAA6D;YAC7D,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC;IAClC,MAAM,QAAQ,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAC9B,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAEhG,OAAO,IAAA,kCAAe,EAAC,QAAQ,EAAE;QAC/B,WAAW,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC;QACrF,SAAS,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,gBAAG,CAAC,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC;QACjD,iBAAiB;KAClB,CAAC,CAAC;AACL,CAAC;AAvGD,wCAuGC"}

package/dist/utils/collect-updates/index.d.ts

@@ -1,2 +1,2 @@
-export * from './collect-updates';
-export * from './lib';
+export * from './collect-updates';
+export * from './lib';

package/dist/utils/collect-updates/index.js

@@ -1,19 +1,6 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (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("./collect-updates"), exports);
-__exportStar(require("./lib"), exports);
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+tslib_1.__exportStar(require("./collect-updates"), exports);
+tslib_1.__exportStar(require("./lib"), exports);
 //# sourceMappingURL=index.js.map

package/dist/utils/collect-updates/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/utils/collect-updates/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,oDAAkC;AAClC,wCAAsB"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/utils/collect-updates/index.ts"],"names":[],"mappings":";;;AAAA,4DAAkC;AAClC,gDAAsB"}

package/dist/utils/collect-updates/lib/collect-dependents.d.ts

@@ -1,11 +1,11 @@
-/**
- * @callback LocalDependentVisitor
- * @param {import("@lerna/package-graph").PackageGraphNode} dependentNode
- * @param {string} dependentName
- * @param {Map<string, import("@lerna/package-graph").PackageGraphNode>} siblingDependents
- */
-/**
- * Build a set of nodes that are dependents of the input set.
- * @param {Set<import("@lerna/package-graph").PackageGraphNode>} nodes
- */
-export declare function collectDependents(nodes: any): Set<unknown>;
+/**
+ * @callback LocalDependentVisitor
+ * @param {import("@lerna/package-graph").PackageGraphNode} dependentNode
+ * @param {string} dependentName
+ * @param {Map<string, import("@lerna/package-graph").PackageGraphNode>} siblingDependents
+ */
+/**
+ * Build a set of nodes that are dependents of the input set.
+ * @param {Set<import("@lerna/package-graph").PackageGraphNode>} nodes
+ */
+export declare function collectDependents(nodes: any): Set<unknown>;

package/dist/utils/collect-updates/lib/collect-dependents.js

@@ -1,46 +1,46 @@
-"use strict";
-/**
- * @callback LocalDependentVisitor
- * @param {import("@lerna/package-graph").PackageGraphNode} dependentNode
- * @param {string} dependentName
- * @param {Map<string, import("@lerna/package-graph").PackageGraphNode>} siblingDependents
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.collectDependents = void 0;
-/**
- * Build a set of nodes that are dependents of the input set.
- * @param {Set<import("@lerna/package-graph").PackageGraphNode>} nodes
- */
-function collectDependents(nodes) {
-    /** @type {typeof nodes} */
-    const collected = new Set();
-    nodes.forEach((currentNode) => {
-        if (currentNode.localDependents.size === 0) {
-            // no point diving into a non-existent tree
-            return;
-        }
-        // breadth-first search
-        const queue = [currentNode];
-        const seen = new Set();
-        /** @type {LocalDependentVisitor} */
-        const visit = (dependentNode, dependentName, siblingDependents) => {
-            if (seen.has(dependentNode)) {
-                return;
-            }
-            seen.add(dependentNode);
-            if (dependentNode === currentNode || siblingDependents.has(currentNode.name)) {
-                // a direct or transitive cycle, skip it
-                return;
-            }
-            collected.add(dependentNode);
-            queue.push(dependentNode);
-        };
-        while (queue.length) {
-            const node = queue.shift();
-            node.localDependents.forEach(visit);
-        }
-    });
-    return collected;
-}
-exports.collectDependents = collectDependents;
+"use strict";
+/**
+ * @callback LocalDependentVisitor
+ * @param {import("@lerna/package-graph").PackageGraphNode} dependentNode
+ * @param {string} dependentName
+ * @param {Map<string, import("@lerna/package-graph").PackageGraphNode>} siblingDependents
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.collectDependents = void 0;
+/**
+ * Build a set of nodes that are dependents of the input set.
+ * @param {Set<import("@lerna/package-graph").PackageGraphNode>} nodes
+ */
+function collectDependents(nodes) {
+    /** @type {typeof nodes} */
+    const collected = new Set();
+    nodes.forEach((currentNode) => {
+        if (currentNode.localDependents.size === 0) {
+            // no point diving into a non-existent tree
+            return;
+        }
+        // breadth-first search
+        const queue = [currentNode];
+        const seen = new Set();
+        /** @type {LocalDependentVisitor} */
+        const visit = (dependentNode, dependentName, siblingDependents) => {
+            if (seen.has(dependentNode)) {
+                return;
+            }
+            seen.add(dependentNode);
+            if (dependentNode === currentNode || siblingDependents.has(currentNode.name)) {
+                // a direct or transitive cycle, skip it
+                return;
+            }
+            collected.add(dependentNode);
+            queue.push(dependentNode);
+        };
+        while (queue.length) {
+            const node = queue.shift();
+            node.localDependents.forEach(visit);
+        }
+    });
+    return collected;
+}
+exports.collectDependents = collectDependents;
 //# sourceMappingURL=collect-dependents.js.map

package/dist/utils/collect-updates/lib/collect-packages.d.ts

@@ -1,13 +1,13 @@
-import { PackageGraphNode } from '../../../package-graph/lib/package-graph-node';
-interface PackageCollectorOptions {
-    isCandidate?: (node: PackageGraphNode, name: string) => boolean;
-    onInclude?: (name: string) => void;
-    excludeDependents?: boolean;
-}
-/**
- * Build a list of graph nodes, possibly including dependents, using predicate if available.
- * @param {Map<string, import("@lerna/package-graph").PackageGraphNode>} packages
- * @param {PackageCollectorOptions} options
- */
-export declare function collectPackages(packages: any, { isCandidate, onInclude, excludeDependents }?: PackageCollectorOptions): PackageGraphNode[];
-export {};
+import { PackageGraphNode } from '../../../package-graph/lib/package-graph-node';
+interface PackageCollectorOptions {
+    isCandidate?: (node: PackageGraphNode, name: string) => boolean;
+    onInclude?: (name: string) => void;
+    excludeDependents?: boolean;
+}
+/**
+ * Build a list of graph nodes, possibly including dependents, using predicate if available.
+ * @param {Map<string, import("@lerna/package-graph").PackageGraphNode>} packages
+ * @param {PackageCollectorOptions} options
+ */
+export declare function collectPackages(packages: any, { isCandidate, onInclude, excludeDependents }?: PackageCollectorOptions): PackageGraphNode[];
+export {};

package/dist/utils/collect-updates/lib/collect-packages.js

@@ -1,34 +1,34 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.collectPackages = void 0;
-const collect_dependents_1 = require("./collect-dependents");
-/**
- * Build a list of graph nodes, possibly including dependents, using predicate if available.
- * @param {Map<string, import("@lerna/package-graph").PackageGraphNode>} packages
- * @param {PackageCollectorOptions} options
- */
-function collectPackages(packages, { isCandidate = () => true, onInclude, excludeDependents } = {}) {
-    /** @type {Set<import("@lerna/package-graph").PackageGraphNode>} */
-    const candidates = new Set();
-    packages.forEach((node, name) => {
-        if (isCandidate(node, name)) {
-            candidates.add(node);
-        }
-    });
-    if (!excludeDependents) {
-        (0, collect_dependents_1.collectDependents)(candidates).forEach((node) => candidates.add(node));
-    }
-    // The result should always be in the same order as the input
-    const updates = [];
-    packages.forEach((node, name) => {
-        if (candidates.has(node)) {
-            if (onInclude) {
-                onInclude(name);
-            }
-            updates.push(node);
-        }
-    });
-    return updates;
-}
-exports.collectPackages = collectPackages;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.collectPackages = void 0;
+const collect_dependents_1 = require("./collect-dependents");
+/**
+ * Build a list of graph nodes, possibly including dependents, using predicate if available.
+ * @param {Map<string, import("@lerna/package-graph").PackageGraphNode>} packages
+ * @param {PackageCollectorOptions} options
+ */
+function collectPackages(packages, { isCandidate = () => true, onInclude, excludeDependents } = {}) {
+    /** @type {Set<import("@lerna/package-graph").PackageGraphNode>} */
+    const candidates = new Set();
+    packages.forEach((node, name) => {
+        if (isCandidate(node, name)) {
+            candidates.add(node);
+        }
+    });
+    if (!excludeDependents) {
+        (0, collect_dependents_1.collectDependents)(candidates).forEach((node) => candidates.add(node));
+    }
+    // The result should always be in the same order as the input
+    const updates = [];
+    packages.forEach((node, name) => {
+        if (candidates.has(node)) {
+            if (onInclude) {
+                onInclude(name);
+            }
+            updates.push(node);
+        }
+    });
+    return updates;
+}
+exports.collectPackages = collectPackages;
 //# sourceMappingURL=collect-packages.js.map

package/dist/utils/collect-updates/lib/get-packages-for-option.d.ts

@@ -1,5 +1,5 @@
-/**
- * @param {boolean|string|string[]} option
- * @returns {Set<string>} A set of package names (or wildcard) derived from option value.
- */
-export declare function getPackagesForOption(option?: boolean | string | string[]): Set<string>;
+/**
+ * @param {boolean|string|string[]} option
+ * @returns {Set<string>} A set of package names (or wildcard) derived from option value.
+ */
+export declare function getPackagesForOption(option?: boolean | string | string[]): Set<string>;

package/dist/utils/collect-updates/lib/get-packages-for-option.js

@@ -1,31 +1,31 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getPackagesForOption = void 0;
-/**
- * @param {boolean|string|string[]} option
- * @returns {Set<string>} A set of package names (or wildcard) derived from option value.
- */
-function getPackagesForOption(option) {
-    // new Set(null) is equivalent to new Set([])
-    // i.e., an empty Set
-    let inputs = null;
-    if (option === true) {
-        // option passed without specific packages, eg. --force-publish
-        inputs = ['*'];
-    }
-    else if (typeof option === 'string') {
-        // option passed with one or more comma separated package names, eg.:
-        // --force-publish=*
-        // --force-publish=foo
-        // --force-publish=foo,bar
-        inputs = option.split(',');
-    }
-    else if (Array.isArray(option)) {
-        // option passed multiple times with individual package names
-        // --force-publish foo --force-publish baz
-        inputs = [...option];
-    }
-    return new Set(inputs);
-}
-exports.getPackagesForOption = getPackagesForOption;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getPackagesForOption = void 0;
+/**
+ * @param {boolean|string|string[]} option
+ * @returns {Set<string>} A set of package names (or wildcard) derived from option value.
+ */
+function getPackagesForOption(option) {
+    // new Set(null) is equivalent to new Set([])
+    // i.e., an empty Set
+    let inputs = null;
+    if (option === true) {
+        // option passed without specific packages, eg. --force-publish
+        inputs = ['*'];
+    }
+    else if (typeof option === 'string') {
+        // option passed with one or more comma separated package names, eg.:
+        // --force-publish=*
+        // --force-publish=foo
+        // --force-publish=foo,bar
+        inputs = option.split(',');
+    }
+    else if (Array.isArray(option)) {
+        // option passed multiple times with individual package names
+        // --force-publish foo --force-publish baz
+        inputs = [...option];
+    }
+    return new Set(inputs);
+}
+exports.getPackagesForOption = getPackagesForOption;
 //# sourceMappingURL=get-packages-for-option.js.map

package/dist/utils/collect-updates/lib/has-tags.d.ts

@@ -1,7 +1,7 @@
-import { ExecOpts } from '../../../models';
-/**
- * Determine if any git tags are reachable.
- * @param {import("@lerna/child-process").ExecOpts} opts
- * @param {string} tagPattern
- */
-export declare function hasTags(opts?: ExecOpts, tagPattern?: string): boolean;
+import { ExecOpts } from '../../../models';
+/**
+ * Determine if any git tags are reachable.
+ * @param {import("@lerna/child-process").ExecOpts} opts
+ * @param {string} tagPattern
+ */
+export declare function hasTags(opts?: ExecOpts, tagPattern?: string): boolean;

package/dist/utils/collect-updates/lib/has-tags.js

@@ -1,33 +1,31 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.hasTags = void 0;
-const npmlog_1 = __importDefault(require("npmlog"));
-const child_process_1 = require("../../../child-process");
-/**
- * Determine if any git tags are reachable.
- * @param {import("@lerna/child-process").ExecOpts} opts
- * @param {string} tagPattern
- */
-function hasTags(opts, tagPattern) {
-    npmlog_1.default.silly('hasTags', '');
-    let result = false;
-    const args = ['tag'];
-    if (tagPattern) {
-        npmlog_1.default.verbose('hasTags', `filter for tags with '${tagPattern}' pattern`);
-        args.push('--list', tagPattern);
-    }
-    try {
-        result = !!(0, child_process_1.execSync)('git', args, opts);
-    }
-    catch (err) {
-        npmlog_1.default.warn('ENOTAGS', 'No git tags were reachable from this branch!');
-        npmlog_1.default.verbose('hasTags error', err);
-    }
-    npmlog_1.default.verbose('hasTags', result.toString());
-    return result;
-}
-exports.hasTags = hasTags;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.hasTags = void 0;
+const tslib_1 = require("tslib");
+const npmlog_1 = tslib_1.__importDefault(require("npmlog"));
+const child_process_1 = require("../../../child-process");
+/**
+ * Determine if any git tags are reachable.
+ * @param {import("@lerna/child-process").ExecOpts} opts
+ * @param {string} tagPattern
+ */
+function hasTags(opts, tagPattern) {
+    npmlog_1.default.silly('hasTags', '');
+    let result = false;
+    const args = ['tag'];
+    if (tagPattern) {
+        npmlog_1.default.verbose('hasTags', `filter for tags with '${tagPattern}' pattern`);
+        args.push('--list', tagPattern);
+    }
+    try {
+        result = !!(0, child_process_1.execSync)('git', args, opts);
+    }
+    catch (err) {
+        npmlog_1.default.warn('ENOTAGS', 'No git tags were reachable from this branch!');
+        npmlog_1.default.verbose('hasTags error', err);
+    }
+    npmlog_1.default.verbose('hasTags', result.toString());
+    return result;
+}
+exports.hasTags = hasTags;
 //# sourceMappingURL=has-tags.js.map

package/dist/utils/collect-updates/lib/has-tags.js.map

@@ -1 +1 @@
-{"version":3,"file":"has-tags.js","sourceRoot":"","sources":["../../../../src/utils/collect-updates/lib/has-tags.ts"],"names":[],"mappings":";;;;;;AAAA,oDAAyB;AAEzB,0DAAkD;AAGlD;;;;GAIG;AACH,SAAgB,OAAO,CAAC,IAAe,EAAE,UAAmB;IAC1D,gBAAG,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IACzB,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAErB,IAAI,UAAU,EAAE;QACd,gBAAG,CAAC,OAAO,CAAC,SAAS,EAAE,yBAAyB,UAAU,WAAW,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;KACjC;IAED,IAAI;QACF,MAAM,GAAG,CAAC,CAAC,IAAA,wBAAQ,EAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;KACxC;IAAC,OAAO,GAAQ,EAAE;QACjB,gBAAG,CAAC,IAAI,CAAC,SAAS,EAAE,8CAA8C,CAAC,CAAC;QACpE,gBAAG,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;KACnC;IAED,gBAAG,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;IAE1C,OAAO,MAAM,CAAC;AAChB,CAAC;AApBD,0BAoBC"}
+{"version":3,"file":"has-tags.js","sourceRoot":"","sources":["../../../../src/utils/collect-updates/lib/has-tags.ts"],"names":[],"mappings":";;;;AAAA,4DAAyB;AAEzB,0DAAkD;AAGlD;;;;GAIG;AACH,SAAgB,OAAO,CAAC,IAAe,EAAE,UAAmB;IAC1D,gBAAG,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IACzB,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAErB,IAAI,UAAU,EAAE;QACd,gBAAG,CAAC,OAAO,CAAC,SAAS,EAAE,yBAAyB,UAAU,WAAW,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;KACjC;IAED,IAAI;QACF,MAAM,GAAG,CAAC,CAAC,IAAA,wBAAQ,EAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;KACxC;IAAC,OAAO,GAAQ,EAAE;QACjB,gBAAG,CAAC,IAAI,CAAC,SAAS,EAAE,8CAA8C,CAAC,CAAC;QACpE,gBAAG,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;KACnC;IAED,gBAAG,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;IAE1C,OAAO,MAAM,CAAC;AAChB,CAAC;AApBD,0BAoBC"}