athar-mcp 0.1.0

package/dist/spaced-repetition/scheduler.js

@@ -0,0 +1,98 @@
+import { getDatabase } from '../db/connection.js';
+import { calculateSM2 } from './sm2.js';
+import { createLogger } from '../utils/logger.js';
+const log = createLogger('scheduler');
+/**
+ * Get all lessons that are due for review (next_review_at <= now).
+ */
+export function getDueReviews() {
+    const db = getDatabase();
+    const now = new Date().toISOString();
+    const stmt = db.prepare(`
+    SELECT id, title, problem, root_cause, lesson,
+           bad_code, good_code, tags, language,
+           review_questions, repetitions, easiness_factor,
+           interval_days, status, review_count, created_at
+    FROM lessons
+    WHERE next_review_at <= ? OR next_review_at IS NULL
+    ORDER BY next_review_at ASC
+  `);
+    return stmt.all(now);
+}
+/**
+ * Update a lesson after a review session.
+ * Applies the SM-2 algorithm and updates the database.
+ */
+export function recordReview(lessonId, quality) {
+    const db = getDatabase();
+    // Get current state
+    const lesson = db.prepare(`
+    SELECT repetitions, easiness_factor, interval_days
+    FROM lessons WHERE id = ?
+  `).get(lessonId);
+    if (!lesson) {
+        throw new Error(`Lesson with ID ${lessonId} not found`);
+    }
+    // Calculate SM-2
+    const result = calculateSM2({
+        repetitions: lesson.repetitions,
+        easinessFactor: lesson.easiness_factor,
+        intervalDays: lesson.interval_days,
+    }, quality);
+    // Update database
+    db.prepare(`
+    UPDATE lessons SET
+      repetitions = ?,
+      easiness_factor = ?,
+      interval_days = ?,
+      next_review_at = ?,
+      last_reviewed_at = datetime('now'),
+      status = ?,
+      quality_score = ?,
+      review_count = review_count + 1,
+      updated_at = datetime('now')
+    WHERE id = ?
+  `).run(result.repetitions, result.easinessFactor, result.intervalDays, result.nextReviewAt.toISOString(), result.status, quality, lessonId);
+    log.info(`Review recorded: lesson=${lessonId}, quality=${quality}, next_review=${result.intervalDays}d, status=${result.status}`);
+    return {
+        success: true,
+        nextReviewAt: result.nextReviewAt,
+        newStatus: result.status,
+        intervalDays: result.intervalDays,
+    };
+}
+/**
+ * Get statistics about all lessons.
+ */
+export function getStats() {
+    const db = getDatabase();
+    const now = new Date().toISOString();
+    const weekFromNow = new Date();
+    weekFromNow.setDate(weekFromNow.getDate() + 7);
+    const total = db.prepare('SELECT COUNT(*) as c FROM lessons').get().c;
+    const dueToday = db.prepare('SELECT COUNT(*) as c FROM lessons WHERE next_review_at <= ? OR next_review_at IS NULL').get(now).c;
+    const dueThisWeek = db.prepare('SELECT COUNT(*) as c FROM lessons WHERE next_review_at <= ?').get(weekFromNow.toISOString()).c;
+    const statusRows = db.prepare('SELECT status, COUNT(*) as c FROM lessons GROUP BY status').all();
+    const byStatus = {};
+    for (const row of statusRows) {
+        byStatus[row.status] = row.c;
+    }
+    // Extract and count tags
+    const allTags = db.prepare('SELECT tags FROM lessons').all();
+    const tagCounts = new Map();
+    for (const row of allTags) {
+        try {
+            const tags = JSON.parse(row.tags || '[]');
+            for (const tag of tags) {
+                tagCounts.set(tag, (tagCounts.get(tag) || 0) + 1);
+            }
+        }
+        catch { /* skip malformed */ }
+    }
+    const topTags = [...tagCounts.entries()]
+        .sort((a, b) => b[1] - a[1])
+        .slice(0, 8)
+        .map(([tag, count]) => ({ tag, count }));
+    return { total, dueToday, dueThisWeek, byStatus, topTags };
+}
+//# sourceMappingURL=scheduler.js.map

