@wiscale/velesdb-wasm 1.3.1 → 1.5.1

package/velesdb_wasm.d.ts

@@ -1,482 +1,998 @@
 /* tslint:disable */
 /* eslint-disable */
 
+/**
+ * A graph edge representing a relationship between nodes.
+ */
 export class GraphEdge {
-  free(): void;
-  [Symbol.dispose](): void;
-  /**
-   * Sets a numeric property on the edge.
-   */
-  set_number_property(key: string, value: number): void;
-  /**
-   * Sets a string property on the edge.
-   */
-  set_string_property(key: string, value: string): void;
-  /**
-   * Creates a new graph edge.
-   *
-   * # Arguments
-   *
-   * * `id` - Unique identifier for the edge
-   * * `source` - Source node ID
-   * * `target` - Target node ID
-   * * `label` - Relationship type (e.g., "KNOWS", "WROTE")
-   */
-  constructor(id: bigint, source: bigint, target: bigint, label: string);
-  /**
-   * Converts to JSON for JavaScript interop.
-   */
-  to_json(): any;
-  /**
-   * Returns the edge ID.
-   */
-  readonly id: bigint;
-  /**
-   * Returns the edge label (relationship type).
-   */
-  readonly label: string;
-  /**
-   * Returns the source node ID.
-   */
-  readonly source: bigint;
-  /**
-   * Returns the target node ID.
-   */
-  readonly target: bigint;
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Creates a new graph edge.
+     *
+     * # Arguments
+     *
+     * * `id` - Unique identifier for the edge
+     * * `source` - Source node ID
+     * * `target` - Target node ID
+     * * `label` - Relationship type (e.g., "KNOWS", "WROTE")
+     */
+    constructor(id: bigint, source: bigint, target: bigint, label: string);
+    /**
+     * Sets a numeric property on the edge.
+     */
+    set_number_property(key: string, value: number): void;
+    /**
+     * Sets a string property on the edge.
+     */
+    set_string_property(key: string, value: string): void;
+    /**
+     * Converts to JSON for JavaScript interop.
+     */
+    to_json(): any;
+    /**
+     * Returns the edge ID.
+     */
+    readonly id: bigint;
+    /**
+     * Returns the edge label (relationship type).
+     */
+    readonly label: string;
+    /**
+     * Returns the source node ID.
+     */
+    readonly source: bigint;
+    /**
+     * Returns the target node ID.
+     */
+    readonly target: bigint;
 }
 
+/**
+ * A graph node for knowledge graph construction.
+ */
 export class GraphNode {
-  free(): void;
-  [Symbol.dispose](): void;
-  /**
-   * Returns true if this node has a vector embedding.
-   */
-  has_vector(): boolean;
-  /**
-   * Sets a vector embedding on the node.
-   */
-  set_vector(vector: Float32Array): void;
-  /**
-   * Sets a boolean property on the node.
-   */
-  set_bool_property(key: string, value: boolean): void;
-  /**
-   * Sets a numeric property on the node.
-   */
-  set_number_property(key: string, value: number): void;
-  /**
-   * Sets a string property on the node.
-   */
-  set_string_property(key: string, value: string): void;
-  /**
-   * Creates a new graph node.
-   *
-   * # Arguments
-   *
-   * * `id` - Unique identifier for the node
-   * * `label` - Node type/label (e.g., "Person", "Document")
-   */
-  constructor(id: bigint, label: string);
-  /**
-   * Converts to JSON for JavaScript interop.
-   */
-  to_json(): any;
-  /**
-   * Returns the node ID.
-   */
-  readonly id: bigint;
-  /**
-   * Returns the node label.
-   */
-  readonly label: string;
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Returns true if this node has a vector embedding.
+     */
+    has_vector(): boolean;
+    /**
+     * Creates a new graph node.
+     *
+     * # Arguments
+     *
+     * * `id` - Unique identifier for the node
+     * * `label` - Node type/label (e.g., "Person", "Document")
+     */
+    constructor(id: bigint, label: string);
+    /**
+     * Sets a boolean property on the node.
+     */
+    set_bool_property(key: string, value: boolean): void;
+    /**
+     * Sets a numeric property on the node.
+     */
+    set_number_property(key: string, value: number): void;
+    /**
+     * Sets a string property on the node.
+     */
+    set_string_property(key: string, value: string): void;
+    /**
+     * Sets a vector embedding on the node.
+     */
+    set_vector(vector: Float32Array): void;
+    /**
+     * Converts to JSON for JavaScript interop.
+     */
+    to_json(): any;
+    /**
+     * Returns the node ID.
+     */
+    readonly id: bigint;
+    /**
+     * Returns the node label.
+     */
+    readonly label: string;
+}
+
+/**
+ * `IndexedDB` persistence manager for `GraphStore`.
+ */
+export class GraphPersistence {
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Deletes a saved graph by name.
+     *
+     * BUG-7 FIX: Also deletes all nodes and edges with the graph prefix.
+     */
+    delete_graph(graph_name: string): Promise<void>;
+    /**
+     * Gets metadata for a saved graph.
+     */
+    get_metadata(graph_name: string): Promise<any>;
+    /**
+     * Initializes the database connection. Must be called before save/load.
+     */
+    init(): Promise<void>;
+    /**
+     * Lists all saved graph names.
+     */
+    list_graphs(): Promise<Array<any>>;
+    /**
+     * Loads a graph from `IndexedDB` by name.
+     *
+     * BUG-6 FIX: Only loads nodes/edges with keys prefixed by `{graph_name}:`
+     */
+    load(graph_name: string): Promise<GraphStore>;
+    /**
+     * Creates a new `GraphPersistence` instance (call `init()` to open database).
+     */
+    constructor();
+    /**
+     * Saves a graph to `IndexedDB` with the given name.
+     */
+    save(graph_name: string, store: GraphStore): Promise<void>;
 }
 
