@askrjs/cli 0.0.2 → 0.0.3

package/dist/planner-VAj7qlxr.js

@@ -0,0 +1,287 @@
+import { n as isBreakingChange, r as rewriteRange, t as analyzeRange } from "./range-YUs9eimn.js";
+import { t as parseDependencySpecification } from "./specification-DXnDOC-0.js";
+import semver from "semver";
+//#region src/update/planner.ts
+const STATUS_PRIORITY = {
+	current: 0,
+	local: 1,
+	safe: 2,
+	breaking: 3,
+	manual: 4,
+	error: 5
+};
+function publishedVersions(packument) {
+	return Object.keys(packument.versions ?? {}).filter((version) => semver.valid(version) !== null).sort(semver.compare);
+}
+function selectedTarget(packument, tag) {
+	const value = packument["dist-tags"]?.[tag];
+	return typeof value === "string" && semver.valid(value) ? value : null;
+}
+function plannedOccurrence(occurrence, packument, failure, selectedTag, force) {
+	const base = {
+		workspace: occurrence.workspace,
+		manifestPath: occurrence.manifestPath,
+		relativeManifestPath: occurrence.relativeManifestPath,
+		section: occurrence.section,
+		currentSpecification: occurrence.currentSpecification,
+		proposedSpecification: null,
+		allowedVersion: null
+	};
+	if (occurrence.kind === "local") return {
+		targetVersion: null,
+		occurrence: {
+			...base,
+			status: "local",
+			reason: occurrence.reason
+		}
+	};
+	if (occurrence.kind === "manual") return {
+		targetVersion: null,
+		occurrence: {
+			...base,
+			status: "manual",
+			reason: occurrence.reason
+		}
+	};
+	if (failure) return {
+		targetVersion: null,
+		occurrence: {
+			...base,
+			status: "error",
+			reason: failure
+		}
+	};
+	if (occurrence.kind === "current") return {
+		targetVersion: packument ? selectedTarget(packument, selectedTag) : null,
+		occurrence: {
+			...base,
+			status: "current",
+			reason: occurrence.reason
+		}
+	};
+	if (!packument) return {
+		targetVersion: null,
+		occurrence: {
+			...base,
+			status: "error",
+			reason: "package metadata is unavailable"
+		}
+	};
+	const targetVersion = selectedTarget(packument, selectedTag);
+	if (!targetVersion) return {
+		targetVersion: null,
+		occurrence: {
+			...base,
+			status: "error",
+			reason: `dist-tag '${selectedTag}' is not published`
+		}
+	};
+	const versions = publishedVersions(packument);
+	if (!versions.includes(targetVersion)) return {
+		targetVersion: null,
+		occurrence: {
+			...base,
+			status: "error",
+			reason: `dist-tag '${selectedTag}' does not identify a published version`
+		}
+	};
+	const allowedVersion = semver.maxSatisfying(versions, occurrence.currentSpecification);
+	if (!allowedVersion) return {
+		targetVersion,
+		occurrence: {
+			...base,
+			status: "manual",
+			reason: "no published version satisfies the current specification"
+		}
+	};
+	if (semver.satisfies(targetVersion, occurrence.currentSpecification) || !semver.gt(targetVersion, allowedVersion)) return {
+		targetVersion,
+		occurrence: {
+			...base,
+			allowedVersion,
+			status: "current",
+			reason: "selected target is already covered by the current specification"
+		}
+	};
+	const analysis = analyzeRange(occurrence.currentSpecification);
+	if (!analysis.shape) return {
+		targetVersion,
+		occurrence: {
+			...base,
+			allowedVersion,
+			status: "manual",
+			reason: analysis.reason
+		}
+	};
+	const breaking = isBreakingChange(allowedVersion, targetVersion);
+	const eligible = !breaking || force;
+	return {
+		targetVersion,
+		occurrence: {
+			...base,
+			allowedVersion,
+			proposedSpecification: eligible ? rewriteRange(analysis.shape, targetVersion, breaking) : null,
+			status: breaking ? "breaking" : "safe",
+			reason: breaking ? eligible ? "latest version is eligible for askr upgrade" : "breaking update is available via askr upgrade" : "compatible update is available"
+		}
+	};
+}
+function occurrenceKey(occurrence, packageName) {
+	return [
+		occurrence.manifestPath,
+		occurrence.section,
+		packageName ?? occurrence.package,
+		occurrence.currentSpecification
+	].join("\0");
+}
+function resolveSpecificationVersion(specification, packument) {
+	const versions = publishedVersions(packument);
+	const parsed = parseDependencySpecification(specification);
+	if (parsed.type === "tag") {
+		const tagged = packument["dist-tags"]?.[parsed.rawSpec];
+		return typeof tagged === "string" && semver.valid(tagged) ? tagged : null;
+	}
+	if (parsed.type === "version") return semver.valid(parsed.rawSpec);
+	if (parsed.type === "range") return semver.maxSatisfying(versions, parsed.rawSpec);
+	return null;
+}
+function versionMetadata(packument, version) {
+	const metadata = packument.versions?.[version];
+	return metadata && typeof metadata === "object" && !Array.isArray(metadata) ? metadata : null;
+}
+function applyPeerCompatibilityGuard(decisions, contextOccurrences, packuments) {
+	const plannedByKey = /* @__PURE__ */ new Map();
+	for (const decision of decisions) for (const occurrence of decision.occurrences) plannedByKey.set(occurrenceKey(occurrence, decision.package), occurrence);
+	const contextByWorkspace = /* @__PURE__ */ new Map();
+	for (const occurrence of contextOccurrences) {
+		const entries = contextByWorkspace.get(occurrence.workspace) ?? [];
+		entries.push(occurrence);
+		contextByWorkspace.set(occurrence.workspace, entries);
+	}
+	for (const [workspace, context] of contextByWorkspace) {
+		const states = context.flatMap((dependency) => {
+			if (!dependency.registryManaged) return [];
+			const packument = packuments.get(dependency.package);
+			if (!packument) return [];
+			const planned = plannedByKey.get(occurrenceKey(dependency));
+			const currentVersion = resolveSpecificationVersion(dependency.currentSpecification, packument);
+			const futureVersion = resolveSpecificationVersion(planned?.proposedSpecification ?? dependency.currentSpecification, packument);
+			return currentVersion && futureVersion ? [{
+				dependency,
+				packument,
+				planned,
+				currentVersion,
+				futureVersion,
+				changed: Boolean(planned?.proposedSpecification)
+			}] : [];
+		});
+		const blockers = /* @__PURE__ */ new Map();
+		for (const provider of states) {
+			const currentPeers = versionMetadata(provider.packument, provider.currentVersion)?.peerDependencies ?? {};
+			const futurePeers = versionMetadata(provider.packument, provider.futureVersion)?.peerDependencies ?? {};
+			const peerNames = /* @__PURE__ */ new Set([...Object.keys(currentPeers), ...Object.keys(futurePeers)]);
+			for (const peerName of peerNames) {
+				const currentRequirement = currentPeers[peerName];
+				const futureRequirement = futurePeers[peerName];
+				if (futureRequirement !== void 0 && typeof futureRequirement !== "string") continue;
+				for (const peer of states.filter((state) => state.dependency.package === peerName)) {
+					const currentAccepted = typeof currentRequirement !== "string" || semver.satisfies(peer.currentVersion, currentRequirement);
+					const futureAccepted = typeof futureRequirement !== "string" || semver.satisfies(peer.futureVersion, futureRequirement);
+					if (!currentAccepted || futureAccepted) continue;
+					const reason = `${provider.dependency.package}@${provider.futureVersion} requires ${peerName}@${futureRequirement}`;
+					if (provider.changed && provider.planned) blockers.set(provider.planned, reason);
+					if (peer.changed && peer.planned) blockers.set(peer.planned, reason);
+				}
+			}
+		}
+		for (const [planned, reason] of blockers) {
+			planned.status = "manual";
+			planned.proposedSpecification = null;
+			planned.reason = reason;
+		}
+	}
+}
+function aggregateStatus(occurrences) {
+	return occurrences.reduce((status, occurrence) => STATUS_PRIORITY[occurrence.status] > STATUS_PRIORITY[status] ? occurrence.status : status, "current");
+}
+function summarize(decisions) {
+	const summary = {
+		packages: decisions.length,
+		occurrences: 0,
+		changedOccurrences: 0,
+		current: 0,
+		safe: 0,
+		breaking: 0,
+		local: 0,
+		manual: 0,
+		error: 0
+	};
+	for (const decision of decisions) {
+		decision.status = aggregateStatus(decision.occurrences);
+		decision.reason = decision.occurrences.find((entry) => entry.status === decision.status)?.reason ?? "";
+		summary[decision.status] += 1;
+		summary.occurrences += decision.occurrences.length;
+		summary.changedOccurrences += decision.occurrences.filter((entry) => entry.proposedSpecification).length;
+	}
+	return summary;
+}
+function planUpdates(options) {
+	const failures = options.failures ?? /* @__PURE__ */ new Map();
+	const tags = options.tags ?? {};
+	const grouped = /* @__PURE__ */ new Map();
+	for (const occurrence of options.occurrences) {
+		const entries = grouped.get(occurrence.package) ?? [];
+		entries.push(occurrence);
+		grouped.set(occurrence.package, entries);
+	}
+	const decisions = [...grouped.entries()].sort(([left], [right]) => left.localeCompare(right)).map(([packageName, occurrences]) => {
+		const selectedTag = options.cliTag ?? tags[packageName] ?? "latest";
+		const planned = occurrences.map((occurrence) => plannedOccurrence(occurrence, options.packuments.get(packageName), failures.get(packageName), selectedTag, options.force ?? false));
+		const targetVersion = planned.find((entry) => entry.targetVersion)?.targetVersion ?? null;
+		const plannedOccurrences = planned.map((entry) => entry.occurrence);
+		const status = aggregateStatus(plannedOccurrences);
+		return {
+			package: packageName,
+			selectedTag,
+			targetVersion,
+			status,
+			reason: plannedOccurrences.find((entry) => entry.status === status)?.reason ?? "",
+			occurrences: plannedOccurrences
+		};
+	});
+	const selectedNames = new Set(grouped.keys());
+	for (const [packageName, failure] of [...failures].sort(([left], [right]) => left.localeCompare(right))) {
+		if (selectedNames.has(packageName)) continue;
+		const context = (options.contextOccurrences ?? []).filter((occurrence) => occurrence.package === packageName).map((occurrence) => ({
+			workspace: occurrence.workspace,
+			manifestPath: occurrence.manifestPath,
+			relativeManifestPath: occurrence.relativeManifestPath,
+			section: occurrence.section,
+			currentSpecification: occurrence.currentSpecification,
+			proposedSpecification: null,
+			allowedVersion: null,
+			status: "error",
+			reason: `peer compatibility lookup failed: ${failure}`
+		}));
+		decisions.push({
+			package: packageName,
+			selectedTag: options.cliTag ?? tags[packageName] ?? "latest",
+			targetVersion: null,
+			status: "error",
+			reason: `peer compatibility lookup failed: ${failure}`,
+			occurrences: context
+		});
+	}
+	decisions.sort((left, right) => left.package.localeCompare(right.package));
+	applyPeerCompatibilityGuard(decisions, options.contextOccurrences ?? options.occurrences, options.packuments);
+	const summary = summarize(decisions);
+	return {
+		decisions,
+		summary,
+		hasErrors: summary.error > 0
+	};
+}
+//#endregion
+export { planUpdates };
+
+//# sourceMappingURL=planner-VAj7qlxr.js.map

