The link is restricted. Possible to get it to work? Thx
to get range of item 100 - 1000, should i do like this or there's more efficient means to get 100-1000 items?
// var key, value []byte
kvi, err := bpt.Find(k)
if err != nil {
log.Fatal(err)
}
var i uint64
var b [][]byte
for key, value, err, kvi = kvi(); kvi != nil; key, value, err, kvi = kvi() {
if i > 100 {
b[i] = value
}
if i == 1000 {
break;
}
i++
// do stuff with the keys and values
return value, err
}
if err != nil {
log.Fatal(err)
}
return nil, err
https://pkg.go.dev/github.com/timtadh/fs2/bptree?utm_source=godoc
The link is restricted. Possible to get it to work? Thx
to get range of item 100 - 1000, should i do like this or there's more efficient means to get 100-1000 items?