ruvector 0.1.63 → 0.1.64

package/dist/core/cluster-wrapper.d.ts

@@ -0,0 +1,148 @@
+/**
+ * Cluster Wrapper - Distributed coordination for multi-agent systems
+ *
+ * Wraps @ruvector/cluster for Raft consensus, auto-sharding,
+ * and distributed memory across agents.
+ */
+export declare function isClusterAvailable(): boolean;
+export interface ClusterNode {
+    id: string;
+    address: string;
+    role: 'leader' | 'follower' | 'candidate';
+    status: 'healthy' | 'unhealthy' | 'unknown';
+    lastHeartbeat: number;
+}
+export interface ShardInfo {
+    id: number;
+    range: [number, number];
+    node: string;
+    size: number;
+    status: 'active' | 'migrating' | 'offline';
+}
+export interface ClusterConfig {
+    nodeId: string;
+    address: string;
+    peers?: string[];
+    shards?: number;
+    replicationFactor?: number;
+}
+/**
+ * Distributed cluster for multi-agent coordination
+ */
+export declare class RuvectorCluster {
+    private inner;
+    private nodeId;
+    private isLeader;
+    constructor(config: ClusterConfig);
+    /**
+     * Start the cluster node
+     */
+    start(): Promise<void>;
+    /**
+     * Stop the cluster node gracefully
+     */
+    stop(): Promise<void>;
+    /**
+     * Join an existing cluster
+     */
+    join(peerAddress: string): Promise<boolean>;
+    /**
+     * Leave the cluster
+     */
+    leave(): Promise<void>;
+    /**
+     * Get current node info
+     */
+    getNodeInfo(): ClusterNode;
+    /**
+     * Get all cluster nodes
+     */
+    getNodes(): ClusterNode[];
+    /**
+     * Check if this node is the leader
+     */
+    isClusterLeader(): boolean;
+    /**
+     * Get the current leader
+     */
+    getLeader(): ClusterNode | null;
+    /**
+     * Put a value in distributed storage
+     */
+    put(key: string, value: any): Promise<boolean>;
+    /**
+     * Get a value from distributed storage
+     */
+    get(key: string): Promise<any | null>;
+    /**
+     * Delete a value from distributed storage
+     */
+    delete(key: string): Promise<boolean>;
+    /**
+     * Atomic compare-and-swap
+     */
+    compareAndSwap(key: string, expected: any, newValue: any): Promise<boolean>;
+    /**
+     * Get shard information
+     */
+    getShards(): ShardInfo[];
+    /**
+     * Get the shard for a key
+     */
+    getShardForKey(key: string): ShardInfo;
+    /**
+     * Trigger shard rebalancing
+     */
+    rebalance(): Promise<void>;
+    /**
+     * Acquire a distributed lock
+     */
+    lock(name: string, timeout?: number): Promise<string | null>;
+    /**
+     * Release a distributed lock
+     */
+    unlock(name: string, token: string): Promise<boolean>;
+    /**
+     * Extend a lock's TTL
+     */
+    extendLock(name: string, token: string, extension?: number): Promise<boolean>;
+    /**
+     * Subscribe to a channel
+     */
+    subscribe(channel: string, callback: (message: any) => void): () => void;
+    /**
+     * Publish to a channel
+     */
+    publish(channel: string, message: any): Promise<number>;
+    /**
+     * Register an agent with the cluster
+     */
+    registerAgent(agentId: string, capabilities: string[]): Promise<boolean>;
+    /**
+     * Find agents with a capability
+     */
+    findAgents(capability: string): Promise<string[]>;
+    /**
+     * Assign a task to an agent
+     */
+    assignTask(taskId: string, agentId: string, task: any): Promise<boolean>;
+    /**
+     * Complete a task
+     */
+    completeTask(taskId: string, result: any): Promise<boolean>;
+    /**
+     * Get cluster statistics
+     */
+    stats(): {
+        nodes: number;
+        shards: number;
+        leader: string | null;
+        healthy: boolean;
+    };
+}
+/**
+ * Create a cluster node for agent coordination
+ */
+export declare function createCluster(config: ClusterConfig): RuvectorCluster;
+export default RuvectorCluster;
+//# sourceMappingURL=cluster-wrapper.d.ts.map