package/dist/spaced-repetition/scheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../../src/spaced-repetition/scheduler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AACxC,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,MAAM,GAAG,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC;AAqBtC;;GAEG;AACH,MAAM,UAAU,aAAa;IAC3B,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IACzB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAErC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;;GAQvB,CAAC,CAAC;IAEH,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAiC,CAAC;AACvD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB,EAAE,OAAe;IAM5D,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IAEzB,oBAAoB;IACpB,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC;;;GAGzB,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAmG,CAAC;IAEnH,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,kBAAkB,QAAQ,YAAY,CAAC,CAAC;IAC1D,CAAC;IAED,iBAAiB;IACjB,MAAM,MAAM,GAAG,YAAY,CACzB;QACE,WAAW,EAAE,MAAM,CAAC,WAAW;QAC/B,cAAc,EAAE,MAAM,CAAC,eAAe;QACtC,YAAY,EAAE,MAAM,CAAC,aAAa;KACnC,EACD,OAAO,CACR,CAAC;IAEF,kBAAkB;IAClB,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;GAYV,CAAC,CAAC,GAAG,CACJ,MAAM,CAAC,WAAW,EAClB,MAAM,CAAC,cAAc,EACrB,MAAM,CAAC,YAAY,EACnB,MAAM,CAAC,YAAY,CAAC,WAAW,EAAE,EACjC,MAAM,CAAC,MAAM,EACb,OAAO,EACP,QAAQ,CACT,CAAC;IAEF,GAAG,CAAC,IAAI,CAAC,2BAA2B,QAAQ,aAAa,OAAO,iBAAiB,MAAM,CAAC,YAAY,aAAa,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAElI,OAAO;QACL,OAAO,EAAE,IAAI;QACb,YAAY,EAAE,MAAM,CAAC,YAAY;QACjC,SAAS,EAAE,MAAM,CAAC,MAAM;QACxB,YAAY,EAAE,MAAM,CAAC,YAAY;KAClC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,QAAQ;IAOtB,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IACzB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC;IAC/B,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;IAE/C,MAAM,KAAK,GAAI,EAAE,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC,GAAG,EAA+B,CAAC,CAAC,CAAC;IAEpG,MAAM,QAAQ,GAAI,EAAE,CAAC,OAAO,CAC1B,uFAAuF,CACxF,CAAC,GAAG,CAAC,GAAG,CAA8B,CAAC,CAAC,CAAC;IAE1C,MAAM,WAAW,GAAI,EAAE,CAAC,OAAO,CAC7B,6DAA6D,CAC9D,CAAC,GAAG,CAAC,WAAW,CAAC,WAAW,EAAE,CAA8B,CAAC,CAAC,CAAC;IAEhE,MAAM,UAAU,GAAG,EAAE,CAAC,OAAO,CAC3B,2DAA2D,CAC5D,CAAC,GAAG,EAAqD,CAAC;IAE3D,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,yBAAyB;IACzB,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,0BAA0B,CAAC,CAAC,GAAG,EAAwC,CAAC;IACnG,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAa,CAAC;YACtD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QAAC,MAAM,CAAC,CAAC,oBAAoB,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,OAAO,GAAG,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;SACrC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IAE3C,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;AAC7D,CAAC"}

package/dist/spaced-repetition/sm2.d.ts

@@ -0,0 +1,36 @@
+/**
+ * SM-2 Spaced Repetition Algorithm
+ *
+ * Based on the SuperMemo-2 algorithm by Piotr Wozniak.
+ * Calculates optimal review intervals based on recall quality.
+ *
+ * Quality scores:
+ *   5 — Perfect response (instant recall)
+ *   4 — Correct after hesitation
+ *   3 — Correct with significant difficulty
+ *   2 — Incorrect, but felt close / recognized the answer
+ *   1 — Incorrect, vague memory
+ *   0 — Complete blackout
+ */
+export interface SM2State {
+    repetitions: number;
+    easinessFactor: number;
+    intervalDays: number;
+}
+export interface SM2Result extends SM2State {
+    nextReviewAt: Date;
+    status: 'new' | 'learning' | 'learned' | 'mastered';
+}
+/**
+ * Calculate the next review state using the SM-2 algorithm.
+ *
+ * @param current - Current card state
+ * @param quality - Recall quality (0-5)
+ * @returns Updated state with next review date
+ */
+export declare function calculateSM2(current: SM2State, quality: number): SM2Result;
+/**
+ * Get a human-readable description of the quality score.
+ */
+export declare function qualityLabel(q: number): string;
+//# sourceMappingURL=sm2.d.ts.map

package/dist/spaced-repetition/sm2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sm2.d.ts","sourceRoot":"","sources":["../../src/spaced-repetition/sm2.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,MAAM,WAAW,QAAQ;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;IACvB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,SAAU,SAAQ,QAAQ;IACzC,YAAY,EAAE,IAAI,CAAC;IACnB,MAAM,EAAE,KAAK,GAAG,UAAU,GAAG,SAAS,GAAG,UAAU,CAAC;CACrD;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,GAAG,SAAS,CAsD1E;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAU9C"}

package/dist/spaced-repetition/sm2.js

