stylelint-plugin-rhythmguard 3.10.0 → 3.10.1

package/CHANGELOG.md

@@ -6,6 +6,12 @@ The format follows Keep a Changelog principles and semantic versioning.
 
 ## [Unreleased]
 
+## [3.10.1] - 2026-10-15
+
+### Fixed
+
+- Token ladders: a ladder whose every step is a `var()` alias of a step on one other ladder, such as Tailwind `@theme` names over a token file, is folded into that ladder instead of being reported again with the same problems. The ladder it aliases lists it under `aliases`, and the Markdown report names it next to that ladder.
+
 ## [3.10.0] - 2026-10-15
 
 ### Added

package/README.md

@@ -7,7 +7,7 @@
 Nobody chose 13px. Rhythmguard catches off-scale spacing in CSS and Tailwind class strings, tells you the nearest steps on your scale, and snaps to them or to your tokens when you ask.
 
 [![CI](https://img.shields.io/github/actions/workflow/status/petrilahdelma/stylelint-plugin-rhythmguard/ci.yml?branch=main&label=ci)](https://github.com/petrilahdelma/stylelint-plugin-rhythmguard/actions/workflows/ci.yml)
-[![npm version](https://img.shields.io/npm/v/stylelint-plugin-rhythmguard?label=npm&color=1f6feb&r=3100)](https://www.npmjs.com/package/stylelint-plugin-rhythmguard)
+[![npm version](https://img.shields.io/npm/v/stylelint-plugin-rhythmguard?label=npm&color=1f6feb&r=3101)](https://www.npmjs.com/package/stylelint-plugin-rhythmguard)
 [![npm downloads](https://img.shields.io/npm/dm/stylelint-plugin-rhythmguard.svg)](https://www.npmjs.com/package/stylelint-plugin-rhythmguard)
 [![License: MIT](https://img.shields.io/badge/license-MIT-white.svg)](./LICENSE)
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "stylelint-plugin-rhythmguard",
-  "version": "3.10.0",
+  "version": "3.10.1",
   "description": "Nobody chose 13px. Catches off-scale spacing in CSS and Tailwind class strings and snaps it to your scale or tokens. Stylelint rules, an ESLint companion, and an audit CLI.",
   "bin": {
     "rhythmguard": "src/cli/index.js"

package/src/audit/render-markdown.js

@@ -141,7 +141,8 @@ function appendTokenLaddersMarkdown(lines, ladders) {
       const note = `${LADDER_PROBLEM_TEXT[problem.type]}${where} with \`${problem.tokens[0]}\``;
       flagged.set(problem.tokens[1], [...(flagged.get(problem.tokens[1]) || []), note]);
     }
-    lines.push(`**\`${escapeMarkdown(entry.prefix)}\`**`);
+    const aliasNote = entry.aliases ? ` (also aliased as ${entry.aliases.map((alias) => `\`${escapeMarkdown(alias)}\``).join(', ')})` : '';
+    lines.push(`**\`${escapeMarkdown(entry.prefix)}\`**${aliasNote}`);
     lines.push('');
     lines.push('| Token | Min | Max | Problem |');
     lines.push('| --- | --- | --- | --- |');

package/src/audit/token-ladders.js

@@ -19,7 +19,8 @@ const { formatLength, numbersEqual, parseLengthToken, toPx } = require('../core/
  * Each problem names the end it occurs at: `min`, `max`, or `both`.
  *
  * A step that cannot be evaluated (calc(), a viewport length, a token with
- * several different definitions) is left out of the comparison.
+ * several different definitions) is left out of the comparison. A ladder
+ * that only aliases another one step for step is folded into it.
  */
 const DEFAULT_MIN_STEP_PX = 2;
 const MIN_LADDER_STEPS = 3;
@@ -158,9 +159,37 @@ function resolveTokenLadders({ baseFontSize = 16, declarations, minStepPx = DEFA
     ladder.steps.push({ max: range.max, min: range.min, rank: step.rank, token });
   }
 
+  const eligible = [...ladders.values()].filter((ladder) => ladder.steps.length >= MIN_LADDER_STEPS);
+  const ladderOfToken = new Map();
+  for (const ladder of eligible) {
+    for (const step of ladder.steps) ladderOfToken.set(step.token, ladder);
+  }
+  // A ladder whose every step is a var() alias of a step on one other ladder
+  // (Tailwind @theme names over a token file) has that ladder's problems, not
+  // its own. It is listed under the other ladder's `aliases` and not counted.
+  const aliasTarget = (ladder) => {
+    let target = null;
+    for (const step of ladder.steps) {
+      const values = declarations.get(step.token);
+      const reference = values && values.size === 1 ? [...values][0].trim().match(VAR_REFERENCE) : null;
+      const owner = reference ? ladderOfToken.get(reference[1]) : null;
+      if (!owner || owner === ladder || (target && owner !== target)) return null;
+      target = owner;
+    }
+    return target;
+  };
+  const aliases = new Map();
+  for (const ladder of eligible) {
+    const target = aliasTarget(ladder);
+    if (target && !aliasTarget(target)) {
+      aliases.set(ladder, target);
+      target.aliases = [...(target.aliases || []), ladder.prefix].sort();
+    }
+  }
+
   const entries = [];
-  for (const ladder of ladders.values()) {
-    if (ladder.steps.length < MIN_LADDER_STEPS) continue;
+  for (const ladder of eligible) {
+    if (aliases.has(ladder)) continue;
     const steps = ladder.steps.sort((a, b) => a.rank - b.rank);
     const problems = [];
     for (let index = 0; index < steps.length - 1; index += 1) {
@@ -176,6 +205,7 @@ function resolveTokenLadders({ baseFontSize = 16, declarations, minStepPx = DEFA
       if (atMax) problems.push({ end: 'max', tokens, ...atMax });
     }
     entries.push({
+      ...(ladder.aliases ? { aliases: ladder.aliases } : {}),
       prefix: ladder.prefix,
       problems,
       steps: steps.map(({ max, min, token }) => ({