Versions in this module Expand all Collapse all v1 v1.0.4 Jun 30, 2023 v1.0.3 Jun 13, 2023 Changes in this version + var ErrBeginTxFailed = errors.New("BeginTxFailedError : failed to begin tx in bptree") + var ErrCreateBucketFailed = errors.New("CreateBucketFailedError : failed to create bucket in bptree") + var ErrDeleteValueFailed = errors.New("DeleteValueFailedError : failed to delete value in bptree") + var ErrGetIndexSizeFailed = errors.New("GetIndexSizeFailedError : failed to get index size in bptree") + var ErrGetValueFailed = errors.New("GetValueFailedError : failed to get value in bptree") + var ErrOpenBPTreeFailed = errors.New("OpenBPTreeFailedError : failed to open bptree") + var ErrPutValueFailed = errors.New("PutValueFailedError : failed to put value in bptree") + var ErrRollbackTxFailed = errors.New("RollbackTxFailedError : failed to rollback tx in bptree") + type ARTreeIterator struct + func (artree *ARTreeIterator) Close() + func (artree *ARTreeIterator) Key() []byte + func (artree *ARTreeIterator) Next() + func (artree *ARTreeIterator) Rewind() + func (artree *ARTreeIterator) Seek(key []byte) + func (artree *ARTreeIterator) Valid() bool + func (artree *ARTreeIterator) Value() *data.LogRecordPst + type AdaptiveRadixTree struct + func NewART() *AdaptiveRadixTree + func (artree *AdaptiveRadixTree) Delete(key []byte) bool + func (artree *AdaptiveRadixTree) Get(key []byte) *data.LogRecordPst + func (artree *AdaptiveRadixTree) Iterator(reverse bool) Iterator + func (artree *AdaptiveRadixTree) Put(key []byte, pst *data.LogRecordPst) bool + func (artree *AdaptiveRadixTree) Size() int + type BPlusTree struct + func NewBPlusTree(dirPath string) *BPlusTree + func (bptree *BPlusTree) Delete(key []byte) bool + func (bptree *BPlusTree) Get(key []byte) *data.LogRecordPst + func (bptree *BPlusTree) Iterator(reverse bool) Iterator + func (bptree *BPlusTree) Put(key []byte, pst *data.LogRecordPst) bool + func (bptree *BPlusTree) Size() int + type BTree struct + func NewBTree() *BTree + func (bt *BTree) Delete(key []byte) bool + func (bt *BTree) Get(key []byte) *data.LogRecordPst + func (bt *BTree) Iterator(reverse bool) Iterator + func (bt *BTree) Put(key []byte, pst *data.LogRecordPst) bool + func (bt *BTree) Size() int + type BtreeIterator struct + func NewARTreeIterator(tree art.Tree, reverse bool) *BtreeIterator + func NewBTreeIterator(tree *btree.BTree, reverse bool) *BtreeIterator + func (bi *BtreeIterator) Close() + func (bi *BtreeIterator) Key() []byte + func (bi *BtreeIterator) Next() + func (bi *BtreeIterator) Rewind() + func (bi *BtreeIterator) Seek(key []byte) + func (bi *BtreeIterator) Valid() bool + func (bi *BtreeIterator) Value() *data.LogRecordPst + type IndexType = int8 + const ART + const Btree + type Indexer interface + Delete func(key []byte) bool + Get func(key []byte) *data.LogRecordPst + Iterator func(reverse bool) Iterator + Put func(key []byte, pst *data.LogRecordPst) bool + Size func() int + func NewIndexer(typeIndex IndexType, dirPath string) Indexer + type Item struct + func (i *Item) Less(bi btree.Item) bool + type Iterator interface + Close func() + Key func() []byte + Next func() + Rewind func() + Seek func(key []byte) + Valid func() bool + Value func() *data.LogRecordPst
Go to main page