leerness 1.9.5 → 1.9.6

package/CHANGELOG.md

@@ -1,5 +1,18 @@
 # Changelog
 
+## 1.9.6 — 2026-05-08
+
+1.9.5 후 발견된 한 가지 한계 (옛 link 손실 자동 복구 부재)를 패치.
+
+### Added
+
+- **`leerness task relink [--apply] [--min-score 0.2]`** — `plan.md`의 milestone 텍스트와 `progress-tracker.md`의 task `request` 텍스트를 jaccard 토큰 유사도로 비교해 미연결 milestone을 가장 비슷한 row와 자동 매칭. default는 제안만 출력 (사용자가 명령 복사해 실행), `--apply`로 자동 적용. `--min-score`로 임계 조정 (기본 0.2).
+- **`audit`이 미연결 milestone 발견 시 `leerness task relink` 안내 자동 출력**.
+
+### Migration
+
+기존 1.9.x 사용자는 `npx leerness@latest update . --yes`로 즉시 자동 마이그레이션됩니다.
+
 ## 1.9.5 — 2026-05-08
 
 1.9.4 운영 중 발견된 한계 2건 + 추가 디버그 사항을 패치합니다.

package/bin/harness.js

@@ -6,7 +6,7 @@ const path = require('path');
 const cp = require('child_process');
 const readline = require('readline');
 
-const VERSION = '1.9.5';
+const VERSION = '1.9.6';
 const MARK = '<!-- leerness:managed -->';
 const README_START = '<!-- leerness:project-readme:start -->';
 const README_END = '<!-- leerness:project-readme:end -->';
@@ -679,6 +679,67 @@ function taskDrop(root, id) {
   ok(`task dropped: ${id}`);
 }
 