package/dist/core/cluster-wrapper.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster-wrapper.d.ts","sourceRoot":"","sources":["../../src/core/cluster-wrapper.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAqBH,wBAAgB,kBAAkB,IAAI,OAAO,CAO5C;AAED,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,QAAQ,GAAG,UAAU,GAAG,WAAW,CAAC;IAC1C,MAAM,EAAE,SAAS,GAAG,WAAW,GAAG,SAAS,CAAC;IAC5C,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,QAAQ,GAAG,WAAW,GAAG,SAAS,CAAC;CAC5C;AAED,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;GAEG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,KAAK,CAAM;IACnB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,QAAQ,CAAkB;gBAEtB,MAAM,EAAE,aAAa;IAgBjC;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAI5B;;OAEG;IACG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAI3B;;OAEG;IACG,IAAI,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAIjD;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAQ5B;;OAEG;IACH,WAAW,IAAI,WAAW;IAI1B;;OAEG;IACH,QAAQ,IAAI,WAAW,EAAE;IAIzB;;OAEG;IACH,eAAe,IAAI,OAAO;IAK1B;;OAEG;IACH,SAAS,IAAI,WAAW,GAAG,IAAI;IAQ/B;;OAEG;IACG,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC;IAIpD;;OAEG;IACG,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC;IAK3C;;OAEG;IACG,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAI3C;;OAEG;IACG,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC;IAYjF;;OAEG;IACH,SAAS,IAAI,SAAS,EAAE;IAIxB;;OAEG;IACH,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS;IAItC;;OAEG;IACG,SAAS,IAAI,OAAO,CAAC,IAAI,CAAC;IAQhC;;OAEG;IACG,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,GAAE,MAAc,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAIzE;;OAEG;IACG,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAI3D;;OAEG;IACG,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,GAAE,MAAc,GAAG,OAAO,CAAC,OAAO,CAAC;IAQ1F;;OAEG;IACH,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,OAAO,EAAE,GAAG,KAAK,IAAI,GAAG,MAAM,IAAI;IAMxE;;OAEG;IACG,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;IAQ7D;;OAEG;IACG,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC;IAS9E;;OAEG;IACG,UAAU,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAcvD;;OAEG;IACG,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC;IAgB9E;;OAEG;IACG,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC;IAgBjE;;OAEG;IACH,KAAK,IAAI;QACP,KAAK,EAAE,MAAM,CAAC;QACd,MAAM,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,OAAO,EAAE,OAAO,CAAC;KAClB;CAGF;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,aAAa,GAAG,eAAe,CAEpE;AAED,eAAe,eAAe,CAAC"}

package/dist/core/cluster-wrapper.js