@@ -0,0 +1,90 @@
+/**
+ * SM-2 Spaced Repetition Algorithm
+ *
+ * Based on the SuperMemo-2 algorithm by Piotr Wozniak.
+ * Calculates optimal review intervals based on recall quality.
+ *
+ * Quality scores:
+ *   5 — Perfect response (instant recall)
+ *   4 — Correct after hesitation
+ *   3 — Correct with significant difficulty
+ *   2 — Incorrect, but felt close / recognized the answer
+ *   1 — Incorrect, vague memory
+ *   0 — Complete blackout
+ */
+/**
+ * Calculate the next review state using the SM-2 algorithm.
+ *
+ * @param current - Current card state
+ * @param quality - Recall quality (0-5)
+ * @returns Updated state with next review date
+ */
+export function calculateSM2(current, quality) {
+    // Clamp quality to valid range
+    quality = Math.max(0, Math.min(5, Math.round(quality)));
+    let { repetitions, easinessFactor, intervalDays } = current;
+    // Calculate new Easiness Factor
+    // EF' = EF + (0.1 - (5 - q) * (0.08 + (5 - q) * 0.02))
+    let newEF = easinessFactor + (0.1 - (5 - quality) * (0.08 + (5 - quality) * 0.02));
+    if (newEF < 1.3)
+        newEF = 1.3; // EF cannot drop below 1.3
+    let newRepetitions;
+    let newInterval;
+    if (quality < 3) {
+        // Failed recall → reset to beginning
+        newRepetitions = 0;
+        newInterval = 1; // Review again tomorrow
+    }
+    else {
+        // Successful recall → advance
+        newRepetitions = repetitions + 1;
+        if (newRepetitions === 1) {
+            newInterval = 1; // First success: review in 1 day
+        }
+        else if (newRepetitions === 2) {
+            newInterval = 6; // Second success: review in 6 days
+        }
+        else {
+            newInterval = Math.round(intervalDays * newEF);
+        }
+    }
+    // Calculate next review date
+    const nextReviewAt = new Date();
+    nextReviewAt.setDate(nextReviewAt.getDate() + newInterval);
+    // Determine status based on repetitions and EF
+    let status;
+    if (newRepetitions === 0) {
+        status = 'new';
+    }
+    else if (newRepetitions <= 2) {
+        status = 'learning';
+    }
+    else if (newRepetitions <= 5 || newEF < 2.5) {
+        status = 'learned';
+    }
+    else {
+        status = 'mastered';
+    }
+    return {
+        repetitions: newRepetitions,
+        easinessFactor: Math.round(newEF * 100) / 100, // Round to 2 decimals
+        intervalDays: newInterval,
+        nextReviewAt,
+        status,
+    };
+}
+/**
+ * Get a human-readable description of the quality score.
+ */
+export function qualityLabel(q) {
+    switch (q) {
+        case 0: return '🟥 Complete blackout';
+        case 1: return '🟧 Incorrect, vague memory';
+        case 2: return '🟨 Incorrect, but recognized the answer';
+        case 3: return '🟩 Correct with significant difficulty';
+        case 4: return '🟦 Correct after hesitation';
+        case 5: return '🟪 Perfect recall';
+        default: return `Unknown (${q})`;
+    }
+}
+//# sourceMappingURL=sm2.js.map

package/dist/spaced-repetition/sm2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sm2.js","sourceRoot":"","sources":["../../src/spaced-repetition/sm2.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAaH;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,OAAiB,EAAE,OAAe;IAC7D,+BAA+B;IAC/B,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAExD,IAAI,EAAE,WAAW,EAAE,cAAc,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC;IAE5D,gCAAgC;IAChC,uDAAuD;IACvD,IAAI,KAAK,GAAG,cAAc,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACnF,IAAI,KAAK,GAAG,GAAG;QAAE,KAAK,GAAG,GAAG,CAAC,CAAC,2BAA2B;IAEzD,IAAI,cAAsB,CAAC;IAC3B,IAAI,WAAmB,CAAC;IAExB,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QAChB,qCAAqC;QACrC,cAAc,GAAG,CAAC,CAAC;QACnB,WAAW,GAAG,CAAC,CAAC,CAAC,wBAAwB;IAC3C,CAAC;SAAM,CAAC;QACN,8BAA8B;QAC9B,cAAc,GAAG,WAAW,GAAG,CAAC,CAAC;QAEjC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;YACzB,WAAW,GAAG,CAAC,CAAC,CAAS,iCAAiC;QAC5D,CAAC;aAAM,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;YAChC,WAAW,GAAG,CAAC,CAAC,CAAS,mCAAmC;QAC9D,CAAC;aAAM,CAAC;YACN,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED,6BAA6B;IAC7B,MAAM,YAAY,GAAG,IAAI,IAAI,EAAE,CAAC;IAChC,YAAY,CAAC,OAAO,CAAC,YAAY,CAAC,OAAO,EAAE,GAAG,WAAW,CAAC,CAAC;IAE3D,+CAA+C;IAC/C,IAAI,MAA2B,CAAC;IAChC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,GAAG,KAAK,CAAC;IACjB,CAAC;SAAM,IAAI,cAAc,IAAI,CAAC,EAAE,CAAC;QAC/B,MAAM,GAAG,UAAU,CAAC;IACtB,CAAC;SAAM,IAAI,cAAc,IAAI,CAAC,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;QAC9C,MAAM,GAAG,SAAS,CAAC;IACrB,CAAC;SAAM,CAAC;QACN,MAAM,GAAG,UAAU,CAAC;IACtB,CAAC;IAED,OAAO;QACL,WAAW,EAAE,cAAc;QAC3B,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,sBAAsB;QACrE,YAAY,EAAE,WAAW;QACzB,YAAY;QACZ,MAAM;KACP,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,CAAS;IACpC,QAAQ,CAAC,EAAE,CAAC;QACV,KAAK,CAAC,CAAC,CAAC,OAAO,sBAAsB,CAAC;QACtC,KAAK,CAAC,CAAC,CAAC,OAAO,4BAA4B,CAAC;QAC5C,KAAK,CAAC,CAAC,CAAC,OAAO,yCAAyC,CAAC;QACzD,KAAK,CAAC,CAAC,CAAC,OAAO,wCAAwC,CAAC;QACxD,KAAK,CAAC,CAAC,CAAC,OAAO,6BAA6B,CAAC;QAC7C,KAAK,CAAC,CAAC,CAAC,OAAO,mBAAmB,CAAC;QACnC,OAAO,CAAC,CAAC,OAAO,YAAY,CAAC,GAAG,CAAC;IACnC,CAAC;AACH,CAAC"}

