@nahisaho/katashiro-knowledge 0.1.0

package/dist/graph/index.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Graph module exports
+ *
+ * @module @nahisaho/katashiro-knowledge
+ */
+export { KnowledgeGraph, type GraphNode, type GraphEdge, } from './knowledge-graph.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACL,cAAc,EACd,KAAK,SAAS,EACd,KAAK,SAAS,GACf,MAAM,sBAAsB,CAAC"}

package/dist/graph/index.js

@@ -0,0 +1,7 @@
+/**
+ * Graph module exports
+ *
+ * @module @nahisaho/katashiro-knowledge
+ */
+export { KnowledgeGraph, } from './knowledge-graph.js';
+//# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACL,cAAc,GAGf,MAAM,sBAAsB,CAAC"}

package/dist/graph/knowledge-graph.d.ts

@@ -0,0 +1,164 @@
+/**
+ * KnowledgeGraph - In-memory knowledge graph
+ *
+ * Provides graph data structure for entities and relationships
+ *
+ * @module @nahisaho/katashiro-knowledge
+ * @task TSK-040
+ */
+import { type Result } from '@nahisaho/katashiro-core';
+/**
+ * Graph node representing an entity
+ */
+export interface GraphNode {
+    readonly id: string;
+    readonly type: string;
+    readonly label: string;
+    readonly properties: Record<string, unknown>;
+    readonly createdAt: string;
+    readonly updatedAt?: string;
+}
+/**
+ * Graph edge representing a relationship
+ */
+export interface GraphEdge {
+    readonly id: string;
+    readonly source: string;
+    readonly target: string;
+    readonly predicate: string;
+    readonly weight: number;
+    readonly properties?: Record<string, unknown>;
+    readonly createdAt: string;
+}
+/**
+ * KnowledgeGraph
+ *
+ * In-memory graph for storing entities and relationships
+ */
+export declare class KnowledgeGraph {
+    private nodes;
+    private edges;
+    private adjacencyList;
+    private reverseAdjacencyList;
+    /**
+     * Add a node to the graph
+     *
+     * @param node - Node to add
+     * @returns Result indicating success or failure
+     */
+    addNode(node: GraphNode): Result<void, Error>;
+    /**
+     * Add an edge to the graph
+     *
+     * @param edge - Edge to add
+     * @returns Result indicating success or failure
+     */
+    addEdge(edge: GraphEdge): Result<void, Error>;
+    /**
+     * Get a node by ID
+     *
+     * @param id - Node ID
+     * @returns The node or null if not found
+     */
+    getNode(id: string): Result<GraphNode | null, Error>;
+    /**
+     * Get an edge by ID
+     *
+     * @param id - Edge ID
+     * @returns The edge or null if not found
+     */
+    getEdge(id: string): Result<GraphEdge | null, Error>;
+    /**
+     * Get all neighbors of a node (outgoing edges)
+     *
+     * @param nodeId - Node ID
+     * @returns Array of neighboring nodes
+     */
+    getNeighbors(nodeId: string): Result<GraphNode[], Error>;
+    /**
+     * Get incoming neighbors of a node
+     *
+     * @param nodeId - Node ID
+     * @returns Array of nodes with edges pointing to this node
+     */
+    getIncomingNeighbors(nodeId: string): Result<GraphNode[], Error>;
+    /**
+     * Get all edges from a node
+     *
+     * @param nodeId - Node ID
+     * @returns Array of edges from this node
+     */
+    getOutgoingEdges(nodeId: string): Result<GraphEdge[], Error>;
+    /**
+     * Remove a node and all its edges
+     *
+     * @param id - Node ID
+     * @returns Result indicating success or failure
+     */
+    removeNode(id: string): Result<void, Error>;
+    /**
+     * Remove an edge
+     *
+     * @param id - Edge ID
+     * @returns Result indicating success or failure
+     */
+    removeEdge(id: string): Result<void, Error>;
+    /**
+     * Find a path between two nodes using BFS
+     *
+     * @param startId - Start node ID
+     * @param endId - End node ID
+     * @returns Array of node IDs representing the path, or null if no path
+     */
+    findPath(startId: string, endId: string): Result<string[] | null, Error>;
+    /**
+     * Get all nodes
+     *
+     * @returns Array of all nodes
+     */
+    getAllNodes(): GraphNode[];
+    /**
+     * Get all edges
+     *
+     * @returns Array of all edges
+     */
+    getAllEdges(): GraphEdge[];
+    /**
+     * Get node count
+     *
+     * @returns Number of nodes
+     */
+    getNodeCount(): number;
+    /**
+     * Get edge count
+     *
+     * @returns Number of edges
+     */
+    getEdgeCount(): number;
+    /**
+     * Clear all nodes and edges
+     */
+    clear(): void;
+    /**
+     * Search nodes by label (partial match)
+     *
+     * @param query - Search query
+     * @returns Matching nodes
+     */
+    searchByLabel(query: string): GraphNode[];
+    /**
+     * Get nodes by type
+     *
+     * @param type - Node type
+     * @returns Nodes of the specified type
+     */
+    getNodesByType(type: string): GraphNode[];
+    /**
+     * Get edges by predicate
+     *
+     * @param predicate - Edge predicate
+     * @returns Edges with the specified predicate
+     */
+    getEdgesByPredicate(predicate: string): GraphEdge[];
+}
+//# sourceMappingURL=knowledge-graph.d.ts.map

