dsh-gitnexus-plus 0.1.3 → 0.1.5

package/lib/gitnexus/delta.js

@@ -0,0 +1,347 @@
+/**
+ * Tier 0 staleness: is a refresh worth running at all?
+ *
+ * WHY THIS EXISTS
+ * ---------------
+ * The panel's only maintenance action used to be "run `gitnexus analyze`", and it ran
+ * the analyzer every time — on a repository where nothing had changed since the index
+ * was written. That is not a correctness bug, it is a cost bug with a bad shape: the
+ * work is measured in seconds on a small repository and in minutes on a large one, and
+ * the user has no way to know beforehand whether they are about to spend it.
+ *
+ * The index already records what it saw: `.gitnexus/gitnexus.json` carries
+ * `fileHashes`, a map of repo-relative path to sha256. Comparing the working tree
+ * against those hashes answers "would a re-analysis change anything?" exactly, and it
+ * needs nothing but git and a hash function.
+ *
+ * WHAT IS COMPARED, AND AGAINST WHAT
+ * ----------------------------------
+ * The baseline is the **index snapshot**, not `HEAD`. Those differ whenever the index
+ * was built from a dirty tree, and the manifest records that case in
+ * `indexCoverage.dirtyPaths`. Comparing against `HEAD` would call a file unchanged
+ * merely because it was committed, even though the index remembered different content
+ * — which is the direction that produces a stale graph the panel says is current.
+ *
+ * The candidate set is therefore everything that differs from the *indexed commit*:
+ *
+ *   `git diff --no-renames --name-only <lastCommit>`  tracked files, working tree vs
+ *                                                     that commit (staged and unstaged)
+ *   `git ls-files --others --exclude-standard`        untracked files git would include
+ *
+ * `--no-renames` on purpose: with rename detection on, git reports only the new path,
+ * so a rename looks like a pure addition and the index's old path silently disappears
+ * from the comparison. Forcing add+delete pairs lets each side be classified on its
+ * own evidence.
+ *
+ * Hash comparison is per candidate, not per indexed file, which is what keeps this
+ * cheap: a clean working tree produces an empty candidate set and no file is read at
+ * all. `mtime` is *not* used as a prefilter even though the plan called for one — the
+ * manifest stores a hash and no mtime, so "the mtime did not move" cannot prove the
+ * content matches, and using it would trade an exact answer for a fast wrong one.
+ *
+ * WHAT IT DOES NOT DO
+ * -------------------
+ * It never runs the analyzer, never writes, and never reads the graph. It also does not
+ * decide *which* tier of refresh to run — that needs the analyzer's own judgement about
+ * schema and FTS state. It answers one question: has indexed content changed?
+ */
+import { createHash } from 'node:crypto';
+import { createReadStream } from 'node:fs';
+import fs from 'node:fs/promises';
+import path from 'node:path';
+import { execFile } from 'node:child_process';
+import { promisify } from 'node:util';
+import { formatBytes } from './coverage.js';
+import { readIndexMeta } from './index-meta.js';
+/**
+ * `execFile`, promisified, resolved as decoded text.
+ *
+ * No shell: the repository path is caller-supplied and only ever travels as `cwd`.
+ * `-z` output is NUL-separated rather than newline-separated precisely because a path
+ * may contain a newline, and `git status` would otherwise quote it into an unparseable
+ * form.
+ */
+const run = promisify(execFile);
+const DEFAULT_MAX_FILES = 4000;
+const DEFAULT_HASH_CONCURRENCY = 8;
+const DEFAULT_GIT_TIMEOUT_MS = 15_000;
+/** Run one git command, or report that git could not answer. */
+async function git(repoPath, args, timeoutMs) {
+    try {
+        const { stdout } = await run('git', args, {
+            cwd: repoPath,
+            timeout: timeoutMs,
+            windowsHide: true,
+            // Name lists on a very large repository can exceed the default 1 MB cap. The
+            // cap exists so a runaway command cannot exhaust memory; 32 MB of paths is
+            // already an unreasonable candidate set, and `maxFiles` truncates it anyway.
+            maxBuffer: 32 * 1024 * 1024,
+        });
+        return stdout;
+    }
+    catch {
+        return null;
+    }
+}
+/** Split `-z` output on NUL and drop the trailing empty record. */
+function splitNul(text) {
+    return text.split('\0').filter((part) => part !== '');
+}
+/** The key form `fileHashes` uses: forward slashes, no leading `./`. */
+function toKey(relativePath) {
+    return relativePath.replace(/\\/g, '/').replace(/^\.\//, '');
+}
+/** Stream one file through sha256. Returns null when it cannot be read. */
+async function hashFile(absolutePath) {
+    try {
+        const hash = createHash('sha256');
+        await new Promise((resolvePromise, reject) => {
+            const stream = createReadStream(absolutePath);
+            stream.on('error', reject);
+            stream.on('data', (chunk) => hash.update(chunk));
+            stream.on('end', () => resolvePromise());
+        });
+        return hash.digest('hex');
+    }
+    catch {
+        return null;
+    }
+}
+/** The counts of an empty report, so every early return carries the same shape. */
+const ZERO_COUNTS = {
+    checked: 0,
+    hashed: 0,
+    unchanged: 0,
+    modified: 0,
+    added: 0,
+    deleted: 0,
+    excluded: 0,
+};
+/**
+ * Compare the working tree against the content the index recorded.
+ *
+ * @param repoPath absolute repository root
+ */
+export async function readDelta(repoPath, options = {}) {
+    const now = options.now ?? (() => Date.now());
+    const startedAt = now();
+    const absRepo = path.resolve(repoPath);
+    const maxFiles = options.maxFiles ?? DEFAULT_MAX_FILES;
+    const concurrency = Math.max(1, options.hashConcurrency ?? DEFAULT_HASH_CONCURRENCY);
+    const gitTimeoutMs = options.gitTimeoutMs ?? DEFAULT_GIT_TIMEOUT_MS;
+    const empty = (patch) => ({
+        repoPath: absRepo,
+        indexed: false,
+        comparable: false,
+        basis: null,
+        indexedCommit: null,
+        headCommit: null,
+        entries: [],
+        counts: { ...ZERO_COUNTS },
+        needsRefresh: false,
+        certain: false,
+        truncated: false,
+        notes: [],
+        durationMs: now() - startedAt,
+        readAt: new Date().toISOString(),
+        ...patch,
+    });
+    const meta = await readIndexMeta(absRepo);
+    if (meta === null) {
+        return empty({ notes: ['该项目还没有 GitNexus 索引，先初始化再说'] });
+    }
+    const indexedCommit = meta.lastCommit === '' ? null : meta.lastCommit;
+    const base = { indexed: true, indexedCommit };
+    // The map is normalized-key -> original key, and the hash is read through the
+    // original: `fileHashes` is written by GitNexus, and a manifest whose keys use
+    // backslashes (Windows builds did) must still match the forward-slash key git
+    // reports. Rewriting the manifest's keys instead would mutate what we only read.
+    const hashByKey = new Map();
+    for (const [rawPath, hash] of Object.entries(meta.fileHashes)) {
+        hashByKey.set(toKey(rawPath), hash.toLowerCase());
+    }
+    if (hashByKey.size === 0) {
+        return empty({
+            ...base,
+            notes: ['该索引没有记录文件哈希（旧格式 manifest），无法判断内容是否变化 —— 直接刷新'],
+        });
+    }
+    const headCommit = (await git(absRepo, ['rev-parse', 'HEAD'], gitTimeoutMs))?.trim() ?? null;
+    let basis = null;
+    let candidates = [];
+    if (indexedCommit !== null && headCommit !== null) {
+        const diff = await git(absRepo, ['diff', '--no-renames', '--name-only', '-z', indexedCommit, '--'], gitTimeoutMs);
+        if (diff !== null) {
+            basis = 'index';
+            candidates = splitNul(diff);
+        }
+    }
+    if (basis === null && headCommit !== null) {
+        // The recorded commit is gone (rebase, branch rewrite, shallow clone) or the
+        // manifest never had one. Working tree vs HEAD is the honest fallback: it finds
+        // uncommitted and newly committed files, and it cannot see a difference that was
+        // committed before the index was written. Say so rather than implying otherwise.
+        const againstHead = await git(absRepo, ['diff', '--no-renames', '--name-only', '-z', 'HEAD', '--'], gitTimeoutMs);
+        if (againstHead !== null) {
+            basis = 'worktree';
+            candidates = splitNul(againstHead);
+        }
+    }
+    if (basis === null) {
+        return empty({
+            ...base,
+            headCommit,
+            notes: [
+                indexedCommit === null
+                    ? '索引没有记录提交基线，且 git 也无法读取 HEAD —— 无法比较，直接刷新'
+                    : '索引记录的提交在本地 git 历史中已不可用，且无法读取 HEAD —— 无法比较，直接刷新',
+            ],
+        });
+    }
+    const untracked = await git(absRepo, ['ls-files', '--others', '--exclude-standard', '-z'], gitTimeoutMs);
+    if (untracked !== null) {
+        candidates.push(...splitNul(untracked));
+    }
+    const seen = new Set();
+    const unique = [];
+    for (const candidate of candidates) {
+        const key = toKey(candidate);
+        if (key === '' || seen.has(key))
+            continue;
+        // The index's own storage is never indexed content. `.gitnexus/` self-ignores in
+        // most repositories (GitNexus writes a `*` .gitignore there), so this only matters
+        // where it does not — but in exactly that case every read would report the index
+        // manifest itself as a new file and ask for a refresh forever.
+        if (key.startsWith('.gitnexus/') || key.startsWith('.git/'))
+            continue;
+        seen.add(key);
+        unique.push(key);
+    }
+    unique.sort();
+    const truncated = unique.length > maxFiles;
+    const examined = truncated ? unique.slice(0, maxFiles) : unique;
+    const entries = [];
+    const counts = { ...ZERO_COUNTS };
+    counts.checked = examined.length;
+    // Bounded parallelism rather than one read at a time: a 4000-file candidate set read
+    // sequentially is dominated by syscall latency, and these are local files.
+    for (let offset = 0; offset < examined.length; offset += concurrency) {
+        const batch = examined.slice(offset, offset + concurrency);
+        const settled = await Promise.all(batch.map(async (key) => {
+            const absolute = path.join(absRepo, key);
+            let size;
+            try {
+                const stat = await fs.stat(absolute);
+                if (!stat.isFile())
+                    return null;
+                size = stat.size;
+            }
+            catch {
+                // Gone from the working tree. Only worth reporting when the index had it;
+                // an untracked file deleted between `ls-files` and this stat is not news.
+                return hashByKey.has(key) ? { path: key, kind: 'deleted', reason: null } : null;
+            }
+            const recorded = hashByKey.get(key);
+            if (recorded === undefined) {
+                const cap = meta.coverageMaxFileSizeBytes;
+                if (cap !== null && size > cap) {
+                    return {
+                        path: key,
+                        kind: 'excluded',
+                        reason: `超过索引记录的大小上限（${formatBytes(cap)}），刷新也会被跳过`,
+                    };
+                }
+                return { path: key, kind: 'added', reason: null };
+            }
+            counts.hashed += 1;
+            const current = await hashFile(absolute);
+            if (current === null) {
+                // Unreadable is not unchanged. Treating it as modified makes the panel ask
+                // for a refresh; treating it as unchanged would report a stale index as
+                // current, which is the one error this module exists to prevent.
+                return { path: key, kind: 'modified', reason: '无法读取文件内容，按已变更处理' };
+            }
+            if (current === recorded) {
+                counts.unchanged += 1;
+                return null;
+            }
+            return { path: key, kind: 'modified', reason: null };
+        }));
+        for (const entry of settled) {
+            if (entry !== null)
+                entries.push(entry);
+        }
+    }
+    entries.sort((a, b) => (a.path < b.path ? -1 : a.path > b.path ? 1 : 0));
+    for (const entry of entries)
+        counts[entry.kind] += 1;
+    const actionable = counts.modified + counts.added + counts.deleted;
+    const certain = basis === 'index';
+    const notes = [];
+    if (basis === 'worktree') {
+        notes.push('索引没有记录可用的提交基线：只比较了工作区相对 HEAD 的改动，索引建立之后已提交的改动看不到');
+    }
+    if (truncated) {
+        notes.push(`候选文件超过 ${maxFiles} 个，只检查了前 ${maxFiles} 个 —— 建议直接刷新`);
+    }
+    if (actionable === 0) {
+        // A clean worktree is not the same claim as a clean index. Saying "一致" on the
+        // worktree basis is how a stale index gets reported as current: the next commit
+        // makes it stale and this comparison will still be empty.
+        notes.push(certain
+            ? counts.checked === 0
+                ? '工作区与索引记录一致：没有任何文件相对索引提交发生改动'
+                : `工作区与索引记录一致：${counts.checked} 个候选文件中 ${counts.unchanged} 个内容哈希匹配` +
+                    (counts.excluded > 0 ? `，${counts.excluded} 个属索引策略排除` : '')
+            : '工作区相对 HEAD 没有改动，但无法确认索引已包含当前提交 —— 需要刷新才能确定');
+        if (counts.excluded > 0) {
+            notes.push('被排除的文件刷新也会再次跳过，因此不需要为它们刷新索引');
+        }
+    }
+    else {
+        const parts = [];
+        if (counts.modified > 0)
+            parts.push(`${counts.modified} 个修改`);
+        if (counts.added > 0)
+            parts.push(`${counts.added} 个新增`);
+        if (counts.deleted > 0)
+            parts.push(`${counts.deleted} 个删除`);
+        notes.unshift(`索引内容已落后：${parts.join('、')}`);
+    }
+    return {
+        repoPath: absRepo,
+        indexed: true,
+        comparable: true,
+        basis,
+        indexedCommit,
+        headCommit,
+        entries,
+        counts,
+        needsRefresh: actionable > 0,
+        certain,
+        truncated,
+        notes,
+        durationMs: now() - startedAt,
+        readAt: new Date().toISOString(),
+    };
+}
+/** One-line verdict for a tool result or a log line. */
+export function describeDelta(report) {
+    if (!report.comparable) {
+        return `无法差量判断：${report.notes[0] ?? '原因未知'}`;
+    }
+    if (!report.needsRefresh) {
+        return report.certain
+            ? `无需刷新（${report.counts.checked} 个候选，${report.counts.hashed} 次哈希，${report.durationMs}ms）`
+            : `无法确认（${report.counts.checked} 个候选，${report.durationMs}ms）：${report.notes[0] ?? '索引没有记录提交基线'}`;
+    }
+    const changed = report.entries.filter((entry) => entry.kind !== 'excluded');
+    const preview = changed
+        .slice(0, 10)
+        .map((entry) => `${entry.kind === 'modified' ? 'M' : entry.kind === 'added' ? 'A' : 'D'} ${entry.path}`)
+        .join('\n');
+    const more = changed.length > 10 ? `\n…还有 ${changed.length - 10} 个` : '';
+    return (`需要刷新：${report.counts.modified} 改 / ${report.counts.added} 增 / ${report.counts.deleted} 删` +
+        `（${report.durationMs}ms）\n${preview}${more}`);
+}
+//# sourceMappingURL=delta.js.map

package/lib/gitnexus/delta.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"delta.js","sourceRoot":"","sources":["../../src/gitnexus/delta.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8CG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAClC,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,QAAQ,EAAwB,MAAM,oBAAoB,CAAC;AACpE,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,aAAa,EAAkB,MAAM,iBAAiB,CAAC;AAEhE;;;;;;;GAOG;AACH,MAAM,GAAG,GAAG,SAAS,CAAC,QAAQ,CAIkB,CAAC;AAgGjD,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAC/B,MAAM,wBAAwB,GAAG,CAAC,CAAC;AACnC,MAAM,sBAAsB,GAAG,MAAM,CAAC;AAEtC,gEAAgE;AAChE,KAAK,UAAU,GAAG,CAAC,QAAgB,EAAE,IAAc,EAAE,SAAiB;IACpE,IAAI,CAAC;QACH,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE;YACxC,GAAG,EAAE,QAAQ;YACb,OAAO,EAAE,SAAS;YAClB,WAAW,EAAE,IAAI;YACjB,6EAA6E;YAC7E,2EAA2E;YAC3E,6EAA6E;YAC7E,SAAS,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI;SAC5B,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,mEAAmE;AACnE,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC;AACxD,CAAC;AAED,wEAAwE;AACxE,SAAS,KAAK,CAAC,YAAoB;IACjC,OAAO,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;AAC/D,CAAC;AAED,2EAA2E;AAC3E,KAAK,UAAU,QAAQ,CAAC,YAAoB;IAC1C,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;QAClC,MAAM,IAAI,OAAO,CAAO,CAAC,cAAc,EAAE,MAAM,EAAE,EAAE;YACjD,MAAM,MAAM,GAAG,gBAAgB,CAAC,YAAY,CAAC,CAAC;YAC9C,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAC3B,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACjD,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,mFAAmF;AACnF,MAAM,WAAW,GAAgB;IAC/B,OAAO,EAAE,CAAC;IACV,MAAM,EAAE,CAAC;IACT,SAAS,EAAE,CAAC;IACZ,QAAQ,EAAE,CAAC;IACX,KAAK,EAAE,CAAC;IACR,OAAO,EAAE,CAAC;IACV,QAAQ,EAAE,CAAC;CACZ,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,QAAgB,EAAE,UAAwB,EAAE;IAC1E,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAG,GAAG,EAAE,CAAC;IACxB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,iBAAiB,CAAC;IACvD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,eAAe,IAAI,wBAAwB,CAAC,CAAC;IACrF,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,sBAAsB,CAAC;IAEpE,MAAM,KAAK,GAAG,CAAC,KAA2B,EAAe,EAAE,CAAC,CAAC;QAC3D,QAAQ,EAAE,OAAO;QACjB,OAAO,EAAE,KAAK;QACd,UAAU,EAAE,KAAK;QACjB,KAAK,EAAE,IAAI;QACX,aAAa,EAAE,IAAI;QACnB,UAAU,EAAE,IAAI;QAChB,OAAO,EAAE,EAAE;QACX,MAAM,EAAE,EAAE,GAAG,WAAW,EAAE;QAC1B,YAAY,EAAE,KAAK;QACnB,OAAO,EAAE,KAAK;QACd,SAAS,EAAE,KAAK;QAChB,KAAK,EAAE,EAAE;QACT,UAAU,EAAE,GAAG,EAAE,GAAG,SAAS;QAC7B,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QAChC,GAAG,KAAK;KACT,CAAC,CAAC;IAEH,MAAM,IAAI,GAAqB,MAAM,aAAa,CAAC,OAAO,CAAC,CAAC;IAC5D,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAClB,OAAO,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,2BAA2B,CAAC,EAAE,CAAC,CAAC;IACzD,CAAC;IAED,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;IACtE,MAAM,IAAI,GAAyB,EAAE,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC;IAEpE,8EAA8E;IAC9E,+EAA+E;IAC/E,8EAA8E;IAC9E,iFAAiF;IACjF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QAC9D,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC;YACX,GAAG,IAAI;YACP,KAAK,EAAE,CAAC,8CAA8C,CAAC;SACxD,CAAC,CAAC;IACL,CAAC;IAED,MAAM,UAAU,GAAG,CAAC,MAAM,GAAG,CAAC,OAAO,EAAE,CAAC,WAAW,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI,CAAC;IAE7F,IAAI,KAAK,GAAsB,IAAI,CAAC;IACpC,IAAI,UAAU,GAAa,EAAE,CAAC;IAE9B,IAAI,aAAa,KAAK,IAAI,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,MAAM,GAAG,CACpB,OAAO,EACP,CAAC,MAAM,EAAE,cAAc,EAAE,aAAa,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,CAAC,EAClE,YAAY,CACb,CAAC;QACF,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,KAAK,GAAG,OAAO,CAAC;YAChB,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,IAAI,KAAK,KAAK,IAAI,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;QAC1C,6EAA6E;QAC7E,gFAAgF;QAChF,iFAAiF;QACjF,iFAAiF;QACjF,MAAM,WAAW,GAAG,MAAM,GAAG,CAC3B,OAAO,EACP,CAAC,MAAM,EAAE,cAAc,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,EAC3D,YAAY,CACb,CAAC;QACF,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;YACzB,KAAK,GAAG,UAAU,CAAC;YACnB,UAAU,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACnB,OAAO,KAAK,CAAC;YACX,GAAG,IAAI;YACP,UAAU;YACV,KAAK,EAAE;gBACL,aAAa,KAAK,IAAI;oBACpB,CAAC,CAAC,0CAA0C;oBAC5C,CAAC,CAAC,gDAAgD;aACrD;SACF,CAAC,CAAC;IACL,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,GAAG,CACzB,OAAO,EACP,CAAC,UAAU,EAAE,UAAU,EAAE,oBAAoB,EAAE,IAAI,CAAC,EACpD,YAAY,CACb,CAAC;IACF,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;QACvB,UAAU,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;QAC7B,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC1C,iFAAiF;QACjF,mFAAmF;QACnF,iFAAiF;QACjF,+DAA+D;QAC/D,IAAI,GAAG,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC;YAAE,SAAS;QACtE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IACD,MAAM,CAAC,IAAI,EAAE,CAAC;IAEd,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC;IAC3C,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAEhE,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,MAAM,MAAM,GAAgB,EAAE,GAAG,WAAW,EAAE,CAAC;IAC/C,MAAM,CAAC,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC;IAEjC,qFAAqF;IACrF,2EAA2E;IAC3E,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,IAAI,WAAW,EAAE,CAAC;QACrE,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC;QAC3D,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,EAA8B,EAAE;YAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YACzC,IAAI,IAAY,CAAC;YACjB,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACrC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;oBAAE,OAAO,IAAI,CAAC;gBAChC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACnB,CAAC;YAAC,MAAM,CAAC;gBACP,0EAA0E;gBAC1E,0EAA0E;gBAC1E,OAAO,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAClF,CAAC;YAED,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,wBAAwB,CAAC;gBAC1C,IAAI,GAAG,KAAK,IAAI,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;oBAC/B,OAAO;wBACL,IAAI,EAAE,GAAG;wBACT,IAAI,EAAE,UAAU;wBAChB,MAAM,EAAE,eAAe,WAAW,CAAC,GAAG,CAAC,WAAW;qBACnD,CAAC;gBACJ,CAAC;gBACD,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;YACpD,CAAC;YAED,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;YACnB,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,QAAQ,CAAC,CAAC;YACzC,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACrB,2EAA2E;gBAC3E,wEAAwE;gBACxE,iEAAiE;gBACjE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;YACpE,CAAC;YACD,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;gBACzB,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;gBACtB,OAAO,IAAI,CAAC;YACd,CAAC;YACD,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QACvD,CAAC,CAAC,CACH,CAAC;QACF,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,KAAK,IAAI;gBAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,KAAK,MAAM,KAAK,IAAI,OAAO;QAAE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAErD,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC;IACnE,MAAM,OAAO,GAAG,KAAK,KAAK,OAAO,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,KAAK,KAAK,UAAU,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CACR,kDAAkD,CACnD,CAAC;IACJ,CAAC;IACD,IAAI,SAAS,EAAE,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,UAAU,QAAQ,YAAY,QAAQ,cAAc,CAAC,CAAC;IACnE,CAAC;IACD,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;QACrB,8EAA8E;QAC9E,gFAAgF;QAChF,0DAA0D;QAC1D,KAAK,CAAC,IAAI,CACR,OAAO;YACL,CAAC,CAAC,MAAM,CAAC,OAAO,KAAK,CAAC;gBACpB,CAAC,CAAC,6BAA6B;gBAC/B,CAAC,CAAC,cAAc,MAAM,CAAC,OAAO,WAAW,MAAM,CAAC,SAAS,UAAU;oBAC/D,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;YACjE,CAAC,CAAC,4CAA4C,CACjD,CAAC;QACF,IAAI,MAAM,CAAC,QAAQ,GAAG,CAAC,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;SAAM,CAAC;QACN,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,MAAM,CAAC,QAAQ,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,QAAQ,MAAM,CAAC,CAAC;QAC9D,IAAI,MAAM,CAAC,KAAK,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM,CAAC,CAAC;QACxD,IAAI,MAAM,CAAC,OAAO,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,OAAO,MAAM,CAAC,CAAC;QAC5D,KAAK,CAAC,OAAO,CAAC,WAAW,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,OAAO;QACjB,OAAO,EAAE,IAAI;QACb,UAAU,EAAE,IAAI;QAChB,KAAK;QACL,aAAa;QACb,UAAU;QACV,OAAO;QACP,MAAM;QACN,YAAY,EAAE,UAAU,GAAG,CAAC;QAC5B,OAAO;QACP,SAAS;QACT,KAAK;QACL,UAAU,EAAE,GAAG,EAAE,GAAG,SAAS;QAC7B,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACjC,CAAC;AACJ,CAAC;AAED,wDAAwD;AACxD,MAAM,UAAU,aAAa,CAAC,MAAmB;IAC/C,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;QACvB,OAAO,UAAU,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;IAC/C,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC,OAAO;YACnB,CAAC,CAAC,QAAQ,MAAM,CAAC,MAAM,CAAC,OAAO,QAAQ,MAAM,CAAC,MAAM,CAAC,MAAM,QAAQ,MAAM,CAAC,UAAU,KAAK;YACzF,CAAC,CAAC,QAAQ,MAAM,CAAC,MAAM,CAAC,OAAO,QAAQ,MAAM,CAAC,UAAU,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,YAAY,EAAE,CAAC;IACrG,CAAC;IACD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;IAC5E,MAAM,OAAO,GAAG,OAAO;SACpB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;SACZ,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;SACvG,IAAI,CAAC,IAAI,CAAC,CAAC;IACd,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,OAAO,CAAC,MAAM,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;IACzE,OAAO,CACL,QAAQ,MAAM,CAAC,MAAM,CAAC,QAAQ,QAAQ,MAAM,CAAC,MAAM,CAAC,KAAK,QAAQ,MAAM,CAAC,MAAM,CAAC,OAAO,IAAI;QAC1F,IAAI,MAAM,CAAC,UAAU,QAAQ,OAAO,GAAG,IAAI,EAAE,CAC9C,CAAC;AACJ,CAAC"}

package/lib/gitnexus/discover.d.ts

@@ -0,0 +1,91 @@
+/**
+ * Find the GitNexus indexes under a workspace.
+ *
+ * WHY SEARCH BELOW THE WORKSPACE
+ * ------------------------------
+ * The panel reports the project the operator is *in*, and on this machine that is
+ * often a container rather than a repository: `D:\Project\geo` holds `admin/`,
+ * `backend/`, `frontend/` and others, any one of which may be the tree GitNexus
+ * indexed. Requiring the workspace itself to carry `.gitnexus` made the panel answer
+ * a workspace-shaped path with a 404 and no numbers at all.
+ *
+ * So the search starts at the workspace and walks down breadth-first. Every directory
+ * carrying a readable manifest becomes a candidate; an indexed directory is a project
+ * boundary, so the walk does not descend into its source tree (the project's own
+ * subdirectories are not separate projects). The caller decides which candidate is
+ * active; this module only reports them, ordered so the nearest complete index is
+ * first.
+ *
+ * The walk is bounded (depth, directory count, wall clock) because a workspace can be
+ * a home directory or a drive. Dependency and build directories are skipped by name,
+ * hidden directories are skipped wholesale, and symlinks are not followed, so the
+ * walk cannot leave the workspace or loop.
+ */
+/** One project found under the workspace. */
+export interface ProjectCandidate {
+    /** Absolute directory carrying `.gitnexus` or `.git`. */
+    path: string;
+    /** Basename, for a compact switcher label. */
+    name: string;
+    /** Path relative to the workspace; empty for the workspace itself. */
+    relPath: string;
+    /**
+     * `index` — a readable GitNexus manifest;
+     * `git` — a git repository without an index;
+     * `workspace` — the workspace itself, with neither.
+     */
+    kind: 'index' | 'git' | 'workspace';
+    /** Whether the directory carries a `.git` marker. */
+    hasGit: boolean;
+    /** Whether this is the workspace itself or a descendant. */
+    direction: 'self' | 'descendant';
+    /** Distance below the workspace; 0 for the workspace itself. */
+    depth: number;
+    indexedAt: string | null;
+    lastCommit: string | null;
+    branch: string | null;
+    /** The manifest's counters, when it recorded them. */
+    stats: {
+        files: number;
+        nodes: number;
+        edges: number;
+        communities: number;
+        processes: number;
+        embeddings: number;
+    } | null;
+    /** Whether the graph store is present, not just the manifest. */
+    complete: boolean;
+    /** Which manifest the values came from. */
+    metaFile: string | null;
+}
+/** The result of one workspace search. */
+export interface ProjectSearchResult {
+    root: string;
+    projects: ProjectCandidate[];
+    /** Directories examined, including the root. */
+    visited: number;
+    /** Whether a depth/count/time bound stopped the walk early. */
+    truncated: boolean;
+}
+export interface ProjectSearchOptions {
+    /** How many directory levels below the root to inspect. */
+    maxDepth?: number;
+    /** Hard cap on directories examined. */
+    maxDirectories?: number;
+    /** Wall-clock budget for the whole search. */
+    timeoutMs?: number;
+    /** Injectable clock, so a test can prove the budget is enforced. */
+    now?: () => number;
+}
+/**
+ * Find every project at or below `root`: indexed directories, git repositories without
+ * an index, and the workspace itself when it is only a container.
+ *
+ * Never throws: an unreadable directory is skipped. The caller decides what each kind
+ * means; the panel shows unindexed git projects so they can be initialized instead of
+ * reporting a bare "no index" for a workspace that clearly has subprojects.
+ *
+ * @param root absolute working directory to search from
+ */
+export declare function findIndexProjects(root: string, options?: ProjectSearchOptions): Promise<ProjectSearchResult>;
+//# sourceMappingURL=discover.d.ts.map

package/lib/gitnexus/discover.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"discover.d.ts","sourceRoot":"","sources":["../../src/gitnexus/discover.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAOH,6CAA6C;AAC7C,MAAM,WAAW,gBAAgB;IAC/B,yDAAyD;IACzD,IAAI,EAAE,MAAM,CAAC;IACb,8CAA8C;IAC9C,IAAI,EAAE,MAAM,CAAC;IACb,sEAAsE;IACtE,OAAO,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,IAAI,EAAE,OAAO,GAAG,KAAK,GAAG,WAAW,CAAC;IACpC,qDAAqD;IACrD,MAAM,EAAE,OAAO,CAAC;IAChB,4DAA4D;IAC5D,SAAS,EAAE,MAAM,GAAG,YAAY,CAAC;IACjC,gEAAgE;IAChE,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,sDAAsD;IACtD,KAAK,EAAE;QACL,KAAK,EAAE,MAAM,CAAC;QACd,KAAK,EAAE,MAAM,CAAC;QACd,KAAK,EAAE,MAAM,CAAC;QACd,WAAW,EAAE,MAAM,CAAC;QACpB,SAAS,EAAE,MAAM,CAAC;QAClB,UAAU,EAAE,MAAM,CAAC;KACpB,GAAG,IAAI,CAAC;IACT,iEAAiE;IACjE,QAAQ,EAAE,OAAO,CAAC;IAClB,2CAA2C;IAC3C,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB;AAED,0CAA0C;AAC1C,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,gBAAgB,EAAE,CAAC;IAC7B,gDAAgD;IAChD,OAAO,EAAE,MAAM,CAAC;IAChB,+DAA+D;IAC/D,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,MAAM,WAAW,oBAAoB;IACnC,2DAA2D;IAC3D,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,wCAAwC;IACxC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,8CAA8C;IAC9C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,oEAAoE;IACpE,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CACpB;AAoED;;;;;;;;;GASG;AACH,wBAAsB,iBAAiB,CACrC,IAAI,EAAE,MAAM,EACZ,OAAO,GAAE,oBAAyB,GACjC,OAAO,CAAC,mBAAmB,CAAC,CAiH9B"}

package/lib/gitnexus/discover.js

@@ -0,0 +1,214 @@
+/**
+ * Find the GitNexus indexes under a workspace.
+ *
+ * WHY SEARCH BELOW THE WORKSPACE
+ * ------------------------------
+ * The panel reports the project the operator is *in*, and on this machine that is
+ * often a container rather than a repository: `D:\Project\geo` holds `admin/`,
+ * `backend/`, `frontend/` and others, any one of which may be the tree GitNexus
+ * indexed. Requiring the workspace itself to carry `.gitnexus` made the panel answer
+ * a workspace-shaped path with a 404 and no numbers at all.
+ *
+ * So the search starts at the workspace and walks down breadth-first. Every directory
+ * carrying a readable manifest becomes a candidate; an indexed directory is a project
+ * boundary, so the walk does not descend into its source tree (the project's own
+ * subdirectories are not separate projects). The caller decides which candidate is
+ * active; this module only reports them, ordered so the nearest complete index is
+ * first.
+ *
+ * The walk is bounded (depth, directory count, wall clock) because a workspace can be
+ * a home directory or a drive. Dependency and build directories are skipped by name,
+ * hidden directories are skipped wholesale, and symlinks are not followed, so the
+ * walk cannot leave the workspace or loop.
+ */
+import fs from 'node:fs/promises';
+import { existsSync } from 'node:fs';
+import path from 'node:path';
+import { readIndexMeta } from './index-meta.js';
+const DEFAULT_MAX_DEPTH = 12;
+const DEFAULT_MAX_DIRECTORIES = 4000;
+const DEFAULT_TIMEOUT_MS = 2000;
+/**
+ * Directories that never hold the project the operator opened.
+ *
+ * Lower-cased because Windows paths are case-insensitive and a dependency tree can be
+ * named `Node_Modules` on a case-sensitive filesystem mounted there.
+ */
+const SKIP_DIRECTORIES = new Set([
+    'node_modules',
+    'bower_components',
+    'vendor',
+    'dist',
+    'build',
+    'out',
+    'output',
+    'target',
+    'bin',
+    'obj',
+    'coverage',
+    'tmp',
+    'temp',
+    'logs',
+    'venv',
+    'env',
+    '__pycache__',
+]);
+/** A directory the walk may enter: real directory, not hidden, not a dependency tree. */
+function isSearchableDirectory(entry) {
+    if (!entry.isDirectory())
+        return false;
+    if (entry.name.startsWith('.'))
+        return false;
+    return !SKIP_DIRECTORIES.has(entry.name.toLowerCase());
+}
+/** Whether the graph store exists beside the manifest. */
+function hasGraphStore(dir) {
+    try {
+        return existsSync(path.join(dir, '.gitnexus', 'lbug'));
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * Rank candidates for display and for a default selection.
+ *
+ * The workspace itself comes first; indexed projects before unindexed git repositories;
+ * a complete index before one whose graph store is missing; the more recently indexed
+ * project before an older one; the path is the final deterministic tie-break.
+ */
+function rankProjects(a, b) {
+    if (a.direction !== b.direction)
+        return a.direction === 'self' ? -1 : 1;
+    const kindRank = (project) => project.kind === 'index' ? 0 : project.kind === 'git' ? 1 : 2;
+    if (kindRank(a) !== kindRank(b))
+        return kindRank(a) - kindRank(b);
+    if (a.depth !== b.depth)
+        return a.depth - b.depth;
+    if (a.complete !== b.complete)
+        return a.complete ? -1 : 1;
+    const aAt = a.indexedAt ?? '';
+    const bAt = b.indexedAt ?? '';
+    if (aAt !== bAt)
+        return aAt < bAt ? 1 : -1;
+    return a.relPath < b.relPath ? -1 : a.relPath > b.relPath ? 1 : 0;
+}
+/**
+ * Find every project at or below `root`: indexed directories, git repositories without
+ * an index, and the workspace itself when it is only a container.
+ *
+ * Never throws: an unreadable directory is skipped. The caller decides what each kind
+ * means; the panel shows unindexed git projects so they can be initialized instead of
+ * reporting a bare "no index" for a workspace that clearly has subprojects.
+ *
+ * @param root absolute working directory to search from
+ */
+export async function findIndexProjects(root, options = {}) {
+    const absolute = path.resolve(root);
+    const maxDepth = options.maxDepth ?? DEFAULT_MAX_DEPTH;
+    const maxDirectories = options.maxDirectories ?? DEFAULT_MAX_DIRECTORIES;
+    const timeoutMs = options.timeoutMs ?? DEFAULT_TIMEOUT_MS;
+    const now = options.now ?? Date.now;
+    const startedAt = now();
+    const queue = [{ dir: absolute, depth: 0 }];
+    let head = 0;
+    let visited = 0;
+    let truncated = false;
+    const projects = [];
+    while (head < queue.length) {
+        if (now() - startedAt > timeoutMs) {
+            truncated = true;
+            break;
+        }
+        const { dir, depth } = queue[head];
+        head += 1;
+        visited += 1;
+        if (visited > maxDirectories) {
+            truncated = true;
+            break;
+        }
+        const meta = await readIndexMeta(dir);
+        const hasGit = existsSync(path.join(dir, '.git'));
+        if (meta !== null) {
+            projects.push({
+                path: dir,
+                name: path.basename(dir),
+                relPath: path.relative(absolute, dir).replace(/\\/g, '/'),
+                kind: 'index',
+                hasGit,
+                direction: dir === absolute ? 'self' : 'descendant',
+                depth,
+                indexedAt: meta.indexedAt === '' ? null : meta.indexedAt,
+                lastCommit: meta.lastCommit === '' ? null : meta.lastCommit,
+                branch: meta.branch ?? null,
+                stats: meta.stats ?? null,
+                complete: hasGraphStore(dir),
+                metaFile: meta.metaFile,
+            });
+            // A project boundary: its own subdirectories are source, not sibling projects.
+            continue;
+        }
+        if (hasGit) {
+            projects.push({
+                path: dir,
+                name: path.basename(dir),
+                relPath: path.relative(absolute, dir).replace(/\\/g, '/'),
+                kind: 'git',
+                hasGit: true,
+                direction: dir === absolute ? 'self' : 'descendant',
+                depth,
+                indexedAt: null,
+                lastCommit: null,
+                branch: null,
+                stats: null,
+                complete: false,
+                metaFile: null,
+            });
+            // A git project without an index is still a project: its source is not a set of
+            // sibling projects. It appears in the switcher so the operator can initialize it.
+            continue;
+        }
+        if (dir === absolute) {
+            projects.push({
+                path: dir,
+                name: path.basename(dir),
+                relPath: '',
+                kind: 'workspace',
+                hasGit: false,
+                direction: 'self',
+                depth: 0,
+                indexedAt: null,
+                lastCommit: null,
+                branch: null,
+                stats: null,
+                complete: false,
+                metaFile: null,
+            });
+            // The workspace is a container; keep walking for its indexed/git children.
+        }
+        let entries;
+        try {
+            entries = await fs.readdir(dir, { withFileTypes: true });
+        }
+        catch {
+            continue;
+        }
+        if (depth >= maxDepth) {
+            // Nothing is enqueued at the cap; say so only when there was something to skip.
+            if (entries.some(isSearchableDirectory))
+                truncated = true;
+            continue;
+        }
+        // Sorted for a deterministic answer when several siblings carry an index; the
+        // order is only a tie-break, because breadth-first already prefers the nearest.
+        entries.sort((a, b) => (a.name < b.name ? -1 : a.name > b.name ? 1 : 0));
+        for (const entry of entries) {
+            if (!isSearchableDirectory(entry))
+                continue;
+            queue.push({ dir: path.join(dir, entry.name), depth: depth + 1 });
+        }
+    }
+    projects.sort(rankProjects);
+    return { root: absolute, projects, visited, truncated };
+}
+//# sourceMappingURL=discover.js.map