package/dist/tools/memory.d.ts

@@ -0,0 +1,25 @@
+import type { MemoryInput } from './validators.js';
+interface LessonResult {
+    id: number;
+    title: string;
+    problem: string;
+    root_cause: string;
+    lesson: string;
+    bad_code: string | null;
+    good_code: string | null;
+    tags: string;
+    language: string | null;
+    status: string;
+    review_count: number;
+    created_at: string;
+}
+/**
+ * Search and retrieve past lessons from memory.
+ * Called by the MCP memory tool handler.
+ */
+export declare function searchMemory(input: MemoryInput): {
+    results: LessonResult[];
+    message: string;
+};
+export {};
+//# sourceMappingURL=memory.d.ts.map

package/dist/tools/memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../src/tools/memory.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAInD,UAAU,YAAY;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,GAAG;IAAE,OAAO,EAAE,YAAY,EAAE,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CA4H7F"}

package/dist/tools/memory.js

@@ -0,0 +1,112 @@
+import { getDatabase } from '../db/connection.js';
+import { createLogger } from '../utils/logger.js';
+const log = createLogger('memory');
+/**
+ * Search and retrieve past lessons from memory.
+ * Called by the MCP memory tool handler.
+ */
+export function searchMemory(input) {
+    const db = getDatabase();
+    log.info(`Searching memory: query="${input.query}", limit=${input.limit}`);
+    let results = [];
+    // Strategy 1: Try FTS5 full-text search first
+    try {
+        const ftsQuery = input.query
+            .replace(/[^\w\s]/g, ' ') // Remove special chars
+            .split(/\s+/)
+            .filter(w => w.length > 1)
+            .map(w => `"${w}"`) // Exact phrase matching per word
+            .join(' OR ');
+        if (ftsQuery) {
+            let sql = `
+        SELECT l.id, l.title, l.problem, l.root_cause, l.lesson,
+               l.bad_code, l.good_code, l.tags, l.language,
+               l.status, l.review_count, l.created_at
+        FROM lessons_fts fts
+        JOIN lessons l ON l.id = fts.rowid
+      `;
+            const conditions = [];
+            const params = [];
+            conditions.push('lessons_fts MATCH ?');
+            params.push(ftsQuery);
+            if (input.language) {
+                conditions.push('l.language = ?');
+                params.push(input.language);
+            }
+            if (input.tags && input.tags.length > 0) {
+                // Match any tag using JSON
+                const tagConditions = input.tags.map(() => 'l.tags LIKE ?');
+                conditions.push(`(${tagConditions.join(' OR ')})`);
+                params.push(...input.tags.map(t => `%"${t}"%`));
+            }
+            sql += ' WHERE ' + conditions.join(' AND ');
+            sql += ` ORDER BY rank LIMIT ?`;
+            params.push(input.limit);
+            const stmt = db.prepare(sql);
+            results = stmt.all(...params);
+        }
+    }
+    catch (err) {
+        log.debug('FTS search failed, falling back to LIKE search', String(err));
+    }
+    // Strategy 2: Fallback to LIKE search if FTS returns nothing
+    if (results.length === 0) {
+        let sql = `
+      SELECT id, title, problem, root_cause, lesson,
+             bad_code, good_code, tags, language,
+             status, review_count, created_at
+      FROM lessons
+      WHERE (
+        title LIKE ? OR
+        problem LIKE ? OR
+        root_cause LIKE ? OR
+        lesson LIKE ? OR
+        tags LIKE ?
+      )
+    `;
+        const likeQuery = `%${input.query}%`;
+        const params = [likeQuery, likeQuery, likeQuery, likeQuery, likeQuery];
+        if (input.language) {
+            sql += ' AND language = ?';
+            params.push(input.language);
+        }
+        if (input.tags && input.tags.length > 0) {
+            const tagConditions = input.tags.map(() => 'tags LIKE ?');
+            sql += ` AND (${tagConditions.join(' OR ')})`;
+            params.push(...input.tags.map(t => `%"${t}"%`));
+        }
+        sql += ` ORDER BY created_at DESC LIMIT ?`;
+        params.push(input.limit);
+        const stmt = db.prepare(sql);
+        results = stmt.all(...params);
+    }
+    log.info(`Found ${results.length} matching lessons`);
+    if (results.length === 0) {
+        return {
+            results: [],
+            message: `No lessons found matching "${input.query}". This might be a new type of mistake — if resolved, consider saving it as a lesson.`,
+        };
+    }
+    // Format results for the AI assistant
+    const formatted = results.map((r, i) => {
+        const tags = JSON.parse(r.tags || '[]');
+        let text = `\n### ${i + 1}. ${r.title} (ID: ${r.id})\n`;
+        text += `**Status:** ${r.status} | **Reviews:** ${r.review_count} | **Language:** ${r.language || 'N/A'}\n`;
+        text += `**Tags:** ${tags.join(', ')}\n\n`;
+        text += `**Problem:** ${r.problem}\n\n`;
+        text += `**Root Cause:** ${r.root_cause}\n\n`;
+        text += `**Lesson:** ${r.lesson}\n`;
+        if (r.bad_code) {
+            text += `\n**Bad Code:**\n\`\`\`\n${r.bad_code}\n\`\`\`\n`;
+        }
+        if (r.good_code) {
+            text += `\n**Good Code:**\n\`\`\`\n${r.good_code}\n\`\`\`\n`;
+        }
+        return text;
+    }).join('\n---\n');
+    return {
+        results,
+        message: `Found ${results.length} relevant lesson(s) from memory:\n${formatted}`,
+    };
+}
+//# sourceMappingURL=memory.js.map

