@indigoai-us/cq 0.0.1

package/dist/pipeline/__tests__/pipeline.test.js

@@ -0,0 +1,320 @@
+import { describe, it, expect, beforeEach, afterEach } from "vitest";
+import { mkdtemp, rm } from "node:fs/promises";
+import { join } from "node:path";
+import { tmpdir } from "node:os";
+import { initMetadataDb, closeDb } from "../../metadata/index.js";
+import { initCuriosityQueue, addCuriosity, getItem } from "../../curiosity/index.js";
+import { initKnowledgeTree, writeEntry, readEntry } from "../../knowledge-tree/index.js";
+import { runPipeline } from "../index.js";
+// ---------------------------------------------------------------------------
+// Mock providers
+// ---------------------------------------------------------------------------
+class MockSearchProvider {
+    name = "mock-search";
+    _lastCost = 0;
+    _results;
+    _shouldFail = false;
+    constructor(results, shouldFail = false) {
+        this._results = results ?? [
+            {
+                title: "What is quantum computing",
+                url: "https://example.com/quantum",
+                snippet: "Quantum computing uses qubits to perform calculations.",
+                content: "Quantum computing is a type of computation that harnesses quantum mechanics.",
+            },
+            {
+                title: "Quantum basics explained",
+                url: "https://example.com/basics",
+                snippet: "An introduction to quantum computing concepts and principles.",
+            },
+        ];
+        this._shouldFail = shouldFail;
+    }
+    async search(_query, maxResults = 5) {
+        if (this._shouldFail)
+            throw new Error("Search API unavailable");
+        this._lastCost = 0.01;
+        return this._results.slice(0, maxResults);
+    }
+    lastCallCostUsd() {
+        return this._lastCost;
+    }
+}
+class MockModelProvider {
+    name = "mock-model";
+    _lastCost = 0;
+    _shouldFail = false;
+    _synthesisOverride;
+    constructor(shouldFail = false, synthesisOverride) {
+        this._shouldFail = shouldFail;
+        this._synthesisOverride = synthesisOverride;
+    }
+    async synthesize(question, searchResults) {
+        if (this._shouldFail)
+            throw new Error("Model API unavailable");
+        this._lastCost = 0.002;
+        return {
+            title: `Understanding: ${question}`,
+            category: "technology",
+            content: `Comprehensive answer synthesised from ${searchResults.length} sources about ${question}.`,
+            tags: ["research", "technology"],
+            source: searchResults[0]?.url ?? "unknown",
+            confidence: 0.85,
+            ...this._synthesisOverride,
+        };
+    }
+    async categorize(_content, categories) {
+        this._lastCost = 0.001;
+        return categories[0] ?? "general";
+    }
+    lastCallCostUsd() {
+        return this._lastCost;
+    }
+}
+// ---------------------------------------------------------------------------
+// Test setup
+// ---------------------------------------------------------------------------
+let tmpDir;
+let dataDir;
+beforeEach(async () => {
+    tmpDir = await mkdtemp(join(tmpdir(), "cq-pipeline-test-"));
+    dataDir = join(tmpDir, "knowledge");
+    await initKnowledgeTree(dataDir);
+    initMetadataDb(":memory:");
+    initCuriosityQueue();
+});
+afterEach(async () => {
+    closeDb();
+    await rm(tmpDir, { recursive: true, force: true });
+});
+function addTestItem(question = "What is quantum computing?") {
+    const item = addCuriosity({
+        question,
+        context: "Test context",
+        source: "agent",
+        priority: 5,
+    });
+    if (!item)
+        throw new Error("Failed to add curiosity item");
+    return item.id;
+}
+function makeOptions(overrides = {}) {
+    return {
+        dataDir,
+        searchProvider: new MockSearchProvider(),
+        modelProvider: new MockModelProvider(),
+        ...overrides,
+    };
+}
+// ---------------------------------------------------------------------------
+// Happy path
+// ---------------------------------------------------------------------------
+describe("runPipeline — happy path", () => {
+    it("creates a knowledge entry and returns success", async () => {
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions());
+        expect(result.success).toBe(true);
+        expect(result.action).toBe("created");
+        expect(result.curiosityItemId).toBe(id);
+        expect(result.knowledgeSlug).toBeDefined();
+        expect(result.knowledgeCategory).toBe("technology");
+        expect(result.durationMs).toBeGreaterThanOrEqual(0);
+        expect(result.error).toBeUndefined();
+    });
+    it("writes the entry to the knowledge tree", async () => {
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions());
+        const entry = await readEntry(dataDir, result.knowledgeCategory, result.knowledgeSlug);
+        expect(entry.title).toContain("quantum computing");
+        expect(entry.content.length).toBeGreaterThan(0);
+        expect(entry.tags).toContain("research");
+    });
+    it("marks the curiosity item as completed", async () => {
+        const id = addTestItem();
+        await runPipeline(id, "What is quantum computing?", makeOptions());
+        const item = getItem(id);
+        expect(item?.status).toBe("completed");
+    });
+    it("tracks duration in milliseconds", async () => {
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions());
+        expect(typeof result.durationMs).toBe("number");
+        expect(result.durationMs).toBeGreaterThanOrEqual(0);
+    });
+});
+// ---------------------------------------------------------------------------
+// Budget checking
+// ---------------------------------------------------------------------------
+describe("runPipeline — budget checking", () => {
+    it("skips execution when budget is not allowed", async () => {
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions({
+            checkBudget: () => ({ allowed: false, remainingUsd: 0 }),
+        }));
+        expect(result.success).toBe(false);
+        expect(result.action).toBe("skipped_budget");
+        expect(result.error).toBeUndefined();
+        // Item should NOT be marked in_progress (budget check is before)
+        const item = getItem(id);
+        expect(item?.status).toBe("pending");
+    });
+    it("proceeds when budget is allowed", async () => {
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions({
+            checkBudget: () => ({ allowed: true, remainingUsd: 10.0 }),
+        }));
+        expect(result.success).toBe(true);
+        expect(result.action).toBe("created");
+    });
+    it("calls charge function for search and synthesis", async () => {
+        const charges = [];
+        const id = addTestItem();
+        await runPipeline(id, "What is quantum computing?", makeOptions({
+            charge: (type, costUsd) => charges.push({ type, costUsd }),
+        }));
+        const searchCharge = charges.find((c) => c.type === "search");
+        const synthCharge = charges.find((c) => c.type === "synthesize");
+        expect(searchCharge).toBeDefined();
+        expect(searchCharge.costUsd).toBe(0.01);
+        expect(synthCharge).toBeDefined();
+        expect(synthCharge.costUsd).toBe(0.002);
+    });
+});
+// ---------------------------------------------------------------------------
+// Duplicate detection
+// ---------------------------------------------------------------------------
+describe("runPipeline — duplicate detection", () => {
+    it("skips when a knowledge entry with similar title exists", async () => {
+        // Pre-populate knowledge tree with an entry in the same category
+        await writeEntry(dataDir, {
+            category: "technology",
+            title: "Understanding: What is quantum computing?",
+            content: "Existing entry about quantum computing.",
+            tags: ["quantum"],
+        });
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions());
+        expect(result.success).toBe(true);
+        expect(result.action).toBe("skipped_duplicate");
+        expect(result.knowledgeCategory).toBe("technology");
+    });
+    it("creates entry when titles are sufficiently different", async () => {
+        // Pre-populate with a very different topic
+        await writeEntry(dataDir, {
+            category: "technology",
+            title: "Understanding blockchain fundamentals",
+            content: "Blockchain is a distributed ledger technology.",
+            tags: ["blockchain"],
+        });
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions());
+        expect(result.success).toBe(true);
+        expect(result.action).toBe("created");
+    });
+    it("respects custom dedup threshold", async () => {
+        await writeEntry(dataDir, {
+            category: "technology",
+            title: "Understanding quantum computing basics",
+            content: "Existing entry.",
+            tags: [],
+        });
+        const id = addTestItem();
+        // Very high threshold — should NOT trigger dedup
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions({ dedupThreshold: 0.99 }));
+        expect(result.action).toBe("created");
+    });
+});
+// ---------------------------------------------------------------------------
+// Error handling
+// ---------------------------------------------------------------------------
+describe("runPipeline — error handling", () => {
+    it("handles search provider failure", async () => {
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions({
+            searchProvider: new MockSearchProvider(undefined, true),
+        }));
+        expect(result.success).toBe(false);
+        expect(result.action).toBe("failed");
+        expect(result.error).toContain("Search failed");
+        const item = getItem(id);
+        expect(item?.status).toBe("failed");
+    });
+    it("handles model provider failure", async () => {
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions({
+            modelProvider: new MockModelProvider(true),
+        }));
+        expect(result.success).toBe(false);
+        expect(result.action).toBe("failed");
+        expect(result.error).toContain("Synthesis failed");
+        const item = getItem(id);
+        expect(item?.status).toBe("failed");
+    });
+    it("fails when all search results are too short", async () => {
+        const shortResults = [
+            { title: "Short", url: "https://example.com", snippet: "tiny" },
+        ];
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions({
+            searchProvider: new MockSearchProvider(shortResults),
+        }));
+        expect(result.success).toBe(false);
+        expect(result.action).toBe("failed");
+        expect(result.error).toContain("No search results passed vetting");
+    });
+});
+// ---------------------------------------------------------------------------
+// Vetting
+// ---------------------------------------------------------------------------
+describe("runPipeline — vetting", () => {
+    it("filters out results below minimum content length", async () => {
+        const mixedResults = [
+            { title: "Short", url: "https://example.com/1", snippet: "too short" },
+            {
+                title: "Long enough",
+                url: "https://example.com/2",
+                snippet: "This result has enough content to pass the vetting threshold.",
+            },
+        ];
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions({
+            searchProvider: new MockSearchProvider(mixedResults),
+        }));
+        // Should succeed because one result passes vetting
+        expect(result.success).toBe(true);
+        expect(result.action).toBe("created");
+    });
+    it("respects custom minimum content length", async () => {
+        const results = [
+            {
+                title: "Medium",
+                url: "https://example.com",
+                snippet: "A medium-length snippet that is 50+ chars long for testing purposes here.",
+            },
+        ];
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", makeOptions({
+            searchProvider: new MockSearchProvider(results),
+            minContentLength: 200, // Very high threshold
+        }));
+        expect(result.success).toBe(false);
+        expect(result.action).toBe("failed");
+        expect(result.error).toContain("No search results passed vetting");
+    });
+});
+// ---------------------------------------------------------------------------
+// Pipeline without optional parameters
+// ---------------------------------------------------------------------------
+describe("runPipeline — optional parameters", () => {
+    it("works without budget checker or charge function", async () => {
+        const id = addTestItem();
+        const result = await runPipeline(id, "What is quantum computing?", {
+            dataDir,
+            searchProvider: new MockSearchProvider(),
+            modelProvider: new MockModelProvider(),
+        });
+        expect(result.success).toBe(true);
+        expect(result.action).toBe("created");
+    });
+});
+//# sourceMappingURL=pipeline.test.js.map