package/dist/graph/knowledge-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-graph.d.ts","sourceRoot":"","sources":["../../src/graph/knowledge-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAW,KAAK,MAAM,EAAE,MAAM,0BAA0B,CAAC;AAEhE;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC7C,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC9C,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED;;;;GAIG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,KAAK,CAAqC;IAClD,OAAO,CAAC,KAAK,CAAqC;IAClD,OAAO,CAAC,aAAa,CAAuC;IAC5D,OAAO,CAAC,oBAAoB,CAAuC;IAEnE;;;;;OAKG;IACH,OAAO,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC;IAY7C;;;;;OAKG;IACH,OAAO,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC;IAoB7C;;;;;OAKG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC,SAAS,GAAG,IAAI,EAAE,KAAK,CAAC;IAKpD;;;;;OAKG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC,SAAS,GAAG,IAAI,EAAE,KAAK,CAAC;IAKpD;;;;;OAKG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC;IAiBxD;;;;;OAKG;IACH,oBAAoB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC;IAiBhE;;;;;OAKG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC;IAe5D;;;;;OAKG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC;IAiC3C;;;;;OAKG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC;IAa3C;;;;;;OAMG;IACH,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC;IA8CxE;;;;OAIG;IACH,WAAW,IAAI,SAAS,EAAE;IAI1B;;;;OAIG;IACH,WAAW,IAAI,SAAS,EAAE;IAI1B;;;;OAIG;IACH,YAAY,IAAI,MAAM;IAItB;;;;OAIG;IACH,YAAY,IAAI,MAAM;IAItB;;OAEG;IACH,KAAK,IAAI,IAAI;IAOb;;;;;OAKG;IACH,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAAE;IAOzC;;;;;OAKG;IACH,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,EAAE;IAIzC;;;;;OAKG;IACH,mBAAmB,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,EAAE;CAKpD"}

package/dist/graph/knowledge-graph.js