package/dist/tools/memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.js","sourceRoot":"","sources":["../../src/tools/memory.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAGlD,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;AAiBnC;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAkB;IAC7C,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IAEzB,GAAG,CAAC,IAAI,CAAC,4BAA4B,KAAK,CAAC,KAAK,YAAY,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IAE3E,IAAI,OAAO,GAAmB,EAAE,CAAC;IAEjC,8CAA8C;IAC9C,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK;aACzB,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CAAI,uBAAuB;aACnD,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;aACzB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAU,iCAAiC;aAC7D,IAAI,CAAC,MAAM,CAAC,CAAC;QAEhB,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,GAAG,GAAG;;;;;;OAMT,CAAC;YAEF,MAAM,UAAU,GAAa,EAAE,CAAC;YAChC,MAAM,MAAM,GAAwB,EAAE,CAAC;YAEvC,UAAU,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAEtB,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACnB,UAAU,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;gBAClC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC9B,CAAC;YAED,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxC,2BAA2B;gBAC3B,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;gBAC5D,UAAU,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACnD,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YAClD,CAAC;YAED,GAAG,IAAI,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC5C,GAAG,IAAI,wBAAwB,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAEzB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAC7B,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAA8B,CAAC;QAC7D,CAAC;IACH,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,GAAG,CAAC,KAAK,CAAC,gDAAgD,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,6DAA6D;IAC7D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,IAAI,GAAG,GAAG;;;;;;;;;;;;KAYT,CAAC;QAEF,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC;QACrC,MAAM,MAAM,GAAwB,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QAE5F,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnB,GAAG,IAAI,mBAAmB,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC;QAED,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;YAC1D,GAAG,IAAI,SAAS,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAC9C,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,GAAG,IAAI,mCAAmC,CAAC;QAC3C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAEzB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC7B,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAA8B,CAAC;IAC7D,CAAC;IAED,GAAG,CAAC,IAAI,CAAC,SAAS,OAAO,CAAC,MAAM,mBAAmB,CAAC,CAAC;IAErD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO;YACL,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,8BAA8B,KAAK,CAAC,KAAK,uFAAuF;SAC1I,CAAC;IACJ,CAAC;IAED,sCAAsC;IACtC,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,CAAa,CAAC;QACpD,IAAI,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC;QACxD,IAAI,IAAI,eAAe,CAAC,CAAC,MAAM,mBAAmB,CAAC,CAAC,YAAY,oBAAoB,CAAC,CAAC,QAAQ,IAAI,KAAK,IAAI,CAAC;QAC5G,IAAI,IAAI,aAAa,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3C,IAAI,IAAI,gBAAgB,CAAC,CAAC,OAAO,MAAM,CAAC;QACxC,IAAI,IAAI,mBAAmB,CAAC,CAAC,UAAU,MAAM,CAAC;QAC9C,IAAI,IAAI,eAAe,CAAC,CAAC,MAAM,IAAI,CAAC;QAEpC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YACf,IAAI,IAAI,4BAA4B,CAAC,CAAC,QAAQ,YAAY,CAAC;QAC7D,CAAC;QACD,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAChB,IAAI,IAAI,6BAA6B,CAAC,CAAC,SAAS,YAAY,CAAC;QAC/D,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAEnB,OAAO;QACL,OAAO;QACP,OAAO,EAAE,SAAS,OAAO,CAAC,MAAM,qCAAqC,SAAS,EAAE;KACjF,CAAC;AACJ,CAAC"}

package/dist/tools/save-lesson.d.ts