package/dist/pipeline/__tests__/pipeline.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipeline.test.js","sourceRoot":"","sources":["../../../src/pipeline/__tests__/pipeline.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,QAAQ,CAAC;AACrE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AACjC,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,yBAAyB,CAAC;AAClE,OAAO,EAAE,kBAAkB,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,0BAA0B,CAAC;AACrF,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,+BAA+B,CAAC;AACzF,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAS1C,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E,MAAM,kBAAkB;IACb,IAAI,GAAG,aAAa,CAAC;IACtB,SAAS,GAAG,CAAC,CAAC;IACd,QAAQ,CAAoB;IAC5B,WAAW,GAAG,KAAK,CAAC;IAE5B,YAAY,OAA2B,EAAE,UAAU,GAAG,KAAK;QACzD,IAAI,CAAC,QAAQ,GAAG,OAAO,IAAI;YACzB;gBACE,KAAK,EAAE,2BAA2B;gBAClC,GAAG,EAAE,6BAA6B;gBAClC,OAAO,EAAE,wDAAwD;gBACjE,OAAO,EAAE,8EAA8E;aACxF;YACD;gBACE,KAAK,EAAE,0BAA0B;gBACjC,GAAG,EAAE,4BAA4B;gBACjC,OAAO,EAAE,+DAA+D;aACzE;SACF,CAAC;QACF,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;IAChC,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,MAAc,EAAE,UAAU,GAAG,CAAC;QACzC,IAAI,IAAI,CAAC,WAAW;YAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAChE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAC5C,CAAC;IAED,eAAe;QACb,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;CACF;AAED,MAAM,iBAAiB;IACZ,IAAI,GAAG,YAAY,CAAC;IACrB,SAAS,GAAG,CAAC,CAAC;IACd,WAAW,GAAG,KAAK,CAAC;IACpB,kBAAkB,CAA4B;IAEtD,YAAY,UAAU,GAAG,KAAK,EAAE,iBAA4C;QAC1E,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,kBAAkB,GAAG,iBAAiB,CAAC;IAC9C,CAAC;IAED,KAAK,CAAC,UAAU,CACd,QAAgB,EAChB,aAAgC;QAEhC,IAAI,IAAI,CAAC,WAAW;YAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC/D,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACvB,OAAO;YACL,KAAK,EAAE,kBAAkB,QAAQ,EAAE;YACnC,QAAQ,EAAE,YAAY;YACtB,OAAO,EAAE,yCAAyC,aAAa,CAAC,MAAM,kBAAkB,QAAQ,GAAG;YACnG,IAAI,EAAE,CAAC,UAAU,EAAE,YAAY,CAAC;YAChC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,SAAS;YAC1C,UAAU,EAAE,IAAI;YAChB,GAAG,IAAI,CAAC,kBAAkB;SAC3B,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,QAAgB,EAAE,UAAoB;QACrD,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACvB,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC;IACpC,CAAC;IAED,eAAe;QACb,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;CACF;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E,IAAI,MAAc,CAAC;AACnB,IAAI,OAAe,CAAC;AAEpB,UAAU,CAAC,KAAK,IAAI,EAAE;IACpB,MAAM,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAC5D,OAAO,GAAG,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACpC,MAAM,iBAAiB,CAAC,OAAO,CAAC,CAAC;IACjC,cAAc,CAAC,UAAU,CAAC,CAAC;IAC3B,kBAAkB,EAAE,CAAC;AACvB,CAAC,CAAC,CAAC;AAEH,SAAS,CAAC,KAAK,IAAI,EAAE;IACnB,OAAO,EAAE,CAAC;IACV,MAAM,EAAE,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;AACrD,CAAC,CAAC,CAAC;AAEH,SAAS,WAAW,CAAC,QAAQ,GAAG,4BAA4B;IAC1D,MAAM,IAAI,GAAG,YAAY,CAAC;QACxB,QAAQ;QACR,OAAO,EAAE,cAAc;QACvB,MAAM,EAAE,OAAO;QACf,QAAQ,EAAE,CAAC;KACZ,CAAC,CAAC;IACH,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAC3D,OAAO,IAAI,CAAC,EAAE,CAAC;AACjB,CAAC;AAED,SAAS,WAAW,CAAC,YAAsC,EAAE;IAC3D,OAAO;QACL,OAAO;QACP,cAAc,EAAE,IAAI,kBAAkB,EAAE;QACxC,aAAa,EAAE,IAAI,iBAAiB,EAAE;QACtC,GAAG,SAAS;KACb,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,EAAE,CAAC,+CAA+C,EAAE,KAAK,IAAI,EAAE;QAC7D,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,EAAE,EAAE,4BAA4B,EAAE,WAAW,EAAE,CAAC,CAAC;QAElF,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,WAAW,EAAE,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACpD,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,aAAa,EAAE,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,KAAK,IAAI,EAAE;QACtD,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,EAAE,EAAE,4BAA4B,EAAE,WAAW,EAAE,CAAC,CAAC;QAElF,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,OAAO,EAAE,MAAM,CAAC,iBAAkB,EAAE,MAAM,CAAC,aAAc,CAAC,CAAC;QACzF,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC;QACnD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,KAAK,IAAI,EAAE;QACrD,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,WAAW,CAAC,EAAE,EAAE,4BAA4B,EAAE,WAAW,EAAE,CAAC,CAAC;QAEnE,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;QAC/C,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,EAAE,EAAE,4BAA4B,EAAE,WAAW,EAAE,CAAC,CAAC;QAElF,MAAM,CAAC,OAAO,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChD,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E,QAAQ,CAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,EAAE,CAAC,4CAA4C,EAAE,KAAK,IAAI,EAAE;QAC1D,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAC9B,EAAE,EACF,4BAA4B,EAC5B,WAAW,CAAC;YACV,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;SACzD,CAAC,CACH,CAAC;QAEF,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,aAAa,EAAE,CAAC;QAErC,iEAAiE;QACjE,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;QAC/C,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAC9B,EAAE,EACF,4BAA4B,EAC5B,WAAW,CAAC;YACV,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC;SAC3D,CAAC,CACH,CAAC;QAEF,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,KAAK,IAAI,EAAE;QAC9D,MAAM,OAAO,GAA6C,EAAE,CAAC;QAC7D,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QAEzB,MAAM,WAAW,CACf,EAAE,EACF,4BAA4B,EAC5B,WAAW,CAAC;YACV,MAAM,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;SAC3D,CAAC,CACH,CAAC;QAEF,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;QAC9D,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;QAEjE,MAAM,CAAC,YAAY,CAAC,CAAC,WAAW,EAAE,CAAC;QACnC,MAAM,CAAC,YAAa,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,CAAC,WAAW,CAAC,CAAC,WAAW,EAAE,CAAC;QAClC,MAAM,CAAC,WAAY,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E,QAAQ,CAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,EAAE,CAAC,wDAAwD,EAAE,KAAK,IAAI,EAAE;QACtE,iEAAiE;QACjE,MAAM,UAAU,CAAC,OAAO,EAAE;YACxB,QAAQ,EAAE,YAAY;YACtB,KAAK,EAAE,2CAA2C;YAClD,OAAO,EAAE,yCAAyC;YAClD,IAAI,EAAE,CAAC,SAAS,CAAC;SAClB,CAAC,CAAC;QAEH,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,EAAE,EAAE,4BAA4B,EAAE,WAAW,EAAE,CAAC,CAAC;QAElF,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAChD,MAAM,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,KAAK,IAAI,EAAE;QACpE,2CAA2C;QAC3C,MAAM,UAAU,CAAC,OAAO,EAAE;YACxB,QAAQ,EAAE,YAAY;YACtB,KAAK,EAAE,uCAAuC;YAC9C,OAAO,EAAE,gDAAgD;YACzD,IAAI,EAAE,CAAC,YAAY,CAAC;SACrB,CAAC,CAAC;QAEH,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,EAAE,EAAE,4BAA4B,EAAE,WAAW,EAAE,CAAC,CAAC;QAElF,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;QAC/C,MAAM,UAAU,CAAC,OAAO,EAAE;YACxB,QAAQ,EAAE,YAAY;YACtB,KAAK,EAAE,wCAAwC;YAC/C,OAAO,EAAE,iBAAiB;YAC1B,IAAI,EAAE,EAAE;SACT,CAAC,CAAC;QAEH,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,iDAAiD;QACjD,MAAM,MAAM,GAAG,MAAM,WAAW,CAC9B,EAAE,EACF,4BAA4B,EAC5B,WAAW,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CACtC,CAAC;QAEF,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,EAAE,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;QAC/C,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAC9B,EAAE,EACF,4BAA4B,EAC5B,WAAW,CAAC;YACV,cAAc,EAAE,IAAI,kBAAkB,CAAC,SAAS,EAAE,IAAI,CAAC;SACxD,CAAC,CACH,CAAC;QAEF,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;QAEhD,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,KAAK,IAAI,EAAE;QAC9C,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAC9B,EAAE,EACF,4BAA4B,EAC5B,WAAW,CAAC;YACV,aAAa,EAAE,IAAI,iBAAiB,CAAC,IAAI,CAAC;SAC3C,CAAC,CACH,CAAC;QAEF,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,CAAC;QAEnD,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,KAAK,IAAI,EAAE;QAC3D,MAAM,YAAY,GAAsB;YACtC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,qBAAqB,EAAE,OAAO,EAAE,MAAM,EAAE;SAChE,CAAC;QAEF,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAC9B,EAAE,EACF,4BAA4B,EAC5B,WAAW,CAAC;YACV,cAAc,EAAE,IAAI,kBAAkB,CAAC,YAAY,CAAC;SACrD,CAAC,CACH,CAAC;QAEF,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,kCAAkC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,EAAE,CAAC,kDAAkD,EAAE,KAAK,IAAI,EAAE;QAChE,MAAM,YAAY,GAAsB;YACtC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,uBAAuB,EAAE,OAAO,EAAE,WAAW,EAAE;YACtE;gBACE,KAAK,EAAE,aAAa;gBACpB,GAAG,EAAE,uBAAuB;gBAC5B,OAAO,EAAE,+DAA+D;aACzE;SACF,CAAC;QAEF,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAC9B,EAAE,EACF,4BAA4B,EAC5B,WAAW,CAAC;YACV,cAAc,EAAE,IAAI,kBAAkB,CAAC,YAAY,CAAC;SACrD,CAAC,CACH,CAAC;QAEF,mDAAmD;QACnD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,KAAK,IAAI,EAAE;QACtD,MAAM,OAAO,GAAsB;YACjC;gBACE,KAAK,EAAE,QAAQ;gBACf,GAAG,EAAE,qBAAqB;gBAC1B,OAAO,EAAE,2EAA2E;aACrF;SACF,CAAC;QAEF,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAC9B,EAAE,EACF,4BAA4B,EAC5B,WAAW,CAAC;YACV,cAAc,EAAE,IAAI,kBAAkB,CAAC,OAAO,CAAC;YAC/C,gBAAgB,EAAE,GAAG,EAAE,sBAAsB;SAC9C,CAAC,CACH,CAAC;QAEF,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,kCAAkC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,8EAA8E;AAC9E,uCAAuC;AACvC,8EAA8E;AAE9E,QAAQ,CAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,EAAE,CAAC,iDAAiD,EAAE,KAAK,IAAI,EAAE;QAC/D,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,EAAE,EAAE,4BAA4B,EAAE;YACjE,OAAO;YACP,cAAc,EAAE,IAAI,kBAAkB,EAAE;YACxC,aAAa,EAAE,IAAI,iBAAiB,EAAE;SACvC,CAAC,CAAC;QAEH,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/pipeline/index.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Research Pipeline — the core engine connecting curiosity queue to knowledge tree.
+ *
+ * Flow: check budget > mark in_progress > search > vet resources > synthesize >
+ *       categorize > dedup check > write knowledge + index > mark completed
+ */
+import type { PipelineResult, PipelineOptions } from "./types.js";
+export type { PipelineResult, PipelineOptions, PipelineAction, BudgetCheck } from "./types.js";
+/**
+ * Run the full research pipeline for a single curiosity item.
+ *
+ * Steps:
+ * 1. Check budget (if checker provided)
+ * 2. Mark curiosity item as in_progress
+ * 3. Search for the question via search provider
+ * 4. Vet search results (filter low-quality)
+ * 5. Synthesize results via model provider
+ * 6. Duplicate detection against existing knowledge
+ * 7. Write knowledge entry + index metadata
+ * 8. Mark curiosity item as completed
+ */
+export declare function runPipeline(curiosityItemId: number, question: string, options: PipelineOptions): Promise<PipelineResult>;
+//# sourceMappingURL=index.d.ts.map