+/**
+ * In-memory graph store for browser-based knowledge graphs.
+ *
+ * Stores nodes and edges with bidirectional indexing for efficient traversal.
+ */
 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.
-   */
-  remove_edge(edge_id: bigint): void;
-  /**
-   * Removes a node and all connected edges.
-   */
-  remove_node(node_id: bigint): void;
-  /**
-   * Performs BFS 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.
-   */
-  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.
-   */
-  get_incoming(node_id: bigint): GraphEdge[];
-  /**
-   * Gets outgoing edges from a node.
-   */
-  get_outgoing(node_id: bigint): GraphEdge[];
-  /**
-   * 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.
-   */
-  get_outgoing_by_label(node_id: bigint, label: string): GraphEdge[];
-  /**
-   * Creates a new empty graph store.
-   */
-  constructor();
-  /**
-   * Clears all nodes and edges.
-   */
-  clear(): void;
-  /**
-   * Adds an edge to the graph.
-   *
-   * Returns an error if an edge with the same ID already exists.
-   */
-  add_edge(edge: GraphEdge): void;
-  /**
-   * Adds a node to the graph.
-   */
-  add_node(node: GraphNode): void;
-  /**
-   * Gets an edge by ID.
-   */
-  get_edge(id: bigint): GraphEdge | undefined;
-  /**
-   * 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.
-   */
-  readonly edge_count: number;
-  /**
-   * Returns the number of nodes.
-   */
-  readonly node_count: number;
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Adds an edge to the graph.
+     *
+     * Returns an error if an edge with the same ID already exists.
+     */
+    add_edge(edge: GraphEdge): void;
+    /**
+     * Adds a node to the graph.
+     */
+    add_node(node: GraphNode): void;
+    /**
+     * Performs BFS 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.
+     */
+    bfs_traverse(source_id: bigint, max_depth: number, limit: number): any;
+    /**
+     * Clears all nodes and edges.
+     */
+    clear(): void;
+    /**
+     * 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 all edge IDs in the graph.
+     */
+    get_all_edge_ids(): BigUint64Array;
+    /**
+     * Gets all node IDs in the graph.
+     */
+    get_all_node_ids(): BigUint64Array;
+    /**
+     * Gets an edge by ID.
+     */
+    get_edge(id: bigint): GraphEdge | undefined;
+    /**
+     * 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 incoming edges to a node.
+     */
+    get_incoming(node_id: bigint): GraphEdge[];
+    /**
+     * Gets neighbors reachable from a node (1-hop).
+     */
+    get_neighbors(node_id: bigint): BigUint64Array;
+    /**
+     * Gets a node by ID.
+     */
+    get_node(id: bigint): GraphNode | undefined;
+    /**
+     * 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 from a node.
+     */
+    get_outgoing(node_id: bigint): GraphEdge[];
+    /**
+     * Gets outgoing edges filtered by label.
+     */
+    get_outgoing_by_label(node_id: bigint, label: string): GraphEdge[];
+    /**
+     * 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;
+    /**
+     * Creates a new empty graph store.
+     */
+    constructor();
+    /**
+     * Gets the degree (number of outgoing edges) of a node.
+     */
+    out_degree(node_id: bigint): number;
+    /**
+     * Removes an edge by ID.
+     */
+    remove_edge(edge_id: bigint): void;
+    /**
+     * Removes a node and all connected edges.
+     */
+    remove_node(node_id: bigint): void;
+    /**
+     * Returns the number of edges.
+     */
+    readonly edge_count: number;
+    /**
+     * Returns the number of nodes.
+     */
+    readonly node_count: number;
+}
+
+/**
+ * Configuration for Web Worker traversal decisions.
+ */
+export class GraphWorkerConfig {
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Creates a configuration optimized for large graphs.
+     */
+    static for_large_graphs(): GraphWorkerConfig;
+    /**
+     * Creates a configuration optimized for responsive UI.
+     */
+    static for_responsive_ui(): GraphWorkerConfig;
+    /**
+     * Creates a new configuration with default values.
+     */
+    constructor();
+    /**
+     * Minimum depth to trigger worker offload.
+     */
+    depth_threshold: number;
+    /**
+     * Minimum node count to trigger worker offload.
+     */
+    node_threshold: number;
+    /**
+     * Progress callback interval in milliseconds.
+     */
+    progress_interval_ms: number;
+    /**
+     * Whether to use `SharedArrayBuffer` for result transfer (if available).
+     */
+    use_shared_buffer: boolean;
+}
+
+/**
+ * A parsed `VelesQL` statement with introspection methods.
+ */
+export class ParsedQuery {
+    private constructor();
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Get the list of selected columns as JSON array.
+     */
+    readonly columns: any;
+    /**
+     * Get the GROUP BY columns as JSON array.
+     */
+    readonly groupBy: any;
+    /**
+     * Check if DISTINCT modifier is present.
+     */
+    readonly hasDistinct: boolean;
+    /**
+     * Check if the query uses FUSION (hybrid search).
+     */
+    readonly hasFusion: boolean;
+    /**
+     * Check if the query has a GROUP BY clause.
+     */
+    readonly hasGroupBy: boolean;
+    /**
+     * Check if the query has JOINs.
+     */
+    readonly hasJoins: boolean;
+    /**
+     * Check if the query has an ORDER BY clause.
+     */
+    readonly hasOrderBy: boolean;
+    /**
+     * Check if the query contains vector search (NEAR clause).
+     */
+    readonly hasVectorSearch: boolean;
+    /**
+     * Check if the query has a WHERE clause.
+     */
+    readonly hasWhereClause: boolean;
+    /**
+     * Check if this is a MATCH (graph) query.
+     */
+    readonly isMatch: boolean;
+    /**
+     * Check if this is a SELECT query.
+     */
+    readonly isSelect: boolean;
+    /**
+     * Check if the query is valid (always true for successfully parsed queries).
+     */
+    readonly isValid: boolean;
+    /**
+     * Get the number of JOIN clauses.
+     */
+    readonly joinCount: number;
+    /**
+     * Get the LIMIT value if present.
+     */
+    readonly limit: bigint | undefined;
+    /**
+     * Check if the MATCH clause has a WHERE condition.
+     */
+    readonly matchHasWhere: boolean;
+    /**
+     * Get the LIMIT from the MATCH RETURN clause.
+     */
+    readonly matchLimit: bigint | undefined;
+    /**
+     * Get the number of node patterns in the MATCH clause.
+     */
+    readonly matchNodeCount: number;
+    /**
+     * Get node labels from the MATCH clause as JSON array of arrays.
+     * Each inner array contains the labels for one node pattern.
+     */
+    readonly matchNodeLabels: any;
+    /**
+     * Get the number of relationship patterns in the MATCH clause.
+     */
+    readonly matchRelationshipCount: number;
+    /**
+     * Get relationship types from the MATCH clause as JSON array of arrays.
+     * Each inner array contains the types for one relationship pattern.
+     */
+    readonly matchRelationshipTypes: any;
+    /**
+     * Get RETURN items from the MATCH clause as JSON array.
+     */
+    readonly matchReturnItems: any;
+    /**
+     * Get the OFFSET value if present.
+     */
+    readonly offset: bigint | undefined;
+    /**
+     * Get the ORDER BY columns and directions as JSON array.
+     */
+    readonly orderBy: any;
+    /**
+     * Get the table name from the FROM clause.
+     */
+    readonly tableName: string | undefined;
+}
+
+/**
+ * Semantic Memory for AI agents in WASM.
+ *
+ * Stores knowledge facts as vectors with similarity search.
+ *
+ * # Example (JavaScript)
+ *
+ * ```javascript
+ * import { SemanticMemory } from 'velesdb-wasm';
+ *
+ * const memory = new SemanticMemory(384);
+ * memory.store(1, "Paris is the capital of France", embedding);
+ * const results = memory.query(queryEmbedding, 5);
+ * ```
+ */
+export class SemanticMemory {
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Clears all knowledge facts.
+     */
+    clear(): void;
+    /**
+     * Returns the embedding dimension.
+     */
+    dimension(): number;
+    /**
+     * Returns true if no knowledge facts are stored.
+     */
+    is_empty(): boolean;
+    /**
+     * Returns the number of stored knowledge facts.
+     */
+    len(): number;
+    /**
+     * Creates a new `SemanticMemory` with the given embedding dimension.
+     */
+    constructor(dimension: number);
+    /**
+     * Queries semantic memory by similarity search.
+     *
+     * Returns a JSON array of {id, score, content} objects.
+     */
+    query(embedding: Float32Array, top_k: number): any;
+    /**
+     * Removes a knowledge fact by ID.
+     */
+    remove(id: bigint): boolean;
+    /**
+     * Stores a knowledge fact with its embedding vector.
+     *
+     * # Arguments
+     *
+     * * `id` - Unique identifier for this fact
+     * * `content` - Text content of the knowledge
+     * * `embedding` - Vector representation (`Float32Array`)
+     */
+    store(id: bigint, content: string, embedding: Float32Array): void;
+}
+
+/**
+ * In-memory sparse inverted index for WASM.
+ *
+ * Uses a `BTreeMap<u32, Vec<(u64, f32)>>` as posting lists.
+ */
+export class SparseIndex {
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Inserts a document with the given sparse vector.
+     *
+     * `indices` and `values` must have the same length.
+     */
+    insert(doc_id: bigint, indices: Uint32Array, values: Float32Array): void;
+    /**
+     * Creates a new empty sparse index.
+     */
+    constructor();
+    /**
+     * Searches the index with the given sparse query vector.
+     *
+     * Returns a JSON array of `{doc_id, score}` objects, sorted by score descending.
+     */
+    search(query_indices: Uint32Array, query_values: Float32Array, k: number): any;
+    /**
+     * Returns the number of documents in the index.
+     */
+    readonly doc_count: number;
 }
 
 /**
  * Storage mode for vector quantization.
  */
 export enum StorageMode {
-  /**
-   * Full f32 precision (4 bytes per dimension)
-   */
-  Full = 0,
-  /**
-   * SQ8: 8-bit scalar quantization (1 byte per dimension, 4x compression)
-   */
-  SQ8 = 1,
-  /**
-   * Binary: 1-bit quantization (1 bit per dimension, 32x compression)
-   */
-  Binary = 2,
+    /**
+     * Full f32 precision (4 bytes per dimension)
+     */
+    Full = 0,
+    /**
+     * SQ8: 8-bit scalar quantization (1 byte per dimension, 4x compression)
+     */
+    SQ8 = 1,
+    /**
+     * Binary: 1-bit quantization (1 bit per dimension, 32x compression)
+     */
+    Binary = 2,
+    /**
+     * Product Quantization (currently mapped to SQ8 path in WASM runtime)
+     */
+    ProductQuantization = 3,
+}
+
+/**
+ * Progress information for long-running traversals.
+ */
+export class TraversalProgress {
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Creates a new progress report.
+     */
+    constructor(visited: number, estimated: number, depth: number);
+    /**
+     * Converts to JSON for postMessage.
+     */
+    to_json(): any;
+    /**
+     * Current traversal depth.
+     */
+    current_depth: number;
+    /**
+     * Estimated total nodes to visit (heuristic).
+     */
+    estimated_total: number;
+    /**
+     * Whether the traversal was cancelled.
+     */
+    is_cancelled: boolean;
+    /**
+     * Whether the traversal is complete.
+     */
+    is_complete: boolean;
+    /**
+     * Number of nodes visited so far.
+     */
+    visited_count: number;
+    /**
+     * Returns the completion percentage (0-100).
+     */
+    readonly percentage: number;
 }
 
