-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathcompact_updates.go
More file actions
83 lines (70 loc) · 2.36 KB
/
Copy pathcompact_updates.go
File metadata and controls
83 lines (70 loc) · 2.36 KB
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
package klevdb
import (
"context"
"time"
art "github.com/plar/go-adaptive-radix-tree/v2"
)
// FindUpdates returns a set of offsets for messages that have the same key further in the log, before a given time.
//
// Messages before the last one for a given key are considered updates
// that are no longer relevant, and therefore are eligible for deletion.
func FindUpdates(ctx context.Context, l Log, before time.Time) (map[int64]struct{}, error) {
maxOffset, err := l.NextOffset()
if err != nil {
return nil, err
}
var keyOffset = art.New()
var offsets = map[int64]struct{}{}
SEARCH:
for offset := OffsetOldest; offset < maxOffset; {
nextOffset, msgs, err := l.Consume(offset, 32)
if err != nil {
return nil, err
}
offset = nextOffset
for _, msg := range msgs {
if msg.Time.After(before) {
break SEARCH
}
if prevMsgOffset, ok := keyOffset.Insert(msg.Key, msg.Offset); ok {
offsets[prevMsgOffset.(int64)] = struct{}{}
}
}
if err := ctx.Err(); err != nil {
return nil, err
}
}
if err := ctx.Err(); err != nil {
return nil, err
}
return offsets, nil
}
// CompactUpdates tries to remove messages before given time that are repeated
// further in the log leaving only the last message for a given key.
//
// This is similar to removing the old value updates, leaving only the current value (last update) for a key.
//
// returns the messages it deleted and the amount of storage freed
func CompactUpdates(ctx context.Context, l Log, before time.Time) ([]Message, int64, error) {
offsets, err := FindUpdates(ctx, l, before)
if err != nil {
return nil, 0, err
}
return l.Delete(offsets)
}
// CompactUpdatesMulti is similar to [CompactUpdates], but will try to remove messages from multiple segments
func CompactUpdatesMulti(ctx context.Context, l Log, before time.Time, backoff DeleteMultiBackoff) ([]Message, int64, error) {
offsets, err := FindUpdates(ctx, l, before)
if err != nil {
return nil, 0, err
}
return DeleteMulti(ctx, l, offsets, backoff)
}
// CompactUpdatesMultiOffsets is similar to [CompactUpdatesMulti], but only returns the deleted offsets
func CompactUpdatesMultiOffsets(ctx context.Context, l Log, before time.Time, backoff DeleteMultiBackoff) (map[int64]struct{}, int64, error) {
offsets, err := FindUpdates(ctx, l, before)
if err != nil {
return nil, 0, err
}
return DeleteMultiOffsets(ctx, l, offsets, backoff)
}