mirror of
https://source.quilibrium.com/quilibrium/ceremonyclient.git
synced 2024-11-15 04:35:17 +00:00
51 lines
1.8 KiB
Go
51 lines
1.8 KiB
Go
|
// Copyright 2023 The LevelDB-Go and Pebble Authors. All rights reserved. Use
|
||
|
// of this source code is governed by a BSD-style license that can be found in
|
||
|
// the LICENSE file.
|
||
|
|
||
|
package keyspan
|
||
|
|
||
|
import "github.com/cockroachdb/pebble/internal/base"
|
||
|
|
||
|
// Transformer defines a transformation to be applied to a Span.
|
||
|
type Transformer interface {
|
||
|
// Transform takes a Span as input and writes the transformed Span to the
|
||
|
// provided output *Span pointer. The output Span's Keys slice may be reused
|
||
|
// by Transform to reduce allocations.
|
||
|
Transform(cmp base.Compare, in Span, out *Span) error
|
||
|
}
|
||
|
|
||
|
// The TransformerFunc type is an adapter to allow the use of ordinary functions
|
||
|
// as Transformers. If f is a function with the appropriate signature,
|
||
|
// TransformerFunc(f) is a Transformer that calls f.
|
||
|
type TransformerFunc func(base.Compare, Span, *Span) error
|
||
|
|
||
|
// Transform calls f(cmp, in, out).
|
||
|
func (tf TransformerFunc) Transform(cmp base.Compare, in Span, out *Span) error {
|
||
|
return tf(cmp, in, out)
|
||
|
}
|
||
|
|
||
|
var noopTransform Transformer = TransformerFunc(func(_ base.Compare, s Span, dst *Span) error {
|
||
|
dst.Start, dst.End = s.Start, s.End
|
||
|
dst.Keys = append(dst.Keys[:0], s.Keys...)
|
||
|
return nil
|
||
|
})
|
||
|
|
||
|
// VisibleTransform filters keys that are invisible at the provided snapshot
|
||
|
// sequence number.
|
||
|
func VisibleTransform(snapshot uint64) Transformer {
|
||
|
return TransformerFunc(func(_ base.Compare, s Span, dst *Span) error {
|
||
|
dst.Start, dst.End = s.Start, s.End
|
||
|
dst.Keys = dst.Keys[:0]
|
||
|
for _, k := range s.Keys {
|
||
|
// NB: The InternalKeySeqNumMax value is used for the batch snapshot
|
||
|
// because a batch's visible span keys are filtered when they're
|
||
|
// fragmented. There's no requirement to enforce visibility at
|
||
|
// iteration time.
|
||
|
if base.Visible(k.SeqNum(), snapshot, base.InternalKeySeqNumMax) {
|
||
|
dst.Keys = append(dst.Keys, k)
|
||
|
}
|
||
|
}
|
||
|
return nil
|
||
|
})
|
||
|
}
|