@claude-flow/plugin-hyperbolic-reasoning 3.0.0-alpha.1

package/dist/bridges/gnn-bridge.js

@@ -0,0 +1,423 @@
+/**
+ * GNN Bridge - Graph Neural Network Operations
+ *
+ * Bridge to @ruvector/gnn-wasm for graph-based reasoning,
+ * node classification, link prediction, and graph embeddings.
+ */
+/**
+ * Default GNN configuration
+ */
+const DEFAULT_GNN_CONFIG = {
+    inputDim: 128,
+    hiddenDim: 256,
+    outputDim: 128,
+    numLayers: 3,
+    aggregation: 'mean',
+    dropout: 0.1,
+};
+/**
+ * Graph Neural Network Bridge
+ */
+export class GnnBridge {
+    name = 'hyperbolic-gnn-bridge';
+    version = '0.1.0';
+    _status = 'unloaded';
+    _module = null;
+    _config;
+    constructor(config = {}) {
+        this._config = { ...DEFAULT_GNN_CONFIG, ...config };
+    }
+    get status() {
+        return this._status;
+    }
+    get initialized() {
+        return this._status === 'ready';
+    }
+    /**
+     * Initialize the WASM module
+     */
+    async initialize() {
+        if (this._status === 'ready')
+            return;
+        if (this._status === 'loading')
+            return;
+        this._status = 'loading';
+        try {
+            // Dynamic import - module may not be installed
+            const wasmModule = await import(/* webpackIgnore: true */ '@ruvector/gnn-wasm').catch(() => null);
+            if (wasmModule) {
+                this._module = wasmModule;
+            }
+            else {
+                this._module = this.createMockModule();
+            }
+            this._status = 'ready';
+        }
+        catch (error) {
+            this._status = 'error';
+            throw new Error(`Failed to initialize GnnBridge: ${error instanceof Error ? error.message : String(error)}`);
+        }
+    }
+    /**
+     * Dispose of resources
+     */
+    async dispose() {
+        this._module = null;
+        this._status = 'unloaded';
+    }
+    /**
+     * Forward pass through GNN
+     */
+    forward(graph, config = {}) {
+        if (!this._module) {
+            throw new Error('GnnBridge not initialized');
+        }
+        const mergedConfig = { ...this._config, ...config };
+        // Message passing layers
+        let embeddings = graph.nodeFeatures.map(f => new Float32Array(f));
+        for (let layer = 0; layer < mergedConfig.numLayers; layer++) {
+            const newEmbeddings = embeddings.map(emb => new Float32Array(mergedConfig.hiddenDim).fill(0));
+            // Aggregate neighbor messages
+            for (const [src, tgt] of graph.edges) {
+                const srcEmb = embeddings[src];
+                const weight = graph.edgeWeights?.[graph.edges.indexOf([src, tgt])] ?? 1;
+                if (srcEmb) {
+                    for (let i = 0; i < Math.min(srcEmb.length, mergedConfig.hiddenDim); i++) {
+                        newEmbeddings[tgt][i] += srcEmb[i] * weight;
+                    }
+                }
+            }
+            // Normalize based on aggregation type
+            const degrees = new Array(graph.nodeFeatures.length).fill(0);
+            for (const [, tgt] of graph.edges) {
+                degrees[tgt]++;
+            }
+            for (let i = 0; i < newEmbeddings.length; i++) {
+                if (mergedConfig.aggregation === 'mean' && degrees[i] > 0) {
+                    for (let j = 0; j < newEmbeddings[i].length; j++) {
+                        newEmbeddings[i][j] /= degrees[i];
+                    }
+                }
+                // Add self-loop
+                for (let j = 0; j < Math.min(embeddings[i].length, mergedConfig.hiddenDim); j++) {
+                    newEmbeddings[i][j] += embeddings[i][j];
+                }
+                // ReLU activation
+                for (let j = 0; j < newEmbeddings[i].length; j++) {
+                    newEmbeddings[i][j] = Math.max(0, newEmbeddings[i][j]);
+                }
+            }
+            embeddings = newEmbeddings;
+        }
+        // Compute graph-level embedding via readout
+        const graphEmbedding = new Float32Array(mergedConfig.outputDim).fill(0);
+        for (const emb of embeddings) {
+            for (let i = 0; i < Math.min(emb.length, mergedConfig.outputDim); i++) {
+                graphEmbedding[i] += emb[i] / embeddings.length;
+            }
+        }
+        return {
+            nodeEmbeddings: embeddings,
+            graphEmbedding,
+        };
+    }
+    /**
+     * Predict links between nodes
+     */
+    predictLinks(graph, sourceNodes, targetNodes) {
+        const result = this.forward(graph);
+        const predictions = new Float32Array(sourceNodes.length);
+        for (let i = 0; i < sourceNodes.length; i++) {
+            const srcEmb = result.nodeEmbeddings[sourceNodes[i]];
+            const tgtEmb = result.nodeEmbeddings[targetNodes[i]];
+            if (srcEmb && tgtEmb) {
+                // Dot product similarity
+                let dot = 0;
+                for (let j = 0; j < Math.min(srcEmb.length, tgtEmb.length); j++) {
+                    dot += srcEmb[j] * tgtEmb[j];
+                }
+                predictions[i] = 1 / (1 + Math.exp(-dot)); // Sigmoid
+            }
+        }
+        return predictions;
+    }
+    /**
+     * Build entailment graph from concepts using GNN
+     */
+    async buildEntailmentGraph(concepts, threshold = 0.7) {
+        // Create initial embeddings from concept text
+        const nodeFeatures = concepts.map(c => {
+            const emb = new Float32Array(this._config.inputDim);
+            // Simple text embedding via character hashing
+            for (let i = 0; i < c.text.length; i++) {
+                const idx = c.text.charCodeAt(i) % this._config.inputDim;
+                emb[idx] += 1;
+            }
+            // Normalize
+            const norm = Math.sqrt(emb.reduce((s, v) => s + v * v, 0));
+            for (let i = 0; i < emb.length; i++) {
+                emb[i] /= norm + 1e-10;
+            }
+            return emb;
+        });
+        // Initial fully connected graph for message passing
+        const edges = [];
+        for (let i = 0; i < concepts.length; i++) {
+            for (let j = 0; j < concepts.length; j++) {
+                if (i !== j) {
+                    edges.push([i, j]);
+                }
+            }
+        }
+        const graph = {
+            nodeFeatures,
+            edges,
+        };
+        // Get embeddings
+        const result = this.forward(graph);
+        // Predict entailment relations
+        const relations = [];
+        for (let i = 0; i < concepts.length; i++) {
+            for (let j = 0; j < concepts.length; j++) {
+                if (i === j)
+                    continue;
+                const srcEmb = result.nodeEmbeddings[i];
+                const tgtEmb = result.nodeEmbeddings[j];
+                // Asymmetric entailment score
+                const entailmentScore = this.computeEntailmentScore(srcEmb, tgtEmb);
+                if (entailmentScore.entailmentProb > threshold) {
+                    relations.push({
+                        premise: concepts[i].id,
+                        hypothesis: concepts[j].id,
+                        confidence: entailmentScore.entailmentProb,
+                        type: 'entails',
+                    });
+                }
+                else if (entailmentScore.contradictionProb > threshold) {
+                    relations.push({
+                        premise: concepts[i].id,
+                        hypothesis: concepts[j].id,
+                        confidence: entailmentScore.contradictionProb,
+                        type: 'contradicts',
+                    });
+                }
+            }
+        }
+        // Compute graph statistics
+        const nodeCount = concepts.length;
+        const edgeCount = relations.length;
+        const maxPossibleEdges = nodeCount * (nodeCount - 1);
+        const density = maxPossibleEdges > 0 ? edgeCount / maxPossibleEdges : 0;
+        // Compute max depth via BFS from each node
+        let maxDepth = 0;
+        for (const concept of concepts) {
+            const depth = this.computeMaxDepth(concept.id, relations, new Set());
+            maxDepth = Math.max(maxDepth, depth);
+        }
+        return {
+            concepts: concepts,
+            relations,
+            transitiveClosure: false,
+            stats: {
+                nodeCount,
+                edgeCount,
+                density,
+                maxDepth,
+            },
+        };
+    }
+    /**
+     * Predict entailment between two concepts
+     */
+    predictEntailment(premiseEmb, hypothesisEmb) {
+        const score = this.computeEntailmentScore(premiseEmb, hypothesisEmb);
+        let relation;
+        if (score.entailmentProb > score.contradictionProb && score.entailmentProb > score.neutralProb) {
+            relation = 'entails';
+        }
+        else if (score.contradictionProb > score.neutralProb) {
+            relation = 'contradicts';
+        }
+        else {
+            relation = 'neutral';
+        }
+        return {
+            premise: '',
+            hypothesis: '',
+            entailmentProb: score.entailmentProb,
+            contradictionProb: score.contradictionProb,
+            neutralProb: score.neutralProb,
+            relation,
+        };
+    }
+    /**
+     * Compute transitive closure of entailment graph
+     */
+    computeTransitiveClosure(graph) {
+        const relations = [...graph.relations];
+        const conceptIds = new Set(graph.concepts.map(c => c.id));
+        // Floyd-Warshall style transitive closure
+        let changed = true;
+        while (changed) {
+            changed = false;
+            for (const r1 of relations) {
+                for (const r2 of relations) {
+                    if (r1.hypothesis === r2.premise && r1.type === 'entails' && r2.type === 'entails') {
+                        // Check if transitive relation exists
+                        const exists = relations.some(r => r.premise === r1.premise && r.hypothesis === r2.hypothesis);
+                        if (!exists && conceptIds.has(r1.premise) && conceptIds.has(r2.hypothesis)) {
+                            relations.push({
+                                premise: r1.premise,
+                                hypothesis: r2.hypothesis,
+                                confidence: r1.confidence * r2.confidence,
+                                type: 'entails',
+                            });
+                            changed = true;
+                        }
+                    }
+                }
+            }
+        }
+        return {
+            ...graph,
+            relations,
+            transitiveClosure: true,
+            stats: {
+                ...graph.stats,
+                edgeCount: relations.length,
+                density: relations.length / (graph.concepts.length * (graph.concepts.length - 1)),
+            },
+        };
+    }
+    /**
+     * Prune entailment graph using transitive reduction
+     */
+    transitiveReduction(graph) {
+        const relations = [...graph.relations];
+        const toRemove = new Set();
+        // For each edge, check if it can be inferred transitively
+        for (let i = 0; i < relations.length; i++) {
+            const r = relations[i];
+            if (r.type !== 'entails')
+                continue;
+            // Check if there's an indirect path
+            const visited = new Set();
+            const hasIndirectPath = (current, target) => {
+                if (current === target)
+                    return true;
+                if (visited.has(current))
+                    return false;
+                visited.add(current);
+                for (let j = 0; j < relations.length; j++) {
+                    if (i === j)
+                        continue;
+                    const other = relations[j];
+                    if (other.type !== 'entails')
+                        continue;
+                    if (other.premise === current && other.hypothesis !== target) {
+                        if (hasIndirectPath(other.hypothesis, target)) {
+                            return true;
+                        }
+                    }
+                }
+                return false;
+            };
+            // Check if there's a path from premise to hypothesis not using this edge
+            visited.clear();
+            for (let j = 0; j < relations.length; j++) {
+                if (i === j)
+                    continue;
+                const other = relations[j];
+                if (other.type !== 'entails')
+                    continue;
+                if (other.premise === r.premise && hasIndirectPath(other.hypothesis, r.hypothesis)) {
+                    toRemove.add(i);
+                    break;
+                }
+            }
+        }
+        const prunedRelations = relations.filter((_, i) => !toRemove.has(i));
+        return {
+            ...graph,
+            relations: prunedRelations,
+            stats: {
+                ...graph.stats,
+                edgeCount: prunedRelations.length,
+                density: prunedRelations.length / (graph.concepts.length * (graph.concepts.length - 1)),
+            },
+        };
+    }
+    // ============================================================================
+    // Private Helper Methods
+    // ============================================================================
+    computeEntailmentScore(premiseEmb, hypothesisEmb) {
+        // Asymmetric entailment using inclusion heuristic
+        // Premise should "include" hypothesis for entailment
+        // Compute norms
+        const normP = Math.sqrt(premiseEmb.reduce((s, v) => s + v * v, 0));
+        const normH = Math.sqrt(hypothesisEmb.reduce((s, v) => s + v * v, 0));
+        // Dot product
+        let dot = 0;
+        for (let i = 0; i < Math.min(premiseEmb.length, hypothesisEmb.length); i++) {
+            dot += premiseEmb[i] * hypothesisEmb[i];
+        }
+        const cosine = dot / (normP * normH + 1e-10);
+        // Asymmetric features
+        const normRatio = normH / (normP + 1e-10);
+        // Difference features
+        let diffNorm = 0;
+        for (let i = 0; i < Math.min(premiseEmb.length, hypothesisEmb.length); i++) {
+            diffNorm += Math.pow(premiseEmb[i] - hypothesisEmb[i], 2);
+        }
+        diffNorm = Math.sqrt(diffNorm);
+        // Simple scoring model
+        const entailmentScore = (1 + cosine) / 2 * (1 - normRatio * 0.5);
+        const contradictionScore = (1 - cosine) / 2 * (diffNorm > 1 ? 0.8 : 0.2);
+        const neutralScore = 1 - entailmentScore - contradictionScore;
+        // Softmax normalization
+        const maxScore = Math.max(entailmentScore, contradictionScore, neutralScore);
+        const expE = Math.exp(entailmentScore - maxScore);
+        const expC = Math.exp(contradictionScore - maxScore);
+        const expN = Math.exp(neutralScore - maxScore);
+        const sumExp = expE + expC + expN;
+        return {
+            entailmentProb: expE / sumExp,
+            contradictionProb: expC / sumExp,
+            neutralProb: expN / sumExp,
+        };
+    }
+    computeMaxDepth(nodeId, relations, visited) {
+        if (visited.has(nodeId))
+            return 0;
+        visited.add(nodeId);
+        let maxChildDepth = 0;
+        for (const r of relations) {
+            if (r.premise === nodeId && r.type === 'entails') {
+                const childDepth = this.computeMaxDepth(r.hypothesis, relations, visited);
+                maxChildDepth = Math.max(maxChildDepth, childDepth + 1);
+            }
+        }
+        visited.delete(nodeId);
+        return maxChildDepth;
+    }
+    /**
+     * Create mock module for development
+     */
+    createMockModule() {
+        return {
+            forward: () => new Float32Array(0),
+            node_classification: () => new Float32Array(0),
+            link_prediction: () => new Float32Array(0),
+            alloc: () => 0,
+            dealloc: () => undefined,
+            memory: new WebAssembly.Memory({ initial: 1 }),
+        };
+    }
+}
+/**
+ * Create a new GnnBridge instance
+ */
+export function createGnnBridge(config) {
+    return new GnnBridge(config);
+}
+//# sourceMappingURL=gnn-bridge.js.map

