@nahisaho/katashiro-knowledge 0.1.0

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

@@ -0,0 +1,102 @@
+/**
+ * GraphPersistence - Graph serialization and deserialization
+ *
+ * Handles saving and loading knowledge graphs
+ *
+ * @module @nahisaho/katashiro-knowledge
+ * @task TSK-041
+ */
+import { type Result } from '@nahisaho/katashiro-core';
+import { KnowledgeGraph, type GraphNode, type GraphEdge } from '../graph/knowledge-graph.js';
+/**
+ * Serialized graph format
+ */
+export interface SerializedGraph {
+    readonly version: string;
+    readonly nodes: GraphNode[];
+    readonly edges: GraphEdge[];
+    readonly metadata: GraphMetadata;
+}
+/**
+ * Graph metadata
+ */
+export interface GraphMetadata {
+    readonly nodeCount: number;
+    readonly edgeCount: number;
+    readonly createdAt: string;
+    readonly updatedAt?: string;
+    readonly name?: string;
+    readonly description?: string;
+}
+/**
+ * GraphPersistence
+ *
+ * Provides serialization and deserialization for KnowledgeGraph
+ */
+export declare class GraphPersistence {
+    /**
+     * Serialize a graph to a portable format
+     *
+     * @param graph - Graph to serialize
+     * @returns Serialized graph data
+     */
+    serialize(graph: KnowledgeGraph): Result<SerializedGraph, Error>;
+    /**
+     * Deserialize data into a graph
+     *
+     * @param data - Serialized graph data
+     * @param graph - Target graph (will be modified)
+     * @returns Result indicating success or failure
+     */
+    deserialize(data: SerializedGraph, graph: KnowledgeGraph): Result<void, Error>;
+    /**
+     * Convert graph to JSON string
+     *
+     * @param graph - Graph to convert
+     * @param pretty - Whether to format with indentation
+     * @returns JSON string
+     */
+    toJSON(graph: KnowledgeGraph, pretty?: boolean): Result<string, Error>;
+    /**
+     * Load graph from JSON string
+     *
+     * @param json - JSON string
+     * @param graph - Target graph
+     * @returns Result indicating success or failure
+     */
+    fromJSON(json: string, graph: KnowledgeGraph): Result<void, Error>;
+    /**
+     * Validate serialized graph data
+     *
+     * @param data - Data to validate
+     * @returns True if valid, false otherwise
+     */
+    validate(data: SerializedGraph): Result<boolean, Error>;
+    /**
+     * Create a diff between two serialized graphs
+     *
+     * @param before - Previous state
+     * @param after - Current state
+     * @returns Diff describing changes
+     */
+    diff(before: SerializedGraph, after: SerializedGraph): Result<GraphDiff, Error>;
+    /**
+     * Merge two graphs
+     *
+     * @param base - Base graph
+     * @param other - Graph to merge in
+     * @returns Merged graph data
+     */
+    merge(base: SerializedGraph, other: SerializedGraph): Result<SerializedGraph, Error>;
+}
+/**
+ * Graph diff result
+ */
+export interface GraphDiff {
+    readonly addedNodes: GraphNode[];
+    readonly removedNodes: GraphNode[];
+    readonly addedEdges: GraphEdge[];
+    readonly removedEdges: GraphEdge[];
+    readonly hasChanges: boolean;
+}
+//# sourceMappingURL=graph-persistence.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-persistence.d.ts","sourceRoot":"","sources":["../../src/persistence/graph-persistence.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAiB,KAAK,MAAM,EAAE,MAAM,0BAA0B,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,MAAM,6BAA6B,CAAC;AAE7F;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,CAAC;IAC5B,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC;CAClC;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;CAC/B;AAOD;;;;GAIG;AACH,qBAAa,gBAAgB;IAC3B;;;;;OAKG;IACH,SAAS,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,CAAC,eAAe,EAAE,KAAK,CAAC;IAsBhE;;;;;;OAMG;IACH,WAAW,CAAC,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,cAAc,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC;IA2B9E;;;;;;OAMG;IACH,MAAM,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,UAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC;IAiBpE;;;;;;OAMG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,cAAc,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC;IASlE;;;;;OAKG;IACH,QAAQ,CAAC,IAAI,EAAE,eAAe,GAAG,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC;IAoCvD;;;;;;OAMG;IACH,IAAI,CACF,MAAM,EAAE,eAAe,EACvB,KAAK,EAAE,eAAe,GACrB,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC;IA8B3B;;;;;;OAMG;IACH,KAAK,CACH,IAAI,EAAE,eAAe,EACrB,KAAK,EAAE,eAAe,GACrB,MAAM,CAAC,eAAe,EAAE,KAAK,CAAC;CAgClC;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,UAAU,EAAE,SAAS,EAAE,CAAC;IACjC,QAAQ,CAAC,YAAY,EAAE,SAAS,EAAE,CAAC;IACnC,QAAQ,CAAC,UAAU,EAAE,SAAS,EAAE,CAAC;IACjC,QAAQ,CAAC,YAAY,EAAE,SAAS,EAAE,CAAC;IACnC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;CAC9B"}

