@savvy-web/silk-effects 9.5.5 → 10.0.0

package/changesets/remark/plugins/contributor-footnotes.js

@@ -1,335 +0,0 @@
-import { getVersionBlocks } from "../../utils/version-blocks.js";
-import { visit } from "unist-util-visit";
-
-//#region src/changesets/remark/plugins/contributor-footnotes.ts
-/**
-* Pattern matching `Thanks @user!` at end of text.
-*
-* @internal
-*/
-const ATTRIBUTION_PLAIN_RE = /\s*Thanks @(\w[\w-]*)!$/;
-/**
-* Pattern matching `@user` mentions inside an existing Thanks section.
-*
-* @internal
-*/
-const MENTION_RE = /@(\w[\w-]*)/g;
-/**
-* Try to extract a linked attribution from the end of a paragraph's children.
-* Pattern: text "...Thanks " + link "\@user" + text "!"
-*
-* @param children - The phrasing content children of a paragraph node
-* @returns The contributor and the index to start removal from, or `undefined`
-*
-* @internal
-*/
-function extractLinkedAttribution(children) {
-	if (children.length < 3) return void 0;
-	const last = children[children.length - 1];
-	const secondLast = children[children.length - 2];
-	const thirdLast = children[children.length - 3];
-	if (last.type !== "text" || last.value !== "!") return void 0;
-	if (secondLast.type !== "link") return void 0;
-	const linkNode = secondLast;
-	if (linkNode.children.length !== 1 || linkNode.children[0].type !== "text") return void 0;
-	const linkText = linkNode.children[0].value;
-	if (!linkText.startsWith("@")) return void 0;
-	const username = linkText.slice(1);
-	if (thirdLast.type !== "text") return void 0;
-	const textNode = thirdLast;
-	if (!/\s*Thanks $/.test(textNode.value)) return void 0;
-	return {
-		contributor: {
-			username,
-			url: linkNode.url
-		},
-		removeFrom: children.length - 3
-	};
-}
-/**
-* Strip a trailing attribution (linked or plain) from a paragraph, adding
-* the contributor to the map.
-*
-* @param para - The paragraph to inspect and mutate
-* @param contributors - The per-block contributor accumulator
-* @returns `true` when an attribution was found and removed
-*
-* @internal
-*/
-function stripAttribution(para, contributors) {
-	const linked = extractLinkedAttribution(para.children);
-	if (linked) {
-		const key = linked.contributor.username.toLowerCase();
-		if (!contributors.has(key)) contributors.set(key, linked.contributor);
-		const textNode = para.children[linked.removeFrom];
-		textNode.value = textNode.value.replace(/\s*Thanks $/, "");
-		para.children.splice(linked.removeFrom + 1, 2);
-		if (textNode.value === "") para.children.splice(linked.removeFrom, 1);
-		return true;
-	}
-	const last = para.children[para.children.length - 1];
-	if (last?.type === "text") {
-		const textNode = last;
-		const match = textNode.value.match(ATTRIBUTION_PLAIN_RE);
-		if (match) {
-			const username = match[1];
-			const key = username.toLowerCase();
-			if (!contributors.has(key)) contributors.set(key, {
-				username,
-				url: void 0
-			});
-			textNode.value = textNode.value.replace(ATTRIBUTION_PLAIN_RE, "");
-			if (textNode.value === "") para.children.pop();
-			return true;
-		}
-	}
-	return false;
-}
-/**
-* Harvest every `@user` mention (linked or plain) from a node subtree.
-* Used to absorb an existing `### Thanks` section so re-running the plugin
-* is idempotent.
-*
-* @internal
-*/
-function harvestMentions(node, contributors) {
-	visit(node, (child) => {
-		if (child.type === "link") {
-			const link = child;
-			const only = link.children.length === 1 ? link.children[0] : void 0;
-			if (only?.type === "text" && only.value.startsWith("@")) {
-				const username = only.value.slice(1);
-				const key = username.toLowerCase();
-				if (!contributors.has(key)) contributors.set(key, {
-					username,
-					url: link.url
-				});
-				return "skip";
-			}
-		} else if (child.type === "text") for (const match of child.value.matchAll(MENTION_RE)) {
-			const key = match[1].toLowerCase();
-			if (!contributors.has(key)) contributors.set(key, {
-				username: match[1],
-				url: void 0
-			});
-		}
-	});
-}
-/**
-* Build the `Thanks to ... for their contributions!` summary paragraph.
-*
-* @internal
-*/
-function buildSummaryParagraph(contributors) {
-	const sorted = [...contributors.values()].sort((a, b) => a.username.toLowerCase().localeCompare(b.username.toLowerCase()));
-	const phrasingChildren = [];
-	phrasingChildren.push({
-		type: "text",
-		value: "Thanks to "
-	});
-	for (let i = 0; i < sorted.length; i++) {
-		const contrib = sorted[i];
-		if (i > 0 && sorted.length > 2) phrasingChildren.push({
-			type: "text",
-			value: ", "
-		});
-		if (i > 0 && i === sorted.length - 1) phrasingChildren.push({
-			type: "text",
-			value: sorted.length === 2 ? " and " : "and "
-		});
-		if (contrib.url) phrasingChildren.push({
-			type: "link",
-			url: contrib.url,
-			children: [{
-				type: "text",
-				value: `@${contrib.username}`
-			}]
-		});
-		else phrasingChildren.push({
-			type: "text",
-			value: `@${contrib.username}`
-		});
-	}
-	phrasingChildren.push({
-		type: "text",
-		value: " for their contributions!"
-	});
-	return {
-		type: "paragraph",
-		children: phrasingChildren
-	};
-}
-/**
-* Remove list items (recursively) whose content was emptied by attribution
-* stripping — a bullet that held ONLY `Thanks @user!` must not survive as a
-* bare `- ` husk. Runs in both the `thanks: true` and `thanks: false` paths,
-* since stripping is unconditional.
-*
-* @internal
-*/
-function pruneEmptiedListItems(list) {
-	list.children = list.children.filter((item) => {
-		item.children = item.children.filter((child) => {
-			if (child.type === "paragraph") return child.children.length > 0;
-			if (child.type === "list") {
-				const nested = child;
-				pruneEmptiedListItems(nested);
-				return nested.children.length > 0;
-			}
-			return true;
-		});
-		return item.children.length > 0;
-	});
-}
-/**
-* Text form of a paragraph: concatenated text values, with single-text link
-* children flattened to their label. Returns `undefined` when the paragraph
-* holds anything other than text and simple text-labelled links.
-*
-* @internal
-*/
-function flattenToText(para) {
-	let out = "";
-	for (const child of para.children) {
-		if (child.type === "text") {
-			out += child.value;
-			continue;
-		}
-		if (child.type === "link") {
-			const link = child;
-			const only = link.children.length === 1 ? link.children[0] : void 0;
-			if (only?.type === "text") {
-				out += only.value;
-				continue;
-			}
-		}
-		return;
-	}
-	return out;
-}
-/**
-* Pattern matching the plugin's own merged summary paragraph, e.g.
-* `Thanks to @alice, @bob, and @carol for their contributions!`.
-*
-* @internal
-*/
-const MERGED_SUMMARY_RE = /^Thanks to @\w[\w-]*(?:(?:, | and |, and |,and )@\w[\w-]*)* for their contributions!$/;
-/**
-* Whether a paragraph consists ENTIRELY of attribution content the plugin
-* owns: either its own merged `Thanks to ... for their contributions!`
-* summary, or one or more trailing `Thanks @user!` / `Thanks [@user](url)!`
-* attributions with nothing else. Checked against a clone so the real node
-* is never mutated — a paragraph carrying anything beyond pure attribution
-* is not the plugin's to touch.
-*
-* @internal
-*/
-function isPureAttributionParagraph(para) {
-	const text = flattenToText(para);
-	if (text !== void 0 && MERGED_SUMMARY_RE.test(text)) return true;
-	const clone = structuredClone(para);
-	const scratch = /* @__PURE__ */ new Map();
-	while (clone.children.length > 0 && stripAttribution(clone, scratch));
-	return clone.children.length === 0;
-}
-/**
-* Whether a Thanks-section body node is a pure attribution shape the plugin
-* may harvest and remove: an attribution-only paragraph, or a list whose
-* every item holds only attribution-only paragraphs. Anything else
-* (mixed prose+mention, plain-name lists, code blocks, arbitrary prose) is
-* preserved untouched and never mined for mentions.
-*
-* @internal
-*/
-function isPureAttributionNode(node) {
-	if (node.type === "paragraph") return isPureAttributionParagraph(node);
-	if (node.type === "list") {
-		const list = node;
-		return list.children.length > 0 && list.children.every((item) => item.children.length > 0 && item.children.every((child) => child.type === "paragraph" && isPureAttributionParagraph(child)));
-	}
-	return false;
-}
-/**
-* Whether a node is a depth-3 heading whose text is `Thanks`.
-*
-* @internal
-*/
-function isThanksHeading(node) {
-	if (node.type !== "heading" || node.depth !== 3) return false;
-	const heading = node;
-	const only = heading.children.length === 1 ? heading.children[0] : void 0;
-	return only?.type === "text" && only.value.trim().toLowerCase() === "thanks";
-}
-const ContributorFootnotesPlugin = (options) => {
-	const emitThanks = options?.thanks !== false;
-	return (tree) => {
-		const blocks = getVersionBlocks(tree);
-		for (let b = blocks.length - 1; b >= 0; b--) {
-			const block = blocks[b];
-			const contributors = /* @__PURE__ */ new Map();
-			const indicesToRemove = [];
-			let preservedThanksAnchor;
-			for (let i = block.startIndex; i < block.endIndex; i++) {
-				const node = tree.children[i];
-				if (node.type === "list") {
-					const listNode = node;
-					visit(listNode, "paragraph", (para) => {
-						stripAttribution(para, contributors);
-					});
-					pruneEmptiedListItems(listNode);
-					if (listNode.children.length === 0) indicesToRemove.push(i);
-					continue;
-				}
-				if (node.type === "paragraph") {
-					const para = node;
-					if (stripAttribution(para, contributors) && para.children.length === 0) indicesToRemove.push(i);
-					continue;
-				}
-				if (isThanksHeading(node)) {
-					const headingIndex = i;
-					const harvested = [];
-					let lastPreserved;
-					let j = i + 1;
-					for (; j < block.endIndex; j++) {
-						const contentNode = tree.children[j];
-						if (contentNode.type === "heading" && [2, 3].includes(contentNode.depth)) break;
-						if (contentNode.type === "definition") continue;
-						if (isPureAttributionNode(contentNode)) {
-							harvestMentions(contentNode, contributors);
-							harvested.push(j);
-						} else lastPreserved = contentNode;
-					}
-					if (lastPreserved === void 0) indicesToRemove.push(headingIndex, ...harvested);
-					else {
-						indicesToRemove.push(...harvested);
-						preservedThanksAnchor ??= lastPreserved;
-					}
-					i = j - 1;
-				}
-			}
-			const uniqueIndices = [...new Set(indicesToRemove)].sort((a, b) => b - a);
-			for (const idx of uniqueIndices) tree.children.splice(idx, 1);
-			if (!emitThanks || contributors.size === 0) continue;
-			if (preservedThanksAnchor !== void 0) {
-				const anchorIndex = tree.children.indexOf(preservedThanksAnchor);
-				if (anchorIndex !== -1) {
-					tree.children.splice(anchorIndex + 1, 0, buildSummaryParagraph(contributors));
-					continue;
-				}
-			}
-			let insertAt = block.endIndex - uniqueIndices.length;
-			while (insertAt > block.startIndex && tree.children[insertAt - 1]?.type === "definition") insertAt--;
-			tree.children.splice(insertAt, 0, {
-				type: "heading",
-				depth: 3,
-				children: [{
-					type: "text",
-					value: "Thanks"
-				}]
-			}, buildSummaryParagraph(contributors));
-		}
-	};
-};
-
-//#endregion
-export { ContributorFootnotesPlugin };

