Spaces:
Running
Running
File size: 3,441 Bytes
b110593 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 |
// _ _
// __ _____ __ ___ ___ __ _| |_ ___
// \ \ /\ / / _ \/ _` \ \ / / |/ _` | __/ _ \
// \ V V / __/ (_| |\ V /| | (_| | || __/
// \_/\_/ \___|\__,_| \_/ |_|\__,_|\__\___|
//
// Copyright © 2016 - 2024 Weaviate B.V. All rights reserved.
//
// CONTACT: [email protected]
//
package lsmkv
import "github.com/weaviate/weaviate/entities/lsmkv"
type segmentCursorMap struct {
segment *segment
nextOffset uint64
}
func (s *segment) newMapCursor() *segmentCursorMap {
return &segmentCursorMap{
segment: s,
}
}
func (sg *SegmentGroup) newMapCursors() ([]innerCursorMap, func()) {
sg.maintenanceLock.RLock()
out := make([]innerCursorMap, len(sg.segments))
for i, segment := range sg.segments {
out[i] = segment.newMapCursor()
}
return out, sg.maintenanceLock.RUnlock
}
func (s *segmentCursorMap) seek(key []byte) ([]byte, []MapPair, error) {
node, err := s.segment.index.Seek(key)
if err != nil {
return nil, nil, err
}
parsed, err := s.parseCollectionNode(nodeOffset{node.Start, node.End})
// make sure to set the next offset before checking the error. The error
// could be 'Deleted' which would require that the offset is still advanced
// for the next cycle
s.nextOffset = node.End
if err != nil {
return parsed.primaryKey, nil, err
}
pairs := make([]MapPair, len(parsed.values))
for i := range pairs {
if err := pairs[i].FromBytes(parsed.values[i].value, false); err != nil {
return nil, nil, err
}
pairs[i].Tombstone = parsed.values[i].tombstone
}
return parsed.primaryKey, pairs, nil
}
func (s *segmentCursorMap) next() ([]byte, []MapPair, error) {
if s.nextOffset >= s.segment.dataEndPos {
return nil, nil, lsmkv.NotFound
}
parsed, err := s.parseCollectionNode(nodeOffset{start: s.nextOffset})
// make sure to set the next offset before checking the error. The error
// could be 'Deleted' which would require that the offset is still advanced
// for the next cycle
s.nextOffset = s.nextOffset + uint64(parsed.offset)
if err != nil {
return parsed.primaryKey, nil, err
}
pairs := make([]MapPair, len(parsed.values))
for i := range pairs {
if err := pairs[i].FromBytes(parsed.values[i].value, false); err != nil {
return nil, nil, err
}
pairs[i].Tombstone = parsed.values[i].tombstone
}
return parsed.primaryKey, pairs, nil
}
func (s *segmentCursorMap) first() ([]byte, []MapPair, error) {
s.nextOffset = s.segment.dataStartPos
parsed, err := s.parseCollectionNode(nodeOffset{start: s.nextOffset})
// make sure to set the next offset before checking the error. The error
// could be 'Deleted' which would require that the offset is still advanced
// for the next cycle
s.nextOffset = s.nextOffset + uint64(parsed.offset)
if err != nil {
return parsed.primaryKey, nil, err
}
pairs := make([]MapPair, len(parsed.values))
for i := range pairs {
if err := pairs[i].FromBytes(parsed.values[i].value, false); err != nil {
return nil, nil, err
}
pairs[i].Tombstone = parsed.values[i].tombstone
}
return parsed.primaryKey, pairs, nil
}
func (s *segmentCursorMap) parseCollectionNode(offset nodeOffset) (segmentCollectionNode, error) {
r, err := s.segment.newNodeReader(offset)
if err != nil {
return segmentCollectionNode{}, err
}
return ParseCollectionNode(r)
}
|