From 440cfee620068be707b9307d920661192cd0058b Mon Sep 17 00:00:00 2001
From: DBT <nvue.dev@gmail.com>
Date: Thu, 12 Feb 2026 05:32:39 +0000
Subject: [PATCH] perf: implement concurrent file searching in MemorySearchTool

---
 pkg/tools/memory.go | 49 ++++++++++++++++++++++++++++++---------------
 1 file changed, 33 insertions(+), 16 deletions(-)

diff --git a/pkg/tools/memory.go b/pkg/tools/memory.go
index 34a136c..4f002ba 100644
--- a/pkg/tools/memory.go
+++ b/pkg/tools/memory.go
@@ -7,6 +7,7 @@ import (
 	"os"
 	"path/filepath"
 	"strings"
+	"sync"
 )
 
 type MemorySearchTool struct {
@@ -69,37 +70,53 @@ func (t *MemorySearchTool) Execute(ctx context.Context, args map[string]interfac
 	}
 
 	files := t.getMemoryFiles()
-	var results []searchResult
+	
+	resultsChan := make(chan []searchResult, len(files))
+	var wg sync.WaitGroup
 
+	// 并发搜索所有文件
 	for _, file := range files {
-		matches, err := t.searchFile(file, keywords)
-		if err != nil {
-			continue // skip unreadable files
-		}
-		results = append(results, matches...)
+		wg.Add(1)
+		go func(f string) {
+			defer wg.Done()
+			matches, err := t.searchFile(f, keywords)
+			if err == nil {
+				resultsChan <- matches
+			}
+		}(file)
+	}
+
+	// 异步关闭通道
+	go func() {
+		wg.Wait()
+		close(resultsChan)
+	}()
+
+	var allResults []searchResult
+	for matches := range resultsChan {
+		allResults = append(allResults, matches...)
 	}
 
 	// Simple ranking: sort by score (number of keyword matches) desc
-	// Ideally use a stable sort or more sophisticated scoring
-	for i := 0; i < len(results); i++ {
-		for j := i + 1; j < len(results); j++ {
-			if results[j].score > results[i].score {
-				results[i], results[j] = results[j], results[i]
+	for i := 0; i < len(allResults); i++ {
+		for j := i + 1; j < len(allResults); j++ {
+			if allResults[j].score > allResults[i].score {
+				allResults[i], allResults[j] = allResults[j], allResults[i]
 			}
 		}
 	}
 
-	if len(results) > maxResults {
-		results = results[:maxResults]
+	if len(allResults) > maxResults {
+		allResults = allResults[:maxResults]
 	}
 
-	if len(results) == 0 {
+	if len(allResults) == 0 {
 		return fmt.Sprintf("No memory found for query: %s", query), nil
 	}
 
 	var sb strings.Builder
-	sb.WriteString(fmt.Sprintf("Found %d memories for '%s':\n\n", len(results), query))
-	for _, res := range results {
+	sb.WriteString(fmt.Sprintf("Found %d memories for '%s':\n\n", len(allResults), query))
+	for _, res := range allResults {
 		relPath, _ := filepath.Rel(t.workspace, res.file)
 		sb.WriteString(fmt.Sprintf("--- Source: %s:%d ---\n%s\n\n", relPath, res.lineNum, res.content))
 	}