package/dist/planner-VAj7qlxr.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner-VAj7qlxr.js","names":[],"sources":["../src/update/planner.ts"],"sourcesContent":["import semver from \"semver\";\nimport { analyzeRange, isBreakingChange, rewriteRange } from \"./range\";\nimport { parseDependencySpecification } from \"./specification\";\nimport type {\n  DependencyOccurrence,\n  PackageDecision,\n  Packument,\n  PlannedOccurrence,\n  UpdatePlan,\n  UpdateStatus,\n  UpdateSummary,\n} from \"./types\";\n\ninterface PlannerOptions {\n  occurrences: DependencyOccurrence[];\n  contextOccurrences?: DependencyOccurrence[];\n  packuments: Map<string, Packument>;\n  failures?: Map<string, string>;\n  tags?: Record<string, string>;\n  cliTag?: string;\n  force?: boolean;\n}\n\ninterface VersionMetadata extends Record<string, unknown> {\n  peerDependencies?: Record<string, unknown>;\n}\n\nconst STATUS_PRIORITY: Record<UpdateStatus, number> = {\n  current: 0,\n  local: 1,\n  safe: 2,\n  breaking: 3,\n  manual: 4,\n  error: 5,\n};\n\nfunction publishedVersions(packument: Packument): string[] {\n  return Object.keys(packument.versions ?? {})\n    .filter((version) => semver.valid(version) !== null)\n    .sort(semver.compare);\n}\n\nfunction selectedTarget(packument: Packument, tag: string): string | null {\n  const value = packument[\"dist-tags\"]?.[tag];\n  return typeof value === \"string\" && semver.valid(value) ? value : null;\n}\n\nfunction plannedOccurrence(\n  occurrence: DependencyOccurrence,\n  packument: Packument | undefined,\n  failure: string | undefined,\n  selectedTag: string,\n  force: boolean,\n): { occurrence: PlannedOccurrence; targetVersion: string | null } {\n  const base = {\n    workspace: occurrence.workspace,\n    manifestPath: occurrence.manifestPath,\n    relativeManifestPath: occurrence.relativeManifestPath,\n    section: occurrence.section,\n    currentSpecification: occurrence.currentSpecification,\n    proposedSpecification: null,\n    allowedVersion: null,\n  };\n\n  if (occurrence.kind === \"local\") {\n    return {\n      targetVersion: null,\n      occurrence: { ...base, status: \"local\", reason: occurrence.reason },\n    };\n  }\n  if (occurrence.kind === \"manual\") {\n    return {\n      targetVersion: null,\n      occurrence: { ...base, status: \"manual\", reason: occurrence.reason },\n    };\n  }\n  if (failure) {\n    return {\n      targetVersion: null,\n      occurrence: { ...base, status: \"error\", reason: failure },\n    };\n  }\n  if (occurrence.kind === \"current\") {\n    return {\n      targetVersion: packument ? selectedTarget(packument, selectedTag) : null,\n      occurrence: { ...base, status: \"current\", reason: occurrence.reason },\n    };\n  }\n  if (!packument) {\n    return {\n      targetVersion: null,\n      occurrence: { ...base, status: \"error\", reason: \"package metadata is unavailable\" },\n    };\n  }\n\n  const targetVersion = selectedTarget(packument, selectedTag);\n  if (!targetVersion) {\n    return {\n      targetVersion: null,\n      occurrence: {\n        ...base,\n        status: \"error\",\n        reason: `dist-tag '${selectedTag}' is not published`,\n      },\n    };\n  }\n\n  const versions = publishedVersions(packument);\n  if (!versions.includes(targetVersion)) {\n    return {\n      targetVersion: null,\n      occurrence: {\n        ...base,\n        status: \"error\",\n        reason: `dist-tag '${selectedTag}' does not identify a published version`,\n      },\n    };\n  }\n  const allowedVersion = semver.maxSatisfying(versions, occurrence.currentSpecification);\n  if (!allowedVersion) {\n    return {\n      targetVersion,\n      occurrence: {\n        ...base,\n        status: \"manual\",\n        reason: \"no published version satisfies the current specification\",\n      },\n    };\n  }\n  if (\n    semver.satisfies(targetVersion, occurrence.currentSpecification) ||\n    !semver.gt(targetVersion, allowedVersion)\n  ) {\n    return {\n      targetVersion,\n      occurrence: {\n        ...base,\n        allowedVersion,\n        status: \"current\",\n        reason: \"selected target is already covered by the current specification\",\n      },\n    };\n  }\n\n  const analysis = analyzeRange(occurrence.currentSpecification);\n  if (!analysis.shape) {\n    return {\n      targetVersion,\n      occurrence: { ...base, allowedVersion, status: \"manual\", reason: analysis.reason },\n    };\n  }\n\n  const breaking = isBreakingChange(allowedVersion, targetVersion);\n  const eligible = !breaking || force;\n  return {\n    targetVersion,\n    occurrence: {\n      ...base,\n      allowedVersion,\n      proposedSpecification: eligible\n        ? rewriteRange(analysis.shape, targetVersion, breaking)\n        : null,\n      status: breaking ? \"breaking\" : \"safe\",\n      reason: breaking\n        ? eligible\n          ? \"latest version is eligible for askr upgrade\"\n          : \"breaking update is available via askr upgrade\"\n        : \"compatible update is available\",\n    },\n  };\n}\n\nfunction occurrenceKey(\n  occurrence: {\n    manifestPath: string;\n    section: string;\n    currentSpecification: string;\n  } & ({ package: string } | { package?: never }),\n  packageName?: string,\n): string {\n  return [\n    occurrence.manifestPath,\n    occurrence.section,\n    packageName ?? occurrence.package,\n    occurrence.currentSpecification,\n  ].join(\"\\u0000\");\n}\n\nfunction resolveSpecificationVersion(specification: string, packument: Packument): string | null {\n  const versions = publishedVersions(packument);\n  const parsed = parseDependencySpecification(specification);\n  if (parsed.type === \"tag\") {\n    const tagged = packument[\"dist-tags\"]?.[parsed.rawSpec];\n    return typeof tagged === \"string\" && semver.valid(tagged) ? tagged : null;\n  }\n  if (parsed.type === \"version\") return semver.valid(parsed.rawSpec);\n  if (parsed.type === \"range\") return semver.maxSatisfying(versions, parsed.rawSpec);\n  return null;\n}\n\nfunction versionMetadata(packument: Packument, version: string): VersionMetadata | null {\n  const metadata = packument.versions?.[version];\n  return metadata && typeof metadata === \"object\" && !Array.isArray(metadata)\n    ? (metadata as VersionMetadata)\n    : null;\n}\n\nfunction applyPeerCompatibilityGuard(\n  decisions: PackageDecision[],\n  contextOccurrences: DependencyOccurrence[],\n  packuments: Map<string, Packument>,\n): void {\n  const plannedByKey = new Map<string, PlannedOccurrence>();\n  for (const decision of decisions) {\n    for (const occurrence of decision.occurrences) {\n      plannedByKey.set(occurrenceKey(occurrence, decision.package), occurrence);\n    }\n  }\n\n  const contextByWorkspace = new Map<string, DependencyOccurrence[]>();\n  for (const occurrence of contextOccurrences) {\n    const entries = contextByWorkspace.get(occurrence.workspace) ?? [];\n    entries.push(occurrence);\n    contextByWorkspace.set(occurrence.workspace, entries);\n  }\n\n  for (const [workspace, context] of contextByWorkspace) {\n    const states = context.flatMap((dependency) => {\n      if (!dependency.registryManaged) return [];\n      const packument = packuments.get(dependency.package);\n      if (!packument) return [];\n      const planned = plannedByKey.get(occurrenceKey(dependency));\n      const currentVersion = resolveSpecificationVersion(\n        dependency.currentSpecification,\n        packument,\n      );\n      const futureSpecification = planned?.proposedSpecification ?? dependency.currentSpecification;\n      const futureVersion = resolveSpecificationVersion(futureSpecification, packument);\n      return currentVersion && futureVersion\n        ? [\n            {\n              dependency,\n              packument,\n              planned,\n              currentVersion,\n              futureVersion,\n              changed: Boolean(planned?.proposedSpecification),\n            },\n          ]\n        : [];\n    });\n    const blockers = new Map<PlannedOccurrence, string>();\n\n    for (const provider of states) {\n      const currentPeers =\n        versionMetadata(provider.packument, provider.currentVersion)?.peerDependencies ?? {};\n      const futurePeers =\n        versionMetadata(provider.packument, provider.futureVersion)?.peerDependencies ?? {};\n      const peerNames = new Set([...Object.keys(currentPeers), ...Object.keys(futurePeers)]);\n      for (const peerName of peerNames) {\n        const currentRequirement = currentPeers[peerName];\n        const futureRequirement = futurePeers[peerName];\n        if (futureRequirement !== undefined && typeof futureRequirement !== \"string\") continue;\n\n        for (const peer of states.filter((state) => state.dependency.package === peerName)) {\n          const currentAccepted =\n            typeof currentRequirement !== \"string\" ||\n            semver.satisfies(peer.currentVersion, currentRequirement);\n          const futureAccepted =\n            typeof futureRequirement !== \"string\" ||\n            semver.satisfies(peer.futureVersion, futureRequirement);\n          if (!currentAccepted || futureAccepted) continue;\n\n          const reason = `${provider.dependency.package}@${provider.futureVersion} requires ${peerName}@${futureRequirement}`;\n          if (provider.changed && provider.planned) blockers.set(provider.planned, reason);\n          if (peer.changed && peer.planned) blockers.set(peer.planned, reason);\n        }\n      }\n    }\n\n    for (const [planned, reason] of blockers) {\n      planned.status = \"manual\";\n      planned.proposedSpecification = null;\n      planned.reason = reason;\n    }\n\n    void workspace;\n  }\n}\n\nfunction aggregateStatus(occurrences: PlannedOccurrence[]): UpdateStatus {\n  return occurrences.reduce<UpdateStatus>(\n    (status, occurrence) =>\n      STATUS_PRIORITY[occurrence.status] > STATUS_PRIORITY[status] ? occurrence.status : status,\n    \"current\",\n  );\n}\n\nfunction summarize(decisions: PackageDecision[]): UpdateSummary {\n  const summary: UpdateSummary = {\n    packages: decisions.length,\n    occurrences: 0,\n    changedOccurrences: 0,\n    current: 0,\n    safe: 0,\n    breaking: 0,\n    local: 0,\n    manual: 0,\n    error: 0,\n  };\n  for (const decision of decisions) {\n    decision.status = aggregateStatus(decision.occurrences);\n    decision.reason =\n      decision.occurrences.find((entry) => entry.status === decision.status)?.reason ?? \"\";\n    summary[decision.status] += 1;\n    summary.occurrences += decision.occurrences.length;\n    summary.changedOccurrences += decision.occurrences.filter(\n      (entry) => entry.proposedSpecification,\n    ).length;\n  }\n  return summary;\n}\n\nexport function planUpdates(options: PlannerOptions): UpdatePlan {\n  const failures = options.failures ?? new Map<string, string>();\n  const tags = options.tags ?? {};\n  const grouped = new Map<string, DependencyOccurrence[]>();\n  for (const occurrence of options.occurrences) {\n    const entries = grouped.get(occurrence.package) ?? [];\n    entries.push(occurrence);\n    grouped.set(occurrence.package, entries);\n  }\n\n  const decisions = [...grouped.entries()]\n    .sort(([left], [right]) => left.localeCompare(right))\n    .map(([packageName, occurrences]): PackageDecision => {\n      const selectedTag = options.cliTag ?? tags[packageName] ?? \"latest\";\n      const planned = occurrences.map((occurrence) =>\n        plannedOccurrence(\n          occurrence,\n          options.packuments.get(packageName),\n          failures.get(packageName),\n          selectedTag,\n          options.force ?? false,\n        ),\n      );\n      const targetVersion = planned.find((entry) => entry.targetVersion)?.targetVersion ?? null;\n      const plannedOccurrences = planned.map((entry) => entry.occurrence);\n      const status = aggregateStatus(plannedOccurrences);\n      return {\n        package: packageName,\n        selectedTag,\n        targetVersion,\n        status,\n        reason: plannedOccurrences.find((entry) => entry.status === status)?.reason ?? \"\",\n        occurrences: plannedOccurrences,\n      };\n    });\n\n  const selectedNames = new Set(grouped.keys());\n  for (const [packageName, failure] of [...failures].sort(([left], [right]) =>\n    left.localeCompare(right),\n  )) {\n    if (selectedNames.has(packageName)) continue;\n    const context = (options.contextOccurrences ?? [])\n      .filter((occurrence) => occurrence.package === packageName)\n      .map(\n        (occurrence): PlannedOccurrence => ({\n          workspace: occurrence.workspace,\n          manifestPath: occurrence.manifestPath,\n          relativeManifestPath: occurrence.relativeManifestPath,\n          section: occurrence.section,\n          currentSpecification: occurrence.currentSpecification,\n          proposedSpecification: null,\n          allowedVersion: null,\n          status: \"error\",\n          reason: `peer compatibility lookup failed: ${failure}`,\n        }),\n      );\n    decisions.push({\n      package: packageName,\n      selectedTag: options.cliTag ?? tags[packageName] ?? \"latest\",\n      targetVersion: null,\n      status: \"error\",\n      reason: `peer compatibility lookup failed: ${failure}`,\n      occurrences: context,\n    });\n  }\n  decisions.sort((left, right) => left.package.localeCompare(right.package));\n\n  applyPeerCompatibilityGuard(\n    decisions,\n    options.contextOccurrences ?? options.occurrences,\n    options.packuments,\n  );\n  const summary = summarize(decisions);\n  return { decisions, summary, hasErrors: summary.error > 0 };\n}\n"],"mappings":";;;;AA2BA,MAAM,kBAAgD;CACpD,SAAS;CACT,OAAO;CACP,MAAM;CACN,UAAU;CACV,QAAQ;CACR,OAAO;AACT;AAEA,SAAS,kBAAkB,WAAgC;CACzD,OAAO,OAAO,KAAK,UAAU,YAAY,CAAC,CAAC,CAAC,CACzC,QAAQ,YAAY,OAAO,MAAM,OAAO,MAAM,IAAI,CAAC,CACnD,KAAK,OAAO,OAAO;AACxB;AAEA,SAAS,eAAe,WAAsB,KAA4B;CACxE,MAAM,QAAQ,UAAU,YAAY,GAAG;CACvC,OAAO,OAAO,UAAU,YAAY,OAAO,MAAM,KAAK,IAAI,QAAQ;AACpE;AAEA,SAAS,kBACP,YACA,WACA,SACA,aACA,OACiE;CACjE,MAAM,OAAO;EACX,WAAW,WAAW;EACtB,cAAc,WAAW;EACzB,sBAAsB,WAAW;EACjC,SAAS,WAAW;EACpB,sBAAsB,WAAW;EACjC,uBAAuB;EACvB,gBAAgB;CAClB;CAEA,IAAI,WAAW,SAAS,SACtB,OAAO;EACL,eAAe;EACf,YAAY;GAAE,GAAG;GAAM,QAAQ;GAAS,QAAQ,WAAW;EAAO;CACpE;CAEF,IAAI,WAAW,SAAS,UACtB,OAAO;EACL,eAAe;EACf,YAAY;GAAE,GAAG;GAAM,QAAQ;GAAU,QAAQ,WAAW;EAAO;CACrE;CAEF,IAAI,SACF,OAAO;EACL,eAAe;EACf,YAAY;GAAE,GAAG;GAAM,QAAQ;GAAS,QAAQ;EAAQ;CAC1D;CAEF,IAAI,WAAW,SAAS,WACtB,OAAO;EACL,eAAe,YAAY,eAAe,WAAW,WAAW,IAAI;EACpE,YAAY;GAAE,GAAG;GAAM,QAAQ;GAAW,QAAQ,WAAW;EAAO;CACtE;CAEF,IAAI,CAAC,WACH,OAAO;EACL,eAAe;EACf,YAAY;GAAE,GAAG;GAAM,QAAQ;GAAS,QAAQ;EAAkC;CACpF;CAGF,MAAM,gBAAgB,eAAe,WAAW,WAAW;CAC3D,IAAI,CAAC,eACH,OAAO;EACL,eAAe;EACf,YAAY;GACV,GAAG;GACH,QAAQ;GACR,QAAQ,aAAa,YAAY;EACnC;CACF;CAGF,MAAM,WAAW,kBAAkB,SAAS;CAC5C,IAAI,CAAC,SAAS,SAAS,aAAa,GAClC,OAAO;EACL,eAAe;EACf,YAAY;GACV,GAAG;GACH,QAAQ;GACR,QAAQ,aAAa,YAAY;EACnC;CACF;CAEF,MAAM,iBAAiB,OAAO,cAAc,UAAU,WAAW,oBAAoB;CACrF,IAAI,CAAC,gBACH,OAAO;EACL;EACA,YAAY;GACV,GAAG;GACH,QAAQ;GACR,QAAQ;EACV;CACF;CAEF,IACE,OAAO,UAAU,eAAe,WAAW,oBAAoB,KAC/D,CAAC,OAAO,GAAG,eAAe,cAAc,GAExC,OAAO;EACL;EACA,YAAY;GACV,GAAG;GACH;GACA,QAAQ;GACR,QAAQ;EACV;CACF;CAGF,MAAM,WAAW,aAAa,WAAW,oBAAoB;CAC7D,IAAI,CAAC,SAAS,OACZ,OAAO;EACL;EACA,YAAY;GAAE,GAAG;GAAM;GAAgB,QAAQ;GAAU,QAAQ,SAAS;EAAO;CACnF;CAGF,MAAM,WAAW,iBAAiB,gBAAgB,aAAa;CAC/D,MAAM,WAAW,CAAC,YAAY;CAC9B,OAAO;EACL;EACA,YAAY;GACV,GAAG;GACH;GACA,uBAAuB,WACnB,aAAa,SAAS,OAAO,eAAe,QAAQ,IACpD;GACJ,QAAQ,WAAW,aAAa;GAChC,QAAQ,WACJ,WACE,gDACA,kDACF;EACN;CACF;AACF;AAEA,SAAS,cACP,YAKA,aACQ;CACR,OAAO;EACL,WAAW;EACX,WAAW;EACX,eAAe,WAAW;EAC1B,WAAW;CACb,CAAC,CAAC,KAAK,IAAQ;AACjB;AAEA,SAAS,4BAA4B,eAAuB,WAAqC;CAC/F,MAAM,WAAW,kBAAkB,SAAS;CAC5C,MAAM,SAAS,6BAA6B,aAAa;CACzD,IAAI,OAAO,SAAS,OAAO;EACzB,MAAM,SAAS,UAAU,YAAY,GAAG,OAAO;EAC/C,OAAO,OAAO,WAAW,YAAY,OAAO,MAAM,MAAM,IAAI,SAAS;CACvE;CACA,IAAI,OAAO,SAAS,WAAW,OAAO,OAAO,MAAM,OAAO,OAAO;CACjE,IAAI,OAAO,SAAS,SAAS,OAAO,OAAO,cAAc,UAAU,OAAO,OAAO;CACjF,OAAO;AACT;AAEA,SAAS,gBAAgB,WAAsB,SAAyC;CACtF,MAAM,WAAW,UAAU,WAAW;CACtC,OAAO,YAAY,OAAO,aAAa,YAAY,CAAC,MAAM,QAAQ,QAAQ,IACrE,WACD;AACN;AAEA,SAAS,4BACP,WACA,oBACA,YACM;CACN,MAAM,+BAAe,IAAI,IAA+B;CACxD,KAAK,MAAM,YAAY,WACrB,KAAK,MAAM,cAAc,SAAS,aAChC,aAAa,IAAI,cAAc,YAAY,SAAS,OAAO,GAAG,UAAU;CAI5E,MAAM,qCAAqB,IAAI,IAAoC;CACnE,KAAK,MAAM,cAAc,oBAAoB;EAC3C,MAAM,UAAU,mBAAmB,IAAI,WAAW,SAAS,KAAK,CAAC;EACjE,QAAQ,KAAK,UAAU;EACvB,mBAAmB,IAAI,WAAW,WAAW,OAAO;CACtD;CAEA,KAAK,MAAM,CAAC,WAAW,YAAY,oBAAoB;EACrD,MAAM,SAAS,QAAQ,SAAS,eAAe;GAC7C,IAAI,CAAC,WAAW,iBAAiB,OAAO,CAAC;GACzC,MAAM,YAAY,WAAW,IAAI,WAAW,OAAO;GACnD,IAAI,CAAC,WAAW,OAAO,CAAC;GACxB,MAAM,UAAU,aAAa,IAAI,cAAc,UAAU,CAAC;GAC1D,MAAM,iBAAiB,4BACrB,WAAW,sBACX,SACF;GAEA,MAAM,gBAAgB,4BADM,SAAS,yBAAyB,WAAW,sBACF,SAAS;GAChF,OAAO,kBAAkB,gBACrB,CACE;IACE;IACA;IACA;IACA;IACA;IACA,SAAS,QAAQ,SAAS,qBAAqB;GACjD,CACF,IACA,CAAC;EACP,CAAC;EACD,MAAM,2BAAW,IAAI,IAA+B;EAEpD,KAAK,MAAM,YAAY,QAAQ;GAC7B,MAAM,eACJ,gBAAgB,SAAS,WAAW,SAAS,cAAc,CAAC,EAAE,oBAAoB,CAAC;GACrF,MAAM,cACJ,gBAAgB,SAAS,WAAW,SAAS,aAAa,CAAC,EAAE,oBAAoB,CAAC;GACpF,MAAM,4BAAY,IAAI,IAAI,CAAC,GAAG,OAAO,KAAK,YAAY,GAAG,GAAG,OAAO,KAAK,WAAW,CAAC,CAAC;GACrF,KAAK,MAAM,YAAY,WAAW;IAChC,MAAM,qBAAqB,aAAa;IACxC,MAAM,oBAAoB,YAAY;IACtC,IAAI,sBAAsB,KAAA,KAAa,OAAO,sBAAsB,UAAU;IAE9E,KAAK,MAAM,QAAQ,OAAO,QAAQ,UAAU,MAAM,WAAW,YAAY,QAAQ,GAAG;KAClF,MAAM,kBACJ,OAAO,uBAAuB,YAC9B,OAAO,UAAU,KAAK,gBAAgB,kBAAkB;KAC1D,MAAM,iBACJ,OAAO,sBAAsB,YAC7B,OAAO,UAAU,KAAK,eAAe,iBAAiB;KACxD,IAAI,CAAC,mBAAmB,gBAAgB;KAExC,MAAM,SAAS,GAAG,SAAS,WAAW,QAAQ,GAAG,SAAS,cAAc,YAAY,SAAS,GAAG;KAChG,IAAI,SAAS,WAAW,SAAS,SAAS,SAAS,IAAI,SAAS,SAAS,MAAM;KAC/E,IAAI,KAAK,WAAW,KAAK,SAAS,SAAS,IAAI,KAAK,SAAS,MAAM;IACrE;GACF;EACF;EAEA,KAAK,MAAM,CAAC,SAAS,WAAW,UAAU;GACxC,QAAQ,SAAS;GACjB,QAAQ,wBAAwB;GAChC,QAAQ,SAAS;EACnB;CAGF;AACF;AAEA,SAAS,gBAAgB,aAAgD;CACvE,OAAO,YAAY,QAChB,QAAQ,eACP,gBAAgB,WAAW,UAAU,gBAAgB,UAAU,WAAW,SAAS,QACrF,SACF;AACF;AAEA,SAAS,UAAU,WAA6C;CAC9D,MAAM,UAAyB;EAC7B,UAAU,UAAU;EACpB,aAAa;EACb,oBAAoB;EACpB,SAAS;EACT,MAAM;EACN,UAAU;EACV,OAAO;EACP,QAAQ;EACR,OAAO;CACT;CACA,KAAK,MAAM,YAAY,WAAW;EAChC,SAAS,SAAS,gBAAgB,SAAS,WAAW;EACtD,SAAS,SACP,SAAS,YAAY,MAAM,UAAU,MAAM,WAAW,SAAS,MAAM,CAAC,EAAE,UAAU;EACpF,QAAQ,SAAS,WAAW;EAC5B,QAAQ,eAAe,SAAS,YAAY;EAC5C,QAAQ,sBAAsB,SAAS,YAAY,QAChD,UAAU,MAAM,qBACnB,CAAC,CAAC;CACJ;CACA,OAAO;AACT;AAEA,SAAgB,YAAY,SAAqC;CAC/D,MAAM,WAAW,QAAQ,4BAAY,IAAI,IAAoB;CAC7D,MAAM,OAAO,QAAQ,QAAQ,CAAC;CAC9B,MAAM,0BAAU,IAAI,IAAoC;CACxD,KAAK,MAAM,cAAc,QAAQ,aAAa;EAC5C,MAAM,UAAU,QAAQ,IAAI,WAAW,OAAO,KAAK,CAAC;EACpD,QAAQ,KAAK,UAAU;EACvB,QAAQ,IAAI,WAAW,SAAS,OAAO;CACzC;CAEA,MAAM,YAAY,CAAC,GAAG,QAAQ,QAAQ,CAAC,CAAC,CACrC,MAAM,CAAC,OAAO,CAAC,WAAW,KAAK,cAAc,KAAK,CAAC,CAAC,CACpD,KAAK,CAAC,aAAa,iBAAkC;EACpD,MAAM,cAAc,QAAQ,UAAU,KAAK,gBAAgB;EAC3D,MAAM,UAAU,YAAY,KAAK,eAC/B,kBACE,YACA,QAAQ,WAAW,IAAI,WAAW,GAClC,SAAS,IAAI,WAAW,GACxB,aACA,QAAQ,SAAS,KACnB,CACF;EACA,MAAM,gBAAgB,QAAQ,MAAM,UAAU,MAAM,aAAa,CAAC,EAAE,iBAAiB;EACrF,MAAM,qBAAqB,QAAQ,KAAK,UAAU,MAAM,UAAU;EAClE,MAAM,SAAS,gBAAgB,kBAAkB;EACjD,OAAO;GACL,SAAS;GACT;GACA;GACA;GACA,QAAQ,mBAAmB,MAAM,UAAU,MAAM,WAAW,MAAM,CAAC,EAAE,UAAU;GAC/E,aAAa;EACf;CACF,CAAC;CAEH,MAAM,gBAAgB,IAAI,IAAI,QAAQ,KAAK,CAAC;CAC5C,KAAK,MAAM,CAAC,aAAa,YAAY,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,WAChE,KAAK,cAAc,KAAK,CAC1B,GAAG;EACD,IAAI,cAAc,IAAI,WAAW,GAAG;EACpC,MAAM,WAAW,QAAQ,sBAAsB,CAAC,EAAA,CAC7C,QAAQ,eAAe,WAAW,YAAY,WAAW,CAAC,CAC1D,KACE,gBAAmC;GAClC,WAAW,WAAW;GACtB,cAAc,WAAW;GACzB,sBAAsB,WAAW;GACjC,SAAS,WAAW;GACpB,sBAAsB,WAAW;GACjC,uBAAuB;GACvB,gBAAgB;GAChB,QAAQ;GACR,QAAQ,qCAAqC;EAC/C,EACF;EACF,UAAU,KAAK;GACb,SAAS;GACT,aAAa,QAAQ,UAAU,KAAK,gBAAgB;GACpD,eAAe;GACf,QAAQ;GACR,QAAQ,qCAAqC;GAC7C,aAAa;EACf,CAAC;CACH;CACA,UAAU,MAAM,MAAM,UAAU,KAAK,QAAQ,cAAc,MAAM,OAAO,CAAC;CAEzE,4BACE,WACA,QAAQ,sBAAsB,QAAQ,aACtC,QAAQ,UACV;CACA,MAAM,UAAU,UAAU,SAAS;CACnC,OAAO;EAAE;EAAW;EAAS,WAAW,QAAQ,QAAQ;CAAE;AAC5D"}