package/changesets/remark/plugins/deduplicate-items.js

@@ -1,32 +0,0 @@
-import { getBlockSections, getVersionBlocks } from "../../utils/version-blocks.js";
-import { toString } from "mdast-util-to-string";
-
-//#region src/changesets/remark/plugins/deduplicate-items.ts
-const DeduplicateItemsPlugin = () => {
-	return (tree) => {
-		const blocks = getVersionBlocks(tree);
-		for (const block of blocks) {
-			const sections = getBlockSections(tree, block);
-			for (const section of sections) {
-				const seen = /* @__PURE__ */ new Set();
-				for (const node of section.contentNodes) {
-					if (node.type !== "list") continue;
-					const list = node;
-					list.children = list.children.filter((item) => {
-						const text = toString(item);
-						if (seen.has(text)) return false;
-						seen.add(text);
-						return true;
-					});
-				}
-			}
-		}
-		tree.children = tree.children.filter((node) => {
-			if (node.type === "list") return node.children.length > 0;
-			return true;
-		});
-	};
-};
-
-//#endregion
-export { DeduplicateItemsPlugin };

package/changesets/remark/plugins/issue-link-refs.js

@@ -1,58 +0,0 @@
-import { getVersionBlocks } from "../../utils/version-blocks.js";
-import { SKIP, visit } from "unist-util-visit";
-
-//#region src/changesets/remark/plugins/issue-link-refs.ts
-/**
-* Pattern matching issue numbers like `#123`.
-*
-* @internal
-*/
-const ISSUE_RE = /^#\d+$/;
-const IssueLinkRefsPlugin = () => {
-	return (tree) => {
-		const blocks = getVersionBlocks(tree);
-		for (let b = blocks.length - 1; b >= 0; b--) {
-			const block = blocks[b];
-			const definitions = /* @__PURE__ */ new Map();
-			for (let i = block.startIndex; i < block.endIndex; i++) {
-				const node = tree.children[i];
-				visit(node, "link", (linkNode, index, parent) => {
-					if (!parent || index === void 0) return;
-					if (linkNode.children.length !== 1 || linkNode.children[0].type !== "text") return;
-					const text = linkNode.children[0].value;
-					if (!ISSUE_RE.test(text)) return;
-					const label = text;
-					if (!definitions.has(label)) definitions.set(label, {
-						label,
-						url: linkNode.url
-					});
-					const ref = {
-						type: "linkReference",
-						identifier: label,
-						label,
-						referenceType: "full",
-						children: [{
-							type: "text",
-							value: label
-						}]
-					};
-					parent.children[index] = ref;
-					return SKIP;
-				});
-			}
-			if (definitions.size === 0) continue;
-			const defNodes = [...definitions.values()].sort((a, b) => {
-				return Number.parseInt(a.label.slice(1), 10) - Number.parseInt(b.label.slice(1), 10);
-			}).map((def) => ({
-				type: "definition",
-				identifier: def.label,
-				label: def.label,
-				url: def.url
-			}));
-			tree.children.splice(block.endIndex, 0, ...defNodes);
-		}
-	};
-};
-
-//#endregion
-export { IssueLinkRefsPlugin };

