presubmit 0.1.0

package/vendor/lancedb/dist/query.d.ts

@@ -0,0 +1,663 @@
+import { Table as ArrowTable, type IntoVector, RecordBatch } from "./arrow";
+import { type IvfPqOptions } from "./indices";
+import { JsFullTextQuery, RecordBatchIterator as NativeBatchIterator, Query as NativeQuery, Table as NativeTable, TakeQuery as NativeTakeQuery, VectorQuery as NativeVectorQuery } from "./native";
+import { Reranker } from "./rerankers";
+export declare function RecordBatchIterator(promisedInner: Promise<NativeBatchIterator>): AsyncGenerator<RecordBatch<any>, void, unknown>;
+/**
+ * Options that control the behavior of a particular query execution
+ */
+export interface QueryExecutionOptions {
+    /**
+     * The maximum number of rows to return in a single batch
+     *
+     * Batches may have fewer rows if the underlying data is stored
+     * in smaller chunks.
+     */
+    maxBatchLength?: number;
+    /**
+     * Timeout for query execution in milliseconds
+     */
+    timeoutMs?: number;
+}
+export type AnalyzePlanDistributedMetrics = "aggregate" | "per_worker" | "full";
+export interface ColumnOrdering {
+    columnName: string;
+    ascending?: boolean;
+    nullsFirst?: boolean;
+}
+/**
+ * Options that control the behavior of a full text search
+ */
+export interface FullTextSearchOptions {
+    /**
+     * The columns to search
+     *
+     * If not specified, all indexed columns will be searched.
+     * For now, only one column can be searched.
+     */
+    columns?: string | string[];
+}
+/** Common methods supported by all query types
+ *
+ * @see {@link Query}
+ * @see {@link VectorQuery}
+ *
+ * @hideconstructor
+ */
+export declare class QueryBase<NativeQueryType extends NativeQuery | NativeVectorQuery | NativeTakeQuery> implements AsyncIterable<RecordBatch> {
+    protected inner: NativeQueryType | Promise<NativeQueryType>;
+    /**
+     * @hidden
+     */
+    protected constructor(inner?: NativeQueryType | Promise<NativeQueryType>);
+    /**
+     * @hidden
+     */
+    protected doCall(fn: (inner: NativeQueryType) => void): void;
+    /**
+     * Return the native query used by the next terminal operation.
+     *
+     * @hidden
+     */
+    protected getInner(): Promise<NativeQueryType>;
+    /**
+     * Return only the specified columns.
+     *
+     * By default a query will return all columns from the table.  However, this can have
+     * a very significant impact on latency.  LanceDb stores data in a columnar fashion.  This
+     * means we can finely tune our I/O to select exactly the columns we need.
+     *
+     * As a best practice you should always limit queries to the columns that you need.  If you
+     * pass in an array of column names then only those columns will be returned.
+     *
+     * You can also use this method to create new "dynamic" columns based on your existing columns.
+     * For example, you may not care about "a" or "b" but instead simply want "a + b".  This is often
+     * seen in the SELECT clause of an SQL query (e.g. `SELECT a+b FROM my_table`).
+     *
+     * To create dynamic columns you can pass in a Map<string, string>.  A column will be returned
+     * for each entry in the map.  The key provides the name of the column.  The value is
+     * an SQL string used to specify how the column is calculated.
+     *
+     * For example, an SQL query might state `SELECT a + b AS combined, c`.  The equivalent
+     * input to this method would be:
+     * @example
+     * new Map([["combined", "a + b"], ["c", "c"]])
+     *
+     * Columns will always be returned in the order given, even if that order is different than
+     * the order used when adding the data.
+     *
+     * Note that you can pass in a `Record<string, string>` (e.g. an object literal). This method
+     * uses `Object.entries` which should preserve the insertion order of the object.  However,
+     * object insertion order is easy to get wrong and `Map` is more foolproof.
+     */
+    select(columns: string[] | Map<string, string> | Record<string, string> | string): this;
+    /**
+     * Whether to return the row id in the results.
+     *
+     * This column can be used to match results between different queries. For
+     * example, to match results from a full text search and a vector search in
+     * order to perform hybrid search.
+     */
+    withRowId(): this;
+    /**
+     * @hidden
+     */
+    protected nativeExecute(options?: Partial<QueryExecutionOptions>): Promise<NativeBatchIterator>;
+    /**
+     * Execute the query and return the results as an @see {@link AsyncIterator}
+     * of @see {@link RecordBatch}.
+     *
+     * By default, LanceDb will use many threads to calculate results and, when
+     * the result set is large, multiple batches will be processed at one time.
+     * This readahead is limited however and backpressure will be applied if this
+     * stream is consumed slowly (this constrains the maximum memory used by a
+     * single query)
+     *
+     */
+    protected execute(options?: Partial<QueryExecutionOptions>): AsyncGenerator<RecordBatch<any>, void, unknown>;
+    /**
+     * @hidden
+     */
+    [Symbol.asyncIterator](): AsyncIterator<RecordBatch<any>>;
+    /** Collect the results as an Arrow @see {@link ArrowTable}. */
+    toArrow(options?: Partial<QueryExecutionOptions>): Promise<ArrowTable>;
+    /** Collect the results as an array of objects. */
+    toArray(options?: Partial<QueryExecutionOptions>): Promise<any[]>;
+    /**
+     * Generates an explanation of the query execution plan.
+     *
+     * @example
+     * import * as lancedb from "@lancedb/lancedb"
+     * const db = await lancedb.connect("./.lancedb");
+     * const table = await db.createTable("my_table", [
+     *   { vector: [1.1, 0.9], id: "1" },
+     * ]);
+     * const plan = await table.query().nearestTo([0.5, 0.2]).explainPlan();
+     *
+     * @param verbose - If true, provides a more detailed explanation. Defaults to false.
+     * @returns A Promise that resolves to a string containing the query execution plan explanation.
+     */
+    explainPlan(verbose?: boolean): Promise<string>;
+    /**
+     * Executes the query and returns the physical query plan annotated with runtime metrics.
+     *
+     * This is useful for debugging and performance analysis, as it shows how the query was executed
+     * and includes metrics such as elapsed time, rows processed, and I/O statistics.
+     *
+     * @example
+     * import * as lancedb from "@lancedb/lancedb"
+     *
+     * const db = await lancedb.connect("./.lancedb");
+     * const table = await db.createTable("my_table", [
+     *   { vector: [1.1, 0.9], id: "1" },
+     * ]);
+     *
+     * const plan = await table.query().nearestTo([0.5, 0.2]).analyzePlan();
+     *
+     * Example output (with runtime metrics inlined):
+     * AnalyzeExec verbose=true, metrics=[]
+     *  ProjectionExec: expr=[id@3 as id, vector@0 as vector, _distance@2 as _distance], metrics=[output_rows=1, elapsed_compute=3.292µs]
+     *   Take: columns="vector, _rowid, _distance, (id)", metrics=[output_rows=1, elapsed_compute=66.001µs, batches_processed=1, bytes_read=8, iops=1, requests=1]
+     *    CoalesceBatchesExec: target_batch_size=1024, metrics=[output_rows=1, elapsed_compute=3.333µs]
+     *     GlobalLimitExec: skip=0, fetch=10, metrics=[output_rows=1, elapsed_compute=167ns]
+     *      FilterExec: _distance@2 IS NOT NULL, metrics=[output_rows=1, elapsed_compute=8.542µs]
+     *       SortExec: TopK(fetch=10), expr=[_distance@2 ASC NULLS LAST], metrics=[output_rows=1, elapsed_compute=63.25µs, row_replacements=1]
+     *        KNNVectorDistance: metric=l2, metrics=[output_rows=1, elapsed_compute=114.333µs, output_batches=1]
+     *         LanceScan: uri=/path/to/data, projection=[vector], row_id=true, row_addr=false, ordered=false, metrics=[output_rows=1, elapsed_compute=103.626µs, bytes_read=549, iops=2, requests=2]
+     *
+     * @param distributedMetrics - How distributed worker metrics are displayed for remote query plans.
+     * Defaults to `"aggregate"`.
+     * @returns A query execution plan with runtime metrics for each step.
+     */
+    analyzePlan(distributedMetrics?: AnalyzePlanDistributedMetrics): Promise<string>;
+    /**
+     * Returns the schema of the output that will be returned by this query.
+     *
+     * This can be used to inspect the types and names of the columns that will be
+     * returned by the query before executing it.
+     *
+     * @returns An Arrow Schema describing the output columns.
+     */
+    outputSchema(): Promise<import("./arrow").Schema>;
+}
+export declare class StandardQueryBase<NativeQueryType extends NativeQuery | NativeVectorQuery> extends QueryBase<NativeQueryType> implements ExecutableQuery {
+    constructor(inner?: NativeQueryType | Promise<NativeQueryType>);
+    /**
+     * A filter statement to be applied to this query.
+     *
+     * The filter should be supplied as an SQL query string.  For example:
+     * @example
+     * x > 10
+     * y > 0 AND y < 100
+     * x > 5 OR y = 'test'
+     *
+     * Filtering performance can often be improved by creating a scalar index
+     * on the filter column(s).
+     *
+     * Calling this multiple times combines the filters with a logical AND rather
+     * than replacing the previous filter.
+     */
+    where(predicate: string): this;
+    /**
+     * A filter statement to be applied to this query.
+     * @see where
+     * @deprecated Use `where` instead
+     */
+    filter(predicate: string): this;
+    fullTextSearch(query: string | FullTextQuery, options?: Partial<FullTextSearchOptions>): this;
+    /**
+     * Set the maximum number of results to return.
+     *
+     * By default, a plain search has no limit.  If this method is not
+     * called then every valid row from the table will be returned.
+     */
+    limit(limit: number): this;
+    /**
+     * Set the number of rows to skip before returning results.
+     *
+     * This is useful for pagination.
+     */
+    offset(offset: number): this;
+    /**
+     * Sort the results by the specified column(s).
+     * @returns This query builder.
+     */
+    orderBy(ordering: ColumnOrdering | ColumnOrdering[]): this;
+    /**
+     * Skip searching un-indexed data. This can make search faster, but will miss
+     * any data that is not yet indexed.
+     *
+     * Use {@link Table#optimize} to index all un-indexed data.
+     */
+    fastSearch(): this;
+    /**
+     * Control MemWAL read routing for this query.
+     *
+     * By default (unset), when the table carries a MemWAL write spec (see
+     * {@link Table#setLsmWriteSpec}), reads are routed through the LSM scanner so
+     * they also return data written via the `mergeInsert` LSM path that has not yet
+     * been compacted into the base table (the active/frozen in-memory memtables and
+     * the flushed generations), deduplicated by primary key; a table without a spec
+     * reads the base table.
+     *
+     * @param enable - `true` forces the LSM scanner and errors if the table has no
+     * MemWAL write spec. `false` bypasses the MemWAL and reads the base table only,
+     * even when a spec is present.
+     *
+     * Note: the LSM scanner does not support every query shape (e.g. reranking,
+     * hybrid search, `orderBy`). On a MemWAL table those shapes error unless
+     * `useLsm(false)` is set, because a base-only read would silently exclude
+     * un-compacted MemWAL data.
+     */
+    useLsm(enable: boolean): this;
+}
+/**
+ * An interface for a query that can be executed
+ *
+ * Supported by all query types
+ */
+export interface ExecutableQuery {
+}
+/**
+ * A builder used to construct a vector search
+ *
+ * This builder can be reused to execute the query many times.
+ *
+ * @see {@link Query#nearestTo}
+ *
+ * @hideconstructor
+ */
+export declare class VectorQuery extends StandardQueryBase<NativeVectorQuery> {
+    /**
+     * @hidden
+     */
+    constructor(inner: NativeVectorQuery | Promise<NativeVectorQuery>);
+    /**
+     * @hidden
+     */
+    protected doVectorCall(fn: (inner: NativeVectorQuery) => void): void;
+    /**
+     * Set the number of partitions to search (probe)
+     *
+     * This argument is only used when the vector column has an IVF PQ index.
+     * If there is no index then this value is ignored.
+     *
+     * The IVF stage of IVF PQ divides the input into partitions (clusters) of
+     * related values.
+     *
+     * The partition whose centroids are closest to the query vector will be
+     * exhaustiely searched to find matches.  This parameter controls how many
+     * partitions should be searched.
+     *
+     * Increasing this value will increase the recall of your query but will
+     * also increase the latency of your query.  The default value is 20.  This
+     * default is good for many cases but the best value to use will depend on
+     * your data and the recall that you need to achieve.
+     *
+     * For best results we recommend tuning this parameter with a benchmark against
+     * your actual data to find the smallest possible value that will still give
+     * you the desired recall.
+     *
+     * For more fine grained control over behavior when you have a very narrow filter
+     * you can use `minimumNprobes` and `maximumNprobes`.  This method sets both
+     * the minimum and maximum to the same value.
+     */
+    nprobes(nprobes: number): VectorQuery;
+    /**
+     * Set the minimum number of probes used.
+     *
+     * This controls the minimum number of partitions that will be searched.  This
+     * parameter will impact every query against a vector index, regardless of the
+     * filter.  See `nprobes` for more details.  Higher values will increase recall
+     * but will also increase latency.
+     */
+    minimumNprobes(minimumNprobes: number): VectorQuery;
+    /**
+     * Set the maximum number of probes used.
+     *
+     * This controls the maximum number of partitions that will be searched.  If this
+     * number is greater than minimumNprobes then the excess partitions will _only_ be
+     * searched if we have not found enough results.  This can be useful when there is
+     * a narrow filter to allow these queries to spend more time searching and avoid
+     * potential false negatives.
+     */
+    maximumNprobes(maximumNprobes: number): VectorQuery;
+    distanceRange(lowerBound?: number, upperBound?: number): VectorQuery;
+    /**
+     * Set the number of candidates to consider during the search
+     *
+     * This argument is only used when the vector column has an HNSW index.
+     * If there is no index then this value is ignored.
+     *
+     * Increasing this value will increase the recall of your query but will
+     * also increase the latency of your query. The default value is 1.5*limit.
+     */
+    ef(ef: number): VectorQuery;
+    /**
+     * Set the vector column to query
+     *
+     * This controls which column is compared to the query vector supplied in
+     * the call to @see {@link Query#nearestTo}
+     *
+     * This parameter must be specified if the table has more than one column
+     * whose data type is a fixed-size-list of floats.
+     */
+    column(column: string): VectorQuery;
+    /**
+     * Set the distance metric to use
+     *
+     * When performing a vector search we try and find the "nearest" vectors according
+     * to some kind of distance metric.  This parameter controls which distance metric to
+     * use.  See @see {@link IvfPqOptions.distanceType} for more details on the different
+     * distance metrics available.
+     *
+     * Note: if there is a vector index then the distance type used MUST match the distance
+     * type used to train the vector index.  If this is not done then the results will be
+     * invalid.
+     *
+     * By default "l2" is used.
+     */
+    distanceType(distanceType: Required<IvfPqOptions>["distanceType"]): VectorQuery;
+    /**
+     * A multiplier to control how many additional rows are taken during the refine step
+     *
+     * This argument is only used when the vector column has an IVF PQ index.
+     * If there is no index then this value is ignored.
+     *
+     * An IVF PQ index stores compressed (quantized) values.  They query vector is compared
+     * against these values and, since they are compressed, the comparison is inaccurate.
+     *
+     * This parameter can be used to refine the results.  It can improve both improve recall
+     * and correct the ordering of the nearest results.
+     *
+     * To refine results LanceDb will first perform an ANN search to find the nearest
+     * `limit` * `refine_factor` results.  In other words, if `refine_factor` is 3 and
+     * `limit` is the default (10) then the first 30 results will be selected.  LanceDb
+     * then fetches the full, uncompressed, values for these 30 results.  The results are
+     * then reordered by the true distance and only the nearest 10 are kept.
+     *
+     * Note: there is a difference between calling this method with a value of 1 and never
+     * calling this method at all.  Calling this method with any value will have an impact
+     * on your search latency.  When you call this method with a `refine_factor` of 1 then
+     * LanceDb still needs to fetch the full, uncompressed, values so that it can potentially
+     * reorder the results.
+     *
+     * Note: if this method is NOT called then the distances returned in the _distance column
+     * will be approximate distances based on the comparison of the quantized query vector
+     * and the quantized result vectors.  This can be considerably different than the true
+     * distance between the query vector and the actual uncompressed vector.
+     */
+    refineFactor(refineFactor: number): VectorQuery;
+    /**
+     * If this is called then filtering will happen after the vector search instead of
+     * before.
+     *
+     * By default filtering will be performed before the vector search.  This is how
+     * filtering is typically understood to work.  This prefilter step does add some
+     * additional latency.  Creating a scalar index on the filter column(s) can
+     * often improve this latency.  However, sometimes a filter is too complex or scalar
+     * indices cannot be applied to the column.  In these cases postfiltering can be
+     * used instead of prefiltering to improve latency.
+     *
+     * Post filtering applies the filter to the results of the vector search.  This means
+     * we only run the filter on a much smaller set of data.  However, it can cause the
+     * query to return fewer than `limit` results (or even no results) if none of the nearest
+     * results match the filter.
+     *
+     * Post filtering happens during the "refine stage" (described in more detail in
+     * @see {@link VectorQuery#refineFactor}).  This means that setting a higher refine
+     * factor can often help restore some of the results lost by post filtering.
+     */
+    postfilter(): VectorQuery;
+    /**
+     * If this is called then any vector index is skipped
+     *
+     * An exhaustive (flat) search will be performed.  The query vector will
+     * be compared to every vector in the table.  At high scales this can be
+     * expensive.  However, this is often still useful.  For example, skipping
+     * the vector index can give you ground truth results which you can use to
+     * calculate your recall to select an appropriate value for nprobes.
+     */
+    bypassVectorIndex(): VectorQuery;
+    addQueryVector(vector: IntoVector): VectorQuery;
+    rerank(reranker: Reranker): VectorQuery;
+}
+/**
+ * Create a string query whose vector/FTS routing is resolved against the active
+ * table schema when the query executes.
+ *
+ * @hidden
+ */
+export declare function createAutoQuery(table: NativeTable, query: string, columns: string[] | null, getVector: (metadata: string) => Promise<Awaited<IntoVector>>): AutoQuery;
+/**
+ * A query that returns a subset of the rows in the table.
+ *
+ * @hideconstructor
+ */
+export declare class TakeQuery extends QueryBase<NativeTakeQuery> {
+    constructor(inner: NativeTakeQuery);
+    /**
+     * Control MemWAL read routing for this take query.
+     *
+     * `false` bypasses the MemWAL and reads the base table only — the escape hatch,
+     * since take-by-row-id/offset is not supported on the LSM scanner and, on a
+     * MemWAL table, auto-routes to it and errors otherwise.
+     *
+     * @param enable - `false` reads the base table only.
+     */
+    useLsm(enable: boolean): this;
+}
+/**
+ * A builder for automatic string searches.
+ *
+ * Automatic search determines whether to use full-text or vector search from
+ * the table revision selected for each execution. This builder exposes the
+ * common operations supported by both query families.
+ *
+ * @hideconstructor
+ */
+export declare class AutoQuery extends StandardQueryBase<NativeQuery | NativeVectorQuery> {
+    private readonly createInner;
+    private readonly calls;
+    /** @hidden */
+    constructor(createInner: () => Promise<NativeQuery | NativeVectorQuery>);
+    /** @hidden */
+    protected doCall(fn: (inner: NativeQuery | NativeVectorQuery) => void): void;
+    /** @hidden */
+    protected getInner(): Promise<NativeQuery | NativeVectorQuery>;
+}
+/** A builder for LanceDB queries.
+ *
+ * @see {@link Table#query}, {@link Table#search}
+ *
+ * @hideconstructor
+ */
+export declare class Query extends StandardQueryBase<NativeQuery> {
+    /**
+     * @hidden
+     */
+    constructor(tbl: NativeTable);
+    /**
+     * Find the nearest vectors to the given query vector.
+     *
+     * This converts the query from a plain query to a vector query.
+     *
+     * This method will attempt to convert the input to the query vector
+     * expected by the embedding model.  If the input cannot be converted
+     * then an error will be thrown.
+     *
+     * By default, there is no embedding model, and the input should be
+     * an array-like object of numbers (something that can be used as input
+     * to Float32Array.from)
+     *
+     * If there is only one vector column (a column whose data type is a
+     * fixed size list of floats) then the column does not need to be specified.
+     * If there is more than one vector column you must use
+     * @see {@link VectorQuery#column}  to specify which column you would like
+     * to compare with.
+     *
+     * If no index has been created on the vector column then a vector query
+     * will perform a distance comparison between the query vector and every
+     * vector in the database and then sort the results.  This is sometimes
+     * called a "flat search"
+     *
+     * For small databases, with a few hundred thousand vectors or less, this can
+     * be reasonably fast.  In larger databases you should create a vector index
+     * on the column.  If there is a vector index then an "approximate" nearest
+     * neighbor search (frequently called an ANN search) will be performed.  This
+     * search is much faster, but the results will be approximate.
+     *
+     * The query can be further parameterized using the returned builder.  There
+     * are various ANN search parameters that will let you fine tune your recall
+     * accuracy vs search latency.
+     *
+     * Vector searches always have a `limit`.  If `limit` has not been called then
+     * a default `limit` of 10 will be used.  @see {@link Query#limit}
+     */
+    nearestTo(vector: IntoVector): VectorQuery;
+    nearestToText(query: string | FullTextQuery, columns?: string[]): Query;
+}
+/**
+ * Enum representing the types of full-text queries supported.
+ *
+ * - `Match`: Performs a full-text search for terms in the query string.
+ * - `MatchPhrase`: Searches for an exact phrase match in the text.
+ * - `Boost`: Boosts the relevance score of specific terms in the query.
+ * - `MultiMatch`: Searches across multiple fields for the query terms.
+ */
+export declare enum FullTextQueryType {
+    Match = "match",
+    MatchPhrase = "match_phrase",
+    Boost = "boost",
+    MultiMatch = "multi_match",
+    Boolean = "boolean"
+}
+/**
+ * Enum representing the logical operators used in full-text queries.
+ *
+ * - `And`: All terms must match.
+ * - `Or`: At least one term must match.
+ */
+export declare enum Operator {
+    And = "AND",
+    Or = "OR"
+}
+/**
+ * Enum representing the occurrence of terms in full-text queries.
+ *
+ * - `Must`: The term must be present in the document.
+ * - `Should`: The term should contribute to the document score, but is not required.
+ * - `MustNot`: The term must not be present in the document.
+ */
+export declare enum Occur {
+    Should = "SHOULD",
+    Must = "MUST",
+    MustNot = "MUST_NOT"
+}
+/**
+ * Represents a full-text query interface.
+ * This interface defines the structure and behavior for full-text queries,
+ * including methods to retrieve the query type and convert the query to a dictionary format.
+ */
+export interface FullTextQuery {
+    /**
+     * Returns the inner query object.
+     * This is the underlying query object used by the database engine.
+     * @ignore
+     */
+    inner: JsFullTextQuery;
+    /**
+     * The type of the full-text query.
+     */
+    queryType(): FullTextQueryType;
+}
+export declare function instanceOfFullTextQuery(obj: any): obj is FullTextQuery;
+export declare class MatchQuery implements FullTextQuery {
+    /** @ignore */
+    readonly inner: JsFullTextQuery;
+    /**
+     * Creates an instance of MatchQuery.
+     *
+     * @param query - The text query to search for.
+     * @param column - The name of the column to search within.
+     * @param options - Optional parameters for the match query.
+     *   - `boost`: The boost factor for the query (default is 1.0).
+     *   - `fuzziness`: The fuzziness level for the query (default is 0).
+     *   - `maxExpansions`: The maximum number of terms to consider for fuzzy matching (default is 50).
+     *   - `operator`: The logical operator to use for combining terms in the query (default is "OR").
+     *   - `prefixLength`: The number of beginning characters being unchanged for fuzzy matching.
+     */
+    constructor(query: string, column: string, options?: {
+        boost?: number;
+        fuzziness?: number;
+        maxExpansions?: number;
+        operator?: Operator;
+        prefixLength?: number;
+    });
+    queryType(): FullTextQueryType;
+}
+export declare class PhraseQuery implements FullTextQuery {
+    /** @ignore */
+    readonly inner: JsFullTextQuery;
+    /**
+     * Creates an instance of `PhraseQuery`.
+     *
+     * @param query - The phrase to search for in the specified column.
+     * @param column - The name of the column to search within.
+     * @param options - Optional parameters for the phrase query.
+     *   - `slop`: The maximum number of intervening unmatched positions allowed between words in the phrase (default is 0).
+     */
+    constructor(query: string, column: string, options?: {
+        slop?: number;
+    });
+    queryType(): FullTextQueryType;
+}
+export declare class BoostQuery implements FullTextQuery {
+    /** @ignore */
+    readonly inner: JsFullTextQuery;
+    /**
+     * Creates an instance of BoostQuery.
+     * The boost returns documents that match the positive query,
+     * but penalizes those that match the negative query.
+     * the penalty is controlled by the `negativeBoost` parameter.
+     *
+     * @param positive - The positive query that boosts the relevance score.
+     * @param negative - The negative query that reduces the relevance score.
+     * @param options - Optional parameters for the boost query.
+     *  - `negativeBoost`: The boost factor for the negative query (default is 0.0).
+     */
+    constructor(positive: FullTextQuery, negative: FullTextQuery, options?: {
+        negativeBoost?: number;
+    });
+    queryType(): FullTextQueryType;
+}
+export declare class MultiMatchQuery implements FullTextQuery {
+    /** @ignore */
+    readonly inner: JsFullTextQuery;
+    /**
+     * Creates an instance of MultiMatchQuery.
+     *
+     * @param query - The text query to search for across multiple columns.
+     * @param columns - An array of column names to search within.
+     * @param options - Optional parameters for the multi-match query.
+     *  - `boosts`: An array of boost factors for each column (default is 1.0 for all).
+     *  - `operator`: The logical operator to use for combining terms in the query (default is "OR").
+     */
+    constructor(query: string, columns: string[], options?: {
+        boosts?: number[];
+        operator?: Operator;
+    });
+    queryType(): FullTextQueryType;
+}
+export declare class BooleanQuery implements FullTextQuery {
+    /** @ignore */
+    readonly inner: JsFullTextQuery;
+    /**
+     * Creates an instance of BooleanQuery.
+     *
+     * @param queries - An array of (Occur, FullTextQuery objects) to combine.
+     * Occur specifies whether the query must match, or should match.
+     */
+    constructor(queries: [Occur, FullTextQuery][]);
+    queryType(): FullTextQueryType;
+}