package/dist/range-YUs9eimn.js

@@ -0,0 +1,127 @@
+import semver from "semver";
+//#region src/update/range.ts
+const FULL_VERSION = String.raw`\d+\.\d+\.\d+(?:-[0-9A-Za-z.-]+)?(?:\+[0-9A-Za-z.-]+)?`;
+const PARTIAL_VERSION = String.raw`\d+(?:\.\d+){0,2}`;
+function analyzeAtomicRange(specification) {
+	const value = specification.trim();
+	if (/^(?:\*|x|X)$/.test(value)) return {
+		shape: null,
+		tracking: true,
+		reason: "wildcard range tracks the selected tag"
+	};
+	if (new RegExp(`^${FULL_VERSION}$`).test(value) && semver.valid(value)) return {
+		shape: { kind: "exact" },
+		tracking: false,
+		reason: ""
+	};
+	const operator = value.match(new RegExp(`^([~^])\\s*(${FULL_VERSION}|${PARTIAL_VERSION})$`));
+	if (operator && semver.validRange(value)) return {
+		shape: {
+			kind: "operator",
+			operator: operator[1]
+		},
+		tracking: false,
+		reason: ""
+	};
+	const bounded = value.match(/^((?:>=|>)\s*\d+(?:\.\d+){0,2})\s+(?:<|<=)\s*\d+(?:\.\d+){0,2}$/);
+	if (bounded && semver.validRange(value)) return {
+		shape: {
+			kind: "bounded",
+			lower: bounded[1].replace(/\s+/g, "")
+		},
+		tracking: false,
+		reason: ""
+	};
+	const xRange = value.match(/^(\d+|[xX*])(?:\.(\d+|[xX*]))?(?:\.(\d+|[xX*]))?$/);
+	if (xRange && semver.validRange(value)) {
+		const parts = xRange.slice(1).filter((part) => part !== void 0);
+		return {
+			shape: {
+				kind: "x",
+				parts,
+				wildcard: parts.find((part) => /^[xX*]$/.test(part)) ?? null
+			},
+			tracking: false,
+			reason: ""
+		};
+	}
+	return {
+		shape: null,
+		tracking: false,
+		reason: "unsupported complex semver range"
+	};
+}
+function analyzeRange(specification) {
+	const clauses = specification.split("||").map((clause) => clause.trim());
+	if (clauses.length === 1) return analyzeAtomicRange(specification);
+	if (clauses.some((clause) => clause.length === 0)) return {
+		shape: null,
+		tracking: false,
+		reason: "unsupported complex semver range"
+	};
+	const analyzed = clauses.map(analyzeAtomicRange);
+	if (analyzed.some((entry) => !entry.shape || entry.shape.kind === "union" || entry.tracking)) return {
+		shape: null,
+		tracking: false,
+		reason: "unsupported complex semver union"
+	};
+	const minimums = clauses.map((clause) => semver.minVersion(clause));
+	if (minimums.some((version) => version === null)) return {
+		shape: null,
+		tracking: false,
+		reason: "unsupported complex semver union"
+	};
+	let highestIndex = 0;
+	for (let index = 1; index < minimums.length; index += 1) if (semver.gt(minimums[index], minimums[highestIndex])) highestIndex = index;
+	return {
+		shape: {
+			kind: "union",
+			clauses: analyzed.map((entry) => entry.shape),
+			sourceClauses: clauses,
+			highestIndex
+		},
+		tracking: false,
+		reason: ""
+	};
+}
+function isBreakingChange(allowedVersion, targetVersion) {
+	const allowed = new semver.SemVer(allowedVersion);
+	const target = new semver.SemVer(targetVersion);
+	if (allowed.major !== target.major) return true;
+	return allowed.major === 0 && allowed.minor !== target.minor;
+}
+function nextBreakingBoundary(version) {
+	const parsed = new semver.SemVer(version);
+	return parsed.major === 0 ? `0.${parsed.minor + 1}.0` : `${parsed.major + 1}.0.0`;
+}
+function rewriteXRange(shape, target) {
+	const parsed = new semver.SemVer(target);
+	const count = shape.parts.length;
+	if (shape.wildcard) {
+		const wildcardIndex = shape.parts.findIndex((part) => /^[xX*]$/.test(part));
+		if (wildcardIndex === 0) return shape.wildcard;
+		if (wildcardIndex === 1) return `${parsed.major}.${shape.wildcard}`;
+		return `${parsed.major}.${parsed.minor}.${shape.wildcard}`;
+	}
+	if (count === 1) return String(parsed.major);
+	return `${parsed.major}.${parsed.minor}`;
+}
+function rewriteAtomic(shape, target, forcedBreaking) {
+	if (shape.kind === "exact") return target;
+	if (shape.kind === "operator") return `${shape.operator}${target}`;
+	if (shape.kind === "x") return rewriteXRange(shape, target);
+	const boundary = nextBreakingBoundary(target);
+	return forcedBreaking ? `>=${target} <${boundary}` : `${shape.lower} <${boundary}`;
+}
+function rewriteRange(shape, target, forcedBreaking) {
+	if (shape.kind !== "union") return rewriteAtomic(shape, target, forcedBreaking);
+	const highestShape = shape.clauses[shape.highestIndex];
+	if (forcedBreaking) return rewriteAtomic(highestShape, target, true);
+	const rewritten = [...shape.sourceClauses];
+	rewritten[shape.highestIndex] = rewriteAtomic(highestShape, target, false);
+	return rewritten.join(" || ");
+}
+//#endregion
+export { isBreakingChange as n, rewriteRange as r, analyzeRange as t };
+
+//# sourceMappingURL=range-YUs9eimn.js.map

