@utilix-tech/mcp 0.88.0 → 0.90.0

package/CHANGELOG.md

@@ -2,6 +2,13 @@
 
 Full release notes for all Utilix surfaces (browser tools, REST API, SDKs, MCP server) live at [utilix.tech/changelog](https://utilix.tech/changelog). This file tracks just this package.
 
+## 0.90.0
+- Add `intersect_semver_ranges` tool: determine whether two semver ranges overlap and, if so, the intersecting range, supporting the same caret/tilde/comparison-operator/exact-version syntax as the semver tool.
+- Add `check_markdown_internal_links` tool: scan a Markdown document's ATX headings, compute GitHub-style anchor slugs, and flag `[text](#slug)` links that point at a heading that doesn't exist.
+
+## 0.89.0
+- Add `check_acronym_expansion` tool: scan text for acronyms and flag any used before being expanded on first mention, recognizing both the "full term (ACRONYM)" and "ACRONYM (full term)" conventions, with acronyms never expanded anywhere reported separately.
+
 ## 0.88.0
 - Add `validate_mermaid_syntax` tool: check a Mermaid diagram definition for syntax errors with line numbers, including an unterminated subgraph, unbalanced node brackets, a malformed edge arrow, and a sequence-diagram participant referenced before its explicit declaration.
 - Add `calculate_annuity_payout` tool: solve the standard annuity formula in either direction, the periodic payout a lump sum funds, or the lump sum required to fund a target payout, for an ordinary or annuity-due structure.

package/README.md

@@ -1,6 +1,6 @@
 # @utilix-tech/mcp
 
-MCP server exposing 269 developer utility tools to Claude, Cursor, VS Code Copilot, and any [Model Context Protocol](https://modelcontextprotocol.io) compatible AI assistant.
+MCP server exposing 272 developer utility tools to Claude, Cursor, VS Code Copilot, and any [Model Context Protocol](https://modelcontextprotocol.io) compatible AI assistant.
 
 No API key required. All tools run locally. Requires Node.js 18 or later.
 
@@ -134,7 +134,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `generate_random_data` | Generate random mock data: names, emails, UUIDs, IPs, etc. |
 | `generate_csp_nonce` | Generate a cryptographically random CSP nonce with ready-to-paste header directive and script/style tag snippets |
 
-### Text (17 tools)
+### Text (18 tools)
 | Tool | Description |
 |------|-------------|
 | `convert_case` | Convert text case: camelCase, snake_case, PascalCase, etc. |
@@ -156,6 +156,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `lookup_emoji` | Search a curated table of ~280 common emoji by name, keyword, or GitHub-style shortcode, or look one up exactly by shortcode, character, or category |
 | `analyze_keyword_density` | Count keyword/phrase frequency and density (occurrences per 100 words) across a block of text, with single-word or 2/3-word phrase modes |
 | `check_dash_usage` | Scan text for likely dash misuse: a hyphen surrounded by spaces, an unconverted double hyphen, and inconsistent spacing around em dashes across the same document |
+| `check_acronym_expansion` | Scan text for acronyms and flag any that are used before being expanded on first mention, or never expanded at all |
 
 ### Time (6 tools)
 | Tool | Description |
@@ -168,7 +169,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `convert_timezone` | Convert a date/time between timezones |
 | `convert_iso8601_duration` | Parse an ISO 8601 duration into components and total seconds, or format seconds into a duration string |
 
-### Units (48 tools)
+### Units (49 tools)
 | Tool | Description |
 |------|-------------|
 | `convert_bytes` | Convert between B, KB, MB, GB, TB, KiB, MiB, GiB, TiB |
@@ -220,6 +221,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `calculate_real_rate_of_return` | Apply the Fisher equation to solve for whichever of the nominal rate, inflation rate, or inflation-adjusted real rate is missing, given exactly two of the three |
 | `calculate_credit_card_minimum_payment` | Simulate paying only the minimum payment on a revolving credit card balance, where the minimum is the larger of a percent of the balance or a fixed dollar floor, and report months/years to payoff, total interest, and total paid |
 | `calculate_sales_commission` | Compute a sales commission from either a flat percent rate applied to the whole sale amount, or a tiered (marginal) rate structure where each tier applies only to the slice of sales within it, plus an optional base salary added to the total payout |
+| `intersect_semver_ranges` | Determine whether two semver ranges overlap and, if so, the intersecting range, supporting the same caret/tilde/comparison-operator/exact-version syntax as the semver tool |
 
 ### API / Network (51 tools)
 | Tool | Description |
@@ -319,7 +321,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `extract_markdown_link_references` | Extract every reference-style Markdown link ([text][ref], [text][], ![alt][ref]) and match it against its [ref]: url definition, flagging unresolved references and unused definitions |
 | `build_character_class` | Assemble a [...] regex character class from named building blocks (lowercase, uppercase, digits, whitespace), custom ranges, and literal custom characters, with optional negation |
 
-### Data (18 tools)
+### Data (19 tools)
 | Tool | Description |
 |------|-------------|
 | `validate_yaml` | Validate YAML syntax |
@@ -340,6 +342,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `infer_csv_column_types` | Parse CSV/TSV data and infer each column's data type (integer, float, boolean, ISO 8601 date, or string), flagging nullable columns and empty-cell counts |
 | `align_markdown_tables` | Reformat every GitHub-Flavored-Markdown pipe table in a document so each column's pipes line up visually, preserving left/center/right alignment markers |
 | `validate_markdown_heading_hierarchy` | Scan a Markdown document's ATX headings and flag heading-structure issues: skipped levels, multiple H1s, empty headings, duplicate headings, and a document that doesn't start at H1 |
+| `check_markdown_internal_links` | Scan a Markdown document's ATX headings, compute the GitHub-style anchor slug for each, and check every [text](#slug) internal link against them, flagging links that point at a heading that doesn't exist |
 
 ### CSS (2 tools)
 | Tool | Description |

package/dist/index.js

@@ -13944,6 +13944,76 @@ server.tool(
     return text(JSON.stringify(_checkDashUsageMcp(input), null, 2));
   }
 );
+var _ACRONYM_TOKEN_RE_MCP = /\b[A-Z][A-Z0-9]{1,9}\b/g;
+var _ACRONYM_IN_PARENS_RE_MCP = /\(([A-Z][A-Z0-9]{1,9})\)/g;
+var _ACRONYM_THEN_EXPANSION_RE_MCP = /\b([A-Z][A-Z0-9]{1,9})\b\s*\(([a-zA-Z][^()]{1,100})\)/g;
+function _acronymContextSnippetMcp(input, index, matchLen) {
+  const start = Math.max(0, index - 25);
+  const end = Math.min(input.length, index + matchLen + 25);
+  const body = input.slice(start, end).replace(/\s+/g, " ").trim();
+  return (start > 0 ? "\u2026" : "") + body + (end < input.length ? "\u2026" : "");
+}
+function _checkAcronymExpansionMcp(input) {
+  const definedAt = /* @__PURE__ */ new Map();
+  for (const m of input.matchAll(_ACRONYM_IN_PARENS_RE_MCP)) {
+    const acronym = m[1];
+    const idx = (m.index ?? 0) + 1;
+    const existing = definedAt.get(acronym);
+    if (existing === void 0 || idx < existing) definedAt.set(acronym, idx);
+  }
+  for (const m of input.matchAll(_ACRONYM_THEN_EXPANSION_RE_MCP)) {
+    const acronym = m[1];
+    const idx = m.index ?? 0;
+    const existing = definedAt.get(acronym);
+    if (existing === void 0 || idx < existing) definedAt.set(acronym, idx);
+  }
+  const occurrencesByAcronym = /* @__PURE__ */ new Map();
+  for (const m of input.matchAll(_ACRONYM_TOKEN_RE_MCP)) {
+    const acronym = m[0];
+    const idx = m.index ?? 0;
+    const list = occurrencesByAcronym.get(acronym);
+    if (list) list.push(idx);
+    else occurrencesByAcronym.set(acronym, [idx]);
+  }
+  const acronyms = [];
+  const issues = [];
+  for (const [acronym, indicesUnsorted] of occurrencesByAcronym) {
+    const indices = [...indicesUnsorted].sort((a, b) => a - b);
+    const firstUsedAt = indices[0];
+    const expandedAt = definedAt.has(acronym) ? definedAt.get(acronym) : null;
+    const earlyUse = expandedAt !== null ? indices.find((i) => i < expandedAt) : void 0;
+    const usedBeforeExpansion = earlyUse !== void 0;
+    acronyms.push({ acronym, occurrences: indices.length, firstUsedAt, expandedAt, usedBeforeExpansion });
+    if (usedBeforeExpansion) {
+      issues.push({
+        type: "used-before-expansion",
+        acronym,
+        index: earlyUse,
+        context: _acronymContextSnippetMcp(input, earlyUse, acronym.length),
+        message: `"${acronym}" is used here before it's expanded later in the document (at character ${expandedAt}).`
+      });
+    } else if (expandedAt === null) {
+      issues.push({
+        type: "never-expanded",
+        acronym,
+        index: firstUsedAt,
+        context: _acronymContextSnippetMcp(input, firstUsedAt, acronym.length),
+        message: `"${acronym}" is never expanded anywhere in this document.`
+      });
+    }
+  }
+  acronyms.sort((a, b) => a.firstUsedAt - b.firstUsedAt);
+  issues.sort((a, b) => a.index - b.index);
+  return { acronyms, issues };
+}
+server.tool(
+  "check_acronym_expansion",
+  "Scan text for acronyms (2-10 character all-caps tokens) and flag any that are used before being expanded on first mention, per standard technical writing style guides. Recognizes both expansion conventions: the full term followed by the acronym in parentheses, and the acronym followed by its expansion in parentheses. Pure regex heuristic, not a dictionary of real acronyms.",
+  { text: z.string().describe("The text to scan for acronym expansion order") },
+  async ({ text: input }) => {
+    return text(JSON.stringify(_checkAcronymExpansionMcp(input), null, 2));
+  }
+);
 var _CommissionTierSchema = z.object({
   upTo: z.number().nullable().describe("Upper bound of this tier (exclusive). null means unbounded and is only valid on the last tier."),
   ratePercent: z.number().min(0).describe("Commission rate as a percent applied to the slice of salesAmount within this tier")
@@ -14119,5 +14189,253 @@ server.tool(
     return text(JSON.stringify(result, null, 2));
   }
 );
+var _SEMVER_RANGE_RE_MCP = /^v?(\d+)\.(\d+)\.(\d+)(?:-([a-zA-Z0-9._-]+?))?(?:\+([a-zA-Z0-9._-]+))?$/;
+function _parseSemverRangeMcp(version) {
+  const m = version.trim().match(_SEMVER_RANGE_RE_MCP);
+  if (!m) return { error: `Invalid semver: '${version}'` };
+  const result = { major: parseInt(m[1], 10), minor: parseInt(m[2], 10), patch: parseInt(m[3], 10) };
+  if (m[4] !== void 0) result.prerelease = m[4];
+  if (m[5] !== void 0) result.build = m[5];
+  return result;
+}
+function _compareSemverPrereleaseMcp(a, b) {
+  if (a === void 0 && b === void 0) return 0;
+  if (a === void 0) return 1;
+  if (b === void 0) return -1;
+  const aParts = a.split(".");
+  const bParts = b.split(".");
+  const len = Math.max(aParts.length, bParts.length);
+  for (let i = 0; i < len; i++) {
+    const ap = aParts[i];
+    const bp = bParts[i];
+    if (ap === void 0) return -1;
+    if (bp === void 0) return 1;
+    const aNum = parseInt(ap, 10);
+    const bNum = parseInt(bp, 10);
+    const aIsNum = !isNaN(aNum) && String(aNum) === ap;
+    const bIsNum = !isNaN(bNum) && String(bNum) === bp;
+    if (aIsNum && bIsNum) {
+      if (aNum < bNum) return -1;
+      if (aNum > bNum) return 1;
+    } else if (aIsNum) {
+      return -1;
+    } else if (bIsNum) {
+      return 1;
+    } else {
+      if (ap < bp) return -1;
+      if (ap > bp) return 1;
+    }
+  }
+  return 0;
+}
+function _compareSemverRangeVersionsMcp(a, b) {
+  if (a.major !== b.major) return a.major < b.major ? -1 : 1;
+  if (a.minor !== b.minor) return a.minor < b.minor ? -1 : 1;
+  if (a.patch !== b.patch) return a.patch < b.patch ? -1 : 1;
+  return _compareSemverPrereleaseMcp(a.prerelease, b.prerelease);
+}
+function _tightenSemverLowerMcp(a, b) {
+  if (a.value === null) return b;
+  if (b.value === null) return a;
+  const cmp = _compareSemverRangeVersionsMcp(a.value, b.value);
+  if (cmp > 0) return a;
+  if (cmp < 0) return b;
+  return { value: a.value, inclusive: a.inclusive && b.inclusive };
+}
+function _tightenSemverUpperMcp(a, b) {
+  if (a.value === null) return b;
+  if (b.value === null) return a;
+  const cmp = _compareSemverRangeVersionsMcp(a.value, b.value);
+  if (cmp < 0) return a;
+  if (cmp > 0) return b;
+  return { value: a.value, inclusive: a.inclusive && b.inclusive };
+}
+function _isValidSemverIntervalMcp(lower, upper) {
+  if (lower.value === null || upper.value === null) return true;
+  const cmp = _compareSemverRangeVersionsMcp(lower.value, upper.value);
+  if (cmp < 0) return true;
+  if (cmp > 0) return false;
+  return lower.inclusive && upper.inclusive;
+}
+function _formatSemverRangeVersionMcp(v) {
+  let s = `${v.major}.${v.minor}.${v.patch}`;
+  if (v.prerelease) s += `-${v.prerelease}`;
+  if (v.build) s += `+${v.build}`;
+  return s;
+}
+function _semverIntervalToRangeStringMcp(interval) {
+  const { lower, upper } = interval;
+  if (lower.value === null && upper.value === null) return "*";
+  if (lower.value !== null && upper.value !== null) {
+    const cmp = _compareSemverRangeVersionsMcp(lower.value, upper.value);
+    if (cmp === 0 && lower.inclusive && upper.inclusive) return _formatSemverRangeVersionMcp(lower.value);
+  }
+  const parts = [];
+  if (lower.value !== null) parts.push(`${lower.inclusive ? ">=" : ">"}${_formatSemverRangeVersionMcp(lower.value)}`);
+  if (upper.value !== null) parts.push(`${upper.inclusive ? "<=" : "<"}${_formatSemverRangeVersionMcp(upper.value)}`);
+  return parts.length ? parts.join(" ") : "*";
+}
+function _parseSemverSingleConstraintMcp(range) {
+  if (range === "*" || range === "") return { lower: { value: null, inclusive: true }, upper: { value: null, inclusive: true } };
+  const caretMatch = range.match(/^\^v?(\d+)\.(\d+)\.(\d+)(?:-([a-zA-Z0-9._-]+))?$/);
+  if (caretMatch) {
+    const major = parseInt(caretMatch[1], 10);
+    const minor = parseInt(caretMatch[2], 10);
+    const patch = parseInt(caretMatch[3], 10);
+    const pre = caretMatch[4];
+    const lowerVal = { major, minor, patch, prerelease: pre };
+    let upperVal;
+    if (major !== 0) upperVal = { major: major + 1, minor: 0, patch: 0 };
+    else if (minor !== 0) upperVal = { major: 0, minor: minor + 1, patch: 0 };
+    else upperVal = { major: 0, minor: 0, patch: patch + 1 };
+    return { lower: { value: lowerVal, inclusive: true }, upper: { value: upperVal, inclusive: false } };
+  }
+  const tildeMatch = range.match(/^~v?(\d+)\.(\d+)\.(\d+)(?:-([a-zA-Z0-9._-]+))?$/);
+  if (tildeMatch) {
+    const major = parseInt(tildeMatch[1], 10);
+    const minor = parseInt(tildeMatch[2], 10);
+    const patch = parseInt(tildeMatch[3], 10);
+    const pre = tildeMatch[4];
+    const lowerVal = { major, minor, patch, prerelease: pre };
+    const upperVal = { major, minor: minor + 1, patch: 0 };
+    return { lower: { value: lowerVal, inclusive: true }, upper: { value: upperVal, inclusive: false } };
+  }
+  const opMatch = range.match(/^(>=|<=|>|<|=)v?(.+)$/);
+  if (opMatch) {
+    const op = opMatch[1];
+    const parsed = _parseSemverRangeMcp(opMatch[2]);
+    if ("error" in parsed) return parsed;
+    if (op === ">=") return { lower: { value: parsed, inclusive: true }, upper: { value: null, inclusive: true } };
+    if (op === "<=") return { lower: { value: null, inclusive: true }, upper: { value: parsed, inclusive: true } };
+    if (op === ">") return { lower: { value: parsed, inclusive: false }, upper: { value: null, inclusive: true } };
+    if (op === "<") return { lower: { value: null, inclusive: true }, upper: { value: parsed, inclusive: false } };
+    return { lower: { value: parsed, inclusive: true }, upper: { value: parsed, inclusive: true } };
+  }
+  const plain = _parseSemverRangeMcp(range);
+  if (!("error" in plain)) return { lower: { value: plain, inclusive: true }, upper: { value: plain, inclusive: true } };
+  return { error: `Unsupported range: '${range}'` };
+}
+function _semverRangeToIntervalsMcp(range) {
+  const trimmed = range.trim();
+  if (trimmed === "") return [{ lower: { value: null, inclusive: true }, upper: { value: null, inclusive: true } }];
+  const orParts = trimmed.split("||").map((s) => s.trim());
+  const intervals = [];
+  for (const orPart of orParts) {
+    const andTokens = orPart.split(/\s+/).filter(Boolean);
+    let combined = { lower: { value: null, inclusive: true }, upper: { value: null, inclusive: true } };
+    for (const token of andTokens) {
+      const parsed = _parseSemverSingleConstraintMcp(token);
+      if ("error" in parsed) return parsed;
+      combined = { lower: _tightenSemverLowerMcp(combined.lower, parsed.lower), upper: _tightenSemverUpperMcp(combined.upper, parsed.upper) };
+    }
+    intervals.push(combined);
+  }
+  return intervals;
+}
+function _intersectSemverRangesMcp(rangeA, rangeB) {
+  const intervalsA = _semverRangeToIntervalsMcp(rangeA);
+  if (!Array.isArray(intervalsA)) return intervalsA;
+  const intervalsB = _semverRangeToIntervalsMcp(rangeB);
+  if (!Array.isArray(intervalsB)) return intervalsB;
+  const results = [];
+  for (const a of intervalsA) {
+    for (const b of intervalsB) {
+      const lower = _tightenSemverLowerMcp(a.lower, b.lower);
+      const upper = _tightenSemverUpperMcp(a.upper, b.upper);
+      if (_isValidSemverIntervalMcp(lower, upper)) results.push({ lower, upper });
+    }
+  }
+  if (results.length === 0) return { overlaps: false, intersection: null };
+  const formatted = Array.from(new Set(results.map(_semverIntervalToRangeStringMcp)));
+  return { overlaps: true, intersection: formatted.join(" || ") };
+}
+server.tool(
+  "intersect_semver_ranges",
+  "Determine whether two semver ranges overlap and, if so, the intersecting range. Supports the same caret/tilde/comparison-operator/exact-version syntax (combined with || or space-separated AND) as the semver tool.",
+  {
+    rangeA: z.string().describe('The first semver range, e.g. "^1.2.0"'),
+    rangeB: z.string().describe('The second semver range, e.g. ">=1.5.0 <2.0.0"')
+  },
+  async ({ rangeA, rangeB }) => {
+    const result = _intersectSemverRangesMcp(rangeA, rangeB);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+function _stripInlineMarkdownForLinksMcp(text2) {
+  return text2.replace(/(\*\*\*|___)(.+?)\1/g, "$2").replace(/(\*\*|__)(.+?)\1/g, "$2").replace(/(\*|_)(.+?)\1/g, "$2").replace(/`([^`]+)`/g, "$1").replace(/!\[([^\]]*)\]\([^)]*\)/g, "$1").replace(/\[([^\]]+)\]\([^)]*\)/g, "$1").trim();
+}
+function _slugifyHeadingForLinksMcp(text2, seen) {
+  let slug = text2.toLowerCase().trim().replace(/[^\p{L}\p{N}\s_-]/gu, "").replace(/\s/g, "-");
+  const count = seen.get(slug) ?? 0;
+  seen.set(slug, count + 1);
+  if (count > 0) slug = `${slug}-${count}`;
+  return slug;
+}
+var _ANCHOR_LINK_RE_MCP = /\[([^\]]*)\]\(#([^)\s]+)\)/g;
+function _checkMarkdownInternalLinksMcp(markdown) {
+  const lines = markdown.replace(/\r\n/g, "\n").split("\n");
+  const headings = [];
+  const seen = /* @__PURE__ */ new Map();
+  let inFence = false;
+  let fenceMarker = "";
+  for (let i = 0; i < lines.length; i++) {
+    const line = lines[i];
+    const fenceMatch = line.match(/^\s*(```+|~~~+)/);
+    if (fenceMatch) {
+      if (!inFence) {
+        inFence = true;
+        fenceMarker = fenceMatch[1][0];
+      } else if (fenceMatch[1][0] === fenceMarker) {
+        inFence = false;
+      }
+      continue;
+    }
+    if (inFence) continue;
+    const headingMatch = line.match(/^(#{1,6})\s+(.+?)\s*#*\s*$/);
+    if (!headingMatch) continue;
+    const level = headingMatch[1].length;
+    const text2 = _stripInlineMarkdownForLinksMcp(headingMatch[2]);
+    if (text2 === "") continue;
+    const slug = _slugifyHeadingForLinksMcp(text2, seen);
+    headings.push({ level, text: text2, slug, line: i + 1 });
+  }
+  const validSlugs = new Set(headings.map((h) => h.slug));
+  const links = [];
+  inFence = false;
+  fenceMarker = "";
+  for (let i = 0; i < lines.length; i++) {
+    const line = lines[i];
+    const fenceMatch = line.match(/^\s*(```+|~~~+)/);
+    if (fenceMatch) {
+      if (!inFence) {
+        inFence = true;
+        fenceMarker = fenceMatch[1][0];
+      } else if (fenceMatch[1][0] === fenceMarker) {
+        inFence = false;
+      }
+      continue;
+    }
+    if (inFence) continue;
+    const re = new RegExp(_ANCHOR_LINK_RE_MCP);
+    let m;
+    while ((m = re.exec(line)) !== null) {
+      const target = m[2];
+      links.push({ text: m[1], target, line: i + 1, valid: validSlugs.has(target) });
+    }
+  }
+  return { headings, links, brokenLinks: links.filter((l) => !l.valid) };
+}
+server.tool(
+  "check_markdown_internal_links",
+  "Scan a Markdown document's ATX headings, compute the GitHub-style anchor slug for each, and check every [text](#slug) internal link against them, flagging links that point at a heading that doesn't exist (or was renamed).",
+  {
+    markdown: z.string().describe("The Markdown document to scan")
+  },
+  async ({ markdown }) => {
+    const result = _checkMarkdownInternalLinksMcp(markdown);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
 var transport = new StdioServerTransport();
 await server.connect(transport);

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@utilix-tech/mcp",
-  "version": "0.88.0",
-  "description": "MCP server exposing 198 Utilix developer tools to Claude, Cursor, VS Code Copilot, and any MCP-compatible AI assistant.",
+  "version": "0.90.0",
+  "description": "MCP server exposing 272 Utilix developer tools to Claude, Cursor, VS Code Copilot, and any MCP-compatible AI assistant.",
   "author": "Utilix <hello@utilix.tech>",
   "license": "MIT",
   "homepage": "https://utilix.tech/mcp",