open-multi-agent-kit 0.90.4 → 0.90.6

package/dist/core/reasoning-router.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"reasoning-router.js","sourceRoot":"","sources":["../../src/core/reasoning-router.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAeH,+FAA+F;AAC/F,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAC7B,6GAA6G;AAC7G,MAAM,uBAAuB,GAAG,IAAI,CAAC;AAErC;;;;;GAKG;AACH,MAAM,gBAAgB,GAA6D;IAClF;QACC,SAAS,EAAE,OAAO;QAClB,OAAO,EACN,sKAAsK;KACvK;IACD;QACC,SAAS,EAAE,UAAU;QACrB,OAAO,EACN,gLAAgL;KACjL;IACD;QACC,SAAS,EAAE,QAAQ;QACnB,OAAO,EAAE,iGAAiG;KAC1G;IACD;QACC,SAAS,EAAE,MAAM;QACjB,OAAO,EACN,mLAAmL;KACpL;IACD;QACC,SAAS,EAAE,aAAa;QACxB,OAAO,EACN,+HAA+H;KAChI;IACD;QACC,SAAS,EAAE,UAAU;QACrB,OAAO,EACN,oIAAoI;KACrI;CACD,CAAC;AAEF,oFAAoF;AACpF,MAAM,mBAAmB,GAAyC;IACjE,OAAO,EAAE,MAAM;IACf,QAAQ,EAAE,QAAQ;IAClB,QAAQ,EAAE,QAAQ;IAClB,KAAK,EAAE,UAAU;IACjB,QAAQ,EAAE,QAAQ;IAClB,MAAM,EAAE,UAAU;CAClB,CAAC;AAEF,SAAS,YAAY,CAAC,IAAY,EAAW;IAC5C,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAAA,CAC5B;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,IAAY,EAAW;IAC9C,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACzE,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAAA,CACxD;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAC,KAA0B,EAAa;IACnE,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IAEnC,KAAK,MAAM,MAAM,IAAI,gBAAgB,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC,SAAS,CAAC;IAC1D,CAAC;IAED,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,cAAc,CAAC,MAAM,CAAC;QAAE,OAAO,UAAU,CAAC;IACtE,IAAI,MAAM,CAAC,MAAM,GAAG,iBAAiB;QAAE,OAAO,SAAS,CAAC;IACxD,IAAI,MAAM,CAAC,MAAM,IAAI,uBAAuB;QAAE,OAAO,MAAM,CAAC;IAC5D,IAAI,KAAK,CAAC,QAAQ;QAAE,OAAO,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC/D,OAAO,UAAU,CAAC;AAAA,CAClB;AAED,oFAAoF;AACpF,MAAM,gBAAgB,GAA6B,CAAC,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;AAExG,wGAAwG;AACxG,MAAM,CAAC,MAAM,0BAA0B,GAA+C;IACrF,OAAO,EAAE,SAAS;IAClB,aAAa,EAAE,KAAK;IACpB,UAAU,EAAE,QAAQ;IACpB,KAAK,EAAE,MAAM;IACb,QAAQ,EAAE,MAAM;IAChB,MAAM,EAAE,MAAM;IACd,IAAI,EAAE,OAAO;CACb,CAAC;AAEF,yFAAyF;AACzF,MAAM,SAAS,GAAyD;IACvE,OAAO,EAAE,CAAC;IACV,QAAQ,EAAE,CAAC;IACX,QAAQ,EAAE,CAAC,CAAC;CACZ,CAAC;AAEF;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,oBAAoB,CACnC,SAAoB,EACpB,eAAyC,EACzC,QAA4B,EACZ;IAChB,MAAM,SAAS,GAAG,gBAAgB,CAAC,OAAO,CAAC,0BAA0B,CAAC,SAAS,CAAC,CAAC,CAAC;IAClF,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEzF,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9F,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpC,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;IACpC,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,iBAAiB,CAAC,QAAQ,CAAC,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;IAC7D,CAAC;IACD,OAAO,iBAAiB,CAAC,CAAC,CAAC,CAAC;AAAA,CAC5B","sourcesContent":["/**\n * Reasoning-effort router: pure, side-effect-free task classification and\n * ThinkingLevel resolution for the `auto` thinking mode.\n *\n * Deterministic by construction: consumes only the prompt text and an optional\n * subagent lane type. No clock, randomness, I/O, or imports from session, TUI,\n * or provider code (the ThinkingLevel import below is type-only and erased).\n */\n\nimport type { ThinkingLevel } from \"omk-agent-core\";\n\n/** Closed set of task classes the router can assign to a turn. */\nexport type TaskClass = \"trivial\" | \"simple-edit\" | \"code-gen\" | \"debug\" | \"refactor\" | \"review\" | \"plan\";\n\n/** Subagent lane types recognized by the classifier and resolver. */\nexport type ReasoningLaneType = \"planner\" | \"security\" | \"explorer\" | \"coder\" | \"reviewer\" | \"tester\";\n\nexport interface TaskClassifierInput {\n\tprompt: string;\n\tlaneType?: ReasoningLaneType;\n}\n\n/** Prompts shorter than this (trimmed) classify as trivial when no stronger signal matches. */\nconst TRIVIAL_MAX_CHARS = 40;\n/** Prompts at/above this length with no keyword/code/diff signal are treated as long prose briefs (plan). */\nconst COMPLEX_PROSE_MIN_CHARS = 2400;\n\n/**\n * Keyword families in FIXED precedence order:\n * debug > refactor > review > plan > simple-edit > code-gen.\n * The first matching family wins; ties are impossible by construction.\n * Patterns are case-insensitive and stateless (no `g` flag, so no lastIndex carry-over).\n */\nconst KEYWORD_FAMILIES: ReadonlyArray<{ taskClass: TaskClass; pattern: RegExp }> = [\n\t{\n\t\ttaskClass: \"debug\",\n\t\tpattern:\n\t\t\t/\\b(debug(ging)?|bugs?|fix(es|ing|ed)?|errors?|exceptions?|crash(es|ing|ed)?|stack\\s*trace|traceback|regressions?|broken|fail(s|ing|ed|ure|ures)?|flaky|reproduce)\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"refactor\",\n\t\tpattern:\n\t\t\t/\\b(refactor(ing|ed)?|restructur(e|ing)|renam(e|ing)|extract(ing)?|clean\\s*up|cleanup|simplif(y|ying|ied)|deduplicat(e|ing)|reorganiz(e|ing)|rewrit(e|ing)|modulariz(e|ing))\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"review\",\n\t\tpattern: /\\b(review(s|ing|ed)?|audit(s|ing|ed)?|critique|assess(ing|ment)?|inspect(ing)?|lgtm|approve)\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"plan\",\n\t\tpattern:\n\t\t\t/\\b(plan(s|ning)?|design(s|ing)?|architect(s|ure|ing)?|roadmap|spec(s|ification|ifications)?|strateg(y|ies|ize)|decompos(e|ing|ition)|break\\s+(this\\s+|it\\s+)?down|milestones?)\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"simple-edit\",\n\t\tpattern:\n\t\t\t/\\b(typos?|tweak(s|ing|ed)?|one-?liner?|single\\s+line|bump(s|ing|ed)?|whitespace|reword(s|ing|ed)?|indentation|punctuation)\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"code-gen\",\n\t\tpattern:\n\t\t\t/\\b(implement(s|ing|ation)?|writ(e|ing)|creat(e|es|ing)|add(s|ing|ed)?|build(s|ing)?|generat(e|es|ing)|scaffold(ing)?|prototype)\\b/i,\n\t},\n];\n\n/** Fallback class per lane when no keyword, code/diff, or length signal decides. */\nconst LANE_FALLBACK_CLASS: Record<ReasoningLaneType, TaskClass> = {\n\tplanner: \"plan\",\n\tsecurity: \"review\",\n\texplorer: \"review\",\n\tcoder: \"code-gen\",\n\treviewer: \"review\",\n\ttester: \"code-gen\",\n};\n\nfunction hasCodeFence(text: string): boolean {\n\treturn text.includes(\"```\");\n}\n\n/**\n * Diff detection: explicit hunk (`@@ ... @@`) or `diff --git` headers count alone;\n * bare `+`/`-` line starts only count when both added AND removed lines are present\n * (avoids false positives on markdown bullet lists).\n */\nfunction hasDiffMarkers(text: string): boolean {\n\tif (/^@@[^\\n]*@@/m.test(text) || /^diff --git /m.test(text)) return true;\n\treturn /^\\+(?!\\+)/m.test(text) && /^-(?!-)/m.test(text);\n}\n\n/**\n * Classify a turn deterministically. Signal precedence (first match wins):\n * 1. Keyword families (debug > refactor > review > plan > simple-edit > code-gen)\n * 2. Code fence or diff markers -> code-gen\n * 3. Trimmed length < TRIVIAL_MAX_CHARS -> trivial\n * 4. Trimmed length >= COMPLEX_PROSE_MIN_CHARS -> plan (long prose brief)\n * 5. Lane fallback (see LANE_FALLBACK_CLASS)\n * 6. Default -> code-gen\n */\nexport function classifyTask(input: TaskClassifierInput): TaskClass {\n\tconst prompt = input.prompt.trim();\n\n\tfor (const family of KEYWORD_FAMILIES) {\n\t\tif (family.pattern.test(prompt)) return family.taskClass;\n\t}\n\n\tif (hasCodeFence(prompt) || hasDiffMarkers(prompt)) return \"code-gen\";\n\tif (prompt.length < TRIVIAL_MAX_CHARS) return \"trivial\";\n\tif (prompt.length >= COMPLEX_PROSE_MIN_CHARS) return \"plan\";\n\tif (input.laneType) return LANE_FALLBACK_CLASS[input.laneType];\n\treturn \"code-gen\";\n}\n\n/** Reasoning ladder used for targets and clamping. Intentionally excludes \"off\". */\nconst REASONING_LADDER: readonly ThinkingLevel[] = [\"minimal\", \"low\", \"medium\", \"high\", \"xhigh\", \"max\"];\n\n/** Static rule table: task class -> recommended ThinkingLevel (before lane adjustment and clamping). */\nexport const TASK_CLASS_THINKING_LEVELS: Readonly<Record<TaskClass, ThinkingLevel>> = {\n\ttrivial: \"minimal\",\n\t\"simple-edit\": \"low\",\n\t\"code-gen\": \"medium\",\n\tdebug: \"high\",\n\trefactor: \"high\",\n\treview: \"high\",\n\tplan: \"xhigh\",\n};\n\n/** Lane adjustment in ladder steps: planner/security escalate, explorer de-escalates. */\nconst LANE_STEP: Readonly<Partial<Record<ReasoningLaneType, 1 | -1>>> = {\n\tplanner: 1,\n\tsecurity: 1,\n\texplorer: -1,\n};\n\n/**\n * Resolve the recommended ThinkingLevel for a task class:\n * 1. Look up the static rule table.\n * 2. Apply the lane adjustment (one ladder step, saturating at ladder ends).\n * 3. Clamp to the highest level in `availableLevels` that is <= the target;\n *    if no available level is at/below the target, return the lowest available\n *    reasoning level. Never invents a level outside `availableLevels`.\n *\n * `\"off\"` is never a router output for reasoning models. If `availableLevels`\n * contains no ladder level at all (e.g. a non-reasoning model exposing only\n * \"off\"), the first available level is returned; callers are expected to\n * bypass the router entirely for models with `reasoning: false`.\n */\nexport function resolveThinkingLevel(\n\ttaskClass: TaskClass,\n\tavailableLevels: readonly ThinkingLevel[],\n\tlaneType?: ReasoningLaneType,\n): ThinkingLevel {\n\tconst baseIndex = REASONING_LADDER.indexOf(TASK_CLASS_THINKING_LEVELS[taskClass]);\n\tconst step = laneType ? (LANE_STEP[laneType] ?? 0) : 0;\n\tconst targetIndex = Math.min(Math.max(baseIndex + step, 0), REASONING_LADDER.length - 1);\n\n\tconst availableOnLadder = REASONING_LADDER.filter((level) => availableLevels.includes(level));\n\tif (availableOnLadder.length === 0) {\n\t\treturn availableLevels[0] ?? \"off\";\n\t}\n\n\tfor (let i = targetIndex; i >= 0; i--) {\n\t\tconst candidate = REASONING_LADDER[i];\n\t\tif (availableOnLadder.includes(candidate)) return candidate;\n\t}\n\treturn availableOnLadder[0];\n}\n"]}