package/dist/persistence/graph-persistence.js

@@ -0,0 +1,222 @@
+/**
+ * GraphPersistence - Graph serialization and deserialization
+ *
+ * Handles saving and loading knowledge graphs
+ *
+ * @module @nahisaho/katashiro-knowledge
+ * @task TSK-041
+ */
+import { ok, err, isOk } from '@nahisaho/katashiro-core';
+/**
+ * Current serialization format version
+ */
+const FORMAT_VERSION = '1.0';
+/**
+ * GraphPersistence
+ *
+ * Provides serialization and deserialization for KnowledgeGraph
+ */
+export class GraphPersistence {
+    /**
+     * Serialize a graph to a portable format
+     *
+     * @param graph - Graph to serialize
+     * @returns Serialized graph data
+     */
+    serialize(graph) {
+        try {
+            const nodes = graph.getAllNodes();
+            const edges = graph.getAllEdges();
+            const serialized = {
+                version: FORMAT_VERSION,
+                nodes,
+                edges,
+                metadata: {
+                    nodeCount: nodes.length,
+                    edgeCount: edges.length,
+                    createdAt: new Date().toISOString(),
+                },
+            };
+            return ok(serialized);
+        }
+        catch (error) {
+            return err(error instanceof Error ? error : new Error(String(error)));
+        }
+    }
+    /**
+     * Deserialize data into a graph
+     *
+     * @param data - Serialized graph data
+     * @param graph - Target graph (will be modified)
+     * @returns Result indicating success or failure
+     */
+    deserialize(data, graph) {
+        try {
+            // Clear existing data
+            graph.clear();
+            // Add nodes first
+            for (const node of data.nodes) {
+                const result = graph.addNode(node);
+                if (!isOk(result)) {
+                    return err(new Error(`Failed to add node ${node.id}: ${result.error.message}`));
+                }
+            }
+            // Add edges
+            for (const edge of data.edges) {
+                const result = graph.addEdge(edge);
+                if (!isOk(result)) {
+                    return err(new Error(`Failed to add edge ${edge.id}: ${result.error.message}`));
+                }
+            }
+            return ok(undefined);
+        }
+        catch (error) {
+            return err(error instanceof Error ? error : new Error(String(error)));
+        }
+    }
+    /**
+     * Convert graph to JSON string
+     *
+     * @param graph - Graph to convert
+     * @param pretty - Whether to format with indentation
+     * @returns JSON string
+     */
+    toJSON(graph, pretty = false) {
+        const serializeResult = this.serialize(graph);
+        if (!isOk(serializeResult)) {
+            return err(serializeResult.error);
+        }
+        try {
+            const json = pretty
+                ? JSON.stringify(serializeResult.value, null, 2)
+                : JSON.stringify(serializeResult.value);
+            return ok(json);
+        }
+        catch (error) {
+            return err(error instanceof Error ? error : new Error(String(error)));
+        }
+    }
+    /**
+     * Load graph from JSON string
+     *
+     * @param json - JSON string
+     * @param graph - Target graph
+     * @returns Result indicating success or failure
+     */
+    fromJSON(json, graph) {
+        try {
+            const data = JSON.parse(json);
+            return this.deserialize(data, graph);
+        }
+        catch (error) {
+            return err(error instanceof Error ? error : new Error(`Invalid JSON: ${error}`));
+        }
+    }
+    /**
+     * Validate serialized graph data
+     *
+     * @param data - Data to validate
+     * @returns True if valid, false otherwise
+     */
+    validate(data) {
+        try {
+            // Check required fields
+            if (!data.version || !data.nodes || !data.edges || !data.metadata) {
+                return ok(false);
+            }
+            // Check version
+            if (data.version !== FORMAT_VERSION) {
+                // Future: handle version migration
+            }
+            // Build node ID set
+            const nodeIds = new Set(data.nodes.map((n) => n.id));
+            // Validate edges reference existing nodes
+            for (const edge of data.edges) {
+                if (!nodeIds.has(edge.source) || !nodeIds.has(edge.target)) {
+                    return ok(false);
+                }
+            }
+            // Validate metadata
+            if (data.metadata.nodeCount !== data.nodes.length) {
+                return ok(false);
+            }
+            if (data.metadata.edgeCount !== data.edges.length) {
+                return ok(false);
+            }
+            return ok(true);
+        }
+        catch (error) {
+            return err(error instanceof Error ? error : new Error(String(error)));
+        }
+    }
+    /**
+     * Create a diff between two serialized graphs
+     *
+     * @param before - Previous state
+     * @param after - Current state
+     * @returns Diff describing changes
+     */
+    diff(before, after) {
+        try {
+            const beforeNodeIds = new Set(before.nodes.map((n) => n.id));
+            const afterNodeIds = new Set(after.nodes.map((n) => n.id));
+            const beforeEdgeIds = new Set(before.edges.map((e) => e.id));
+            const afterEdgeIds = new Set(after.edges.map((e) => e.id));
+            const addedNodes = after.nodes.filter((n) => !beforeNodeIds.has(n.id));
+            const removedNodes = before.nodes.filter((n) => !afterNodeIds.has(n.id));
+            const addedEdges = after.edges.filter((e) => !beforeEdgeIds.has(e.id));
+            const removedEdges = before.edges.filter((e) => !afterEdgeIds.has(e.id));
+            return ok({
+                addedNodes,
+                removedNodes,
+                addedEdges,
+                removedEdges,
+                hasChanges: addedNodes.length > 0 ||
+                    removedNodes.length > 0 ||
+                    addedEdges.length > 0 ||
+                    removedEdges.length > 0,
+            });
+        }
+        catch (error) {
+            return err(error instanceof Error ? error : new Error(String(error)));
+        }
+    }
+    /**
+     * Merge two graphs
+     *
+     * @param base - Base graph
+     * @param other - Graph to merge in
+     * @returns Merged graph data
+     */
+    merge(base, other) {
+        try {
+            const baseNodeIds = new Set(base.nodes.map((n) => n.id));
+            const baseEdgeIds = new Set(base.edges.map((e) => e.id));
+            // Add nodes from other that don't exist in base
+            const mergedNodes = [
+                ...base.nodes,
+                ...other.nodes.filter((n) => !baseNodeIds.has(n.id)),
+            ];
+            // Add edges from other that don't exist in base
+            const mergedEdges = [
+                ...base.edges,
+                ...other.edges.filter((e) => !baseEdgeIds.has(e.id)),
+            ];
+            return ok({
+                version: FORMAT_VERSION,
+                nodes: mergedNodes,
+                edges: mergedEdges,
+                metadata: {
+                    nodeCount: mergedNodes.length,
+                    edgeCount: mergedEdges.length,
+                    createdAt: base.metadata.createdAt,
+                    updatedAt: new Date().toISOString(),
+                },
+            });
+        }
+        catch (error) {
+            return err(error instanceof Error ? error : new Error(String(error)));
+        }
+    }
+}
+//# sourceMappingURL=graph-persistence.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-persistence.js","sourceRoot":"","sources":["../../src/persistence/graph-persistence.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAe,MAAM,0BAA0B,CAAC;AAyBtE;;GAEG;AACH,MAAM,cAAc,GAAG,KAAK,CAAC;AAE7B;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IAC3B;;;;;OAKG;IACH,SAAS,CAAC,KAAqB;QAC7B,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YAElC,MAAM,UAAU,GAAoB;gBAClC,OAAO,EAAE,cAAc;gBACvB,KAAK;gBACL,KAAK;gBACL,QAAQ,EAAE;oBACR,SAAS,EAAE,KAAK,CAAC,MAAM;oBACvB,SAAS,EAAE,KAAK,CAAC,MAAM;oBACvB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;iBACpC;aACF,CAAC;YAEF,OAAO,EAAE,CAAC,UAAU,CAAC,CAAC;QACxB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,GAAG,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,IAAqB,EAAE,KAAqB;QACtD,IAAI,CAAC;YACH,sBAAsB;YACtB,KAAK,CAAC,KAAK,EAAE,CAAC;YAEd,kBAAkB;YAClB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC9B,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBAClB,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,sBAAsB,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;gBAClF,CAAC;YACH,CAAC;YAED,YAAY;YACZ,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC9B,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBAClB,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,sBAAsB,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;gBAClF,CAAC;YACH,CAAC;YAED,OAAO,EAAE,CAAC,SAAS,CAAC,CAAC;QACvB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,GAAG,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,KAAqB,EAAE,MAAM,GAAG,KAAK;QAC1C,MAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC;YAC3B,OAAO,GAAG,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QAED,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM;gBACjB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;gBAChD,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YAE1C,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;QAClB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,GAAG,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,QAAQ,CAAC,IAAY,EAAE,KAAqB;QAC1C,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAoB,CAAC;YACjD,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACvC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,GAAG,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,iBAAiB,KAAK,EAAE,CAAC,CAAC,CAAC;QACnF,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,IAAqB;QAC5B,IAAI,CAAC;YACH,wBAAwB;YACxB,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClE,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC;YACnB,CAAC;YAED,gBAAgB;YAChB,IAAI,IAAI,CAAC,OAAO,KAAK,cAAc,EAAE,CAAC;gBACpC,mCAAmC;YACrC,CAAC;YAED,oBAAoB;YACpB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAErD,0CAA0C;YAC1C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3D,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;YAED,oBAAoB;YACpB,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBAClD,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC;YACnB,CAAC;YACD,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBAClD,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC;YACnB,CAAC;YAED,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;QAClB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,GAAG,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,IAAI,CACF,MAAuB,EACvB,KAAsB;QAEtB,IAAI,CAAC;YACH,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7D,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAE3D,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7D,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAE3D,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACvE,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAEzE,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACvE,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAEzE,OAAO,EAAE,CAAC;gBACR,UAAU;gBACV,YAAY;gBACZ,UAAU;gBACV,YAAY;gBACZ,UAAU,EACR,UAAU,CAAC,MAAM,GAAG,CAAC;oBACrB,YAAY,CAAC,MAAM,GAAG,CAAC;oBACvB,UAAU,CAAC,MAAM,GAAG,CAAC;oBACrB,YAAY,CAAC,MAAM,GAAG,CAAC;aAC1B,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,GAAG,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CACH,IAAqB,EACrB,KAAsB;QAEtB,IAAI,CAAC;YACH,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAEzD,gDAAgD;YAChD,MAAM,WAAW,GAAG;gBAClB,GAAG,IAAI,CAAC,KAAK;gBACb,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aACrD,CAAC;YAEF,gDAAgD;YAChD,MAAM,WAAW,GAAG;gBAClB,GAAG,IAAI,CAAC,KAAK;gBACb,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aACrD,CAAC;YAEF,OAAO,EAAE,CAAC;gBACR,OAAO,EAAE,cAAc;gBACvB,KAAK,EAAE,WAAW;gBAClB,KAAK,EAAE,WAAW;gBAClB,QAAQ,EAAE;oBACR,SAAS,EAAE,WAAW,CAAC,MAAM;oBAC7B,SAAS,EAAE,WAAW,CAAC,MAAM;oBAC7B,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS;oBAClC,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;iBACpC;aACF,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,GAAG,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;CACF"}

