@utilix-tech/mcp 0.40.0 → 0.42.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.42.0
+- Add `build_range_header`, `parse_content_range_header` tools: build an HTTP `Range` request header from explicit, open-ended, or suffix ("last N bytes") byte ranges, and parse a server's `Content-Range` response to verify what it actually sent back.
+- Add `find_csv_duplicate_rows` tool: group CSV/TSV rows that share the same value across a chosen set of key columns, or the entire row, and report each duplicate group's occurrence count and data row numbers.
+
+## 0.41.0
+- Add `calculate_cash_breakdown`, `calculate_change` tools: break a cash amount down into the minimum count of bills/coins from a set of denominations (largest first), or compute change owed for a payment/tender pair and its breakdown.
+- Add `generate_etag` tool: compute a content-hash ETag (MD5/SHA-1/SHA-256) for a response header, with an optional weak-validator (W/) prefix.
+
 ## 0.40.0
 - Add `generate_sri_hash` tool: compute SHA-256/384/512 Subresource Integrity hashes for a script or stylesheet's content, formatted as the `<algorithm>-<base64>` string an HTML `integrity` attribute expects.
 - Add `analyze_email_headers` tool: parse a raw email header block into structured From/To/Subject fields, the Received hop chain in order, and SPF/DKIM/DMARC results from an Authentication-Results header.

package/README.md

@@ -1,6 +1,6 @@
 # @utilix-tech/mcp
 
-MCP server exposing 165 developer utility tools to Claude, Cursor, VS Code Copilot, and any [Model Context Protocol](https://modelcontextprotocol.io) compatible AI assistant.
+MCP server exposing 171 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.
 
@@ -110,7 +110,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `base62_encode` | Encode text as Base62 (alphanumeric, URL-safe) |
 | `base62_decode` | Decode a Base62 string back to text |
 
-### Hashing (5 tools)
+### Hashing (6 tools)
 | Tool | Description |
 |------|-------------|
 | `hash` | Hash a string with MD5, SHA-1, SHA-256, SHA-384, or SHA-512 |
@@ -118,6 +118,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `bcrypt_hash` | Hash a password using bcrypt |
 | `bcrypt_verify` | Verify a password against a bcrypt hash |
 | `generate_sri_hash` | Compute a Subresource Integrity hash (SHA-256/384/512) for a script or stylesheet's content, formatted for an HTML `integrity` attribute |
+| `generate_etag` | Compute a content-hash ETag (MD5/SHA-1/SHA-256) for a response header, with an optional weak-validator prefix |
 
 ### Generators (6 tools)
 | Tool | Description |
@@ -158,7 +159,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 (24 tools)
+### Units (26 tools)
 | Tool | Description |
 |------|-------------|
 | `convert_bytes` | Convert between B, KB, MB, GB, TB, KiB, MiB, GiB, TiB |
@@ -185,8 +186,10 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `calculate_savings_goal` | Solve for months to reach a savings goal at a fixed monthly contribution, or the monthly contribution required to hit a goal by a target month count |
 | `calculate_roi` | Compute return on investment percent from an initial and final value, plus the annualized (CAGR) return given an optional holding period in years |
 | `compare_unit_prices` | Compare two or more package options by price and quantity to find the true cost per unit, flag the cheapest, and report how much more expensive each other option is |
+| `calculate_cash_breakdown` | Break a cash amount down into the minimum count of bills/coins from a set of denominations, largest first |
+| `calculate_change` | Compute change owed for a payment/tender pair and break it down into the minimum count of bills/coins |
 
-### API / Network (16 tools)
+### API / Network (18 tools)
 | Tool | Description |
 |------|-------------|
 | `decode_jwt` | Decode a JWT: header, payload, and expiry |
@@ -205,6 +208,8 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `build_link_header` | Build and explain an HTTP Link response header from URL/rel pairs (preload, preconnect, prefetch, canonical, pagination, etc.) |
 | `check_set_cookie_header` | Parse a Set-Cookie header and validate its attribute combination: SameSite=None requires Secure, __Host-/__Secure- prefix rules, missing Secure, overly long Max-Age |
 | `analyze_email_headers` | Parse a raw email header block into structured fields, the Received hop chain, and SPF/DKIM/DMARC results from an Authentication-Results header |
+| `build_range_header` | Build an HTTP Range request header from explicit, open-ended, or suffix ("last N bytes") byte ranges |
+| `parse_content_range_header` | Parse a Content-Range response header into its unit, byte bounds, and total resource size |
 
 ### Color (4 tools)
 | Tool | Description |
@@ -230,7 +235,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `lint_conventional_commit` | Lint a commit message against the Conventional Commits v1.0.0 spec: header format, blank-line separation, footer tokens, and BREAKING CHANGE casing |
 | `test_gitignore_patterns` | Test a list of paths against a .gitignore file's patterns, following git's last-match-wins and negation rules |
 
-### Data (9 tools)
+### Data (10 tools)
 | Tool | Description |
 |------|-------------|
 | `validate_yaml` | Validate YAML syntax |
@@ -242,6 +247,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `parse_markdown_front_matter` | Split a Markdown document into its YAML front matter fields and body content |
 | `generate_markdown_toc` | Scan a Markdown document's ATX headings and build a nested table of contents with GitHub-style anchor slugs |
 | `csv_to_sql_insert` | Convert CSV data with a header row into parameterless SQL INSERT statements, with basic type inference and ANSI/MySQL identifier quoting |
+| `find_csv_duplicate_rows` | Group CSV/TSV rows that share the same value across a chosen set of key columns, or the entire row |
 
 ### CSS (2 tools)
 | Tool | Description |

package/dist/index.js

@@ -6830,5 +6830,311 @@ server.tool(
     return text(JSON.stringify(result, null, 2));
   }
 );