package/dist/core/token-optimizer.d.ts

@@ -1,58 +0,0 @@
-import { EventEmitter } from "events";
-export interface TokenOptimizationResult {
-    originalQuery: string;
-    optimizedQuery: string;
-    tokensSaved: number;
-    technique: string;
-    cacheHit: boolean;
-    budgetExceeded: boolean;
-}
-export interface TokenOptimizerRuntimeStatus {
-    readonly optimizerId: "legacy-token-optimizer";
-    readonly status: "quarantined_compatibility";
-    readonly active: false;
-    readonly activeContextBudgetOptimizer: "context-budget-v2";
-    readonly compatibilityOnly: true;
-}
-export declare function getTokenOptimizerRuntimeStatus(): TokenOptimizerRuntimeStatus;
-export declare class LosslessCompressor extends EventEmitter {
-    compress(query: string): {
-        compressed: string;
-        tokensSaved: number;
-    };
-}
-export declare class LazyExecutor extends EventEmitter {
-    private memoCache;
-    execute<T>(taskId: string, fn: () => T, force?: boolean): T;
-    clear(): void;
-}
-export declare class AdaptiveBudget extends EventEmitter {
-    private budget;
-    private used;
-    private history;
-    constructor(initialBudget?: number);
-    allocate(tokens: number): boolean;
-    getStats(): {
-        budget: number;
-        used: number;
-        remaining: number;
-        utilization: number;
-    };
-    adjustBudget(newBudget: number): void;
-}
-export declare class TokenOptimizer extends EventEmitter {
-    private compressor;
-    private executor;
-    private budget;
-    constructor(budget?: number);
-    optimize(query: string): TokenOptimizationResult;
-    lazyExecute<T>(taskId: string, fn: () => T): T;
-    getBudgetStats(): {
-        budget: number;
-        used: number;
-        remaining: number;
-        utilization: number;
-    };
-}
-export default TokenOptimizer;
-//# sourceMappingURL=token-optimizer.d.ts.map