+/**
+ * A vector store for in-memory vector search.
+ *
+ * # Performance
+ *
+ * Uses contiguous memory layout for optimal cache locality and fast
+ * serialization. Vector data is stored in a single buffer rather than
+ * individual Vec allocations.
+ *
+ * # Storage Modes
+ *
+ * - `Full`: f32 precision, best recall
+ * - `SQ8`: 4x memory reduction, ~1% recall loss
+ * - `Binary`: 32x memory reduction, ~5-10% recall loss
+ */
 export class VectorStore {
-  free(): void;
-  [Symbol.dispose](): void;
-  /**
-   * Text search on payload fields (substring matching).
-   */
-  text_search(query: string, k: number, field?: string | null): any;
-  /**
-   * Batch search for multiple vectors. Returns [[[id, score], ...], ...].
-   */
-  batch_search(vectors: Float32Array, num_vectors: number, k: number): any;
-  /**
-   * Batch insert. Input: `[[id, Float32Array], ...]`.
-   */
-  insert_batch(batch: any): void;
-  /**
-   * Returns memory usage estimate in bytes.
-   */
-  memory_usage(): number;
-  /**
-   * 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 store with mode: full (4B/dim), sq8 (4x compression), binary (32x).
-   */
-  static new_with_mode(dimension: number, metric: string, mode: string): VectorStore;
-  /**
-   * Creates store with pre-allocated capacity.
-   */
-  static with_capacity(dimension: number, metric: string, capacity: number): VectorStore;
-  /**
-   * Deletes `IndexedDB` database.
-   */
-  static delete_database(db_name: string): Promise<void>;
-  /**
-   * Exports to binary format for IndexedDB/localStorage.
-   */
-  export_to_bytes(): Uint8Array;
-  /**
-   * Imports from binary format.
-   */
-  static import_from_bytes(bytes: Uint8Array): VectorStore;
-  /**
-   * Creates a metadata-only store (no vectors, only payloads).
-   */
-  static new_metadata_only(): VectorStore;
-  /**
-   * 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. Returns [{id, score, payload}].
-   */
-  search_with_filter(query: Float32Array, k: number, filter: any): any;
-  /**
-   * Inserts a vector with ID and optional JSON payload.
-   */
-  insert_with_payload(id: bigint, vector: Float32Array, payload: any): void;
-  /**
-   * Gets a vector by ID. Returns {id, vector, payload} or null.
-   */
-  get(id: bigint): any;
-  /**
-   * Creates a new vector store. Metrics: cosine, euclidean, dot, hamming, jaccard.
-   */
-  constructor(dimension: number, metric: string);
-  /**
-   * Loads from `IndexedDB`.
-   */
-  static load(db_name: string): Promise<VectorStore>;
-  /**
-   * Saves to `IndexedDB`.
-   */
-  save(db_name: string): Promise<void>;
-  /**
-   * Clears all vectors from the store.
-   */
-  clear(): void;
-  /**
-   * Inserts a vector with the given ID.
-   */
-  insert(id: bigint, vector: Float32Array): void;
-  /**
-   * Removes a vector by ID.
-   */
-  remove(id: bigint): boolean;
-  /**
-   * k-NN search. Returns [[id, score], ...].
-   */
-  search(query: Float32Array, k: number): any;
-  /**
-   * Pre-allocates memory for additional vectors.
-   */
-  reserve(additional: number): void;
-  /**
-   * Returns the storage mode.
-   */
-  readonly storage_mode: string;
-  /**
-   * Returns true if this is a metadata-only store.
-   */
-  readonly is_metadata_only: boolean;
-  /**
-   * Returns the number of vectors in the store.
-   */
-  readonly len: number;
-  /**
-   * Returns true if the store is empty.
-   */
-  readonly is_empty: boolean;
-  /**
-   * Returns the vector dimension.
-   */
-  readonly dimension: number;
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Batch search for multiple vectors. Returns [[[id, score], ...], ...].
+     */
+    batch_search(vectors: Float32Array, num_vectors: number, k: number): any;
+    /**
+     * Clears all vectors from the store.
+     */
+    clear(): void;
+    /**
+     * Deletes `IndexedDB` database.
+     */
+    static delete_database(db_name: string): Promise<void>;
+    /**
+     * Exports to binary format for IndexedDB/localStorage.
+     */
+    export_to_bytes(): Uint8Array;
+    /**
+     * Gets a vector by ID. Returns {id, vector, payload} or null.
+     */
+    get(id: bigint): any;
+    /**
+     * 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;
+    /**
+     * Imports from binary format.
+     */
+    static import_from_bytes(bytes: Uint8Array): VectorStore;
+    /**
+     * Inserts a vector with the given ID.
+     */
+    insert(id: bigint, vector: Float32Array): void;
+    /**
+     * Batch insert. Input: `[[id, Float32Array], ...]`.
+     */
+    insert_batch(batch: any): void;
+    /**
+     * Inserts a vector with ID and optional JSON payload.
+     */
+    insert_with_payload(id: bigint, vector: Float32Array, payload: any): void;
+    /**
+     * Loads from `IndexedDB`.
+     */
+    static load(db_name: string): Promise<VectorStore>;
+    /**
+     * Returns memory usage estimate in bytes.
+     */
+    memory_usage(): number;
+    /**
+     * 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;
+    /**
+     * Creates a new vector store. Metrics: cosine, euclidean, dot, hamming, jaccard.
+     */
+    constructor(dimension: number, metric: string);
+    /**
+     * Creates a metadata-only store (no vectors, only payloads).
+     */
+    static new_metadata_only(): VectorStore;
+    /**
+     * Creates store with mode: full (4B/dim), sq8 (4x compression), binary (32x).
+     */
+    static new_with_mode(dimension: number, metric: string, mode: string): VectorStore;
+    /**
+     * VelesQL-style query returning multi-model results (EPIC-031 US-009).
+     *
+     * Returns results in `HybridResult` format with `node_id`, `vector_score`,
+     * `graph_score`, `fused_score`, `bindings`, and `column_data`.
+     *
+     * # Arguments
+     * * `query_vector` - Query vector for similarity search
+     * * `k` - Number of results to return
+     *
+     * # Returns
+     * Array of `{nodeId, vectorScore, graphScore, fusedScore, bindings, columnData}`
+     */
+    query(query_vector: Float32Array, k: number): any;
+    /**
+     * Removes a vector by ID.
+     */
+    remove(id: bigint): boolean;
+    /**
+     * Pre-allocates memory for additional vectors.
+     */
+    reserve(additional: number): void;
+    /**
+     * Saves to `IndexedDB`.
+     */
+    save(db_name: string): Promise<void>;
+    /**
+     * k-NN search. Returns [[id, score], ...].
+     */
+    search(query: Float32Array, k: number): any;
+    /**
+     * Searches with metadata filtering. Returns [{id, score, payload}].
+     */
+    search_with_filter(query: Float32Array, k: number, filter: any): any;
+    /**
+     * Similarity search with threshold. Operators: >, >=, <, <=, =, !=.
+     */
+    similarity_search(query: Float32Array, threshold: number, operator: string, k: number): any;
+    /**
+     * Inserts a sparse vector into the internal sparse index.
+     *
+     * Lazily initializes the sparse index on first call.
+     */
+    sparse_insert(doc_id: bigint, indices: Uint32Array, values: Float32Array): void;
+    /**
+     * Searches the internal sparse index.
+     *
+     * Returns a JSON array of `{doc_id, score}` objects sorted by score descending.
+     */
+    sparse_search(indices: Uint32Array, values: Float32Array, k: number): any;
+    /**
+     * Text search on payload fields (substring matching).
+     */
+    text_search(query: string, k: number, field?: string | null): any;
+    /**
+     * Creates store with pre-allocated capacity.
+     */
+    static with_capacity(dimension: number, metric: string, capacity: number): VectorStore;
+    /**
+     * Returns the vector dimension.
+     */
+    readonly dimension: number;
+    /**
+     * Returns true if the store is empty.
+     */
+    readonly is_empty: boolean;
+    /**
+     * Returns true if this is a metadata-only store.
+     */
+    readonly is_metadata_only: boolean;
+    /**
+     * Returns the number of vectors in the store.
+     */
+    readonly len: number;
+    /**
+     * Returns the storage mode.
+     */
+    readonly storage_mode: string;
+}
+
+/**
+ * `VelesQL` query parser for browser use.
+ *
+ * # Example (JavaScript)
+ *
+ * ```javascript
+ * import { VelesQL } from 'velesdb-wasm';
+ *
+ * // Parse a query
+ * const parsed = VelesQL.parse("SELECT * FROM docs WHERE category = 'tech' LIMIT 10");
+ * console.log(parsed.tableName);  // "docs"
+ * console.log(parsed.isValid);    // true
+ *
+ * // Validate without parsing
+ * const valid = VelesQL.isValid("SELECT * FROM docs");  // true
+ * ```
+ */
+export class VelesQL {
+    private constructor();
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Validate a `VelesQL` query without full parsing.
+     *
+     * This is faster than `parse()` when you only need to check validity.
+     */
+    static isValid(query: string): boolean;
+    /**
+     * Parse a `VelesQL` query string.
+     *
+     * Returns a `ParsedQuery` object with query introspection methods.
+     * Throws an error if the query has syntax errors.
+     */
+    static parse(query: string): ParsedQuery;
 }
 
