64 lines
1.4 KiB
Go
64 lines
1.4 KiB
Go
|
package tsdb
|
||
|
|
|
||
|
|
import (
|
||
|
|
"io"
|
||
|
|
"sort"
|
||
|
|
"unsafe"
|
||
|
|
)
|
||
|
|
|
||
|
|
const (
|
||
|
|
magicIndex = 0xCAFECAFE
|
||
|
|
magicSeries = 0xAFFEAFFE
|
||
|
|
)
|
||
|
|
|
||
|
|
// Block handles reads against a block of time series data within a time window.
|
||
|
|
type Block interface{}
|
||
|
|
|
||
|
|
const (
|
||
|
|
flagNone = 0
|
||
|
|
flagStd = 1
|
||
|
|
)
|
||
|
|
|
||
|
|
// A skiplist maps offsets to values. The values found in the data at an
|
||
|
|
// offset are strictly greater than the indexed value.
|
||
|
|
type skiplist interface {
|
||
|
|
// A skiplist can serialize itself into a writer.
|
||
|
|
io.WriterTo
|
||
|
|
|
||
|
|
// offset returns the offset to data containing values of x and lower.
|
||
|
|
offset(x int64) (uint32, bool)
|
||
|
|
}
|
||
|
|
|
||
|
|
// simpleSkiplist is a slice of plain value/offset pairs.
|
||
|
|
type simpleSkiplist []skiplistPair
|
||
|
|
|
||
|
|
type skiplistPair struct {
|
||
|
|
value int64
|
||
|
|
offset uint32
|
||
|
|
}
|
||
|
|
|
||
|
|
func (sl simpleSkiplist) offset(x int64) (uint32, bool) {
|
||
|
|
// Search for the first offset that contains data greater than x.
|
||
|
|
i := sort.Search(len(sl), func(i int) bool { return sl[i].value >= x })
|
||
|
|
|
||
|
|
// If no element was found return false. If the first element is found,
|
||
|
|
// there's no previous offset actually containing values that are x or lower.
|
||
|
|
if i == len(sl) || i == 0 {
|
||
|
|
return 0, false
|
||
|
|
}
|
||
|
|
return sl[i-1].offset, true
|
||
|
|
}
|
||
|
|
|
||
|
|
func (sl simpleSkiplist) WriteTo(w io.Writer) (n int64, err error) {
|
||
|
|
for _, s := range sl {
|
||
|
|
b := ((*[unsafe.Sizeof(skiplistPair{})]byte)(unsafe.Pointer(&s)))[:]
|
||
|
|
|
||
|
|
m, err := w.Write(b)
|
||
|
|
if err != nil {
|
||
|
|
return n + int64(m), err
|
||
|
|
}
|
||
|
|
n += int64(m)
|
||
|
|
}
|
||
|
|
return n, err
|
||
|
|
}
|