ruvector 0.1.62 → 0.1.64

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"}