@obov/mext 0.0.0-stage → 0.2.0

package/dist/suggest.js

@@ -0,0 +1,45 @@
+/** 최적 문자열 정렬 (제한된 Damerau-Levenshtein) 거리 */
+export function editDistance(a, b) {
+    const rows = a.length + 1;
+    const cols = b.length + 1;
+    const d = Array.from({ length: rows }, (_, i) => {
+        const row = new Array(cols).fill(0);
+        row[0] = i;
+        return row;
+    });
+    for (let j = 0; j < cols; j++)
+        d[0][j] = j;
+    for (let i = 1; i < rows; i++) {
+        for (let j = 1; j < cols; j++) {
+            const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+            let v = Math.min(d[i - 1][j] + 1, d[i][j - 1] + 1, d[i - 1][j - 1] + cost);
+            if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1])
+                v = Math.min(v, d[i - 2][j - 2] + 1);
+            d[i][j] = v;
+        }
+    }
+    return d[a.length][b.length];
+}
+/**
+ * 후보 중 query 와 가까운 것 (가까운 순 · 같은 거리는 이름 순).
+ * 후보는 [비교할 이름, 돌려줄 값]. 같은 값은 한 번만.
+ */
+export function closest(query, candidates, limit = 3) {
+    const q = query.toLowerCase();
+    const threshold = Math.max(2, Math.floor(q.length / 3));
+    const best = new Map();
+    for (const [name, value] of candidates) {
+        const n = name.toLowerCase();
+        const distance = editDistance(q, n);
+        if (distance > threshold)
+            continue;
+        const prev = best.get(value);
+        if (prev === undefined || distance < prev)
+            best.set(value, distance);
+    }
+    return [...best]
+        .sort((x, y) => x[1] - y[1] || (x[0] < y[0] ? -1 : x[0] > y[0] ? 1 : 0))
+        .slice(0, limit)
+        .map(([value]) => value);
+}
+//# sourceMappingURL=suggest.js.map

package/dist/suggest.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"suggest.js","sourceRoot":"","sources":["../src/suggest.ts"],"names":[],"mappings":"AAAA,6CAA6C;AAC7C,MAAM,UAAU,YAAY,CAAC,CAAS,EAAE,CAAS;IAC/C,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAA;IACzB,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAA;IACzB,MAAM,CAAC,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1D,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC3C,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACV,OAAO,GAAG,CAAA;IACZ,CAAC,CAAC,CAAA;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC1C,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,CAAA;YAChF,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC,CAAA;YAC5G,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACd,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,CAAC,CAAC,MAAM,CAAE,CAAA;AAChC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,OAAO,CAAC,KAAa,EAAE,UAA+C,EAAE,KAAK,GAAG,CAAC;IAC/F,MAAM,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAA;IAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;IACvD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;IACtC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QAC5B,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACnC,IAAI,QAAQ,GAAG,SAAS;YAAE,SAAQ;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QAC5B,IAAI,IAAI,KAAK,SAAS,IAAI,QAAQ,GAAG,IAAI;YAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;IACtE,CAAC;IACD,OAAO,CAAC,GAAG,IAAI,CAAC;SACb,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACvE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;SACf,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAA;AAC5B,CAAC","sourcesContent":["/** 최적 문자열 정렬 (제한된 Damerau-Levenshtein) 거리 */\nexport function editDistance(a: string, b: string): number {\n  const rows = a.length + 1\n  const cols = b.length + 1\n  const d: number[][] = Array.from({ length: rows }, (_, i) => {\n    const row = new Array<number>(cols).fill(0)\n    row[0] = i\n    return row\n  })\n  for (let j = 0; j < cols; j++) d[0]![j] = j\n  for (let i = 1; i < rows; i++) {\n    for (let j = 1; j < cols; j++) {\n      const cost = a[i - 1] === b[j - 1] ? 0 : 1\n      let v = Math.min(d[i - 1]![j]! + 1, d[i]![j - 1]! + 1, d[i - 1]![j - 1]! + cost)\n      if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) v = Math.min(v, d[i - 2]![j - 2]! + 1)\n      d[i]![j] = v\n    }\n  }\n  return d[a.length]![b.length]!\n}\n\n/**\n * 후보 중 query 와 가까운 것 (가까운 순 · 같은 거리는 이름 순).\n * 후보는 [비교할 이름, 돌려줄 값]. 같은 값은 한 번만.\n */\nexport function closest(query: string, candidates: Iterable<readonly [string, string]>, limit = 3): string[] {\n  const q = query.toLowerCase()\n  const threshold = Math.max(2, Math.floor(q.length / 3))\n  const best = new Map<string, number>()\n  for (const [name, value] of candidates) {\n    const n = name.toLowerCase()\n    const distance = editDistance(q, n)\n    if (distance > threshold) continue\n    const prev = best.get(value)\n    if (prev === undefined || distance < prev) best.set(value, distance)\n  }\n  return [...best]\n    .sort((x, y) => x[1] - y[1] || (x[0] < y[0] ? -1 : x[0] > y[0] ? 1 : 0))\n    .slice(0, limit)\n    .map(([value]) => value)\n}\n"]}

