walles/moar
1
1
Fork 0
mirror of https://github.com/walles/moar.git synced 2024-09-11 12:15:43 +03:00
Code Issues Projects Releases Wiki Activity

Half way implement the parallel search

Browse Source
This commit is contained in:
Johan Walles 2024-05-18 07:23:40 +02:00
parent 0ba0415a50
commit 27d03630a5
1 changed files with 14 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
m/search.go
View File

@ -2,6 +2,7 @@ package m
import (
"fmt"
"runtime"
"github.com/walles/moar/m/linenumbers"
)
@ -39,10 +40,20 @@ func (p *Pager) scrollToSearchHits() {
//
// FIXME: We should take startPosition.deltaScreenLines into account as well!
func (p *Pager) findFirstHit(startPosition linenumbers.LineNumber, beforePosition *linenumbers.LineNumber, backwards bool) *scrollPosition {
// FIXME: Check the number of CPU cores
// If the number of lines to search matches the number of cores (or more),
// divide the search into chunks. Otherwise use one chunk.
chunkCount := runtime.NumCPU()
linesCount := p.reader.GetLineCount() - startPosition.AsZeroBased()
if linesCount < chunkCount {
chunkCount = 0
}
chunkSize := linesCount / chunkCount
// FIXME: If the number of lines to search match the number of cores (or
// more), divide the search into chunks. Otherwise use one chunk.
// Each parallel search will start at one of these positions
searchStarts := make([]linenumbers.LineNumber, chunkCount)
for i := 0; i < chunkCount; i++ {
searchStarts[i] = startPosition.NonWrappingAdd(i * chunkSize)
}
// FIXME: Make a results array, with one result per chunk