@utilix-tech/mcp 0.24.0 → 0.26.0

package/CHANGELOG.md

@@ -2,6 +2,14 @@
 
 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.26.0
+- Add `calculate_break_even` tool: break-even unit count and revenue from fixed costs, variable cost per unit, and price per unit, plus profit and margin of safety at an optional sales volume.
+- Add `calculate_string_distance` tool: Levenshtein edit distance and normalized similarity between two strings, with an optional Damerau (transposition) mode.
+
+## 0.25.0
+- Add `calculate_discount` tool: solve a sale price, amount saved, or discount percent from any one of them, or stack successive discounts where 20% then 10% is an effective 28% off.
+- Add `convert_subtitles` tool: convert between SubRip (.srt) and WebVTT (.vtt) with an optional time shift to resync every cue.
+
 ## 0.24.0
 - Add `calculate_margin_markup` tool: given exactly two of cost, price, margin percent, and markup percent, solve for the other two plus the gross profit.
 

package/README.md

@@ -1,6 +1,6 @@
 # @utilix-tech/mcp
 
-MCP server exposing 135 developer utility tools to Claude, Cursor, VS Code Copilot, and any [Model Context Protocol](https://modelcontextprotocol.io) compatible AI assistant.
+MCP server exposing 137 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.
 
@@ -126,7 +126,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `generate_qr` | Generate a QR code as an SVG string |
 | `generate_random_data` | Generate random mock data: names, emails, UUIDs, IPs, etc. |
 
-### Text (12 tools)
+### Text (13 tools)
 | Tool | Description |
 |------|-------------|
 | `convert_case` | Convert text case: camelCase, snake_case, PascalCase, etc. |
@@ -141,6 +141,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `detect_passive_voice` | Flag sentences written in passive voice, e.g. "was written", "were approved by the team" |
 | `score_readability` | Score text with Flesch Reading Ease, Flesch-Kincaid Grade Level, and Gunning Fog Index |
 | `detect_filler_words` | Scan text for filler words, hedge phrases, and clichés with per-phrase counts and a density score |
+| `calculate_string_distance` | Compute the Levenshtein (or Damerau) edit distance and normalized similarity between two strings |
 
 ### Time (6 tools)
 | Tool | Description |
@@ -152,7 +153,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 (15 tools)
+### Units (18 tools)
 | Tool | Description |
 |------|-------------|
 | `convert_bytes` | Convert between B, KB, MB, GB, TB, KiB, MiB, GiB, TiB |
@@ -170,6 +171,9 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `calculate_percentage_change` | Compute the percentage change between two numbers, with absolute change, direction, and multiplier |
 | `convert_apr_apy` | Convert between a nominal APR and effective APY for a given compounding frequency, in both directions |
 | `calculate_margin_markup` | Given any two of cost, price, margin percent, and markup percent, solve for the other two plus gross profit |
+| `calculate_discount` | Solve a sale price, amount saved, or discount percent from any one of them, or stack successive discounts in order |
+| `convert_subtitles` | Convert subtitles between SubRip (.srt) and WebVTT (.vtt), with an optional time shift to resync every cue |
+| `calculate_break_even` | Compute the break-even unit count and revenue from fixed costs, variable cost per unit, and price per unit |
 
 ### API / Network (10 tools)
 | Tool | Description |

package/dist/index.js

@@ -4124,5 +4124,317 @@ server.tool(
     return text(JSON.stringify(result, null, 2));
   }
 );
