* server: rename built-in tools to server tools * ui: rename built-in tools to server/browser tools
125 lines
3.8 KiB
TypeScript
125 lines
3.8 KiB
TypeScript
/**
|
|
* Shared `file_glob_search` runners with a short-lived result cache, so a
|
|
* repeated query for the same (type, path, glob, depth) reuses the last
|
|
* result instead of re-walking the tree.
|
|
*/
|
|
|
|
import { lastPathSegment } from './path-display';
|
|
import { buildGlobSearchArgs, joinPath, rankEntries } from './working-directory';
|
|
import { GLOB, PATH_SEPARATOR, SEARCH } from '$lib/constants';
|
|
import { BuiltInTool, GlobSearchType } from '$lib/enums';
|
|
import { ToolsService } from '$lib/services/tools.service';
|
|
import type {
|
|
GlobEntry,
|
|
GlobEntryResult,
|
|
GlobSearchArgs,
|
|
GlobSearchChildOptions,
|
|
GlobSearchChildResult,
|
|
GlobSearchResult
|
|
} from '$lib/types/glob';
|
|
|
|
const SEARCH_CACHE_TTL_MS = 2000;
|
|
|
|
interface CacheEntry {
|
|
results: GlobEntry[];
|
|
base: string;
|
|
at: number;
|
|
}
|
|
|
|
const searchCache = new Map<string, CacheEntry>();
|
|
|
|
export async function runGlobSearch(
|
|
args: GlobSearchArgs,
|
|
type: GlobSearchType,
|
|
limit: number,
|
|
signal: AbortSignal
|
|
): Promise<GlobSearchResult> {
|
|
const key = `${type}\u0000${args.path}\u0000${args.include}\u0000${args.maxDepth}\u0000${limit}`;
|
|
const cached = searchCache.get(key);
|
|
|
|
if (cached && Date.now() - cached.at < SEARCH_CACHE_TTL_MS) {
|
|
return { base: cached.base, entries: cached.results };
|
|
}
|
|
|
|
const res = await ToolsService.executeToolRaw(
|
|
BuiltInTool.SERVER_FILE_GLOB_SEARCH,
|
|
{ include: args.include, limit, max_depth: args.maxDepth, path: args.path, type },
|
|
signal
|
|
);
|
|
|
|
if (typeof res.error === 'string') return { base: '', entries: [], error: res.error };
|
|
|
|
const base = typeof res.base === 'string' ? res.base : '';
|
|
const entries = Array.isArray(res.entries) ? (res.entries as GlobEntry[]) : [];
|
|
const now = Date.now();
|
|
|
|
// prune stale entries so the short-lived cache cannot grow unbounded
|
|
for (const [k, v] of searchCache) {
|
|
if (now - v.at >= SEARCH_CACHE_TTL_MS) searchCache.delete(k);
|
|
}
|
|
searchCache.set(key, { at: now, base, results: entries });
|
|
|
|
return { base, entries };
|
|
}
|
|
|
|
function toEntryResult(e: GlobEntry, base: string): GlobEntryResult {
|
|
return { name: lastPathSegment(e.path), path: joinPath(base, e.path), type: e.type };
|
|
}
|
|
|
|
/**
|
|
* One ranked glob search that may also list the matched directory's
|
|
* children, shared by the WD picker (descend on exact match) and the
|
|
* mention picker (descend on a trailing `/` or `\`).
|
|
*/
|
|
export async function runGlobSearchWithChildren(
|
|
query: string,
|
|
scopePath: string,
|
|
searchDepth: number,
|
|
limit: number,
|
|
signal: AbortSignal,
|
|
options: GlobSearchChildOptions = {}
|
|
): Promise<GlobSearchChildResult> {
|
|
const {
|
|
childMaxDepth = SEARCH.PATH_NAV_MAX_DEPTH,
|
|
descendOnTrailingSeparator = false,
|
|
type = GlobSearchType.ALL
|
|
} = options;
|
|
const args = buildGlobSearchArgs(query, scopePath, searchDepth);
|
|
const res = await runGlobSearch(args, type, limit, signal);
|
|
|
|
if (res.error) return { args, base: res.base, entries: [], error: res.error };
|
|
|
|
const ranked = rankEntries(res.entries, args.rankQuery);
|
|
const entries = ranked.map((e) => toEntryResult(e, res.base));
|
|
const last = args.last;
|
|
|
|
if (last) {
|
|
const wantsDescend = descendOnTrailingSeparator
|
|
? query.endsWith(PATH_SEPARATOR) || query.endsWith(GLOB.WINDOWS_SEPARATOR)
|
|
: true;
|
|
const exact = ranked.find(
|
|
(e) => e.type === 'dir' && lastPathSegment(e.path).toLowerCase() === last.toLowerCase()
|
|
);
|
|
|
|
if (wantsDescend && exact) {
|
|
const exactDir = joinPath(res.base, exact.path);
|
|
const childRes = await runGlobSearch(
|
|
{ include: GLOB.WILDCARD, maxDepth: childMaxDepth, path: exactDir, rankQuery: '' },
|
|
type,
|
|
limit,
|
|
signal
|
|
);
|
|
|
|
if (!childRes.error) {
|
|
const children = childRes.entries
|
|
.map((e) => toEntryResult(e, childRes.base))
|
|
.sort((a, b) => a.path.localeCompare(b.path));
|
|
|
|
return { args, base: res.base, entries: [...entries, ...children], exactDir };
|
|
}
|
|
}
|
|
}
|
|
|
|
return { args, base: res.base, entries };
|
|
}
|