package/dist/pipeline/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/pipeline/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAaH,OAAO,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAElE,YAAY,EAAE,cAAc,EAAE,eAAe,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAiE/F;;;;;;;;;;;;GAYG;AACH,wBAAsB,WAAW,CAC/B,eAAe,EAAE,MAAM,EACvB,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,eAAe,GACvB,OAAO,CAAC,cAAc,CAAC,CAkKzB"}

package/dist/pipeline/index.js

@@ -0,0 +1,212 @@
+/**
+ * Research Pipeline — the core engine connecting curiosity queue to knowledge tree.
+ *
+ * Flow: check budget > mark in_progress > search > vet resources > synthesize >
+ *       categorize > dedup check > write knowledge + index > mark completed
+ */
+import { writeEntry, readEntry } from "../knowledge-tree/index.js";
+import { indexEntry } from "../metadata/index.js";
+import { markInProgress, markCompleted, markFailed, } from "../curiosity/index.js";
+import { normalizedSimilarity } from "../curiosity/dedup.js";
+import { listEntries } from "../knowledge-tree/index.js";
+// ---------------------------------------------------------------------------
+// Constants
+// ---------------------------------------------------------------------------
+const DEFAULT_MAX_RESULTS = 5;
+const DEFAULT_MIN_CONTENT_LENGTH = 20;
+const DEFAULT_DEDUP_THRESHOLD = 0.8;
+// ---------------------------------------------------------------------------
+// Vetting (basic inline — US-007 will build the full vetter)
+// ---------------------------------------------------------------------------
+/** Basic content vetting: checks that search results have meaningful content. */
+function vetResults(results, minContentLength) {
+    return results.filter((r) => {
+        const text = r.content ?? r.snippet;
+        return text.length >= minContentLength;
+    });
+}
+// ---------------------------------------------------------------------------
+// Dedup
+// ---------------------------------------------------------------------------
+/**
+ * Check if a title is a duplicate of any existing knowledge entry.
+ * Uses normalized Levenshtein similarity from the curiosity dedup module.
+ */
+async function isDuplicateKnowledge(dataDir, title, category, threshold) {
+    let entries;
+    try {
+        entries = await listEntries(dataDir, category);
+    }
+    catch {
+        // Category doesn't exist yet — no duplicates possible
+        return { duplicate: false };
+    }
+    const normalizedTitle = title.toLowerCase().trim();
+    for (const entry of entries) {
+        const similarity = normalizedSimilarity(normalizedTitle, entry.title.toLowerCase().trim());
+        if (similarity > threshold) {
+            return { duplicate: true, existingSlug: entry.slug };
+        }
+    }
+    return { duplicate: false };
+}
+// ---------------------------------------------------------------------------
+// Pipeline
+// ---------------------------------------------------------------------------
+/**
+ * Run the full research pipeline for a single curiosity item.
+ *
+ * Steps:
+ * 1. Check budget (if checker provided)
+ * 2. Mark curiosity item as in_progress
+ * 3. Search for the question via search provider
+ * 4. Vet search results (filter low-quality)
+ * 5. Synthesize results via model provider
+ * 6. Duplicate detection against existing knowledge
+ * 7. Write knowledge entry + index metadata
+ * 8. Mark curiosity item as completed
+ */
+export async function runPipeline(curiosityItemId, question, options) {
+    const startTime = Date.now();
+    const { dataDir, searchProvider, modelProvider, checkBudget, charge, maxSearchResults = DEFAULT_MAX_RESULTS, minContentLength = DEFAULT_MIN_CONTENT_LENGTH, dedupThreshold = DEFAULT_DEDUP_THRESHOLD, } = options;
+    // --- Step 1: Budget check ---
+    if (checkBudget) {
+        const budget = checkBudget();
+        if (!budget.allowed) {
+            return {
+                curiosityItemId,
+                success: false,
+                action: "skipped_budget",
+                durationMs: Date.now() - startTime,
+            };
+        }
+    }
+    // --- Step 2: Mark in_progress ---
+    try {
+        markInProgress(curiosityItemId);
+    }
+    catch (err) {
+        return {
+            curiosityItemId,
+            success: false,
+            action: "failed",
+            error: `Failed to mark in_progress: ${err instanceof Error ? err.message : String(err)}`,
+            durationMs: Date.now() - startTime,
+        };
+    }
+    // --- Step 3: Search ---
+    let searchResults;
+    try {
+        searchResults = await searchProvider.search(question, maxSearchResults);
+        if (charge) {
+            charge("search", searchProvider.lastCallCostUsd());
+        }
+    }
+    catch (err) {
+        const errorMsg = `Search failed: ${err instanceof Error ? err.message : String(err)}`;
+        markFailed(curiosityItemId, errorMsg);
+        return {
+            curiosityItemId,
+            success: false,
+            action: "failed",
+            error: errorMsg,
+            durationMs: Date.now() - startTime,
+        };
+    }
+    // --- Step 4: Vet resources ---
+    const vettedResults = vetResults(searchResults, minContentLength);
+    if (vettedResults.length === 0) {
+        const errorMsg = "No search results passed vetting";
+        markFailed(curiosityItemId, errorMsg);
+        return {
+            curiosityItemId,
+            success: false,
+            action: "failed",
+            error: errorMsg,
+            durationMs: Date.now() - startTime,
+        };
+    }
+    // --- Step 5: Synthesize ---
+    let synthesis;
+    try {
+        synthesis = await modelProvider.synthesize(question, vettedResults);
+        if (charge) {
+            charge("synthesize", modelProvider.lastCallCostUsd());
+        }
+    }
+    catch (err) {
+        const errorMsg = `Synthesis failed: ${err instanceof Error ? err.message : String(err)}`;
+        markFailed(curiosityItemId, errorMsg);
+        return {
+            curiosityItemId,
+            success: false,
+            action: "failed",
+            error: errorMsg,
+            durationMs: Date.now() - startTime,
+        };
+    }
+    // --- Step 6: Categorize (use model's suggested category) ---
+    const category = synthesis.category;
+    // --- Step 7: Dedup check ---
+    try {
+        const dedup = await isDuplicateKnowledge(dataDir, synthesis.title, category, dedupThreshold);
+        if (dedup.duplicate) {
+            markCompleted(curiosityItemId);
+            return {
+                curiosityItemId,
+                success: true,
+                action: "skipped_duplicate",
+                knowledgeSlug: dedup.existingSlug,
+                knowledgeCategory: category,
+                durationMs: Date.now() - startTime,
+            };
+        }
+    }
+    catch {
+        // Dedup failure is non-fatal — proceed with creation
+    }
+    // --- Step 8: Write knowledge entry + index ---
+    let entrySlug;
+    try {
+        entrySlug = await writeEntry(dataDir, {
+            category,
+            title: synthesis.title,
+            content: synthesis.content,
+            tags: synthesis.tags,
+            source: synthesis.source,
+        });
+        // Index in metadata store
+        const entry = await readEntry(dataDir, category, entrySlug);
+        indexEntry(entry);
+        if (charge) {
+            charge("write", 0); // Writing is free
+        }
+    }
+    catch (err) {
+        const errorMsg = `Failed to write knowledge: ${err instanceof Error ? err.message : String(err)}`;
+        markFailed(curiosityItemId, errorMsg);
+        return {
+            curiosityItemId,
+            success: false,
+            action: "failed",
+            error: errorMsg,
+            durationMs: Date.now() - startTime,
+        };
+    }
+    // --- Step 9: Mark completed ---
+    try {
+        markCompleted(curiosityItemId);
+    }
+    catch {
+        // Non-fatal — knowledge was written successfully
+    }
+    return {
+        curiosityItemId,
+        success: true,
+        action: "created",
+        knowledgeSlug: entrySlug,
+        knowledgeCategory: category,
+        durationMs: Date.now() - startTime,
+    };
+}
+//# sourceMappingURL=index.js.map