package/dist/core/token-optimizer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"token-optimizer.d.ts","sourceRoot":"","sources":["../../src/core/token-optimizer.ts"],"names":[],"mappings":"AAqBA,OAAO,EAAE,YAAY,EAAE,MAAM,QAAQ,CAAC;AAmDtC,MAAM,WAAW,uBAAuB;IACvC,aAAa,EAAE,MAAM,CAAC;IACtB,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,OAAO,CAAC;IAClB,cAAc,EAAE,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,2BAA2B;IAC3C,QAAQ,CAAC,WAAW,EAAE,wBAAwB,CAAC;IAC/C,QAAQ,CAAC,MAAM,EAAE,2BAA2B,CAAC;IAC7C,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC;IACvB,QAAQ,CAAC,4BAA4B,EAAE,mBAAmB,CAAC;IAC3D,QAAQ,CAAC,iBAAiB,EAAE,IAAI,CAAC;CACjC;AAED,wBAAgB,8BAA8B,IAAI,2BAA2B,CAQ5E;AAYD,qBAAa,kBAAmB,SAAQ,YAAY;IACnD,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAYnE;CACD;AAMD,qBAAa,YAAa,SAAQ,YAAY;IAC7C,OAAO,CAAC,SAAS,CAAmC;IAEpD,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,KAAK,UAAQ,GAAG,CAAC,CAOxD;IAED,KAAK,IAAI,IAAI,CAEZ;CACD;AAMD,qBAAa,cAAe,SAAQ,YAAY;IAC/C,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,IAAI,CAAa;IACzB,OAAO,CAAC,OAAO,CAA6C;IAE5D,YAAY,aAAa,SAAQ,EAGhC;IAED,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAQhC;IAED,QAAQ,IAAI;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAOnF;IAED,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAGpC;CACD;AAMD,qBAAa,cAAe,SAAQ,YAAY;IAC/C,OAAO,CAAC,UAAU,CAAqB;IACvC,OAAO,CAAC,QAAQ,CAAe;IAC/B,OAAO,CAAC,MAAM,CAAiB;IAE/B,YAAY,MAAM,SAAQ,EAKzB;IAED,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,uBAAuB,CAkB/C;IAED,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAE7C;IAED,cAAc,IAAI;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAEzF;CACD;AAED,eAAe,cAAc,CAAC","sourcesContent":["// packages/coding-agent/src/core/token-optimizer.ts\n// ===========================================\n//\n// @deprecated 이 모듈은 현재 코드베이스 어디에서도 import되지 않는 dead code입니다.\n// 어떤 파일도 이 모듈의 클래스를 직접 사용하지 않습니다.\n// 향후 토큰 최적화가 필요하면 headroom/global-context-compressor를 사용하세요.\n//\n// LosslessCompressor 계약:\n//   compress() 출력은 의미적으로 원본과 동일해야 합니다.\n//   - 문장 내 단어를 제거/대체/재배치하지 않습니다 (중복 단어 포함).\n//   - 연속 공백/탭/줄바꿈 정규화만 수행합니다 (의미 불변).\n//   - tokensSaved는 실제 토큰 수 차이를 보고합니다 (과대 계산 금지).\n//\n// v2.0 변경사항:\n//   - [fix] Result deduplication 로직 제거 (중복 단어 제거 → 의미 파괴 버그)\n//   - [fix] abbreviationMap 제거 (문맥 의존적 축약은 손실/lossy)\n//   - [fix] templateCache 제거 (32비트 해시 충돌 시 잘못된 압축 반환)\n//   - [fix] tokensSaved를 estimateTokens() 기반으로 정확화\n//   - [fix] tokensSaved가 음수가 될 수 없음 보장\n//   - compress()는 whitespace 정규화만 수행 (진정한 lossless)\n\nimport { EventEmitter } from \"events\";\n\n// ---------------------------------------------------------------------------\n// 토큰 추정 — BPE 토크나이저 근사\n// ---------------------------------------------------------------------------\n// OpenAI BPE 토크나이저의 동작을 근사:\n//   - 일반 영어 단어(빈도 높음)는 대개 1 토큰\n//   - 긴/드문 단어는 1 + ceil((len - 1) / 4) 토큰으로 분할\n//   - 구두점/특수문자는 보통 각각 1 토큰\n//   - 공백 문자는 단어 접두사로 병합되므로 별도 토큰이 아님\n//   - CJK 문자는 보통 1자 = 1~2 토큰\n\nfunction estimateTokens(text: string): number {\n\tif (text.length === 0) return 0;\n\n\tlet tokens = 0;\n\t// 공백으로 분할 — 각 청크를 개별적으로 추정\n\tconst chunks = text.split(/(\\s+)/);\n\n\tfor (const chunk of chunks) {\n\t\tif (chunk.length === 0) continue;\n\t\tif (/^\\s+$/.test(chunk)) {\n\t\t\t// 공백 문자열 — BPE에서 단어 접두사로 병합됨, 토큰 0\n\t\t\tcontinue;\n\t\t}\n\n\t\t// CJK 문자 분리 (유니코드 범위: 한글, 한자, 가타나)\n\t\tconst cjkChars = chunk.match(/[\\u3000-\\u9fff\\uf900-\\ufaff]/g);\n\t\tif (cjkChars) {\n\t\t\t// CJK: 1자 ≈ 1.5 토큰 (평균)\n\t\t\ttokens += Math.ceil(cjkChars.length * 1.5);\n\t\t\tcontinue;\n\t\t}\n\n\t\t// 영어 단어/숫자/구두점 청크\n\t\tif (chunk.length <= 6) {\n\t\t\t// 짧은 단어(빈도 높음): 대개 단일 토큰\n\t\t\ttokens += 1;\n\t\t} else {\n\t\t\t// 긴 단어: BPE가 subword로 분할 → 1 + 분할 조각 수\n\t\t\ttokens += 1 + Math.ceil((chunk.length - 1) / 4);\n\t\t}\n\t}\n\n\treturn tokens;\n}\n\n// ---------------------------------------------------------------------------\n// 인터페이스 (역호환)\n// ---------------------------------------------------------------------------\n\nexport interface TokenOptimizationResult {\n\toriginalQuery: string;\n\toptimizedQuery: string;\n\ttokensSaved: number;\n\ttechnique: string;\n\tcacheHit: boolean;\n\tbudgetExceeded: boolean;\n}\n\nexport interface TokenOptimizerRuntimeStatus {\n\treadonly optimizerId: \"legacy-token-optimizer\";\n\treadonly status: \"quarantined_compatibility\";\n\treadonly active: false;\n\treadonly activeContextBudgetOptimizer: \"context-budget-v2\";\n\treadonly compatibilityOnly: true;\n}\n\nexport function getTokenOptimizerRuntimeStatus(): TokenOptimizerRuntimeStatus {\n\treturn {\n\t\toptimizerId: \"legacy-token-optimizer\",\n\t\tstatus: \"quarantined_compatibility\",\n\t\tactive: false,\n\t\tactiveContextBudgetOptimizer: \"context-budget-v2\",\n\t\tcompatibilityOnly: true,\n\t};\n}\n\n// ---------------------------------------------------------------------------\n// LosslessCompressor — 진정한 무손실 압축\n// ---------------------------------------------------------------------------\n// 압축 후 역압축 시 원본 복원 가능(의미 100% 보존).\n// 수행하는 변환:\n//   1. 연속 공백/탭 → 단일 공백\n//   2. 앞뒤 공백 제거(trim)\n//\n// 이 두 변환만 수행합니다. 어떤 단어도 제거/대체하지 않습니다.\n\nexport class LosslessCompressor extends EventEmitter {\n\tcompress(query: string): { compressed: string; tokensSaved: number } {\n\t\tconst originalTokens = estimateTokens(query);\n\n\t\t// 1. 연속 공백/탭 → 단일 공백\n\t\t// 2. trim\n\t\tconst compressed = query.replace(/[ \\t]+/g, \" \").trim();\n\n\t\tconst compressedTokens = estimateTokens(compressed);\n\t\t// tokensSaved는 0 이상 — 정규화가 토큰을 줄이지 않으면 0\n\t\tconst tokensSaved = Math.max(0, originalTokens - compressedTokens);\n\n\t\treturn { compressed, tokensSaved };\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// LazyExecutor — 메모이제이션 실행기 (역호환)\n// ---------------------------------------------------------------------------\n\nexport class LazyExecutor extends EventEmitter {\n\tprivate memoCache: Map<string, unknown> = new Map();\n\n\texecute<T>(taskId: string, fn: () => T, force = false): T {\n\t\tif (!force && this.memoCache.has(taskId)) {\n\t\t\treturn this.memoCache.get(taskId) as T;\n\t\t}\n\t\tconst result = fn();\n\t\tthis.memoCache.set(taskId, result);\n\t\treturn result;\n\t}\n\n\tclear(): void {\n\t\tthis.memoCache.clear();\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// AdaptiveBudget — 토큰 예산 관리 (역호환)\n// ---------------------------------------------------------------------------\n\nexport class AdaptiveBudget extends EventEmitter {\n\tprivate budget: number;\n\tprivate used: number = 0;\n\tprivate history: { used: number; timestamp: number }[] = [];\n\n\tconstructor(initialBudget = 10000) {\n\t\tsuper();\n\t\tthis.budget = initialBudget;\n\t}\n\n\tallocate(tokens: number): boolean {\n\t\tif (this.used + tokens > this.budget) {\n\t\t\tthis.emit(\"budgetExceeded\", { used: this.used, requested: tokens, budget: this.budget });\n\t\t\treturn false;\n\t\t}\n\t\tthis.used += tokens;\n\t\tthis.history.push({ used: this.used, timestamp: Date.now() });\n\t\treturn true;\n\t}\n\n\tgetStats(): { budget: number; used: number; remaining: number; utilization: number } {\n\t\treturn {\n\t\t\tbudget: this.budget,\n\t\t\tused: this.used,\n\t\t\tremaining: this.budget - this.used,\n\t\t\tutilization: this.used / this.budget,\n\t\t};\n\t}\n\n\tadjustBudget(newBudget: number): void {\n\t\tthis.budget = newBudget;\n\t\tthis.emit(\"budgetAdjusted\", { newBudget });\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// TokenOptimizer — 통합 인터페이스 (역호환)\n// ---------------------------------------------------------------------------\n\nexport class TokenOptimizer extends EventEmitter {\n\tprivate compressor: LosslessCompressor;\n\tprivate executor: LazyExecutor;\n\tprivate budget: AdaptiveBudget;\n\n\tconstructor(budget = 10000) {\n\t\tsuper();\n\t\tthis.compressor = new LosslessCompressor();\n\t\tthis.executor = new LazyExecutor();\n\t\tthis.budget = new AdaptiveBudget(budget);\n\t}\n\n\toptimize(query: string): TokenOptimizationResult {\n\t\tconst originalTokens = estimateTokens(query);\n\n\t\tconst { compressed } = this.compressor.compress(query);\n\t\tconst optimizedTokens = estimateTokens(compressed);\n\n\t\tconst cacheHit = false; // templateCache 제거됨 — 항상 false\n\n\t\tconst budgetAllocated = this.budget.allocate(optimizedTokens);\n\n\t\treturn {\n\t\t\toriginalQuery: query,\n\t\t\toptimizedQuery: compressed,\n\t\t\ttokensSaved: Math.max(0, originalTokens - optimizedTokens),\n\t\t\ttechnique: \"whitespace_normalization\",\n\t\t\tcacheHit,\n\t\t\tbudgetExceeded: !budgetAllocated,\n\t\t};\n\t}\n\n\tlazyExecute<T>(taskId: string, fn: () => T): T {\n\t\treturn this.executor.execute(taskId, fn);\n\t}\n\n\tgetBudgetStats(): { budget: number; used: number; remaining: number; utilization: number } {\n\t\treturn this.budget.getStats();\n\t}\n}\n\nexport default TokenOptimizer;\n"]}