package/dist/bridges/gnn-bridge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gnn-bridge.js","sourceRoot":"","sources":["../../src/bridges/gnn-bridge.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAkHH;;GAEG;AACH,MAAM,kBAAkB,GAAc;IACpC,QAAQ,EAAE,GAAG;IACb,SAAS,EAAE,GAAG;IACd,SAAS,EAAE,GAAG;IACd,SAAS,EAAE,CAAC;IACZ,WAAW,EAAE,MAAM;IACnB,OAAO,EAAE,GAAG;CACb,CAAC;AAEF;;GAEG;AACH,MAAM,OAAO,SAAS;IACX,IAAI,GAAG,uBAAuB,CAAC;IAC/B,OAAO,GAAG,OAAO,CAAC;IAEnB,OAAO,GAAqB,UAAU,CAAC;IACvC,OAAO,GAAyB,IAAI,CAAC;IACrC,OAAO,CAAY;IAE3B,YAAY,SAA6B,EAAE;QACzC,IAAI,CAAC,OAAO,GAAG,EAAE,GAAG,kBAAkB,EAAE,GAAG,MAAM,EAAE,CAAC;IACtD,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,OAAO,KAAK,OAAO,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,IAAI,CAAC,OAAO,KAAK,OAAO;YAAE,OAAO;QACrC,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;YAAE,OAAO;QAEvC,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;QAEzB,IAAI,CAAC;YACH,+CAA+C;YAC/C,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,yBAAyB,CAAC,oBAA8B,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YAE5G,IAAI,UAAU,EAAE,CAAC;gBACf,IAAI,CAAC,OAAO,GAAG,UAAsC,CAAC;YACxD,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACzC,CAAC;YAED,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACzB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,mCAAmC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC/G,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO;QACX,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,KAAY,EAAE,SAA6B,EAAE;QACnD,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;QAC/C,CAAC;QAED,MAAM,YAAY,GAAG,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,MAAM,EAAE,CAAC;QAEpD,yBAAyB;QACzB,IAAI,UAAU,GAAG,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAElE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,YAAY,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC;YAC5D,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAE9F,8BAA8B;YAC9B,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;gBAC/B,MAAM,MAAM,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAqB,CAAC,CAAC,IAAI,CAAC,CAAC;gBAE7F,IAAI,MAAM,EAAE,CAAC;oBACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBACzE,aAAa,CAAC,GAAG,CAAE,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAE,GAAG,MAAM,CAAC;oBAChD,CAAC;gBACH,CAAC;YACH,CAAC;YAED,sCAAsC;YACtC,MAAM,OAAO,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7D,KAAK,MAAM,CAAC,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAClC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACjB,CAAC;YAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,IAAI,YAAY,CAAC,WAAW,KAAK,MAAM,IAAI,OAAO,CAAC,CAAC,CAAE,GAAG,CAAC,EAAE,CAAC;oBAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,CAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAClD,aAAa,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAE,CAAC;oBACtC,CAAC;gBACH,CAAC;gBAED,gBAAgB;gBAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,MAAM,EAAE,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACjF,aAAa,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;gBAC7C,CAAC;gBAED,kBAAkB;gBAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,CAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClD,aAAa,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC,CAAC;gBAC5D,CAAC;YACH,CAAC;YAED,UAAU,GAAG,aAAa,CAAC;QAC7B,CAAC;QAED,4CAA4C;QAC5C,MAAM,cAAc,GAAG,IAAI,YAAY,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAExE,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtE,cAAc,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAE,GAAG,UAAU,CAAC,MAAM,CAAC;YACnD,CAAC;QACH,CAAC;QAED,OAAO;YACL,cAAc,EAAE,UAAU;YAC1B,cAAc;SACf,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,YAAY,CACV,KAAY,EACZ,WAAqB,EACrB,WAAqB;QAErB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,WAAW,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAEzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,CAAC;YAEtD,IAAI,MAAM,IAAI,MAAM,EAAE,CAAC;gBACrB,yBAAyB;gBACzB,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAChE,GAAG,IAAI,MAAM,CAAC,CAAC,CAAE,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;gBACjC,CAAC;gBACD,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;YACvD,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,oBAAoB,CACxB,QAAgC,EAChC,YAAoB,GAAG;QAEvB,8CAA8C;QAC9C,MAAM,YAAY,GAAmB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YACpD,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YACpD,8CAA8C;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;gBACzD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,CAAC;YACD,YAAY;YACZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC;YACzB,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC,CAAC,CAAC;QAEH,oDAAoD;QACpD,MAAM,KAAK,GAA4B,EAAE,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACZ,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAU;YACnB,YAAY;YACZ,KAAK;SACN,CAAC;QAEF,iBAAiB;QACjB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAEnC,+BAA+B;QAC/B,MAAM,SAAS,GAAyB,EAAE,CAAC;QAE3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,IAAI,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAEtB,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC,CAAE,CAAC;gBACzC,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC,CAAE,CAAC;gBAEzC,8BAA8B;gBAC9B,MAAM,eAAe,GAAG,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAEpE,IAAI,eAAe,CAAC,cAAc,GAAG,SAAS,EAAE,CAAC;oBAC/C,SAAS,CAAC,IAAI,CAAC;wBACb,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,EAAE;wBACxB,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,EAAE;wBAC3B,UAAU,EAAE,eAAe,CAAC,cAAc;wBAC1C,IAAI,EAAE,SAAS;qBAChB,CAAC,CAAC;gBACL,CAAC;qBAAM,IAAI,eAAe,CAAC,iBAAiB,GAAG,SAAS,EAAE,CAAC;oBACzD,SAAS,CAAC,IAAI,CAAC;wBACb,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,EAAE;wBACxB,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,EAAE;wBAC3B,UAAU,EAAE,eAAe,CAAC,iBAAiB;wBAC7C,IAAI,EAAE,aAAa;qBACpB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC;QAClC,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC;QACnC,MAAM,gBAAgB,GAAG,SAAS,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QACrD,MAAM,OAAO,GAAG,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QAExE,2CAA2C;QAC3C,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACrE,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACvC,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,QAAQ;YAClB,SAAS;YACT,iBAAiB,EAAE,KAAK;YACxB,KAAK,EAAE;gBACL,SAAS;gBACT,SAAS;gBACT,OAAO;gBACP,QAAQ;aACT;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,iBAAiB,CACf,UAAwB,EACxB,aAA2B;QAE3B,MAAM,KAAK,GAAG,IAAI,CAAC,sBAAsB,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;QAErE,IAAI,QAA+C,CAAC;QACpD,IAAI,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,iBAAiB,IAAI,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YAC/F,QAAQ,GAAG,SAAS,CAAC;QACvB,CAAC;aAAM,IAAI,KAAK,CAAC,iBAAiB,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YACvD,QAAQ,GAAG,aAAa,CAAC;QAC3B,CAAC;aAAM,CAAC;YACN,QAAQ,GAAG,SAAS,CAAC;QACvB,CAAC;QAED,OAAO;YACL,OAAO,EAAE,EAAE;YACX,UAAU,EAAE,EAAE;YACd,cAAc,EAAE,KAAK,CAAC,cAAc;YACpC,iBAAiB,EAAE,KAAK,CAAC,iBAAiB;YAC1C,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,QAAQ;SACT,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,wBAAwB,CAAC,KAAsB;QAC7C,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE1D,0CAA0C;QAC1C,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,OAAO,EAAE,CAAC;YACf,OAAO,GAAG,KAAK,CAAC;YAEhB,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC3B,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;oBAC3B,IAAI,EAAE,CAAC,UAAU,KAAK,EAAE,CAAC,OAAO,IAAI,EAAE,CAAC,IAAI,KAAK,SAAS,IAAI,EAAE,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;wBACnF,sCAAsC;wBACtC,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAC3B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,EAAE,CAAC,OAAO,IAAI,CAAC,CAAC,UAAU,KAAK,EAAE,CAAC,UAAU,CAChE,CAAC;wBAEF,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC;4BAC3E,SAAS,CAAC,IAAI,CAAC;gCACb,OAAO,EAAE,EAAE,CAAC,OAAO;gCACnB,UAAU,EAAE,EAAE,CAAC,UAAU;gCACzB,UAAU,EAAE,EAAE,CAAC,UAAU,GAAG,EAAE,CAAC,UAAU;gCACzC,IAAI,EAAE,SAAS;6BAChB,CAAC,CAAC;4BACH,OAAO,GAAG,IAAI,CAAC;wBACjB,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,GAAG,KAAK;YACR,SAAS;YACT,iBAAiB,EAAE,IAAI;YACvB,KAAK,EAAE;gBACL,GAAG,KAAK,CAAC,KAAK;gBACd,SAAS,EAAE,SAAS,CAAC,MAAM;gBAC3B,OAAO,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;aAClF;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,KAAsB;QACxC,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QAEnC,0DAA0D;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;YACxB,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS;gBAAE,SAAS;YAEnC,oCAAoC;YACpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;YAClC,MAAM,eAAe,GAAG,CAAC,OAAe,EAAE,MAAc,EAAW,EAAE;gBACnE,IAAI,OAAO,KAAK,MAAM;oBAAE,OAAO,IAAI,CAAC;gBACpC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACvC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,IAAI,CAAC,KAAK,CAAC;wBAAE,SAAS;oBACtB,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;oBAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;wBAAE,SAAS;oBACvC,IAAI,KAAK,CAAC,OAAO,KAAK,OAAO,IAAI,KAAK,CAAC,UAAU,KAAK,MAAM,EAAE,CAAC;wBAC7D,IAAI,eAAe,CAAC,KAAK,CAAC,UAAU,EAAE,MAAM,CAAC,EAAE,CAAC;4BAC9C,OAAO,IAAI,CAAC;wBACd,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC,CAAC;YAEF,yEAAyE;YACzE,OAAO,CAAC,KAAK,EAAE,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,IAAI,CAAC,KAAK,CAAC;oBAAE,SAAS;gBACtB,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;gBAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;oBAAE,SAAS;gBACvC,IAAI,KAAK,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,IAAI,eAAe,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC;oBACnF,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAChB,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAErE,OAAO;YACL,GAAG,KAAK;YACR,SAAS,EAAE,eAAe;YAC1B,KAAK,EAAE;gBACL,GAAG,KAAK,CAAC,KAAK;gBACd,SAAS,EAAE,eAAe,CAAC,MAAM;gBACjC,OAAO,EAAE,eAAe,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;aACxF;SACF,CAAC;IACJ,CAAC;IAED,+EAA+E;IAC/E,yBAAyB;IACzB,+EAA+E;IAEvE,sBAAsB,CAC5B,UAAwB,EACxB,aAA2B;QAE3B,kDAAkD;QAClD,qDAAqD;QAErD,gBAAgB;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEtE,cAAc;QACd,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3E,GAAG,IAAI,UAAU,CAAC,CAAC,CAAE,GAAG,aAAa,CAAC,CAAC,CAAE,CAAC;QAC5C,CAAC;QAED,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC;QAE7C,sBAAsB;QACtB,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QAE1C,sBAAsB;QACtB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3E,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAE,GAAG,aAAa,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAC;QAC9D,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAE/B,uBAAuB;QACvB,MAAM,eAAe,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,GAAG,GAAG,CAAC,CAAC;QACjE,MAAM,kBAAkB,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACzE,MAAM,YAAY,GAAG,CAAC,GAAG,eAAe,GAAG,kBAAkB,CAAC;QAE9D,wBAAwB;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,kBAAkB,EAAE,YAAY,CAAC,CAAC;QAC7E,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,GAAG,QAAQ,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,kBAAkB,GAAG,QAAQ,CAAC,CAAC;QACrD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,GAAG,QAAQ,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;QAElC,OAAO;YACL,cAAc,EAAE,IAAI,GAAG,MAAM;YAC7B,iBAAiB,EAAE,IAAI,GAAG,MAAM;YAChC,WAAW,EAAE,IAAI,GAAG,MAAM;SAC3B,CAAC;IACJ,CAAC;IAEO,eAAe,CACrB,MAAc,EACd,SAA4C,EAC5C,OAAoB;QAEpB,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,CAAC,CAAC;QAClC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,CAAC,OAAO,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBACjD,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,UAAU,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;gBAC1E,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;QAED,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACvB,OAAO,aAAa,CAAC;IACvB,CAAC;IAED;;OAEG;IACK,gBAAgB;QACtB,OAAO;YACL,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC;YAClC,mBAAmB,EAAE,GAAG,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC;YAC9C,eAAe,EAAE,GAAG,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC;YAC1C,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YACd,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;YACxB,MAAM,EAAE,IAAI,WAAW,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;SAC/C,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,MAA2B;IACzD,OAAO,IAAI,SAAS,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC"}