@@ -0,0 +1,271 @@
+"use strict";
+/**
+ * Cluster Wrapper - Distributed coordination for multi-agent systems
+ *
+ * Wraps @ruvector/cluster for Raft consensus, auto-sharding,
+ * and distributed memory across agents.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RuvectorCluster = void 0;
+exports.isClusterAvailable = isClusterAvailable;
+exports.createCluster = createCluster;
+let clusterModule = null;
+let loadError = null;
+function getClusterModule() {
+    if (clusterModule)
+        return clusterModule;
+    if (loadError)
+        throw loadError;
+    try {
+        clusterModule = require('@ruvector/cluster');
+        return clusterModule;
+    }
+    catch (e) {
+        loadError = new Error(`@ruvector/cluster not installed: ${e.message}\n` +
+            `Install with: npm install @ruvector/cluster`);
+        throw loadError;
+    }
+}
+function isClusterAvailable() {
+    try {
+        getClusterModule();
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * Distributed cluster for multi-agent coordination
+ */
+class RuvectorCluster {
+    constructor(config) {
+        this.isLeader = false;
+        const cluster = getClusterModule();
+        this.nodeId = config.nodeId;
+        this.inner = new cluster.Cluster({
+            nodeId: config.nodeId,
+            address: config.address,
+            peers: config.peers ?? [],
+            shards: config.shards ?? 16,
+            replicationFactor: config.replicationFactor ?? 2,
+        });
+    }
+    // ===========================================================================
+    // Cluster Lifecycle
+    // ===========================================================================
+    /**
+     * Start the cluster node
+     */
+    async start() {
+        await this.inner.start();
+    }
+    /**
+     * Stop the cluster node gracefully
+     */
+    async stop() {
+        await this.inner.stop();
+    }
+    /**
+     * Join an existing cluster
+     */
+    async join(peerAddress) {
+        return this.inner.join(peerAddress);
+    }
+    /**
+     * Leave the cluster
+     */
+    async leave() {
+        await this.inner.leave();
+    }
+    // ===========================================================================
+    // Node Management
+    // ===========================================================================
+    /**
+     * Get current node info
+     */
+    getNodeInfo() {
+        return this.inner.getNodeInfo();
+    }
+    /**
+     * Get all cluster nodes
+     */
+    getNodes() {
+        return this.inner.getNodes();
+    }
+    /**
+     * Check if this node is the leader
+     */
+    isClusterLeader() {
+        this.isLeader = this.inner.isLeader();
+        return this.isLeader;
+    }
+    /**
+     * Get the current leader
+     */
+    getLeader() {
+        return this.inner.getLeader();
+    }
+    // ===========================================================================
+    // Distributed Operations
+    // ===========================================================================
+    /**
+     * Put a value in distributed storage
+     */
+    async put(key, value) {
+        return this.inner.put(key, JSON.stringify(value));
+    }
+    /**
+     * Get a value from distributed storage
+     */
+    async get(key) {
+        const result = await this.inner.get(key);
+        return result ? JSON.parse(result) : null;
+    }
+    /**
+     * Delete a value from distributed storage
+     */
+    async delete(key) {
+        return this.inner.delete(key);
+    }
+    /**
+     * Atomic compare-and-swap
+     */
+    async compareAndSwap(key, expected, newValue) {
+        return this.inner.compareAndSwap(key, JSON.stringify(expected), JSON.stringify(newValue));
+    }
+    // ===========================================================================
+    // Sharding
+    // ===========================================================================
+    /**
+     * Get shard information
+     */
+    getShards() {
+        return this.inner.getShards();
+    }
+    /**
+     * Get the shard for a key
+     */
+    getShardForKey(key) {
+        return this.inner.getShardForKey(key);
+    }
+    /**
+     * Trigger shard rebalancing
+     */
+    async rebalance() {
+        await this.inner.rebalance();
+    }
+    // ===========================================================================
+    // Distributed Locks
+    // ===========================================================================
+    /**
+     * Acquire a distributed lock
+     */
+    async lock(name, timeout = 30000) {
+        return this.inner.lock(name, timeout);
+    }
+    /**
+     * Release a distributed lock
+     */
+    async unlock(name, token) {
+        return this.inner.unlock(name, token);
+    }
+    /**
+     * Extend a lock's TTL
+     */
+    async extendLock(name, token, extension = 30000) {
+        return this.inner.extendLock(name, token, extension);
+    }
+    // ===========================================================================
+    // Pub/Sub
+    // ===========================================================================
+    /**
+     * Subscribe to a channel
+     */
+    subscribe(channel, callback) {
+        return this.inner.subscribe(channel, (msg) => {
+            callback(JSON.parse(msg));
+        });
+    }
+    /**
+     * Publish to a channel
+     */
+    async publish(channel, message) {
+        return this.inner.publish(channel, JSON.stringify(message));
+    }
+    // ===========================================================================
+    // Agent Coordination
+    // ===========================================================================
+    /**
+     * Register an agent with the cluster
+     */
+    async registerAgent(agentId, capabilities) {
+        return this.put(`agent:${agentId}`, {
+            id: agentId,
+            capabilities,
+            node: this.nodeId,
+            registeredAt: Date.now(),
+        });
+    }
+    /**
+     * Find agents with a capability
+     */
+    async findAgents(capability) {
+        const agents = await this.inner.scan('agent:*');
+        const matching = [];
+        for (const key of agents) {
+            const agent = await this.get(key);
+            if (agent?.capabilities?.includes(capability)) {
+                matching.push(agent.id);
+            }
+        }
+        return matching;
+    }
+    /**
+     * Assign a task to an agent
+     */
+    async assignTask(taskId, agentId, task) {
+        const assigned = await this.put(`task:${taskId}`, {
+            id: taskId,
+            agent: agentId,
+            task,
+            status: 'assigned',
+            assignedAt: Date.now(),
+        });
+        if (assigned) {
+            await this.publish(`agent:${agentId}:tasks`, { type: 'new_task', taskId });
+        }
+        return assigned;
+    }
+    /**
+     * Complete a task
+     */
+    async completeTask(taskId, result) {
+        const task = await this.get(`task:${taskId}`);
+        if (!task)
+            return false;
+        return this.put(`task:${taskId}`, {
+            ...task,
+            status: 'completed',
+            result,
+            completedAt: Date.now(),
+        });
+    }
+    // ===========================================================================
+    // Stats
+    // ===========================================================================
+    /**
+     * Get cluster statistics
+     */
+    stats() {
+        return this.inner.stats();
+    }
+}
+exports.RuvectorCluster = RuvectorCluster;
+/**
+ * Create a cluster node for agent coordination
+ */
+function createCluster(config) {
+    return new RuvectorCluster(config);
+}
+exports.default = RuvectorCluster;

package/dist/core/graph-wrapper.d.ts

