claude-use 7.13.0 → 7.13.1

package/dist/cli.cjs

@@ -59065,6 +59065,43 @@ function planFarm(params) {
   return { entries, materialised, links };
 }
 
+// src/resolve/walkPolicy.ts
+var ENTER_EVERYTHING = () => true;
+function readsSubtreeAggregates(rule) {
+  const when = rule.when;
+  return when !== void 0 && (when.newerThan !== void 0 || when.olderThan !== void 0 || when.maxSizeBytes !== void 0);
+}
+function hasUnboundedDepth(pattern) {
+  return pattern.includes("**") || /[{(]/.test(pattern);
+}
+function couldMatchBeneath(rule, dirRel) {
+  if (rule.matches(dirRel)) {
+    return rule.when !== void 0;
+  }
+  if (rule.isExact) {
+    return rule.canonicalPattern.startsWith(`${dirRel}/`);
+  }
+  const depth = dirRel.split("/").length;
+  if (!hasUnboundedDepth(rule.canonicalPattern) && rule.segmentCount <= depth) {
+    return false;
+  }
+  const prefix = rule.literalPrefix;
+  return prefix === "" || prefix.startsWith(`${dirRel}/`) || dirRel.startsWith(prefix);
+}
+function descendPolicy(rules) {
+  const all = [...rules];
+  if (all.some(readsSubtreeAggregates)) {
+    return ENTER_EVERYTHING;
+  }
+  return (dirRel) => all.some((rule) => couldMatchBeneath(rule, dirRel));
+}
+function enterRulesAnd(policy, target) {
+  if (target === void 0 || target === "") {
+    return policy;
+  }
+  return (dirRel) => dirRel === target || target.startsWith(`${dirRel}/`) || policy(dirRel);
+}
+
 // src/resolve/pipeline.ts
 function topLevelNames(facts) {
   const names = /* @__PURE__ */ new Set();
@@ -59076,6 +59113,9 @@ function topLevelNames(facts) {
   }
   return [...names].sort();
 }
+function descendPolicyFor(cascade, home) {
+  return descendPolicy(flattenLayers(assembleCascade(cascade).layers, { home }).rules.values());
+}
 function resolveDecisions(input2) {
   const assembled = assembleCascade(input2.cascade);
   const flattened = flattenLayers(assembled.layers, { home: input2.facts.home });
@@ -59136,7 +59176,7 @@ function buildEntryFacts(params) {
     const isDirectory = stat.kind === "dir";
     let latestMtimeMs = stat.mtimeMs;
     let totalSizeBytes = stat.sizeBytes;
-    if (isDirectory) {
+    if (isDirectory && params.descend(rel)) {
       for (const name of [...params.fs.readdir(absolute)].sort()) {
         const child = visit2(`${rel}/${name}`);
         if (child !== void 0) {
@@ -59483,7 +59523,8 @@ function resyncFarm(params) {
       nowMs,
       env: params.env,
       ...params.branch === void 0 ? {} : { branch: params.branch },
-      ...params.branchDetached === void 0 ? {} : { branchDetached: params.branchDetached }
+      ...params.branchDetached === void 0 ? {} : { branchDetached: params.branchDetached },
+      descend: descendPolicyFor(params.cascade, params.home)
     });
     const resolved = resolveDecisions({ facts, cascade: params.cascade, classification: params.classification });
     const manifest = {
@@ -59865,7 +59906,9 @@ function buildConfigureContext(deps, params) {
     nowMs: Date.now(),
     env: process.env,
     ...git.branch === void 0 ? {} : { branch: git.branch },
-    ...git.branchDetached === void 0 ? {} : { branchDetached: git.branchDetached }
+    ...git.branchDetached === void 0 ? {} : { branchDetached: git.branchDetached },
+    // The picker lists the direct children of the path it was asked about, so the walk also enters that path and the directories on the way to it.
+    descend: enterRulesAnd(descendPolicyFor(cascade, params.home), params.path)
   });
   const resolved = resolveDecisions({ facts, cascade, classification });
   const levels = buildWriteTargetLevels(params.cwd, params.home, globalConfig2?.walkUpLimit);
@@ -60989,7 +61032,7 @@ function registerIdentityCommand(program2, deps) {
 // package.json
 var package_default = {
   name: "claude-use",
-  version: "7.13.0",
+  version: "7.13.1",
   description: "A profile manager and launcher for Claude Code that lets one person run multiple logins from one machine while controlling what gets shared between them.",
   license: "MIT",
   author: "Joseph Mearman <joseph@mearman.co.uk>",
@@ -63017,7 +63060,8 @@ function runCheck(params) {
     nowMs: params.nowMs,
     env: params.env,
     ...params.branch === void 0 ? {} : { branch: params.branch },
-    ...params.branchDetached === void 0 ? {} : { branchDetached: params.branchDetached }
+    ...params.branchDetached === void 0 ? {} : { branchDetached: params.branchDetached },
+    descend: descendPolicyFor(params.cascade, params.home)
   });
   const resolved = resolveDecisions({ facts, cascade: params.cascade, classification: params.classification });
   const decisionLines = [...resolved.decisions.values()].slice().sort((a2, b) => a2.relPath < b.relPath ? -1 : a2.relPath > b.relPath ? 1 : 0).map(formatDecision);

package/dist/index.cjs

@@ -1389,6 +1389,37 @@ function planFarm(params) {
   return { entries, materialised, links };
 }
 
+// src/resolve/walkPolicy.ts
+var ENTER_EVERYTHING = () => true;
+function readsSubtreeAggregates(rule) {
+  const when = rule.when;
+  return when !== void 0 && (when.newerThan !== void 0 || when.olderThan !== void 0 || when.maxSizeBytes !== void 0);
+}
+function hasUnboundedDepth(pattern) {
+  return pattern.includes("**") || /[{(]/.test(pattern);
+}
+function couldMatchBeneath(rule, dirRel) {
+  if (rule.matches(dirRel)) {
+    return rule.when !== void 0;
+  }
+  if (rule.isExact) {
+    return rule.canonicalPattern.startsWith(`${dirRel}/`);
+  }
+  const depth = dirRel.split("/").length;
+  if (!hasUnboundedDepth(rule.canonicalPattern) && rule.segmentCount <= depth) {
+    return false;
+  }
+  const prefix = rule.literalPrefix;
+  return prefix === "" || prefix.startsWith(`${dirRel}/`) || dirRel.startsWith(prefix);
+}
+function descendPolicy(rules) {
+  const all = [...rules];
+  if (all.some(readsSubtreeAggregates)) {
+    return ENTER_EVERYTHING;
+  }
+  return (dirRel) => all.some((rule) => couldMatchBeneath(rule, dirRel));
+}
+
 // src/resolve/walk.ts
 var import_node_path4 = __toESM(require("node:path"), 1);
 
@@ -1567,6 +1598,9 @@ function topLevelNames(facts) {
   }
   return [...names].sort();
 }
+function descendPolicyFor(cascade, home) {
+  return descendPolicy(flattenLayers(assembleCascade(cascade).layers, { home }).rules.values());
+}
 function resolveDecisions(input) {
   const assembled = assembleCascade(input.cascade);
   const flattened = flattenLayers(assembled.layers, { home: input.facts.home });
@@ -1817,7 +1851,7 @@ function buildEntryFacts(params) {
     const isDirectory = stat.kind === "dir";
     let latestMtimeMs = stat.mtimeMs;
     let totalSizeBytes = stat.sizeBytes;
-    if (isDirectory) {
+    if (isDirectory && params.descend(rel)) {
       for (const name of [...params.fs.readdir(absolute)].sort()) {
         const child = visit(`${rel}/${name}`);
         if (child !== void 0) {
@@ -2164,7 +2198,8 @@ function resyncFarm(params) {
       nowMs,
       env: params.env,
       ...params.branch === void 0 ? {} : { branch: params.branch },
-      ...params.branchDetached === void 0 ? {} : { branchDetached: params.branchDetached }
+      ...params.branchDetached === void 0 ? {} : { branchDetached: params.branchDetached },
+      descend: descendPolicyFor(params.cascade, params.home)
     });
     const resolved = resolveDecisions({ facts, cascade: params.cascade, classification: params.classification });
     const manifest = {
@@ -6435,7 +6470,8 @@ function runCheck(params) {
     nowMs: params.nowMs,
     env: params.env,
     ...params.branch === void 0 ? {} : { branch: params.branch },
-    ...params.branchDetached === void 0 ? {} : { branchDetached: params.branchDetached }
+    ...params.branchDetached === void 0 ? {} : { branchDetached: params.branchDetached },
+    descend: descendPolicyFor(params.cascade, params.home)
   });
   const resolved = resolveDecisions({ facts, cascade: params.cascade, classification: params.classification });
   const decisionLines = [...resolved.decisions.values()].slice().sort((a, b) => a.relPath < b.relPath ? -1 : a.relPath > b.relPath ? 1 : 0).map(formatDecision);

package/dist/index.mjs

@@ -1223,6 +1223,37 @@ function planFarm(params) {
   return { entries, materialised, links };
 }
 
+// src/resolve/walkPolicy.ts
+var ENTER_EVERYTHING = () => true;
+function readsSubtreeAggregates(rule) {
+  const when = rule.when;
+  return when !== void 0 && (when.newerThan !== void 0 || when.olderThan !== void 0 || when.maxSizeBytes !== void 0);
+}
+function hasUnboundedDepth(pattern) {
+  return pattern.includes("**") || /[{(]/.test(pattern);
+}
+function couldMatchBeneath(rule, dirRel) {
+  if (rule.matches(dirRel)) {
+    return rule.when !== void 0;
+  }
+  if (rule.isExact) {
+    return rule.canonicalPattern.startsWith(`${dirRel}/`);
+  }
+  const depth = dirRel.split("/").length;
+  if (!hasUnboundedDepth(rule.canonicalPattern) && rule.segmentCount <= depth) {
+    return false;
+  }
+  const prefix = rule.literalPrefix;
+  return prefix === "" || prefix.startsWith(`${dirRel}/`) || dirRel.startsWith(prefix);
+}
+function descendPolicy(rules) {
+  const all = [...rules];
+  if (all.some(readsSubtreeAggregates)) {
+    return ENTER_EVERYTHING;
+  }
+  return (dirRel) => all.some((rule) => couldMatchBeneath(rule, dirRel));
+}
+
 // src/resolve/walk.ts
 import path4 from "node:path";
 
@@ -1401,6 +1432,9 @@ function topLevelNames(facts) {
   }
   return [...names].sort();
 }
+function descendPolicyFor(cascade, home) {
+  return descendPolicy(flattenLayers(assembleCascade(cascade).layers, { home }).rules.values());
+}
 function resolveDecisions(input) {
   const assembled = assembleCascade(input.cascade);
   const flattened = flattenLayers(assembled.layers, { home: input.facts.home });
@@ -1651,7 +1685,7 @@ function buildEntryFacts(params) {
     const isDirectory = stat.kind === "dir";
     let latestMtimeMs = stat.mtimeMs;
     let totalSizeBytes = stat.sizeBytes;
-    if (isDirectory) {
+    if (isDirectory && params.descend(rel)) {
       for (const name of [...params.fs.readdir(absolute)].sort()) {
         const child = visit(`${rel}/${name}`);
         if (child !== void 0) {
@@ -1998,7 +2032,8 @@ function resyncFarm(params) {
       nowMs,
       env: params.env,
       ...params.branch === void 0 ? {} : { branch: params.branch },
-      ...params.branchDetached === void 0 ? {} : { branchDetached: params.branchDetached }
+      ...params.branchDetached === void 0 ? {} : { branchDetached: params.branchDetached },
+      descend: descendPolicyFor(params.cascade, params.home)
     });
     const resolved = resolveDecisions({ facts, cascade: params.cascade, classification: params.classification });
     const manifest = {
@@ -6269,7 +6304,8 @@ function runCheck(params) {
     nowMs: params.nowMs,
     env: params.env,
     ...params.branch === void 0 ? {} : { branch: params.branch },
-    ...params.branchDetached === void 0 ? {} : { branchDetached: params.branchDetached }
+    ...params.branchDetached === void 0 ? {} : { branchDetached: params.branchDetached },
+    descend: descendPolicyFor(params.cascade, params.home)
   });
   const resolved = resolveDecisions({ facts, cascade: params.cascade, classification: params.classification });
   const decisionLines = [...resolved.decisions.values()].slice().sort((a, b) => a.relPath < b.relPath ? -1 : a.relPath > b.relPath ? 1 : 0).map(formatDecision);

package/dist/types/launcher/farm.d.ts

@@ -3,6 +3,7 @@ import { type FarmManifest } from "../resolve/reconcile";
 import { type ResolvedState } from "../resolve/pipeline";
 import type { CascadeInput } from "../resolve/walk";
 import type { Diagnostic, EntryFacts } from "../resolve/types";
+import type { DescendPolicy } from "../resolve/walkPolicy";
 import type { FarmFs } from "./ports";
 /** The manifest file each farm carries at its own root, recording what that resync built. Named distinctly from anything Claude Code itself writes into a config directory. A farm built under the former name carries `LEGACY_FARM_MANIFEST_FILENAME` instead, which is read as a fallback and never carried into the next farm, whose resync writes this name. */
 export declare const FARM_MANIFEST_FILENAME = ".agent-shim-farm.json";
@@ -18,6 +19,8 @@ export interface BuildEntryFactsParams {
     readonly env: Readonly<Record<string, string | undefined>>;
     readonly branch?: string;
     readonly branchDetached?: boolean;
+    /** Which directories the walk enters; see `descendPolicy`. A directory not entered is recorded as one entry with its own size and mtime only, so a caller that needs subtree aggregates passes a policy that enters everything. */
+    readonly descend: DescendPolicy;
 }
 /**
  * Walks the canonical `~/.claude` and builds the `EntryFacts` manifest the pure resolver consumes.

package/dist/types/resolve/pipeline.d.ts

@@ -2,6 +2,7 @@ import { type ClassifyResult } from "../config/classify";
 import type { CategoryClassification, CategoryClassificationOverlay } from "../config/schema";
 import { type ResolveAllResult } from "./decide";
 import { type FarmPlan } from "./plan";
+import { type DescendPolicy } from "./walkPolicy";
 import { type AssembledCascade, type CascadeInput } from "./walk";
 import type { Diagnostic, EntryFacts, FlattenedCascade } from "./types";
 /** Everything one launch needs resolved, in one call. */
@@ -24,6 +25,8 @@ export interface ResolvedState {
 }
 /** The top-level `~/.claude` entry names present in a fact manifest, in sorted order. */
 export declare function topLevelNames(facts: EntryFacts): string[];
+/** The walk policy `buildEntryFacts` needs for `cascade`: which directories of `~/.claude` the fact walk must enter, derived from the flattened rules (see `descendPolicy`). */
+export declare function descendPolicyFor(cascade: CascadeInput, home: string): DescendPolicy;
 /**
  * Runs the whole pipeline for one launch: assemble the ordered layer sequence, flatten it, classify the real `~/.claude` entries, decide every path, and plan the resulting farm.
  */

package/dist/types/resolve/walkPolicy.d.ts

@@ -0,0 +1,15 @@
+import type { CompiledRule } from "./types";
+/**
+ * Whether the walk that builds entry facts must enter the directory at `dirRel` (relative to `~/.claude`). A directory it does not enter is one entry: nothing recorded below it, because nothing below it can be decided differently from the directory itself.
+ */
+export type DescendPolicy = (dirRel: string) => boolean;
+/**
+ * The walk policy for a flattened cascade. A directory is entered only when some rule can decide a path inside it differently from the directory itself, so a configuration with no rule below a top-level entry reads that entry with one `lstat`; with a rule that reads subtree aggregates anywhere, every directory is entered.
+ *
+ * Why this is safe: a rule matching a directory also matches everything beneath it (see `compileMatcher`), and the category toggles decide by top-level entry, so a subtree no rule reaches into resolves to one uniform decision, which the farm plan collapses to a single link either way.
+ */
+export declare function descendPolicy(rules: Readonly<Iterable<CompiledRule>>): DescendPolicy;
+/**
+ * `policy`, widened to also enter `target` and every directory on the way to it, for a caller that needs the direct children of that path recorded (the interactive picker). With no `target` it is `policy` itself.
+ */
+export declare function enterRulesAnd(policy: DescendPolicy, target: string | undefined): DescendPolicy;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "claude-use",
-  "version": "7.13.0",
+  "version": "7.13.1",
   "description": "A profile manager and launcher for Claude Code that lets one person run multiple logins from one machine while controlling what gets shared between them.",
   "license": "MIT",
   "author": "Joseph Mearman <joseph@mearman.co.uk>",