@@ -0,0 +1,11 @@
+import type { SaveLessonInput } from './validators.js';
+/**
+ * Save a new programming lesson to the database.
+ * Called by the MCP save_lesson tool handler.
+ */
+export declare function saveLesson(input: SaveLessonInput): {
+    success: boolean;
+    message: string;
+    lessonId?: number;
+};
+//# sourceMappingURL=save-lesson.d.ts.map

package/dist/tools/save-lesson.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"save-lesson.d.ts","sourceRoot":"","sources":["../../src/tools/save-lesson.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAuGvD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,eAAe,GAAG;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,CA8D3G"}

package/dist/tools/save-lesson.js

@@ -0,0 +1,137 @@
+import { getDatabase } from '../db/connection.js';
+import { createLogger } from '../utils/logger.js';
+const log = createLogger('save-lesson');
+/** Patterns that indicate a trivial, non-educational change */
+const TRIVIAL_PATTERNS = [
+    /^(fix|change|update)\s+(indent|format|spacing|whitespace)/i,
+    /^(add|remove)\s+(semicolon|comma|bracket|parenthes)/i,
+    /^(prettier|eslint|lint)\s+(fix|format|auto)/i,
+    /^(import|export)\s+(order|sort|organiz)/i,
+    /^(rename|typo|spell)/i,
+];
+/**
+ * Validate that this lesson has real educational value.
+ * Returns null if valid, or an error message if rejected.
+ */
+function validateLessonQuality(input) {
+    // 1. Check for trivial patterns in the title
+    for (const pattern of TRIVIAL_PATTERNS) {
+        if (pattern.test(input.title)) {
+            return `Rejected: "${input.title}" appears to be a trivial formatting/style change, not a genuine learning moment. Only save lessons for real mistakes with root cause analysis.`;
+        }
+    }
+    // 2. Problem and root_cause should not be near-identical
+    const problemNorm = input.problem.toLowerCase().trim();
+    const rootCauseNorm = input.root_cause.toLowerCase().trim();
+    if (problemNorm === rootCauseNorm) {
+        return 'Rejected: "problem" and "root_cause" are identical. The root cause should explain WHY the problem happened, not restate the problem.';
+    }
+    // 3. If bad_code provided, good_code should also be provided (and vice versa)
+    if (input.bad_code && !input.good_code) {
+        return 'Rejected: "bad_code" was provided but "good_code" is missing. Both must be provided for a meaningful comparison.';
+    }
+    if (input.good_code && !input.bad_code) {
+        return 'Rejected: "good_code" was provided but "bad_code" is missing. Both must be provided for a meaningful comparison.';
+    }
+    // 4. Lesson should not just restate the problem
+    const lessonNorm = input.lesson.toLowerCase().trim();
+    if (lessonNorm === problemNorm) {
+        return 'Rejected: The "lesson" is just a restatement of the "problem". The lesson should be an actionable takeaway.';
+    }
+    return null; // Valid
+}
+/**
+ * Check for duplicate lessons (similar title + root_cause).
+ */
+function checkDuplicate(input) {
+    const db = getDatabase();
+    // Search FTS for similar content
+    const stmt = db.prepare(`
+    SELECT l.id, l.title
+    FROM lessons_fts fts
+    JOIN lessons l ON l.id = fts.rowid
+    WHERE lessons_fts MATCH ?
+    LIMIT 3
+  `);
+    // Build a search query from key terms in title and root_cause
+    const searchTerms = `${input.title} ${input.root_cause}`
+        .replace(/[^\w\s]/g, ' ')
+        .split(/\s+/)
+        .filter(w => w.length > 3)
+        .slice(0, 5)
+        .join(' OR ');
+    if (!searchTerms)
+        return { isDuplicate: false };
+    try {
+        const results = stmt.all(searchTerms);
+        // Simple similarity check: if any existing title is very close
+        for (const result of results) {
+            const similarity = calculateSimilarity(input.title.toLowerCase(), result.title.toLowerCase());
+            if (similarity > 0.8) {
+                return { isDuplicate: true, existingId: result.id, existingTitle: result.title };
+            }
+        }
+    }
+    catch {
+        // FTS might fail on empty table — that's fine
+        log.debug('FTS search failed (possibly empty table), skipping duplicate check');
+    }
+    return { isDuplicate: false };
+}
+/**
+ * Simple Jaccard similarity between two strings (word-level).
+ */
+function calculateSimilarity(a, b) {
+    const wordsA = new Set(a.split(/\s+/));
+    const wordsB = new Set(b.split(/\s+/));
+    const intersection = new Set([...wordsA].filter(w => wordsB.has(w)));
+    const union = new Set([...wordsA, ...wordsB]);
+    return union.size === 0 ? 0 : intersection.size / union.size;
+}
+/**
+ * Save a new programming lesson to the database.
+ * Called by the MCP save_lesson tool handler.
+ */
+export function saveLesson(input) {
+    // Step 1: Validate lesson quality
+    const qualityError = validateLessonQuality(input);
+    if (qualityError) {
+        log.warn(`Lesson rejected: ${qualityError}`);
+        return { success: false, message: qualityError };
+    }
+    // Step 2: Check for duplicates
+    const dupCheck = checkDuplicate(input);
+    if (dupCheck.isDuplicate) {
+        const msg = `Duplicate detected: A similar lesson already exists (ID: ${dupCheck.existingId}, Title: "${dupCheck.existingTitle}"). No new lesson saved.`;
+        log.warn(msg);
+        return { success: false, message: msg };
+    }
+    // Step 3: Insert into database
+    const db = getDatabase();
+    // Calculate first review: tomorrow
+    const tomorrow = new Date();
+    tomorrow.setDate(tomorrow.getDate() + 1);
+    const nextReviewAt = tomorrow.toISOString();
+    const stmt = db.prepare(`
+    INSERT INTO lessons (
+      title, problem, error_message, root_cause,
+      bad_code, good_code, lesson, tags, language,
+      file_path, git_diff, review_questions,
+      next_review_at, status
+    ) VALUES (
+      ?, ?, ?, ?,
+      ?, ?, ?, ?, ?,
+      ?, ?, ?,
+      ?, 'new'
+    )
+  `);
+    const result = stmt.run(input.title, input.problem, input.error_message || null, input.root_cause, input.bad_code || null, input.good_code || null, input.lesson, JSON.stringify(input.tags), input.language || null, input.file_path || null, input.git_diff || null, JSON.stringify(input.review_questions), nextReviewAt);
+    const lessonId = Number(result.lastInsertRowid);
+    log.info(`Lesson saved successfully: ID=${lessonId}, Title="${input.title}"`);
+    return {
+        success: true,
+        message: `✅ Lesson saved successfully!\n\n📖 **${input.title}**\n🆔 ID: ${lessonId}\n🏷️ Tags: ${input.tags.join(', ')}\n📅 First review scheduled: tomorrow\n\nThe developer will be reminded to review this lesson using spaced repetition.`,
+        lessonId,
+    };
+}
+//# sourceMappingURL=save-lesson.js.map