@@ -0,0 +1,298 @@
+/**
+ * KnowledgeGraph - In-memory knowledge graph
+ *
+ * Provides graph data structure for entities and relationships
+ *
+ * @module @nahisaho/katashiro-knowledge
+ * @task TSK-040
+ */
+import { ok, err } from '@nahisaho/katashiro-core';
+/**
+ * KnowledgeGraph
+ *
+ * In-memory graph for storing entities and relationships
+ */
+export class KnowledgeGraph {
+    nodes = new Map();
+    edges = new Map();
+    adjacencyList = new Map();
+    reverseAdjacencyList = new Map();
+    /**
+     * Add a node to the graph
+     *
+     * @param node - Node to add
+     * @returns Result indicating success or failure
+     */
+    addNode(node) {
+        if (this.nodes.has(node.id)) {
+            return err(new Error(`Node with ID ${node.id} already exists`));
+        }
+        this.nodes.set(node.id, node);
+        this.adjacencyList.set(node.id, new Set());
+        this.reverseAdjacencyList.set(node.id, new Set());
+        return ok(undefined);
+    }
+    /**
+     * Add an edge to the graph
+     *
+     * @param edge - Edge to add
+     * @returns Result indicating success or failure
+     */
+    addEdge(edge) {
+        if (!this.nodes.has(edge.source)) {
+            return err(new Error(`Source node ${edge.source} does not exist`));
+        }
+        if (!this.nodes.has(edge.target)) {
+            return err(new Error(`Target node ${edge.target} does not exist`));
+        }
+        if (this.edges.has(edge.id)) {
+            return err(new Error(`Edge with ID ${edge.id} already exists`));
+        }
+        this.edges.set(edge.id, edge);
+        this.adjacencyList.get(edge.source)?.add(edge.target);
+        this.reverseAdjacencyList.get(edge.target)?.add(edge.source);
+        return ok(undefined);
+    }
+    /**
+     * Get a node by ID
+     *
+     * @param id - Node ID
+     * @returns The node or null if not found
+     */
+    getNode(id) {
+        const node = this.nodes.get(id);
+        return ok(node ?? null);
+    }
+    /**
+     * Get an edge by ID
+     *
+     * @param id - Edge ID
+     * @returns The edge or null if not found
+     */
+    getEdge(id) {
+        const edge = this.edges.get(id);
+        return ok(edge ?? null);
+    }
+    /**
+     * Get all neighbors of a node (outgoing edges)
+     *
+     * @param nodeId - Node ID
+     * @returns Array of neighboring nodes
+     */
+    getNeighbors(nodeId) {
+        const neighborIds = this.adjacencyList.get(nodeId);
+        if (!neighborIds) {
+            return err(new Error(`Node ${nodeId} does not exist`));
+        }
+        const neighbors = [];
+        for (const id of neighborIds) {
+            const node = this.nodes.get(id);
+            if (node) {
+                neighbors.push(node);
+            }
+        }
+        return ok(neighbors);
+    }
+    /**
+     * Get incoming neighbors of a node
+     *
+     * @param nodeId - Node ID
+     * @returns Array of nodes with edges pointing to this node
+     */
+    getIncomingNeighbors(nodeId) {
+        const neighborIds = this.reverseAdjacencyList.get(nodeId);
+        if (!neighborIds) {
+            return err(new Error(`Node ${nodeId} does not exist`));
+        }
+        const neighbors = [];
+        for (const id of neighborIds) {
+            const node = this.nodes.get(id);
+            if (node) {
+                neighbors.push(node);
+            }
+        }
+        return ok(neighbors);
+    }
+    /**
+     * Get all edges from a node
+     *
+     * @param nodeId - Node ID
+     * @returns Array of edges from this node
+     */
+    getOutgoingEdges(nodeId) {
+        if (!this.nodes.has(nodeId)) {
+            return err(new Error(`Node ${nodeId} does not exist`));
+        }
+        const edges = [];
+        for (const edge of this.edges.values()) {
+            if (edge.source === nodeId) {
+                edges.push(edge);
+            }
+        }
+        return ok(edges);
+    }
+    /**
+     * Remove a node and all its edges
+     *
+     * @param id - Node ID
+     * @returns Result indicating success or failure
+     */
+    removeNode(id) {
+        if (!this.nodes.has(id)) {
+            return err(new Error(`Node ${id} does not exist`));
+        }
+        // Remove all edges involving this node
+        const edgesToRemove = [];
+        for (const [edgeId, edge] of this.edges) {
+            if (edge.source === id || edge.target === id) {
+                edgesToRemove.push(edgeId);
+            }
+        }
+        for (const edgeId of edgesToRemove) {
+            this.edges.delete(edgeId);
+        }
+        // Update adjacency lists
+        for (const neighbors of this.adjacencyList.values()) {
+            neighbors.delete(id);
+        }
+        for (const neighbors of this.reverseAdjacencyList.values()) {
+            neighbors.delete(id);
+        }
+        // Remove the node itself
+        this.nodes.delete(id);
+        this.adjacencyList.delete(id);
+        this.reverseAdjacencyList.delete(id);
+        return ok(undefined);
+    }
+    /**
+     * Remove an edge
+     *
+     * @param id - Edge ID
+     * @returns Result indicating success or failure
+     */
+    removeEdge(id) {
+        const edge = this.edges.get(id);
+        if (!edge) {
+            return err(new Error(`Edge ${id} does not exist`));
+        }
+        this.adjacencyList.get(edge.source)?.delete(edge.target);
+        this.reverseAdjacencyList.get(edge.target)?.delete(edge.source);
+        this.edges.delete(id);
+        return ok(undefined);
+    }
+    /**
+     * Find a path between two nodes using BFS
+     *
+     * @param startId - Start node ID
+     * @param endId - End node ID
+     * @returns Array of node IDs representing the path, or null if no path
+     */
+    findPath(startId, endId) {
+        if (!this.nodes.has(startId)) {
+            return err(new Error(`Start node ${startId} does not exist`));
+        }
+        if (!this.nodes.has(endId)) {
+            return err(new Error(`End node ${endId} does not exist`));
+        }
+        if (startId === endId) {
+            return ok([startId]);
+        }
+        // BFS
+        const visited = new Set();
+        const queue = [
+            { id: startId, path: [startId] },
+        ];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (current.id === endId) {
+                return ok(current.path);
+            }
+            if (visited.has(current.id)) {
+                continue;
+            }
+            visited.add(current.id);
+            const neighbors = this.adjacencyList.get(current.id);
+            if (neighbors) {
+                for (const neighborId of neighbors) {
+                    if (!visited.has(neighborId)) {
+                        queue.push({
+                            id: neighborId,
+                            path: [...current.path, neighborId],
+                        });
+                    }
+                }
+            }
+        }
+        return ok(null);
+    }
+    /**
+     * Get all nodes
+     *
+     * @returns Array of all nodes
+     */
+    getAllNodes() {
+        return Array.from(this.nodes.values());
+    }
+    /**
+     * Get all edges
+     *
+     * @returns Array of all edges
+     */
+    getAllEdges() {
+        return Array.from(this.edges.values());
+    }
+    /**
+     * Get node count
+     *
+     * @returns Number of nodes
+     */
+    getNodeCount() {
+        return this.nodes.size;
+    }
+    /**
+     * Get edge count
+     *
+     * @returns Number of edges
+     */
+    getEdgeCount() {
+        return this.edges.size;
+    }
+    /**
+     * Clear all nodes and edges
+     */
+    clear() {
+        this.nodes.clear();
+        this.edges.clear();
+        this.adjacencyList.clear();
+        this.reverseAdjacencyList.clear();
+    }
+    /**
+     * Search nodes by label (partial match)
+     *
+     * @param query - Search query
+     * @returns Matching nodes
+     */
+    searchByLabel(query) {
+        const lowerQuery = query.toLowerCase();
+        return Array.from(this.nodes.values()).filter((node) => node.label.toLowerCase().includes(lowerQuery));
+    }
+    /**
+     * Get nodes by type
+     *
+     * @param type - Node type
+     * @returns Nodes of the specified type
+     */
+    getNodesByType(type) {
+        return Array.from(this.nodes.values()).filter((node) => node.type === type);
+    }
+    /**
+     * Get edges by predicate
+     *
+     * @param predicate - Edge predicate
+     * @returns Edges with the specified predicate
+     */
+    getEdgesByPredicate(predicate) {
+        return Array.from(this.edges.values()).filter((edge) => edge.predicate === predicate);
+    }
+}
+//# sourceMappingURL=knowledge-graph.js.map

