@wiscale/velesdb-wasm 1.2.0 → 1.3.0

package/package.json

@@ -5,7 +5,7 @@
     "Julien Lange <contact@wiscale.fr>"
   ],
   "description": "VelesDB for WebAssembly - Vector search in the browser",
-  "version": "1.2.0",
+  "version": "1.3.0",
   "license": "SEE LICENSE IN ../../LICENSE",
   "repository": {
     "type": "git",

package/velesdb_wasm.d.ts

@@ -94,6 +94,10 @@ export class GraphNode {
 export class GraphStore {
   free(): void;
   [Symbol.dispose](): void;
+  /**
+   * Gets the degree (number of outgoing edges) of a node.
+   */
+  out_degree(node_id: bigint): number;
   /**
    * Removes an edge by ID.
    */
@@ -116,6 +120,20 @@ export class GraphStore {
    * Array of reachable node IDs with their depths.
    */
   bfs_traverse(source_id: bigint, max_depth: number, limit: number): any;
+  /**
+   * Performs DFS traversal from a source node.
+   *
+   * # Arguments
+   *
+   * * `source_id` - Starting node ID
+   * * `max_depth` - Maximum traversal depth
+   * * `limit` - Maximum number of results
+   *
+   * # Returns
+   *
+   * Array of reachable node IDs with their depths (depth-first order).
+   */
+  dfs_traverse(source_id: bigint, max_depth: number, limit: number): any;
   /**
    * Gets incoming edges to a node.
    */
@@ -128,6 +146,38 @@ export class GraphStore {
    * Gets neighbors reachable from a node (1-hop).
    */
   get_neighbors(node_id: bigint): BigUint64Array;
+  /**
+   * Gets all edge IDs in the graph.
+   */
+  get_all_edge_ids(): BigUint64Array;
+  /**
+   * Gets all node IDs in the graph.
+   */
+  get_all_node_ids(): BigUint64Array;
+  /**
+   * Gets all edges with a specific label.
+   *
+   * # Arguments
+   *
+   * * `label` - The relationship type to filter by
+   *
+   * # Returns
+   *
+   * Array of edges matching the label.
+   */
+  get_edges_by_label(label: string): GraphEdge[];
+  /**
+   * Gets all nodes with a specific label.
+   *
+   * # Arguments
+   *
+   * * `label` - The label to filter by
+   *
+   * # Returns
+   *
+   * Array of nodes matching the label.
+   */
+  get_nodes_by_label(label: string): GraphNode[];
   /**
    * Gets outgoing edges filtered by label.
    */
@@ -158,6 +208,18 @@ export class GraphStore {
    * Gets a node by ID.
    */
   get_node(id: bigint): GraphNode | undefined;
+  /**
+   * Checks if an edge exists.
+   */
+  has_edge(id: bigint): boolean;
+  /**
+   * Checks if a node exists.
+   */
+  has_node(id: bigint): boolean;
+  /**
+   * Gets the in-degree (number of incoming edges) of a node.
+   */
+  in_degree(node_id: bigint): number;
   /**
    * Returns the number of edges.
    */
@@ -190,49 +252,15 @@ export class VectorStore {
   free(): void;
   [Symbol.dispose](): void;
   /**
-   * Performs text search on payload fields.
-   *
-   * This is a simple substring-based search on payload text fields.
-   * For full BM25 text search, use the REST API backend.
-   *
-   * # Arguments
-   *
-   * * `query` - Text query to search for
-   * * `k` - Number of results
-   * * `field` - Optional field name to search in (default: searches all string fields)
-   *
-   * # Returns
-   *
-   * Array of results with matching payloads.
+   * Text search on payload fields (substring matching).
    */
   text_search(query: string, k: number, field?: string | null): any;
   /**
-   * Batch search for multiple vectors in parallel.
-   *
-   * # Arguments
-   *
-   * * `vectors` - Flat array of query vectors (concatenated)
-   * * `num_vectors` - Number of vectors
-   * * `k` - Results per query
-   *
-   * # Returns
-   *
-   * Array of arrays of (id, score) tuples.
+   * Batch search for multiple vectors. Returns [[[id, score], ...], ...].
    */
   batch_search(vectors: Float32Array, num_vectors: number, k: number): any;
   /**
-   * Inserts multiple vectors in a single batch operation.
-   *
-   * This is significantly faster than calling `insert()` multiple times
-   * because it pre-allocates memory and reduces per-call overhead.
-   *
-   * # Arguments
-   *
-   * * `batch` - JavaScript array of `[id, Float32Array]` pairs
-   *
-   * # Errors
-   *
-   * Returns an error if any vector dimension doesn't match store dimension.
+   * Batch insert. Input: `[[id, Float32Array], ...]`.
    */
   insert_batch(batch: any): void;
   /**
@@ -240,227 +268,63 @@ export class VectorStore {
    */
   memory_usage(): number;
   /**
-   * Performs hybrid search combining vector similarity and text search.
-   *
-   * Uses a simple weighted fusion of vector search and text search results.
-   *
-   * # Arguments
-   *
-   * * `query_vector` - Query vector for similarity search
-   * * `text_query` - Text query for payload search
-   * * `k` - Number of results to return
-   * * `vector_weight` - Weight for vector results (0.0-1.0, default 0.5)
-   *
-   * # Returns
-   *
-   * Array of fused results with id, score, and payload.
+   * Hybrid search (vector + text). `vector_weight` 0-1 (default 0.5).
    */
   hybrid_search(query_vector: Float32Array, text_query: string, k: number, vector_weight?: number | null): any;
   /**
-   * Creates a new vector store with specified storage mode for memory optimization.
-   *
-   * # Arguments
-   *
-   * * `dimension` - Vector dimension
-   * * `metric` - Distance metric
-   * * `mode` - Storage mode: "full", "sq8", or "binary"
-   *
-   * # Storage Modes
-   *
-   * - `full`: Best recall, 4 bytes/dimension
-   * - `sq8`: 4x compression, ~1% recall loss
-   * - `binary`: 32x compression, ~5-10% recall loss
-   *
-   * # Errors
-   *
-   * Returns an error if the metric or storage mode is unknown.
+   * Creates store with mode: full (4B/dim), sq8 (4x compression), binary (32x).
    */
   static new_with_mode(dimension: number, metric: string, mode: string): VectorStore;
   /**
-   * Creates a new vector store with pre-allocated capacity.
-   *
-   * This is more efficient when you know the approximate number of vectors
-   * you'll be inserting, as it avoids repeated memory allocations.
-   *
-   * # Arguments
-   *
-   * * `dimension` - Vector dimension
-   * * `metric` - Distance metric: "cosine", "euclidean", or "dot"
-   * * `capacity` - Number of vectors to pre-allocate space for
-   *
-   * # Errors
-   *
-   * Returns an error if the metric is not recognized.
+   * Creates store with pre-allocated capacity.
    */
   static with_capacity(dimension: number, metric: string, capacity: number): VectorStore;
   /**
-   * Deletes the `IndexedDB` database.
-   *
-   * Use this to clear all persisted data.
-   *
-   * # Arguments
-   *
-   * * `db_name` - Name of the `IndexedDB` database to delete
-   *
-   * # Errors
-   *
-   * Returns an error if the deletion fails.
+   * Deletes `IndexedDB` database.
    */
   static delete_database(db_name: string): Promise<void>;
   /**
-   * Exports the vector store to a binary format.
-   *
-   * The binary format contains:
-   * - Header: dimension (u32), metric (u8), count (u64)
-   * - For each vector: id (u64), data (f32 array)
-   *
-   * Use this to persist data to `IndexedDB` or `localStorage`.
-   *
-   * # Errors
-   *
-   * This function currently does not return errors but uses `Result`
-   * for future extensibility.
-   *
-   * # Performance
-   *
-   * Perf: Pre-allocates exact buffer size to avoid reallocations.
-   * Throughput: ~1600 MB/s on 10k vectors (768D)
+   * Exports to binary format for IndexedDB/localStorage.
    */
   export_to_bytes(): Uint8Array;
   /**
-   * Imports a vector store from binary format.
-   *
-   * Use this to restore data from `IndexedDB` or `localStorage`.
-   *
-   * # Errors
-   *
-   * Returns an error if:
-   * - The data is too short or corrupted
-   * - The magic number is invalid
-   * - The version is unsupported
-   * - The metric byte is invalid
+   * Imports from binary format.
    */
   static import_from_bytes(bytes: Uint8Array): VectorStore;
   /**
    * Creates a metadata-only store (no vectors, only payloads).
-   *
-   * Useful for storing auxiliary data without vector embeddings.
    */
   static new_metadata_only(): VectorStore;
   /**
-   * Performs multi-query search with result fusion.
-   *
-   * Executes searches for multiple query vectors and fuses results
-   * using the specified strategy.
-   *
-   * # Arguments
-   *
-   * * `vectors` - Array of query vectors (as flat array with dimension stride)
-   * * `num_vectors` - Number of vectors in the array
-   * * `k` - Number of results to return
-   * * `strategy` - Fusion strategy: "average", "maximum", "rrf"
-   * * `rrf_k` - RRF k parameter (only used when strategy = "rrf", default 60)
-   *
-   * # Returns
-   *
-   * Array of fused results with id and score.
+   * Similarity search with threshold. Operators: >, >=, <, <=, =, !=.
+   */
+  similarity_search(query: Float32Array, threshold: number, operator: string, k: number): any;
+  /**
+   * Multi-query search with fusion. Strategies: average, maximum, rrf.
    */
   multi_query_search(vectors: Float32Array, num_vectors: number, k: number, strategy: string, rrf_k?: number | null): any;
   /**
-   * Searches with metadata filtering.
-   *
-   * # Arguments
-   *
-   * * `query` - Query vector
-   * * `k` - Number of results
-   * * `filter` - JSON filter object (e.g., `{"condition": {"type": "eq", "field": "category", "value": "tech"}}`)
-   *
-   * # Returns
-   *
-   * Array of `[id, score, payload]` tuples sorted by relevance.
+   * Searches with metadata filtering. Returns [{id, score, payload}].
    */
   search_with_filter(query: Float32Array, k: number, filter: any): any;
   /**
-   * Inserts a vector with the given ID and optional JSON payload.
-   *
-   * # Arguments
-   *
-   * * `id` - Unique identifier for the vector
-   * * `vector` - `Float32Array` of the vector data
-   * * `payload` - Optional JSON payload (metadata)
-   *
-   * # Errors
-   *
-   * Returns an error if vector dimension doesn't match store dimension.
+   * Inserts a vector with ID and optional JSON payload.
    */
   insert_with_payload(id: bigint, vector: Float32Array, payload: any): void;
   /**
-   * Gets a vector by ID.
-   *
-   * # Arguments
-   *
-   * * `id` - The vector ID to retrieve
-   *
-   * # Returns
-   *
-   * An object with `id`, `vector`, and `payload` fields, or null if not found.
+   * Gets a vector by ID. Returns {id, vector, payload} or null.
    */
   get(id: bigint): any;
   /**
-   * Creates a new vector store with the specified dimension and distance metric.
-   *
-   * # Arguments
-   *
-   * * `dimension` - Vector dimension (e.g., 768 for BERT, 1536 for GPT)
-   * * `metric` - Distance metric: "cosine", "euclidean", or "dot"
-   *
-   * # Errors
-   *
-   * Returns an error if the metric is not recognized.
+   * Creates a new vector store. Metrics: cosine, euclidean, dot, hamming, jaccard.
    */
   constructor(dimension: number, metric: string);
   /**
-   * Loads a vector store from `IndexedDB`.
-   *
-   * This method restores all vectors from the browser's `IndexedDB`.
-   *
-   * # Arguments
-   *
-   * * `db_name` - Name of the `IndexedDB` database
-   *
-   * # Errors
-   *
-   * Returns an error if the database doesn't exist or is corrupted.
-   *
-   * # Example
-   *
-   * ```javascript
-   * const store = await VectorStore.load("my-vectors");
-   * console.log(store.len); // Number of restored vectors
-   * ```
+   * Loads from `IndexedDB`.
    */
   static load(db_name: string): Promise<VectorStore>;
   /**
-   * Saves the vector store to `IndexedDB`.
-   *
-   * This method persists all vectors to the browser's `IndexedDB`,
-   * enabling offline-first applications.
-   *
-   * # Arguments
-   *
-   * * `db_name` - Name of the `IndexedDB` database
-   *
-   * # Errors
-   *
-   * Returns an error if `IndexedDB` is not available or the save fails.
-   *
-   * # Example
-   *
-   * ```javascript
-   * const store = new VectorStore(768, "cosine");
-   * store.insert(1n, vector1);
-   * await store.save("my-vectors");
-   * ```
+   * Saves to `IndexedDB`.
    */
   save(db_name: string): Promise<void>;
   /**
@@ -469,15 +333,6 @@ export class VectorStore {
   clear(): void;
   /**
    * Inserts a vector with the given ID.
-   *
-   * # Arguments
-   *
-   * * `id` - Unique identifier for the vector
-   * * `vector` - `Float32Array` of the vector data
-   *
-   * # Errors
-   *
-   * Returns an error if vector dimension doesn't match store dimension.
    */
   insert(id: bigint, vector: Float32Array): void;
   /**
@@ -485,30 +340,11 @@ export class VectorStore {
    */
   remove(id: bigint): boolean;
   /**
-   * Searches for the k nearest neighbors to the query vector.
-   *
-   * # Arguments
-   *
-   * * `query` - Query vector as `Float32Array`
-   * * `k` - Number of results to return
-   *
-   * # Returns
-   *
-   * Array of [id, score] pairs sorted by relevance.
-   *
-   * # Errors
-   *
-   * Returns an error if query dimension doesn't match store dimension.
+   * k-NN search. Returns [[id, score], ...].
    */
   search(query: Float32Array, k: number): any;
   /**
-   * Pre-allocates memory for the specified number of additional vectors.
-   *
-   * Call this before bulk insertions to avoid repeated allocations.
-   *
-   * # Arguments
-   *
-   * * `additional` - Number of additional vectors to reserve space for
+   * Pre-allocates memory for additional vectors.
    */
   reserve(additional: number): void;
   /**
@@ -561,15 +397,24 @@ export interface InitOutput {
   readonly graphstore_add_node: (a: number, b: number) => void;
   readonly graphstore_bfs_traverse: (a: number, b: number, c: bigint, d: number, e: number) => void;
   readonly graphstore_clear: (a: number) => void;
+  readonly graphstore_dfs_traverse: (a: number, b: number, c: bigint, d: number, e: number) => void;
   readonly graphstore_edge_count: (a: number) => number;
+  readonly graphstore_get_all_edge_ids: (a: number, b: number) => void;
+  readonly graphstore_get_all_node_ids: (a: number, b: number) => void;
   readonly graphstore_get_edge: (a: number, b: bigint) => number;
+  readonly graphstore_get_edges_by_label: (a: number, b: number, c: number, d: number) => void;
   readonly graphstore_get_incoming: (a: number, b: number, c: bigint) => void;
   readonly graphstore_get_neighbors: (a: number, b: number, c: bigint) => void;
   readonly graphstore_get_node: (a: number, b: bigint) => number;
+  readonly graphstore_get_nodes_by_label: (a: number, b: number, c: number, d: number) => void;
   readonly graphstore_get_outgoing: (a: number, b: number, c: bigint) => void;
   readonly graphstore_get_outgoing_by_label: (a: number, b: number, c: bigint, d: number, e: number) => void;
+  readonly graphstore_has_edge: (a: number, b: bigint) => number;
+  readonly graphstore_has_node: (a: number, b: bigint) => number;
+  readonly graphstore_in_degree: (a: number, b: bigint) => number;
   readonly graphstore_new: () => number;
   readonly graphstore_node_count: (a: number) => number;
+  readonly graphstore_out_degree: (a: number, b: bigint) => number;
   readonly graphstore_remove_edge: (a: number, b: bigint) => void;
   readonly graphstore_remove_node: (a: number, b: bigint) => void;
   readonly vectorstore_batch_search: (a: number, b: number, c: number, d: number, e: number, f: number) => void;
@@ -597,15 +442,16 @@ export interface InitOutput {
   readonly vectorstore_save: (a: number, b: number, c: number) => number;
   readonly vectorstore_search: (a: number, b: number, c: number, d: number, e: number) => void;
   readonly vectorstore_search_with_filter: (a: number, b: number, c: number, d: number, e: number, f: number) => void;
+  readonly vectorstore_similarity_search: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number) => void;
   readonly vectorstore_storage_mode: (a: number, b: number) => void;
   readonly vectorstore_text_search: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => void;
   readonly vectorstore_with_capacity: (a: number, b: number, c: number, d: number, e: number) => void;
   readonly graphnode_id: (a: number) => bigint;
-  readonly __wasm_bindgen_func_elem_612: (a: number, b: number, c: number) => void;
-  readonly __wasm_bindgen_func_elem_611: (a: number, b: number) => void;
-  readonly __wasm_bindgen_func_elem_184: (a: number, b: number, c: number) => void;
-  readonly __wasm_bindgen_func_elem_183: (a: number, b: number) => void;
-  readonly __wasm_bindgen_func_elem_661: (a: number, b: number, c: number, d: number) => void;
+  readonly __wasm_bindgen_func_elem_198: (a: number, b: number, c: number) => void;
+  readonly __wasm_bindgen_func_elem_197: (a: number, b: number) => void;
+  readonly __wasm_bindgen_func_elem_640: (a: number, b: number, c: number) => void;
+  readonly __wasm_bindgen_func_elem_639: (a: number, b: number) => void;
+  readonly __wasm_bindgen_func_elem_689: (a: number, b: number, c: number, d: number) => void;
   readonly __wbindgen_export: (a: number, b: number) => number;
   readonly __wbindgen_export2: (a: number, b: number, c: number, d: number) => number;
   readonly __wbindgen_export3: (a: number) => void;

package/velesdb_wasm.js

@@ -280,16 +280,16 @@ if (!('encodeInto' in cachedTextEncoder)) {
 
 let WASM_VECTOR_LEN = 0;
 
-function __wasm_bindgen_func_elem_612(arg0, arg1, arg2) {
-    wasm.__wasm_bindgen_func_elem_612(arg0, arg1, addHeapObject(arg2));
+function __wasm_bindgen_func_elem_198(arg0, arg1, arg2) {
+    wasm.__wasm_bindgen_func_elem_198(arg0, arg1, addHeapObject(arg2));
 }
 
-function __wasm_bindgen_func_elem_184(arg0, arg1, arg2) {
-    wasm.__wasm_bindgen_func_elem_184(arg0, arg1, addHeapObject(arg2));
+function __wasm_bindgen_func_elem_640(arg0, arg1, arg2) {
+    wasm.__wasm_bindgen_func_elem_640(arg0, arg1, addHeapObject(arg2));
 }
 
-function __wasm_bindgen_func_elem_661(arg0, arg1, arg2, arg3) {
-    wasm.__wasm_bindgen_func_elem_661(arg0, arg1, addHeapObject(arg2), addHeapObject(arg3));
+function __wasm_bindgen_func_elem_689(arg0, arg1, arg2, arg3) {
+    wasm.__wasm_bindgen_func_elem_689(arg0, arg1, addHeapObject(arg2), addHeapObject(arg3));
 }
 
 const __wbindgen_enum_IdbTransactionMode = ["readonly", "readwrite", "versionchange", "readwriteflush", "cleanup"];
@@ -622,6 +622,15 @@ export class GraphStore {
         const ret = wasm.graphstore_node_count(this.__wbg_ptr);
         return ret >>> 0;
     }
+    /**
+     * Gets the degree (number of outgoing edges) of a node.
+     * @param {bigint} node_id
+     * @returns {number}
+     */
+    out_degree(node_id) {
+        const ret = wasm.graphstore_out_degree(this.__wbg_ptr, node_id);
+        return ret >>> 0;
+    }
     /**
      * Removes an edge by ID.
      * @param {bigint} edge_id
@@ -668,6 +677,38 @@ export class GraphStore {
             wasm.__wbindgen_add_to_stack_pointer(16);
         }
     }
+    /**
+     * Performs DFS traversal from a source node.
+     *
+     * # Arguments
+     *
+     * * `source_id` - Starting node ID
+     * * `max_depth` - Maximum traversal depth
+     * * `limit` - Maximum number of results
+     *
+     * # Returns
+     *
+     * Array of reachable node IDs with their depths (depth-first order).
+     * @param {bigint} source_id
+     * @param {number} max_depth
+     * @param {number} limit
+     * @returns {any}
+     */
+    dfs_traverse(source_id, max_depth, limit) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.graphstore_dfs_traverse(retptr, this.__wbg_ptr, source_id, max_depth, limit);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            if (r2) {
+                throw takeObject(r1);
+            }
+            return takeObject(r0);
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
     /**
      * Gets incoming edges to a node.
      * @param {bigint} node_id
@@ -722,6 +763,96 @@ export class GraphStore {
             wasm.__wbindgen_add_to_stack_pointer(16);
         }
     }
+    /**
+     * Gets all edge IDs in the graph.
+     * @returns {BigUint64Array}
+     */
+    get_all_edge_ids() {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.graphstore_get_all_edge_ids(retptr, this.__wbg_ptr);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var v1 = getArrayU64FromWasm0(r0, r1).slice();
+            wasm.__wbindgen_export4(r0, r1 * 8, 8);
+            return v1;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * Gets all node IDs in the graph.
+     * @returns {BigUint64Array}
+     */
+    get_all_node_ids() {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.graphstore_get_all_node_ids(retptr, this.__wbg_ptr);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var v1 = getArrayU64FromWasm0(r0, r1).slice();
+            wasm.__wbindgen_export4(r0, r1 * 8, 8);
+            return v1;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * Gets all edges with a specific label.
+     *
+     * # Arguments
+     *
+     * * `label` - The relationship type to filter by
+     *
+     * # Returns
+     *
+     * Array of edges matching the label.
+     * @param {string} label
+     * @returns {GraphEdge[]}
+     */
+    get_edges_by_label(label) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            const ptr0 = passStringToWasm0(label, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            const len0 = WASM_VECTOR_LEN;
+            wasm.graphstore_get_edges_by_label(retptr, this.__wbg_ptr, ptr0, len0);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var v2 = getArrayJsValueFromWasm0(r0, r1).slice();
+            wasm.__wbindgen_export4(r0, r1 * 4, 4);
+            return v2;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * Gets all nodes with a specific label.
+     *
+     * # Arguments
+     *
+     * * `label` - The label to filter by
+     *
+     * # Returns
+     *
+     * Array of nodes matching the label.
+     * @param {string} label
+     * @returns {GraphNode[]}
+     */
+    get_nodes_by_label(label) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            const ptr0 = passStringToWasm0(label, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            const len0 = WASM_VECTOR_LEN;
+            wasm.graphstore_get_nodes_by_label(retptr, this.__wbg_ptr, ptr0, len0);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var v2 = getArrayJsValueFromWasm0(r0, r1).slice();
+            wasm.__wbindgen_export4(r0, r1 * 4, 4);
+            return v2;
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
     /**
      * Gets outgoing edges filtered by label.
      * @param {bigint} node_id
@@ -806,6 +937,33 @@ export class GraphStore {
         const ret = wasm.graphstore_get_node(this.__wbg_ptr, id);
         return ret === 0 ? undefined : GraphNode.__wrap(ret);
     }
+    /**
+     * Checks if an edge exists.
+     * @param {bigint} id
+     * @returns {boolean}
+     */
+    has_edge(id) {
+        const ret = wasm.graphstore_has_edge(this.__wbg_ptr, id);
+        return ret !== 0;
+    }
+    /**
+     * Checks if a node exists.
+     * @param {bigint} id
+     * @returns {boolean}
+     */
+    has_node(id) {
+        const ret = wasm.graphstore_has_node(this.__wbg_ptr, id);
+        return ret !== 0;
+    }
+    /**
+     * Gets the in-degree (number of incoming edges) of a node.
+     * @param {bigint} node_id
+     * @returns {number}
+     */
+    in_degree(node_id) {
+        const ret = wasm.graphstore_in_degree(this.__wbg_ptr, node_id);
+        return ret >>> 0;
+    }
 }
 if (Symbol.dispose) GraphStore.prototype[Symbol.dispose] = GraphStore.prototype.free;
 
@@ -862,20 +1020,7 @@ export class VectorStore {
         wasm.__wbg_vectorstore_free(ptr, 0);
     }
     /**
-     * Performs text search on payload fields.
-     *
-     * This is a simple substring-based search on payload text fields.
-     * For full BM25 text search, use the REST API backend.
-     *
-     * # Arguments
-     *
-     * * `query` - Text query to search for
-     * * `k` - Number of results
-     * * `field` - Optional field name to search in (default: searches all string fields)
-     *
-     * # Returns
-     *
-     * Array of results with matching payloads.
+     * Text search on payload fields (substring matching).
      * @param {string} query
      * @param {number} k
      * @param {string | null} [field]
@@ -901,17 +1046,7 @@ export class VectorStore {
         }
     }
     /**
-     * Batch search for multiple vectors in parallel.
-     *
-     * # Arguments
-     *
-     * * `vectors` - Flat array of query vectors (concatenated)
-     * * `num_vectors` - Number of vectors
-     * * `k` - Results per query
-     *
-     * # Returns
-     *
-     * Array of arrays of (id, score) tuples.
+     * Batch search for multiple vectors. Returns [[[id, score], ...], ...].
      * @param {Float32Array} vectors
      * @param {number} num_vectors
      * @param {number} k
@@ -935,18 +1070,7 @@ export class VectorStore {
         }
     }
     /**
-     * Inserts multiple vectors in a single batch operation.
-     *
-     * This is significantly faster than calling `insert()` multiple times
-     * because it pre-allocates memory and reduces per-call overhead.
-     *
-     * # Arguments
-     *
-     * * `batch` - JavaScript array of `[id, Float32Array]` pairs
-     *
-     * # Errors
-     *
-     * Returns an error if any vector dimension doesn't match store dimension.
+     * Batch insert. Input: `[[id, Float32Array], ...]`.
      * @param {any} batch
      */
     insert_batch(batch) {
@@ -991,20 +1115,7 @@ export class VectorStore {
         }
     }
     /**
-     * Performs hybrid search combining vector similarity and text search.
-     *
-     * Uses a simple weighted fusion of vector search and text search results.
-     *
-     * # Arguments
-     *
-     * * `query_vector` - Query vector for similarity search
-     * * `text_query` - Text query for payload search
-     * * `k` - Number of results to return
-     * * `vector_weight` - Weight for vector results (0.0-1.0, default 0.5)
-     *
-     * # Returns
-     *
-     * Array of fused results with id, score, and payload.
+     * Hybrid search (vector + text). `vector_weight` 0-1 (default 0.5).
      * @param {Float32Array} query_vector
      * @param {string} text_query
      * @param {number} k
@@ -1031,23 +1142,7 @@ export class VectorStore {
         }
     }
     /**
-     * Creates a new vector store with specified storage mode for memory optimization.
-     *
-     * # Arguments
-     *
-     * * `dimension` - Vector dimension
-     * * `metric` - Distance metric
-     * * `mode` - Storage mode: "full", "sq8", or "binary"
-     *
-     * # Storage Modes
-     *
-     * - `full`: Best recall, 4 bytes/dimension
-     * - `sq8`: 4x compression, ~1% recall loss
-     * - `binary`: 32x compression, ~5-10% recall loss
-     *
-     * # Errors
-     *
-     * Returns an error if the metric or storage mode is unknown.
+     * Creates store with mode: full (4B/dim), sq8 (4x compression), binary (32x).
      * @param {number} dimension
      * @param {string} metric
      * @param {string} mode
@@ -1073,20 +1168,7 @@ export class VectorStore {
         }
     }
     /**
-     * Creates a new vector store with pre-allocated capacity.
-     *
-     * This is more efficient when you know the approximate number of vectors
-     * you'll be inserting, as it avoids repeated memory allocations.
-     *
-     * # Arguments
-     *
-     * * `dimension` - Vector dimension
-     * * `metric` - Distance metric: "cosine", "euclidean", or "dot"
-     * * `capacity` - Number of vectors to pre-allocate space for
-     *
-     * # Errors
-     *
-     * Returns an error if the metric is not recognized.
+     * Creates store with pre-allocated capacity.
      * @param {number} dimension
      * @param {string} metric
      * @param {number} capacity
@@ -1110,17 +1192,7 @@ export class VectorStore {
         }
     }
     /**
-     * Deletes the `IndexedDB` database.
-     *
-     * Use this to clear all persisted data.
-     *
-     * # Arguments
-     *
-     * * `db_name` - Name of the `IndexedDB` database to delete
-     *
-     * # Errors
-     *
-     * Returns an error if the deletion fails.
+     * Deletes `IndexedDB` database.
      * @param {string} db_name
      * @returns {Promise<void>}
      */
@@ -1131,23 +1203,7 @@ export class VectorStore {
         return takeObject(ret);
     }
     /**
-     * Exports the vector store to a binary format.
-     *
-     * The binary format contains:
-     * - Header: dimension (u32), metric (u8), count (u64)
-     * - For each vector: id (u64), data (f32 array)
-     *
-     * Use this to persist data to `IndexedDB` or `localStorage`.
-     *
-     * # Errors
-     *
-     * This function currently does not return errors but uses `Result`
-     * for future extensibility.
-     *
-     * # Performance
-     *
-     * Perf: Pre-allocates exact buffer size to avoid reallocations.
-     * Throughput: ~1600 MB/s on 10k vectors (768D)
+     * Exports to binary format for IndexedDB/localStorage.
      * @returns {Uint8Array}
      */
     export_to_bytes() {
@@ -1177,17 +1233,7 @@ export class VectorStore {
         return ret !== 0;
     }
     /**
-     * Imports a vector store from binary format.
-     *
-     * Use this to restore data from `IndexedDB` or `localStorage`.
-     *
-     * # Errors
-     *
-     * Returns an error if:
-     * - The data is too short or corrupted
-     * - The magic number is invalid
-     * - The version is unsupported
-     * - The metric byte is invalid
+     * Imports from binary format.
      * @param {Uint8Array} bytes
      * @returns {VectorStore}
      */
@@ -1210,8 +1256,6 @@ export class VectorStore {
     }
     /**
      * Creates a metadata-only store (no vectors, only payloads).
-     *
-     * Useful for storing auxiliary data without vector embeddings.
      * @returns {VectorStore}
      */
     static new_metadata_only() {
@@ -1219,22 +1263,34 @@ export class VectorStore {
         return VectorStore.__wrap(ret);
     }
     /**
-     * Performs multi-query search with result fusion.
-     *
-     * Executes searches for multiple query vectors and fuses results
-     * using the specified strategy.
-     *
-     * # Arguments
-     *
-     * * `vectors` - Array of query vectors (as flat array with dimension stride)
-     * * `num_vectors` - Number of vectors in the array
-     * * `k` - Number of results to return
-     * * `strategy` - Fusion strategy: "average", "maximum", "rrf"
-     * * `rrf_k` - RRF k parameter (only used when strategy = "rrf", default 60)
-     *
-     * # Returns
-     *
-     * Array of fused results with id and score.
+     * Similarity search with threshold. Operators: >, >=, <, <=, =, !=.
+     * @param {Float32Array} query
+     * @param {number} threshold
+     * @param {string} operator
+     * @param {number} k
+     * @returns {any}
+     */
+    similarity_search(query, threshold, operator, k) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            const ptr0 = passArrayF32ToWasm0(query, wasm.__wbindgen_export);
+            const len0 = WASM_VECTOR_LEN;
+            const ptr1 = passStringToWasm0(operator, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            const len1 = WASM_VECTOR_LEN;
+            wasm.vectorstore_similarity_search(retptr, this.__wbg_ptr, ptr0, len0, threshold, ptr1, len1, k);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            if (r2) {
+                throw takeObject(r1);
+            }
+            return takeObject(r0);
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * Multi-query search with fusion. Strategies: average, maximum, rrf.
      * @param {Float32Array} vectors
      * @param {number} num_vectors
      * @param {number} k
@@ -1262,17 +1318,7 @@ export class VectorStore {
         }
     }
     /**
-     * Searches with metadata filtering.
-     *
-     * # Arguments
-     *
-     * * `query` - Query vector
-     * * `k` - Number of results
-     * * `filter` - JSON filter object (e.g., `{"condition": {"type": "eq", "field": "category", "value": "tech"}}`)
-     *
-     * # Returns
-     *
-     * Array of `[id, score, payload]` tuples sorted by relevance.
+     * Searches with metadata filtering. Returns [{id, score, payload}].
      * @param {Float32Array} query
      * @param {number} k
      * @param {any} filter
@@ -1296,17 +1342,7 @@ export class VectorStore {
         }
     }
     /**
-     * Inserts a vector with the given ID and optional JSON payload.
-     *
-     * # Arguments
-     *
-     * * `id` - Unique identifier for the vector
-     * * `vector` - `Float32Array` of the vector data
-     * * `payload` - Optional JSON payload (metadata)
-     *
-     * # Errors
-     *
-     * Returns an error if vector dimension doesn't match store dimension.
+     * Inserts a vector with ID and optional JSON payload.
      * @param {bigint} id
      * @param {Float32Array} vector
      * @param {any} payload
@@ -1327,15 +1363,7 @@ export class VectorStore {
         }
     }
     /**
-     * Gets a vector by ID.
-     *
-     * # Arguments
-     *
-     * * `id` - The vector ID to retrieve
-     *
-     * # Returns
-     *
-     * An object with `id`, `vector`, and `payload` fields, or null if not found.
+     * Gets a vector by ID. Returns {id, vector, payload} or null.
      * @param {bigint} id
      * @returns {any}
      */
@@ -1363,16 +1391,7 @@ export class VectorStore {
         return ret >>> 0;
     }
     /**
-     * Creates a new vector store with the specified dimension and distance metric.
-     *
-     * # Arguments
-     *
-     * * `dimension` - Vector dimension (e.g., 768 for BERT, 1536 for GPT)
-     * * `metric` - Distance metric: "cosine", "euclidean", or "dot"
-     *
-     * # Errors
-     *
-     * Returns an error if the metric is not recognized.
+     * Creates a new vector store. Metrics: cosine, euclidean, dot, hamming, jaccard.
      * @param {number} dimension
      * @param {string} metric
      */
@@ -1396,24 +1415,7 @@ export class VectorStore {
         }
     }
     /**
-     * Loads a vector store from `IndexedDB`.
-     *
-     * This method restores all vectors from the browser's `IndexedDB`.
-     *
-     * # Arguments
-     *
-     * * `db_name` - Name of the `IndexedDB` database
-     *
-     * # Errors
-     *
-     * Returns an error if the database doesn't exist or is corrupted.
-     *
-     * # Example
-     *
-     * ```javascript
-     * const store = await VectorStore.load("my-vectors");
-     * console.log(store.len); // Number of restored vectors
-     * ```
+     * Loads from `IndexedDB`.
      * @param {string} db_name
      * @returns {Promise<VectorStore>}
      */
@@ -1424,26 +1426,7 @@ export class VectorStore {
         return takeObject(ret);
     }
     /**
-     * Saves the vector store to `IndexedDB`.
-     *
-     * This method persists all vectors to the browser's `IndexedDB`,
-     * enabling offline-first applications.
-     *
-     * # Arguments
-     *
-     * * `db_name` - Name of the `IndexedDB` database
-     *
-     * # Errors
-     *
-     * Returns an error if `IndexedDB` is not available or the save fails.
-     *
-     * # Example
-     *
-     * ```javascript
-     * const store = new VectorStore(768, "cosine");
-     * store.insert(1n, vector1);
-     * await store.save("my-vectors");
-     * ```
+     * Saves to `IndexedDB`.
      * @param {string} db_name
      * @returns {Promise<void>}
      */
@@ -1461,15 +1444,6 @@ export class VectorStore {
     }
     /**
      * Inserts a vector with the given ID.
-     *
-     * # Arguments
-     *
-     * * `id` - Unique identifier for the vector
-     * * `vector` - `Float32Array` of the vector data
-     *
-     * # Errors
-     *
-     * Returns an error if vector dimension doesn't match store dimension.
      * @param {bigint} id
      * @param {Float32Array} vector
      */
@@ -1498,20 +1472,7 @@ export class VectorStore {
         return ret !== 0;
     }
     /**
-     * Searches for the k nearest neighbors to the query vector.
-     *
-     * # Arguments
-     *
-     * * `query` - Query vector as `Float32Array`
-     * * `k` - Number of results to return
-     *
-     * # Returns
-     *
-     * Array of [id, score] pairs sorted by relevance.
-     *
-     * # Errors
-     *
-     * Returns an error if query dimension doesn't match store dimension.
+     * k-NN search. Returns [[id, score], ...].
      * @param {Float32Array} query
      * @param {number} k
      * @returns {any}
@@ -1534,13 +1495,7 @@ export class VectorStore {
         }
     }
     /**
-     * Pre-allocates memory for the specified number of additional vectors.
-     *
-     * Call this before bulk insertions to avoid repeated allocations.
-     *
-     * # Arguments
-     *
-     * * `additional` - Number of additional vectors to reserve space for
+     * Pre-allocates memory for additional vectors.
      * @param {number} additional
      */
     reserve(additional) {
@@ -1737,6 +1692,10 @@ function __wbg_get_imports() {
         const ret = GraphEdge.__wrap(arg0);
         return addHeapObject(ret);
     };
+    imports.wbg.__wbg_graphnode_new = function(arg0) {
+        const ret = GraphNode.__wrap(arg0);
+        return addHeapObject(ret);
+    };
     imports.wbg.__wbg_indexedDB_23c232e00a1e28ad = function() { return handleError(function (arg0) {
         const ret = getObject(arg0).indexedDB;
         return isLikeNone(ret) ? 0 : addHeapObject(ret);
@@ -1828,7 +1787,7 @@ function __wbg_get_imports() {
                 const a = state0.a;
                 state0.a = 0;
                 try {
-                    return __wasm_bindgen_func_elem_661(a, state0.b, arg0, arg1);
+                    return __wasm_bindgen_func_elem_689(a, state0.b, arg0, arg1);
                 } finally {
                     state0.a = a;
                 }
@@ -1956,7 +1915,7 @@ function __wbg_get_imports() {
     };
     imports.wbg.__wbindgen_cast_59e89726c7c5a9af = function(arg0, arg1) {
         // Cast intrinsic for `Closure(Closure { dtor_idx: 8, function: Function { arguments: [NamedExternref("Event")], shim_idx: 9, ret: Unit, inner_ret: Some(Unit) }, mutable: true }) -> Externref`.
-        const ret = makeMutClosure(arg0, arg1, wasm.__wasm_bindgen_func_elem_183, __wasm_bindgen_func_elem_184);
+        const ret = makeMutClosure(arg0, arg1, wasm.__wasm_bindgen_func_elem_197, __wasm_bindgen_func_elem_198);
         return addHeapObject(ret);
     };
     imports.wbg.__wbindgen_cast_9ae0607507abb057 = function(arg0) {
@@ -1964,16 +1923,16 @@ function __wbg_get_imports() {
         const ret = arg0;
         return addHeapObject(ret);
     };
-    imports.wbg.__wbindgen_cast_c060e19e7a983f38 = function(arg0, arg1) {
-        // Cast intrinsic for `Closure(Closure { dtor_idx: 55, function: Function { arguments: [Externref], shim_idx: 56, ret: Unit, inner_ret: Some(Unit) }, mutable: true }) -> Externref`.
-        const ret = makeMutClosure(arg0, arg1, wasm.__wasm_bindgen_func_elem_611, __wasm_bindgen_func_elem_612);
-        return addHeapObject(ret);
-    };
     imports.wbg.__wbindgen_cast_d6cd19b81560fd6e = function(arg0) {
         // Cast intrinsic for `F64 -> Externref`.
         const ret = arg0;
         return addHeapObject(ret);
     };
+    imports.wbg.__wbindgen_cast_eecb66c58f878696 = function(arg0, arg1) {
+        // Cast intrinsic for `Closure(Closure { dtor_idx: 67, function: Function { arguments: [Externref], shim_idx: 68, ret: Unit, inner_ret: Some(Unit) }, mutable: true }) -> Externref`.
+        const ret = makeMutClosure(arg0, arg1, wasm.__wasm_bindgen_func_elem_639, __wasm_bindgen_func_elem_640);
+        return addHeapObject(ret);
+    };
     imports.wbg.__wbindgen_object_clone_ref = function(arg0) {
         const ret = getObject(arg0);
         return addHeapObject(ret);