+var _DISCOUNT_FIELDS_MCP = ["discountPercent", "discountAmount", "finalPrice"];
+function _calculateDiscountMcp(input) {
+  const provided = (v) => typeof v === "number" && Number.isFinite(v);
+  if (!provided(input.originalPrice)) return { error: "originalPrice is required and must be a finite number" };
+  const originalPrice = input.originalPrice;
+  if (originalPrice <= 0) return { error: "Original price must be greater than zero" };
+  const given = _DISCOUNT_FIELDS_MCP.filter((f) => provided(input[f]));
+  if (given.length !== 1) {
+    return { error: `Provide exactly one of discountPercent, discountAmount, finalPrice (got ${given.length})` };
+  }
+  const field = given[0];
+  let discountAmount;
+  if (field === "discountPercent") {
+    const pct = input.discountPercent;
+    if (pct < 0) return { error: "Discount percent cannot be negative" };
+    if (pct > 100) return { error: "Discount percent cannot exceed 100" };
+    discountAmount = originalPrice * (pct / 100);
+  } else if (field === "discountAmount") {
+    const amt = input.discountAmount;
+    if (amt < 0) return { error: "Discount amount cannot be negative" };
+    if (amt > originalPrice) return { error: "Discount amount cannot exceed the original price" };
+    discountAmount = amt;
+  } else {
+    const fin = input.finalPrice;
+    if (fin < 0) return { error: "Final price cannot be negative" };
+    if (fin > originalPrice) return { error: "Final price cannot exceed the original price: that is a price increase, not a discount" };
+    discountAmount = originalPrice - fin;
+  }
+  const round4 = (n) => Math.round(n * 1e4) / 1e4;
+  return {
+    originalPrice: round4(originalPrice),
+    finalPrice: round4(originalPrice - discountAmount),
+    discountAmount: round4(discountAmount),
+    discountPercent: round4(discountAmount / originalPrice * 100),
+    given: field,
+    solvedFor: _DISCOUNT_FIELDS_MCP.filter((f) => f !== field)
+  };
+}
+function _applySuccessiveDiscountsMcp(originalPrice, discountPercents) {
+  if (!Number.isFinite(originalPrice) || originalPrice <= 0) {
+    return { error: "Original price must be a finite number greater than zero" };
+  }
+  if (discountPercents.length === 0) return { error: "Provide at least one discount percent" };
+  if (discountPercents.length > 20) return { error: "Provide at most 20 successive discounts" };
+  const round4 = (n) => Math.round(n * 1e4) / 1e4;
+  const steps = [];
+  let running = originalPrice;
+  let sumOfDiscountPercents = 0;
+  for (const pct of discountPercents) {
+    if (!Number.isFinite(pct)) return { error: "Every discount percent must be a finite number" };
+    if (pct < 0) return { error: "Discount percent cannot be negative" };
+    if (pct > 100) return { error: "Discount percent cannot exceed 100" };
+    const priceBefore = running;
+    const saved = priceBefore * (pct / 100);
+    running = priceBefore - saved;
+    sumOfDiscountPercents += pct;
+    steps.push({ discountPercent: round4(pct), priceBefore: round4(priceBefore), priceAfter: round4(running), saved: round4(saved) });
+  }
+  const totalSaved = originalPrice - running;
+  return {
+    originalPrice: round4(originalPrice),
+    finalPrice: round4(running),
+    totalSaved: round4(totalSaved),
+    effectiveDiscountPercent: round4(totalSaved / originalPrice * 100),
+    sumOfDiscountPercents: round4(sumOfDiscountPercents),
+    steps
+  };
+}
+server.tool(
+  "calculate_discount",
+  "Discount / markdown calculator. Give an original price plus exactly one of discountPercent, discountAmount, or finalPrice and the other two are derived. Pass discountPercents instead to stack discounts in sequence, where 20% then a further 10% is an effective 28% off rather than 30%. Pure arithmetic, no live price feed and no tax or shipping.",
+  {
+    originalPrice: z.number().describe("The price before any discount (must be greater than zero)"),
+    discountPercent: z.number().optional().describe("Discount as a percent of the original price (0-100). Provide exactly one of discountPercent, discountAmount, finalPrice."),
+    discountAmount: z.number().optional().describe("Discount as an absolute amount off the original price"),
+    finalPrice: z.number().optional().describe("The price after the discount, to solve for the percent and amount"),
+    discountPercents: z.array(z.number()).optional().describe("Successive discount percents applied in order, each off the running price (max 20). Overrides the single-discount fields when present.")
+  },
+  async ({ originalPrice, discountPercent, discountAmount, finalPrice, discountPercents }) => {
+    const result = discountPercents ? _applySuccessiveDiscountsMcp(originalPrice, discountPercents) : _calculateDiscountMcp({ originalPrice, discountPercent, discountAmount, finalPrice });
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+var _SUBTITLE_TIMESTAMP_RE_MCP = /(\d+):(\d{1,2}):(\d{1,2})[.,](\d{1,3})|(\d{1,3}):(\d{1,2})[.,](\d{1,3})/;
+var _VTT_BLOCK_KEYWORDS_MCP = ["NOTE", "STYLE", "REGION"];
+function _parseSubtitleTimestampMcp(raw) {
+  const m = _SUBTITLE_TIMESTAMP_RE_MCP.exec(raw.trim());
+  if (!m || m.index !== 0) return null;
+  let hours;
+  let minutes;
+  let seconds;
+  let millis;
+  if (m[1] !== void 0) {
+    hours = Number(m[1]);
+    minutes = Number(m[2]);
+    seconds = Number(m[3]);
+    millis = m[4];
+  } else {
+    hours = 0;
+    minutes = Number(m[5]);
+    seconds = Number(m[6]);
+    millis = m[7];
+  }
+  if (minutes > 59 || seconds > 59) return null;
+  return hours * 3600 + minutes * 60 + seconds + Number(millis.padEnd(3, "0")) / 1e3;
+}
+function _formatSubtitleTimestampMcp(totalSeconds, format) {
+  const totalMs = Math.round(Math.max(0, totalSeconds) * 1e3);
+  const ms = totalMs % 1e3;
+  const totalSecs = Math.floor(totalMs / 1e3);
+  const pad = (n, width = 2) => String(n).padStart(width, "0");
+  return `${pad(Math.floor(totalSecs / 3600))}:${pad(Math.floor(totalSecs / 60) % 60)}:${pad(totalSecs % 60)}${format === "srt" ? "," : "."}${pad(ms, 3)}`;
+}
+function _detectSubtitleFormatMcp(input) {
+  const t = (input.charCodeAt(0) === 65279 ? input.slice(1) : input).trimStart();
+  if (/^WEBVTT/.test(t)) return "vtt";
+  const arrow = /(\d{1,3}):(\d{1,2})(?::(\d{1,2}))?([.,])(\d{1,3})\s*-->/.exec(t);
+  if (arrow && arrow[4] === ".") return "vtt";
+  return "srt";
+}
+function _convertSubtitlesMcp(input, target, offsetSeconds) {
+  if (typeof input !== "string" || input.trim().length === 0) return { error: "Subtitle input is empty" };
+  if (!Number.isFinite(offsetSeconds)) return { error: "offsetSeconds must be a finite number" };
+  const sourceFormat = _detectSubtitleFormatMcp(input);
+  const warnings = [];
+  let body = (input.charCodeAt(0) === 65279 ? input.slice(1) : input).replace(/\r\n?/g, "\n");
+  if (sourceFormat === "vtt") {
+    const headerMatch = /^WEBVTT[^\n]*\n?/.exec(body.trimStart());
+    if (headerMatch) body = body.trimStart().slice(headerMatch[0].length);
+    else warnings.push('WebVTT input is missing its "WEBVTT" header line');
+  }
+  const blocks = body.split(/\n[ \t]*\n+/).map((b) => b.trim()).filter((b) => b.length > 0);
+  const cues = [];
+  for (const block of blocks) {
+    const lines = block.split("\n");
+    const arrowIdx = lines.findIndex((l) => l.includes("-->"));
+    if (arrowIdx === -1) {
+      const keyword = _VTT_BLOCK_KEYWORDS_MCP.find((k) => lines[0] === k || lines[0].startsWith(`${k} `));
+      if (sourceFormat === "vtt" && keyword) warnings.push(`Dropped a WebVTT ${keyword} block, which has no SRT equivalent`);
+      else warnings.push(`Skipped a block with no "-->" timing line: ${JSON.stringify(lines[0].slice(0, 40))}`);
+      continue;
+    }
+    const timingLine = lines[arrowIdx];
+    const parts = timingLine.split("-->");
+    const start = _parseSubtitleTimestampMcp(parts[0] ?? "");
+    const rightTrimmed = (parts[1] ?? "").trim();
+    const end = _parseSubtitleTimestampMcp(rightTrimmed);
+    if (start === null || end === null) {
+      warnings.push(`Skipped a cue with an unparseable timing line: ${JSON.stringify(timingLine.slice(0, 60))}`);
+      continue;
+    }
+    const endMatch = _SUBTITLE_TIMESTAMP_RE_MCP.exec(rightTrimmed);
+    const settings = endMatch ? rightTrimmed.slice(endMatch[0].length).trim() : "";
+    const idLines = lines.slice(0, arrowIdx).filter((l) => l.trim().length > 0);
+    const cueText = lines.slice(arrowIdx + 1).join("\n").trim();
+    const cue = { index: cues.length + 1, start, end, text: cueText };
+    if (sourceFormat === "vtt" && idLines.length > 0) cue.id = idLines[idLines.length - 1].trim();
+    if (settings.length > 0) cue.settings = settings;
+    if (end < start) warnings.push(`Cue ${cue.index} ends before it starts`);
+    if (cueText.length === 0) warnings.push(`Cue ${cue.index} has no text`);
+    if (cues.length > 0 && start < cues[cues.length - 1].end) {
+      warnings.push(`Cue ${cue.index} starts before cue ${cue.index - 1} ends (overlapping cues)`);
+    }
+    cues.push(cue);
+  }
+  if (cues.length === 0) return { error: "No subtitle cues found: check that the input is a valid SRT or WebVTT file" };
+  let clamped = 0;
+  const shifted = cues.map((cue) => {
+    const start = cue.start + offsetSeconds;
+    if (start < 0) clamped += 1;
+    return { ...cue, start: Math.max(0, start), end: Math.max(0, cue.end + offsetSeconds) };
+  });
+  if (clamped > 0) warnings.push(`${clamped} cue(s) would start before zero and were clamped to 00:00:00`);
+  if (target === "srt") {
+    const droppedSettings = shifted.filter((c) => c.settings).length;
+    const droppedIds = shifted.filter((c) => c.id).length;
+    if (droppedSettings > 0) warnings.push(`Dropped WebVTT cue settings on ${droppedSettings} cue(s): SRT has no equivalent`);
+    if (droppedIds > 0) warnings.push(`Dropped ${droppedIds} WebVTT cue identifier(s): SRT numbers cues sequentially instead`);
+  }
+  const serialised = shifted.map((cue, i) => {
+    const time = `${_formatSubtitleTimestampMcp(cue.start, target)} --> ${_formatSubtitleTimestampMcp(cue.end, target)}`;
+    if (target === "srt") return `${i + 1}
+${time}
+${cue.text}`;
+    const timing = cue.settings ? `${time} ${cue.settings}` : time;
+    return cue.id ? `${cue.id}
+${timing}
+${cue.text}` : `${timing}
+${cue.text}`;
+  }).join("\n\n");
+  return {
+    format: target,
+    sourceFormat,
+    output: target === "vtt" ? `WEBVTT
+
+${serialised}
+` : `${serialised}
+`,
+    cueCount: shifted.length,
+    duration: Math.round(Math.max(...shifted.map((c) => c.end)) * 1e3) / 1e3,
+    warnings
+  };
+}
+server.tool(
+  "convert_subtitles",
+  "Convert a subtitle file between SubRip (.srt) and WebVTT (.vtt), optionally shifting every cue by a fixed number of seconds to resync it. The source format is auto-detected. Converting WebVTT to SRT drops cue identifiers, cue settings, and NOTE/STYLE/REGION blocks, since SubRip has no equivalent; every drop is reported as a warning.",
+  {
+    input: z.string().describe("The full SRT or WebVTT file contents"),
+    target: z.enum(["srt", "vtt"]).default("vtt").describe("Output format"),
+    offsetSeconds: z.number().default(0).describe("Shift every cue by this many seconds (may be negative; results below zero are clamped to 00:00:00)")
+  },
+  async ({ input, target, offsetSeconds }) => {
+    const result = _convertSubtitlesMcp(input, target, offsetSeconds);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+function _calculateBreakEvenMcp(fixedCosts, variableCostPerUnit, pricePerUnit, salesVolume) {
+  if (!Number.isFinite(fixedCosts)) return { error: "fixedCosts must be a finite number" };
+  if (!Number.isFinite(variableCostPerUnit)) return { error: "variableCostPerUnit must be a finite number" };
+  if (!Number.isFinite(pricePerUnit)) return { error: "pricePerUnit must be a finite number" };
+  if (fixedCosts < 0) return { error: "fixedCosts cannot be negative" };
+  if (variableCostPerUnit < 0) return { error: "variableCostPerUnit cannot be negative" };
+  if (pricePerUnit <= 0) return { error: "pricePerUnit must be greater than zero" };
+  if (pricePerUnit <= variableCostPerUnit) {
+    return { error: "pricePerUnit must be greater than variableCostPerUnit, otherwise every unit sold loses money and break-even is never reached" };
+  }
+  const round4 = (n) => Math.round(n * 1e4) / 1e4;
+  const contributionMarginPerUnit = pricePerUnit - variableCostPerUnit;
+  const contributionMarginRatio = contributionMarginPerUnit / pricePerUnit * 100;
+  const breakEvenUnits = fixedCosts / contributionMarginPerUnit;
+  const breakEvenUnitsRounded = Math.ceil(breakEvenUnits);
+  const breakEvenRevenue = breakEvenUnits * pricePerUnit;
+  const result = {
+    fixedCosts: round4(fixedCosts),
+    variableCostPerUnit: round4(variableCostPerUnit),
+    pricePerUnit: round4(pricePerUnit),
+    contributionMarginPerUnit: round4(contributionMarginPerUnit),
+    contributionMarginRatio: round4(contributionMarginRatio),
+    breakEvenUnits: round4(breakEvenUnits),
+    breakEvenUnitsRounded,
+    breakEvenRevenue: round4(breakEvenRevenue)
+  };
+  if (typeof salesVolume === "number" && Number.isFinite(salesVolume)) {
+    if (salesVolume < 0) return { error: "salesVolume cannot be negative" };
+    const marginOfSafetyUnits = salesVolume - breakEvenUnits;
+    result.salesVolume = round4(salesVolume);
+    result.revenueAtSalesVolume = round4(salesVolume * pricePerUnit);
+    result.profitAtSalesVolume = round4(salesVolume * contributionMarginPerUnit - fixedCosts);
+    result.marginOfSafetyUnits = round4(marginOfSafetyUnits);
+    result.marginOfSafetyPercent = salesVolume > 0 ? round4(marginOfSafetyUnits / salesVolume * 100) : 0;
+  }
+  return result;
+}
+server.tool(
+  "calculate_break_even",
+  "From fixed costs, the variable cost per unit, and the selling price per unit, compute the break-even point: the unit count and revenue at which profit is exactly zero. The price must exceed the variable cost, since otherwise every unit sold loses money and break-even is never reached no matter the volume. Optionally pass a sales volume to also get the profit (or loss) at that volume and the margin of safety above break-even. Pure arithmetic, no live cost/pricing feed.",
+  {
+    fixedCosts: z.number().describe("Total fixed costs for the period (cannot be negative)"),
+    variableCostPerUnit: z.number().describe("Variable cost to produce one unit (cannot be negative)"),
+    pricePerUnit: z.number().describe("Selling price per unit (must be greater than variableCostPerUnit)"),
+    salesVolume: z.number().optional().describe("Optional actual/planned unit sales, to compute profit and margin of safety at that volume")
+  },
+  async ({ fixedCosts, variableCostPerUnit, pricePerUnit, salesVolume }) => {
+    const result = _calculateBreakEvenMcp(fixedCosts, variableCostPerUnit, pricePerUnit, salesVolume);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+function _calculateStringDistanceMcp(a, b, mode, caseSensitive) {
+  const MAX_LEN = 5e3;
+  if (a.length > MAX_LEN || b.length > MAX_LEN) return { error: `Strings must be at most ${MAX_LEN} characters` };
+  const s1 = caseSensitive ? a : a.toLowerCase();
+  const s2 = caseSensitive ? b : b.toLowerCase();
+  const m = s1.length;
+  const n = s2.length;
+  const maxLength = Math.max(m, n);
+  if (m === 0 || n === 0) {
+    return { a, b, distance: maxLength, similarity: maxLength === 0 ? 1 : 0, maxLength, mode };
+  }
+  const dp = Array.from({ length: m + 1 }, () => new Array(n + 1).fill(0));
+  for (let i = 0; i <= m; i++) dp[i][0] = i;
+  for (let j = 0; j <= n; j++) dp[0][j] = j;
+  for (let i = 1; i <= m; i++) {
+    for (let j = 1; j <= n; j++) {
+      const cost = s1[i - 1] === s2[j - 1] ? 0 : 1;
+      dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + cost);
+      if (mode === "damerau" && i > 1 && j > 1 && s1[i - 1] === s2[j - 2] && s1[i - 2] === s2[j - 1]) {
+        dp[i][j] = Math.min(dp[i][j], dp[i - 2][j - 2] + 1);
+      }
+    }
+  }
+  const distance = dp[m][n];
+  const similarity = maxLength === 0 ? 1 : Math.round((1 - distance / maxLength) * 1e4) / 1e4;
+  return { a, b, distance, similarity, maxLength, mode };
+}
+server.tool(
+  "calculate_string_distance",
+  'Compute the Levenshtein edit distance between two strings: the minimum number of single-character insertions, deletions, and substitutions needed to turn a into b, plus a normalized 0-1 similarity ratio. Pass mode "damerau" to also count an adjacent-character transposition as a single edit (optimal-string-alignment variant, not unrestricted Damerau-Levenshtein).',
+  {
+    a: z.string().describe("The first string (max 5000 characters)"),
+    b: z.string().describe("The second string (max 5000 characters)"),
+    mode: z.enum(["levenshtein", "damerau"]).default("levenshtein").describe("levenshtein counts a transposition as 2 edits; damerau counts it as 1"),
+    caseSensitive: z.boolean().default(true)
+  },
+  async ({ a, b, mode, caseSensitive }) => {
+    const result = _calculateStringDistanceMcp(a, b, mode, caseSensitive);
+    if ("error" in result) return errText(result);
+    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.24.0",
-  "description": "MCP server exposing 125 Utilix developer tools to Claude, Cursor, VS Code Copilot, and any MCP-compatible AI assistant.",
+  "version": "0.26.0",
+  "description": "MCP server exposing 139 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",