chore: Enable "curly" rule to avoid single-statement if confusion/errors.

src/memory/internal.ts

@@ -31,7 +31,9 @@ export function normalizeRelPath(value: string): string {
 }
 
 export function normalizeExtraMemoryPaths(workspaceDir: string, extraPaths?: string[]): string[] {
-  if (!extraPaths?.length) return [];
+  if (!extraPaths?.length) {
+    return [];
+  }
   const resolved = extraPaths
     .map((value) => value.trim())
     .filter(Boolean)
@@ -43,8 +45,12 @@ export function normalizeExtraMemoryPaths(workspaceDir: string, extraPaths?: str
 
 export function isMemoryPath(relPath: string): boolean {
   const normalized = normalizeRelPath(relPath);
-  if (!normalized) return false;
-  if (normalized === "MEMORY.md" || normalized === "memory.md") return true;
+  if (!normalized) {
+    return false;
+  }
+  if (normalized === "MEMORY.md" || normalized === "memory.md") {
+    return true;
+  }
   return normalized.startsWith("memory/");
 }
 
@@ -52,13 +58,19 @@ async function walkDir(dir: string, files: string[]) {
   const entries = await fs.readdir(dir, { withFileTypes: true });
   for (const entry of entries) {
     const full = path.join(dir, entry.name);
-    if (entry.isSymbolicLink()) continue;
+    if (entry.isSymbolicLink()) {
+      continue;
+    }
     if (entry.isDirectory()) {
       await walkDir(full, files);
       continue;
     }
-    if (!entry.isFile()) continue;
-    if (!entry.name.endsWith(".md")) continue;
+    if (!entry.isFile()) {
+      continue;
+    }
+    if (!entry.name.endsWith(".md")) {
+      continue;
+    }
     files.push(full);
   }
 }
@@ -75,8 +87,12 @@ export async function listMemoryFiles(
   const addMarkdownFile = async (absPath: string) => {
     try {
       const stat = await fs.lstat(absPath);
-      if (stat.isSymbolicLink() || !stat.isFile()) return;
-      if (!absPath.endsWith(".md")) return;
+      if (stat.isSymbolicLink() || !stat.isFile()) {
+        return;
+      }
+      if (!absPath.endsWith(".md")) {
+        return;
+      }
       result.push(absPath);
     } catch {}
   };
@@ -95,7 +111,9 @@ export async function listMemoryFiles(
     for (const inputPath of normalizedExtraPaths) {
       try {
         const stat = await fs.lstat(inputPath);
-        if (stat.isSymbolicLink()) continue;
+        if (stat.isSymbolicLink()) {
+          continue;
+        }
         if (stat.isDirectory()) {
           await walkDir(inputPath, result);
           continue;
@@ -106,7 +124,9 @@ export async function listMemoryFiles(
       } catch {}
     }
   }
-  if (result.length <= 1) return result;
+  if (result.length <= 1) {
+    return result;
+  }
   const seen = new Set<string>();
   const deduped: string[] = [];
   for (const entry of result) {
@@ -114,7 +134,9 @@ export async function listMemoryFiles(
     try {
       key = await fs.realpath(entry);
     } catch {}
-    if (seen.has(key)) continue;
+    if (seen.has(key)) {
+      continue;
+    }
     seen.add(key);
     deduped.push(entry);
   }
@@ -146,7 +168,9 @@ export function chunkMarkdown(
   chunking: { tokens: number; overlap: number },
 ): MemoryChunk[] {
   const lines = content.split("\n");
-  if (lines.length === 0) return [];
+  if (lines.length === 0) {
+    return [];
+  }
   const maxChars = Math.max(32, chunking.tokens * 4);
   const overlapChars = Math.max(0, chunking.overlap * 4);
   const chunks: MemoryChunk[] = [];
@@ -155,10 +179,14 @@ export function chunkMarkdown(
   let currentChars = 0;
 
   const flush = () => {
-    if (current.length === 0) return;
+    if (current.length === 0) {
+      return;
+    }
     const firstEntry = current[0];
     const lastEntry = current[current.length - 1];
-    if (!firstEntry || !lastEntry) return;
+    if (!firstEntry || !lastEntry) {
+      return;
+    }
     const text = current.map((entry) => entry.line).join("\n");
     const startLine = firstEntry.lineNo;
     const endLine = lastEntry.lineNo;
@@ -180,10 +208,14 @@ export function chunkMarkdown(
     const kept: Array<{ line: string; lineNo: number }> = [];
     for (let i = current.length - 1; i >= 0; i -= 1) {
       const entry = current[i];
-      if (!entry) continue;
+      if (!entry) {
+        continue;
+      }
       acc += entry.line.length + 1;
       kept.unshift(entry);
-      if (acc >= overlapChars) break;
+      if (acc >= overlapChars) {
+        break;
+      }
     }
     current = kept;
     currentChars = kept.reduce((sum, entry) => sum + entry.line.length + 1, 0);
@@ -224,7 +256,9 @@ export function parseEmbedding(raw: string): number[] {
 }
 
 export function cosineSimilarity(a: number[], b: number[]): number {
-  if (a.length === 0 || b.length === 0) return 0;
+  if (a.length === 0 || b.length === 0) {
+    return 0;
+  }
   const len = Math.min(a.length, b.length);
   let dot = 0;
   let normA = 0;
@@ -236,6 +270,8 @@ export function cosineSimilarity(a: number[], b: number[]): number {
     normA += av * av;
     normB += bv * bv;
   }
-  if (normA === 0 || normB === 0) return 0;
+  if (normA === 0 || normB === 0) {
+    return 0;
+  }
   return dot / (Math.sqrt(normA) * Math.sqrt(normB));
 }