chore: sevral small refinements

fsearch.go

@@ -20,6 +20,9 @@ type FSearch struct {
 	resultLimit int
 }
 
+// New creates a new Fsearch
+// pathSeparator is the path separator in the path
+// limit is the upper bound of matched results size, 0 means unlimited (not recommended).
 func New(pathSeparator string, limit int) *FSearch {
 	fs := &FSearch{
 		on:          true,

fsearch_bench_test.go

@@ -5,45 +5,49 @@ import (
 	"testing"
 )
 
+func genTreePaths(sampleSize, factor int) map[string]bool {
+	paths := map[string]bool{"root": true}
+	nextLevelPaths := map[string]bool{}
+
+	for len(paths) <= sampleSize {
+		for pathname := range paths {
+			for i := 0; i < factor; i++ {
+				subPath := fmt.Sprintf("%s/%s", pathname, randStr.Alphabets())
+				nextLevelPaths[subPath] = true
+			}
+
+			if len(nextLevelPaths) > sampleSize {
+				break
+			}
+		}
+
+		paths = nextLevelPaths
+		nextLevelPaths = map[string]bool{}
+	}
+
+	return paths
+}
+
 func BenchmarkFSearch(b *testing.B) {
 	const (
 		segmentLen = 4
 		factor     = 10
 		sampleSize = 10000 * 100
 	)
 
-	genTreePaths := func(sampleSize int) map[string]bool {
-		paths := map[string]bool{"root": true}
-		nextLevelPaths := map[string]bool{}
-
-		for len(paths) <= sampleSize {
-			for pathname := range paths {
-				for i := 0; i < factor; i++ {
-					subPath := fmt.Sprintf("%s/%s", pathname, randStr.Alphabets())
-					nextLevelPaths[subPath] = true
-				}
-
-				if len(nextLevelPaths) > sampleSize {
-					break
-				}
-			}
-
-			paths = nextLevelPaths
-			nextLevelPaths = map[string]bool{}
+	var pathnames = genTreePaths(sampleSize, factor)
+	fmt.Printf("bench sample size (%d)\n", len(pathnames))
+	fs := New("/", 0)
+	for pathname := range pathnames {
+		err := fs.AddPath(pathname)
+		if err != nil {
+			b.Fatal(err)
 		}
-
-		return paths
 	}
 
-	pathnames := genTreePaths(sampleSize)
-	fmt.Printf("bench sample size (%d)\n", len(pathnames))
+	b.ResetTimer()
+
 	for i := 0; i < b.N; i++ {
-		fs := New("/", 0)
-		for pathname := range pathnames {
-			err := fs.AddPath(pathname)
-			if err != nil {
-				b.Fatal(err)
-			}
-		}
+		fs.Search("ab")
 	}
 }

fsearch_test.go

@@ -134,7 +134,7 @@ func TestFSearch(t *testing.T) {
 				if len(fs.idsToDelete) == 0 {
 					break
 				}
-				fmt.Printf("wating for drain: %d\n", len(fs.idsToDelete))
+				fmt.Printf("waiting for drain: %d\n", len(fs.idsToDelete))
 				time.Sleep(500 * time.Millisecond)
 			}