eklavya 1.7.0

package/dist/seed.js

@@ -0,0 +1,112 @@
+import fs from 'node:fs';
+import path from 'node:path';
+import { seedDir } from './paths.js';
+import { isValidSlug } from './slug.js';
+/**
+ * Bump when seed content changes so existing installs pick up the new graphs on
+ * next start. Seeding is idempotent, so re-running is always safe.
+ */
+export const SEED_VERSION = 1;
+const SEED_VERSION_KEY = 'seed_version';
+export const RELATIONS = ['prerequisite_of', 'related_to', 'part_of'];
+function validateGraph(graph, file) {
+    if (!graph.domain)
+        throw new Error(`${file}: missing "domain"`);
+    if (!Array.isArray(graph.concepts) || graph.concepts.length === 0) {
+        throw new Error(`${file}: "concepts" must be a non-empty array`);
+    }
+    const slugs = new Set();
+    for (const c of graph.concepts) {
+        if (!isValidSlug(c.slug))
+            throw new Error(`${file}: invalid slug "${c.slug}"`);
+        if (slugs.has(c.slug))
+            throw new Error(`${file}: duplicate slug "${c.slug}"`);
+        if (!c.name)
+            throw new Error(`${file}: concept "${c.slug}" missing name`);
+        if (!Number.isInteger(c.tier) || c.tier < 1 || c.tier > 5) {
+            throw new Error(`${file}: concept "${c.slug}" has tier ${c.tier}, expected 1..5`);
+        }
+        slugs.add(c.slug);
+    }
+    for (const e of graph.edges ?? []) {
+        if (!RELATIONS.includes(e.relation)) {
+            throw new Error(`${file}: unknown relation "${e.relation}"`);
+        }
+        // Edges may only point within the same seed file: cross-domain links are the
+        // LLM's job via upsert_concepts, and this keeps each file independently valid.
+        if (!slugs.has(e.from))
+            throw new Error(`${file}: edge from unknown slug "${e.from}"`);
+        if (!slugs.has(e.to))
+            throw new Error(`${file}: edge to unknown slug "${e.to}"`);
+        if (e.from === e.to)
+            throw new Error(`${file}: self-edge on "${e.from}"`);
+    }
+}
+export function loadSeedGraphs(dir = seedDir()) {
+    return fs
+        .readdirSync(dir)
+        .filter((f) => f.endsWith('.json'))
+        .sort()
+        .map((file) => {
+        const graph = JSON.parse(fs.readFileSync(path.join(dir, file), 'utf8'));
+        validateGraph(graph, file);
+        return graph;
+    });
+}
+/**
+ * Upserts a graph by slug. Mastery rows are never touched — a learner's history
+ * survives any number of seed updates.
+ */
+export function applySeedGraph(db, graph) {
+    const upsertConcept = db.prepare(`INSERT INTO concepts (slug, name, domain, description, tier, source)
+     VALUES (@slug, @name, @domain, @description, @tier, 'seed')
+     ON CONFLICT(slug) DO UPDATE SET
+       name        = excluded.name,
+       domain      = excluded.domain,
+       description = excluded.description,
+       tier        = excluded.tier,
+       source      = 'seed'`);
+    const idOf = db.prepare('SELECT id FROM concepts WHERE slug = ?');
+    const insertEdge = db.prepare(`INSERT OR IGNORE INTO edges (from_concept, to_concept, relation) VALUES (?, ?, ?)`);
+    let edges = 0;
+    db.transaction(() => {
+        for (const c of graph.concepts) {
+            upsertConcept.run({
+                slug: c.slug,
+                name: c.name,
+                domain: c.domain ?? graph.domain,
+                description: c.description ?? null,
+                tier: c.tier,
+            });
+        }
+        for (const e of graph.edges ?? []) {
+            const from = idOf.get(e.from);
+            const to = idOf.get(e.to);
+            if (!from || !to)
+                continue;
+            insertEdge.run(from.id, to.id, e.relation);
+            edges += 1;
+        }
+    })();
+    return { concepts: graph.concepts.length, edges, domains: [graph.domain] };
+}
+export function seedAll(db, dir = seedDir()) {
+    const summary = { concepts: 0, edges: 0, domains: [] };
+    for (const graph of loadSeedGraphs(dir)) {
+        const s = applySeedGraph(db, graph);
+        summary.concepts += s.concepts;
+        summary.edges += s.edges;
+        summary.domains.push(graph.domain);
+    }
+    db.prepare(`INSERT INTO meta (key, value) VALUES (?, ?)
+     ON CONFLICT(key) DO UPDATE SET value = excluded.value`).run(SEED_VERSION_KEY, String(SEED_VERSION));
+    return summary;
+}
+/** Seeds on first run, and again whenever SEED_VERSION moves. */
+export function seedIfNeeded(db, dir = seedDir()) {
+    const row = db.prepare('SELECT value FROM meta WHERE key = ?').get(SEED_VERSION_KEY);
+    if (row && Number(row.value) === SEED_VERSION)
+        return null;
+    return seedAll(db, dir);
+}
+//# sourceMappingURL=seed.js.map

