README
¶
Usual variable name abbreviations
b - builder bt - btree it, iter - iterator nd - node ni - node iterator off - offset (uint64) pos - position sb - strings.Builder sep - separator st - state st - stor.Stor
Documentation
¶
Overview ¶
Example (Merge_split) ¶
var b nodeBuilder
b.Add("1234xxxx", 1234, 1)
b.Add("1235xxxx", 1235, 1)
b.Add("1299xxxx", 1299, 1)
b.Add("1300xxxx", 1300, 1)
b.Add("1305xxxx", 1305, 1)
m := merge{node: b.node, modified: true}
left, right, splitKey := m.split(b.node.Size())
fmt.Println("splitKey", splitKey)
fmt.Println("LEFT ---")
left.print()
fmt.Println("RIGHT ---")
right.print()
Output: splitKey 129 LEFT --- 1234 '' 1235 1235 RIGHT --- 1299 '' 1300 13 1305 1305
Example (Node_BuilderSplit) ¶
var b nodeBuilder
b.Add("1234xxxx", 1234, 1)
b.Add("1235xxxx", 1235, 1)
b.Add("1299xxxx", 1299, 1)
b.Add("1300xxxx", 1300, 1)
b.Add("1305xxxx", 1305, 1)
st := stor.HeapStor(8192)
leftOff, splitKey := b.Split(st)
// assert.T(t).This(splitKey).Is("13")
fmt.Println("splitKey", splitKey)
fmt.Println("LEFT ---")
readNode(st, leftOff).print()
fmt.Println("RIGHT ---")
b.node.print()
Output: splitKey 13 LEFT --- 1234 '' 1235 1235 1299 129 RIGHT --- 1300 '' 1305 1305
Index ¶
- Constants
- Variables
- func Builder(st *stor.Stor) *builder
- func CreateBtree(st *stor.Stor, is *ixkey.Spec) iface.Btree
- func OpenBtree(st *stor.Stor, root uint64, treeLevels int) iface.Btree
- func PutEmptyNode(st *stor.Stor)
- func Read(st *stor.Stor, r *stor.Reader) iface.Btree
- type Iterator
- func (it *Iterator) Cur() (string, uint64)
- func (it *Iterator) Eof() bool
- func (it *Iterator) HasCur() bool
- func (it *Iterator) Key() string
- func (it *Iterator) Modified() bool
- func (it *Iterator) Next()
- func (it *Iterator) Offset() uint64
- func (it *Iterator) Prev()
- func (it *Iterator) Range(rng Range)
- func (it *Iterator) Rewind()
- func (it *Iterator) Seek(key string)
- func (it *Iterator) SeekAll(key string)
- type Range
- type Stats
- type T
Examples ¶
Constants ¶
View Source
const EntrySize = 10
EntrySize is the estimated average entry size
View Source
const MinSplitSize = 6 // for builder that will be split 4 and 2
View Source
const TreeHeight = 3
TreeHeight is the estimated average tree height. It is used by Table.lookupCost
Variables ¶
View Source
var Fanout = MaxNodeSize / EntrySize // estimate ~100
GetLeafKey is used to get the key for a data offset. It is a dependency that must be injected
View Source
var MaxNodeSize = 1024
MaxNodeSize is the maximum node size in bytes, split if larger. var rather than const because it is overridden by tests.
Functions ¶
Types ¶
type Iterator ¶
type Iterator struct {
// contains filtered or unexported fields
}
Iterator is a Suneido style iterator with Next/Prev/Rewind
Source Files
Click to show internal directories.
Click to hide internal directories.