@tensor.chat/companion 0.3.0 → 0.3.1

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tensor.chat/companion",
-  "version": "0.3.0",
+  "version": "0.3.1",
   "description": "Lets your tensor.chat AI use this machine: files, shell and internet through your own connection.",
   "license": "MIT",
   "homepage": "https://tensor.chat",

package/src/tools/files.js

@@ -172,17 +172,26 @@ function walk(root, onEntry) {
 // A pattern written as the tree shows it ("Devices/Devbox/game/**", or just the device
 // folder "Devices/Devbox/**") narrows to that shared folder and continues relative to
 // it; anything else is matched relative to every shared folder, as before.
+// Every folder's own name is tried before the device folder: the device folder is the
+// start of every name, so tried in the same pass it caught "Devices/PC/VoiceType/*" at
+// the first folder, and only the first shared folder could be searched (03.10.2026).
 function splitTreePattern(okRoots, pattern) {
   const p = pattern.replace(/\\/g, '/');
   const low = p.toLowerCase();
+  const rest = (prefix) => {
+    if (!prefix) return null;
+    const pre = prefix.toLowerCase();
+    if (low === pre) return '*';
+    return low.startsWith(pre + '/') ? p.slice(prefix.length + 1) || '*' : null;
+  };
   for (const r of okRoots) {
-    if (!r.label) continue;
-    const parent = r.label.slice(0, r.label.lastIndexOf('/'));
-    for (const [prefix, only] of [[r.label, [r]], [parent, okRoots]]) {
-      if (!prefix) continue;
-      if (low === prefix.toLowerCase()) return { roots: only, pattern: '*' };
-      if (low.startsWith(prefix.toLowerCase() + '/')) return { roots: only, pattern: p.slice(prefix.length + 1) || '*' };
-    }
+    const after = r.label ? rest(r.label) : null;
+    if (after !== null) return { roots: [r], pattern: after };
+  }
+  for (const r of okRoots) {
+    const cut = r.label ? r.label.lastIndexOf('/') : -1;
+    const after = rest(cut > 0 ? r.label.slice(0, cut) : '');
+    if (after !== null) return { roots: okRoots, pattern: after };
   }
   return { roots: okRoots, pattern: p };
 }