@codefast/cli 0.3.13-canary.2 → 0.3.13-canary.4

package/dist/lib/arrange/domain/constants.domain.mjs

@@ -0,0 +1,154 @@
+//#region src/lib/arrange/domain/constants.domain.ts
+/** Analyze report: long literal threshold (token count). */ const LONG_STRING_TOKEN_THRESHOLD = 18;
+/**
+* Minimum token count for a string to be considered a candidate for grouping
+* in the apply/preview pipeline. Intentionally much lower than
+* {@link LONG_STRING_TOKEN_THRESHOLD} (analyze only).
+*/ const APPLY_MIN_TOKENS = 2;
+/**
+* Minimum tokens a group must have to stand alone before singleton-merging.
+* Set to 2 so single-token groups are not collapsed into unrelated buckets by the merger.
+*/ const MIN_GROUP_TOKENS = 2;
+/** Dynamic max groups clamp: base bound. */ const MAX_GROUPS_BASE = 4;
+/** Dynamic max groups clamp: upper cap. */ const MAX_GROUPS_CAP = 24;
+/**
+* Extra slots so a few state / aria groups do not force `capGroups` to merge
+* unrelated buckets (e.g. `bg-border` + `outline-hidden`).
+*/ const MAX_GROUPS_HEADROOM = 2;
+/** Maximum findings printed per category in the analyze report. */ const MAX_REPORT_LINES = 40;
+/** Maximum recursion depth when traversing `tv()` object literals. */ const MAX_OBJECT_DEPTH = 12;
+/** Maximum depth when peeling conditional / parens / arrays inside `cn(...)` args. */ const MAX_CLASS_EXPR_DEPTH = 12;
+/**
+* Maximum variant-stripping passes in {@link stripVariants}.
+* Real-world Tailwind stacks rarely exceed 4–5 segments (e.g. `@md/sidebar:group-hover:dark:focus-visible:`);
+* 12 is a conservative safety cap that prevents runaway loops on malformed input.
+*/ const MAX_STRIP_VARIANT_PASSES = 12;
+/**
+* Passed when optional `knownBindings` is missing — size 0 disables matching
+* for `cn` / `tv` identifier resolution.
+*/ const EMPTY_CN_TV_BINDINGS = /* @__PURE__ */ new Set();
+/**
+* Bucket sort order — **render pipeline** (lower → earlier in `cn()` output).
+*
+* Matches README: Existence → Position → Layout → Sizing → Spacing → Shape → Background
+* → Shadow → Typography → Composite → Motion → Starting → Behavior → State → Selector,
+* then `other` and `arbitrary` as sort tails for unknown utilities and arbitrary properties.
+*/ const BUCKET_ORDER = {
+	existence: 0,
+	position: 1,
+	layout: 2,
+	sizing: 3,
+	spacing: 4,
+	shape: 5,
+	background: 6,
+	shadow: 7,
+	typography: 8,
+	composite: 9,
+	motion: 10,
+	starting: 11,
+	behavior: 12,
+	state: 13,
+	selector: 14,
+	other: 15,
+	arbitrary: 16
+};
+/**
+* Compatible bucket **pairs** — two adjacent tokens whose buckets appear in the same
+* `Set` may stay in one `cn()` string chunk. Compatibility is **not transitive**: there is
+* no `{position, sizing}` pair, so `fixed inset-0` and `overflow-auto` become **separate**
+* literals unless **layout** tokens sit between them in sorted order; then
+* `position↔layout` and `layout↔sizing` each justify one hop and the whole “box in flow”
+* (place + tracks + scrollport) stays in one chunk — co-located because they jointly define
+* stacking and scroll behavior for the same surface.
+*/ const COMPATIBLE_BUCKET_SETS = [
+	new Set(["existence", "position"]),
+	new Set(["existence", "layout"]),
+	new Set(["position", "layout"]),
+	new Set(["layout", "sizing"]),
+	new Set(["shape", "shadow"]),
+	new Set(["background", "shadow"]),
+	new Set(["background", "typography"]),
+	new Set(["layout", "typography"]),
+	new Set(["sizing", "typography"]),
+	new Set(["motion", "behavior"]),
+	new Set(["motion", "starting"]),
+	new Set(["composite", "motion"]),
+	new Set(["sizing", "composite"]),
+	new Set(["sizing", "spacing"])
+];
+/**
+* Responsive / variant prefix — Tailwind v4 aware.
+*
+* v3: sm: md: … — v4: @sm:, @min-[600px]:, @[480px]:, named @md/sidebar:,
+* viewport md/sidebar:, min-[100px]: / max-[100px]:, …
+*/ const RESPONSIVE_PREFIX = /^(?:@(?:min|max)-\[[^\]]+\]:|@\[[^\]]+\]:|@(?:[a-z0-9]+(?:-[a-z0-9]+)*)(?:\/[a-z][a-z0-9-]*)?:|(?:max-|min-)?(?:sm|md|lg|xl|2xl|3xl)(?:\/[a-z][a-z0-9-]*)?:|(?:max-|min-)\[[^\]]+\]:)/;
+/** State variant stems — hoisted to module scope (not recreated per call). */ const STATE_PREFIXES = new Set([
+	"hover",
+	"focus",
+	"focus-within",
+	"focus-visible",
+	"active",
+	"visited",
+	"link",
+	"any-link",
+	"disabled",
+	"enabled",
+	"checked",
+	"indeterminate",
+	"required",
+	"optional",
+	"valid",
+	"invalid",
+	"in-range",
+	"out-of-range",
+	"read-only",
+	"read-write",
+	"placeholder-shown",
+	"default",
+	"autofill",
+	"open",
+	"closed",
+	"first",
+	"last",
+	"only",
+	"odd",
+	"even",
+	"first-of-type",
+	"last-of-type",
+	"only-of-type",
+	"first-child",
+	"last-child",
+	"only-child",
+	"empty",
+	"target",
+	"group",
+	"peer",
+	"aria",
+	"data",
+	"dark",
+	"light",
+	"supports",
+	"motion-reduce",
+	"motion-safe",
+	"print",
+	"screen",
+	"ltr",
+	"rtl",
+	"not",
+	"has",
+	"in",
+	"nth",
+	"file",
+	"selection",
+	"marker",
+	"placeholder",
+	"before",
+	"after",
+	"first-line",
+	"first-letter",
+	"backdrop",
+	"details-content",
+	"popover-open"
+]);
+//#endregion
+export { APPLY_MIN_TOKENS, BUCKET_ORDER, COMPATIBLE_BUCKET_SETS, EMPTY_CN_TV_BINDINGS, LONG_STRING_TOKEN_THRESHOLD, MAX_CLASS_EXPR_DEPTH, MAX_GROUPS_BASE, MAX_GROUPS_CAP, MAX_GROUPS_HEADROOM, MAX_OBJECT_DEPTH, MAX_REPORT_LINES, MAX_STRIP_VARIANT_PASSES, MIN_GROUP_TOKENS, RESPONSIVE_PREFIX, STATE_PREFIXES };