package/dist/graph/knowledge-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-graph.js","sourceRoot":"","sources":["../../src/graph/knowledge-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,EAAE,EAAE,GAAG,EAAe,MAAM,0BAA0B,CAAC;AA2BhE;;;;GAIG;AACH,MAAM,OAAO,cAAc;IACjB,KAAK,GAA2B,IAAI,GAAG,EAAE,CAAC;IAC1C,KAAK,GAA2B,IAAI,GAAG,EAAE,CAAC;IAC1C,aAAa,GAA6B,IAAI,GAAG,EAAE,CAAC;IACpD,oBAAoB,GAA6B,IAAI,GAAG,EAAE,CAAC;IAEnE;;;;;OAKG;IACH,OAAO,CAAC,IAAe;QACrB,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,gBAAgB,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC;QAClE,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC3C,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAElD,OAAO,EAAE,CAAC,SAAS,CAAC,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,IAAe;QACrB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACjC,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,eAAe,IAAI,CAAC,MAAM,iBAAiB,CAAC,CAAC,CAAC;QACrE,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACjC,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,eAAe,IAAI,CAAC,MAAM,iBAAiB,CAAC,CAAC,CAAC;QACrE,CAAC;QAED,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,gBAAgB,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC;QAClE,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAE7D,OAAO,EAAE,CAAC,SAAS,CAAC,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,EAAU;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,OAAO,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,EAAU;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,OAAO,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,MAAc;QACzB,MAAM,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,MAAM,iBAAiB,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,MAAM,SAAS,GAAgB,EAAE,CAAC;QAClC,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,IAAI,EAAE,CAAC;gBACT,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO,EAAE,CAAC,SAAS,CAAC,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACH,oBAAoB,CAAC,MAAc;QACjC,MAAM,WAAW,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1D,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,MAAM,iBAAiB,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,MAAM,SAAS,GAAgB,EAAE,CAAC;QAClC,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,IAAI,EAAE,CAAC;gBACT,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO,EAAE,CAAC,SAAS,CAAC,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACH,gBAAgB,CAAC,MAAc;QAC7B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5B,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,MAAM,iBAAiB,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,EAAU;QACnB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,uCAAuC;QACvC,MAAM,aAAa,GAAa,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;gBAC7C,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;QAED,yBAAyB;QACzB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC;YACpD,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,CAAC;QACD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,oBAAoB,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3D,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,CAAC;QAED,yBAAyB;QACzB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAErC,OAAO,EAAE,CAAC,SAAS,CAAC,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,EAAU;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzD,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAEtB,OAAO,EAAE,CAAC,SAAS,CAAC,CAAC;IACvB,CAAC;IAED;;;;;;OAMG;IACH,QAAQ,CAAC,OAAe,EAAE,KAAa;QACrC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC7B,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,cAAc,OAAO,iBAAiB,CAAC,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,YAAY,KAAK,iBAAiB,CAAC,CAAC,CAAC;QAC5D,CAAC;QAED,IAAI,OAAO,KAAK,KAAK,EAAE,CAAC;YACtB,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,MAAM;QACN,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAA0C;YACnD,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE;SACjC,CAAC;QAEF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,IAAI,OAAO,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;gBACzB,OAAO,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC1B,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5B,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAExB,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACrD,IAAI,SAAS,EAAE,CAAC;gBACd,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;oBACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC7B,KAAK,CAAC,IAAI,CAAC;4BACT,EAAE,EAAE,UAAU;4BACd,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,UAAU,CAAC;yBACpC,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACH,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACH,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACH,YAAY;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACH,YAAY;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC;IACpC,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,KAAa;QACzB,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QACvC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CACrD,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CAC9C,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,cAAc,CAAC,IAAY;QACzB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAC9E,CAAC;IAED;;;;;OAKG;IACH,mBAAmB,CAAC,SAAiB;QACnC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAC3C,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CACvC,CAAC;IACJ,CAAC;CACF"}