package/dist/core/token-optimizer.js

@@ -1,179 +0,0 @@
-// packages/coding-agent/src/core/token-optimizer.ts
-// ===========================================
-//
-// @deprecated 이 모듈은 현재 코드베이스 어디에서도 import되지 않는 dead code입니다.
-// 어떤 파일도 이 모듈의 클래스를 직접 사용하지 않습니다.
-// 향후 토큰 최적화가 필요하면 headroom/global-context-compressor를 사용하세요.
-//
-// LosslessCompressor 계약:
-//   compress() 출력은 의미적으로 원본과 동일해야 합니다.
-//   - 문장 내 단어를 제거/대체/재배치하지 않습니다 (중복 단어 포함).
-//   - 연속 공백/탭/줄바꿈 정규화만 수행합니다 (의미 불변).
-//   - tokensSaved는 실제 토큰 수 차이를 보고합니다 (과대 계산 금지).
-//
-// v2.0 변경사항:
-//   - [fix] Result deduplication 로직 제거 (중복 단어 제거 → 의미 파괴 버그)
-//   - [fix] abbreviationMap 제거 (문맥 의존적 축약은 손실/lossy)
-//   - [fix] templateCache 제거 (32비트 해시 충돌 시 잘못된 압축 반환)
-//   - [fix] tokensSaved를 estimateTokens() 기반으로 정확화
-//   - [fix] tokensSaved가 음수가 될 수 없음 보장
-//   - compress()는 whitespace 정규화만 수행 (진정한 lossless)
-import { EventEmitter } from "events";
-// ---------------------------------------------------------------------------
-// 토큰 추정 — BPE 토크나이저 근사
-// ---------------------------------------------------------------------------
-// OpenAI BPE 토크나이저의 동작을 근사:
-//   - 일반 영어 단어(빈도 높음)는 대개 1 토큰
-//   - 긴/드문 단어는 1 + ceil((len - 1) / 4) 토큰으로 분할
-//   - 구두점/특수문자는 보통 각각 1 토큰
-//   - 공백 문자는 단어 접두사로 병합되므로 별도 토큰이 아님
-//   - CJK 문자는 보통 1자 = 1~2 토큰
-function estimateTokens(text) {
-    if (text.length === 0)
-        return 0;
-    let tokens = 0;
-    // 공백으로 분할 — 각 청크를 개별적으로 추정
-    const chunks = text.split(/(\s+)/);
-    for (const chunk of chunks) {
-        if (chunk.length === 0)
-            continue;
-        if (/^\s+$/.test(chunk)) {
-            // 공백 문자열 — BPE에서 단어 접두사로 병합됨, 토큰 0
-            continue;
-        }
-        // CJK 문자 분리 (유니코드 범위: 한글, 한자, 가타나)
-        const cjkChars = chunk.match(/[\u3000-\u9fff\uf900-\ufaff]/g);
-        if (cjkChars) {
-            // CJK: 1자 ≈ 1.5 토큰 (평균)
-            tokens += Math.ceil(cjkChars.length * 1.5);
-            continue;
-        }
-        // 영어 단어/숫자/구두점 청크
-        if (chunk.length <= 6) {
-            // 짧은 단어(빈도 높음): 대개 단일 토큰
-            tokens += 1;
-        }
-        else {
-            // 긴 단어: BPE가 subword로 분할 → 1 + 분할 조각 수
-            tokens += 1 + Math.ceil((chunk.length - 1) / 4);
-        }
-    }
-    return tokens;
-}
-export function getTokenOptimizerRuntimeStatus() {
-    return {
-        optimizerId: "legacy-token-optimizer",
-        status: "quarantined_compatibility",
-        active: false,
-        activeContextBudgetOptimizer: "context-budget-v2",
-        compatibilityOnly: true,
-    };
-}
-// ---------------------------------------------------------------------------
-// LosslessCompressor — 진정한 무손실 압축
-// ---------------------------------------------------------------------------
-// 압축 후 역압축 시 원본 복원 가능(의미 100% 보존).
-// 수행하는 변환:
-//   1. 연속 공백/탭 → 단일 공백
-//   2. 앞뒤 공백 제거(trim)
-//
-// 이 두 변환만 수행합니다. 어떤 단어도 제거/대체하지 않습니다.
-export class LosslessCompressor extends EventEmitter {
-    compress(query) {
-        const originalTokens = estimateTokens(query);
-        // 1. 연속 공백/탭 → 단일 공백
-        // 2. trim
-        const compressed = query.replace(/[ \t]+/g, " ").trim();
-        const compressedTokens = estimateTokens(compressed);
-        // tokensSaved는 0 이상 — 정규화가 토큰을 줄이지 않으면 0
-        const tokensSaved = Math.max(0, originalTokens - compressedTokens);
-        return { compressed, tokensSaved };
-    }
-}
-// ---------------------------------------------------------------------------
-// LazyExecutor — 메모이제이션 실행기 (역호환)
-// ---------------------------------------------------------------------------
-export class LazyExecutor extends EventEmitter {
-    memoCache = new Map();
-    execute(taskId, fn, force = false) {
-        if (!force && this.memoCache.has(taskId)) {
-            return this.memoCache.get(taskId);
-        }
-        const result = fn();
-        this.memoCache.set(taskId, result);
-        return result;
-    }
-    clear() {
-        this.memoCache.clear();
-    }
-}
-// ---------------------------------------------------------------------------
-// AdaptiveBudget — 토큰 예산 관리 (역호환)
-// ---------------------------------------------------------------------------
-export class AdaptiveBudget extends EventEmitter {
-    budget;
-    used = 0;
-    history = [];
-    constructor(initialBudget = 10000) {
-        super();
-        this.budget = initialBudget;
-    }
-    allocate(tokens) {
-        if (this.used + tokens > this.budget) {
-            this.emit("budgetExceeded", { used: this.used, requested: tokens, budget: this.budget });
-            return false;
-        }
-        this.used += tokens;
-        this.history.push({ used: this.used, timestamp: Date.now() });
-        return true;
-    }
-    getStats() {
-        return {
-            budget: this.budget,
-            used: this.used,
-            remaining: this.budget - this.used,
-            utilization: this.used / this.budget,
-        };
-    }
-    adjustBudget(newBudget) {
-        this.budget = newBudget;
-        this.emit("budgetAdjusted", { newBudget });
-    }
-}
-// ---------------------------------------------------------------------------
-// TokenOptimizer — 통합 인터페이스 (역호환)
-// ---------------------------------------------------------------------------
-export class TokenOptimizer extends EventEmitter {
-    compressor;
-    executor;
-    budget;
-    constructor(budget = 10000) {
-        super();
-        this.compressor = new LosslessCompressor();
-        this.executor = new LazyExecutor();
-        this.budget = new AdaptiveBudget(budget);
-    }
-    optimize(query) {
-        const originalTokens = estimateTokens(query);
-        const { compressed } = this.compressor.compress(query);
-        const optimizedTokens = estimateTokens(compressed);
-        const cacheHit = false; // templateCache 제거됨 — 항상 false
-        const budgetAllocated = this.budget.allocate(optimizedTokens);
-        return {
-            originalQuery: query,
-            optimizedQuery: compressed,
-            tokensSaved: Math.max(0, originalTokens - optimizedTokens),
-            technique: "whitespace_normalization",
-            cacheHit,
-            budgetExceeded: !budgetAllocated,
-        };
-    }
-    lazyExecute(taskId, fn) {
-        return this.executor.execute(taskId, fn);
-    }
-    getBudgetStats() {
-        return this.budget.getStats();
-    }
-}
-export default TokenOptimizer;
-//# sourceMappingURL=token-optimizer.js.map