package/dist/bridges/hyperbolic-bridge.d.ts

@@ -0,0 +1,73 @@
+/**
+ * Hyperbolic Bridge - Poincare Ball and Lorentz Model Operations
+ *
+ * Bridge to @ruvector/hyperbolic-hnsw-wasm for hyperbolic geometry operations
+ * including embeddings, distance computation, and hierarchical search.
+ */
+import type { HyperbolicPoint, Hierarchy, EmbeddedHierarchy, SearchResult, EmbedHierarchyInput } from '../types.js';
+/**
+ * WASM module status
+ */
+export type WasmModuleStatus = 'unloaded' | 'loading' | 'ready' | 'error';
+/**
+ * Hyperbolic Embeddings Bridge
+ */
+export declare class HyperbolicBridge {
+    readonly name = "hyperbolic-reasoning-bridge";
+    readonly version = "0.1.0";
+    private _status;
+    private _module;
+    private _indices;
+    get status(): WasmModuleStatus;
+    get initialized(): boolean;
+    /**
+     * Initialize the WASM module
+     */
+    initialize(): Promise<void>;
+    /**
+     * Dispose of resources
+     */
+    dispose(): Promise<void>;
+    /**
+     * Embed a hierarchy into hyperbolic space
+     */
+    embedHierarchy(hierarchy: Hierarchy, config?: Partial<EmbedHierarchyInput['parameters']>): Promise<EmbeddedHierarchy>;
+    /**
+     * Compute hyperbolic distance between two points
+     */
+    distance(a: HyperbolicPoint, b: HyperbolicPoint): number;
+    /**
+     * Check if one point is ancestor of another (closer to origin)
+     */
+    isAncestor(parent: HyperbolicPoint, child: HyperbolicPoint, threshold?: number): boolean;
+    /**
+     * Get hierarchy depth from hyperbolic point
+     */
+    hierarchyDepth(point: HyperbolicPoint): number;
+    /**
+     * Create or get an index
+     */
+    createIndex(id: string, dimension: number, curvature: number): void;
+    /**
+     * Add point to index
+     */
+    addToIndex(indexId: string, nodeId: string, point: HyperbolicPoint): void;
+    /**
+     * Search in hyperbolic space
+     */
+    search(query: HyperbolicPoint, indexId: string, k: number, mode?: 'nearest' | 'subtree' | 'ancestors' | 'siblings' | 'cone'): Promise<SearchResult>;
+    private validateHierarchy;
+    private computeDistanceGradient;
+    private estimateCurvatureGradient;
+    private computeEmbeddingMetrics;
+    private inCone;
+    /**
+     * Create mock module for development
+     */
+    private createMockModule;
+}
+/**
+ * Create a new HyperbolicBridge instance
+ */
+export declare function createHyperbolicBridge(): HyperbolicBridge;
+//# sourceMappingURL=hyperbolic-bridge.d.ts.map