package/changesets/remark/plugins/maintenance-note.js

@@ -1,75 +0,0 @@
-import { getHeadingText, getVersionBlocks } from "../../utils/version-blocks.js";
-import { toString } from "mdast-util-to-string";
-
-//#region src/changesets/remark/plugins/maintenance-note.ts
-/**
-* Placeholder sentence `@changesets/apply-release-plan` (>= 8.1.0) emits as the
-* body of a version block that would otherwise render as a bare heading. Older
-* engine versions left such a block structurally empty.
-*/
-const ENGINE_PLACEHOLDER = "No changes in this release.";
-/** True when the block's only content is the engine's empty-release placeholder. */
-function isPlaceholderOnly(tree, block) {
-	if (block.endIndex - block.startIndex !== 1) return false;
-	const node = tree.children[block.startIndex];
-	return node.type === "paragraph" && toString(node).trim() === ENGINE_PLACEHOLDER;
-}
-function buildNoteChildren(reason) {
-	if (reason.kind === "unspecified" || reason.triggers.length === 0) return [{
-		type: "text",
-		value: "Version-only release to keep workspace versions consistent; no changes to this package."
-	}];
-	const label = reason.kind === "fixed" ? "fixed version group" : "linked version group";
-	const children = [{
-		type: "text",
-		value: "Released in lockstep with "
-	}];
-	reason.triggers.forEach((trigger, index) => {
-		if (index > 0) children.push({
-			type: "text",
-			value: ", "
-		});
-		children.push({
-			type: "inlineCode",
-			value: `${trigger.name}@${trigger.version}`
-		});
-	});
-	children.push({
-		type: "text",
-		value: ` (${label}).`
-	});
-	return children;
-}
-const MaintenanceNotePlugin = (options) => {
-	return (tree) => {
-		const block = getVersionBlocks(tree).find((b) => getHeadingText(tree.children[b.headingIndex]) === options.version);
-		if (!block) return;
-		const placeholderOnly = isPlaceholderOnly(tree, block);
-		if (block.endIndex > block.startIndex && !placeholderOnly) return;
-		const heading = {
-			type: "heading",
-			depth: 3,
-			children: [{
-				type: "text",
-				value: "Maintenance"
-			}]
-		};
-		const list = {
-			type: "list",
-			ordered: false,
-			spread: false,
-			children: [{
-				type: "listItem",
-				spread: false,
-				children: [{
-					type: "paragraph",
-					children: buildNoteChildren(options.reason)
-				}]
-			}]
-		};
-		tree.children.splice(block.startIndex, placeholderOnly ? 1 : 0, heading, list);
-	};
-};
-
-//#endregion
-export { MaintenanceNotePlugin };