package/dist/seed.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"seed.js","sourceRoot":"","sources":["../src/seed.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,SAAS,CAAC;AACzB,OAAO,IAAI,MAAM,WAAW,CAAC;AAE7B,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACrC,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAExC;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC;AAC9B,MAAM,gBAAgB,GAAG,cAAc,CAAC;AAExC,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,iBAAiB,EAAE,YAAY,EAAE,SAAS,CAAU,CAAC;AA6B/E,SAAS,aAAa,CAAC,KAAgB,EAAE,IAAY;IACnD,IAAI,CAAC,KAAK,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,oBAAoB,CAAC,CAAC;IAChE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,wCAAwC,CAAC,CAAC;IACnE,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC/B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,mBAAmB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAC/E,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,qBAAqB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAC9E,IAAI,CAAC,CAAC,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,cAAc,CAAC,CAAC,IAAI,gBAAgB,CAAC,CAAC;QAC1E,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC1D,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,cAAc,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC,IAAI,iBAAiB,CAAC,CAAC;QACpF,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,uBAAuB,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC;QAC/D,CAAC;QACD,6EAA6E;QAC7E,+EAA+E;QAC/E,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,6BAA6B,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QACvF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,2BAA2B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACjF,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,mBAAmB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;IAC5E,CAAC;AACH,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,MAAc,OAAO,EAAE;IACpD,OAAO,EAAE;SACN,WAAW,CAAC,GAAG,CAAC;SAChB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;SAClC,IAAI,EAAE;SACN,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACZ,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,CAAc,CAAC;QACrF,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3B,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;AACP,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,EAAY,EAAE,KAAgB;IAC3D,MAAM,aAAa,GAAG,EAAE,CAAC,OAAO,CAC9B;;;;;;;4BAOwB,CACzB,CAAC;IACF,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC;IAClE,MAAM,UAAU,GAAG,EAAE,CAAC,OAAO,CAC3B,mFAAmF,CACpF,CAAC;IAEF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;QAClB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC/B,aAAa,CAAC,GAAG,CAAC;gBAChB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM;gBAChC,WAAW,EAAE,CAAC,CAAC,WAAW,IAAI,IAAI;gBAClC,IAAI,EAAE,CAAC,CAAC,IAAI;aACb,CAAC,CAAC;QACL,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAA+B,CAAC;YAC5D,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAA+B,CAAC;YACxD,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE;gBAAE,SAAS;YAC3B,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC3C,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;IACH,CAAC,CAAC,EAAE,CAAC;IAEL,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;AAC7E,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,EAAY,EAAE,MAAc,OAAO,EAAE;IAC3D,MAAM,OAAO,GAAgB,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACpE,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,cAAc,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACpC,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC;QAC/B,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC;QACzB,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IACD,EAAE,CAAC,OAAO,CACR;2DACuD,CACxD,CAAC,GAAG,CAAC,gBAAgB,EAAE,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;IAC9C,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,YAAY,CAAC,EAAY,EAAE,MAAc,OAAO,EAAE;IAChE,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,sCAAsC,CAAC,CAAC,GAAG,CAAC,gBAAgB,CAEtE,CAAC;IACd,IAAI,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,YAAY;QAAE,OAAO,IAAI,CAAC;IAC3D,OAAO,OAAO,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;AAC1B,CAAC"}

package/dist/server.js

