fx/search.go
2024-03-21 20:48:09 +01:00

75 lines
1.8 KiB
Go

package main
import (
. "github.com/antonmedv/fx/internal/jsonx"
)
type search struct {
err error
results []*Node
cursor int
values map[*Node][]match
keys map[*Node][]match
}
func newSearch() *search {
return &search{
results: make([]*Node, 0),
values: make(map[*Node][]match),
keys: make(map[*Node][]match),
}
}
type match struct {
start, end int
index int
}
type piece struct {
b []byte
index int
}
func splitBytesByIndexes(b []byte, indexes []match) []piece {
out := make([]piece, 0, 1)
pos := 0
for _, pair := range indexes {
out = append(out, piece{safeSlice(b, pos, pair.start), -1})
out = append(out, piece{safeSlice(b, pair.start, pair.end), pair.index})
pos = pair.end
}
out = append(out, piece{safeSlice(b, pos, len(b)), -1})
return out
}
func splitIndexesToChunks(chunks [][]byte, indexes [][]int, searchIndex int) (chunkIndexes [][]match) {
chunkIndexes = make([][]match, len(chunks))
for index, idx := range indexes {
position := 0
for i, chunk := range chunks {
// If start index lies in this chunk
if idx[0] < position+len(chunk) {
// Calculate local start and end for this chunk
localStart := idx[0] - position
localEnd := idx[1] - position
// If the end index also lies in this chunk
if idx[1] <= position+len(chunk) {
chunkIndexes[i] = append(chunkIndexes[i], match{start: localStart, end: localEnd, index: searchIndex + index})
break
} else {
// If the end index is outside this chunk, split the index
chunkIndexes[i] = append(chunkIndexes[i], match{start: localStart, end: len(chunk), index: searchIndex + index})
// Adjust the starting index for the next chunk
idx[0] = position + len(chunk)
}
}
position += len(chunk)
}
}
return
}