@ttoss/http-server-mcp 0.34.0 → 0.34.2

package/README.md

@@ -484,14 +484,14 @@ registerTools({ server: fullServer, tools });
 registerTools({ server: deferredServer, tools, defer: true });
 ```
 
-A schema enters the model's context only for the tools it is about to use. `call` enforces the tool's schema as a direct call would, and its errors help the model recover: an unknown name answers suggestions, and invalid arguments, a tool's own error result, or a thrown error carry the input schema, so a `call` made without `describe` corrects itself in one retry.
+A schema enters the model's context only for the tools it is about to use. `call` enforces the tool's schema as a direct call would, and its errors help the model recover: an unknown name answers suggestions (close typos first, then near-misses and tools sharing the name's words, by how much they share), and invalid arguments, a tool's own error result, or a thrown error carry the input schema, so a `call` made without `describe` corrects itself in one retry.
 
 Pass options instead of `true` to tune it:
 
 - `except` — tools kept standalone, not deferred; they stay reachable through `search` too. Defaults to those linked to an [MCP Apps](#mcp-apps-interactive-uis) view, since a host finds a view through the tool's own `tools/list` entry.
 - `visible` — runs on every `search`, `describe` and `call`; a tool it rejects is absent from all three. Standalone tools stay listed.
 - `search` — replaces the default ranking, `rankTools`, e.g. with embeddings.
-- `searchLimit` (default `10`) and `names` (default `search` / `describe` / `call`).
+- `searchLimit` (default `10`), `searchMaxLimit` — the largest `limit` accepted (default `50`, or `searchLimit` when higher) — and `names` (default `search` / `describe` / `call`).
 
 A gate (below) sees each call with the tool's own name and arguments, so authorization stays per tool when deferred.
 

package/dist/index.cjs

@@ -573,23 +573,29 @@ var scoreOf = ({
   }
   return score;
 };
+var withTag = ({
+  tag,
+  tools
+}) => {
+  return tag === void 0 ? tools : tools.filter(tool => {
+    return tool.tags?.includes(tag) ?? false;
+  });
+};
 /**
-* The deferred tools' default search: scores each tool by the query's terms,
-* weighted name > summary > tags > description, and breaks ties by the
-* tools' order. No index — a few hundred tools need none.
+* The tools `query` matches, best first, ties in the tools' order; `undefined`
+* when the query has no words.
 */
-var rankTools = ({
+var scoreTools = ({
   query,
   tag,
-  limit,
   tools
 }) => {
-  const candidates = tag === void 0 ? tools : tools.filter(tool => {
-    return tool.tags?.includes(tag) ?? false;
-  });
   const terms = [...new Set(termsOf(query))];
-  if (terms.length === 0) return candidates.slice(0, limit);
-  return candidates.map((tool, index) => {
+  if (terms.length === 0) return void 0;
+  return withTag({
+    tag,
+    tools
+  }).map((tool, index) => {
     return {
       tool,
       index,
@@ -604,7 +610,29 @@ var rankTools = ({
     return score > 0;
   }).sort((a, b) => {
     return b.score - a.score || a.index - b.index;
-  }).slice(0, limit).map(({
+  });
+};
+/**
+* The deferred tools' default search: scores each tool by the query's terms,
+* weighted name > summary > tags > description, and breaks ties by the
+* tools' order. No index — a few hundred tools need none.
+*/
+var rankTools = ({
+  query,
+  tag,
+  limit,
+  tools
+}) => {
+  const scored = scoreTools({
+    query,
+    tag,
+    tools
+  });
+  if (!scored) return withTag({
+    tag,
+    tools
+  }).slice(0, limit);
+  return scored.slice(0, limit).map(({
     tool
   }) => {
     return tool;
@@ -631,39 +659,53 @@ var editDistance = (a, b) => {
   }
   return row[b.length];
 };
-/** Names a model probably meant: near-misses first, then related tools. */
+/**
+* Names a model probably meant: close typos first, nearest first; then the
+* near-misses and the tools sharing the name's words, by word score, so a tool
+* holding every word outranks a distant near-miss.
+*/
 var suggestionsFor = ({
   name,
   tools
 }) => {
   const tolerance = Math.max(2, Math.floor(name.length / 3));
-  const nearMisses = tools.map(tool => {
+  const scores = new Map((scoreTools({
+    query: name,
+    tools
+  }) ?? []).map(({
+    tool,
+    score
+  }) => {
+    return [tool, score];
+  }));
+  const rankOf = distance => {
+    return Math.min(distance, 3);
+  };
+  return tools.map((tool, index) => {
     return {
-      name: tool.name,
-      distance: editDistance(name, tool.name)
+      tool,
+      index,
+      distance: editDistance(name, tool.name),
+      score: scores.get(tool) ?? 0
     };
   }).filter(({
-    distance
+    distance,
+    score
   }) => {
-    return distance <= tolerance;
+    return distance <= tolerance || score > 0;
   }).sort((a, b) => {
-    return a.distance - b.distance;
-  }).map(candidate => {
-    return candidate.name;
-  });
-  const related = rankTools({
-    query: name,
-    limit: SUGGESTION_COUNT,
-    tools
-  }).map(tool => {
+    return rankOf(a.distance) - rankOf(b.distance) || b.score - a.score || a.distance - b.distance || a.index - b.index;
+  }).slice(0, SUGGESTION_COUNT).map(({
+    tool
+  }) => {
     return tool.name;
   });
-  return [...new Set([...nearMisses, ...related])].slice(0, SUGGESTION_COUNT);
 };
 
 //#endregion
 //#region src/deferTools.ts
 var DEFAULT_SEARCH_LIMIT = 10;
+var DEFAULT_SEARCH_MAX_LIMIT = 50;
 var jsonResult = ({
   data,
   isError = false
@@ -708,6 +750,7 @@ var deferredToolsOf = ({
       tool
     }) : true;
   };
+  const searchLimit = options.searchLimit ?? DEFAULT_SEARCH_LIMIT;
   return {
     names: {
       search: "search",
@@ -716,7 +759,8 @@ var deferredToolsOf = ({
       ...options.names
     },
     tools,
-    searchLimit: options.searchLimit ?? DEFAULT_SEARCH_LIMIT,
+    searchLimit,
+    searchMaxLimit: options.searchMaxLimit ?? Math.max(DEFAULT_SEARCH_MAX_LIMIT, searchLimit),
     searchTools: options.search ?? rankTools,
     visibleTools: () => {
       return tools.filter(isVisible);
@@ -731,6 +775,7 @@ var searchToolOf = ({
   names,
   tools,
   searchLimit,
+  searchMaxLimit,
   searchTools,
   visibleTools
 }) => {
@@ -745,7 +790,7 @@ var searchToolOf = ({
       properties: {
         query: {
           type: "string",
-          description: "Words describing the action, e.g. \"create agent\". Empty lists every tool."
+          description: "Words describing the action, e.g. \"create agent\". Empty lists the tools in order."
         },
         tag: {
           type: "string",
@@ -757,6 +802,7 @@ var searchToolOf = ({
         limit: {
           type: "integer",
           minimum: 1,
+          maximum: searchMaxLimit,
           description: `Maximum number of results. Defaults to ${searchLimit}.`
         }
       },

package/dist/index.d.cts

@@ -865,6 +865,12 @@ interface DeferToolsOptions {
    * @default 10
    */
   searchLimit?: number;
+  /**
+   * The largest `limit` `search` accepts. With no ceiling, an empty query
+   * lists every tool, more than a client's context holds.
+   * @default 50, or `searchLimit` when that is higher
+   */
+  searchMaxLimit?: number;
   /**
    * Runs on every `search`, `describe` and `call`. A tool it rejects is
    * absent from all three; `call` answers it as an unknown name. Tools

package/dist/index.d.mts

@@ -866,6 +866,12 @@ interface DeferToolsOptions {
    * @default 10
    */
   searchLimit?: number;
+  /**
+   * The largest `limit` `search` accepts. With no ceiling, an empty query
+   * lists every tool, more than a client's context holds.
+   * @default 50, or `searchLimit` when that is higher
+   */
+  searchMaxLimit?: number;
   /**
    * Runs on every `search`, `describe` and `call`. A tool it rejects is
    * absent from all three; `call` answers it as an unknown name. Tools

package/dist/index.mjs

@@ -570,23 +570,29 @@ var scoreOf = ({
   }
   return score;
 };
+var withTag = ({
+  tag,
+  tools
+}) => {
+  return tag === void 0 ? tools : tools.filter(tool => {
+    return tool.tags?.includes(tag) ?? false;
+  });
+};
 /**
-* The deferred tools' default search: scores each tool by the query's terms,
-* weighted name > summary > tags > description, and breaks ties by the
-* tools' order. No index — a few hundred tools need none.
+* The tools `query` matches, best first, ties in the tools' order; `undefined`
+* when the query has no words.
 */
-var rankTools = ({
+var scoreTools = ({
   query,
   tag,
-  limit,
   tools
 }) => {
-  const candidates = tag === void 0 ? tools : tools.filter(tool => {
-    return tool.tags?.includes(tag) ?? false;
-  });
   const terms = [...new Set(termsOf(query))];
-  if (terms.length === 0) return candidates.slice(0, limit);
-  return candidates.map((tool, index) => {
+  if (terms.length === 0) return void 0;
+  return withTag({
+    tag,
+    tools
+  }).map((tool, index) => {
     return {
       tool,
       index,
@@ -601,7 +607,29 @@ var rankTools = ({
     return score > 0;
   }).sort((a, b) => {
     return b.score - a.score || a.index - b.index;
-  }).slice(0, limit).map(({
+  });
+};
+/**
+* The deferred tools' default search: scores each tool by the query's terms,
+* weighted name > summary > tags > description, and breaks ties by the
+* tools' order. No index — a few hundred tools need none.
+*/
+var rankTools = ({
+  query,
+  tag,
+  limit,
+  tools
+}) => {
+  const scored = scoreTools({
+    query,
+    tag,
+    tools
+  });
+  if (!scored) return withTag({
+    tag,
+    tools
+  }).slice(0, limit);
+  return scored.slice(0, limit).map(({
     tool
   }) => {
     return tool;
@@ -628,39 +656,53 @@ var editDistance = (a, b) => {
   }
   return row[b.length];
 };
-/** Names a model probably meant: near-misses first, then related tools. */
+/**
+* Names a model probably meant: close typos first, nearest first; then the
+* near-misses and the tools sharing the name's words, by word score, so a tool
+* holding every word outranks a distant near-miss.
+*/
 var suggestionsFor = ({
   name,
   tools
 }) => {
   const tolerance = Math.max(2, Math.floor(name.length / 3));
-  const nearMisses = tools.map(tool => {
+  const scores = new Map((scoreTools({
+    query: name,
+    tools
+  }) ?? []).map(({
+    tool,
+    score
+  }) => {
+    return [tool, score];
+  }));
+  const rankOf = distance => {
+    return Math.min(distance, 3);
+  };
+  return tools.map((tool, index) => {
     return {
-      name: tool.name,
-      distance: editDistance(name, tool.name)
+      tool,
+      index,
+      distance: editDistance(name, tool.name),
+      score: scores.get(tool) ?? 0
     };
   }).filter(({
-    distance
+    distance,
+    score
   }) => {
-    return distance <= tolerance;
+    return distance <= tolerance || score > 0;
   }).sort((a, b) => {
-    return a.distance - b.distance;
-  }).map(candidate => {
-    return candidate.name;
-  });
-  const related = rankTools({
-    query: name,
-    limit: SUGGESTION_COUNT,
-    tools
-  }).map(tool => {
+    return rankOf(a.distance) - rankOf(b.distance) || b.score - a.score || a.distance - b.distance || a.index - b.index;
+  }).slice(0, SUGGESTION_COUNT).map(({
+    tool
+  }) => {
     return tool.name;
   });
-  return [...new Set([...nearMisses, ...related])].slice(0, SUGGESTION_COUNT);
 };
 
 //#endregion
 //#region src/deferTools.ts
 var DEFAULT_SEARCH_LIMIT = 10;
+var DEFAULT_SEARCH_MAX_LIMIT = 50;
 var jsonResult = ({
   data,
   isError = false
@@ -705,6 +747,7 @@ var deferredToolsOf = ({
       tool
     }) : true;
   };
+  const searchLimit = options.searchLimit ?? DEFAULT_SEARCH_LIMIT;
   return {
     names: {
       search: "search",
@@ -713,7 +756,8 @@ var deferredToolsOf = ({
       ...options.names
     },
     tools,
-    searchLimit: options.searchLimit ?? DEFAULT_SEARCH_LIMIT,
+    searchLimit,
+    searchMaxLimit: options.searchMaxLimit ?? Math.max(DEFAULT_SEARCH_MAX_LIMIT, searchLimit),
     searchTools: options.search ?? rankTools,
     visibleTools: () => {
       return tools.filter(isVisible);
@@ -728,6 +772,7 @@ var searchToolOf = ({
   names,
   tools,
   searchLimit,
+  searchMaxLimit,
   searchTools,
   visibleTools
 }) => {
@@ -742,7 +787,7 @@ var searchToolOf = ({
       properties: {
         query: {
           type: "string",
-          description: "Words describing the action, e.g. \"create agent\". Empty lists every tool."
+          description: "Words describing the action, e.g. \"create agent\". Empty lists the tools in order."
         },
         tag: {
           type: "string",
@@ -754,6 +799,7 @@ var searchToolOf = ({
         limit: {
           type: "integer",
           minimum: 1,
+          maximum: searchMaxLimit,
           description: `Maximum number of results. Defaults to ${searchLimit}.`
         }
       },

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ttoss/http-server-mcp",
-  "version": "0.34.0",
+  "version": "0.34.2",
   "description": "Model Context Protocol (MCP) server integration for @ttoss/http-server",
   "keywords": [
     "ai",
@@ -39,8 +39,8 @@
     "zod": "^4.4.3",
     "@ttoss/auth-core": "^0.16.1",
     "@ttoss/http-server": "^0.11.1",
-    "@ttoss/http-server-auth": "^0.8.1",
-    "@ttoss/i18n-core": "^0.7.0"
+    "@ttoss/i18n-core": "^0.7.0",
+    "@ttoss/http-server-auth": "^0.8.1"
   },
   "devDependencies": {
     "@modelcontextprotocol/client": "^2.0.0",