package/dist/range-YUs9eimn.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"range-YUs9eimn.js","names":[],"sources":["../src/update/range.ts"],"sourcesContent":["import semver from \"semver\";\n\nexport type AtomicRangeShape =\n  | { kind: \"exact\" }\n  | { kind: \"operator\"; operator: \"^\" | \"~\" }\n  | {\n      kind: \"x\";\n      parts: string[];\n      wildcard: \"x\" | \"X\" | \"*\" | null;\n    }\n  | { kind: \"bounded\"; lower: string };\n\nexport type RangeShape =\n  | AtomicRangeShape\n  | { kind: \"union\"; clauses: AtomicRangeShape[]; sourceClauses: string[]; highestIndex: number };\n\nexport interface RangeAnalysis {\n  shape: RangeShape | null;\n  tracking: boolean;\n  reason: string;\n}\n\nconst FULL_VERSION = String.raw`\\d+\\.\\d+\\.\\d+(?:-[0-9A-Za-z.-]+)?(?:\\+[0-9A-Za-z.-]+)?`;\nconst PARTIAL_VERSION = String.raw`\\d+(?:\\.\\d+){0,2}`;\n\nfunction analyzeAtomicRange(specification: string): RangeAnalysis {\n  const value = specification.trim();\n\n  if (/^(?:\\*|x|X)$/.test(value)) {\n    return { shape: null, tracking: true, reason: \"wildcard range tracks the selected tag\" };\n  }\n\n  if (new RegExp(`^${FULL_VERSION}$`).test(value) && semver.valid(value)) {\n    return { shape: { kind: \"exact\" }, tracking: false, reason: \"\" };\n  }\n\n  const operator = value.match(new RegExp(`^([~^])\\\\s*(${FULL_VERSION}|${PARTIAL_VERSION})$`));\n  if (operator && semver.validRange(value)) {\n    return {\n      shape: { kind: \"operator\", operator: operator[1] as \"^\" | \"~\" },\n      tracking: false,\n      reason: \"\",\n    };\n  }\n\n  const bounded = value.match(/^((?:>=|>)\\s*\\d+(?:\\.\\d+){0,2})\\s+(?:<|<=)\\s*\\d+(?:\\.\\d+){0,2}$/);\n  if (bounded && semver.validRange(value)) {\n    return {\n      shape: { kind: \"bounded\", lower: bounded[1].replace(/\\s+/g, \"\") },\n      tracking: false,\n      reason: \"\",\n    };\n  }\n\n  const xRange = value.match(/^(\\d+|[xX*])(?:\\.(\\d+|[xX*]))?(?:\\.(\\d+|[xX*]))?$/);\n  if (xRange && semver.validRange(value)) {\n    const parts = xRange.slice(1).filter((part): part is string => part !== undefined);\n    const explicitWildcard = parts.find((part) => /^[xX*]$/.test(part));\n    return {\n      shape: {\n        kind: \"x\",\n        parts,\n        wildcard: (explicitWildcard as \"x\" | \"X\" | \"*\" | undefined) ?? null,\n      },\n      tracking: false,\n      reason: \"\",\n    };\n  }\n\n  return {\n    shape: null,\n    tracking: false,\n    reason: \"unsupported complex semver range\",\n  };\n}\n\nexport function analyzeRange(specification: string): RangeAnalysis {\n  const clauses = specification.split(\"||\").map((clause) => clause.trim());\n  if (clauses.length === 1) return analyzeAtomicRange(specification);\n\n  if (clauses.some((clause) => clause.length === 0)) {\n    return { shape: null, tracking: false, reason: \"unsupported complex semver range\" };\n  }\n\n  const analyzed = clauses.map(analyzeAtomicRange);\n  if (analyzed.some((entry) => !entry.shape || entry.shape.kind === \"union\" || entry.tracking)) {\n    return { shape: null, tracking: false, reason: \"unsupported complex semver union\" };\n  }\n\n  const minimums = clauses.map((clause) => semver.minVersion(clause));\n  if (minimums.some((version) => version === null)) {\n    return { shape: null, tracking: false, reason: \"unsupported complex semver union\" };\n  }\n\n  let highestIndex = 0;\n  for (let index = 1; index < minimums.length; index += 1) {\n    if (semver.gt(minimums[index]!, minimums[highestIndex]!)) highestIndex = index;\n  }\n\n  return {\n    shape: {\n      kind: \"union\",\n      clauses: analyzed.map((entry) => entry.shape as AtomicRangeShape),\n      sourceClauses: clauses,\n      highestIndex,\n    },\n    tracking: false,\n    reason: \"\",\n  };\n}\n\nexport function isBreakingChange(allowedVersion: string, targetVersion: string): boolean {\n  const allowed = new semver.SemVer(allowedVersion);\n  const target = new semver.SemVer(targetVersion);\n  if (allowed.major !== target.major) return true;\n  return allowed.major === 0 && allowed.minor !== target.minor;\n}\n\nexport function nextBreakingBoundary(version: string): string {\n  const parsed = new semver.SemVer(version);\n  return parsed.major === 0 ? `0.${parsed.minor + 1}.0` : `${parsed.major + 1}.0.0`;\n}\n\nfunction rewriteXRange(shape: Extract<AtomicRangeShape, { kind: \"x\" }>, target: string): string {\n  const parsed = new semver.SemVer(target);\n  const count = shape.parts.length;\n\n  if (shape.wildcard) {\n    const wildcardIndex = shape.parts.findIndex((part) => /^[xX*]$/.test(part));\n    if (wildcardIndex === 0) return shape.wildcard;\n    if (wildcardIndex === 1) return `${parsed.major}.${shape.wildcard}`;\n    return `${parsed.major}.${parsed.minor}.${shape.wildcard}`;\n  }\n\n  if (count === 1) return String(parsed.major);\n  return `${parsed.major}.${parsed.minor}`;\n}\n\nfunction rewriteAtomic(shape: AtomicRangeShape, target: string, forcedBreaking: boolean): string {\n  if (shape.kind === \"exact\") return target;\n  if (shape.kind === \"operator\") return `${shape.operator}${target}`;\n  if (shape.kind === \"x\") return rewriteXRange(shape, target);\n\n  const boundary = nextBreakingBoundary(target);\n  return forcedBreaking ? `>=${target} <${boundary}` : `${shape.lower} <${boundary}`;\n}\n\nexport function rewriteRange(shape: RangeShape, target: string, forcedBreaking: boolean): string {\n  if (shape.kind !== \"union\") return rewriteAtomic(shape, target, forcedBreaking);\n\n  const highestShape = shape.clauses[shape.highestIndex];\n  if (forcedBreaking) return rewriteAtomic(highestShape, target, true);\n\n  const rewritten = [...shape.sourceClauses];\n  rewritten[shape.highestIndex] = rewriteAtomic(highestShape, target, false);\n  return rewritten.join(\" || \");\n}\n"],"mappings":";;AAsBA,MAAM,eAAe,OAAO,GAAG;AAC/B,MAAM,kBAAkB,OAAO,GAAG;AAElC,SAAS,mBAAmB,eAAsC;CAChE,MAAM,QAAQ,cAAc,KAAK;CAEjC,IAAI,eAAe,KAAK,KAAK,GAC3B,OAAO;EAAE,OAAO;EAAM,UAAU;EAAM,QAAQ;CAAyC;CAGzF,IAAI,IAAI,OAAO,IAAI,aAAa,EAAE,CAAC,CAAC,KAAK,KAAK,KAAK,OAAO,MAAM,KAAK,GACnE,OAAO;EAAE,OAAO,EAAE,MAAM,QAAQ;EAAG,UAAU;EAAO,QAAQ;CAAG;CAGjE,MAAM,WAAW,MAAM,MAAM,IAAI,OAAO,eAAe,aAAa,GAAG,gBAAgB,GAAG,CAAC;CAC3F,IAAI,YAAY,OAAO,WAAW,KAAK,GACrC,OAAO;EACL,OAAO;GAAE,MAAM;GAAY,UAAU,SAAS;EAAgB;EAC9D,UAAU;EACV,QAAQ;CACV;CAGF,MAAM,UAAU,MAAM,MAAM,iEAAiE;CAC7F,IAAI,WAAW,OAAO,WAAW,KAAK,GACpC,OAAO;EACL,OAAO;GAAE,MAAM;GAAW,OAAO,QAAQ,EAAE,CAAC,QAAQ,QAAQ,EAAE;EAAE;EAChE,UAAU;EACV,QAAQ;CACV;CAGF,MAAM,SAAS,MAAM,MAAM,mDAAmD;CAC9E,IAAI,UAAU,OAAO,WAAW,KAAK,GAAG;EACtC,MAAM,QAAQ,OAAO,MAAM,CAAC,CAAC,CAAC,QAAQ,SAAyB,SAAS,KAAA,CAAS;EAEjF,OAAO;GACL,OAAO;IACL,MAAM;IACN;IACA,UALqB,MAAM,MAAM,SAAS,UAAU,KAAK,IAAI,CAKnC,KAAqC;GACjE;GACA,UAAU;GACV,QAAQ;EACV;CACF;CAEA,OAAO;EACL,OAAO;EACP,UAAU;EACV,QAAQ;CACV;AACF;AAEA,SAAgB,aAAa,eAAsC;CACjE,MAAM,UAAU,cAAc,MAAM,IAAI,CAAC,CAAC,KAAK,WAAW,OAAO,KAAK,CAAC;CACvE,IAAI,QAAQ,WAAW,GAAG,OAAO,mBAAmB,aAAa;CAEjE,IAAI,QAAQ,MAAM,WAAW,OAAO,WAAW,CAAC,GAC9C,OAAO;EAAE,OAAO;EAAM,UAAU;EAAO,QAAQ;CAAmC;CAGpF,MAAM,WAAW,QAAQ,IAAI,kBAAkB;CAC/C,IAAI,SAAS,MAAM,UAAU,CAAC,MAAM,SAAS,MAAM,MAAM,SAAS,WAAW,MAAM,QAAQ,GACzF,OAAO;EAAE,OAAO;EAAM,UAAU;EAAO,QAAQ;CAAmC;CAGpF,MAAM,WAAW,QAAQ,KAAK,WAAW,OAAO,WAAW,MAAM,CAAC;CAClE,IAAI,SAAS,MAAM,YAAY,YAAY,IAAI,GAC7C,OAAO;EAAE,OAAO;EAAM,UAAU;EAAO,QAAQ;CAAmC;CAGpF,IAAI,eAAe;CACnB,KAAK,IAAI,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS,GACpD,IAAI,OAAO,GAAG,SAAS,QAAS,SAAS,aAAc,GAAG,eAAe;CAG3E,OAAO;EACL,OAAO;GACL,MAAM;GACN,SAAS,SAAS,KAAK,UAAU,MAAM,KAAyB;GAChE,eAAe;GACf;EACF;EACA,UAAU;EACV,QAAQ;CACV;AACF;AAEA,SAAgB,iBAAiB,gBAAwB,eAAgC;CACvF,MAAM,UAAU,IAAI,OAAO,OAAO,cAAc;CAChD,MAAM,SAAS,IAAI,OAAO,OAAO,aAAa;CAC9C,IAAI,QAAQ,UAAU,OAAO,OAAO,OAAO;CAC3C,OAAO,QAAQ,UAAU,KAAK,QAAQ,UAAU,OAAO;AACzD;AAEA,SAAgB,qBAAqB,SAAyB;CAC5D,MAAM,SAAS,IAAI,OAAO,OAAO,OAAO;CACxC,OAAO,OAAO,UAAU,IAAI,KAAK,OAAO,QAAQ,EAAE,MAAM,GAAG,OAAO,QAAQ,EAAE;AAC9E;AAEA,SAAS,cAAc,OAAiD,QAAwB;CAC9F,MAAM,SAAS,IAAI,OAAO,OAAO,MAAM;CACvC,MAAM,QAAQ,MAAM,MAAM;CAE1B,IAAI,MAAM,UAAU;EAClB,MAAM,gBAAgB,MAAM,MAAM,WAAW,SAAS,UAAU,KAAK,IAAI,CAAC;EAC1E,IAAI,kBAAkB,GAAG,OAAO,MAAM;EACtC,IAAI,kBAAkB,GAAG,OAAO,GAAG,OAAO,MAAM,GAAG,MAAM;EACzD,OAAO,GAAG,OAAO,MAAM,GAAG,OAAO,MAAM,GAAG,MAAM;CAClD;CAEA,IAAI,UAAU,GAAG,OAAO,OAAO,OAAO,KAAK;CAC3C,OAAO,GAAG,OAAO,MAAM,GAAG,OAAO;AACnC;AAEA,SAAS,cAAc,OAAyB,QAAgB,gBAAiC;CAC/F,IAAI,MAAM,SAAS,SAAS,OAAO;CACnC,IAAI,MAAM,SAAS,YAAY,OAAO,GAAG,MAAM,WAAW;CAC1D,IAAI,MAAM,SAAS,KAAK,OAAO,cAAc,OAAO,MAAM;CAE1D,MAAM,WAAW,qBAAqB,MAAM;CAC5C,OAAO,iBAAiB,KAAK,OAAO,IAAI,aAAa,GAAG,MAAM,MAAM,IAAI;AAC1E;AAEA,SAAgB,aAAa,OAAmB,QAAgB,gBAAiC;CAC/F,IAAI,MAAM,SAAS,SAAS,OAAO,cAAc,OAAO,QAAQ,cAAc;CAE9E,MAAM,eAAe,MAAM,QAAQ,MAAM;CACzC,IAAI,gBAAgB,OAAO,cAAc,cAAc,QAAQ,IAAI;CAEnE,MAAM,YAAY,CAAC,GAAG,MAAM,aAAa;CACzC,UAAU,MAAM,gBAAgB,cAAc,cAAc,QAAQ,KAAK;CACzE,OAAO,UAAU,KAAK,MAAM;AAC9B"}