@getpaseo/protocol 0.3.0-beta.3 → 0.3.0

package/dist/messages.d.ts

@@ -979,6 +979,7 @@ export declare const FetchAgentHistoryRequestMessageSchema: z.ZodObject<{
         requiresAttention: z.ZodOptional<z.ZodBoolean>;
         thinkingOptionId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
     }, z.core.$strip>>;
+    search: z.ZodOptional<z.ZodString>;
     sort: z.ZodOptional<z.ZodArray<z.ZodObject<{
         key: z.ZodEnum<{
             title: "title";
@@ -3286,6 +3287,7 @@ export declare const SessionInboundMessageSchema: z.ZodDiscriminatedUnion<[z.Zod
         requiresAttention: z.ZodOptional<z.ZodBoolean>;
         thinkingOptionId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
     }, z.core.$strip>>;
+    search: z.ZodOptional<z.ZodString>;
     sort: z.ZodOptional<z.ZodArray<z.ZodObject<{
         key: z.ZodEnum<{
             title: "title";
@@ -5070,6 +5072,7 @@ export declare const ServerInfoStatusPayloadSchema: z.ZodPipe<z.ZodObject<{
         "terminal-size-ownership": z.ZodOptional<z.ZodBoolean>;
         rewind: z.ZodOptional<z.ZodBoolean>;
         agentTimelinePromptIndex: z.ZodOptional<z.ZodBoolean>;
+        agentHistorySearch: z.ZodOptional<z.ZodBoolean>;
         checkoutRefresh: z.ZodOptional<z.ZodBoolean>;
         workspaceMultiplicity: z.ZodOptional<z.ZodBoolean>;
         projectRemove: z.ZodOptional<z.ZodBoolean>;
@@ -5136,6 +5139,7 @@ export declare const ServerInfoStatusPayloadSchema: z.ZodPipe<z.ZodObject<{
         "terminal-size-ownership"?: boolean | undefined;
         rewind?: boolean | undefined;
         agentTimelinePromptIndex?: boolean | undefined;
+        agentHistorySearch?: boolean | undefined;
         checkoutRefresh?: boolean | undefined;
         workspaceMultiplicity?: boolean | undefined;
         projectRemove?: boolean | undefined;
@@ -5203,6 +5207,7 @@ export declare const ServerInfoStatusPayloadSchema: z.ZodPipe<z.ZodObject<{
         "terminal-size-ownership"?: boolean | undefined;
         rewind?: boolean | undefined;
         agentTimelinePromptIndex?: boolean | undefined;
+        agentHistorySearch?: boolean | undefined;
         checkoutRefresh?: boolean | undefined;
         workspaceMultiplicity?: boolean | undefined;
         projectRemove?: boolean | undefined;
@@ -6724,6 +6729,25 @@ export declare const AgentListMessageSchema: z.ZodObject<{
         }, z.core.$strip>>;
     }, z.core.$strip>;
 }, z.core.$strip>;
+export declare const AgentSearchMatchFieldSchema: z.ZodEnum<{
+    title: "title";
+    branch: "branch";
+    workspace: "workspace";
+    project: "project";
+}>;
+export declare const AgentSearchMatchSchema: z.ZodObject<{
+    field: z.ZodEnum<{
+        title: "title";
+        branch: "branch";
+        workspace: "workspace";
+        project: "project";
+    }>;
+    ranges: z.ZodArray<z.ZodObject<{
+        start: z.ZodNumber;
+        length: z.ZodNumber;
+    }, z.core.$strip>>;
+}, z.core.$strip>;
+export type AgentSearchMatch = z.infer<typeof AgentSearchMatchSchema>;
 export declare const FetchAgentsResponseMessageSchema: z.ZodObject<{
     type: z.ZodLiteral<"fetch_agents_response">;
     payload: z.ZodObject<{
@@ -6874,6 +6898,19 @@ export declare const FetchAgentsResponseMessageSchema: z.ZodObject<{
                     worktreeRoot?: string | undefined;
                 }>>]>;
             }, z.core.$strip>;
+            searchScore: z.ZodOptional<z.ZodNumber>;
+            searchMatches: z.ZodOptional<z.ZodArray<z.ZodObject<{
+                field: z.ZodEnum<{
+                    title: "title";
+                    branch: "branch";
+                    workspace: "workspace";
+                    project: "project";
+                }>;
+                ranges: z.ZodArray<z.ZodObject<{
+                    start: z.ZodNumber;
+                    length: z.ZodNumber;
+                }, z.core.$strip>>;
+            }, z.core.$strip>>>;
         }, z.core.$strip>>;
         pageInfo: z.ZodObject<{
             nextCursor: z.ZodNullable<z.ZodString>;
@@ -7031,12 +7068,26 @@ export declare const FetchAgentHistoryResponseMessageSchema: z.ZodObject<{
                     worktreeRoot?: string | undefined;
                 }>>]>;
             }, z.core.$strip>;
+            searchScore: z.ZodOptional<z.ZodNumber>;
+            searchMatches: z.ZodOptional<z.ZodArray<z.ZodObject<{
+                field: z.ZodEnum<{
+                    title: "title";
+                    branch: "branch";
+                    workspace: "workspace";
+                    project: "project";
+                }>;
+                ranges: z.ZodArray<z.ZodObject<{
+                    start: z.ZodNumber;
+                    length: z.ZodNumber;
+                }, z.core.$strip>>;
+            }, z.core.$strip>>>;
         }, z.core.$strip>>;
         pageInfo: z.ZodObject<{
             nextCursor: z.ZodNullable<z.ZodString>;
             prevCursor: z.ZodNullable<z.ZodString>;
             hasMore: z.ZodBoolean;
         }, z.core.$strip>;
+        searchTruncated: z.ZodOptional<z.ZodBoolean>;
     }, z.core.$strip>;
 }, z.core.$strip>;
 export declare const FetchRecentProviderSessionsResponseMessageSchema: z.ZodObject<{
@@ -15043,6 +15094,19 @@ export declare const SessionOutboundMessageSchema: z.ZodDiscriminatedUnion<[z.Zo
                     worktreeRoot?: string | undefined;
                 }>>]>;
             }, z.core.$strip>;
