xonecas.io
5119
Lh

lazy-history / commit 7cb59d0

fix: search for substring matches then sort by distance

Sean2025-05-11 7cb59d01055c9423545204601b4261f61b3ab4b7 parent 3e84cdf

1 file changed

internal/search/search.go+6−11
@@ -2,6 +2,7 @@ package search
22
33 import (
44 "sort"
5+ "strings"
56
67 "github.com/samber/lo"
78 )
@@ -21,12 +22,12 @@ func Search(slice []string, substring string) []string {
2122
2223 // Search a slice of strings for a substring and sort by levenshtein distance.
2324 func search(slice []string, substring string) []SearchResult {
24- results := lo.Reduce(slice, func(agg []SearchResult, item string, index int) []SearchResult {
25- // Skip empty lines
26- if len(item) <= 0 {
27- return agg
28- }
25+ // search for the substring in the slice
26+ matches := lo.Filter(slice, func(item string, _ int) bool {
27+ return strings.Contains(item, substring)
28+ })
2929
30+ results := lo.Reduce(matches, func(agg []SearchResult, item string, index int) []SearchResult {
3031 // Skip lines that already exist in the results
3132 contains := lo.ContainsBy(agg, func(result SearchResult) bool {
3233 return result.Value == item
@@ -34,13 +35,7 @@ func search(slice []string, substring string) []SearchResult {
3435 if contains {
3536 return agg
3637 }
37-
38- // Skip lines with a levenshtein distance greater than 3
3938 distance := levenshteinDistance(item, substring)
40- if distance > 4 {
41- return agg
42- }
43-
4439 agg = append(agg, SearchResult{Value: item, Distance: distance})
4540
4641 return agg