package/changesets/remark/plugins/merge-sections.js

@@ -1,43 +0,0 @@
-import { fromHeading } from "../../categories/index.js";
-import { getBlockSections, getHeadingText, getVersionBlocks } from "../../utils/version-blocks.js";
-
-//#region src/changesets/remark/plugins/merge-sections.ts
-const MergeSectionsPlugin = () => {
-	return (tree) => {
-		const blocks = getVersionBlocks(tree);
-		for (let b = blocks.length - 1; b >= 0; b--) {
-			const sections = getBlockSections(tree, blocks[b]);
-			if (sections.length <= 1) continue;
-			const groups = /* @__PURE__ */ new Map();
-			for (let s = 0; s < sections.length; s++) {
-				const text = getHeadingText(sections[s].heading);
-				const category = fromHeading(text);
-				const key = category ? category.heading.toLowerCase() : text.toLowerCase();
-				const existing = groups.get(key);
-				if (existing) existing.push(s);
-				else groups.set(key, [s]);
-			}
-			const indicesToRemove = [];
-			for (const indices of groups.values()) {
-				if (indices.length <= 1) continue;
-				const target = sections[indices[0]];
-				const targetEndIndex = target.headingIndex + 1 + target.contentNodes.length;
-				const mergedContent = [];
-				for (let d = 1; d < indices.length; d++) {
-					const dup = sections[indices[d]];
-					mergedContent.push(...dup.contentNodes);
-					indicesToRemove.push(dup.headingIndex);
-					for (let c = 0; c < dup.contentNodes.length; c++) indicesToRemove.push(dup.headingIndex + 1 + c);
-				}
-				tree.children.splice(targetEndIndex, 0, ...mergedContent);
-				const shift = mergedContent.length;
-				for (let r = 0; r < indicesToRemove.length; r++) if (indicesToRemove[r] >= targetEndIndex) indicesToRemove[r] += shift;
-			}
-			indicesToRemove.sort((a, b) => b - a);
-			for (const idx of indicesToRemove) tree.children.splice(idx, 1);
-		}
-	};
-};
-
-//#endregion
-export { MergeSectionsPlugin };