+            searchScore: z.ZodOptional<z.ZodNumber>;
+            searchMatches: z.ZodOptional<z.ZodArray<z.ZodObject<{
+                field: z.ZodEnum<{
+                    title: "title";
+                    branch: "branch";
+                    workspace: "workspace";
+                    project: "project";
+                }>;
+                ranges: z.ZodArray<z.ZodObject<{
+                    start: z.ZodNumber;
+                    length: z.ZodNumber;
+                }, z.core.$strip>>;
+            }, z.core.$strip>>>;
         }, z.core.$strip>>;
         pageInfo: z.ZodObject<{
             nextCursor: z.ZodNullable<z.ZodString>;
@@ -15199,12 +15263,26 @@ export declare const SessionOutboundMessageSchema: z.ZodDiscriminatedUnion<[z.Zo
                     worktreeRoot?: string | undefined;
                 }>>]>;
             }, z.core.$strip>;
+            searchScore: z.ZodOptional<z.ZodNumber>;
+            searchMatches: z.ZodOptional<z.ZodArray<z.ZodObject<{
+                field: z.ZodEnum<{
+                    title: "title";
+                    branch: "branch";
+                    workspace: "workspace";
+                    project: "project";
+                }>;
+                ranges: z.ZodArray<z.ZodObject<{
+                    start: z.ZodNumber;
+                    length: z.ZodNumber;
+                }, z.core.$strip>>;
+            }, z.core.$strip>>>;
         }, z.core.$strip>>;
         pageInfo: z.ZodObject<{
             nextCursor: z.ZodNullable<z.ZodString>;
             prevCursor: z.ZodNullable<z.ZodString>;
             hasMore: z.ZodBoolean;
         }, z.core.$strip>;