package/dist/core/token-optimizer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"token-optimizer.js","sourceRoot":"","sources":["../../src/core/token-optimizer.ts"],"names":[],"mappings":"AAAA,oDAAoD;AACpD,8CAA8C;AAC9C,EAAE;AACF,2GAA6D;AAC7D,gFAAkC;AAClC,iGAA6D;AAC7D,EAAE;AACF,6BAAyB;AACzB,2EAAuC;AACvC,8FAA4C;AAC5C,gFAAsC;AACtC,yFAAiD;AACjD,EAAE;AACF,qBAAa;AACb,+FAA6D;AAC7D,6EAAqD;AACrD,sFAAsD;AACtD,mEAAmD;AACnD,2DAAuC;AACvC,wEAAoD;AAEpD,OAAO,EAAE,YAAY,EAAE,MAAM,QAAQ,CAAC;AAEtC,8EAA8E;AAC9E,+CAAuB;AACvB,8EAA8E;AAC9E,kDAA4B;AAC5B,6DAA+B;AAC/B,uEAA+C;AAC/C,uDAA2B;AAC3B,mFAAqC;AACrC,6CAA6B;AAE7B,SAAS,cAAc,CAAC,IAAY,EAAU;IAC7C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEhC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,+DAA2B;IAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAEnC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACjC,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,yEAAmC;YACnC,SAAS;QACV,CAAC;QAED,qEAAmC;QACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC;QAC9D,IAAI,QAAQ,EAAE,CAAC;YACd,oCAAwB;YACxB,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;YAC3C,SAAS;QACV,CAAC;QAED,wCAAkB;QAClB,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACvB,qDAAyB;YACzB,MAAM,IAAI,CAAC,CAAC;QACb,CAAC;aAAM,CAAC;YACP,iEAAuC;YACvC,MAAM,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,CAAC;IACF,CAAC;IAED,OAAO,MAAM,CAAC;AAAA,CACd;AAuBD,MAAM,UAAU,8BAA8B,GAAgC;IAC7E,OAAO;QACN,WAAW,EAAE,wBAAwB;QACrC,MAAM,EAAE,2BAA2B;QACnC,MAAM,EAAE,KAAK;QACb,4BAA4B,EAAE,mBAAmB;QACjD,iBAAiB,EAAE,IAAI;KACvB,CAAC;AAAA,CACF;AAED,8EAA8E;AAC9E,oDAAkC;AAClC,8EAA8E;AAC9E,qEAAmC;AACnC,uBAAW;AACX,2CAAuB;AACvB,kCAAsB;AACtB,EAAE;AACF,wFAAsC;AAEtC,MAAM,OAAO,kBAAmB,SAAQ,YAAY;IACnD,QAAQ,CAAC,KAAa,EAA+C;QACpE,MAAM,cAAc,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QAE7C,yCAAqB;QACrB,UAAU;QACV,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAExD,MAAM,gBAAgB,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;QACpD,2EAAyC;QACzC,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,GAAG,gBAAgB,CAAC,CAAC;QAEnE,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;IAAA,CACnC;CACD;AAED,8EAA8E;AAC9E,4DAAkC;AAClC,8EAA8E;AAE9E,MAAM,OAAO,YAAa,SAAQ,YAAY;IACrC,SAAS,GAAyB,IAAI,GAAG,EAAE,CAAC;IAEpD,OAAO,CAAI,MAAc,EAAE,EAAW,EAAE,KAAK,GAAG,KAAK,EAAK;QACzD,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1C,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAM,CAAC;QACxC,CAAC;QACD,MAAM,MAAM,GAAG,EAAE,EAAE,CAAC;QACpB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAAA,CACd;IAED,KAAK,GAAS;QACb,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;IAAA,CACvB;CACD;AAED,8EAA8E;AAC9E,sDAAkC;AAClC,8EAA8E;AAE9E,MAAM,OAAO,cAAe,SAAQ,YAAY;IACvC,MAAM,CAAS;IACf,IAAI,GAAW,CAAC,CAAC;IACjB,OAAO,GAA0C,EAAE,CAAC;IAE5D,YAAY,aAAa,GAAG,KAAK,EAAE;QAClC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,aAAa,CAAC;IAAA,CAC5B;IAED,QAAQ,CAAC,MAAc,EAAW;QACjC,IAAI,IAAI,CAAC,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YACzF,OAAO,KAAK,CAAC;QACd,CAAC;QACD,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC;QACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAC9D,OAAO,IAAI,CAAC;IAAA,CACZ;IAED,QAAQ,GAA6E;QACpF,OAAO;YACN,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,SAAS,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI;YAClC,WAAW,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM;SACpC,CAAC;IAAA,CACF;IAED,YAAY,CAAC,SAAiB,EAAQ;QACrC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC;IAAA,CAC3C;CACD;AAED,8EAA8E;AAC9E,wDAAkC;AAClC,8EAA8E;AAE9E,MAAM,OAAO,cAAe,SAAQ,YAAY;IACvC,UAAU,CAAqB;IAC/B,QAAQ,CAAe;IACvB,MAAM,CAAiB;IAE/B,YAAY,MAAM,GAAG,KAAK,EAAE;QAC3B,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,IAAI,kBAAkB,EAAE,CAAC;QAC3C,IAAI,CAAC,QAAQ,GAAG,IAAI,YAAY,EAAE,CAAC;QACnC,IAAI,CAAC,MAAM,GAAG,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC;IAAA,CACzC;IAED,QAAQ,CAAC,KAAa,EAA2B;QAChD,MAAM,cAAc,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QAE7C,MAAM,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACvD,MAAM,eAAe,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;QAEnD,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,2CAA+B;QAEvD,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;QAE9D,OAAO;YACN,aAAa,EAAE,KAAK;YACpB,cAAc,EAAE,UAAU;YAC1B,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,GAAG,eAAe,CAAC;YAC1D,SAAS,EAAE,0BAA0B;YACrC,QAAQ;YACR,cAAc,EAAE,CAAC,eAAe;SAChC,CAAC;IAAA,CACF;IAED,WAAW,CAAI,MAAc,EAAE,EAAW,EAAK;QAC9C,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAAA,CACzC;IAED,cAAc,GAA6E;QAC1F,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;IAAA,CAC9B;CACD;AAED,eAAe,cAAc,CAAC","sourcesContent":["// packages/coding-agent/src/core/token-optimizer.ts\n// ===========================================\n//\n// @deprecated 이 모듈은 현재 코드베이스 어디에서도 import되지 않는 dead code입니다.\n// 어떤 파일도 이 모듈의 클래스를 직접 사용하지 않습니다.\n// 향후 토큰 최적화가 필요하면 headroom/global-context-compressor를 사용하세요.\n//\n// LosslessCompressor 계약:\n//   compress() 출력은 의미적으로 원본과 동일해야 합니다.\n//   - 문장 내 단어를 제거/대체/재배치하지 않습니다 (중복 단어 포함).\n//   - 연속 공백/탭/줄바꿈 정규화만 수행합니다 (의미 불변).\n//   - tokensSaved는 실제 토큰 수 차이를 보고합니다 (과대 계산 금지).\n//\n// v2.0 변경사항:\n//   - [fix] Result deduplication 로직 제거 (중복 단어 제거 → 의미 파괴 버그)\n//   - [fix] abbreviationMap 제거 (문맥 의존적 축약은 손실/lossy)\n//   - [fix] templateCache 제거 (32비트 해시 충돌 시 잘못된 압축 반환)\n//   - [fix] tokensSaved를 estimateTokens() 기반으로 정확화\n//   - [fix] tokensSaved가 음수가 될 수 없음 보장\n//   - compress()는 whitespace 정규화만 수행 (진정한 lossless)\n\nimport { EventEmitter } from \"events\";\n\n// ---------------------------------------------------------------------------\n// 토큰 추정 — BPE 토크나이저 근사\n// ---------------------------------------------------------------------------\n// OpenAI BPE 토크나이저의 동작을 근사:\n//   - 일반 영어 단어(빈도 높음)는 대개 1 토큰\n//   - 긴/드문 단어는 1 + ceil((len - 1) / 4) 토큰으로 분할\n//   - 구두점/특수문자는 보통 각각 1 토큰\n//   - 공백 문자는 단어 접두사로 병합되므로 별도 토큰이 아님\n//   - CJK 문자는 보통 1자 = 1~2 토큰\n\nfunction estimateTokens(text: string): number {\n\tif (text.length === 0) return 0;\n\n\tlet tokens = 0;\n\t// 공백으로 분할 — 각 청크를 개별적으로 추정\n\tconst chunks = text.split(/(\\s+)/);\n\n\tfor (const chunk of chunks) {\n\t\tif (chunk.length === 0) continue;\n\t\tif (/^\\s+$/.test(chunk)) {\n\t\t\t// 공백 문자열 — BPE에서 단어 접두사로 병합됨, 토큰 0\n\t\t\tcontinue;\n\t\t}\n\n\t\t// CJK 문자 분리 (유니코드 범위: 한글, 한자, 가타나)\n\t\tconst cjkChars = chunk.match(/[\\u3000-\\u9fff\\uf900-\\ufaff]/g);\n\t\tif (cjkChars) {\n\t\t\t// CJK: 1자 ≈ 1.5 토큰 (평균)\n\t\t\ttokens += Math.ceil(cjkChars.length * 1.5);\n\t\t\tcontinue;\n\t\t}\n\n\t\t// 영어 단어/숫자/구두점 청크\n\t\tif (chunk.length <= 6) {\n\t\t\t// 짧은 단어(빈도 높음): 대개 단일 토큰\n\t\t\ttokens += 1;\n\t\t} else {\n\t\t\t// 긴 단어: BPE가 subword로 분할 → 1 + 분할 조각 수\n\t\t\ttokens += 1 + Math.ceil((chunk.length - 1) / 4);\n\t\t}\n\t}\n\n\treturn tokens;\n}\n\n// ---------------------------------------------------------------------------\n// 인터페이스 (역호환)\n// ---------------------------------------------------------------------------\n\nexport interface TokenOptimizationResult {\n\toriginalQuery: string;\n\toptimizedQuery: string;\n\ttokensSaved: number;\n\ttechnique: string;\n\tcacheHit: boolean;\n\tbudgetExceeded: boolean;\n}\n\nexport interface TokenOptimizerRuntimeStatus {\n\treadonly optimizerId: \"legacy-token-optimizer\";\n\treadonly status: \"quarantined_compatibility\";\n\treadonly active: false;\n\treadonly activeContextBudgetOptimizer: \"context-budget-v2\";\n\treadonly compatibilityOnly: true;\n}\n\nexport function getTokenOptimizerRuntimeStatus(): TokenOptimizerRuntimeStatus {\n\treturn {\n\t\toptimizerId: \"legacy-token-optimizer\",\n\t\tstatus: \"quarantined_compatibility\",\n\t\tactive: false,\n\t\tactiveContextBudgetOptimizer: \"context-budget-v2\",\n\t\tcompatibilityOnly: true,\n\t};\n}\n\n// ---------------------------------------------------------------------------\n// LosslessCompressor — 진정한 무손실 압축\n// ---------------------------------------------------------------------------\n// 압축 후 역압축 시 원본 복원 가능(의미 100% 보존).\n// 수행하는 변환:\n//   1. 연속 공백/탭 → 단일 공백\n//   2. 앞뒤 공백 제거(trim)\n//\n// 이 두 변환만 수행합니다. 어떤 단어도 제거/대체하지 않습니다.\n\nexport class LosslessCompressor extends EventEmitter {\n\tcompress(query: string): { compressed: string; tokensSaved: number } {\n\t\tconst originalTokens = estimateTokens(query);\n\n\t\t// 1. 연속 공백/탭 → 단일 공백\n\t\t// 2. trim\n\t\tconst compressed = query.replace(/[ \\t]+/g, \" \").trim();\n\n\t\tconst compressedTokens = estimateTokens(compressed);\n\t\t// tokensSaved는 0 이상 — 정규화가 토큰을 줄이지 않으면 0\n\t\tconst tokensSaved = Math.max(0, originalTokens - compressedTokens);\n\n\t\treturn { compressed, tokensSaved };\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// LazyExecutor — 메모이제이션 실행기 (역호환)\n// ---------------------------------------------------------------------------\n\nexport class LazyExecutor extends EventEmitter {\n\tprivate memoCache: Map<string, unknown> = new Map();\n\n\texecute<T>(taskId: string, fn: () => T, force = false): T {\n\t\tif (!force && this.memoCache.has(taskId)) {\n\t\t\treturn this.memoCache.get(taskId) as T;\n\t\t}\n\t\tconst result = fn();\n\t\tthis.memoCache.set(taskId, result);\n\t\treturn result;\n\t}\n\n\tclear(): void {\n\t\tthis.memoCache.clear();\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// AdaptiveBudget — 토큰 예산 관리 (역호환)\n// ---------------------------------------------------------------------------\n\nexport class AdaptiveBudget extends EventEmitter {\n\tprivate budget: number;\n\tprivate used: number = 0;\n\tprivate history: { used: number; timestamp: number }[] = [];\n\n\tconstructor(initialBudget = 10000) {\n\t\tsuper();\n\t\tthis.budget = initialBudget;\n\t}\n\n\tallocate(tokens: number): boolean {\n\t\tif (this.used + tokens > this.budget) {\n\t\t\tthis.emit(\"budgetExceeded\", { used: this.used, requested: tokens, budget: this.budget });\n\t\t\treturn false;\n\t\t}\n\t\tthis.used += tokens;\n\t\tthis.history.push({ used: this.used, timestamp: Date.now() });\n\t\treturn true;\n\t}\n\n\tgetStats(): { budget: number; used: number; remaining: number; utilization: number } {\n\t\treturn {\n\t\t\tbudget: this.budget,\n\t\t\tused: this.used,\n\t\t\tremaining: this.budget - this.used,\n\t\t\tutilization: this.used / this.budget,\n\t\t};\n\t}\n\n\tadjustBudget(newBudget: number): void {\n\t\tthis.budget = newBudget;\n\t\tthis.emit(\"budgetAdjusted\", { newBudget });\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// TokenOptimizer — 통합 인터페이스 (역호환)\n// ---------------------------------------------------------------------------\n\nexport class TokenOptimizer extends EventEmitter {\n\tprivate compressor: LosslessCompressor;\n\tprivate executor: LazyExecutor;\n\tprivate budget: AdaptiveBudget;\n\n\tconstructor(budget = 10000) {\n\t\tsuper();\n\t\tthis.compressor = new LosslessCompressor();\n\t\tthis.executor = new LazyExecutor();\n\t\tthis.budget = new AdaptiveBudget(budget);\n\t}\n\n\toptimize(query: string): TokenOptimizationResult {\n\t\tconst originalTokens = estimateTokens(query);\n\n\t\tconst { compressed } = this.compressor.compress(query);\n\t\tconst optimizedTokens = estimateTokens(compressed);\n\n\t\tconst cacheHit = false; // templateCache 제거됨 — 항상 false\n\n\t\tconst budgetAllocated = this.budget.allocate(optimizedTokens);\n\n\t\treturn {\n\t\t\toriginalQuery: query,\n\t\t\toptimizedQuery: compressed,\n\t\t\ttokensSaved: Math.max(0, originalTokens - optimizedTokens),\n\t\t\ttechnique: \"whitespace_normalization\",\n\t\t\tcacheHit,\n\t\t\tbudgetExceeded: !budgetAllocated,\n\t\t};\n\t}\n\n\tlazyExecute<T>(taskId: string, fn: () => T): T {\n\t\treturn this.executor.execute(taskId, fn);\n\t}\n\n\tgetBudgetStats(): { budget: number; used: number; remaining: number; utilization: number } {\n\t\treturn this.budget.getStats();\n\t}\n}\n\nexport default TokenOptimizer;\n"]}