package/dist/tools/save-lesson.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"save-lesson.js","sourceRoot":"","sources":["../../src/tools/save-lesson.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAGlD,MAAM,GAAG,GAAG,YAAY,CAAC,aAAa,CAAC,CAAC;AAExC,+DAA+D;AAC/D,MAAM,gBAAgB,GAAG;IACvB,4DAA4D;IAC5D,sDAAsD;IACtD,8CAA8C;IAC9C,0CAA0C;IAC1C,uBAAuB;CACxB,CAAC;AAEF;;;GAGG;AACH,SAAS,qBAAqB,CAAC,KAAsB;IACnD,6CAA6C;IAC7C,KAAK,MAAM,OAAO,IAAI,gBAAgB,EAAE,CAAC;QACvC,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO,cAAc,KAAK,CAAC,KAAK,iJAAiJ,CAAC;QACpL,CAAC;IACH,CAAC;IAED,yDAAyD;IACzD,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IACvD,MAAM,aAAa,GAAG,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IAC5D,IAAI,WAAW,KAAK,aAAa,EAAE,CAAC;QAClC,OAAO,sIAAsI,CAAC;IAChJ,CAAC;IAED,8EAA8E;IAC9E,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;QACvC,OAAO,kHAAkH,CAAC;IAC5H,CAAC;IACD,IAAI,KAAK,CAAC,SAAS,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACvC,OAAO,kHAAkH,CAAC;IAC5H,CAAC;IAED,gDAAgD;IAChD,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IACrD,IAAI,UAAU,KAAK,WAAW,EAAE,CAAC;QAC/B,OAAO,6GAA6G,CAAC;IACvH,CAAC;IAED,OAAO,IAAI,CAAC,CAAC,QAAQ;AACvB,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,KAAsB;IAC5C,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IAEzB,iCAAiC;IACjC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;GAMvB,CAAC,CAAC;IAEH,8DAA8D;IAC9D,MAAM,WAAW,GAAG,GAAG,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,UAAU,EAAE;SACrD,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;SACxB,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;SACzB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,IAAI,CAAC,MAAM,CAAC,CAAC;IAEhB,IAAI,CAAC,WAAW;QAAE,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;IAEhD,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAoD,CAAC;QAEzF,+DAA+D;QAC/D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;YAC9F,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;gBACrB,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,EAAE,aAAa,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;YACnF,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,8CAA8C;QAC9C,GAAG,CAAC,KAAK,CAAC,oEAAoE,CAAC,CAAC;IAClF,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;AAChC,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,CAAS,EAAE,CAAS;IAC/C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IACvC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;IAC9C,OAAO,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;AAC/D,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,KAAsB;IAC/C,kCAAkC;IAClC,MAAM,YAAY,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,YAAY,EAAE,CAAC;QACjB,GAAG,CAAC,IAAI,CAAC,oBAAoB,YAAY,EAAE,CAAC,CAAC;QAC7C,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC;IACnD,CAAC;IAED,+BAA+B;IAC/B,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,QAAQ,CAAC,WAAW,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,4DAA4D,QAAQ,CAAC,UAAU,aAAa,QAAQ,CAAC,aAAa,0BAA0B,CAAC;QACzJ,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;IAC1C,CAAC;IAED,+BAA+B;IAC/B,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IAEzB,mCAAmC;IACnC,MAAM,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC;IAC5B,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM,YAAY,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IAE5C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;GAYvB,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CACrB,KAAK,CAAC,KAAK,EACX,KAAK,CAAC,OAAO,EACb,KAAK,CAAC,aAAa,IAAI,IAAI,EAC3B,KAAK,CAAC,UAAU,EAChB,KAAK,CAAC,QAAQ,IAAI,IAAI,EACtB,KAAK,CAAC,SAAS,IAAI,IAAI,EACvB,KAAK,CAAC,MAAM,EACZ,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,EAC1B,KAAK,CAAC,QAAQ,IAAI,IAAI,EACtB,KAAK,CAAC,SAAS,IAAI,IAAI,EACvB,KAAK,CAAC,QAAQ,IAAI,IAAI,EACtB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,gBAAgB,CAAC,EACtC,YAAY,CACb,CAAC;IAEF,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;IAChD,GAAG,CAAC,IAAI,CAAC,iCAAiC,QAAQ,YAAY,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;IAE9E,OAAO;QACL,OAAO,EAAE,IAAI;QACb,OAAO,EAAE,wCAAwC,KAAK,CAAC,KAAK,cAAc,QAAQ,eAAe,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,wHAAwH;QAC9O,QAAQ;KACT,CAAC;AACJ,CAAC"}