package/dist/index.d.ts

@@ -0,0 +1,15 @@
+/**
+ * @nahisaho/katashiro-knowledge
+ * 知識管理・LLMパッケージ
+ *
+ * @requirement REQ-NFR-005, REQ-COLLECT-007, REQ-ANALYZE-007
+ * @design DES-KATASHIRO-001 §2.2 Knowledge Container
+ */
+export type { ILLMProvider, ISourceTracker, IYATAClient, } from './interfaces.js';
+export type { LLMConfig, LLMResponse, LLMProvider, TrackedSource, KnowledgeEntity, } from './types.js';
+export { KnowledgeGraph, type GraphNode, type GraphEdge, } from './graph/index.js';
+export { GraphPersistence, type SerializedGraph, type GraphMetadata, type GraphDiff, } from './persistence/index.js';
+export { GraphQuery, type QueryFilter, type GraphQueryDef, type QueryResult, } from './query/index.js';
+export { GraphVisualization, type VisualizationConfig, type D3GraphData, type CytoscapeData, type GraphStats, } from './visualization/index.js';
+export { GraphSync, type SyncOptions, type SyncResult, type ComparisonResult, type Conflict, } from './sync/index.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,YAAY,EACV,YAAY,EACZ,cAAc,EACd,WAAW,GACZ,MAAM,iBAAiB,CAAC;AAEzB,YAAY,EACV,SAAS,EACT,WAAW,EACX,WAAW,EACX,aAAa,EACb,eAAe,GAChB,MAAM,YAAY,CAAC;AAGpB,OAAO,EACL,cAAc,EACd,KAAK,SAAS,EACd,KAAK,SAAS,GACf,MAAM,kBAAkB,CAAC;AAG1B,OAAO,EACL,gBAAgB,EAChB,KAAK,eAAe,EACpB,KAAK,aAAa,EAClB,KAAK,SAAS,GACf,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EACL,UAAU,EACV,KAAK,WAAW,EAChB,KAAK,aAAa,EAClB,KAAK,WAAW,GACjB,MAAM,kBAAkB,CAAC;AAG1B,OAAO,EACL,kBAAkB,EAClB,KAAK,mBAAmB,EACxB,KAAK,WAAW,EAChB,KAAK,aAAa,EAClB,KAAK,UAAU,GAChB,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,SAAS,EACT,KAAK,WAAW,EAChB,KAAK,UAAU,EACf,KAAK,gBAAgB,EACrB,KAAK,QAAQ,GACd,MAAM,iBAAiB,CAAC"}