package/dist/bridges/hyperbolic-bridge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hyperbolic-bridge.d.ts","sourceRoot":"","sources":["../../src/bridges/hyperbolic-bridge.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EACV,eAAe,EAEf,SAAS,EAET,iBAAiB,EACjB,YAAY,EAEZ,mBAAmB,EACpB,MAAM,aAAa,CAAC;AAUrB;;GAEG;AACH,MAAM,MAAM,gBAAgB,GAAG,UAAU,GAAG,SAAS,GAAG,OAAO,GAAG,OAAO,CAAC;AAsD1E;;GAEG;AACH,qBAAa,gBAAgB;IAC3B,QAAQ,CAAC,IAAI,iCAAiC;IAC9C,QAAQ,CAAC,OAAO,WAAW;IAE3B,OAAO,CAAC,OAAO,CAAgC;IAC/C,OAAO,CAAC,OAAO,CAAqC;IACpD,OAAO,CAAC,QAAQ,CAA2C;IAE3D,IAAI,MAAM,IAAI,gBAAgB,CAE7B;IAED,IAAI,WAAW,IAAI,OAAO,CAEzB;IAED;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAuBjC;;OAEG;IACG,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;IAM9B;;OAEG;IACG,cAAc,CAClB,SAAS,EAAE,SAAS,EACpB,MAAM,GAAE,OAAO,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAM,GACtD,OAAO,CAAC,iBAAiB,CAAC;IAmI7B;;OAEG;IACH,QAAQ,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,eAAe,GAAG,MAAM;IAOxD;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,eAAe,EAAE,KAAK,EAAE,eAAe,EAAE,SAAS,SAAM,GAAG,OAAO;IAMrF;;OAEG;IACH,cAAc,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM;IAK9C;;OAEG;IACH,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAanE;;OAEG;IACH,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,GAAG,IAAI;IASzE;;OAEG;IACG,MAAM,CACV,KAAK,EAAE,eAAe,EACtB,OAAO,EAAE,MAAM,EACf,CAAC,EAAE,MAAM,EACT,IAAI,GAAE,SAAS,GAAG,SAAS,GAAG,WAAW,GAAG,UAAU,GAAG,MAAkB,GAC1E,OAAO,CAAC,YAAY,CAAC;IA+DxB,OAAO,CAAC,iBAAiB;IAkEzB,OAAO,CAAC,uBAAuB;IA0B/B,OAAO,CAAC,yBAAyB;IAwBjC,OAAO,CAAC,uBAAuB;IAoD/B,OAAO,CAAC,MAAM;IAcd;;OAEG;IACH,OAAO,CAAC,gBAAgB;CAqBzB;AAED;;GAEG;AACH,wBAAgB,sBAAsB,IAAI,gBAAgB,CAEzD"}