package/dist/version.d.ts

@@ -0,0 +1,4 @@
+/** @obov/mext 버전 상수 (원격 클라이언트 clientInfo 등). 고객 CLI 번들이 package.json 을 읽지 않도록 상수 */
+export declare const VERSION = "0.0.0";
+/** 설치된 @obov/mext 의 package.json version (빌드 manifest 의 mextVersion · 시작 시 비교) */
+export declare function mextVersion(): string;

package/dist/version.js

@@ -0,0 +1,13 @@
+import { readFileSync } from "node:fs";
+/** @obov/mext 버전 상수 (원격 클라이언트 clientInfo 등). 고객 CLI 번들이 package.json 을 읽지 않도록 상수 */
+export const VERSION = "0.0.0";
+let cached;
+/** 설치된 @obov/mext 의 package.json version (빌드 manifest 의 mextVersion · 시작 시 비교) */
+export function mextVersion() {
+    if (cached === undefined) {
+        const pkg = JSON.parse(readFileSync(new URL("../package.json", import.meta.url), "utf8"));
+        cached = pkg.version ?? "0.0.0";
+    }
+    return cached;
+}
+//# sourceMappingURL=version.js.map

package/dist/version.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"version.js","sourceRoot":"","sources":["../src/version.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAA;AAEtC,oFAAoF;AACpF,MAAM,CAAC,MAAM,OAAO,GAAG,OAAO,CAAA;AAE9B,IAAI,MAA0B,CAAA;AAE9B,kFAAkF;AAClF,MAAM,UAAU,WAAW;IACzB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,iBAAiB,EAAE,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAyB,CAAA;QACjH,MAAM,GAAG,GAAG,CAAC,OAAO,IAAI,OAAO,CAAA;IACjC,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC","sourcesContent":["import { readFileSync } from \"node:fs\"\n\n/** @obov/mext 버전 상수 (원격 클라이언트 clientInfo 등). 고객 CLI 번들이 package.json 을 읽지 않도록 상수 */\nexport const VERSION = \"0.0.0\"\n\nlet cached: string | undefined\n\n/** 설치된 @obov/mext 의 package.json version (빌드 manifest 의 mextVersion · 시작 시 비교) */\nexport function mextVersion(): string {\n  if (cached === undefined) {\n    const pkg = JSON.parse(readFileSync(new URL(\"../package.json\", import.meta.url), \"utf8\")) as { version?: string }\n    cached = pkg.version ?? \"0.0.0\"\n  }\n  return cached\n}\n"]}

package/package.json

@@ -1,6 +1,51 @@
 {
   "name": "@obov/mext",
-  "version": "0.0.0-stage",
-  "stub": true,
-  "description": "Temporary package placeholder for staged publishing"
-}
+  "version": "0.2.0",
+  "description": "File-based commands exposed as both CLI and MCP server (Streamable HTTP · stdio, MCP 2026-07-28)",
+  "license": "MIT",
+  "type": "module",
+  "exports": {
+    ".": {
+      "src": "./src/index.ts",
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    },
+    "./start": {
+      "src": "./src/start.ts",
+      "types": "./dist/start.d.ts",
+      "default": "./dist/start.js"
+    }
+  },
+  "bin": {
+    "mext": "./dist/cli/bin.js"
+  },
+  "files": [
+    "dist"
+  ],
+  "scripts": {
+    "build": "node -e \"require('node:fs').rmSync('dist',{recursive:true,force:true})\" && tsc -p tsconfig.build.json && node -e \"require('node:fs').chmodSync('dist/cli/bin.js',0o755)\"",
+    "prepack": "npm run build"
+  },
+  "engines": {
+    "node": ">=22.18"
+  },
+  "dependencies": {
+    "@modelcontextprotocol/server": "^2.4.0",
+    "zod": "^4.6.7"
+  },
+  "peerDependencies": {
+    "@opentelemetry/api": "^1.9.0",
+    "rolldown": "^1.2.16"
+  },
+  "peerDependenciesMeta": {
+    "@opentelemetry/api": {
+      "optional": true
+    },
+    "rolldown": {
+      "optional": true
+    }
+  },
+  "devDependencies": {
+    "rolldown": "^1.2.16"
+  }
+}

package/README.md

@@ -1,3 +0,0 @@
-# Temporary Holding Version
-
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.