+        searchTruncated: z.ZodOptional<z.ZodBoolean>;
     }, z.core.$strip>;
 }, z.core.$strip>, z.ZodObject<{
     type: z.ZodLiteral<"fetch_recent_provider_sessions_response">;
@@ -21816,6 +21894,7 @@ export declare const WSSessionInboundSchema: z.ZodObject<{
             requiresAttention: z.ZodOptional<z.ZodBoolean>;
             thinkingOptionId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
         }, z.core.$strip>>;
+        search: z.ZodOptional<z.ZodString>;
         sort: z.ZodOptional<z.ZodArray<z.ZodObject<{
             key: z.ZodEnum<{
                 title: "title";
@@ -24950,6 +25029,19 @@ export declare const WSSessionOutboundSchema: z.ZodObject<{
                         worktreeRoot?: string | undefined;
                     }>>]>;
                 }, z.core.$strip>;
+                searchScore: z.ZodOptional<z.ZodNumber>;
+                searchMatches: z.ZodOptional<z.ZodArray<z.ZodObject<{
+                    field: z.ZodEnum<{
+                        title: "title";
+                        branch: "branch";
+                        workspace: "workspace";
+                        project: "project";
+                    }>;
+                    ranges: z.ZodArray<z.ZodObject<{
+                        start: z.ZodNumber;
+                        length: z.ZodNumber;
+                    }, z.core.$strip>>;
+                }, z.core.$strip>>>;
             }, z.core.$strip>>;
             pageInfo: z.ZodObject<{
                 nextCursor: z.ZodNullable<z.ZodString>;
@@ -25106,12 +25198,26 @@ export declare const WSSessionOutboundSchema: z.ZodObject<{
                         worktreeRoot?: string | undefined;
                     }>>]>;
                 }, z.core.$strip>;
+                searchScore: z.ZodOptional<z.ZodNumber>;
+                searchMatches: z.ZodOptional<z.ZodArray<z.ZodObject<{
+                    field: z.ZodEnum<{
+                        title: "title";
+                        branch: "branch";
+                        workspace: "workspace";
+                        project: "project";
+                    }>;
+                    ranges: z.ZodArray<z.ZodObject<{
+                        start: z.ZodNumber;
+                        length: z.ZodNumber;
+                    }, z.core.$strip>>;
+                }, z.core.$strip>>>;
             }, z.core.$strip>>;
             pageInfo: z.ZodObject<{
                 nextCursor: z.ZodNullable<z.ZodString>;
                 prevCursor: z.ZodNullable<z.ZodString>;
                 hasMore: z.ZodBoolean;
             }, z.core.$strip>;
+            searchTruncated: z.ZodOptional<z.ZodBoolean>;
         }, z.core.$strip>;
     }, z.core.$strip>, z.ZodObject<{
         type: z.ZodLiteral<"fetch_recent_provider_sessions_response">;
@@ -31385,6 +31491,7 @@ export declare const WSInboundMessageSchema: z.ZodDiscriminatedUnion<[z.ZodObjec
             requiresAttention: z.ZodOptional<z.ZodBoolean>;
             thinkingOptionId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
         }, z.core.$strip>>;
+        search: z.ZodOptional<z.ZodString>;
         sort: z.ZodOptional<z.ZodArray<z.ZodObject<{
             key: z.ZodEnum<{
                 title: "title";
@@ -34521,6 +34628,19 @@ export declare const WSOutboundMessageSchema: z.ZodDiscriminatedUnion<[z.ZodObje
                         worktreeRoot?: string | undefined;
                     }>>]>;
                 }, z.core.$strip>;
+                searchScore: z.ZodOptional<z.ZodNumber>;
+                searchMatches: z.ZodOptional<z.ZodArray<z.ZodObject<{
+                    field: z.ZodEnum<{
+                        title: "title";
+                        branch: "branch";
+                        workspace: "workspace";
+                        project: "project";
+                    }>;
+                    ranges: z.ZodArray<z.ZodObject<{
+                        start: z.ZodNumber;
+                        length: z.ZodNumber;
+                    }, z.core.$strip>>;
+                }, z.core.$strip>>>;
             }, z.core.$strip>>;
             pageInfo: z.ZodObject<{
                 nextCursor: z.ZodNullable<z.ZodString>;
@@ -34677,12 +34797,26 @@ export declare const WSOutboundMessageSchema: z.ZodDiscriminatedUnion<[z.ZodObje
                         worktreeRoot?: string | undefined;
                     }>>]>;
                 }, z.core.$strip>;