package/dist/lib/arrange/domain/errors.domain.mjs

@@ -0,0 +1,18 @@
+//#region src/lib/arrange/domain/errors.domain.ts
+/**
+* Structured errors for the arrange CLI library (throw from lib; handle exit in commands).
+*/ const ArrangeErrorCode = {
+	TARGET_NOT_FOUND: "TARGET_NOT_FOUND",
+	INVALID_INPUT: "INVALID_INPUT",
+	INTERNAL: "INTERNAL"
+};
+var ArrangeError = class extends Error {
+	code;
+	constructor(code, message, options) {
+		super(message, options);
+		this.name = "ArrangeError";
+		this.code = code;
+	}
+};
+//#endregion
+export { ArrangeError, ArrangeErrorCode };

package/dist/lib/arrange/domain/grouping.domain.mjs

@@ -0,0 +1,306 @@
+import { BUCKET_ORDER } from "./constants.domain.mjs";
+import { bucketsCompatible, bucketsMergeCompatible, classifyToken, compositeSecondaryOrder, selectorKey, stateKey, stripVariants, tokenizeClassString } from "./tokenizer.util.mjs";
+//#region src/lib/arrange/domain/grouping.domain.ts
+/**
+* `cn()` grouping: bucket sequence is {@link BUCKET_ORDER} only; tokens are classified with
+* {@link classifyToken}. Comparators here (`compareClassifiedTailwindTokensForCnGrouping`, …)
+* are the single place for variant-aware sort — do not reintroduce parallel bucket ordering.
+*/ /** Separates bucket id from variant key in {@link buildFirstVariantKeySourceIndex} map keys. */ const VARIANT_BUCKET_KEY_SEP = "\0";
+function isVariantKeyedBucket(bucket) {
+	return bucket === "selector" || bucket === "state" || bucket === "starting";
+}
+function variantGroupKey(bucket, classToken) {
+	return bucket === "selector" ? selectorKey(classToken) : stateKey(classToken);
+}
+function variantKeyedBlockMapKey(bucket, classToken) {
+	return `${bucket}${VARIANT_BUCKET_KEY_SEP}${variantGroupKey(bucket, classToken)}`;
+}
+/**
+* Deterministic lexicographic order for Tailwind class tokens (and token-space signatures).
+* Used wherever we need stable, locale-agnostic ASCII ordering of utility strings.
+*/ function compareClassTokensCanonically(left, right) {
+	return left.localeCompare(right);
+}
+/**
+* First source index where each `(bucket, variantGroupKey)` appears — drives stable clustering
+* in {@link suggestCnGroups} without reordering unrelated variant blocks by alphabet alone.
+*/ function buildFirstVariantKeySourceIndex(classified) {
+	const firstVariantKeySourceIndex = /* @__PURE__ */ new Map();
+	for (const item of classified) {
+		if (!isVariantKeyedBucket(item.bucket)) continue;
+		const mapKey = variantKeyedBlockMapKey(item.bucket, item.classToken);
+		const prior = firstVariantKeySourceIndex.get(mapKey);
+		if (prior === void 0 || item.index < prior) firstVariantKeySourceIndex.set(mapKey, item.index);
+	}
+	return firstVariantKeySourceIndex;
+}
+function compareClassifiedTailwindTokensForCnGrouping(left, right, firstVariantKeySourceIndex) {
+	const bucketOrderDiff = BUCKET_ORDER[left.bucket] - BUCKET_ORDER[right.bucket];
+	if (bucketOrderDiff !== 0) return bucketOrderDiff;
+	if (left.bucket === "composite" && right.bucket === "composite") {
+		const compositeOrderDiff = compositeSecondaryOrder(stripVariants(left.classToken)) - compositeSecondaryOrder(stripVariants(right.classToken));
+		if (compositeOrderDiff !== 0) return compositeOrderDiff;
+		return left.index - right.index;
+	}
+	if (isVariantKeyedBucket(left.bucket) && isVariantKeyedBucket(right.bucket)) {
+		const leftMapKey = variantKeyedBlockMapKey(left.bucket, left.classToken);
+		const rightMapKey = variantKeyedBlockMapKey(right.bucket, right.classToken);
+		const leftBlockStart = firstVariantKeySourceIndex.get(leftMapKey);
+		const rightBlockStart = firstVariantKeySourceIndex.get(rightMapKey);
+		if (leftBlockStart === void 0 || rightBlockStart === void 0) throw new Error("invariant: variant-keyed token missing block start index");
+		if (leftBlockStart !== rightBlockStart) return leftBlockStart - rightBlockStart;
+		const variantKeyCompare = compareClassTokensCanonically(variantGroupKey(left.bucket, left.classToken), variantGroupKey(right.bucket, right.classToken));
+		if (variantKeyCompare !== 0) return variantKeyCompare;
+		return compareClassTokensCanonically(left.classToken, right.classToken);
+	}
+	return left.index - right.index;
+}
+/**
+* True when `staticLiteralTexts` carries the **same partition** of Tailwind tokens as
+* `suggestedGroups` from {@link suggestCnGroups}, ignoring order of arguments and
+* order of tokens within each chunk.
+*/ function areCnTailwindPartitionsEquivalent(staticLiteralTexts, suggestedGroups) {
+	const partitionSignatures = (chunks) => chunks.map((chunk) => {
+		const classTokens = tokenizeClassString(chunk);
+		return classTokens.length === 0 ? "" : [...classTokens].sort(compareClassTokensCanonically).join(" ");
+	}).filter((s) => s.length > 0).sort(compareClassTokensCanonically);
+	const staticPartitionSigs = partitionSignatures(staticLiteralTexts);
+	const suggestedPartitionSigs = partitionSignatures(suggestedGroups);
+	if (staticPartitionSigs.length !== suggestedPartitionSigs.length) return false;
+	for (let i = 0; i < staticPartitionSigs.length; i++) if (staticPartitionSigs[i] !== suggestedPartitionSigs[i]) return false;
+	return true;
+}
+/** Dominant bucket of a whitespace-delimited class group (for merge heuristics). */ function dominantBucketOfGroup(groupStr) {
+	const counts = /* @__PURE__ */ new Map();
+	for (const classToken of tokenizeClassString(groupStr)) {
+		const tokenBucket = classifyToken(classToken);
+		counts.set(tokenBucket, (counts.get(tokenBucket) ?? 0) + 1);
+	}
+	let best = "other";
+	let bestN = 0;
+	for (const [bucket, count] of counts) {
+		if (count > bestN) {
+			best = bucket;
+			bestN = count;
+			continue;
+		}
+		if (count === bestN && BUCKET_ORDER[bucket] < BUCKET_ORDER[best]) best = bucket;
+	}
+	return best;
+}
+/** Dynamic cap: more tokens → allow more groups, within [BASE, CAP]. */ function dynamicMaxGroups(tokenCount) {
+	const byTokens = Math.ceil(tokenCount / 2) + 2;
+	return Math.max(4, Math.min(24, byTokens));
+}
+/**
+* Merge singleton groups (< MIN_GROUP_TOKENS tokens) into their nearest
+* neighbour. Prefers merging toward a bucket-compatible neighbor.
+*
+* Loop termination: each iteration either splices one element (shrinking the
+* array, guaranteeing progress) or finds no singleton that can merge and exits
+* via `changed = false`. Two mutually-incompatible singletons both hit
+* `continue` and `changed` stays false, so the loop exits without spinning.
+*/ function mergeSingletons(groups) {
+	if (groups.length <= 1) return groups;
+	const result = [...groups];
+	let changed = true;
+	while (changed) {
+		changed = false;
+		for (let i = 0; i < result.length; i++) {
+			const groupAtI = result[i];
+			if (groupAtI === void 0) throw new Error("invariant: mergeSingletons group missing");
+			if (tokenizeClassString(groupAtI).length < 2) {
+				if (result.length === 1) break;
+				const myBucket = dominantBucketOfGroup(groupAtI);
+				const prevGroup = i > 0 ? result[i - 1] : void 0;
+				const nextGroup = i < result.length - 1 ? result[i + 1] : void 0;
+				const prevCompat = prevGroup !== void 0 && bucketsMergeCompatible(myBucket, dominantBucketOfGroup(prevGroup));
+				const nextCompat = nextGroup !== void 0 && bucketsMergeCompatible(myBucket, dominantBucketOfGroup(nextGroup));
+				let mergeDir;
+				if (nextCompat && !prevCompat) mergeDir = "forward";
+				else if (prevCompat && !nextCompat) mergeDir = "backward";
+				else if (prevCompat && nextCompat) mergeDir = i < result.length - 1 ? "forward" : "backward";
+				else continue;
+				if (mergeDir === "forward") {
+					if (nextGroup === void 0) throw new Error("invariant: forward merge missing right group");
+					result[i + 1] = `${groupAtI} ${nextGroup}`;
+				} else {
+					if (prevGroup === void 0) throw new Error("invariant: backward merge missing left group");
+					result[i - 1] = `${prevGroup} ${groupAtI}`;
+				}
+				result.splice(i, 1);
+				changed = true;
+				break;
+			}
+		}
+	}
+	return result;
+}
+/** Tie-break when two merge candidates are both {@link bucketsMergeCompatible} (same bucket or COMPATIBLE_BUCKET_SETS). */ function capMergePenalty(leftBucket, rightBucket) {
+	if (leftBucket === rightBucket) return 0;
+	if (bucketsCompatible(leftBucket, rightBucket)) return 0;
+	return 500;
+}
+/**
+* Merge adjacent groups until total count ≤ maxGroups.
+* Only merges pairs allowed by {@link bucketsMergeCompatible} — never glues incompatible
+* buckets (which previously defaulted to penalty 0 and merged layout+state when over cap).
+*
+* Complexity: O(n²) in the number of groups — each merge pass scans all remaining adjacent
+* pairs. In practice `n` is bounded by {@link MAX_GROUPS_CAP} (24) and typical class strings
+* are well below that, so this is not a concern for the current usage pattern. If this ever
+* runs in a high-throughput batch mode, consider a priority-queue approach.
+*/ function capGroups(groups, maxGroups) {
+	const result = [...groups];
+	const lengths = result.map((groupStr) => tokenizeClassString(groupStr).length);
+	while (result.length > maxGroups) {
+		const mergePairCandidates = [];
+		for (let i = 0; i < result.length - 1; i++) {
+			const leftGroup = result[i];
+			const rightGroup = result[i + 1];
+			const leftLen = lengths[i];
+			const rightLen = lengths[i + 1];
+			if (leftGroup === void 0 || rightGroup === void 0 || leftLen === void 0 || rightLen === void 0) throw new Error("invariant: capGroups adjacent pair missing");
+			const dominantLeft = dominantBucketOfGroup(leftGroup);
+			const dominantRight = dominantBucketOfGroup(rightGroup);
+			if (!bucketsMergeCompatible(dominantLeft, dominantRight)) continue;
+			mergePairCandidates.push({
+				i,
+				size: leftLen + rightLen,
+				penalty: capMergePenalty(dominantLeft, dominantRight)
+			});
+		}
+		if (mergePairCandidates.length === 0) break;
+		const firstCandidate = mergePairCandidates[0];
+		if (firstCandidate === void 0) throw new Error("invariant: merge candidates empty");
+		let best = firstCandidate;
+		for (const candidate of mergePairCandidates) if (candidate.penalty < best.penalty || candidate.penalty === best.penalty && candidate.size < best.size) best = candidate;
+		const bestIdx = best.i;
+		const leftMerge = result[bestIdx];
+		const rightMerge = result[bestIdx + 1];
+		const leftMergeLen = lengths[bestIdx];
+		const rightMergeLen = lengths[bestIdx + 1];
+		if (leftMerge === void 0 || rightMerge === void 0 || leftMergeLen === void 0 || rightMergeLen === void 0) throw new Error("invariant: capGroups best merge pair missing");
+		result[bestIdx] = `${leftMerge} ${rightMerge}`;
+		lengths[bestIdx] = leftMergeLen + rightMergeLen;
+		result.splice(bestIdx + 1, 1);
+		lengths.splice(bestIdx + 1, 1);
+	}
+	return result;
+}
+/**
+* If a chunk is **only** bare `ease-*` timing (Motion), buffer it and prepend to the **first**
+* **later** chunk that is predominantly `state` **and** contains some `animate-*` utility —
+* skipping intermediate `state` chunks (`sm:…`, `group-data-[…]:…`, etc.) that sit between
+* `ease-ui` and `data-open:animate-*`. If no such chunk exists, the ease chunk is left as-is.
+*/ function mergeEaseTimingIntoFollowingAnimatedState(groups) {
+	const result = [...groups];
+	let changed = true;
+	while (changed) {
+		changed = false;
+		for (let i = 0; i < result.length; i++) {
+			const chunkI = result[i];
+			if (chunkI === void 0) throw new Error("invariant: mergeEase chunk missing");
+			if (!chunkIsOnlyEaseTimingMotion(chunkI)) continue;
+			const easeStr = chunkI;
+			let target = -1;
+			for (let j = i + 1; j < result.length; j++) {
+				const chunkJ = result[j];
+				if (chunkJ === void 0) throw new Error("invariant: mergeEase following chunk missing");
+				if (dominantBucketOfGroup(chunkJ) !== "state") continue;
+				if (!tokenizeClassString(chunkJ).some((classToken) => /^animate/.test(stripVariants(classToken)))) continue;
+				target = j;
+				break;
+			}
+			if (target === -1) continue;
+			const targetChunk = result[target];
+			if (targetChunk === void 0) throw new Error("invariant: mergeEase target chunk missing");
+			result[target] = `${easeStr} ${targetChunk}`.trim();
+			result.splice(i, 1);
+			changed = true;
+			break;
+		}
+	}
+	return result;
+}
+function chunkIsOnlyEaseTimingMotion(groupStr) {
+	const classTokens = tokenizeClassString(groupStr);
+	if (classTokens.length === 0) return false;
+	return classTokens.every((classToken) => classifyToken(classToken) === "motion" && /^ease-/.test(stripVariants(classToken)));
+}
+function suggestCnGroups(classString) {
+	const tokens = tokenizeClassString(classString);
+	if (tokens.length === 0) return [];
+	/**
+	* Variant-keyed buckets (`state`, `starting`, `selector`): after global bucket ordering,
+	* cluster tokens that share the same {@link variantGroupKey} so the same modifier stack
+	* (e.g. `focus-visible:`) merges one `cn()` arg regardless of interleaved unrelated
+	* variants. Block order follows the **first source index** of each key so unrelated
+	* states keep document order; within a key, `classToken` order is lexicographic for
+	* idempotency.
+	*/ const classified = tokens.map((classToken, index) => ({
+		classToken,
+		bucket: classifyToken(classToken),
+		index
+	}));
+	const firstVariantKeySourceIndex = buildFirstVariantKeySourceIndex(classified);
+	classified.sort((left, right) => compareClassifiedTailwindTokensForCnGrouping(left, right, firstVariantKeySourceIndex));
+	const rawGroups = [];
+	/** Bucket of the last token already placed in the current run (pairwise compat with `COMPATIBLE_BUCKET_SETS`). */ let lastBucketInRun = null;
+	let currentStateKey = null;
+	let currentTokens = [];
+	const flush = () => {
+		if (currentTokens.length > 0) {
+			rawGroups.push(currentTokens.join(" "));
+			currentTokens = [];
+		}
+		lastBucketInRun = null;
+		currentStateKey = null;
+	};
+	for (const { classToken, bucket: tokenBucket } of classified) {
+		if (lastBucketInRun === null) {
+			lastBucketInRun = tokenBucket;
+			currentStateKey = isVariantKeyedBucket(tokenBucket) ? variantGroupKey(tokenBucket, classToken) : null;
+			currentTokens.push(classToken);
+			continue;
+		}
+		if (isVariantKeyedBucket(tokenBucket)) {
+			const key = variantGroupKey(tokenBucket, classToken);
+			if (currentStateKey !== null && key !== currentStateKey) {
+				flush();
+				lastBucketInRun = tokenBucket;
+				currentStateKey = key;
+				currentTokens.push(classToken);
+				continue;
+			}
+		}
+		if (!bucketsCompatible(tokenBucket, lastBucketInRun)) {
+			flush();
+			lastBucketInRun = tokenBucket;
+			currentStateKey = isVariantKeyedBucket(tokenBucket) ? variantGroupKey(tokenBucket, classToken) : null;
+			currentTokens.push(classToken);
+			continue;
+		}
+		if (isVariantKeyedBucket(tokenBucket)) currentStateKey = variantGroupKey(tokenBucket, classToken);
+		else if (currentStateKey !== null) currentStateKey = null;
+		lastBucketInRun = tokenBucket;
+		currentTokens.push(classToken);
+	}
+	flush();
+	const withEaseMerged = mergeEaseTimingIntoFollowingAnimatedState(mergeSingletons(rawGroups));
+	return capGroups(withEaseMerged, Math.max(dynamicMaxGroups(tokens.length), withEaseMerged.length));
+}
+/**
+* One label per suggested group: a single bucket name, or `mixed:a+b` when that chunk
+* spans multiple Tailwind buckets (matches `codefast arrange group` stdout).
+*/ function summarizeGroupBucketLabels(groups) {
+	return groups.map((g) => {
+		const uniq = new Set(tokenizeClassString(g).map(classifyToken));
+		if (uniq.size !== 1) return `mixed:${[...uniq].sort(compareClassTokensCanonically).join("+")}`;
+		const onlyBucket = [...uniq][0];
+		if (onlyBucket === void 0) return `mixed:${[...uniq].sort(compareClassTokensCanonically).join("+")}`;
+		return onlyBucket;
+	});
+}
+//#endregion
+export { areCnTailwindPartitionsEquivalent, capGroups, mergeEaseTimingIntoFollowingAnimatedState, mergeSingletons, suggestCnGroups, summarizeGroupBucketLabels };