+// 1.9.6: 옛 link 손실 row를 plan.md milestone과 자동 매칭 제안/복구.
+function _tokenizeForSim(s) {
+  // unicode letter/number만 보존 — \W는 ASCII 기준이라 한글이 분리되는 버그 회피
+  return new Set(
+    String(s || '').toLowerCase()
+      .split(/\s+/)
+      .map(t => t.replace(/[^\p{L}\p{N}_]+/gu, ''))
+      .filter(t => t.length >= 2)
+  );
+}
+function _jaccard(a, b) {
+  const inter = new Set([...a].filter(x => b.has(x))).size;
+  const uni = new Set([...a, ...b]).size;
+  return uni ? inter / uni : 0;
+}
+
+function taskRelink(root) {
+  root = absRoot(root);
+  const planText = exists(planPath(root)) ? read(planPath(root)) : '';
+  const milestones = [...planText.matchAll(/^### (M-\d{4})\.\s*(.+?)$/gm)]
+    .map(m => ({ id: m[1], text: m[2].trim() }));
+  const rows = readProgressRows(root);
+  const linkedM = new Set(rows.map(r => (r.evidence.match(/M-\d{4}/) || [])[0]).filter(Boolean));
+  const orphanM = milestones.filter(m => !linkedM.has(m.id));
+  if (!orphanM.length) return ok('미연결 milestone 없음');
+
+  const apply = has('--apply');
+  const minScore = parseFloat(arg('--min-score', '0.2'));
+  log(`# task relink — 미연결 milestone ${orphanM.length}개${apply ? ' (--apply: 자동 적용)' : ' (제안만, --apply로 적용)'}`);
+  const suggestions = [];
+  for (const m of orphanM) {
+    const milestoneTokens = _tokenizeForSim(m.text);
+    const candidates = rows
+      .map(r => ({ r, score: _jaccard(milestoneTokens, _tokenizeForSim(r.request)) }))
+      .filter(x => x.score >= minScore)
+      .sort((a, b) => b.score - a.score);
+    log(`\n${m.id}: ${m.text}`);
+    if (!candidates.length) {
+      log(`  ⓘ 매칭 후보 없음 (score ≥ ${minScore})`);
+      log(`  → 새 task: leerness task add "${m.text}" --status planned --evidence "plan:${m.id}"`);
+      continue;
+    }
+    const best = candidates[0];
+    const newEv = best.r.evidence.includes(`plan:${m.id}`) ? best.r.evidence : `${best.r.evidence} (plan:${m.id})`;
+    log(`  ✓ 최선 후보: ${best.r.id} (score ${best.score.toFixed(2)}) — ${best.r.request}`);
+    log(`    현재 evidence: "${best.r.evidence}"`);
+    log(`    제안 evidence: "${newEv}"`);
+    log(`    수동: leerness task update ${best.r.id} --evidence "${newEv}"`);
+    if (candidates.length > 1) {
+      const next = candidates.slice(1, 3).map(c => `${c.r.id}(${c.score.toFixed(2)})`).join(', ');
+      log(`    다른 후보: ${next}`);
+    }
+    suggestions.push({ id: best.r.id, evidence: newEv });
+  }
+  if (apply && suggestions.length) {
+    for (const s of suggestions) upsertProgress(root, { id: s.id, evidence: s.evidence });
+    log('');
+    ok(`${suggestions.length}개 row 자동 relink 완료`);
+  }
+}
+
 // 1.9.4 D: evidence가 placeholder인 done row를 일괄 점검.
 function taskFixEvidence(root) {
   root = absRoot(root);
@@ -786,9 +847,17 @@ function audit(root) {
   const planText = exists(planPath(root)) ? read(planPath(root)) : '';
   const milestoneIds = Array.from(planText.matchAll(/^### (M-\d{4})\./gm)).map(m => m[1]);
   const rows = readProgressRows(root);
-  const linkedMs = new Set(rows.map(r => (r.evidence.match(/M-\d{4}/) || [])[0]).filter(Boolean));
+  // 1.9.6 수정: 한 row에 여러 plan:M-XXXX 링크가 있어도 모두 인식 (matchAll로 전부 추출)
+  const linkedMs = new Set(
+    rows.flatMap(r => Array.from(String(r.evidence || '').matchAll(/M-\d{4}/g), m => m[0]))
+  );
   const missingFromProgress = milestoneIds.filter(m => !linkedMs.has(m));
-  if (missingFromProgress.length) { warnings++; warn(`milestones without progress entry: ${missingFromProgress.join(', ')}`); }
+  if (missingFromProgress.length) {
+    warnings++;
+    warn(`milestones without progress entry: ${missingFromProgress.join(', ')}`);
+    log(`    → 자동 매칭 제안: leerness task relink`);
+    log(`    → 자동 적용:     leerness task relink --apply`);
+  }
   else if (milestoneIds.length) ok('all milestones linked in progress-tracker');
   const handoff = exists(handoffPath(root)) ? read(handoffPath(root)) : '';
   if (handoff.includes('Last generated: (자동)')) { warnings++; warn('session-handoff.md never auto-generated (run: leerness session close .)'); }
@@ -1539,7 +1608,7 @@ function viewworkInstall(root) {
 }
 
 function help() {
-  log(`Leerness v${VERSION}\n\nUsage:\n  leerness init [path] [--language auto|ko|en] [--skills recommended|all|a,b]\n  leerness migrate [path] [--dry-run] [--force]\n  leerness update [path] [--check|--yes|--force|--from <tarball>]\n  leerness auto-update install [path]\n  leerness status [path]\n  leerness verify [path]\n  leerness debug [path]\n  leerness audit [path]\n  leerness check [path]\n  leerness scan secrets [path]\n  leerness encoding check [path]\n  leerness lazy detect [path]\n  leerness memory search "query" [--limit 5]\n  leerness handoff [path]\n  leerness session close [path]\n  leerness viewwork install [path]\n  leerness viewwork emit [path] [--action a] [--note n] [--agent x] [--tool t]\n  leerness route <task-type>\n  leerness self check [path]\n  leerness readme sync [path]\n  leerness consistency check [path]\n  leerness consistency merge-design-guide [path]\n  leerness plan show|init|add|drop|progress|sync [args]\n  leerness task list|add|update|drop|fix-evidence [args]\n  leerness skill list|info <name>\n  leerness skill learn <id> --doc <url> --command "..." --capability "..." [--note ...]\n  leerness skill use <id> [--note ...]\n  leerness skill optimize <id> --before "..." --after "..." [--note ...]\n  leerness skill remove <id>\n  leerness skill consolidate [--threshold 0.3]\n  leerness gate [path]                       # verify+audit+scan+encoding+lazy\n  leerness impact <target> [--all]           # 변경 전 영향 분석 (기본 strong, --all로 weak 포함)\n  leerness reuse find <query>                # 기존 자원 검색 (재귀 안내)\n  leerness reuse register <name> --where <p> --kind component|hook|util|api [--note ...]\n  leerness ui consistency [path] [--strict] [--fail-on-violation]\n  leerness graph [path] [--out <file>]       # mermaid 의존성 그래프\n  leerness guide [target]                    # impact + reuse + ui consistency 통합 가이드\n`);
+  log(`Leerness v${VERSION}\n\nUsage:\n  leerness init [path] [--language auto|ko|en] [--skills recommended|all|a,b]\n  leerness migrate [path] [--dry-run] [--force]\n  leerness update [path] [--check|--yes|--force|--from <tarball>]\n  leerness auto-update install [path]\n  leerness status [path]\n  leerness verify [path]\n  leerness debug [path]\n  leerness audit [path]\n  leerness check [path]\n  leerness scan secrets [path]\n  leerness encoding check [path]\n  leerness lazy detect [path]\n  leerness memory search "query" [--limit 5]\n  leerness handoff [path]\n  leerness session close [path]\n  leerness viewwork install [path]\n  leerness viewwork emit [path] [--action a] [--note n] [--agent x] [--tool t]\n  leerness route <task-type>\n  leerness self check [path]\n  leerness readme sync [path]\n  leerness consistency check [path]\n  leerness consistency merge-design-guide [path]\n  leerness plan show|init|add|drop|progress|sync [args]\n  leerness task list|add|update|drop|fix-evidence|relink [args]\n  leerness skill list|info <name>\n  leerness skill learn <id> --doc <url> --command "..." --capability "..." [--note ...]\n  leerness skill use <id> [--note ...]\n  leerness skill optimize <id> --before "..." --after "..." [--note ...]\n  leerness skill remove <id>\n  leerness skill consolidate [--threshold 0.3]\n  leerness gate [path]                       # verify+audit+scan+encoding+lazy\n  leerness impact <target> [--all]           # 변경 전 영향 분석 (기본 strong, --all로 weak 포함)\n  leerness reuse find <query>                # 기존 자원 검색 (재귀 안내)\n  leerness reuse register <name> --where <p> --kind component|hook|util|api [--note ...]\n  leerness ui consistency [path] [--strict] [--fail-on-violation]\n  leerness graph [path] [--out <file>]       # mermaid 의존성 그래프\n  leerness guide [target]                    # impact + reuse + ui consistency 통합 가이드\n`);
 }
 
 async function main() {
@@ -1603,6 +1672,7 @@ async function main() {
     if (sub==='update') return taskUpdate(root, args[2]);
     if (sub==='drop')   return taskDrop(root, args[2]);
     if (sub==='fix-evidence') return taskFixEvidence(root);
+    if (sub==='relink')       return taskRelink(root);
   }
   return help();
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "leerness",
-  "version": "1.9.5",
+  "version": "1.9.6",
   "description": "Leerness: 비파괴 마이그레이션, 자동 버전 감지·업데이트, 계획/진행/핸드오프 자동화, 게으름·시크릿·인코딩 자동 가드, Claude Code 슬래시 통합을 갖춘 한국어 우선 AI 개발 하네스.",
   "keywords": [
     "leerness",

package/scripts/e2e.js

@@ -235,6 +235,47 @@ total++;
   if (!(strongOK && weakHint)) failed++;
 }
 
+// 1.9.6 회귀: task relink — 인위적 link 손실 → 자동 매칭 제안 + --apply 자동 복구
+total++;
+{
+  // plan.md에 새 milestone 추가, progress엔 link 없는 비슷한 row 추가
+  const planPath_ = path.join(tmp, '.harness/plan.md');
+  fs.appendFileSync(planPath_,
+    `\n### M-9001. 캐시 헬퍼 모듈\nStatus: planned\nProgress: 0%\n\nTasks:\n- [ ] 캐시 helper\n` +
+    `\n### M-9002. 인증 헬퍼 모듈\nStatus: planned\nProgress: 0%\n\nTasks:\n- [ ] 인증 helper\n`);
+  // progress에 link 없는 비슷한 row 2개 추가
+  const trackerPath_ = path.join(tmp, '.harness/progress-tracker.md');
+  fs.appendFileSync(trackerPath_,
+    `| T-9001 | done | 캐시 helper 구현 | tests:5/5 (link lost) | 다음 단계 | 2026-05-08 |\n` +
+    `| T-9002 | done | 인증 helper 구현 | tests:8/8 (link lost) | 다음 단계 | 2026-05-08 |\n`);
+
+  // 제안 모드
+  const r1 = cp.spawnSync(process.execPath, [CLI, 'task', 'relink', '--path', tmp], { encoding: 'utf8' });
+  const okSuggest = r1.status === 0 && /M-9001/.test(r1.stdout) && /M-9002/.test(r1.stdout) && /최선 후보/.test(r1.stdout);
+  console.log(okSuggest ? '✓ B(1.9.6) task relink 제안: 2개 매칭 발견' : `✗ B(1.9.6) 제안 실패\n${r1.stdout}`);
+  if (!okSuggest) failed++;
+}
+total++;
+{
+  // --apply
+  const r2 = cp.spawnSync(process.execPath, [CLI, 'task', 'relink', '--apply', '--path', tmp], { encoding: 'utf8' });
+  const tracker = fs.readFileSync(path.join(tmp, '.harness/progress-tracker.md'), 'utf8');
+  const okApply = r2.status === 0 && /M-9001/.test(tracker) && /M-9002/.test(tracker);
+  console.log(okApply ? '✓ B(1.9.6) task relink --apply: 자동 복구' : '✗ B(1.9.6) --apply 실패');
+  if (!okApply) failed++;
+}
+total++;
+{
+  // audit이 task relink 안내를 출력하는지 (이번엔 link 복구 후라 미연결 milestone 없을 것)
+  // 일부러 새 milestone 추가 후 audit
+  fs.appendFileSync(path.join(tmp, '.harness/plan.md'),
+    `\n### M-9999. 매칭 후보 없는 milestone\nStatus: planned\n\nTasks:\n- [ ] x\n`);
+  const r3 = cp.spawnSync(process.execPath, [CLI, 'audit', tmp], { encoding: 'utf8' });
+  const ok = /milestones without progress entry/.test(r3.stdout) && /M-9999/.test(r3.stdout) && /leerness task relink/.test(r3.stdout);
+  console.log(ok ? '✓ B(1.9.6) audit이 task relink 안내 출력' : `✗ B(1.9.6) audit 안내 누락\n${r3.stdout}`);
+  if (!ok) failed++;
+}
+
 // 1.9.5 G 회귀: impact medium 카테고리 — 동적 path 패턴
 total++;
 {