@grackle-ai/knowledge-core 0.63.0

package/dist/node-store.js

@@ -0,0 +1,268 @@
+/**
+ * Node CRUD operations for the knowledge graph.
+ *
+ * Provides create, read, update, and delete operations for both
+ * {@link ReferenceNode} and {@link NativeNode} types, backed by Neo4j.
+ *
+ * @module
+ */
+import { randomUUID } from "node:crypto";
+import { getSession } from "./client.js";
+import { logger } from "./logger.js";
+import { NODE_LABEL } from "./constants.js";
+import { NODE_KIND, } from "./types.js";
+// ---------------------------------------------------------------------------
+// Cypher queries
+// ---------------------------------------------------------------------------
+const GET_NODE_WITH_EDGES_CYPHER = `
+  MATCH (n:${NODE_LABEL} {id: $id})
+  OPTIONAL MATCH (n)-[r]-(m:${NODE_LABEL})
+  WITH n, r, m
+  WHERE r IS NOT NULL
+  RETURN n,
+    collect({
+      fromId: CASE WHEN startNode(r) = n THEN n.id ELSE m.id END,
+      toId: CASE WHEN endNode(r) = n THEN n.id ELSE m.id END,
+      type: type(r),
+      metadata: r.metadata,
+      createdAt: r.createdAt
+    }) AS edges
+  UNION ALL
+  MATCH (n:${NODE_LABEL} {id: $id})
+  WHERE NOT (n)-[]-()
+  RETURN n, [] AS edges`;
+const DELETE_NODE_CYPHER = `
+  MATCH (n:${NODE_LABEL} {id: $id})
+  DETACH DELETE n
+  RETURN count(n) AS deleted`;
+const UPDATE_NODE_CYPHER = `
+  MATCH (n:${NODE_LABEL} {id: $id})
+  SET n += $updates
+  RETURN n`;
+// ---------------------------------------------------------------------------
+// Helpers
+// ---------------------------------------------------------------------------
+/**
+ * Convert Neo4j node properties to a typed {@link KnowledgeNode}.
+ *
+ * Handles the discriminated union based on the `kind` property.
+ */
+export function recordToNode(properties) {
+    const base = {
+        id: properties.id,
+        kind: properties.kind,
+        embedding: properties.embedding ?? [],
+        createdAt: properties.createdAt,
+        updatedAt: properties.updatedAt,
+        workspaceId: properties.workspaceId ?? "",
+    };
+    if (base.kind === NODE_KIND.REFERENCE) {
+        return {
+            ...base,
+            kind: NODE_KIND.REFERENCE,
+            sourceType: properties.sourceType,
+            sourceId: properties.sourceId,
+            label: properties.label ?? "",
+        };
+    }
+    return {
+        ...base,
+        kind: NODE_KIND.NATIVE,
+        category: properties.category,
+        title: properties.title ?? "",
+        content: properties.content ?? "",
+        tags: properties.tags ?? [],
+    };
+}
+/**
+ * Convert a raw edge object from Cypher `collect()` to a {@link KnowledgeEdge}.
+ *
+ * @internal Exported for use by search and expand modules within this package.
+ */
+export function recordToEdge(raw) {
+    let metadata;
+    if (raw.metadata !== undefined && raw.metadata !== null) {
+        try {
+            metadata = JSON.parse(raw.metadata);
+        }
+        catch {
+            metadata = undefined;
+        }
+    }
+    return {
+        fromId: raw.fromId,
+        toId: raw.toId,
+        type: raw.type,
+        metadata,
+        createdAt: raw.createdAt,
+    };
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Create a reference node in the knowledge graph.
+ *
+ * Generates a UUID and timestamps automatically.
+ *
+ * @returns The ID of the created node.
+ */
+export async function createReferenceNode(input) {
+    const id = randomUUID();
+    const now = new Date().toISOString();
+    const props = {
+        id,
+        kind: NODE_KIND.REFERENCE,
+        sourceType: input.sourceType,
+        sourceId: input.sourceId,
+        label: input.label,
+        embedding: input.embedding,
+        workspaceId: input.workspaceId,
+        createdAt: now,
+        updatedAt: now,
+    };
+    const session = getSession();
+    try {
+        await session.run(`CREATE (n:${NODE_LABEL} $props) RETURN n`, { props });
+        logger.debug({ nodeId: id, kind: NODE_KIND.REFERENCE }, "Created reference node");
+        return id;
+    }
+    finally {
+        try {
+            await session.close();
+        }
+        catch (closeError) {
+            logger.warn({ err: closeError }, "Failed to close session after createReferenceNode");
+        }
+    }
+}
+/**
+ * Create a native node in the knowledge graph.
+ *
+ * Generates a UUID and timestamps automatically.
+ *
+ * @returns The ID of the created node.
+ */
+export async function createNativeNode(input) {
+    const id = randomUUID();
+    const now = new Date().toISOString();
+    const props = {
+        id,
+        kind: NODE_KIND.NATIVE,
+        category: input.category,
+        title: input.title,
+        content: input.content,
+        tags: input.tags,
+        embedding: input.embedding,
+        workspaceId: input.workspaceId,
+        createdAt: now,
+        updatedAt: now,
+    };
+    const session = getSession();
+    try {
+        await session.run(`CREATE (n:${NODE_LABEL} $props) RETURN n`, { props });
+        logger.debug({ nodeId: id, kind: NODE_KIND.NATIVE }, "Created native node");
+        return id;
+    }
+    finally {
+        try {
+            await session.close();
+        }
+        catch (closeError) {
+            logger.warn({ err: closeError }, "Failed to close session after createNativeNode");
+        }
+    }
+}
+/**
+ * Get a node by ID, including all its edges.
+ *
+ * @returns The node and its edges, or `undefined` if the node was not found.
+ */
+export async function getNode(id) {
+    const session = getSession();
+    try {
+        const result = await session.run(GET_NODE_WITH_EDGES_CYPHER, { id });
+        if (result.records.length === 0) {
+            return undefined;
+        }
+        const record = result.records[0];
+        const neo4jNode = record.get("n");
+        const rawEdges = record.get("edges");
+        const node = recordToNode(neo4jNode.properties);
+        const edges = rawEdges.map(recordToEdge);
+        return { node, edges };
+    }
+    finally {
+        try {
+            await session.close();
+        }
+        catch (closeError) {
+            logger.warn({ err: closeError }, "Failed to close session after getNode");
+        }
+    }
+}
+/**
+ * Delete a node and all its edges (`DETACH DELETE`).
+ *
+ * @returns `true` if a node was deleted, `false` if the node was not found.
+ */
+export async function deleteNode(id) {
+    const session = getSession();
+    try {
+        const result = await session.run(DELETE_NODE_CYPHER, { id });
+        const deleted = result.records[0]?.get("deleted");
+        if (deleted > 0) {
+            logger.debug({ nodeId: id }, "Deleted node");
+        }
+        return deleted > 0;
+    }
+    finally {
+        try {
+            await session.close();
+        }
+        catch (closeError) {
+            logger.warn({ err: closeError }, "Failed to close session after deleteNode");
+        }
+    }
+}
+/**
+ * Update a node's mutable properties.
+ *
+ * Cannot change `kind`, `id`, `createdAt`, or `workspaceId`.
+ * Automatically updates the `updatedAt` timestamp.
+ *
+ * @returns The updated node, or `undefined` if the node was not found.
+ */
+export async function updateNode(id, updates) {
+    // Strip immutable fields defensively.
+    const { ...mutableUpdates } = updates;
+    const forbidden = ["kind", "id", "createdAt", "workspaceId"];
+    for (const key of forbidden) {
+        delete mutableUpdates[key];
+    }
+    const patchedUpdates = {
+        ...mutableUpdates,
+        updatedAt: new Date().toISOString(),
+    };
+    const session = getSession();
+    try {
+        const result = await session.run(UPDATE_NODE_CYPHER, {
+            id,
+            updates: patchedUpdates,
+        });
+        if (result.records.length === 0) {
+            return undefined;
+        }
+        const neo4jNode = result.records[0].get("n");
+        return recordToNode(neo4jNode.properties);
+    }
+    finally {
+        try {
+            await session.close();
+        }
+        catch (closeError) {
+            logger.warn({ err: closeError }, "Failed to close session after updateNode");
+        }
+    }
+}
+//# sourceMappingURL=node-store.js.map

package/dist/node-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"node-store.js","sourceRoot":"","sources":["../src/node-store.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EACL,SAAS,GAOV,MAAM,YAAY,CAAC;AAqEpB,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E,MAAM,0BAA0B,GAAW;aAC9B,UAAU;8BACO,UAAU;;;;;;;;;;;;aAY3B,UAAU;;wBAEC,CAAC;AAEzB,MAAM,kBAAkB,GAAW;aACtB,UAAU;;6BAEM,CAAC;AAE9B,MAAM,kBAAkB,GAAW;aACtB,UAAU;;WAEZ,CAAC;AAEZ,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAC1B,UAAmC;IAEnC,MAAM,IAAI,GAAG;QACX,EAAE,EAAE,UAAU,CAAC,EAAY;QAC3B,IAAI,EAAE,UAAU,CAAC,IAAgB;QACjC,SAAS,EAAG,UAAU,CAAC,SAAkC,IAAI,EAAE;QAC/D,SAAS,EAAE,UAAU,CAAC,SAAmB;QACzC,SAAS,EAAE,UAAU,CAAC,SAAmB;QACzC,WAAW,EAAG,UAAU,CAAC,WAAkC,IAAI,EAAE;KAClE,CAAC;IAEF,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,SAAS,EAAE,CAAC;QACtC,OAAO;YACL,GAAG,IAAI;YACP,IAAI,EAAE,SAAS,CAAC,SAAS;YACzB,UAAU,EAAE,UAAU,CAAC,UAA6B;YACpD,QAAQ,EAAE,UAAU,CAAC,QAAkB;YACvC,KAAK,EAAG,UAAU,CAAC,KAA4B,IAAI,EAAE;SACtD,CAAC;IACJ,CAAC;IAED,OAAO;QACL,GAAG,IAAI;QACP,IAAI,EAAE,SAAS,CAAC,MAAM;QACtB,QAAQ,EAAE,UAAU,CAAC,QAA0B;QAC/C,KAAK,EAAG,UAAU,CAAC,KAA4B,IAAI,EAAE;QACrD,OAAO,EAAG,UAAU,CAAC,OAA8B,IAAI,EAAE;QACzD,IAAI,EAAG,UAAU,CAAC,IAA6B,IAAI,EAAE;KACtD,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,GAA4B;IACvD,IAAI,QAA6C,CAAC;IAClD,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;QACxD,IAAI,CAAC;YACH,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAkB,CAA4B,CAAC;QAC3E,CAAC;QAAC,MAAM,CAAC;YACP,QAAQ,GAAG,SAAS,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM,EAAE,GAAG,CAAC,MAAgB;QAC5B,IAAI,EAAE,GAAG,CAAC,IAAc;QACxB,IAAI,EAAE,GAAG,CAAC,IAAgB;QAC1B,QAAQ;QACR,SAAS,EAAE,GAAG,CAAC,SAAmB;KACnC,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,KAA+B;IAE/B,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;IACxB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,KAAK,GAAG;QACZ,EAAE;QACF,IAAI,EAAE,SAAS,CAAC,SAAS;QACzB,UAAU,EAAE,KAAK,CAAC,UAAU;QAC5B,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,SAAS,EAAE,GAAG;QACd,SAAS,EAAE,GAAG;KACf,CAAC;IAEF,MAAM,OAAO,GAAG,UAAU,EAAE,CAAC;IAC7B,IAAI,CAAC;QACH,MAAM,OAAO,CAAC,GAAG,CAAC,aAAa,UAAU,mBAAmB,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QACzE,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,SAAS,EAAE,EAAE,wBAAwB,CAAC,CAAC;QAClF,OAAO,EAAE,CAAC;IACZ,CAAC;YAAS,CAAC;QACT,IAAI,CAAC;YACH,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;QAAC,OAAO,UAAU,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,mDAAmD,CAAC,CAAC;QACxF,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,KAA4B;IAE5B,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;IACxB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,KAAK,GAAG;QACZ,EAAE;QACF,IAAI,EAAE,SAAS,CAAC,MAAM;QACtB,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,SAAS,EAAE,GAAG;QACd,SAAS,EAAE,GAAG;KACf,CAAC;IAEF,MAAM,OAAO,GAAG,UAAU,EAAE,CAAC;IAC7B,IAAI,CAAC;QACH,MAAM,OAAO,CAAC,GAAG,CAAC,aAAa,UAAU,mBAAmB,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QACzE,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,MAAM,EAAE,EAAE,qBAAqB,CAAC,CAAC;QAC5E,OAAO,EAAE,CAAC;IACZ,CAAC;YAAS,CAAC;QACT,IAAI,CAAC;YACH,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;QAAC,OAAO,UAAU,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,gDAAgD,CAAC,CAAC;QACrF,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,OAAO,CAAC,EAAU;IACtC,MAAM,OAAO,GAAG,UAAU,EAAE,CAAC;IAC7B,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,0BAA0B,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAErE,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAA4C,CAAC;QAC7E,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAA8B,CAAC;QAElE,MAAM,IAAI,GAAG,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAEzC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACzB,CAAC;YAAS,CAAC;QACT,IAAI,CAAC;YACH,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;QAAC,OAAO,UAAU,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,uCAAuC,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,EAAU;IACzC,MAAM,OAAO,GAAG,UAAU,EAAE,CAAC;IAC7B,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,kBAAkB,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7D,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,SAAS,CAAW,CAAC;QAC5D,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YAChB,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,cAAc,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,OAAO,GAAG,CAAC,CAAC;IACrB,CAAC;YAAS,CAAC;QACT,IAAI,CAAC;YACH,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;QAAC,OAAO,UAAU,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,0CAA0C,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,EAAU,EACV,OAAwB;IAExB,sCAAsC;IACtC,MAAM,EAAE,GAAG,cAAc,EAAE,GAAG,OAAO,CAAC;IACtC,MAAM,SAAS,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,aAAa,CAAU,CAAC;IACtE,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,OAAQ,cAA0C,CAAC,GAAG,CAAC,CAAC;IAC1D,CAAC;IAED,MAAM,cAAc,GAAG;QACrB,GAAG,cAAc;QACjB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACpC,CAAC;IAEF,MAAM,OAAO,GAAG,UAAU,EAAE,CAAC;IAC7B,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,kBAAkB,EAAE;YACnD,EAAE;YACF,OAAO,EAAE,cAAc;SACxB,CAAC,CAAC;QAEH,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAE1C,CAAC;QACF,OAAO,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IAC5C,CAAC;YAAS,CAAC;QACT,IAAI,CAAC;YACH,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;QAAC,OAAO,UAAU,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,0CAA0C,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/pass-through-chunker.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Pass-through chunker that returns the entire input as a single chunk.
+ *
+ * Suitable for short content such as findings, decisions, and insights
+ * that do not need to be split before embedding.
+ *
+ * @module
+ */
+import type { Chunker } from "./chunker.js";
+/**
+ * Create a chunker that returns the input as a single chunk unchanged.
+ *
+ * @returns A {@link Chunker} that produces exactly one chunk per input.
+ */
+export declare function createPassThroughChunker(): Chunker;
+//# sourceMappingURL=pass-through-chunker.d.ts.map

package/dist/pass-through-chunker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pass-through-chunker.d.ts","sourceRoot":"","sources":["../src/pass-through-chunker.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAS,MAAM,cAAc,CAAC;AAEnD;;;;GAIG;AACH,wBAAgB,wBAAwB,IAAI,OAAO,CAMlD"}

package/dist/pass-through-chunker.js

@@ -0,0 +1,21 @@
+/**
+ * Pass-through chunker that returns the entire input as a single chunk.
+ *
+ * Suitable for short content such as findings, decisions, and insights
+ * that do not need to be split before embedding.
+ *
+ * @module
+ */
+/**
+ * Create a chunker that returns the input as a single chunk unchanged.
+ *
+ * @returns A {@link Chunker} that produces exactly one chunk per input.
+ */
+export function createPassThroughChunker() {
+    return {
+        chunk(content, metadata) {
+            return [{ text: content, index: 0, metadata }];
+        },
+    };
+}
+//# sourceMappingURL=pass-through-chunker.js.map

package/dist/pass-through-chunker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pass-through-chunker.js","sourceRoot":"","sources":["../src/pass-through-chunker.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH;;;;GAIG;AACH,MAAM,UAAU,wBAAwB;IACtC,OAAO;QACL,KAAK,CAAC,OAAe,EAAE,QAAkC;YACvD,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC;QACjD,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/schema.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Neo4j schema initialization — constraints, indexes, and vector index.
+ *
+ * All statements use `IF NOT EXISTS` for idempotency and are safe to run
+ * on every application startup.
+ *
+ * @module
+ */
+/**
+ * Cypher statements for schema initialization.
+ *
+ * Exported so tests can verify the exact statements that will be executed.
+ */
+export declare const SCHEMA_STATEMENTS: Record<string, string>;
+/**
+ * Initialize the Neo4j schema: constraints, property indexes, and the
+ * vector index.
+ *
+ * All statements are idempotent (`IF NOT EXISTS`). Call once at startup
+ * after {@link openNeo4j}.
+ */
+export declare function initSchema(): Promise<void>;
+//# sourceMappingURL=schema.d.ts.map

package/dist/schema.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAWH;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CA4BpD,CAAC;AAEF;;;;;;GAMG;AACH,wBAAsB,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC,CAuBhD"}

package/dist/schema.js

@@ -0,0 +1,73 @@
+/**
+ * Neo4j schema initialization — constraints, indexes, and vector index.
+ *
+ * All statements use `IF NOT EXISTS` for idempotency and are safe to run
+ * on every application startup.
+ *
+ * @module
+ */
+import { getSession } from "./client.js";
+import { logger } from "./logger.js";
+import { NODE_LABEL, VECTOR_INDEX_NAME, EMBEDDING_DIMENSIONS, VECTOR_SIMILARITY_FUNCTION, } from "./constants.js";
+/**
+ * Cypher statements for schema initialization.
+ *
+ * Exported so tests can verify the exact statements that will be executed.
+ */
+export const SCHEMA_STATEMENTS = {
+    /** Uniqueness constraint on node ID. */
+    UNIQUE_NODE_ID: `CREATE CONSTRAINT knowledge_node_id_unique IF NOT EXISTS
+    FOR (n:${NODE_LABEL}) REQUIRE n.id IS UNIQUE`,
+    /** Index on the kind property for efficient filtering. */
+    INDEX_KIND: `CREATE INDEX knowledge_node_kind IF NOT EXISTS
+    FOR (n:${NODE_LABEL}) ON (n.kind)`,
+    /** Index on workspaceId for scoped queries. */
+    INDEX_WORKSPACE: `CREATE INDEX knowledge_node_workspace IF NOT EXISTS
+    FOR (n:${NODE_LABEL}) ON (n.workspaceId)`,
+    /** Composite index for reference node lookups by source. */
+    INDEX_SOURCE: `CREATE INDEX knowledge_node_source IF NOT EXISTS
+    FOR (n:${NODE_LABEL}) ON (n.sourceType, n.sourceId)`,
+    /** Vector index for embedding similarity search. */
+    VECTOR_INDEX: [
+        `CREATE VECTOR INDEX ${VECTOR_INDEX_NAME} IF NOT EXISTS`,
+        `FOR (n:${NODE_LABEL}) ON (n.embedding)`,
+        `OPTIONS {`,
+        `  indexConfig: {`,
+        `    \`vector.dimensions\`: ${EMBEDDING_DIMENSIONS},`,
+        `    \`vector.similarity_function\`: '${VECTOR_SIMILARITY_FUNCTION}'`,
+        `  }`,
+        `}`,
+    ].join("\n"),
+};
+/**
+ * Initialize the Neo4j schema: constraints, property indexes, and the
+ * vector index.
+ *
+ * All statements are idempotent (`IF NOT EXISTS`). Call once at startup
+ * after {@link openNeo4j}.
+ */
+export async function initSchema() {
+    const session = getSession();
+    try {
+        for (const [name, cypher] of Object.entries(SCHEMA_STATEMENTS)) {
+            logger.debug({ statement: name }, "Running schema statement");
+            try {
+                await session.run(cypher);
+            }
+            catch (error) {
+                logger.error({ err: error, statement: name }, "Schema statement failed");
+                throw new Error(`Schema statement "${name}" failed: ${error instanceof Error ? error.message : String(error)}`, { cause: error });
+            }
+        }
+        logger.info("Knowledge graph schema initialized");
+    }
+    finally {
+        try {
+            await session.close();
+        }
+        catch (closeError) {
+            logger.warn({ err: closeError }, "Failed to close Neo4j session after schema initialization");
+        }
+    }
+}
+//# sourceMappingURL=schema.js.map

package/dist/schema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema.js","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EACL,UAAU,EACV,iBAAiB,EACjB,oBAAoB,EACpB,0BAA0B,GAC3B,MAAM,gBAAgB,CAAC;AAExB;;;;GAIG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAA2B;IACvD,wCAAwC;IACxC,cAAc,EAAE;aACL,UAAU,0BAA0B;IAE/C,0DAA0D;IAC1D,UAAU,EAAE;aACD,UAAU,eAAe;IAEpC,+CAA+C;IAC/C,eAAe,EAAE;aACN,UAAU,sBAAsB;IAE3C,4DAA4D;IAC5D,YAAY,EAAE;aACH,UAAU,iCAAiC;IAEtD,oDAAoD;IACpD,YAAY,EAAE;QACZ,uBAAuB,iBAAiB,gBAAgB;QACxD,UAAU,UAAU,oBAAoB;QACxC,WAAW;QACX,kBAAkB;QAClB,8BAA8B,oBAAoB,GAAG;QACrD,wCAAwC,0BAA0B,GAAG;QACrE,KAAK;QACL,GAAG;KACJ,CAAC,IAAI,CAAC,IAAI,CAAC;CACb,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU;IAC9B,MAAM,OAAO,GAAG,UAAU,EAAE,CAAC;IAC7B,IAAI,CAAC;QACH,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,iBAAiB,CAAC,EAAE,CAAC;YAC/D,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,0BAA0B,CAAC,CAAC;YAC9D,IAAI,CAAC;gBACH,MAAM,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,yBAAyB,CAAC,CAAC;gBACzE,MAAM,IAAI,KAAK,CACb,qBAAqB,IAAI,aAAa,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAC9F,EAAE,KAAK,EAAE,KAAK,EAAE,CACjB,CAAC;YACJ,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC;IACpD,CAAC;YAAS,CAAC;QACT,IAAI,CAAC;YACH,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;QAAC,OAAO,UAAU,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,2DAA2D,CAAC,CAAC;QAChG,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/search.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Vector-based semantic search across the knowledge graph.
+ *
+ * Embeds a text query, runs k-NN vector search against Neo4j's vector index,
+ * and returns ranked results with similarity scores and immediate edges.
+ *
+ * @module
+ */
+import type { Embedder } from "./embedder.js";
+import type { KnowledgeNode, KnowledgeEdge, NodeKind } from "./types.js";
+/** Options for knowledge graph search. */
+export interface SearchOptions {
+    /** Max results to return (default 10). */
+    limit?: number;
+    /** Filter to specific node kinds (reference, native, or both). */
+    nodeKinds?: NodeKind[];
+    /** Minimum similarity score threshold (default 0). Passed directly to the Cypher WHERE clause. */
+    minScore?: number;
+    /** Filter to a specific workspace. */
+    workspaceId?: string;
+}
+/** A search result: a node with its similarity score and immediate edges. */
+export interface SearchResult {
+    /** The matched node. */
+    node: KnowledgeNode;
+    /** Cosine similarity score (0-1). */
+    score: number;
+    /** Edges connected to this node. */
+    edges: KnowledgeEdge[];
+}
+/**
+ * Search the knowledge graph by semantic similarity.
+ *
+ * Embeds the query text, runs k-NN vector search in Neo4j, and returns
+ * ranked results with similarity scores and immediate edges.
+ *
+ * @param query - The text to search for.
+ * @param embedder - Produces the query embedding vector.
+ * @param options - Optional search filters and limits.
+ * @returns Ranked search results, highest similarity first.
+ */
+export declare function knowledgeSearch(query: string, embedder: Embedder, options?: SearchOptions): Promise<SearchResult[]>;
+//# sourceMappingURL=search.d.ts.map

package/dist/search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../src/search.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAOH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAMzE,0CAA0C;AAC1C,MAAM,WAAW,aAAa;IAC5B,0CAA0C;IAC1C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,kEAAkE;IAClE,SAAS,CAAC,EAAE,QAAQ,EAAE,CAAC;IACvB,kGAAkG;IAClG,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,sCAAsC;IACtC,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,6EAA6E;AAC7E,MAAM,WAAW,YAAY;IAC3B,wBAAwB;IACxB,IAAI,EAAE,aAAa,CAAC;IACpB,qCAAqC;IACrC,KAAK,EAAE,MAAM,CAAC;IACd,oCAAoC;IACpC,KAAK,EAAE,aAAa,EAAE,CAAC;CACxB;AAgED;;;;;;;;;;GAUG;AACH,wBAAsB,eAAe,CACnC,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,QAAQ,EAClB,OAAO,CAAC,EAAE,aAAa,GACtB,OAAO,CAAC,YAAY,EAAE,CAAC,CA8DzB"}

package/dist/search.js

@@ -0,0 +1,123 @@
+/**
+ * Vector-based semantic search across the knowledge graph.
+ *
+ * Embeds a text query, runs k-NN vector search against Neo4j's vector index,
+ * and returns ranked results with similarity scores and immediate edges.
+ *
+ * @module
+ */
+import { getSession } from "./client.js";
+import { logger } from "./logger.js";
+import { NODE_LABEL, VECTOR_INDEX_NAME } from "./constants.js";
+import { recordToNode, recordToEdge } from "./node-store.js";
+// ---------------------------------------------------------------------------
+// Constants
+// ---------------------------------------------------------------------------
+/** Default number of results to return. */
+const DEFAULT_LIMIT = 10;
+/** Default minimum similarity score. */
+const DEFAULT_MIN_SCORE = 0;
+// ---------------------------------------------------------------------------
+// Cypher
+// ---------------------------------------------------------------------------
+/**
+ * Build the Cypher query for vector search with optional filters.
+ *
+ * Neo4j's `db.index.vector.queryNodes` does not support WHERE clauses
+ * directly, so we apply post-filters on the yielded results.
+ */
+function buildSearchCypher(options) {
+    const filters = ["score >= $minScore"];
+    if (options.nodeKinds && options.nodeKinds.length > 0) {
+        filters.push("node.kind IN $nodeKinds");
+    }
+    if (options.workspaceId !== undefined) {
+        filters.push("node.workspaceId = $workspaceId");
+    }
+    const whereClause = filters.length > 0
+        ? `WHERE ${filters.join(" AND ")}`
+        : "";
+    // Neo4j requires integer literals for LIMIT and the vector query count.
+    return `
+    CALL db.index.vector.queryNodes($indexName, ${options.candidateLimit}, $queryVector)
+    YIELD node, score
+    ${whereClause}
+    WITH node, score
+    ORDER BY score DESC
+    LIMIT ${options.limit}
+    OPTIONAL MATCH (node)-[r]-(m:${NODE_LABEL})
+    RETURN node, score,
+      collect(DISTINCT {
+        fromId: CASE WHEN startNode(r) = node THEN node.id ELSE m.id END,
+        toId: CASE WHEN endNode(r) = node THEN node.id ELSE m.id END,
+        type: type(r),
+        metadata: r.metadata,
+        createdAt: r.createdAt
+      }) AS edges`;
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Search the knowledge graph by semantic similarity.
+ *
+ * Embeds the query text, runs k-NN vector search in Neo4j, and returns
+ * ranked results with similarity scores and immediate edges.
+ *
+ * @param query - The text to search for.
+ * @param embedder - Produces the query embedding vector.
+ * @param options - Optional search filters and limits.
+ * @returns Ranked search results, highest similarity first.
+ */
+export async function knowledgeSearch(query, embedder, options) {
+    const limit = options?.limit ?? DEFAULT_LIMIT;
+    const minScore = options?.minScore ?? DEFAULT_MIN_SCORE;
+    // Embed the query
+    const { vector: queryVector } = await embedder.embed(query);
+    // Over-fetch when filtering so we still get enough results after post-filter
+    const hasFilters = !!(options?.nodeKinds?.length || options?.workspaceId !== undefined);
+    const candidateLimit = hasFilters ? limit * 3 : limit;
+    const cypher = buildSearchCypher({
+        limit,
+        candidateLimit,
+        nodeKinds: options?.nodeKinds,
+        workspaceId: options?.workspaceId,
+    });
+    const params = {
+        indexName: VECTOR_INDEX_NAME,
+        queryVector,
+        minScore,
+        ...(options?.nodeKinds ? { nodeKinds: options.nodeKinds } : {}),
+        ...(options?.workspaceId !== undefined ? { workspaceId: options.workspaceId } : {}),
+    };
+    const session = getSession();
+    try {
+        const result = await session.run(cypher, params);
+        const searchResults = result.records.map((record) => {
+            const neo4jNode = record.get("node");
+            const nodeProps = neo4jNode.properties;
+            const score = record.get("score");
+            const rawEdges = record.get("edges");
+            // Filter out null edges (from OPTIONAL MATCH with no relationships)
+            const edges = rawEdges
+                .filter((e) => e.fromId !== null && e.toId !== null)
+                .map(recordToEdge);
+            return {
+                node: recordToNode(nodeProps),
+                score,
+                edges,
+            };
+        });
+        logger.debug({ query: query.substring(0, 50), results: searchResults.length, limit }, "Knowledge search completed");
+        return searchResults;
+    }
+    finally {
+        try {
+            await session.close();
+        }
+        catch (closeError) {
+            logger.warn({ err: closeError }, "Failed to close session after knowledgeSearch");
+        }
+    }
+}
+//# sourceMappingURL=search.js.map

package/dist/search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.js","sourceRoot":"","sources":["../src/search.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAC/D,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AA8B7D,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E,2CAA2C;AAC3C,MAAM,aAAa,GAAW,EAAE,CAAC;AAEjC,wCAAwC;AACxC,MAAM,iBAAiB,GAAW,CAAC,CAAC;AAEpC,8EAA8E;AAC9E,SAAS;AACT,8EAA8E;AAE9E;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,OAK1B;IACC,MAAM,OAAO,GAAa,CAAC,oBAAoB,CAAC,CAAC;IAEjD,IAAI,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtD,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;IAC1C,CAAC;IACD,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACtC,OAAO,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;IAClD,CAAC;IAED,MAAM,WAAW,GAAW,OAAO,CAAC,MAAM,GAAG,CAAC;QAC5C,CAAC,CAAC,SAAS,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;QAClC,CAAC,CAAC,EAAE,CAAC;IAEP,wEAAwE;IACxE,OAAO;kDACyC,OAAO,CAAC,cAAc;;MAElE,WAAW;;;YAGL,OAAO,CAAC,KAAK;mCACU,UAAU;;;;;;;;kBAQ3B,CAAC;AACnB,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,KAAa,EACb,QAAkB,EAClB,OAAuB;IAEvB,MAAM,KAAK,GAAW,OAAO,EAAE,KAAK,IAAI,aAAa,CAAC;IACtD,MAAM,QAAQ,GAAW,OAAO,EAAE,QAAQ,IAAI,iBAAiB,CAAC;IAEhE,kBAAkB;IAClB,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAE5D,6EAA6E;IAC7E,MAAM,UAAU,GAAY,CAAC,CAAC,CAAC,OAAO,EAAE,SAAS,EAAE,MAAM,IAAI,OAAO,EAAE,WAAW,KAAK,SAAS,CAAC,CAAC;IACjG,MAAM,cAAc,GAAW,UAAU,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAE9D,MAAM,MAAM,GAAW,iBAAiB,CAAC;QACvC,KAAK;QACL,cAAc;QACd,SAAS,EAAE,OAAO,EAAE,SAAS;QAC7B,WAAW,EAAE,OAAO,EAAE,WAAW;KAClC,CAAC,CAAC;IAEH,MAAM,MAAM,GAA4B;QACtC,SAAS,EAAE,iBAAiB;QAC5B,WAAW;QACX,QAAQ;QACR,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/D,GAAG,CAAC,OAAO,EAAE,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpF,CAAC;IAEF,MAAM,OAAO,GAAG,UAAU,EAAE,CAAC;IAC7B,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAEjD,MAAM,aAAa,GAAmB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAmB,EAAE,EAAE;YAC/E,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAA4C,CAAC;YAChF,MAAM,SAAS,GAA4B,SAAS,CAAC,UAAU,CAAC;YAChE,MAAM,KAAK,GAAW,MAAM,CAAC,GAAG,CAAC,OAAO,CAAW,CAAC;YACpD,MAAM,QAAQ,GACZ,MAAM,CAAC,GAAG,CAAC,OAAO,CAA8B,CAAC;YAEnD,oEAAoE;YACpE,MAAM,KAAK,GAAoB,QAAQ;iBACpC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;iBACnD,GAAG,CAAC,YAAY,CAAC,CAAC;YAErB,OAAO;gBACL,IAAI,EAAE,YAAY,CAAC,SAAS,CAAC;gBAC7B,KAAK;gBACL,KAAK;aACN,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,KAAK,CACV,EAAE,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,aAAa,CAAC,MAAM,EAAE,KAAK,EAAE,EACvE,4BAA4B,CAC7B,CAAC;QAEF,OAAO,aAAa,CAAC;IACvB,CAAC;YAAS,CAAC;QACT,IAAI,CAAC;YACH,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;QAAC,OAAO,UAAU,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,+CAA+C,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/transcript-chunker.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Session transcript chunker that splits JSONL session logs by conversation turn.
+ *
+ * Accepts the raw JSONL content of a session's `stream.jsonl` file and groups
+ * events into semantic turns (user input → agent response) for embedding.
+ *
+ * @module
+ */
+import type { Chunker } from "./chunker.js";
+/** Options for the session transcript chunker. */
+export interface TranscriptChunkerOptions {
+    /** Max characters per chunk before splitting (default 4000). */
+    maxChunkSize?: number;
+    /** Event types to skip (default: status, signal, usage, system). */
+    skipEventTypes?: string[];
+}
+/**
+ * Create a chunker that splits JSONL session transcripts by conversation turn.
+ *
+ * A "turn" starts at a `user_input` event and includes all subsequent events
+ * until the next `user_input`. Events before the first `user_input` are grouped
+ * into an initial turn (turn 0). Turns exceeding {@link TranscriptChunkerOptions.maxChunkSize}
+ * are split into sub-chunks.
+ *
+ * @param options - Optional chunker configuration.
+ * @returns A {@link Chunker} for session transcript JSONL content.
+ */
+export declare function createTranscriptChunker(options?: TranscriptChunkerOptions): Chunker;
+//# sourceMappingURL=transcript-chunker.d.ts.map

package/dist/transcript-chunker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"transcript-chunker.d.ts","sourceRoot":"","sources":["../src/transcript-chunker.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAS,OAAO,EAAE,MAAM,cAAc,CAAC;AAgBnD,kDAAkD;AAClD,MAAM,WAAW,wBAAwB;IACvC,gEAAgE;IAChE,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,oEAAoE;IACpE,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC;CAC3B;AAmBD;;;;;;;;;;GAUG;AACH,wBAAgB,uBAAuB,CAAC,OAAO,CAAC,EAAE,wBAAwB,GAAG,OAAO,CAkDnF"}