@utilix-tech/mcp 0.46.0 → 0.47.0

package/CHANGELOG.md

@@ -2,6 +2,10 @@
 
 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.47.0
+- Add `calculate_depreciation_schedule` tool: build a year-by-year fixed-asset depreciation schedule from cost, salvage value, and useful life, using straight-line, double-declining-balance, or sum-of-years-digits.
+- Add `analyze_keyword_density` tool: count keyword/phrase frequency and density (occurrences per 100 words) across a block of text, with single-word or 2/3-word phrase modes.
+
 ## 0.46.0
 - Add `calculate_cd_maturity` tool: compute a certificate of deposit's maturity value and effective annual yield (APY) from a principal, nominal rate, term, and compounding frequency, plus the net payout if withdrawn early.
 - Add `build_client_hints`, `parse_client_hint_headers` tools: build an `Accept-CH`/`Critical-CH` response header from a list of client hint names with a plain-English note per hint, or decode raw Client Hints request-header text into structured values.

package/README.md

@@ -130,7 +130,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 (15 tools)
+### Text (16 tools)
 | Tool | Description |
 |------|-------------|
 | `convert_case` | Convert text case: camelCase, snake_case, PascalCase, etc. |
@@ -148,6 +148,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `calculate_string_distance` | Compute the Levenshtein (or Damerau) edit distance and normalized similarity between two strings |
 | `analyze_sentence_lengths` | Split text into sentences and report a histogram of sentence lengths, plus mean, median, standard deviation, and a consistency label |
 | `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 |
 
 ### Time (6 tools)
 | Tool | Description |
@@ -159,7 +160,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 (28 tools)
+### Units (29 tools)
 | Tool | Description |
 |------|-------------|
 | `convert_bytes` | Convert between B, KB, MB, GB, TB, KiB, MiB, GiB, TiB |
@@ -190,6 +191,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `calculate_change` | Compute change owed for a payment/tender pair and break it down into the minimum count of bills/coins |
 | `calculate_payback_period` | Compute the simple and discounted payback period from an initial investment and a series of periodic cash flows |
 | `calculate_cd_maturity` | Compute a certificate of deposit's maturity value and effective annual yield (APY) from a principal, nominal rate, term, and compounding frequency, plus the net early-withdrawal payout |
+| `calculate_depreciation_schedule` | Build a year-by-year fixed-asset depreciation schedule from cost, salvage value, and useful life, using straight-line, double-declining-balance, or sum-of-years-digits |
 
 ### API / Network (25 tools)
 | Tool | Description |

package/dist/index.js

@@ -7811,5 +7811,195 @@ server.tool(
     return text(JSON.stringify(result, null, 2));
   }
 );
+var _DEPRECIATION_METHODS_MCP = ["straight-line", "double-declining-balance", "sum-of-years-digits"];
+function _calculateDepreciationScheduleMcp(cost, salvageValue, usefulLifeYears, method) {
+  if (!Number.isFinite(cost) || cost <= 0) return { error: "Cost must be a positive number" };
+  if (!Number.isFinite(salvageValue) || salvageValue < 0) return { error: "Salvage value must be zero or a positive number" };
+  if (salvageValue >= cost) return { error: "Salvage value must be less than cost" };
+  if (!Number.isInteger(usefulLifeYears) || usefulLifeYears <= 0) {
+    return { error: "Useful life must be a positive whole number of years" };
+  }
+  if (!_DEPRECIATION_METHODS_MCP.includes(method)) {
+    return { error: `Method must be one of: ${_DEPRECIATION_METHODS_MCP.join(", ")}` };
+  }
+  const depreciableBase = _roundMoneyMcp(cost - salvageValue);
+  const schedule = [];
+  let accumulated = 0;
+  if (method === "straight-line") {
+    const annual = _roundMoneyMcp(depreciableBase / usefulLifeYears);
+    for (let year = 1; year <= usefulLifeYears; year++) {
+      const expense = year === usefulLifeYears ? _roundMoneyMcp(depreciableBase - accumulated) : annual;
+      accumulated = _roundMoneyMcp(accumulated + expense);
+      schedule.push({ year, depreciationExpense: expense, accumulatedDepreciation: accumulated, bookValue: _roundMoneyMcp(cost - accumulated) });
+    }
+  } else if (method === "double-declining-balance") {
+    const rate = 2 / usefulLifeYears;
+    let bookValue = cost;
+    for (let year = 1; year <= usefulLifeYears; year++) {
+      let expense = _roundMoneyMcp(bookValue * rate);
+      if (bookValue - expense < salvageValue) expense = _roundMoneyMcp(bookValue - salvageValue);
+      if (expense < 0) expense = 0;
+      bookValue = _roundMoneyMcp(bookValue - expense);
+      accumulated = _roundMoneyMcp(accumulated + expense);
+      schedule.push({ year, depreciationExpense: expense, accumulatedDepreciation: accumulated, bookValue });
+    }
+  } else {
+    const sumOfYears = usefulLifeYears * (usefulLifeYears + 1) / 2;
+    for (let year = 1; year <= usefulLifeYears; year++) {
+      const fraction = (usefulLifeYears - year + 1) / sumOfYears;
+      const expense = year === usefulLifeYears ? _roundMoneyMcp(depreciableBase - accumulated) : _roundMoneyMcp(fraction * depreciableBase);
+      accumulated = _roundMoneyMcp(accumulated + expense);
+      schedule.push({ year, depreciationExpense: expense, accumulatedDepreciation: accumulated, bookValue: _roundMoneyMcp(cost - accumulated) });
+    }
+  }
+  return { cost, salvageValue, usefulLifeYears, method, totalDepreciation: accumulated, schedule };
+}
+server.tool(
+  "calculate_depreciation_schedule",
+  "Build a year-by-year depreciation schedule for a fixed asset from its cost, salvage value, and useful life in years, using straight-line, double-declining-balance, or sum-of-years-digits. The double-declining-balance method clamps at salvage value rather than auto-switching to straight-line partway through.",
+  {
+    cost: z.number().describe("The asset's original cost"),
+    salvageValue: z.number().describe("Estimated residual value at the end of its useful life; must be less than cost"),
+    usefulLifeYears: z.number().int().describe("Useful life in whole years"),
+    method: z.enum(["straight-line", "double-declining-balance", "sum-of-years-digits"]).describe("Depreciation method to use")
+  },
+  async ({ cost, salvageValue, usefulLifeYears, method }) => {
+    const result = _calculateDepreciationScheduleMcp(cost, salvageValue, usefulLifeYears, method);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+var _KEYWORD_DENSITY_STOPWORDS_MCP = /* @__PURE__ */ new Set([
+  "a",
+  "an",
+  "the",
+  "and",
+  "or",
+  "but",
+  "if",
+  "then",
+  "else",
+  "for",
+  "nor",
+  "so",
+  "yet",
+  "of",
+  "in",
+  "on",
+  "at",
+  "to",
+  "from",
+  "by",
+  "with",
+  "about",
+  "against",
+  "between",
+  "into",
+  "through",
+  "during",
+  "before",
+  "after",
+  "above",
+  "below",
+  "up",
+  "down",
+  "out",
+  "off",
+  "over",
+  "under",
+  "again",
+  "further",
+  "once",
+  "is",
+  "are",
+  "was",
+  "were",
+  "be",
+  "been",
+  "being",
+  "am",
+  "do",
+  "does",
+  "did",
+  "doing",
+  "have",
+  "has",
+  "had",
+  "having",
+  "i",
+  "me",
+  "my",
+  "we",
+  "our",
+  "you",
+  "your",
+  "he",
+  "him",
+  "his",
+  "she",
+  "her",
+  "it",
+  "its",
+  "they",
+  "them",
+  "their",
+  "this",
+  "that",
+  "these",
+  "those",
+  "as",
+  "not",
+  "no",
+  "can",
+  "will",
+  "just",
+  "than",
+  "too",
+  "very",
+  "would",
+  "should",
+  "could",
+  "there",
+  "here",
+  "what",
+  "which",
+  "who",
+  "whom"
+]);
+function _analyzeKeywordDensityMcp(input, topN, minWordLength, ngramSize) {
+  if (!input || !input.trim()) return { error: "Input text is empty" };
+  if (!Number.isInteger(topN) || topN <= 0) return { error: "topN must be a positive whole number" };
+  if (!Number.isInteger(minWordLength) || minWordLength < 1) return { error: "minWordLength must be a positive whole number" };
+  if (!Number.isInteger(ngramSize) || ngramSize < 1 || ngramSize > 3) return { error: "ngramSize must be 1, 2, or 3" };
+  const tokens = input.toLowerCase().match(/[a-z0-9']+/g) ?? [];
+  const totalWords = tokens.length;
+  if (totalWords === 0) return { error: "No words found in input text" };
+  if (totalWords < ngramSize) return { error: "Input text has fewer words than the requested phrase length" };
+  const counts = /* @__PURE__ */ new Map();
+  for (let i = 0; i <= tokens.length - ngramSize; i++) {
+    const phraseWords = tokens.slice(i, i + ngramSize);
+    if (phraseWords.some((w) => w.length < minWordLength)) continue;
+    if (ngramSize === 1 && _KEYWORD_DENSITY_STOPWORDS_MCP.has(phraseWords[0])) continue;
+    const phrase = phraseWords.join(" ");
+    counts.set(phrase, (counts.get(phrase) ?? 0) + 1);
+  }
+  const keywords = Array.from(counts.entries()).map(([keyword, count]) => ({ keyword, count, density: Math.round(count / totalWords * 1e3) / 10 })).sort((a, b) => b.count - a.count || a.keyword.localeCompare(b.keyword)).slice(0, topN);
+  return { totalWords, uniqueKeywords: counts.size, ngramSize, keywords };
+}
+server.tool(
+  "analyze_keyword_density",
+  "Count keyword or phrase frequency and density (occurrences per 100 words) across a block of text, the way an SEO keyword-density checker does. With the default ngramSize of 1, common English stopwords and words shorter than minWordLength are excluded; for ngramSize 2 or 3 (phrases), stopwords are kept since useful phrases often contain them.",
+  {
+    text: z.string().describe("The text to analyze"),
+    topN: z.number().int().optional().describe("Number of top keywords/phrases to return (default 10)"),
+    minWordLength: z.number().int().optional().describe("Minimum word length to include (default 3)"),
+    ngramSize: z.number().int().min(1).max(3).optional().describe("Phrase length in words: 1 for single words, 2 or 3 for phrases (default 1)")
+  },
+  async ({ text: input, topN, minWordLength, ngramSize }) => {
+    const result = _analyzeKeywordDensityMcp(input, topN ?? 10, minWordLength ?? 3, ngramSize ?? 1);
+    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,6 +1,6 @@
 {
   "name": "@utilix-tech/mcp",
-  "version": "0.46.0",
+  "version": "0.47.0",
   "description": "MCP server exposing 175 Utilix developer tools to Claude, Cursor, VS Code Copilot, and any MCP-compatible AI assistant.",
   "author": "Utilix <hello@utilix.tech>",
   "license": "MIT",