package/dist/pipeline/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/pipeline/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AACnE,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EACL,cAAc,EACd,aAAa,EACb,UAAU,GACX,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAC7D,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAOzD,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAC9B,MAAM,0BAA0B,GAAG,EAAE,CAAC;AACtC,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAEpC,8EAA8E;AAC9E,6DAA6D;AAC7D,8EAA8E;AAE9E,iFAAiF;AACjF,SAAS,UAAU,CACjB,OAA0B,EAC1B,gBAAwB;IAExB,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC;QACpC,OAAO,IAAI,CAAC,MAAM,IAAI,gBAAgB,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC;AAED,8EAA8E;AAC9E,QAAQ;AACR,8EAA8E;AAE9E;;;GAGG;AACH,KAAK,UAAU,oBAAoB,CACjC,OAAe,EACf,KAAa,EACb,QAAgB,EAChB,SAAiB;IAEjB,IAAI,OAAyB,CAAC;IAC9B,IAAI,CAAC;QACH,OAAO,GAAG,MAAM,WAAW,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IACjD,CAAC;IAAC,MAAM,CAAC;QACP,sDAAsD;QACtD,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAC9B,CAAC;IAED,MAAM,eAAe,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IACnD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,oBAAoB,CACrC,eAAe,EACf,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CACjC,CAAC;QACF,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;YAC3B,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC;QACvD,CAAC;IACH,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;AAC9B,CAAC;AAED,8EAA8E;AAC9E,WAAW;AACX,8EAA8E;AAE9E;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,eAAuB,EACvB,QAAgB,EAChB,OAAwB;IAExB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,EACJ,OAAO,EACP,cAAc,EACd,aAAa,EACb,WAAW,EACX,MAAM,EACN,gBAAgB,GAAG,mBAAmB,EACtC,gBAAgB,GAAG,0BAA0B,EAC7C,cAAc,GAAG,uBAAuB,GACzC,GAAG,OAAO,CAAC;IAEZ,+BAA+B;IAC/B,IAAI,WAAW,EAAE,CAAC;QAChB,MAAM,MAAM,GAAG,WAAW,EAAE,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,OAAO;gBACL,eAAe;gBACf,OAAO,EAAE,KAAK;gBACd,MAAM,EAAE,gBAAgB;gBACxB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;aACnC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,mCAAmC;IACnC,IAAI,CAAC;QACH,cAAc,CAAC,eAAe,CAAC,CAAC;IAClC,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO;YACL,eAAe;YACf,OAAO,EAAE,KAAK;YACd,MAAM,EAAE,QAAQ;YAChB,KAAK,EAAE,+BAA+B,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;YACxF,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACnC,CAAC;IACJ,CAAC;IAED,yBAAyB;IACzB,IAAI,aAAgC,CAAC;IACrC,IAAI,CAAC;QACH,aAAa,GAAG,MAAM,cAAc,CAAC,MAAM,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;QACxE,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,QAAQ,EAAE,cAAc,CAAC,eAAe,EAAE,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,QAAQ,GAAG,kBAAkB,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;QACtF,UAAU,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC;QACtC,OAAO;YACL,eAAe;YACf,OAAO,EAAE,KAAK;YACd,MAAM,EAAE,QAAQ;YAChB,KAAK,EAAE,QAAQ;YACf,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACnC,CAAC;IACJ,CAAC;IAED,gCAAgC;IAChC,MAAM,aAAa,GAAG,UAAU,CAAC,aAAa,EAAE,gBAAgB,CAAC,CAAC;IAClE,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,kCAAkC,CAAC;QACpD,UAAU,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC;QACtC,OAAO;YACL,eAAe;YACf,OAAO,EAAE,KAAK;YACd,MAAM,EAAE,QAAQ;YAChB,KAAK,EAAE,QAAQ;YACf,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACnC,CAAC;IACJ,CAAC;IAED,6BAA6B;IAC7B,IAAI,SAAS,CAAC;IACd,IAAI,CAAC;QACH,SAAS,GAAG,MAAM,aAAa,CAAC,UAAU,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;QACpE,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,YAAY,EAAE,aAAa,CAAC,eAAe,EAAE,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,QAAQ,GAAG,qBAAqB,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;QACzF,UAAU,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC;QACtC,OAAO;YACL,eAAe;YACf,OAAO,EAAE,KAAK;YACd,MAAM,EAAE,QAAQ;YAChB,KAAK,EAAE,QAAQ;YACf,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACnC,CAAC;IACJ,CAAC;IAED,8DAA8D;IAC9D,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;IAEpC,8BAA8B;IAC9B,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,oBAAoB,CACtC,OAAO,EACP,SAAS,CAAC,KAAK,EACf,QAAQ,EACR,cAAc,CACf,CAAC;QACF,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACpB,aAAa,CAAC,eAAe,CAAC,CAAC;YAC/B,OAAO;gBACL,eAAe;gBACf,OAAO,EAAE,IAAI;gBACb,MAAM,EAAE,mBAAmB;gBAC3B,aAAa,EAAE,KAAK,CAAC,YAAY;gBACjC,iBAAiB,EAAE,QAAQ;gBAC3B,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;aACnC,CAAC;QACJ,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,qDAAqD;IACvD,CAAC;IAED,gDAAgD;IAChD,IAAI,SAAiB,CAAC;IACtB,IAAI,CAAC;QACH,SAAS,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE;YACpC,QAAQ;YACR,KAAK,EAAE,SAAS,CAAC,KAAK;YACtB,OAAO,EAAE,SAAS,CAAC,OAAO;YAC1B,IAAI,EAAE,SAAS,CAAC,IAAI;YACpB,MAAM,EAAE,SAAS,CAAC,MAAM;SACzB,CAAC,CAAC;QAEH,0BAA0B;QAC1B,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,OAAO,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC5D,UAAU,CAAC,KAAK,CAAC,CAAC;QAElB,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB;QACxC,CAAC;IACH,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,QAAQ,GAAG,8BAA8B,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;QAClG,UAAU,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC;QACtC,OAAO;YACL,eAAe;YACf,OAAO,EAAE,KAAK;YACd,MAAM,EAAE,QAAQ;YAChB,KAAK,EAAE,QAAQ;YACf,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACnC,CAAC;IACJ,CAAC;IAED,iCAAiC;IACjC,IAAI,CAAC;QACH,aAAa,CAAC,eAAe,CAAC,CAAC;IACjC,CAAC;IAAC,MAAM,CAAC;QACP,iDAAiD;IACnD,CAAC;IAED,OAAO;QACL,eAAe;QACf,OAAO,EAAE,IAAI;QACb,MAAM,EAAE,SAAS;QACjB,aAAa,EAAE,SAAS;QACxB,iBAAiB,EAAE,QAAQ;QAC3B,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;KACnC,CAAC;AACJ,CAAC"}