package/dist/index.js

@@ -0,0 +1,18 @@
+/**
+ * @nahisaho/katashiro-knowledge
+ * 知識管理・LLMパッケージ
+ *
+ * @requirement REQ-NFR-005, REQ-COLLECT-007, REQ-ANALYZE-007
+ * @design DES-KATASHIRO-001 §2.2 Knowledge Container
+ */
+// Graph module
+export { KnowledgeGraph, } from './graph/index.js';
+// Persistence module
+export { GraphPersistence, } from './persistence/index.js';
+// Query module
+export { GraphQuery, } from './query/index.js';
+// Visualization module
+export { GraphVisualization, } from './visualization/index.js';
+// Sync module
+export { GraphSync, } from './sync/index.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAgBH,eAAe;AACf,OAAO,EACL,cAAc,GAGf,MAAM,kBAAkB,CAAC;AAE1B,qBAAqB;AACrB,OAAO,EACL,gBAAgB,GAIjB,MAAM,wBAAwB,CAAC;AAEhC,eAAe;AACf,OAAO,EACL,UAAU,GAIX,MAAM,kBAAkB,CAAC;AAE1B,uBAAuB;AACvB,OAAO,EACL,kBAAkB,GAKnB,MAAM,0BAA0B,CAAC;AAElC,cAAc;AACd,OAAO,EACL,SAAS,GAKV,MAAM,iBAAiB,CAAC"}

package/dist/interfaces.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Knowledgeインターフェース定義
+ */
+import type { Result, Source, ID } from '@nahisaho/katashiro-core';
+import type { LLMConfig, LLMResponse, TrackedSource, KnowledgeEntity } from './types.js';
+export interface ILLMProvider {
+    complete(prompt: string, config?: LLMConfig): Promise<Result<LLMResponse, Error>>;
+    stream(prompt: string, config?: LLMConfig): AsyncIterable<string>;
+}
+export interface ISourceTracker {
+    track(source: Source): Promise<Result<TrackedSource, Error>>;
+    get(id: ID): Promise<Result<TrackedSource | null, Error>>;
+    list(): Promise<Result<TrackedSource[], Error>>;
+}
+export interface IYATAClient {
+    store(entity: KnowledgeEntity): Promise<Result<void, Error>>;
+    query(sparql: string): Promise<Result<unknown[], Error>>;
+    infer(subject: string, predicate: string): Promise<Result<string[], Error>>;
+}
+//# sourceMappingURL=interfaces.d.ts.map

package/dist/interfaces.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"interfaces.d.ts","sourceRoot":"","sources":["../src/interfaces.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AACnE,OAAO,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAEzF,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC;IAClF,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;CACnE;AAED,MAAM,WAAW,cAAc;IAC7B,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,GAAG,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IAC1D,IAAI,IAAI,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;CACjD;AAED,MAAM,WAAW,WAAW;IAC1B,KAAK,CAAC,MAAM,EAAE,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;IACzD,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;CAC7E"}

package/dist/interfaces.js

@@ -0,0 +1,5 @@
+/**
+ * Knowledgeインターフェース定義
+ */
+export {};
+//# sourceMappingURL=interfaces.js.map

package/dist/interfaces.js.map

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