@@ -0,0 +1,147 @@
+/**
+ * Graph Wrapper - Hypergraph database for code relationships
+ *
+ * Wraps @ruvector/graph-node for dependency analysis, co-edit patterns,
+ * and code structure understanding.
+ */
+export declare function isGraphAvailable(): boolean;
+export interface Node {
+    id: string;
+    labels: string[];
+    properties: Record<string, any>;
+}
+export interface Edge {
+    id?: string;
+    from: string;
+    to: string;
+    type: string;
+    properties?: Record<string, any>;
+}
+export interface Hyperedge {
+    id?: string;
+    nodes: string[];
+    type: string;
+    properties?: Record<string, any>;
+}
+export interface CypherResult {
+    columns: string[];
+    rows: any[][];
+}
+export interface PathResult {
+    nodes: Node[];
+    edges: Edge[];
+    length: number;
+}
+/**
+ * Graph Database for code relationships
+ */
+export declare class CodeGraph {
+    private inner;
+    private storagePath?;
+    constructor(options?: {
+        storagePath?: string;
+        inMemory?: boolean;
+    });
+    /**
+     * Create a node (file, function, class, etc.)
+     */
+    createNode(id: string, labels: string[], properties?: Record<string, any>): Node;
+    /**
+     * Get a node by ID
+     */
+    getNode(id: string): Node | null;
+    /**
+     * Update node properties
+     */
+    updateNode(id: string, properties: Record<string, any>): boolean;
+    /**
+     * Delete a node
+     */
+    deleteNode(id: string): boolean;
+    /**
+     * Find nodes by label
+     */
+    findNodesByLabel(label: string): Node[];
+    /**
+     * Create an edge (import, call, reference, etc.)
+     */
+    createEdge(from: string, to: string, type: string, properties?: Record<string, any>): Edge;
+    /**
+     * Get edges from a node
+     */
+    getOutgoingEdges(nodeId: string, type?: string): Edge[];
+    /**
+     * Get edges to a node
+     */
+    getIncomingEdges(nodeId: string, type?: string): Edge[];
+    /**
+     * Delete an edge
+     */
+    deleteEdge(edgeId: string): boolean;
+    /**
+     * Create a hyperedge connecting multiple nodes
+     */
+    createHyperedge(nodes: string[], type: string, properties?: Record<string, any>): Hyperedge;
+    /**
+     * Get hyperedges containing a node
+     */
+    getHyperedges(nodeId: string, type?: string): Hyperedge[];
+    /**
+     * Execute a Cypher query
+     */
+    cypher(query: string, params?: Record<string, any>): CypherResult;
+    /**
+     * Find shortest path between nodes
+     */
+    shortestPath(from: string, to: string, maxDepth?: number): PathResult | null;
+    /**
+     * Get all paths between nodes (up to maxPaths)
+     */
+    allPaths(from: string, to: string, maxDepth?: number, maxPaths?: number): PathResult[];
+    /**
+     * Get neighbors of a node
+     */
+    neighbors(nodeId: string, depth?: number): Node[];
+    /**
+     * Calculate PageRank for nodes
+     */
+    pageRank(iterations?: number, dampingFactor?: number): Map<string, number>;
+    /**
+     * Find connected components
+     */
+    connectedComponents(): string[][];
+    /**
+     * Detect communities (Louvain algorithm)
+     */
+    communities(): Map<string, number>;
+    /**
+     * Calculate betweenness centrality
+     */
+    betweennessCentrality(): Map<string, number>;
+    /**
+     * Save graph to storage
+     */
+    save(): void;
+    /**
+     * Load graph from storage
+     */
+    load(): void;
+    /**
+     * Clear all data
+     */
+    clear(): void;
+    /**
+     * Get graph statistics
+     */
+    stats(): {
+        nodes: number;
+        edges: number;
+        hyperedges: number;
+    };
+}
+/**
+ * Create a code dependency graph from file analysis
+ */
+export declare function createCodeDependencyGraph(storagePath?: string): CodeGraph;
+export default CodeGraph;
+//# sourceMappingURL=graph-wrapper.d.ts.map

package/dist/core/graph-wrapper.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-wrapper.d.ts","sourceRoot":"","sources":["../../src/core/graph-wrapper.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAqBH,wBAAgB,gBAAgB,IAAI,OAAO,CAO1C;AAED,MAAM,WAAW,IAAI;IACnB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CACjC;AAED,MAAM,WAAW,IAAI;IACnB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAClC;AAED,MAAM,WAAW,SAAS;IACxB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAClC;AAED,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;CACf;AAED,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,KAAK,CAAM;IACnB,OAAO,CAAC,WAAW,CAAC,CAAS;gBAEjB,OAAO,GAAE;QAAE,WAAW,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,OAAO,CAAA;KAAO;IAatE;;OAEG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,UAAU,GAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAM,GAAG,IAAI;IAKpF;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI;IAUhC;;OAEG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,OAAO;IAIhE;;OAEG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI/B;;OAEG;IACH,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,EAAE;IAavC;;OAEG;IACH,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,GAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAM,GAAG,IAAI;IAK9F;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,EAAE;IAWvD;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,EAAE;IAWvD;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAQnC;;OAEG;IACH,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,GAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAM,GAAG,SAAS;IAK/F;;OAEG;IACH,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,EAAE;IAczD;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,GAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAM,GAAG,YAAY;IAQrE;;OAEG;IACH,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAW,GAAG,UAAU,GAAG,IAAI;IAoBhF;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,EAAE,QAAQ,GAAE,MAAW,GAAG,UAAU,EAAE;IAmB7F;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,GAAE,MAAU,GAAG,IAAI,EAAE;IAapD;;OAEG;IACH,QAAQ,CAAC,UAAU,GAAE,MAAW,EAAE,aAAa,GAAE,MAAa,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAKpF;;OAEG;IACH,mBAAmB,IAAI,MAAM,EAAE,EAAE;IAIjC;;OAEG;IACH,WAAW,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAKlC;;OAEG;IACH,qBAAqB,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAS5C;;OAEG;IACH,IAAI,IAAI,IAAI;IAOZ;;OAEG;IACH,IAAI,IAAI,IAAI;IAOZ;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,KAAK,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE;CAG9D;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAEzE;AAED,eAAe,SAAS,CAAC"}

package/dist/core/graph-wrapper.js

