Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #14 from koki-develop/search-performance
- Loading branch information
Showing
4 changed files
with
101 additions
and
15 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,90 @@ | ||
| package fzf | ||
|
|
||
| import ( | ||
| "sort" | ||
| "sync" | ||
| ) | ||
|
|
||
| type match struct { | ||
| Str string | ||
| Index int | ||
| MatchedIndexes []int | ||
| } | ||
|
|
||
| type matches []match | ||
|
|
||
| func (m matches) Sort() { | ||
| sort.Slice(m, func(i, j int) bool { | ||
| mi, mj := m[i].MatchedIndexes, m[j].MatchedIndexes | ||
| li, lj := len(mi), len(mj) | ||
|
|
||
| if li != lj { | ||
| return li < lj | ||
| } | ||
|
|
||
| for k := 0; k < li; k++ { | ||
| if mi[k] != mj[k] { | ||
| return mi[k] < mj[k] | ||
| } | ||
| } | ||
|
|
||
| return m[i].Index < m[j].Index | ||
| }) | ||
| } | ||
|
|
||
| func fuzzySearch(items *items, search string) matches { | ||
| result := make(matches, 0, items.Len()) | ||
| resultMutex := sync.Mutex{} | ||
| wg := sync.WaitGroup{} | ||
|
|
||
| numWorkers := 8 | ||
| chunkSize := (items.Len() + numWorkers - 1) / numWorkers | ||
| chunks := make(chan int, numWorkers) | ||
|
|
||
| for i := 0; i < numWorkers; i++ { | ||
| wg.Add(1) | ||
| go func() { | ||
| defer wg.Done() | ||
|
|
||
| for start := range chunks { | ||
| end := start + chunkSize | ||
| if end > items.Len() { | ||
| end = items.Len() | ||
| } | ||
|
|
||
| localMatches := make(matches, 0) | ||
|
|
||
| for index := start; index < end; index++ { | ||
| item := items.String(index) | ||
| matchedIndexes := make([]int, 0, len(search)) | ||
| j := 0 | ||
|
|
||
| for i, r := range item { | ||
| if j < len(search) && r == rune(search[j]) { | ||
| matchedIndexes = append(matchedIndexes, i) | ||
| j++ | ||
| } | ||
| } | ||
|
|
||
| if j == len(search) { | ||
| m := match{Str: item, Index: index, MatchedIndexes: matchedIndexes} | ||
| localMatches = append(localMatches, m) | ||
| } | ||
| } | ||
|
|
||
| resultMutex.Lock() | ||
| result = append(result, localMatches...) | ||
| resultMutex.Unlock() | ||
| } | ||
| }() | ||
| } | ||
|
|
||
| for i := 0; i < items.Len(); i += chunkSize { | ||
| chunks <- i | ||
| } | ||
| close(chunks) | ||
| wg.Wait() | ||
|
|
||
| result.Sort() | ||
| return result | ||
| } |