package/dist/persistence/index.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Persistence module exports
+ *
+ * @module @nahisaho/katashiro-knowledge
+ */
+export { GraphPersistence, type SerializedGraph, type GraphMetadata, type GraphDiff, } from './graph-persistence.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/persistence/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACL,gBAAgB,EAChB,KAAK,eAAe,EACpB,KAAK,aAAa,EAClB,KAAK,SAAS,GACf,MAAM,wBAAwB,CAAC"}

package/dist/persistence/index.js

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

package/dist/persistence/index.js.map

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

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

@@ -0,0 +1,103 @@
+/**
+ * GraphQuery - Query engine for KnowledgeGraph
+ *
+ * Provides query capabilities for searching and filtering graph data
+ *
+ * @module @nahisaho/katashiro-knowledge
+ * @task TSK-042
+ */
+import { type Result } from '@nahisaho/katashiro-core';
+import { KnowledgeGraph, type GraphNode, type GraphEdge } from '../graph/knowledge-graph.js';
+/**
+ * Query filter definition
+ */
+export interface QueryFilter {
+    readonly property: string;
+    readonly operator: 'eq' | 'ne' | 'gt' | 'lt' | 'gte' | 'lte' | 'contains';
+    readonly value: unknown;
+}
+/**
+ * Structured query definition
+ */
+export interface GraphQueryDef {
+    readonly type?: string;
+    readonly filters?: QueryFilter[];
+    readonly limit?: number;
+    readonly offset?: number;
+    readonly orderBy?: string;
+    readonly orderDirection?: 'asc' | 'desc';
+}
+/**
+ * Query result
+ */
+export interface QueryResult {
+    readonly nodes: GraphNode[];
+    readonly totalCount: number;
+    readonly executionTime: number;
+}
+/**
+ * GraphQuery
+ *
+ * Query engine for KnowledgeGraph
+ */
+export declare class GraphQuery {
+    private graph;
+    constructor(graph: KnowledgeGraph);
+    /**
+     * Find all nodes of a given type
+     *
+     * @param type - Node type to find
+     * @returns Array of matching nodes
+     */
+    findByType(type: string): Result<GraphNode[], Error>;
+    /**
+     * Find nodes with a specific property value
+     *
+     * @param property - Property name
+     * @param value - Property value
+     * @returns Array of matching nodes
+     */
+    findByProperty(property: string, value: unknown): Result<GraphNode[], Error>;
+    /**
+     * Find edges with a given predicate
+     *
+     * @param predicate - Edge predicate
+     * @returns Array of matching edges
+     */
+    findByPredicate(predicate: string): Result<GraphEdge[], Error>;
+    /**
+     * Find nodes related to a given node
+     *
+     * @param nodeId - Source node ID
+     * @param predicate - Optional predicate filter
+     * @returns Array of related nodes
+     */
+    findRelated(nodeId: string, predicate?: string): Result<GraphNode[], Error>;
+    /**
+     * Search nodes by label
+     *
+     * @param query - Search query (case insensitive substring match)
+     * @returns Array of matching nodes
+     */
+    search(query: string): Result<GraphNode[], Error>;
+    /**
+     * Execute a structured query
+     *
+     * @param queryDef - Query definition
+     * @returns Query result
+     */
+    execute(queryDef: GraphQueryDef): Result<QueryResult, Error>;
+    /**
+     * Aggregate nodes by a property
+     *
+     * @param operation - Aggregation operation
+     * @param groupBy - Property to group by
+     * @returns Aggregation result
+     */
+    aggregate(operation: 'count' | 'sum' | 'avg', groupBy: string): Result<Record<string, number>, Error>;
+    /**
+     * Apply a filter to a node
+     */
+    private applyFilter;
+}
+//# sourceMappingURL=graph-query.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-query.d.ts","sourceRoot":"","sources":["../../src/query/graph-query.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAiB,KAAK,MAAM,EAAE,MAAM,0BAA0B,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,MAAM,6BAA6B,CAAC;AAE7F;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,UAAU,CAAC;IAC1E,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,CAAC,EAAE,WAAW,EAAE,CAAC;IACjC,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,cAAc,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;CAC1C;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAChC;AAED;;;;GAIG;AACH,qBAAa,UAAU;IACT,OAAO,CAAC,KAAK;gBAAL,KAAK,EAAE,cAAc;IAEzC;;;;;OAKG;IACH,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC;IASpD;;;;;;OAMG;IACH,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC;IAY5E;;;;;OAKG;IACH,eAAe,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC;IAS9D;;;;;;OAMG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC;IA0B3E;;;;;OAKG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC;IASjD;;;;;OAKG;IACH,OAAO,CAAC,QAAQ,EAAE,aAAa,GAAG,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC;IA6D5D;;;;;;OAMG;IACH,SAAS,CACP,SAAS,EAAE,OAAO,GAAG,KAAK,GAAG,KAAK,EAClC,OAAO,EAAE,MAAM,GACd,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC;IAwCxC;;OAEG;IACH,OAAO,CAAC,WAAW;CAyBpB"}