package/dist/tools/validators.d.ts

@@ -0,0 +1,82 @@
+import { z } from 'zod';
+/**
+ * Zod schema for the save_lesson tool input.
+ * Enforces structured, high-quality lesson data from the AI assistant.
+ */
+export declare const SaveLessonSchema: z.ZodObject<{
+    title: z.ZodString;
+    problem: z.ZodString;
+    error_message: z.ZodOptional<z.ZodString>;
+    root_cause: z.ZodString;
+    bad_code: z.ZodOptional<z.ZodString>;
+    good_code: z.ZodOptional<z.ZodString>;
+    lesson: z.ZodString;
+    tags: z.ZodArray<z.ZodString, "many">;
+    language: z.ZodOptional<z.ZodString>;
+    file_path: z.ZodOptional<z.ZodString>;
+    git_diff: z.ZodOptional<z.ZodString>;
+    review_questions: z.ZodArray<z.ZodObject<{
+        q: z.ZodString;
+        a: z.ZodString;
+    }, "strip", z.ZodTypeAny, {
+        q: string;
+        a: string;
+    }, {
+        q: string;
+        a: string;
+    }>, "many">;
+}, "strip", z.ZodTypeAny, {
+    title: string;
+    problem: string;
+    root_cause: string;
+    lesson: string;
+    tags: string[];
+    review_questions: {
+        q: string;
+        a: string;
+    }[];
+    error_message?: string | undefined;
+    bad_code?: string | undefined;
+    good_code?: string | undefined;
+    language?: string | undefined;
+    file_path?: string | undefined;
+    git_diff?: string | undefined;
+}, {
+    title: string;
+    problem: string;
+    root_cause: string;
+    lesson: string;
+    tags: string[];
+    review_questions: {
+        q: string;
+        a: string;
+    }[];
+    error_message?: string | undefined;
+    bad_code?: string | undefined;
+    good_code?: string | undefined;
+    language?: string | undefined;
+    file_path?: string | undefined;
+    git_diff?: string | undefined;
+}>;
+export type SaveLessonInput = z.infer<typeof SaveLessonSchema>;
+/**
+ * Zod schema for the memory (search) tool input.
+ */
+export declare const MemorySchema: z.ZodObject<{
+    query: z.ZodString;
+    limit: z.ZodDefault<z.ZodNumber>;
+    language: z.ZodOptional<z.ZodString>;
+    tags: z.ZodOptional<z.ZodArray<z.ZodString, "many">>;
+}, "strip", z.ZodTypeAny, {
+    query: string;
+    limit: number;
+    tags?: string[] | undefined;
+    language?: string | undefined;
+}, {
+    query: string;
+    tags?: string[] | undefined;
+    language?: string | undefined;
+    limit?: number | undefined;
+}>;
+export type MemoryInput = z.infer<typeof MemorySchema>;
+//# sourceMappingURL=validators.d.ts.map

package/dist/tools/validators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validators.d.ts","sourceRoot":"","sources":["../../src/tools/validators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB;;;GAGG;AACH,eAAO,MAAM,gBAAgB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAoE3B,CAAC;AAEH,MAAM,MAAM,eAAe,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,gBAAgB,CAAC,CAAC;AAE/D;;GAEG;AACH,eAAO,MAAM,YAAY;;;;;;;;;;;;;;;EAuBvB,CAAC;AAEH,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,YAAY,CAAC,CAAC"}