package/dist/lib/arrange/domain/imports.domain.mjs

@@ -0,0 +1,55 @@
+import { isDomainImportDeclaration, isDomainNamedImports, isDomainStringLiteral } from "./ast/ast-node.model.mjs";
+//#region src/lib/arrange/domain/imports.domain.ts
+function sourceFileImportsCn(sourceFile) {
+	for (const statement of sourceFile.statements) {
+		if (!isDomainImportDeclaration(statement) || !statement.importClause) continue;
+		const clause = statement.importClause;
+		if (clause.name?.text === "cn") return true;
+		if (clause.namedBindings && isDomainNamedImports(clause.namedBindings)) {
+			for (const importedBinding of clause.namedBindings.elements) if (importedBinding.name.text === "cn") return true;
+		}
+	}
+	return false;
+}
+/**
+* Resolve the module specifier used when injecting a `cn` import into a file.
+*/ function cnModuleSpecifierForFile(filePath, override) {
+	if (override) return override;
+	return "@codefast/tailwind-variants";
+}
+function findImportDeclarationFromModule(sourceFile, moduleSpecifier) {
+	for (const statement of sourceFile.statements) {
+		if (!isDomainImportDeclaration(statement)) continue;
+		const spec = statement.moduleSpecifier;
+		if (isDomainStringLiteral(spec) && spec.text === moduleSpecifier) return statement;
+	}
+}
+function ensureCnImport(sourceFile, cnImportOverride) {
+	const sourceText = sourceFile.text;
+	if (sourceFileImportsCn(sourceFile)) return sourceText;
+	const moduleSpecifier = cnModuleSpecifierForFile(sourceFile.fileName, cnImportOverride);
+	const decl = findImportDeclarationFromModule(sourceFile, moduleSpecifier);
+	if (decl?.importClause && !decl.importClause.isTypeOnly && decl.importClause.namedBindings && isDomainNamedImports(decl.importClause.namedBindings)) {
+		const elements = decl.importClause.namedBindings.elements;
+		if (elements.length > 0) {
+			const firstElement = elements[0];
+			if (firstElement === void 0) return sourceText;
+			const pos = firstElement.pos;
+			return `${sourceText.slice(0, pos)}cn, ${sourceText.slice(pos)}`;
+		}
+	}
+	const importLine = `import { cn } from "${moduleSpecifier}";`;
+	let firstImport = -1;
+	for (const statement of sourceFile.statements) if (isDomainImportDeclaration(statement)) {
+		firstImport = statement.pos;
+		break;
+	}
+	const useClient = /^["']use client["'];?\s*\r?\n/.exec(sourceText);
+	let insertAt;
+	if (useClient) insertAt = useClient[0].length;
+	else if (firstImport !== -1) insertAt = firstImport;
+	else insertAt = 0;
+	return `${sourceText.slice(0, insertAt)}${importLine}\n${sourceText.slice(insertAt)}`;
+}
+//#endregion
+export { cnModuleSpecifierForFile, ensureCnImport };

package/dist/lib/arrange/domain/source-text-formatters.formatter.mjs

@@ -0,0 +1,54 @@
+import { indentOfLineContaining } from "../../shared/source-code/domain/text-edit.model.mjs";
+//#region src/lib/arrange/domain/source-text-formatters.formatter.ts
+function escapeTsStringLiteralContent(group) {
+	return group.replaceAll("\\", "\\\\").replaceAll("\"", "\\\"");
+}
+/**
+* Multiline fragment for use *inside* an existing `cn(...)` — replaces one
+* string argument with several, without producing `cn(cn(...))`.
+*/ function formatCnArguments(groups, options) {
+	const indent = options?.indent ?? "  ";
+	const commaAfterLast = options?.commaAfterLastGroup ?? options?.trailingClassName ?? false;
+	const lines = [];
+	for (let i = 0; i < groups.length; i++) {
+		const group = groups[i];
+		if (group === void 0) throw new Error("invariant: formatCnArguments group missing");
+		const comma = i < groups.length - 1 || commaAfterLast ? "," : "";
+		lines.push(`${indent}"${escapeTsStringLiteralContent(group)}"${comma}`);
+	}
+	if (options?.trailingClassName) lines.push(`${indent}className,`);
+	return lines.join("\n");
+}
+function formatCnCall(groups, options) {
+	const lines = ["cn("];
+	const commaOnEachStringLine = groups.length > 1 || Boolean(options?.trailingClassName);
+	for (let i = 0; i < groups.length; i++) {
+		const group = groups[i];
+		if (group === void 0) throw new Error("invariant: formatCnCall group missing");
+		const comma = commaOnEachStringLine ? "," : "";
+		lines.push(`  "${escapeTsStringLiteralContent(group)}"${comma}`);
+	}
+	if (options?.trailingClassName) lines.push("  className,");
+	lines.push(")");
+	return lines.join("\n");
+}
+function formatArray(groups) {
+	const lines = ["["];
+	for (let i = 0; i < groups.length; i++) {
+		const group = groups[i];
+		if (group === void 0) throw new Error("invariant: formatArray group missing");
+		const comma = i < groups.length - 1 || groups.length > 1 ? "," : "";
+		lines.push(`  "${escapeTsStringLiteralContent(group)}"${comma}`);
+	}
+	lines.push("]");
+	return lines.join("\n");
+}
+function formatJsxCnAttributeValue(groups, source, valueNodeStart) {
+	const baseIndent = indentOfLineContaining(source, valueNodeStart);
+	return `{cn(\n${formatCnArguments(groups, {
+		indent: `${baseIndent}  `,
+		commaAfterLastGroup: groups.length > 1
+	})}\n${baseIndent})}`;
+}
+//#endregion
+export { escapeTsStringLiteralContent, formatArray, formatCnArguments, formatCnCall, formatJsxCnAttributeValue };