@@ -0,0 +1,52 @@
+#!/usr/bin/env node
+import fs from 'node:fs';
+import { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+import { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js';
+import { openDb } from './db.js';
+import { dbPath } from './paths.js';
+import { registerTools } from './tools/index.js';
+// Read the version rather than hardcoding it: a literal here silently reports a
+// stale version forever, since nothing about publishing touches this file.
+// `../package.json` resolves the same from src/ under tsx and from dist/ built.
+function serverVersion() {
+    try {
+        const pkg = JSON.parse(fs.readFileSync(new URL('../package.json', import.meta.url), 'utf8'));
+        return typeof pkg.version === 'string' ? pkg.version : '0.0.0';
+    }
+    catch {
+        return '0.0.0';
+    }
+}
+// stdout is the MCP transport. Anything diagnostic goes to stderr or it corrupts
+// the protocol stream.
+function log(message) {
+    process.stderr.write(`[eklavya-mcp] ${message}\n`);
+}
+async function main() {
+    const db = openDb();
+    log(`db ready at ${dbPath()}`);
+    const server = new McpServer({ name: 'eklavya', version: serverVersion() }, {
+        capabilities: { tools: {} },
+        instructions: 'Eklavya tracks what this developer has actually learned. Log the concepts your work touches, ' +
+            'and quiz from the learner profile rather than from scratch — never ask about a concept already mastered.',
+    });
+    registerTools(server, db);
+    const shutdown = () => {
+        try {
+            db.close();
+        }
+        catch {
+            // closing a already-closed handle on shutdown is not worth reporting
+        }
+        process.exit(0);
+    };
+    process.on('SIGINT', shutdown);
+    process.on('SIGTERM', shutdown);
+    await server.connect(new StdioServerTransport());
+    log('server connected over stdio');
+}
+main().catch((err) => {
+    log(`fatal: ${err instanceof Error ? err.stack ?? err.message : String(err)}`);
+    process.exit(1);
+});
+//# sourceMappingURL=server.js.map

package/dist/server.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"server.js","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":";AACA,OAAO,EAAE,MAAM,SAAS,CAAC;AACzB,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AACpE,OAAO,EAAE,oBAAoB,EAAE,MAAM,2CAA2C,CAAC;AACjF,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AACpC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,gFAAgF;AAChF,2EAA2E;AAC3E,gFAAgF;AAChF,SAAS,aAAa;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,iBAAiB,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QAC7F,OAAO,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;IACjE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,OAAO,CAAC;IACjB,CAAC;AACH,CAAC;AAED,iFAAiF;AACjF,uBAAuB;AACvB,SAAS,GAAG,CAAC,OAAe;IAC1B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,iBAAiB,OAAO,IAAI,CAAC,CAAC;AACrD,CAAC;AAED,KAAK,UAAU,IAAI;IACjB,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;IACpB,GAAG,CAAC,eAAe,MAAM,EAAE,EAAE,CAAC,CAAC;IAE/B,MAAM,MAAM,GAAG,IAAI,SAAS,CAC1B,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,aAAa,EAAE,EAAE,EAC7C;QACE,YAAY,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE;QAC3B,YAAY,EACV,+FAA+F;YAC/F,0GAA0G;KAC7G,CACF,CAAC;IAEF,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAE1B,MAAM,QAAQ,GAAG,GAAG,EAAE;QACpB,IAAI,CAAC;YACH,EAAE,CAAC,KAAK,EAAE,CAAC;QACb,CAAC;QAAC,MAAM,CAAC;YACP,qEAAqE;QACvE,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC;IACF,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC/B,OAAO,CAAC,EAAE,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAEhC,MAAM,MAAM,CAAC,OAAO,CAAC,IAAI,oBAAoB,EAAE,CAAC,CAAC;IACjD,GAAG,CAAC,6BAA6B,CAAC,CAAC;AACrC,CAAC;AAED,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAY,EAAE,EAAE;IAC5B,GAAG,CAAC,UAAU,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/E,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC,CAAC"}

package/dist/session.js

@@ -0,0 +1,24 @@
+const CURRENT_SESSION_KEY = 'current_session';
+export const FALLBACK_SESSION_ID = 'default';
+export function getCurrentSession(db) {
+    const row = db.prepare('SELECT value FROM meta WHERE key = ?').get(CURRENT_SESSION_KEY);
+    return row?.value ?? null;
+}
+export function setCurrentSession(db, sessionId) {
+    db.prepare(`INSERT INTO meta (key, value) VALUES (?, ?)
+     ON CONFLICT(key) DO UPDATE SET value = excluded.value`).run(CURRENT_SESSION_KEY, sessionId);
+}
+/**
+ * The model cannot see its own Claude Code session id, but the Phase 2 hooks
+ * receive the real one on stdin — so both sides have to agree on a resolution
+ * order or the hooks query rows that were written under a different key
+ * (phase-1 decision G1).
+ */
+export function resolveSessionId(db, explicit) {
+    const candidate = (explicit && explicit.trim()) ||
+        (process.env.EKLAVYA_SESSION_ID && process.env.EKLAVYA_SESSION_ID.trim()) ||
+        getCurrentSession(db) ||
+        FALLBACK_SESSION_ID;
+    return candidate;
+}
+//# sourceMappingURL=session.js.map

package/dist/session.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"session.js","sourceRoot":"","sources":["../src/session.ts"],"names":[],"mappings":"AAEA,MAAM,mBAAmB,GAAG,iBAAiB,CAAC;AAC9C,MAAM,CAAC,MAAM,mBAAmB,GAAG,SAAS,CAAC;AAE7C,MAAM,UAAU,iBAAiB,CAAC,EAAM;IACtC,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,sCAAsC,CAAC,CAAC,GAAG,CAAC,mBAAmB,CAEzE,CAAC;IACd,OAAO,GAAG,EAAE,KAAK,IAAI,IAAI,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,EAAM,EAAE,SAAiB;IACzD,EAAE,CAAC,OAAO,CACR;2DACuD,CACxD,CAAC,GAAG,CAAC,mBAAmB,EAAE,SAAS,CAAC,CAAC;AACxC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAAM,EAAE,QAAwB;IAC/D,MAAM,SAAS,GACb,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC7B,CAAC,OAAO,CAAC,GAAG,CAAC,kBAAkB,IAAI,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC;QACzE,iBAAiB,CAAC,EAAE,CAAC;QACrB,mBAAmB,CAAC;IAEtB,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/slug.js

@@ -0,0 +1,75 @@
+/**
+ * Concept slugs are the join key across the whole system, and the LLM is allowed
+ * to mint new ones (PRD §8 tool 6). Normalizing hard here is what keeps slug
+ * sprawl from turning the graph into mush (PRD §15).
+ */
+export function normalizeSlug(input) {
+    return input
+        .normalize('NFKD')
+        .toLowerCase()
+        .replace(/[^a-z0-9]+/g, '-')
+        .replace(/^-+|-+$/g, '')
+        .replace(/-{2,}/g, '-')
+        .slice(0, 80);
+}
+export function isValidSlug(slug) {
+    return /^[a-z0-9]+(-[a-z0-9]+)*$/.test(slug) && slug.length <= 80;
+}
+/**
+ * Token-set similarity between two slugs.
+ */
+export function tokenJaccard(a, b) {
+    const ta = new Set(a.split('-').filter(Boolean));
+    const tb = new Set(b.split('-').filter(Boolean));
+    if (ta.size === 0 || tb.size === 0)
+        return 0;
+    let intersection = 0;
+    for (const t of ta)
+        if (tb.has(t))
+            intersection += 1;
+    const union = ta.size + tb.size - intersection;
+    return union === 0 ? 0 : intersection / union;
+}
+/**
+ * Words that add no meaning to a concept name. Stripping these is what lets
+ * `jwt-structure-basics` find `jwt-structure` without also merging
+ * `refresh-token-rotation` into `refresh-token` — both pairs look identical to a
+ * similarity score, but only one of them is the same idea twice.
+ */
+const QUALIFIER_TOKENS = new Set([
+    'basic', 'basics', 'fundamental', 'fundamentals', 'intro', 'introduction',
+    'overview', 'explained', 'explainer', 'concept', 'concepts', 'general',
+    'generic', 'guide', 'tutorial', 'usage', 'primer', '101',
+    'strategy', 'strategies', 'approach', 'approaches',
+]);
+export function stripQualifiers(slug) {
+    const tokens = slug.split('-').filter(Boolean);
+    while (tokens.length > 1 && QUALIFIER_TOKENS.has(tokens[tokens.length - 1]))
+        tokens.pop();
+    while (tokens.length > 1 && QUALIFIER_TOKENS.has(tokens[0]))
+        tokens.shift();
+    return tokens.join('-');
+}
+/**
+ * Deliberately strict: 1.0 only catches a pure token reordering
+ * (`structure-jwt` ~ `jwt-structure`). Everything else has to survive the
+ * qualifier strip above. A test asserts no two shipped seed concepts match.
+ */
+export const FUZZY_MATCH_THRESHOLD = 0.8;
+export function findFuzzyMatch(slug, candidates, threshold = FUZZY_MATCH_THRESHOLD) {
+    const stripped = stripQualifiers(slug);
+    const sameOnceQualifiersGo = candidates.find((c) => stripQualifiers(c.slug) === stripped);
+    if (sameOnceQualifiersGo)
+        return sameOnceQualifiersGo;
+    let best;
+    let bestScore = 0;
+    for (const candidate of candidates) {
+        const score = tokenJaccard(stripped, stripQualifiers(candidate.slug));
+        if (score > bestScore) {
+            bestScore = score;
+            best = candidate;
+        }
+    }
+    return bestScore >= threshold ? best : undefined;
+}
+//# sourceMappingURL=slug.js.map

package/dist/slug.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"slug.js","sourceRoot":"","sources":["../src/slug.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,OAAO,KAAK;SACT,SAAS,CAAC,MAAM,CAAC;SACjB,WAAW,EAAE;SACb,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC;SAC3B,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC;SACtB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,IAAY;IACtC,OAAO,0BAA0B,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;AACpE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,CAAS,EAAE,CAAS;IAC/C,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IACjD,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IACjD,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE7C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,EAAE;QAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,YAAY,IAAI,CAAC,CAAC;IACrD,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,GAAG,YAAY,CAAC;IAC/C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;AAChD,CAAC;AAED;;;;;GAKG;AACH,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IAC/B,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,cAAc,EAAE,OAAO,EAAE,cAAc;IACzE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS;IACtE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK;IACxD,UAAU,EAAE,YAAY,EAAE,UAAU,EAAE,YAAY;CACnD,CAAC,CAAC;AAEH,MAAM,UAAU,eAAe,CAAC,IAAY;IAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC/C,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QAAE,MAAM,CAAC,GAAG,EAAE,CAAC;IAC3F,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;QAAE,MAAM,CAAC,KAAK,EAAE,CAAC;IAC7E,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAEzC,MAAM,UAAU,cAAc,CAC5B,IAAY,EACZ,UAAe,EACf,SAAS,GAAG,qBAAqB;IAEjC,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IAEvC,MAAM,oBAAoB,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAC,CAAC;IAC1F,IAAI,oBAAoB;QAAE,OAAO,oBAAoB,CAAC;IAEtD,IAAI,IAAmB,CAAC;IACxB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,EAAE,eAAe,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QACtE,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,SAAS,GAAG,KAAK,CAAC;YAClB,IAAI,GAAG,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAED,OAAO,SAAS,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;AACnD,CAAC"}

package/dist/srs.js

@@ -0,0 +1,206 @@
+/**
+ * SM-2 spaced repetition, mastery scoring and difficulty escalation (PRD §7).
+ *
+ * Everything here is pure: no database, no clock. `now` is always a parameter so
+ * the whole scheduling model is testable without freezing time.
+ */
+export const MIN_EASE = 1.3;
+export const DEFAULT_EASE = 2.5;
+export const MASTERY_THRESHOLD = 0.7;
+export const MIN_REPS_FOR_KNOWN = 2;
+/** Read-time decay (PRD §7): how fast an ignored concept loses credibility, and its floor. */
+export const DECAY_PER_WEEK = 0.05;
+export const DECAY_FLOOR = 0.3;
+/** Score smoothing (phase-1 decision G2). */
+export const SCORE_WINDOW = 5;
+export const SCORE_ALPHA = 0.6;
+export const MS_PER_DAY = 86_400_000;
+export function initialMastery() {
+    return { score: 0, ease: DEFAULT_EASE, interval_d: 0, reps: 0, last_seen: null, next_review: null };
+}
+const clamp = (n, lo, hi) => Math.min(hi, Math.max(lo, n));
+/**
+ * Recency-weighted mean of the last few grades, normalized to 0..1.
+ * A single attempt scores exactly `grade / 5`; older attempts fade at `SCORE_ALPHA`.
+ * Alpha is above 0.5 deliberately: at exactly 0.5 the weighting is symmetric, so a
+ * learner who is improving would score the same as one who is falling apart.
+ */
+export function scoreFromGrades(grades) {
+    const recent = grades.slice(-SCORE_WINDOW);
+    if (recent.length === 0)
+        return 0;
+    let score = clamp(recent[0], 0, 5) / 5;
+    for (let i = 1; i < recent.length; i += 1) {
+        score = SCORE_ALPHA * (clamp(recent[i], 0, 5) / 5) + (1 - SCORE_ALPHA) * score;
+    }
+    return Number(score.toFixed(6));
+}
+/**
+ * Standard SM-2 ease adjustment. Applied on every grade, not only on passes:
+ * getting a concept wrong should make it come back harder, which is the whole
+ * point of tracking ease separately from the interval.
+ */
+export function nextEase(ease, grade) {
+    const q = clamp(grade, 0, 5);
+    const adjusted = ease + (0.1 - (5 - q) * (0.08 + (5 - q) * 0.02));
+    return Number(Math.max(MIN_EASE, adjusted).toFixed(6));
+}
+/** Applies one graded attempt, returning the new mastery state. */
+export function applyGrade({ state, grade, grades, now }) {
+    const q = clamp(Math.round(grade), 0, 5);
+    const ease = nextEase(state.ease, q);
+    let reps;
+    let interval;
+    if (q >= 3) {
+        reps = state.reps + 1;
+        if (reps === 1)
+            interval = 1;
+        else if (reps === 2)
+            interval = 6;
+        else
+            interval = Math.round(state.interval_d * ease);
+    }
+    else {
+        // A failed recall restarts the ladder — the learner sees it again tomorrow.
+        reps = 0;
+        interval = 1;
+    }
+    return {
+        score: scoreFromGrades(grades),
+        ease,
+        interval_d: interval,
+        reps,
+        last_seen: now.toISOString(),
+        next_review: new Date(now.getTime() + interval * MS_PER_DAY).toISOString(),
+    };
+}
+/**
+ * Soft decay for concepts whose review date is long past. Computed at read time
+ * and never persisted (PRD §7), so an ignored concept resurfaces without its
+ * history being rewritten.
+ */
+export function decayedScore(score, nextReview, now) {
+    if (!nextReview)
+        return score;
+    const overdueMs = now.getTime() - Date.parse(nextReview);
+    if (!Number.isFinite(overdueMs) || overdueMs <= 0)
+        return score;
+    const weeks = Math.floor(overdueMs / (7 * MS_PER_DAY));
+    if (weeks <= 0)
+        return score;
+    const decayed = score - DECAY_PER_WEEK * weeks;
+    // The floor must never *raise* a score that was already below it.
+    return Number((decayed < DECAY_FLOOR ? Math.min(score, DECAY_FLOOR) : decayed).toFixed(6));
+}
+export function isKnown(state) {
+    return state.score >= MASTERY_THRESHOLD && state.reps >= MIN_REPS_FOR_KNOWN;
+}
+export function isDue(nextReview, now) {
+    if (!nextReview)
+        return false;
+    const t = Date.parse(nextReview);
+    return Number.isFinite(t) && t <= now.getTime();
+}
+/**
+ * Difficulty escalation (phase-1 decision G3). Tier belongs to the *question*,
+ * not the concept: a fundamentals concept gets asked at tier 4 of someone who
+ * keeps nailing it, which is how "never ask the same question twice" is honored
+ * without running out of concepts.
+ */
+export function nextTierToAsk(input) {
+    const { conceptTier, lastDifficulty, lastGrade, score = 0 } = input;
+    if (lastDifficulty == null || lastGrade == null) {
+        return clamp(Math.round(conceptTier), 1, 5);
+    }
+    if (lastGrade >= 4 && score >= MASTERY_THRESHOLD)
+        return clamp(lastDifficulty + 1, 1, 5);
+    if (lastGrade <= 2)
+        return clamp(lastDifficulty - 1, 1, 5);
+    return clamp(lastDifficulty, 1, 5);
+}
+/** Median tier of what the learner already knows (phase-1 decision G4). */
+export function suggestedTier(knownTiers) {
+    if (knownTiers.length === 0)
+        return 1;
+    const sorted = [...knownTiers].sort((a, b) => a - b);
+    const mid = Math.floor(sorted.length / 2);
+    const median = sorted.length % 2 === 0 ? (sorted[mid - 1] + sorted[mid]) / 2 : sorted[mid];
+    return clamp(Math.round(median), 1, 5);
+}
+/** In order. Promotion walks this array; nothing else may assume an ordering. */
+export const LEVELS = ['easy', 'medium', 'hard'];
+export const START_LEVEL = 'easy';
+/**
+ * The tier band each level may ask within.
+ *
+ * The bands overlap on purpose: promotion is not a cliff, so a learner who has
+ * just reached `medium` still meets tier-2 questions -- what changed is that 3
+ * and 4 are now reachable. And `hard` drops the tier-1 floor, because a
+ * definition question is a wasted question for someone a hundred answers into
+ * the concept.
+ *
+ * `easy` capping at 2 is the load-bearing decision of the whole phase. Tiers 1
+ * and 2 are answerable by someone who was *watching* the agent work, which is
+ * the state Eklavya finds people in; tier 3 asks them to defend a choice they
+ * did not make. An unanswerable first fortnight is how this gets switched off.
+ */
+export const LEVEL_BANDS = {
+    easy: { min: 1, max: 2 },
+    medium: { min: 2, max: 4 },
+    hard: { min: 3, max: 5 },
+};
+/**
+ * Ceiling on the distinct concepts a promotion needs among its passing answers.
+ *
+ * Not a config key: it is not a preference, it is what stops one concept
+ * re-asked forty ways from carrying a promotion, and a learner able to lower it
+ * would be lowering the only anti-grind guard there is.
+ */
+export const LEVEL_UP_MIN_CONCEPTS = 15;
+/**
+ * Distinct concepts required at a given answer threshold.
+ *
+ * Scaled rather than fixed, because a fixed 15 turns into a trap the moment
+ * anyone shortens the runway: `level_up_after: 5` would need fifteen distinct
+ * concepts among five passing answers, which is unsatisfiable, and the promotion
+ * would never fire with nothing on screen explaining why. A third of the
+ * threshold keeps the guard proportional to whatever runway is configured.
+ */
+export function requiredConcepts(after) {
+    return Math.max(1, Math.min(LEVEL_UP_MIN_CONCEPTS, Math.ceil(after / 3)));
+}
+export function clampToLevel(tier, level) {
+    const band = LEVEL_BANDS[level];
+    return clamp(Math.round(tier), band.min, band.max);
+}
+export function nextLevel(level) {
+    const i = LEVELS.indexOf(level);
+    return i >= 0 && i < LEVELS.length - 1 ? LEVELS[i + 1] : null;
+}
+/**
+ * Every condition a promotion requires, evaluated together.
+ *
+ * Accuracy exists because the answer count on its own is a measure of endurance:
+ * a hundred answers of which sixty were wrong is evidence the level is too hard,
+ * and promoting on it would be the exact failure levels were added to prevent.
+ *
+ * Declines are excluded from `answered` upstream, so they cost nothing in either
+ * half of the fraction. Skipping a question honestly must never damage a level,
+ * or the level becomes a reason to guess rather than to skip.
+ */
+export function checkPromotion(input) {
+    const { level, counts, after, minAccuracy } = input;
+    const accuracy = counts.answered > 0 ? Number((counts.passed / counts.answered).toFixed(6)) : 0;
+    const to = nextLevel(level);
+    const unmet = [];
+    if (!to)
+        unmet.push('max_level');
+    if (counts.passed < after)
+        unmet.push('answers');
+    if (accuracy < minAccuracy)
+        unmet.push('accuracy');
+    if (counts.concepts < requiredConcepts(after))
+        unmet.push('concepts');
+    return { promote: unmet.length === 0, to: unmet.length === 0 ? to : null, accuracy, unmet };
+}
+//# sourceMappingURL=srs.js.map

package/dist/srs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"srs.js","sourceRoot":"","sources":["../src/srs.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,QAAQ,GAAG,GAAG,CAAC;AAC5B,MAAM,CAAC,MAAM,YAAY,GAAG,GAAG,CAAC;AAChC,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AACrC,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAEpC,8FAA8F;AAC9F,MAAM,CAAC,MAAM,cAAc,GAAG,IAAI,CAAC;AACnC,MAAM,CAAC,MAAM,WAAW,GAAG,GAAG,CAAC;AAE/B,6CAA6C;AAC7C,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC;AAC9B,MAAM,CAAC,MAAM,WAAW,GAAG,GAAG,CAAC;AAE/B,MAAM,CAAC,MAAM,UAAU,GAAG,UAAU,CAAC;AAWrC,MAAM,UAAU,cAAc;IAC5B,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;AACtG,CAAC;AAED,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAU,EAAE,EAAU,EAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AAE3F;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,MAAgB;IAC9C,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC;IAC3C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAElC,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,KAAK,GAAG,WAAW,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,KAAK,CAAC;IAClF,CAAC;IACD,OAAO,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;AAClC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY,EAAE,KAAa;IAClD,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAClE,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC;AAUD,mEAAmE;AACnE,MAAM,UAAU,UAAU,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAmB;IACvE,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAErC,IAAI,IAAY,CAAC;IACjB,IAAI,QAAgB,CAAC;IAErB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACX,IAAI,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC;QACtB,IAAI,IAAI,KAAK,CAAC;YAAE,QAAQ,GAAG,CAAC,CAAC;aACxB,IAAI,IAAI,KAAK,CAAC;YAAE,QAAQ,GAAG,CAAC,CAAC;;YAC7B,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IACtD,CAAC;SAAM,CAAC;QACN,4EAA4E;QAC5E,IAAI,GAAG,CAAC,CAAC;QACT,QAAQ,GAAG,CAAC,CAAC;IACf,CAAC;IAED,OAAO;QACL,KAAK,EAAE,eAAe,CAAC,MAAM,CAAC;QAC9B,IAAI;QACJ,UAAU,EAAE,QAAQ;QACpB,IAAI;QACJ,SAAS,EAAE,GAAG,CAAC,WAAW,EAAE;QAC5B,WAAW,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,QAAQ,GAAG,UAAU,CAAC,CAAC,WAAW,EAAE;KAC3E,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,UAAyB,EAAE,GAAS;IAC9E,IAAI,CAAC,UAAU;QAAE,OAAO,KAAK,CAAC;IAE9B,MAAM,SAAS,GAAG,GAAG,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IACzD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,SAAS,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAEhE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;IACvD,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAE7B,MAAM,OAAO,GAAG,KAAK,GAAG,cAAc,GAAG,KAAK,CAAC;IAC/C,kEAAkE;IAClE,OAAO,MAAM,CAAC,CAAC,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7F,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,KAA2C;IACjE,OAAO,KAAK,CAAC,KAAK,IAAI,iBAAiB,IAAI,KAAK,CAAC,IAAI,IAAI,kBAAkB,CAAC;AAC9E,CAAC;AAED,MAAM,UAAU,KAAK,CAAC,UAAyB,EAAE,GAAS;IACxD,IAAI,CAAC,UAAU;QAAE,OAAO,KAAK,CAAC;IAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IACjC,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;AAClD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,KAK7B;IACC,MAAM,EAAE,WAAW,EAAE,cAAc,EAAE,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC;IAEpE,IAAI,cAAc,IAAI,IAAI,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;QAChD,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,SAAS,IAAI,CAAC,IAAI,KAAK,IAAI,iBAAiB;QAAE,OAAO,KAAK,CAAC,cAAc,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzF,IAAI,SAAS,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC,cAAc,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,OAAO,KAAK,CAAC,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,aAAa,CAAC,UAAoB;IAChD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtC,MAAM,MAAM,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1C,MAAM,MAAM,GACV,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAE,GAAG,MAAM,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAE,CAAC;IACjF,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACzC,CAAC;AAYD,iFAAiF;AACjF,MAAM,CAAC,MAAM,MAAM,GAAqB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAU,CAAC;AAE5E,MAAM,CAAC,MAAM,WAAW,GAAU,MAAM,CAAC;AAEzC;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,WAAW,GAAgD;IACtE,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;IACxB,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;IAC1B,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;CACzB,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,EAAE,CAAC;AAExC;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa;IAC5C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,qBAAqB,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5E,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,IAAY,EAAE,KAAY;IACrD,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IAChC,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;AACrD,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,KAAY;IACpC,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAChC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AACjE,CAAC;AAsBD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAAC,KAK9B;IACC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC;IACpD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAE5B,MAAM,KAAK,GAAuB,EAAE,CAAC;IACrC,IAAI,CAAC,EAAE;QAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACjC,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACjD,IAAI,QAAQ,GAAG,WAAW;QAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACnD,IAAI,MAAM,CAAC,QAAQ,GAAG,gBAAgB,CAAC,KAAK,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAEtE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;AAC9F,CAAC"}