package/dist/pipeline/types.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Pipeline type definitions — research pipeline connecting curiosity to knowledge.
+ */
+import type { SearchProvider, ModelProvider } from "../providers/types.js";
+/** Possible outcomes of a pipeline run. */
+export type PipelineAction = "created" | "updated" | "skipped_duplicate" | "skipped_budget" | "failed";
+/** Result returned by runPipeline. */
+export interface PipelineResult {
+    curiosityItemId: number;
+    success: boolean;
+    action: PipelineAction;
+    knowledgeSlug?: string;
+    knowledgeCategory?: string;
+    error?: string;
+    durationMs: number;
+}
+/** Budget checker — returns whether execution is allowed and remaining funds. */
+export interface BudgetCheck {
+    allowed: boolean;
+    remainingUsd: number;
+}
+/** Options bag for runPipeline. */
+export interface PipelineOptions {
+    /** Root directory for the knowledge tree. */
+    dataDir: string;
+    /** Search provider instance. */
+    searchProvider: SearchProvider;
+    /** Model provider instance. */
+    modelProvider: ModelProvider;
+    /** Optional budget check — called before execution starts. */
+    checkBudget?: () => BudgetCheck;
+    /** Optional charge function — called after each billable step. */
+    charge?: (type: string, costUsd: number) => void;
+    /** Maximum search results to fetch (default: 5). */
+    maxSearchResults?: number;
+    /** Minimum content length (chars) to consider a search result meaningful (default: 20). */
+    minContentLength?: number;
+    /** Levenshtein similarity threshold for duplicate detection (default: 0.8). */
+    dedupThreshold?: number;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/pipeline/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/pipeline/types.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAM3E,2CAA2C;AAC3C,MAAM,MAAM,cAAc,GACtB,SAAS,GACT,SAAS,GACT,mBAAmB,GACnB,gBAAgB,GAChB,QAAQ,CAAC;AAEb,sCAAsC;AACtC,MAAM,WAAW,cAAc;IAC7B,eAAe,EAAE,MAAM,CAAC;IACxB,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,cAAc,CAAC;IACvB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;CACpB;AAMD,iFAAiF;AACjF,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,OAAO,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,mCAAmC;AACnC,MAAM,WAAW,eAAe;IAC9B,6CAA6C;IAC7C,OAAO,EAAE,MAAM,CAAC;IAEhB,gCAAgC;IAChC,cAAc,EAAE,cAAc,CAAC;IAE/B,+BAA+B;IAC/B,aAAa,EAAE,aAAa,CAAC;IAE7B,8DAA8D;IAC9D,WAAW,CAAC,EAAE,MAAM,WAAW,CAAC;IAEhC,kEAAkE;IAClE,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,KAAK,IAAI,CAAC;IAEjD,oDAAoD;IACpD,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAE1B,2FAA2F;IAC3F,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAE1B,+EAA+E;IAC/E,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB"}

package/dist/pipeline/types.js

@@ -0,0 +1,5 @@
+/**
+ * Pipeline type definitions — research pipeline connecting curiosity to knowledge.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/pipeline/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/pipeline/types.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/providers/__tests__/providers.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=providers.test.d.ts.map

package/dist/providers/__tests__/providers.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"providers.test.d.ts","sourceRoot":"","sources":["../../../src/providers/__tests__/providers.test.ts"],"names":[],"mappings":""}