@mesadev/sdk 0.47.3 → 0.48.1

package/dist/fs/search-grep.js

@@ -0,0 +1,208 @@
+/**
+ * A `grep -r` that searches next to the storage instead of walking the mount.
+ *
+ * This is a narrower replacement than the `rg` one, because grep's defaults
+ * differ from ripgrep's in ways that change answers rather than performance:
+ * patterns are Basic Regular Expressions, matching is case-sensitive, and
+ * recursion happens only with `-r` and a named path. Anything the built-in
+ * would reject, or answer from standard input, is left to the built-in, so a
+ * command line means the same thing whether or not the endpoint answered it.
+ *
+ * `-c` is left to the built-in for the same reason: grep counts every file it
+ * visited, printing `path:0` for the ones that did not match, and the endpoint
+ * reports only the files that did.
+ */
+import { breToRustRegex, ereToRustRegex } from './grep-pattern.js';
+import { absolute, belowTarget, displayPath, expandShortFlags, isDirectory, isHidden, MAX_PARALLEL_LEGS, mapBounded, mountsFromLayout, resolveLegs, searchLeg, } from './search-rg.js';
+/**
+ * Translate a grep command line into one search, or explain why it cannot be.
+ *
+ * Only what the built-in accepts is accepted here, and only what the endpoint
+ * answers exactly is served. Everything else falls back.
+ */
+export function planGrep(args, cwd, mounts) {
+    let pattern;
+    let patternFromFlag = false;
+    const positionals = [];
+    const includeGlobs = [];
+    const excludeGlobs = [];
+    let recursive = false;
+    let caseInsensitive = false;
+    let literal = false;
+    let extended = false;
+    let word = false;
+    let mode = 'lines';
+    let lineNumbers = false;
+    let showFilename = true;
+    const expanded = expandShortFlags(args, 'e');
+    for (let i = 0; i < expanded.length; i++) {
+        const arg = expanded[i] ?? '';
+        if (arg.startsWith('--include=') || arg.startsWith('--exclude=')) {
+            const glob = arg.slice('--include='.length);
+            // The built-in matches these against the basename alone and reads braces
+            // literally; the endpoint anchors a slashed glob at the repo root and
+            // expands braces. Neither is wrong, so neither is approximated.
+            if (/[/{]/.test(glob))
+                return { unservable: 'glob with a path or braces' };
+            (arg.startsWith('--include=') ? includeGlobs : excludeGlobs).push(glob);
+            continue;
+        }
+        if (!arg.startsWith('-') || arg === '-') {
+            if (pattern === undefined && !patternFromFlag)
+                pattern = arg;
+            else
+                positionals.push(arg);
+            continue;
+        }
+        switch (arg) {
+            case '-r':
+            case '-R':
+            case '--recursive':
+                recursive = true;
+                break;
+            case '-i':
+            case '--ignore-case':
+                caseInsensitive = true;
+                break;
+            case '-F':
+            case '--fixed-strings':
+                literal = true;
+                break;
+            case '-E':
+            case '--extended-regexp':
+                extended = true;
+                break;
+            case '-w':
+            case '--word-regexp':
+                word = true;
+                break;
+            case '-l':
+            case '--files-with-matches':
+                mode = 'files';
+                break;
+            case '-n':
+            case '--line-number':
+                lineNumbers = true;
+                break;
+            case '-h':
+            case '--no-filename':
+                showFilename = false;
+                break;
+            case '-e': {
+                const value = expanded[++i];
+                if (value === undefined)
+                    return { unservable: '-e requires a pattern' };
+                // One pattern per search: a second would need a union the endpoint
+                // does not take.
+                if (patternFromFlag || pattern !== undefined)
+                    return { unservable: 'more than one pattern' };
+                pattern = value;
+                patternFromFlag = true;
+                break;
+            }
+            default:
+                return { unservable: `${arg} is not supported by server-side search` };
+        }
+    }
+    if (pattern === undefined)
+        return { unservable: 'no pattern given' };
+    // Without -r, or without a path, the built-in reads a named file or standard
+    // input rather than walking anything.
+    if (!recursive || positionals.length === 0)
+        return { unservable: 'not a recursive search of a path' };
+    if (positionals.length > 1)
+        return { unservable: 'more than one search path' };
+    // `-F` is literal in both dialects and needs no translation.
+    let translated = pattern;
+    if (!literal) {
+        const converted = extended ? ereToRustRegex(pattern) : breToRustRegex(pattern);
+        if (converted === null)
+            return { unservable: 'pattern has no equivalent in the search dialect' };
+        translated = converted;
+    }
+    const typed = positionals[0];
+    const legs = resolveLegs(absolute(cwd, typed), mounts);
+    if ('unservable' in legs)
+        return legs;
+    return {
+        legs,
+        target: { typed, absolute: absolute(cwd, typed) },
+        request: {
+            pattern: translated,
+            mode,
+            caseMode: caseInsensitive ? 'insensitive' : 'sensitive',
+            literal,
+            word,
+            includeGlobs,
+            excludeGlobs,
+        },
+        lineNumbers,
+        showFilename,
+    };
+}
+/**
+ * Order paths the way a recursive walk over name-sorted directories visits
+ * them: segment by segment, so `utils/index.ts` precedes `utils.ts`.
+ */
+function walkOrder(a, b) {
+    const left = a.split('/');
+    const right = b.split('/');
+    for (let i = 0; i < Math.min(left.length, right.length); i++) {
+        const l = left[i];
+        const r = right[i];
+        if (l !== r)
+            return l < r ? -1 : 1;
+    }
+    return left.length - right.length;
+}
+/** Render results the way grep does. `-h` does not reach `-l`, whose answer is the path. */
+function format(matches, query) {
+    if (query.request.mode === 'files') {
+        return matches.map(({ path }) => `${path}\n`).join('');
+    }
+    return matches
+        .flatMap(({ path, match }) => match.lines.map((line) => `${query.showFilename ? `${path}:` : ''}${query.lineNumbers ? `${line.line_number}:` : ''}${line.text}\n`))
+        .join('');
+}
+/**
+ * Build the `grep` replacement.
+ *
+ * `fallback` runs the original command line through the built-in, and is
+ * called for anything this cannot answer exactly.
+ */
+export function createSearchGrep(config, fallback) {
+    const mounts = mountsFromLayout(config.layout);
+    return {
+        name: 'grep',
+        async execute(args, ctx) {
+            const plan = planGrep(args, ctx.cwd, mounts);
+            if ('unservable' in plan || !(await isDirectory(ctx, plan.target.absolute))) {
+                return fallback(args, ctx);
+            }
+            let found;
+            try {
+                const perLeg = await mapBounded(plan.legs, MAX_PARALLEL_LEGS, async (leg) => {
+                    const root = leg.mount.path === '/' ? '' : leg.mount.path;
+                    const kept = [];
+                    for await (const match of searchLeg(config, leg, plan.request)) {
+                        const suffix = belowTarget(`${root}/${match.path}`, plan.target);
+                        // The built-in walks past dot-prefixed entries during recursion,
+                        // even though POSIX grep does not.
+                        if (isHidden(suffix))
+                            continue;
+                        kept.push({ path: displayPath(suffix, plan.target), match });
+                    }
+                    return kept;
+                });
+                // The built-in walks the tree in sorted order and the endpoint does not.
+                found = perLeg.flat().sort((a, b) => walkOrder(a.path, b.path));
+            }
+            catch {
+                return fallback(args, ctx);
+            }
+            // grep's convention: 0 when something matched, 1 when nothing did.
+            return { stdout: format(found, plan), stderr: '', exitCode: found.length > 0 ? 0 : 1 };
+        },
+    };
+}
+//# sourceMappingURL=search-grep.js.map

package/dist/fs/search-grep.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-grep.js","sourceRoot":"","sources":["../../src/fs/search-grep.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnE,OAAO,EACL,QAAQ,EACR,WAAW,EACX,WAAW,EACX,gBAAgB,EAChB,WAAW,EACX,QAAQ,EACR,iBAAiB,EACjB,UAAU,EACV,gBAAgB,EAChB,WAAW,EACX,SAAS,GAOV,MAAM,gBAAgB,CAAC;AAYxB;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAc,EAAE,GAAW,EAAE,MAAe;IACnE,IAAI,OAA2B,CAAC;IAChC,IAAI,eAAe,GAAG,KAAK,CAAC;IAC5B,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,IAAI,eAAe,GAAG,KAAK,CAAC;IAC5B,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,IAAI,IAAI,GAA0B,OAAO,CAAC;IAC1C,IAAI,WAAW,GAAG,KAAK,CAAC;IACxB,IAAI,YAAY,GAAG,IAAI,CAAC;IAExB,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9B,IAAI,GAAG,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC;YACjE,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC5C,yEAAyE;YACzE,sEAAsE;YACtE,gEAAgE;YAChE,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,EAAE,UAAU,EAAE,4BAA4B,EAAE,CAAC;YAC3E,CAAC,GAAG,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxE,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;YACxC,IAAI,OAAO,KAAK,SAAS,IAAI,CAAC,eAAe;gBAAE,OAAO,GAAG,GAAG,CAAC;;gBACxD,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3B,SAAS;QACX,CAAC;QACD,QAAQ,GAAG,EAAE,CAAC;YACZ,KAAK,IAAI,CAAC;YACV,KAAK,IAAI,CAAC;YACV,KAAK,aAAa;gBAChB,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM;YACR,KAAK,IAAI,CAAC;YACV,KAAK,eAAe;gBAClB,eAAe,GAAG,IAAI,CAAC;gBACvB,MAAM;YACR,KAAK,IAAI,CAAC;YACV,KAAK,iBAAiB;gBACpB,OAAO,GAAG,IAAI,CAAC;gBACf,MAAM;YACR,KAAK,IAAI,CAAC;YACV,KAAK,mBAAmB;gBACtB,QAAQ,GAAG,IAAI,CAAC;gBAChB,MAAM;YACR,KAAK,IAAI,CAAC;YACV,KAAK,eAAe;gBAClB,IAAI,GAAG,IAAI,CAAC;gBACZ,MAAM;YACR,KAAK,IAAI,CAAC;YACV,KAAK,sBAAsB;gBACzB,IAAI,GAAG,OAAO,CAAC;gBACf,MAAM;YACR,KAAK,IAAI,CAAC;YACV,KAAK,eAAe;gBAClB,WAAW,GAAG,IAAI,CAAC;gBACnB,MAAM;YACR,KAAK,IAAI,CAAC;YACV,KAAK,eAAe;gBAClB,YAAY,GAAG,KAAK,CAAC;gBACrB,MAAM;YACR,KAAK,IAAI,CAAC,CAAC,CAAC;gBACV,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC5B,IAAI,KAAK,KAAK,SAAS;oBAAE,OAAO,EAAE,UAAU,EAAE,uBAAuB,EAAE,CAAC;gBACxE,mEAAmE;gBACnE,iBAAiB;gBACjB,IAAI,eAAe,IAAI,OAAO,KAAK,SAAS;oBAAE,OAAO,EAAE,UAAU,EAAE,uBAAuB,EAAE,CAAC;gBAC7F,OAAO,GAAG,KAAK,CAAC;gBAChB,eAAe,GAAG,IAAI,CAAC;gBACvB,MAAM;YACR,CAAC;YACD;gBACE,OAAO,EAAE,UAAU,EAAE,GAAG,GAAG,yCAAyC,EAAE,CAAC;QAC3E,CAAC;IACH,CAAC;IAED,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,EAAE,UAAU,EAAE,kBAAkB,EAAE,CAAC;IACrE,6EAA6E;IAC7E,sCAAsC;IACtC,IAAI,CAAC,SAAS,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,UAAU,EAAE,kCAAkC,EAAE,CAAC;IACtG,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,UAAU,EAAE,2BAA2B,EAAE,CAAC;IAE/E,6DAA6D;IAC7D,IAAI,UAAU,GAAG,OAAO,CAAC;IACzB,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QAC/E,IAAI,SAAS,KAAK,IAAI;YAAE,OAAO,EAAE,UAAU,EAAE,iDAAiD,EAAE,CAAC;QACjG,UAAU,GAAG,SAAS,CAAC;IACzB,CAAC;IAED,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAW,CAAC;IACvC,MAAM,IAAI,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;IACvD,IAAI,YAAY,IAAI,IAAI;QAAE,OAAO,IAAI,CAAC;IAEtC,OAAO;QACL,IAAI;QACJ,MAAM,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE;QACjD,OAAO,EAAE;YACP,OAAO,EAAE,UAAU;YACnB,IAAI;YACJ,QAAQ,EAAE,eAAe,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW;YACvD,OAAO;YACP,IAAI;YACJ,YAAY;YACZ,YAAY;SACb;QACD,WAAW;QACX,YAAY;KACb,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,CAAS,EAAE,CAAS;IACrC,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC1B,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7D,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;QAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;AACpC,CAAC;AAED,4FAA4F;AAC5F,SAAS,MAAM,CAAC,OAA+C,EAAE,KAAgB;IAC/E,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACnC,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,OAAO;SACX,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAC3B,KAAK,CAAC,KAAK,CAAC,GAAG,CACb,CAAC,IAAI,EAAE,EAAE,CACP,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,IAAI,CAC5G,CACF;SACA,IAAI,CAAC,EAAE,CAAC,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAA0B,EAC1B,QAAsE;IAEtE,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAE/C,OAAO;QACL,IAAI,EAAE,MAAM;QACZ,KAAK,CAAC,OAAO,CAAC,IAAc,EAAE,GAAmB;YAC/C,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC7C,IAAI,YAAY,IAAI,IAAI,IAAI,CAAC,CAAC,MAAM,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;gBAC5E,OAAO,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7B,CAAC;YAED,IAAI,KAA6C,CAAC;YAClD,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,iBAAiB,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;oBAC1E,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;oBAC1D,MAAM,IAAI,GAA2C,EAAE,CAAC;oBACxD,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;wBAC/D,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;wBACjE,iEAAiE;wBACjE,mCAAmC;wBACnC,IAAI,QAAQ,CAAC,MAAM,CAAC;4BAAE,SAAS;wBAC/B,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;oBAC/D,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC,CAAC,CAAC;gBACH,yEAAyE;gBACzE,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAClE,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7B,CAAC;YAED,mEAAmE;YACnE,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACzF,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/fs/search-rg.d.ts

@@ -0,0 +1,204 @@
+/**
+ * A `rg` that searches next to the storage instead of walking the mount.
+ *
+ * just-bash's built-in `rg` reads the filesystem, which over a Mesa mount costs
+ * a round trip per directory. This one translates the same command line into a
+ * single repository search and formats the response the way ripgrep would.
+ *
+ * A path may span several repositories, because a layout can nest one mount
+ * inside another. Each becomes its own search, issued in parallel, with the
+ * parent excluding the subtrees its children shadow so no file is counted
+ * twice or attributed to the wrong repository.
+ *
+ * It only replaces the built-in when it can answer exactly what was asked. A
+ * flag it does not implement, or a path outside every mount, defers to the
+ * built-in, so the worst case is the behaviour that exists today rather than a
+ * wrong answer.
+ */
+import type { Command, CommandContext, ExecResult } from 'just-bash';
+import type { Layout } from './layout.js';
+/** One repository as it appears in the mount namespace. */
+export type Mount = {
+    /** Absolute path in the mount where this repository's root sits. */
+    path: string;
+    repo: string;
+    bookmark?: string;
+    changeId?: string;
+};
+/** One repository's share of a search. */
+export type SearchLeg = {
+    mount: Mount;
+    /** Repo-relative directory to search under. */
+    pathPrefix: string;
+    /** Subtrees this repository owns but a nested mount covers. */
+    excludes: string[];
+};
+/** What the server needs to answer one search, across every repository it spans. */
+type SearchQuery = {
+    legs: SearchLeg[];
+    /**
+     * The search path as the caller typed it, and its absolute form.
+     *
+     * ripgrep reports each file the way the caller named its directory: a
+     * relative argument yields relative output, an absolute one absolute, and no
+     * argument at all yields paths relative to the working directory. Results
+     * come back repo-relative, so both are needed to put them back.
+     */
+    target: {
+        typed: string;
+        absolute: string;
+    };
+    hidden: boolean;
+    request: SearchRequest;
+};
+/**
+ * One search, in the endpoint's own vocabulary rather than any command's.
+ *
+ * `rg` and `grep` disagree about defaults — smart case against case-sensitive,
+ * Rust regex against a translated BRE — so each planner spells out what it
+ * means here and the request is sent as written.
+ */
+export type SearchRequest = {
+    pattern: string;
+    mode: 'lines' | 'count' | 'files';
+    caseMode: 'smart' | 'sensitive' | 'insensitive';
+    literal: boolean;
+    word: boolean;
+    includeGlobs: string[];
+    excludeGlobs: string[];
+};
+/**
+ * Searches issued at once for a single command.
+ *
+ * The server admits a small number of concurrent searches per task, so a
+ * layout with many nested repositories would otherwise let one `rg` fill the
+ * queue by itself and stall every other caller.
+ */
+export declare const MAX_PARALLEL_LEGS = 4;
+/** Why a command line could not be served, phrased for the reader of a log. */
+export type Unservable = {
+    unservable: string;
+};
+export type ServerSearchConfig = {
+    /** Versioned API root, e.g. `https://api.mesa.dev/v1`. */
+    apiBaseUrl: string;
+    org: string;
+    accessToken: string;
+    layout: Layout;
+    fetch?: typeof globalThis.fetch;
+};
+/**
+ * Flatten a layout into the repository roots it presents, longest path first.
+ *
+ * A single declaration mounts at its key; an array mounts each element in a
+ * child directory named by its alias. Nested declarations shadow the parent at
+ * their own path, which is why the list is ordered longest-first: the deepest
+ * mount containing a path is the one that owns it.
+ */
+export declare function mountsFromLayout(layout: Layout): Mount[];
+/** Absolute form of a path as typed on the command line. */
+export declare function absolute(cwd: string, path: string): string;
+export declare function resolveLegs(target: string, mounts: Mount[]): SearchLeg[] | Unservable;
+/**
+ * Translate a ripgrep command line into one search.
+ *
+ * The supported set is deliberately small. Anything else defers rather than
+ * approximating, because a flag that silently does nothing changes the answer.
+ */
+export declare function planSearch(args: string[], cwd: string, mounts: Mount[]): SearchQuery | Unservable;
+export type SearchMatch = {
+    path: string;
+    line_count: number;
+    lines: {
+        line_number: number;
+        text: string;
+    }[];
+};
+/**
+ * Run one leg's search, yielding each matching file as its row arrives.
+ *
+ * Shared by both command overrides so there is a single place that knows how
+ * the endpoint is addressed and how its rows arrive.
+ */
+export declare function searchLeg(config: ServerSearchConfig, leg: SearchLeg, request: SearchRequest): AsyncGenerator<SearchMatch>;
+/**
+ * Whether the search target is a directory the endpoint can search under.
+ *
+ * The endpoint's path prefix names a directory, so a file operand or a missing
+ * path would come back empty where the built-in prints the file's matches or
+ * its own error. Either way the built-in has to answer.
+ */
+export declare function isDirectory(ctx: CommandContext, path: string): Promise<boolean>;
+/** The part of a path below the directory the caller named. */
+export declare function belowTarget(absolutePath: string, target: {
+    absolute: string;
+}): string;
+/**
+ * Name a file the way ripgrep would, given how the caller named the directory.
+ *
+ * `rg love sonnets` reports `sonnets/x.md`, `rg love /repo/sonnets` reports
+ * `/repo/sonnets/x.md`, and a bare `rg love` reports paths relative to the
+ * working directory.
+ */
+export declare function displayPath(suffix: string, target: {
+    typed: string;
+}): string;
+/**
+ * Whether ripgrep would have walked past this file without opening it.
+ *
+ * ripgrep skips dot-prefixed entries during traversal, but searches a path the
+ * caller named explicitly even when it is hidden. Only the part below the
+ * named directory is examined, so `rg foo .agents` still searches `.agents`.
+ *
+ * The search endpoint does not apply this rule — hiding dotfiles is a
+ * convention of the command-line tool, not of the repository — so `rg` applies
+ * it here instead.
+ */
+export declare function isHidden(suffix: string): boolean;
+/**
+ * Translate one `.gitignore` line into repository-root-relative exclude globs.
+ *
+ * `dir` is the directory holding the ignore file, so a nested file's rules
+ * stay scoped to its own subtree. A bare name matches at any depth below that
+ * directory and may name either a file or a directory, so it yields both forms.
+ *
+ * Returns nothing for blanks and comments, and `null` for a negation, which
+ * the exclude parameter cannot express: the server prefixes every exclude with
+ * `!` already, so a re-inclusion would arrive as a double negation.
+ */
+export declare function gitignoreLineToGlobs(line: string, dir: string): string[] | null;
+/**
+ * Every ignore rule in a subtree, as exclude globs, or `null` when one of them
+ * cannot be expressed and the caller should fall back.
+ *
+ * The ignore files are read through the search endpoint rather than the mount:
+ * one request returns the contents of every `.gitignore` under the path, where
+ * walking the tree for them would cost the round trips this command exists to
+ * avoid.
+ */
+export declare function gitignoreExcludes(files: {
+    path: string;
+    lines: string[];
+}[]): string[] | null;
+/**
+ * Split clustered short flags into separate ones.
+ *
+ * `-rn` means `-r -n`, which is how people actually type these commands. The
+ * built-in clusters boolean flags only — `-re PATTERN` is an error there rather
+ * than a pattern flag — so a cluster naming any flag that takes a value is left
+ * whole, and the built-in gets to reject it in its own words.
+ *
+ * `valueFlags` is the set of short flags that consume the next argument.
+ */
+export declare function expandShortFlags(args: string[], valueFlags: string): string[];
+/** Run `work` over `items`, at most `limit` at a time, preserving input order. */
+export declare function mapBounded<T, R>(items: T[], limit: number, work: (item: T) => Promise<R>): Promise<R[]>;
+/**
+ * Build the `rg` replacement.
+ *
+ * `fallback` runs the original command line through the built-in, and is called
+ * whenever this command cannot answer precisely.
+ */
+export declare function createSearchRg(config: ServerSearchConfig, fallback: (args: string[], ctx: CommandContext) => Promise<ExecResult>): Command;
+export {};
+//# sourceMappingURL=search-rg.d.ts.map

package/dist/fs/search-rg.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-rg.d.ts","sourceRoot":"","sources":["../../src/fs/search-rg.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACrE,OAAO,KAAK,EAAE,MAAM,EAAQ,MAAM,aAAa,CAAC;AAEhD,2DAA2D;AAC3D,MAAM,MAAM,KAAK,GAAG;IAClB,oEAAoE;IACpE,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC;AAEF,0CAA0C;AAC1C,MAAM,MAAM,SAAS,GAAG;IACtB,KAAK,EAAE,KAAK,CAAC;IACb,+CAA+C;IAC/C,UAAU,EAAE,MAAM,CAAC;IACnB,+DAA+D;IAC/D,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB,CAAC;AAEF,oFAAoF;AACpF,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,SAAS,EAAE,CAAC;IAClB;;;;;;;OAOG;IACH,MAAM,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IAC5C,MAAM,EAAE,OAAO,CAAC;IAChB,OAAO,EAAE,aAAa,CAAC;CACxB,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,MAAM,aAAa,GAAG;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC;IAClC,QAAQ,EAAE,OAAO,GAAG,WAAW,GAAG,aAAa,CAAC;IAChD,OAAO,EAAE,OAAO,CAAC;IACjB,IAAI,EAAE,OAAO,CAAC;IACd,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,iBAAiB,IAAI,CAAC;AAEnC,+EAA+E;AAC/E,MAAM,MAAM,UAAU,GAAG;IAAE,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC;AAEhD,MAAM,MAAM,kBAAkB,GAAG;IAC/B,0DAA0D;IAC1D,UAAU,EAAE,MAAM,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC;IACZ,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,OAAO,UAAU,CAAC,KAAK,CAAC;CACjC,CAAC;AAEF;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE,CAuBxD;AAOD,4DAA4D;AAC5D,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAK1D;AAgBD,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,SAAS,EAAE,GAAG,UAAU,CAkBrF;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,WAAW,GAAG,UAAU,CA0FjG;AAED,MAAM,MAAM,WAAW,GAAG;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CAChD,CAAC;AA0DF;;;;;GAKG;AACH,wBAAuB,SAAS,CAC9B,MAAM,EAAE,kBAAkB,EAC1B,GAAG,EAAE,SAAS,EACd,OAAO,EAAE,aAAa,GACrB,cAAc,CAAC,WAAW,CAAC,CAK7B;AAED;;;;;;GAMG;AACH,wBAAsB,WAAW,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAMrF;AAED,+DAA+D;AAC/D,wBAAgB,WAAW,CAAC,YAAY,EAAE,MAAM,EAAE,MAAM,EAAE;IAAE,QAAQ,EAAE,MAAM,CAAA;CAAE,GAAG,MAAM,CAEtF;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,GAAG,MAAM,CAG7E;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAEhD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI,CAe/E;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,EAAE,CAAA;CAAE,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,CAW7F;AA4BD;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,CAiB7E;AAED,kFAAkF;AAClF,wBAAsB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAW7G;AAyBD;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,kBAAkB,EAC1B,QAAQ,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,cAAc,KAAK,OAAO,CAAC,UAAU,CAAC,GACrE,OAAO,CAiDT"}