package/changesets/remark/plugins/normalize-format.js

@@ -1,47 +0,0 @@
-import { getVersionBlocks } from "../../utils/version-blocks.js";
-import { toString } from "mdast-util-to-string";
-
-//#region src/changesets/remark/plugins/normalize-format.ts
-/**
-* Check if a node is a heading at one of the given depths.
-*
-* @param node - The AST node to check
-* @param depths - Allowed heading depths
-* @returns `true` if the node is a heading at one of the specified depths
-*
-* @internal
-*/
-function isHeadingAtDepth(node, depths) {
-	return node.type === "heading" && depths.includes(node.depth);
-}
-const NormalizeFormatPlugin = () => {
-	return (tree) => {
-		const blocks = getVersionBlocks(tree);
-		const indicesToRemove = /* @__PURE__ */ new Set();
-		for (const block of blocks) for (let i = block.startIndex; i < block.endIndex; i++) {
-			const node = tree.children[i];
-			if (node.type === "list" && node.children.length === 0) {
-				indicesToRemove.add(i);
-				continue;
-			}
-			if (!isHeadingAtDepth(node, [3])) continue;
-			let hasContent = false;
-			for (let j = i + 1; j < block.endIndex; j++) {
-				const next = tree.children[j];
-				if (next.type === "paragraph" && toString(next).trim() === "") {
-					indicesToRemove.add(j);
-					continue;
-				}
-				if (isHeadingAtDepth(next, [2, 3])) break;
-				hasContent = true;
-				break;
-			}
-			if (!hasContent) indicesToRemove.add(i);
-		}
-		const sorted = [...indicesToRemove].sort((a, b) => b - a);
-		for (const idx of sorted) tree.children.splice(idx, 1);
-	};
-};
-
-//#endregion
-export { NormalizeFormatPlugin };