+                searchScore: z.ZodOptional<z.ZodNumber>;
+                searchMatches: z.ZodOptional<z.ZodArray<z.ZodObject<{
+                    field: z.ZodEnum<{
+                        title: "title";
+                        branch: "branch";
+                        workspace: "workspace";
+                        project: "project";
+                    }>;
+                    ranges: z.ZodArray<z.ZodObject<{
+                        start: z.ZodNumber;
+                        length: z.ZodNumber;
+                    }, z.core.$strip>>;
+                }, z.core.$strip>>>;
             }, z.core.$strip>>;
             pageInfo: z.ZodObject<{
                 nextCursor: z.ZodNullable<z.ZodString>;
                 prevCursor: z.ZodNullable<z.ZodString>;
                 hasMore: z.ZodBoolean;
             }, z.core.$strip>;
+            searchTruncated: z.ZodOptional<z.ZodBoolean>;
         }, z.core.$strip>;
     }, z.core.$strip>, z.ZodObject<{
         type: z.ZodLiteral<"fetch_recent_provider_sessions_response">;

package/dist/messages.js

@@ -927,6 +927,10 @@ export const FetchAgentHistoryRequestMessageSchema = z.object({
     type: z.literal("fetch_agent_history_request"),
     requestId: z.string(),
     filter: AgentDirectoryFilterSchema.optional(),
+    // A ranked free-text query over agent title, workspace name, branch, and
+    // project name. Present only on history: agent subscriptions filter on
+    // structure, not on relevance. Ranking replaces `sort` when it is set.
+    search: z.string().optional(),
     sort: z
         .array(z.object({
         key: z.enum(["status_priority", "created_at", "updated_at", "title"]),
@@ -2464,6 +2468,8 @@ export const ServerInfoStatusPayloadSchema = z
         rewind: z.boolean().optional(),
         // COMPAT(agentTimelinePromptIndex): added in v0.2.X, drop the gate when floor >= v0.2.X.
         agentTimelinePromptIndex: z.boolean().optional(),
+        // COMPAT(agentHistorySearch): added in v0.3.0, remove gate after 2027-02-07.
+        agentHistorySearch: z.boolean().optional(),
         // COMPAT(checkoutRefresh): added in v0.1.86, remove gate after 2026-11-29.
         checkoutRefresh: z.boolean().optional(),
         // COMPAT(workspaceMultiplicity): added in v0.1.97, drop the gate when floor >= v0.1.97
@@ -2858,9 +2864,25 @@ export const AgentListMessageSchema = z.object({
         agents: z.array(AgentSnapshotPayloadSchema),
     }),
 });
+export const AgentSearchMatchFieldSchema = z.enum(["workspace", "title", "branch", "project"]);
+export const AgentSearchMatchSchema = z.object({
+    field: AgentSearchMatchFieldSchema,
+    ranges: z.array(z.object({
+        start: z.number().int().nonnegative(),
+        length: z.number().int().positive(),
+    })),
+});
 const AgentDirectoryResponseEntrySchema = z.object({
     agent: AgentSnapshotPayloadSchema,
     project: ProjectPlacementPayloadSchema,
+    // Relevance of this entry to the request's `search`, lower being better.
+    // Set only when the request carried a query; a client merging results from
+    // several hosts needs it to interleave their separately ranked pages.
+    searchScore: z.number().optional(),
+    // Where the query matched, so the row can mark it. The ranker computes this
+    // anyway; sending it keeps the client from re-deriving a second opinion that
+    // could disagree with the ranking it is explaining.
+    searchMatches: z.array(AgentSearchMatchSchema).optional(),
 });
 const AgentDirectoryPageInfoSchema = z.object({
     nextCursor: z.string().nullable(),
@@ -2882,6 +2904,10 @@ export const FetchAgentHistoryResponseMessageSchema = z.object({
         requestId: z.string(),
         entries: z.array(AgentDirectoryResponseEntrySchema),
         pageInfo: AgentDirectoryPageInfoSchema,
+        // More sessions matched the request's `search` than the page could hold.
+        // Distinct from `pageInfo.hasMore`, which promises a fetchable next page —
+        // a ranked result set has none, and the way on is a narrower query.
+        searchTruncated: z.boolean().optional(),
     }),
 });
 export const FetchRecentProviderSessionsResponseMessageSchema = z.object({

package/dist/search/text-match.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Ranked text matching shared by the app's pickers and the daemon's history
+ * search. A match is a tier plus the offset it was found at; lower is better on
+ * both, so callers sort ascending and never have to invent a scale.
+ *
+ * Typo tolerance is opt-in via `fuzzy`. The pickers leave it off — a combobox
+ * over a known list wants exact narrowing — while history search turns it on
+ * because the user is recalling a title from memory.
+ */
+export interface MatchScore {
+    tier: number;
+    offset: number;
+    spread?: number;
+}
+export interface MatchOptions {
+    /** Omit or pass null to match exactly. `fuzzyPolicyForToken` picks a policy. */
+    fuzzy?: FuzzyPolicy | null;
+}
+/**
+ * How much a typo in one query token is forgiven. Short tokens get
+ * transpositions and nothing else: at four characters a free substitution turns
+ * "main" into "mail", "maid", and "rain", while a swap can only ever reach the
+ * word the user meant. Null means the token is matched exactly.
+ */
+export interface FuzzyPolicy {
+    maxEdits: number;
+    transpositionsOnly: boolean;
+}
+export declare function fuzzyPolicyForToken(token: string): FuzzyPolicy | null;
+export declare function scoreMatch(query: string, text: string, options?: MatchOptions): MatchScore | null;
+export interface MatchRange {
+    start: number;
+    length: number;
+}
+/**
+ * Where a score's match actually landed, so a caller can mark it. Derived from
+ * a score rather than produced alongside one: ranking touches every candidate
+ * and needs no ranges, while only the handful of rows that get rendered do.
+ *
+ * The tier decides the shape. A substring hit is one span; a subsequence hit is
+ * the scattered characters it walked; a typo hit marks the whole word, because
+ * the characters the user got wrong are not in the text to point at.
+ */
+export declare function matchRanges(query: string, text: string, score: MatchScore): MatchRange[];
+export declare function compareMatchScores(a: MatchScore, b: MatchScore): number;
+export declare function tokenizeQuery(query: string): string[];
+export interface TextFieldsOptions {
+    /**
+     * Forgive typos. The budget is per token rather than per query, because a
+     * query mixes long words that can absorb an edit with short ones that cannot.
+     */
+    typoTolerant?: boolean;
+}
+export declare function scoreTextFields(query: string, fields: string[], options?: TextFieldsOptions): MatchScore | null;
+//# sourceMappingURL=text-match.d.ts.map

package/dist/search/text-match.js

@@ -0,0 +1,262 @@
+/**
+ * Ranked text matching shared by the app's pickers and the daemon's history
+ * search. A match is a tier plus the offset it was found at; lower is better on
+ * both, so callers sort ascending and never have to invent a scale.
+ *
+ * Typo tolerance is opt-in via `fuzzy`. The pickers leave it off — a combobox
+ * over a known list wants exact narrowing — while history search turns it on
+ * because the user is recalling a title from memory.
+ */
+/** Exact tiers, best to worst. The fuzzy tier always sorts after all of them. */
+const TIER_EXACT = 0;
+const TIER_WHOLE_WORD = 1;
+const TIER_PREFIX = 2;
+const TIER_WORD_START = 3;
+const TIER_SUBSTRING = 4;
+const TIER_SUBSEQUENCE = 5;
+const TIER_FUZZY = 6;
+function isWordBoundaryChar(ch) {
+    if (ch === undefined)
+        return true;
+    return !/[a-z0-9]/.test(ch);
+}
+function scoreSubstringMatch(query, text) {
+    let best = null;
+    let pos = 0;
+    while (pos <= text.length - query.length) {
+        const found = text.indexOf(query, pos);
+        if (found === -1)
+            break;
+        const before = found > 0 ? text[found - 1] : undefined;
+        const after = text[found + query.length];
+        const startsAtBoundary = found === 0 || isWordBoundaryChar(before);
+        const endsAtBoundary = after === undefined || isWordBoundaryChar(after);
+        let tier;
+        if (startsAtBoundary && endsAtBoundary) {
+            tier = TIER_WHOLE_WORD;
+        }
+        else if (found === 0) {
+            tier = TIER_PREFIX;
+        }
+        else if (startsAtBoundary) {
+            tier = TIER_WORD_START;
+        }
+        else {
+            tier = TIER_SUBSTRING;
+        }
+        if (!best || tier < best.tier || (tier === best.tier && found < best.offset)) {
+            best = { tier, offset: found };
+        }
+        pos = found + 1;
+    }
+    return best;
+}
+function scoreSubsequenceMatch(query, text) {
+    let queryIndex = 0;
+    let firstIndex = -1;
+    let lastIndex = -1;
+    for (let textIndex = 0; textIndex < text.length && queryIndex < query.length; textIndex += 1) {
+        if (text[textIndex] !== query[queryIndex])
+            continue;
+        if (firstIndex === -1)
+            firstIndex = textIndex;
+        lastIndex = textIndex;
+        queryIndex += 1;
+    }
+    if (queryIndex !== query.length || firstIndex === -1)
+        return null;
+    return { tier: TIER_SUBSEQUENCE, offset: firstIndex, spread: lastIndex - firstIndex + 1 };
+}
+/**
+ * Damerau-Levenshtein distance, abandoned as soon as every cell in a row is
+ * over budget. Bounding it is what keeps the fuzzy tier affordable to run
+ * against every word of every candidate.
+ */
+function boundedEditDistance(query, word, budget) {
+    if (Math.abs(query.length - word.length) > budget)
+        return null;
+    let twoRowsBack = [];
+    let previousRow = Array.from({ length: word.length + 1 }, (_, index) => index);
+    for (let queryIndex = 1; queryIndex <= query.length; queryIndex += 1) {
+        const currentRow = [queryIndex];
+        let rowBest = queryIndex;
+        for (let wordIndex = 1; wordIndex <= word.length; wordIndex += 1) {
+            const substitutionCost = query[queryIndex - 1] === word[wordIndex - 1] ? 0 : 1;
+            let cost = Math.min(currentRow[wordIndex - 1] + 1, previousRow[wordIndex] + 1, previousRow[wordIndex - 1] + substitutionCost);
+            const isTransposition = queryIndex > 1 &&
+                wordIndex > 1 &&
+                query[queryIndex - 1] === word[wordIndex - 2] &&
+                query[queryIndex - 2] === word[wordIndex - 1];
+            if (isTransposition) {
+                cost = Math.min(cost, twoRowsBack[wordIndex - 2] + 1);
+            }
+            currentRow.push(cost);
+            rowBest = Math.min(rowBest, cost);
+        }
+        if (rowBest > budget)
+            return null;
+        twoRowsBack = previousRow;
+        previousRow = currentRow;
+    }
+    const distance = previousRow[word.length];
+    return distance <= budget ? distance : null;
+}
+function transpositionDistance(query, word) {
+    return isAdjacentTransposition(query, word) ? 1 : null;
+}
+/** True when the two differ only by one swap of neighbouring characters. */
+function isAdjacentTransposition(query, word) {
+    if (query.length !== word.length)
+        return false;
+    let index = 0;
+    while (index < query.length && query[index] === word[index])
+        index += 1;
+    if (index >= query.length - 1)
+        return false;
+    if (query[index] !== word[index + 1] || query[index + 1] !== word[index])
+        return false;
+    return query.slice(index + 2) === word.slice(index + 2);
+}
+export function fuzzyPolicyForToken(token) {
+    if (token.length <= 3)
+        return null;
+    if (token.length === 4)
+        return { maxEdits: 1, transpositionsOnly: true };
+    if (token.length <= 7)
+        return { maxEdits: 1, transpositionsOnly: false };
+    return { maxEdits: 2, transpositionsOnly: false };
+}
+/**
+ * Words are what people mistype, so the fuzzy tier compares the query against
+ * each word rather than against the whole string — otherwise a long title's
+ * length difference alone would blow the budget.
+ */
+function scoreFuzzyMatch(query, text, policy) {
+    if (policy.maxEdits <= 0 || query.length <= policy.maxEdits)
+        return null;
+    let best = null;
+    const wordPattern = /[a-z0-9]+/g;
+    let word = wordPattern.exec(text);
+    while (word !== null) {
+        // Compare against the whole word and against its leading slices, so a typo
+        // in a prefix ("confug" for "configuration") still lands — the length gap
+        // to the full word would otherwise blow the budget on its own.
+        const candidates = new Set([
+            word[0],
+            word[0].slice(0, query.length),
+            word[0].slice(0, query.length + policy.maxEdits),
+        ]);
+        for (const candidate of candidates) {
+            const distance = policy.transpositionsOnly
+                ? transpositionDistance(query, candidate)
+                : boundedEditDistance(query, candidate, policy.maxEdits);
+            if (distance === null)
+                continue;
+            const score = { tier: TIER_FUZZY, offset: word.index, spread: distance };
+            if (!best || compareMatchScores(score, best) < 0) {
+                best = score;
+            }
+        }
+        word = wordPattern.exec(text);
+    }
+    return best;
+}
+export function scoreMatch(query, text, options = {}) {
+    if (!query)
+        return { tier: TIER_EXACT, offset: 0 };
+    const q = query.toLowerCase();
+    const t = text.toLowerCase();
+    if (t === q)
+        return { tier: TIER_EXACT, offset: 0 };
+    const exact = scoreSubstringMatch(q, t) ?? scoreSubsequenceMatch(q, t);
+    if (exact)
+        return exact;
+    const fuzzy = options.fuzzy;
+    return fuzzy ? scoreFuzzyMatch(q, t, fuzzy) : null;
+}
+function mergeAdjacentRanges(indices) {
+    const ranges = [];
+    for (const index of indices) {
+        const last = ranges.at(-1);
+        if (last && last.start + last.length === index) {
+            last.length += 1;
+            continue;
+        }
+        ranges.push({ start: index, length: 1 });
+    }
+    return ranges;
+}
+function wordRangeAt(text, offset) {
+    let end = offset;
+    while (end < text.length && /[a-z0-9]/.test(text[end]))
+        end += 1;
+    return { start: offset, length: Math.max(end - offset, 1) };
+}
+/**
+ * Where a score's match actually landed, so a caller can mark it. Derived from
+ * a score rather than produced alongside one: ranking touches every candidate
+ * and needs no ranges, while only the handful of rows that get rendered do.
+ *
+ * The tier decides the shape. A substring hit is one span; a subsequence hit is
+ * the scattered characters it walked; a typo hit marks the whole word, because
+ * the characters the user got wrong are not in the text to point at.
+ */
+export function matchRanges(query, text, score) {
+    if (!query)
+        return [];
+    const q = query.toLowerCase();
+    const t = text.toLowerCase();
+    if (score.tier === TIER_EXACT)
+        return [{ start: 0, length: text.length }];
+    if (score.tier === TIER_FUZZY)
+        return [wordRangeAt(t, score.offset)];
+    if (score.tier === TIER_SUBSEQUENCE) {
+        const indices = [];
+        let queryIndex = 0;
+        for (let textIndex = 0; textIndex < t.length && queryIndex < q.length; textIndex += 1) {
+            if (t[textIndex] !== q[queryIndex])
+                continue;
+            indices.push(textIndex);
+            queryIndex += 1;
+        }
+        return mergeAdjacentRanges(indices);
+    }
+    return [{ start: score.offset, length: q.length }];
+}
+export function compareMatchScores(a, b) {
+    if (a.tier !== b.tier)
+        return a.tier - b.tier;
+    if (a.offset !== b.offset)
+        return a.offset - b.offset;
+    return (a.spread ?? 0) - (b.spread ?? 0);
+}
+export function tokenizeQuery(query) {
+    return query
+        .trim()
+        .toLowerCase()
+        .split(/\s+/)
+        .filter((token) => token.length > 0);
+}
+export function scoreTextFields(query, fields, options = {}) {
+    const tokens = tokenizeQuery(query);
+    if (tokens.length === 0)
+        return { tier: TIER_EXACT, offset: 0, spread: 0 };
+    const aggregate = { tier: TIER_EXACT, offset: 0, spread: 0 };
+    for (const token of tokens) {
+        const fuzzy = options.typoTolerant ? fuzzyPolicyForToken(token) : null;
+        let best = null;
+        for (const field of fields) {
+            const score = scoreMatch(token, field, { fuzzy });
+            if (score && (!best || compareMatchScores(score, best) < 0)) {
+                best = score;
+            }
+        }
+        if (!best)
+            return null;
+        aggregate.tier += best.tier;
+        aggregate.offset += best.offset;
+        aggregate.spread = (aggregate.spread ?? 0) + (best.spread ?? token.length);
+    }
+    return aggregate;
+}
+//# sourceMappingURL=text-match.js.map