@@ -0,0 +1,299 @@
+"use strict";
+/**
+ * Graph Wrapper - Hypergraph database for code relationships
+ *
+ * Wraps @ruvector/graph-node for dependency analysis, co-edit patterns,
+ * and code structure understanding.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CodeGraph = void 0;
+exports.isGraphAvailable = isGraphAvailable;
+exports.createCodeDependencyGraph = createCodeDependencyGraph;
+let graphModule = null;
+let loadError = null;
+function getGraphModule() {
+    if (graphModule)
+        return graphModule;
+    if (loadError)
+        throw loadError;
+    try {
+        graphModule = require('@ruvector/graph-node');
+        return graphModule;
+    }
+    catch (e) {
+        loadError = new Error(`@ruvector/graph-node not installed: ${e.message}\n` +
+            `Install with: npm install @ruvector/graph-node`);
+        throw loadError;
+    }
+}
+function isGraphAvailable() {
+    try {
+        getGraphModule();
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * Graph Database for code relationships
+ */
+class CodeGraph {
+    constructor(options = {}) {
+        const graph = getGraphModule();
+        this.storagePath = options.storagePath;
+        this.inner = new graph.GraphDatabase({
+            storagePath: options.storagePath,
+            inMemory: options.inMemory ?? true,
+        });
+    }
+    // ===========================================================================
+    // Node Operations
+    // ===========================================================================
+    /**
+     * Create a node (file, function, class, etc.)
+     */
+    createNode(id, labels, properties = {}) {
+        this.inner.createNode(id, labels, JSON.stringify(properties));
+        return { id, labels, properties };
+    }
+    /**
+     * Get a node by ID
+     */
+    getNode(id) {
+        const result = this.inner.getNode(id);
+        if (!result)
+            return null;
+        return {
+            id: result.id,
+            labels: result.labels,
+            properties: result.properties ? JSON.parse(result.properties) : {},
+        };
+    }
+    /**
+     * Update node properties
+     */
+    updateNode(id, properties) {
+        return this.inner.updateNode(id, JSON.stringify(properties));
+    }
+    /**
+     * Delete a node
+     */
+    deleteNode(id) {
+        return this.inner.deleteNode(id);
+    }
+    /**
+     * Find nodes by label
+     */
+    findNodesByLabel(label) {
+        const results = this.inner.findNodesByLabel(label);
+        return results.map((r) => ({
+            id: r.id,
+            labels: r.labels,
+            properties: r.properties ? JSON.parse(r.properties) : {},
+        }));
+    }
+    // ===========================================================================
+    // Edge Operations
+    // ===========================================================================
+    /**
+     * Create an edge (import, call, reference, etc.)
+     */
+    createEdge(from, to, type, properties = {}) {
+        const id = this.inner.createEdge(from, to, type, JSON.stringify(properties));
+        return { id, from, to, type, properties };
+    }
+    /**
+     * Get edges from a node
+     */
+    getOutgoingEdges(nodeId, type) {
+        const results = this.inner.getOutgoingEdges(nodeId, type);
+        return results.map((r) => ({
+            id: r.id,
+            from: r.from,
+            to: r.to,
+            type: r.type,
+            properties: r.properties ? JSON.parse(r.properties) : {},
+        }));
+    }
+    /**
+     * Get edges to a node
+     */
+    getIncomingEdges(nodeId, type) {
+        const results = this.inner.getIncomingEdges(nodeId, type);
+        return results.map((r) => ({
+            id: r.id,
+            from: r.from,
+            to: r.to,
+            type: r.type,
+            properties: r.properties ? JSON.parse(r.properties) : {},
+        }));
+    }
+    /**
+     * Delete an edge
+     */
+    deleteEdge(edgeId) {
+        return this.inner.deleteEdge(edgeId);
+    }
+    // ===========================================================================
+    // Hyperedge Operations (for co-edit patterns)
+    // ===========================================================================
+    /**
+     * Create a hyperedge connecting multiple nodes
+     */
+    createHyperedge(nodes, type, properties = {}) {
+        const id = this.inner.createHyperedge(nodes, type, JSON.stringify(properties));
+        return { id, nodes, type, properties };
+    }
+    /**
+     * Get hyperedges containing a node
+     */
+    getHyperedges(nodeId, type) {
+        const results = this.inner.getHyperedges(nodeId, type);
+        return results.map((r) => ({
+            id: r.id,
+            nodes: r.nodes,
+            type: r.type,
+            properties: r.properties ? JSON.parse(r.properties) : {},
+        }));
+    }
+    // ===========================================================================
+    // Query Operations
+    // ===========================================================================
+    /**
+     * Execute a Cypher query
+     */
+    cypher(query, params = {}) {
+        const result = this.inner.cypher(query, JSON.stringify(params));
+        return {
+            columns: result.columns,
+            rows: result.rows,
+        };
+    }
+    /**
+     * Find shortest path between nodes
+     */
+    shortestPath(from, to, maxDepth = 10) {
+        const result = this.inner.shortestPath(from, to, maxDepth);
+        if (!result)
+            return null;
+        return {
+            nodes: result.nodes.map((n) => ({
+                id: n.id,
+                labels: n.labels,
+                properties: n.properties ? JSON.parse(n.properties) : {},
+            })),
+            edges: result.edges.map((e) => ({
+                id: e.id,
+                from: e.from,
+                to: e.to,
+                type: e.type,
+                properties: e.properties ? JSON.parse(e.properties) : {},
+            })),
+            length: result.length,
+        };
+    }
+    /**
+     * Get all paths between nodes (up to maxPaths)
+     */
+    allPaths(from, to, maxDepth = 5, maxPaths = 10) {
+        const results = this.inner.allPaths(from, to, maxDepth, maxPaths);
+        return results.map((r) => ({
+            nodes: r.nodes.map((n) => ({
+                id: n.id,
+                labels: n.labels,
+                properties: n.properties ? JSON.parse(n.properties) : {},
+            })),
+            edges: r.edges.map((e) => ({
+                id: e.id,
+                from: e.from,
+                to: e.to,
+                type: e.type,
+                properties: e.properties ? JSON.parse(e.properties) : {},
+            })),
+            length: r.length,
+        }));
+    }
+    /**
+     * Get neighbors of a node
+     */
+    neighbors(nodeId, depth = 1) {
+        const results = this.inner.neighbors(nodeId, depth);
+        return results.map((n) => ({
+            id: n.id,
+            labels: n.labels,
+            properties: n.properties ? JSON.parse(n.properties) : {},
+        }));
+    }
+    // ===========================================================================
+    // Graph Algorithms
+    // ===========================================================================
+    /**
+     * Calculate PageRank for nodes
+     */
+    pageRank(iterations = 20, dampingFactor = 0.85) {
+        const result = this.inner.pageRank(iterations, dampingFactor);
+        return new Map(Object.entries(result));
+    }
+    /**
+     * Find connected components
+     */
+    connectedComponents() {
+        return this.inner.connectedComponents();
+    }
+    /**
+     * Detect communities (Louvain algorithm)
+     */
+    communities() {
+        const result = this.inner.communities();
+        return new Map(Object.entries(result));
+    }
+    /**
+     * Calculate betweenness centrality
+     */
+    betweennessCentrality() {
+        const result = this.inner.betweennessCentrality();
+        return new Map(Object.entries(result));
+    }
+    // ===========================================================================
+    // Persistence
+    // ===========================================================================
+    /**
+     * Save graph to storage
+     */
+    save() {
+        if (!this.storagePath) {
+            throw new Error('No storage path configured');
+        }
+        this.inner.save();
+    }
+    /**
+     * Load graph from storage
+     */
+    load() {
+        if (!this.storagePath) {
+            throw new Error('No storage path configured');
+        }
+        this.inner.load();
+    }
+    /**
+     * Clear all data
+     */
+    clear() {
+        this.inner.clear();
+    }
+    /**
+     * Get graph statistics
+     */
+    stats() {
+        return this.inner.stats();
+    }
+}
+exports.CodeGraph = CodeGraph;
+/**
+ * Create a code dependency graph from file analysis
+ */
+function createCodeDependencyGraph(storagePath) {
+    return new CodeGraph({ storagePath, inMemory: !storagePath });
+}
+exports.default = CodeGraph;