+/**
+ * Estimates the number of nodes that will be visited during traversal.
+ *
+ * Uses a heuristic based on graph density and max depth.
+ */
+export function estimate_traversal_size(node_count: number, edge_count: number, max_depth: number): number;
+
+/**
+ * Fuses pre-computed dense and sparse search results using Reciprocal Rank Fusion (RRF).
+ *
+ * Both `dense_results` and `sparse_results` should be JSON arrays of `[doc_id, score]` pairs.
+ * Returns a JSON array of `{doc_id, score}` objects, sorted by fused score descending,
+ * truncated to the top `k` entries.
+ */
+export function hybrid_search_fuse(dense_results: any, sparse_results: any, rrf_k: number, k: number): any;
+
+/**
+ * Determines whether a traversal should be offloaded to a Web Worker.
+ *
+ * # Arguments
+ * * `node_count` - Total nodes in the graph
+ * * `max_depth` - Maximum traversal depth requested
+ * * `config` - Optional configuration (uses defaults if None)
+ *
+ * # Returns
+ * `true` if the operation should use a Web Worker
+ */
+export function should_use_worker(node_count: number, max_depth: number, config?: GraphWorkerConfig | null): boolean;
+
 export type InitInput = RequestInfo | URL | Response | BufferSource | WebAssembly.Module;
 
 export interface InitOutput {
-  readonly memory: WebAssembly.Memory;
-  readonly __wbg_graphedge_free: (a: number, b: number) => void;
-  readonly __wbg_graphnode_free: (a: number, b: number) => void;
-  readonly __wbg_graphstore_free: (a: number, b: number) => void;
-  readonly __wbg_vectorstore_free: (a: number, b: number) => void;
-  readonly graphedge_id: (a: number) => bigint;
-  readonly graphedge_label: (a: number, b: number) => void;
-  readonly graphedge_new: (a: number, b: bigint, c: bigint, d: bigint, e: number, f: number) => void;
-  readonly graphedge_set_number_property: (a: number, b: number, c: number, d: number) => void;
-  readonly graphedge_set_string_property: (a: number, b: number, c: number, d: number, e: number) => void;
-  readonly graphedge_source: (a: number) => bigint;
-  readonly graphedge_target: (a: number) => bigint;
-  readonly graphedge_to_json: (a: number, b: number) => void;
-  readonly graphnode_has_vector: (a: number) => number;
-  readonly graphnode_label: (a: number, b: number) => void;
-  readonly graphnode_new: (a: bigint, b: number, c: number) => number;
-  readonly graphnode_set_bool_property: (a: number, b: number, c: number, d: number) => void;
-  readonly graphnode_set_number_property: (a: number, b: number, c: number, d: number) => void;
-  readonly graphnode_set_string_property: (a: number, b: number, c: number, d: number, e: number) => void;
-  readonly graphnode_set_vector: (a: number, b: number, c: number) => void;
-  readonly graphnode_to_json: (a: number, b: number) => void;
-  readonly graphstore_add_edge: (a: number, b: number, c: number) => void;
-  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;
-  readonly vectorstore_clear: (a: number) => void;
-  readonly vectorstore_delete_database: (a: number, b: number) => number;
-  readonly vectorstore_dimension: (a: number) => number;
-  readonly vectorstore_export_to_bytes: (a: number, b: number) => void;
-  readonly vectorstore_get: (a: number, b: number, c: bigint) => void;
-  readonly vectorstore_hybrid_search: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number) => void;
-  readonly vectorstore_import_from_bytes: (a: number, b: number, c: number) => void;
-  readonly vectorstore_insert: (a: number, b: number, c: bigint, d: number, e: number) => void;
-  readonly vectorstore_insert_batch: (a: number, b: number, c: number) => void;
-  readonly vectorstore_insert_with_payload: (a: number, b: number, c: bigint, d: number, e: number, f: number) => void;
-  readonly vectorstore_is_empty: (a: number) => number;
-  readonly vectorstore_is_metadata_only: (a: number) => number;
-  readonly vectorstore_len: (a: number) => number;
-  readonly vectorstore_load: (a: number, b: number) => number;
-  readonly vectorstore_memory_usage: (a: number) => number;
-  readonly vectorstore_multi_query_search: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number) => void;
-  readonly vectorstore_new: (a: number, b: number, c: number, d: number) => void;
-  readonly vectorstore_new_metadata_only: () => number;
-  readonly vectorstore_new_with_mode: (a: number, b: number, c: number, d: number, e: number, f: number) => void;
-  readonly vectorstore_remove: (a: number, b: bigint) => number;
-  readonly vectorstore_reserve: (a: number, b: number) => void;
-  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_640: (a: number, b: number, c: number) => void;
-  readonly __wasm_bindgen_func_elem_639: (a: number, b: 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_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;
-  readonly __wbindgen_add_to_stack_pointer: (a: number) => number;
-  readonly __wbindgen_export4: (a: number, b: number, c: number) => void;
+    readonly memory: WebAssembly.Memory;
+    readonly __wbg_get_graphworkerconfig_depth_threshold: (a: number) => number;
+    readonly __wbg_get_graphworkerconfig_node_threshold: (a: number) => number;
+    readonly __wbg_get_graphworkerconfig_progress_interval_ms: (a: number) => number;
+    readonly __wbg_get_graphworkerconfig_use_shared_buffer: (a: number) => number;
+    readonly __wbg_get_traversalprogress_is_cancelled: (a: number) => number;
+    readonly __wbg_graphedge_free: (a: number, b: number) => void;
+    readonly __wbg_graphnode_free: (a: number, b: number) => void;
+    readonly __wbg_graphpersistence_free: (a: number, b: number) => void;
+    readonly __wbg_graphstore_free: (a: number, b: number) => void;
+    readonly __wbg_graphworkerconfig_free: (a: number, b: number) => void;
+    readonly __wbg_parsedquery_free: (a: number, b: number) => void;
+    readonly __wbg_semanticmemory_free: (a: number, b: number) => void;
+    readonly __wbg_set_graphworkerconfig_depth_threshold: (a: number, b: number) => void;
+    readonly __wbg_set_graphworkerconfig_node_threshold: (a: number, b: number) => void;
+    readonly __wbg_set_graphworkerconfig_progress_interval_ms: (a: number, b: number) => void;
+    readonly __wbg_set_graphworkerconfig_use_shared_buffer: (a: number, b: number) => void;
+    readonly __wbg_set_traversalprogress_is_cancelled: (a: number, b: number) => void;
+    readonly __wbg_sparseindex_free: (a: number, b: number) => void;
+    readonly __wbg_vectorstore_free: (a: number, b: number) => void;
+    readonly __wbg_velesql_free: (a: number, b: number) => void;
+    readonly estimate_traversal_size: (a: number, b: number, c: number) => number;
+    readonly graphedge_id: (a: number) => bigint;
+    readonly graphedge_label: (a: number, b: number) => void;
+    readonly graphedge_new: (a: number, b: bigint, c: bigint, d: bigint, e: number, f: number) => void;
+    readonly graphedge_set_number_property: (a: number, b: number, c: number, d: number) => void;
+    readonly graphedge_set_string_property: (a: number, b: number, c: number, d: number, e: number) => void;
+    readonly graphedge_source: (a: number) => bigint;
+    readonly graphedge_target: (a: number) => bigint;
+    readonly graphedge_to_json: (a: number, b: number) => void;
+    readonly graphnode_has_vector: (a: number) => number;
+    readonly graphnode_label: (a: number, b: number) => void;
+    readonly graphnode_new: (a: bigint, b: number, c: number) => number;
+    readonly graphnode_set_bool_property: (a: number, b: number, c: number, d: number) => void;
+    readonly graphnode_set_number_property: (a: number, b: number, c: number, d: number) => void;
+    readonly graphnode_set_string_property: (a: number, b: number, c: number, d: number, e: number) => void;
+    readonly graphnode_set_vector: (a: number, b: number, c: number) => void;
+    readonly graphnode_to_json: (a: number, b: number) => void;
+    readonly graphpersistence_delete_graph: (a: number, b: number, c: number) => number;
+    readonly graphpersistence_get_metadata: (a: number, b: number, c: number) => number;
+    readonly graphpersistence_init: (a: number) => number;
+    readonly graphpersistence_list_graphs: (a: number) => number;
+    readonly graphpersistence_load: (a: number, b: number, c: number) => number;
+    readonly graphpersistence_new: () => number;
+    readonly graphpersistence_save: (a: number, b: number, c: number, d: number) => number;
+    readonly graphstore_add_edge: (a: number, b: number, c: number) => void;
+    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 graphworkerconfig_for_large_graphs: () => number;
+    readonly graphworkerconfig_for_responsive_ui: () => number;
+    readonly graphworkerconfig_new: () => number;
+    readonly hybrid_search_fuse: (a: number, b: number, c: number, d: number, e: number) => void;
+    readonly parsedquery_columns: (a: number) => number;
+    readonly parsedquery_groupBy: (a: number) => number;
+    readonly parsedquery_hasDistinct: (a: number) => number;
+    readonly parsedquery_hasFusion: (a: number) => number;
+    readonly parsedquery_hasGroupBy: (a: number) => number;
+    readonly parsedquery_hasJoins: (a: number) => number;
+    readonly parsedquery_hasOrderBy: (a: number) => number;
+    readonly parsedquery_hasVectorSearch: (a: number) => number;
+    readonly parsedquery_hasWhereClause: (a: number) => number;
+    readonly parsedquery_isMatch: (a: number) => number;
+    readonly parsedquery_isSelect: (a: number) => number;
+    readonly parsedquery_isValid: (a: number) => number;
+    readonly parsedquery_joinCount: (a: number) => number;
+    readonly parsedquery_limit: (a: number, b: number) => void;
+    readonly parsedquery_matchHasWhere: (a: number) => number;
+    readonly parsedquery_matchLimit: (a: number, b: number) => void;
+    readonly parsedquery_matchNodeCount: (a: number) => number;
+    readonly parsedquery_matchNodeLabels: (a: number) => number;
+    readonly parsedquery_matchRelationshipCount: (a: number) => number;
+    readonly parsedquery_matchRelationshipTypes: (a: number) => number;
+    readonly parsedquery_matchReturnItems: (a: number) => number;
+    readonly parsedquery_offset: (a: number, b: number) => void;
+    readonly parsedquery_orderBy: (a: number) => number;
+    readonly parsedquery_tableName: (a: number, b: number) => void;
+    readonly semanticmemory_clear: (a: number) => void;
+    readonly semanticmemory_dimension: (a: number) => number;
+    readonly semanticmemory_is_empty: (a: number) => number;
+    readonly semanticmemory_len: (a: number) => number;
+    readonly semanticmemory_new: (a: number, b: number) => void;
+    readonly semanticmemory_query: (a: number, b: number, c: number, d: number, e: number) => void;
+    readonly semanticmemory_remove: (a: number, b: bigint) => number;
+    readonly semanticmemory_store: (a: number, b: number, c: bigint, d: number, e: number, f: number, g: number) => void;
+    readonly should_use_worker: (a: number, b: number, c: number) => number;
+    readonly sparseindex_doc_count: (a: number) => number;
+    readonly sparseindex_insert: (a: number, b: number, c: bigint, d: number, e: number, f: number, g: number) => void;
+    readonly sparseindex_new: () => number;
+    readonly sparseindex_search: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => void;
+    readonly traversalprogress_new: (a: number, b: number, c: number) => number;
+    readonly traversalprogress_percentage: (a: number) => number;
+    readonly traversalprogress_to_json: (a: number, b: number) => void;
+    readonly vectorstore_batch_search: (a: number, b: number, c: number, d: number, e: number, f: number) => void;
+    readonly vectorstore_clear: (a: number) => void;
+    readonly vectorstore_delete_database: (a: number, b: number) => number;
+    readonly vectorstore_dimension: (a: number) => number;
+    readonly vectorstore_export_to_bytes: (a: number, b: number) => void;
+    readonly vectorstore_get: (a: number, b: number, c: bigint) => void;
+    readonly vectorstore_hybrid_search: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number) => void;
+    readonly vectorstore_import_from_bytes: (a: number, b: number, c: number) => void;
+    readonly vectorstore_insert: (a: number, b: number, c: bigint, d: number, e: number) => void;
+    readonly vectorstore_insert_batch: (a: number, b: number, c: number) => void;
+    readonly vectorstore_insert_with_payload: (a: number, b: number, c: bigint, d: number, e: number, f: number) => void;
+    readonly vectorstore_is_empty: (a: number) => number;
+    readonly vectorstore_is_metadata_only: (a: number) => number;
+    readonly vectorstore_len: (a: number) => number;
+    readonly vectorstore_load: (a: number, b: number) => number;
+    readonly vectorstore_memory_usage: (a: number) => number;
+    readonly vectorstore_multi_query_search: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number) => void;
+    readonly vectorstore_new: (a: number, b: number, c: number, d: number) => void;
+    readonly vectorstore_new_metadata_only: () => number;
+    readonly vectorstore_new_with_mode: (a: number, b: number, c: number, d: number, e: number, f: number) => void;
+    readonly vectorstore_query: (a: number, b: number, c: number, d: number, e: number) => void;
+    readonly vectorstore_remove: (a: number, b: bigint) => number;
+    readonly vectorstore_reserve: (a: number, b: number) => void;
+    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_sparse_insert: (a: number, b: number, c: bigint, d: number, e: number, f: number, g: number) => void;
+    readonly vectorstore_sparse_search: (a: number, b: number, c: number, d: number, e: number, f: number, g: 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 velesql_isValid: (a: number, b: number) => number;
+    readonly velesql_parse: (a: number, b: number, c: number) => void;
+    readonly __wbg_set_traversalprogress_is_complete: (a: number, b: number) => void;
+    readonly __wbg_set_traversalprogress_current_depth: (a: number, b: number) => void;
+    readonly __wbg_set_traversalprogress_estimated_total: (a: number, b: number) => void;
+    readonly __wbg_set_traversalprogress_visited_count: (a: number, b: number) => void;
+    readonly __wbg_get_traversalprogress_is_complete: (a: number) => number;
+    readonly __wbg_get_traversalprogress_current_depth: (a: number) => number;
+    readonly __wbg_get_traversalprogress_estimated_total: (a: number) => number;
+    readonly __wbg_get_traversalprogress_visited_count: (a: number) => number;
+    readonly graphnode_id: (a: number) => bigint;
+    readonly __wbg_traversalprogress_free: (a: number, b: number) => void;
+    readonly __wasm_bindgen_func_elem_1295: (a: number, b: number) => void;
+    readonly __wasm_bindgen_func_elem_284: (a: number, b: number) => void;
+    readonly __wasm_bindgen_func_elem_1296: (a: number, b: number, c: number, d: number) => void;
+    readonly __wasm_bindgen_func_elem_1327: (a: number, b: number, c: number, d: number) => void;
+    readonly __wasm_bindgen_func_elem_285: (a: number, b: number, c: 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;
+    readonly __wbindgen_add_to_stack_pointer: (a: number) => number;
+    readonly __wbindgen_export4: (a: number, b: number, c: number) => void;
 }
 
 export type SyncInitInput = BufferSource | WebAssembly.Module;
 
 /**
-* Instantiates the given `module`, which can either be bytes or
-* a precompiled `WebAssembly.Module`.
-*
-* @param {{ module: SyncInitInput }} module - Passing `SyncInitInput` directly is deprecated.
-*
-* @returns {InitOutput}
-*/
+ * Instantiates the given `module`, which can either be bytes or
+ * a precompiled `WebAssembly.Module`.
+ *
+ * @param {{ module: SyncInitInput }} module - Passing `SyncInitInput` directly is deprecated.
+ *
+ * @returns {InitOutput}
+ */
 export function initSync(module: { module: SyncInitInput } | SyncInitInput): InitOutput;
 
 /**
-* If `module_or_path` is {RequestInfo} or {URL}, makes a request and
-* for everything else, calls `WebAssembly.instantiate` directly.
-*
-* @param {{ module_or_path: InitInput | Promise<InitInput> }} module_or_path - Passing `InitInput` directly is deprecated.
-*
-* @returns {Promise<InitOutput>}
-*/
+ * If `module_or_path` is {RequestInfo} or {URL}, makes a request and
+ * for everything else, calls `WebAssembly.instantiate` directly.
+ *
+ * @param {{ module_or_path: InitInput | Promise<InitInput> }} module_or_path - Passing `InitInput` directly is deprecated.
+ *
+ * @returns {Promise<InitOutput>}
+ */
 export default function __wbg_init (module_or_path?: { module_or_path: InitInput | Promise<InitInput> } | InitInput | Promise<InitInput>): Promise<InitOutput>;