README
¶
RBTree
Red/Black tree on-disk implementation with go
Documentation
¶
Index ¶
- Constants
- Variables
- type DummyVal
- type Entry
- type EntryItem
- type Options
- type RBTree
- func (tree *RBTree[K, V]) Close() error
- func (tree *RBTree[K, V]) Count() int
- func (tree *RBTree[K, V]) Delete(key K) error
- func (tree *RBTree[K, V]) DeleteMem(key K) error
- func (tree *RBTree[K, V]) Get(key K) (*Entry[K, V], error)
- func (tree *RBTree[K, V]) Insert(e *Entry[K, V]) error
- func (tree *RBTree[K, V]) InsertMem(e *Entry[K, V]) error
- func (tree *RBTree[K, V]) Print(count int) error
- func (tree *RBTree[K, V]) Remove()
- func (tree *RBTree[K, V]) Scan(key K, scanFn func(key K, val V) (bool, error)) error
- func (tree *RBTree[K, V]) WriteAll() error
Constants ¶
View Source
const ( FV_COLOR_BLACK flagVaue = 0b00000000 FV_COLOR_RED flagVaue = 0b00000001 )
View Source
const (
FT_COLOR flagType = 0
)
Variables ¶
View Source
var ErrInvalidKeySize = errors.New("invalid key size")
View Source
var ErrInvalidPointer = errors.New("invalid pointer")
View Source
var ErrKeyAlreadyExists = errors.New("key already exists")
View Source
var ErrNilPtr = errors.New("nil pointer")
View Source
var ErrNodeFetch = errors.New("failed to fetch node")
View Source
var ErrNotFound = errors.New("not found")
Functions ¶
This section is empty.
Types ¶
type DummyVal ¶
type DummyVal struct{}
func (*DummyVal) MarshalBinary ¶
func (*DummyVal) UnmarshalBinary ¶
type Entry ¶
type Entry[K, V EntryItem] struct { Key K Val V }
func (*Entry[K, V]) MarshalBinary ¶
func (*Entry[K, V]) UnmarshalBinary ¶
type EntryItem ¶
type EntryItem interface {
New() EntryItem
Copy() EntryItem
Size() int
IsNil() bool
encoding.BinaryMarshaler
encoding.BinaryUnmarshaler
}
Source Files
¶
Directories
Click to show internal directories.
Click to hide internal directories.