package/dist/core/index.d.ts

@@ -12,6 +12,9 @@ export * from './intelligence-engine';
 export * from './onnx-embedder';
 export * from './parallel-intelligence';
 export * from './parallel-workers';
+export * from './router-wrapper';
+export * from './graph-wrapper';
+export * from './cluster-wrapper';
 export { default as gnnWrapper } from './gnn-wrapper';
 export { default as attentionFallbacks } from './attention-fallbacks';
 export { default as agentdbFast } from './agentdb-fast';
@@ -20,4 +23,7 @@ export { default as IntelligenceEngine } from './intelligence-engine';
 export { default as OnnxEmbedder } from './onnx-embedder';
 export { default as ParallelIntelligence } from './parallel-intelligence';
 export { default as ExtendedWorkerPool } from './parallel-workers';
+export { default as SemanticRouter } from './router-wrapper';
+export { default as CodeGraph } from './graph-wrapper';
+export { default as RuvectorCluster } from './cluster-wrapper';
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,eAAe,CAAC;AAC9B,cAAc,uBAAuB,CAAC;AACtC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,uBAAuB,CAAC;AACtC,cAAc,iBAAiB,CAAC;AAChC,cAAc,yBAAyB,CAAC;AACxC,cAAc,oBAAoB,CAAC;AAGnC,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,EAAE,OAAO,IAAI,IAAI,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,EAAE,OAAO,IAAI,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC1D,OAAO,EAAE,OAAO,IAAI,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAC1E,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,oBAAoB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,eAAe,CAAC;AAC9B,cAAc,uBAAuB,CAAC;AACtC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,uBAAuB,CAAC;AACtC,cAAc,iBAAiB,CAAC;AAChC,cAAc,yBAAyB,CAAC;AACxC,cAAc,oBAAoB,CAAC;AACnC,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAGlC,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,EAAE,OAAO,IAAI,IAAI,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,EAAE,OAAO,IAAI,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC1D,OAAO,EAAE,OAAO,IAAI,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAC1E,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,EAAE,OAAO,IAAI,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAC7D,OAAO,EAAE,OAAO,IAAI,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,OAAO,IAAI,eAAe,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/core/index.js

