/
memtable_flush_roaring_set.go
74 lines (62 loc) · 1.92 KB
/
memtable_flush_roaring_set.go
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
// _ _
// __ _____ __ ___ ___ __ _| |_ ___
// \ \ /\ / / _ \/ _` \ \ / / |/ _` | __/ _ \
// \ V V / __/ (_| |\ V /| | (_| | || __/
// \_/\_/ \___|\__,_| \_/ |_|\__,_|\__\___|
//
// Copyright © 2016 - 2024 Weaviate B.V. All rights reserved.
//
// CONTACT: hello@weaviate.io
//
package lsmkv
import (
"fmt"
"io"
"github.com/weaviate/weaviate/adapters/repos/db/lsmkv/segmentindex"
"github.com/weaviate/weaviate/adapters/repos/db/roaringset"
)
func (m *Memtable) flushDataRoaringSet(f io.Writer) ([]segmentindex.Key, error) {
flat := m.roaringSet.FlattenInOrder()
totalDataLength := totalPayloadSizeRoaringSet(flat)
header := segmentindex.Header{
IndexStart: uint64(totalDataLength + segmentindex.HeaderSize),
Level: 0, // always level zero on a new one
Version: 0, // always version 0 for now
SecondaryIndices: 0,
Strategy: segmentindex.StrategyRoaringSet,
}
n, err := header.WriteTo(f)
if err != nil {
return nil, err
}
headerSize := int(n)
keys := make([]segmentindex.Key, len(flat))
totalWritten := headerSize
for i, node := range flat {
sn, err := roaringset.NewSegmentNode(node.Key, node.Value.Additions,
node.Value.Deletions)
if err != nil {
return nil, fmt.Errorf("create segment node: %w", err)
}
ki, err := sn.KeyIndexAndWriteTo(f, totalWritten)
if err != nil {
return nil, fmt.Errorf("write node %d: %w", i, err)
}
keys[i] = ki
totalWritten = ki.ValueEnd
}
return keys, nil
}
func totalPayloadSizeRoaringSet(in []*roaringset.BinarySearchNode) int {
var sum int
for _, n := range in {
sum += 8 // uint64 to segment length
sum += 8 // uint64 to indicate length of additions bitmap
sum += len(n.Value.Additions.ToBuffer())
sum += 8 // uint64 to indicate length of deletions bitmap
sum += len(n.Value.Deletions.ToBuffer())
sum += 4 // uint32 to indicate key size
sum += len(n.Key)
}
return sum
}