package/changesets/remark/plugins/reorder-sections.js

@@ -1,49 +0,0 @@
-import { fromHeading } from "../../categories/index.js";
-import { getBlockSections, getHeadingText, getVersionBlocks } from "../../utils/version-blocks.js";
-
-//#region src/changesets/remark/plugins/reorder-sections.ts
-/**
-* Default priority for unrecognized headings (sorts after all known categories).
-*
-* @internal
-*/
-const UNKNOWN_PRIORITY = 999;
-/**
-* Priority for the `Thanks` section emitted by {@link ContributorFootnotesPlugin}.
-* Sorts after everything — including unknown headings — so the contributor
-* credits always close the version block.
-*
-* @internal
-*/
-const THANKS_PRIORITY = 1e3;
-/**
-* Resolve the sort priority for a section heading.
-*
-* @internal
-*/
-function headingPriority(text) {
-	if (text.trim().toLowerCase() === "thanks") return THANKS_PRIORITY;
-	return fromHeading(text)?.priority ?? UNKNOWN_PRIORITY;
-}
-const ReorderSectionsPlugin = () => {
-	return (tree) => {
-		const blocks = getVersionBlocks(tree);
-		for (let b = blocks.length - 1; b >= 0; b--) {
-			const block = blocks[b];
-			const sections = getBlockSections(tree, block);
-			if (sections.length <= 1) continue;
-			const preamble = [];
-			for (let i = block.startIndex; i < block.endIndex; i++) if (i < sections[0].headingIndex) preamble.push(tree.children[i]);
-			else break;
-			const sorted = [...sections].sort((a, b) => headingPriority(getHeadingText(a.heading)) - headingPriority(getHeadingText(b.heading)));
-			if (sorted.every((s, i) => s.headingIndex === sections[i].headingIndex)) continue;
-			const newChildren = [...preamble];
-			for (const section of sorted) newChildren.push(section.heading, ...section.contentNodes);
-			const blockLength = block.endIndex - block.startIndex;
-			tree.children.splice(block.startIndex, blockLength, ...newChildren);
-		}
-	};
-};
-
-//#endregion
-export { ReorderSectionsPlugin };