@@ -23,7 +23,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.ExtendedWorkerPool = exports.ParallelIntelligence = exports.OnnxEmbedder = exports.IntelligenceEngine = exports.Sona = exports.agentdbFast = exports.attentionFallbacks = exports.gnnWrapper = void 0;
+exports.RuvectorCluster = exports.CodeGraph = exports.SemanticRouter = exports.ExtendedWorkerPool = exports.ParallelIntelligence = exports.OnnxEmbedder = exports.IntelligenceEngine = exports.Sona = exports.agentdbFast = exports.attentionFallbacks = exports.gnnWrapper = void 0;
 __exportStar(require("./gnn-wrapper"), exports);
 __exportStar(require("./attention-fallbacks"), exports);
 __exportStar(require("./agentdb-fast"), exports);
@@ -32,6 +32,9 @@ __exportStar(require("./intelligence-engine"), exports);
 __exportStar(require("./onnx-embedder"), exports);
 __exportStar(require("./parallel-intelligence"), exports);
 __exportStar(require("./parallel-workers"), exports);
+__exportStar(require("./router-wrapper"), exports);
+__exportStar(require("./graph-wrapper"), exports);
+__exportStar(require("./cluster-wrapper"), exports);
 // Re-export default objects for convenience
 var gnn_wrapper_1 = require("./gnn-wrapper");
 Object.defineProperty(exports, "gnnWrapper", { enumerable: true, get: function () { return __importDefault(gnn_wrapper_1).default; } });
@@ -49,3 +52,9 @@ var parallel_intelligence_1 = require("./parallel-intelligence");
 Object.defineProperty(exports, "ParallelIntelligence", { enumerable: true, get: function () { return __importDefault(parallel_intelligence_1).default; } });
 var parallel_workers_1 = require("./parallel-workers");
 Object.defineProperty(exports, "ExtendedWorkerPool", { enumerable: true, get: function () { return __importDefault(parallel_workers_1).default; } });
+var router_wrapper_1 = require("./router-wrapper");
+Object.defineProperty(exports, "SemanticRouter", { enumerable: true, get: function () { return __importDefault(router_wrapper_1).default; } });
+var graph_wrapper_1 = require("./graph-wrapper");
+Object.defineProperty(exports, "CodeGraph", { enumerable: true, get: function () { return __importDefault(graph_wrapper_1).default; } });
+var cluster_wrapper_1 = require("./cluster-wrapper");
+Object.defineProperty(exports, "RuvectorCluster", { enumerable: true, get: function () { return __importDefault(cluster_wrapper_1).default; } });

package/dist/core/router-wrapper.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Router Wrapper - Semantic router for AI agent intent matching
+ *
+ * Wraps @ruvector/router for vector-based intent classification.
+ * Perfect for hooks to route tasks to the right agent.
+ */
+export declare function isRouterAvailable(): boolean;
+export interface Route {
+    name: string;
+    utterances: string[];
+    metadata?: Record<string, any>;
+}
+export interface RouteMatch {
+    route: string;
+    score: number;
+    metadata?: Record<string, any>;
+}
+/**
+ * Semantic Router for agent task routing
+ */
+export declare class SemanticRouter {
+    private inner;
+    private routes;
+    constructor(options?: {
+        dimensions?: number;
+        threshold?: number;
+    });
+    /**
+     * Add a route with example utterances
+     */
+    addRoute(name: string, utterances: string[], metadata?: Record<string, any>): void;
+    /**
+     * Add multiple routes at once
+     */
+    addRoutes(routes: Route[]): void;
+    /**
+     * Match input to best route
+     */
+    match(input: string): RouteMatch | null;
+    /**
+     * Get top-k route matches
+     */
+    matchTopK(input: string, k?: number): RouteMatch[];
+    /**
+     * Get all registered routes
+     */
+    getRoutes(): Route[];
+    /**
+     * Remove a route
+     */
+    removeRoute(name: string): boolean;
+    /**
+     * Clear all routes
+     */
+    clear(): void;
+}
+/**
+ * Create a pre-configured agent router for hooks
+ */
+export declare function createAgentRouter(): SemanticRouter;
+export default SemanticRouter;
+//# sourceMappingURL=router-wrapper.d.ts.map

package/dist/core/router-wrapper.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"router-wrapper.d.ts","sourceRoot":"","sources":["../../src/core/router-wrapper.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAqBH,wBAAgB,iBAAiB,IAAI,OAAO,CAO3C;AAED,MAAM,WAAW,KAAK;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAChC;AAED,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAChC;AAED;;GAEG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,KAAK,CAAM;IACnB,OAAO,CAAC,MAAM,CAAiC;gBAEnC,OAAO,GAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAO;IAQrE;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI;IAKlF;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI;IAMhC;;OAEG;IACH,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI;IAWvC;;OAEG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,GAAE,MAAU,GAAG,UAAU,EAAE;IASrD;;OAEG;IACH,SAAS,IAAI,KAAK,EAAE;IAIpB;;OAEG;IACH,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAMlC;;OAEG;IACH,KAAK,IAAI,IAAI;CAId;AAED;;GAEG;AACH,wBAAgB,iBAAiB,IAAI,cAAc,CA8FlD;AAED,eAAe,cAAc,CAAC"}

package/dist/core/router-wrapper.js