+var _USD_DENOMINATIONS_MCP = [100, 50, 20, 10, 5, 1, 0.25, 0.1, 0.05, 0.01];
+function _cashToCentsMcp(n) {
+  return Math.round(n * 100);
+}
+function _calculateCashBreakdownMcp(amount, denominations) {
+  if (!Number.isFinite(amount) || amount < 0) return { error: "Amount must be zero or a positive number" };
+  if (denominations.length === 0) return { error: "At least one denomination is required" };
+  for (const d of denominations) {
+    if (!Number.isFinite(d) || d <= 0) return { error: "Each denomination must be a positive number" };
+  }
+  const round2 = (n) => Math.round(n * 100) / 100;
+  const sorted = Array.from(new Set(denominations)).sort((a, b) => b - a);
+  let remainingCents = _cashToCentsMcp(amount);
+  const breakdown = [];
+  let totalCount = 0;
+  for (const d of sorted) {
+    const dCents = _cashToCentsMcp(d);
+    const count = Math.floor(remainingCents / dCents);
+    if (count > 0) {
+      breakdown.push({ denomination: d, count, subtotal: round2(count * d) });
+      remainingCents -= count * dCents;
+      totalCount += count;
+    }
+  }
+  return {
+    amount: round2(amount),
+    denominations: sorted,
+    breakdown,
+    totalCount,
+    remainder: round2(remainingCents / 100)
+  };
+}
+server.tool(
+  "calculate_cash_breakdown",
+  "Break a cash amount down into the minimum count of bills/coins from a set of denominations, using the standard greedy largest-first approach (optimal for canonical currency denomination sets like USD, EUR, and GBP). Any amount that can't be represented exactly with the given denominations is reported as a remainder rather than rounded away.",
+  {
+    amount: z.number().describe("The cash amount to break down"),
+    denominations: z.array(z.number()).min(1).optional().describe("Available bill/coin denominations, largest to smallest (defaults to US denominations: 100, 50, 20, 10, 5, 1, 0.25, 0.1, 0.05, 0.01)")
+  },
+  async ({ amount, denominations }) => {
+    const result = _calculateCashBreakdownMcp(amount, denominations && denominations.length > 0 ? denominations : _USD_DENOMINATIONS_MCP);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+server.tool(
+  "calculate_change",
+  "Compute the change owed for a payment/tender pair (amount tendered minus amount due) and break that change down into the minimum count of bills/coins from the given denominations.",
+  {
+    amountDue: z.number().describe("The amount owed"),
+    amountTendered: z.number().describe("The amount paid, must be greater than or equal to amountDue"),
+    denominations: z.array(z.number()).min(1).optional().describe("Available bill/coin denominations, largest to smallest (defaults to US denominations: 100, 50, 20, 10, 5, 1, 0.25, 0.1, 0.05, 0.01)")
+  },
+  async ({ amountDue, amountTendered, denominations }) => {
+    if (!Number.isFinite(amountDue) || amountDue < 0) return errText({ error: "Amount due must be zero or a positive number" });
+    if (!Number.isFinite(amountTendered) || amountTendered < 0) return errText({ error: "Amount tendered must be zero or a positive number" });
+    if (_cashToCentsMcp(amountTendered) < _cashToCentsMcp(amountDue)) {
+      return errText({ error: "Amount tendered must be greater than or equal to the amount due" });
+    }
+    const round2 = (n) => Math.round(n * 100) / 100;
+    const denoms = denominations && denominations.length > 0 ? denominations : _USD_DENOMINATIONS_MCP;
+    const changeDue = round2(amountTendered - amountDue);
+    const breakdown = _calculateCashBreakdownMcp(changeDue, denoms);
+    if ("error" in breakdown) return errText(breakdown);
+    return text(JSON.stringify({
+      amountDue: round2(amountDue),
+      amountTendered: round2(amountTendered),
+      changeDue,
+      denominations: breakdown.denominations,
+      breakdown: breakdown.breakdown,
+      totalCount: breakdown.totalCount,
+      remainder: breakdown.remainder
+    }, null, 2));
+  }
+);
+var _ETAG_ALGORITHMS_MCP = ["MD5", "SHA-1", "SHA-256"];
+var _ETAG_NODE_ALG_MAP_MCP = { "MD5": "md5", "SHA-1": "sha1", "SHA-256": "sha256" };
+function _generateEtagMcp(content, algorithm, weak) {
+  if (content.length === 0) return { error: "Content is required" };
+  if (!_ETAG_ALGORITHMS_MCP.includes(algorithm)) {
+    return { error: `Unknown algorithm: ${algorithm}. Must be one of ${_ETAG_ALGORITHMS_MCP.join(", ")}` };
+  }
+  const hash = createHash(_ETAG_NODE_ALG_MAP_MCP[algorithm]).update(content, "utf8").digest("hex");
+  const quoted = `"${hash}"`;
+  const etag = weak ? `W/${quoted}` : quoted;
+  return { algorithm, weak, hash, etag, headerName: "ETag", snippet: `ETag: ${etag}` };
+}
+server.tool(
+  "generate_etag",
+  "Compute a content-hash ETag for the given content: digest it with MD5, SHA-1, or SHA-256, hex-encode it, and quote it into the exact string an ETag response header expects, with an optional weak-validator (W/) prefix. Hashes whatever content you give it; does not replicate any specific web server's own size/modification-time-based ETag algorithm.",
+  {
+    content: z.string().min(1).describe("The content to hash into an ETag"),
+    algorithm: z.enum(_ETAG_ALGORITHMS_MCP).default("SHA-1").describe("Hash algorithm to use"),
+    weak: z.boolean().default(false).describe("Whether to produce a weak validator (W/ prefix)")
+  },
+  async ({ content, algorithm, weak }) => {
+    const result = _generateEtagMcp(content, algorithm, weak);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+function _round2Mcp(n) {
+  return Math.round(n * 100) / 100;
+}
+function _buildRangeHeaderMcp(entries, totalSize, unitRaw) {
+  if (!Array.isArray(entries) || entries.length === 0) {
+    return { error: "At least one range is required" };
+  }
+  const unit = unitRaw?.trim() || "bytes";
+  if (totalSize !== void 0 && (!Number.isFinite(totalSize) || totalSize <= 0)) {
+    return { error: "totalSize must be a positive number when provided" };
+  }
+  const parsed = [];
+  for (const entry of entries) {
+    if (entry.suffixLength !== void 0) {
+      if (!Number.isFinite(entry.suffixLength) || entry.suffixLength <= 0) {
+        return { error: "suffixLength must be a positive number" };
+      }
+      const suffixLength = Math.floor(entry.suffixLength);
+      const byteLength = totalSize !== void 0 ? Math.min(suffixLength, totalSize) : suffixLength;
+      parsed.push({
+        spec: `-${suffixLength}`,
+        start: null,
+        end: null,
+        suffixLength,
+        byteLength,
+        percentOfTotal: totalSize !== void 0 ? _round2Mcp(byteLength / totalSize * 100) : null
+      });
+      continue;
+    }
+    if (entry.start === void 0) {
+      return { error: "Each range requires either a start byte or a suffixLength" };
+    }
+    if (!Number.isFinite(entry.start) || entry.start < 0) {
+      return { error: "start must be a non-negative number" };
+    }
+    const start = Math.floor(entry.start);
+    if (totalSize !== void 0 && start >= totalSize) {
+      return { error: `start byte ${start} is beyond totalSize (${totalSize})` };
+    }
+    if (entry.end !== void 0) {
+      if (!Number.isFinite(entry.end) || entry.end < 0) {
+        return { error: "end must be a non-negative number" };
+      }
+      const end = Math.floor(entry.end);
+      if (end < start) return { error: `range end (${end}) must be >= start (${start})` };
+      if (totalSize !== void 0 && end >= totalSize) {
+        return { error: `end byte ${end} is beyond totalSize (${totalSize})` };
+      }
+      const byteLength = end - start + 1;
+      parsed.push({
+        spec: `${start}-${end}`,
+        start,
+        end,
+        suffixLength: null,
+        byteLength,
+        percentOfTotal: totalSize !== void 0 ? _round2Mcp(byteLength / totalSize * 100) : null
+      });
+    } else {
+      const byteLength = totalSize !== void 0 ? totalSize - start : null;
+      parsed.push({
+        spec: `${start}-`,
+        start,
+        end: null,
+        suffixLength: null,
+        byteLength,
+        percentOfTotal: byteLength !== null && totalSize !== void 0 ? _round2Mcp(byteLength / totalSize * 100) : null
+      });
+    }
+  }
+  const warnings = [];
+  const resolvable = parsed.map((r, i) => ({ i, start: r.start ?? (totalSize !== void 0 && r.suffixLength !== null ? totalSize - Math.min(r.suffixLength, totalSize) : null), end: r.end ?? (totalSize !== void 0 ? totalSize - 1 : null) })).filter((r) => r.start !== null && r.end !== null).sort((a, b) => a.start - b.start);
+  for (let i = 1; i < resolvable.length; i++) {
+    if (resolvable[i].start <= resolvable[i - 1].end) {
+      warnings.push(`ranges "${parsed[resolvable[i - 1].i].spec}" and "${parsed[resolvable[i].i].spec}" overlap \u2014 servers may reject overlapping multi-range requests`);
+    }
+  }
+  if (parsed.length > 1 && parsed.some((r) => r.byteLength === null)) {
+    warnings.push("totalSize was not provided, so open-ended ranges cannot be checked for overlap or total byte count");
+  }
+  const totalBytesRequested = parsed.every((r) => r.byteLength !== null) ? parsed.reduce((sum, r) => sum + (r.byteLength ?? 0), 0) : null;
+  const headerValue = `${unit}=${parsed.map((r) => r.spec).join(",")}`;
+  return { header: `Range: ${headerValue}`, headerValue, ranges: parsed, totalBytesRequested, warnings };
+}
+function _parseContentRangeHeaderMcp(header) {
+  if (!header || header.trim() === "") return { error: "Input is empty" };
+  const match = header.trim().match(/^(\S+)\s+(\*|\d+-\d+)\/(\*|\d+)$/);
+  if (!match) {
+    return { error: 'Could not parse Content-Range header. Expected a format like "bytes 200-1000/67589" or "bytes */67589"' };
+  }
+  const [, unit, range, totalRaw] = match;
+  const isUnsatisfiable = range === "*";
+  const isTotalUnknown = totalRaw === "*";
+  const total = isTotalUnknown ? null : Number(totalRaw);
+  if (isUnsatisfiable) {
+    return { unit, start: null, end: null, total, isUnsatisfiable, isTotalUnknown, byteLength: null };
+  }
+  const [startRaw, endRaw] = range.split("-");
+  const start = Number(startRaw);
+  const end = Number(endRaw);
+  if (end < start) return { error: `Invalid range: end (${end}) is before start (${start})` };
+  return { unit, start, end, total, isUnsatisfiable, isTotalUnknown, byteLength: end - start + 1 };
+}
+server.tool(
+  "build_range_header",
+  'Build an HTTP Range request-header value (RFC 7233) from one or more byte ranges: explicit start-end pairs, open-ended "start to end of file" ranges, or suffix "last N bytes" ranges. Pass totalSize to resolve open-ended/suffix byte lengths and get overlap warnings. Pure string assembly and arithmetic; never makes a network request.',
+  {
+    ranges: z.array(z.object({
+      start: z.number().optional().describe("First byte offset (inclusive)"),
+      end: z.number().optional().describe('Last byte offset (inclusive); omit for "to end of file"'),
+      suffixLength: z.number().optional().describe("Request the last N bytes instead of start/end")
+    })).min(1).describe("One or more byte ranges to request"),
+    totalSize: z.number().optional().describe("Total resource size in bytes, used to resolve open-ended/suffix ranges and detect overlap"),
+    unit: z.string().optional().describe('Range unit (default "bytes")')
+  },
+  async ({ ranges, totalSize, unit }) => {
+    const result = _buildRangeHeaderMcp(ranges, totalSize, unit);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+server.tool(
+  "parse_content_range_header",
+  'Parse a Content-Range response header (e.g. "bytes 200-1000/67589" or "bytes */67589" for an unsatisfiable range) into its unit, byte bounds, and total resource size, so you can verify what a server actually sent back for a partial/resumable request.',
+  {
+    header: z.string().min(1).describe("The Content-Range header value to parse")
+  },
+  async ({ header }) => {
+    const result = _parseContentRangeHeaderMcp(header);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+function _normalizeDuplicateValueMcp(value, caseSensitive, trimWhitespace) {
+  let v = value;
+  if (trimWhitespace) v = v.trim();
+  if (!caseSensitive) v = v.toLowerCase();
+  return v;
+}
+function _findCsvDuplicateRowsMcp(input, delimiter, hasHeader, keyColumns, caseSensitive, trimWhitespace) {
+  if (!input || input.trim() === "") return { error: "Input is empty" };
+  const delim = delimiter?.trim() || ",";
+  const header = hasHeader !== false;
+  const cs = caseSensitive !== false;
+  const tw = trimWhitespace !== false;
+  const lines = input.replace(/\r\n/g, "\n").split("\n").filter((l) => l.trim() !== "");
+  if (lines.length === 0) return { error: "No data found" };
+  const allRows = lines.map((l) => _parseCsvRowForSqlMcp(l, delim));
+  const headers = header ? allRows[0].map((h) => h.trim()) : allRows[0].map((_, idx) => `Column ${idx + 1}`);
+  const dataRows = header ? allRows.slice(1) : allRows;
+  if (dataRows.length === 0) return { error: "No data rows found" };
+  let keyIndexes;
+  if (keyColumns && keyColumns.length > 0) {
+    keyIndexes = [];
+    for (const col of keyColumns) {
+      const idx = headers.indexOf(col);
+      if (idx === -1) return { error: `Column "${col}" not found. Available columns: ${headers.join(", ")}` };
+      keyIndexes.push(idx);
+    }
+  } else {
+    keyIndexes = headers.map((_, idx) => idx);
+  }
+  const groups = /* @__PURE__ */ new Map();
+  dataRows.forEach((row, i) => {
+    const key = keyIndexes.map((idx) => row[idx] ?? "");
+    const normalizedKey = keyIndexes.map((idx) => _normalizeDuplicateValueMcp(row[idx] ?? "", cs, tw));
+    const mapKey = JSON.stringify(normalizedKey);
+    const rowNumber = i + 1;
+    const existing = groups.get(mapKey);
+    if (existing) existing.rowNumbers.push(rowNumber);
+    else groups.set(mapKey, { key, rowNumbers: [rowNumber] });
+  });
+  const duplicateGroups = [];
+  let duplicateRowCount = 0;
+  for (const group of groups.values()) {
+    if (group.rowNumbers.length > 1) {
+      duplicateGroups.push({ key: group.key, rowNumbers: group.rowNumbers, count: group.rowNumbers.length });
+      duplicateRowCount += group.rowNumbers.length;
+    }
+  }
+  duplicateGroups.sort((a, b) => b.count - a.count);
+  return {
+    headers,
+    totalRows: dataRows.length,
+    duplicateGroups,
+    duplicateRowCount,
+    uniqueRowCount: dataRows.length - duplicateRowCount + duplicateGroups.length
+  };
+}
+server.tool(
+  "find_csv_duplicate_rows",
+  "Parse CSV/TSV data and group rows that share the same value across a chosen set of key columns, or the entire row if no key columns are given, so you can spot and clean up accidental duplicates before an import. Row numbers count data rows only (the header row, if any, is not counted).",
+  {
+    csv: z.string().min(1).describe("CSV/TSV data to scan for duplicate rows"),
+    delimiter: z.string().optional().describe('Field delimiter (default ",")'),
+    hasHeader: z.boolean().default(true).describe("Whether the first row is a header"),
+    keyColumns: z.array(z.string()).optional().describe("Column names to compare; omit to compare the entire row"),
+    caseSensitive: z.boolean().default(true).describe("Whether comparison is case-sensitive"),
+    trimWhitespace: z.boolean().default(true).describe("Whether to trim whitespace before comparing")
+  },
+  async ({ csv, delimiter, hasHeader, keyColumns, caseSensitive, trimWhitespace }) => {
+    const result = _findCsvDuplicateRowsMcp(csv, delimiter, hasHeader, keyColumns, caseSensitive, trimWhitespace);
+    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.40.0",
-  "description": "MCP server exposing 152 Utilix developer tools to Claude, Cursor, VS Code Copilot, and any MCP-compatible AI assistant.",
+  "version": "0.42.0",
+  "description": "MCP server exposing 168 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",