@@ -0,0 +1,209 @@
+"use strict";
+/**
+ * Router Wrapper - Semantic router for AI agent intent matching
+ *
+ * Wraps @ruvector/router for vector-based intent classification.
+ * Perfect for hooks to route tasks to the right agent.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SemanticRouter = void 0;
+exports.isRouterAvailable = isRouterAvailable;
+exports.createAgentRouter = createAgentRouter;
+let routerModule = null;
+let loadError = null;
+function getRouterModule() {
+    if (routerModule)
+        return routerModule;
+    if (loadError)
+        throw loadError;
+    try {
+        routerModule = require('@ruvector/router');
+        return routerModule;
+    }
+    catch (e) {
+        loadError = new Error(`@ruvector/router not installed: ${e.message}\n` +
+            `Install with: npm install @ruvector/router`);
+        throw loadError;
+    }
+}
+function isRouterAvailable() {
+    try {
+        getRouterModule();
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * Semantic Router for agent task routing
+ */
+class SemanticRouter {
+    constructor(options = {}) {
+        this.routes = new Map();
+        const router = getRouterModule();
+        this.inner = new router.SemanticRouter({
+            dimensions: options.dimensions ?? 384,
+            threshold: options.threshold ?? 0.7,
+        });
+    }
+    /**
+     * Add a route with example utterances
+     */
+    addRoute(name, utterances, metadata) {
+        this.routes.set(name, { name, utterances, metadata });
+        this.inner.addRoute(name, utterances, metadata ? JSON.stringify(metadata) : undefined);
+    }
+    /**
+     * Add multiple routes at once
+     */
+    addRoutes(routes) {
+        for (const route of routes) {
+            this.addRoute(route.name, route.utterances, route.metadata);
+        }
+    }
+    /**
+     * Match input to best route
+     */
+    match(input) {
+        const result = this.inner.match(input);
+        if (!result)
+            return null;
+        return {
+            route: result.route,
+            score: result.score,
+            metadata: result.metadata ? JSON.parse(result.metadata) : undefined,
+        };
+    }
+    /**
+     * Get top-k route matches
+     */
+    matchTopK(input, k = 3) {
+        const results = this.inner.matchTopK(input, k);
+        return results.map((r) => ({
+            route: r.route,
+            score: r.score,
+            metadata: r.metadata ? JSON.parse(r.metadata) : undefined,
+        }));
+    }
+    /**
+     * Get all registered routes
+     */
+    getRoutes() {
+        return Array.from(this.routes.values());
+    }
+    /**
+     * Remove a route
+     */
+    removeRoute(name) {
+        if (!this.routes.has(name))
+            return false;
+        this.routes.delete(name);
+        return this.inner.removeRoute(name);
+    }
+    /**
+     * Clear all routes
+     */
+    clear() {
+        this.routes.clear();
+        this.inner.clear();
+    }
+}
+exports.SemanticRouter = SemanticRouter;
+/**
+ * Create a pre-configured agent router for hooks
+ */
+function createAgentRouter() {
+    const router = new SemanticRouter({ threshold: 0.6 });
+    // Add common agent routes
+    router.addRoutes([
+        {
+            name: 'coder',
+            utterances: [
+                'implement feature',
+                'write code',
+                'create function',
+                'add method',
+                'build component',
+                'fix bug',
+                'update implementation',
+            ],
+            metadata: { type: 'development' },
+        },
+        {
+            name: 'reviewer',
+            utterances: [
+                'review code',
+                'check quality',
+                'find issues',
+                'suggest improvements',
+                'analyze code',
+                'code review',
+            ],
+            metadata: { type: 'review' },
+        },
+        {
+            name: 'tester',
+            utterances: [
+                'write tests',
+                'add test cases',
+                'create unit tests',
+                'test coverage',
+                'integration tests',
+                'verify functionality',
+            ],
+            metadata: { type: 'testing' },
+        },
+        {
+            name: 'researcher',
+            utterances: [
+                'research topic',
+                'find information',
+                'explore options',
+                'investigate',
+                'analyze requirements',
+                'understand codebase',
+            ],
+            metadata: { type: 'research' },
+        },
+        {
+            name: 'architect',
+            utterances: [
+                'design system',
+                'architecture',
+                'structure project',
+                'plan implementation',
+                'design patterns',
+                'system design',
+            ],
+            metadata: { type: 'architecture' },
+        },
+        {
+            name: 'devops',
+            utterances: [
+                'deploy',
+                'ci/cd',
+                'docker',
+                'kubernetes',
+                'infrastructure',
+                'build pipeline',
+                'github actions',
+            ],
+            metadata: { type: 'devops' },
+        },
+        {
+            name: 'security',
+            utterances: [
+                'security audit',
+                'vulnerability',
+                'authentication',
+                'authorization',
+                'secure code',
+                'penetration test',
+            ],
+            metadata: { type: 'security' },
+        },
+    ]);
+    return router;
+}
+exports.default = SemanticRouter;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "ruvector",
-  "version": "0.1.63",
+  "version": "0.1.64",
   "description": "High-performance vector database for Node.js with automatic native/WASM fallback",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",