memory

Documentation

Index

• Variables
• type BTree
  • func NewTree() *BTree
  • func (t *BTree) Delete(key []byte) error
  • func (t *BTree) Find(key []byte) ([]byte, error)
  • func (t *BTree) Insert(key, value []byte) error
  • func (t *BTree) Print(withPointers bool) error
  • func (t *BTree) PrintLeaves() error
  • func (t *BTree) PrintLeavesBackwards() error
  • func (t *BTree) Update(key, newValue []byte) error
• type BTreeNode
• type Record

Variables

var INVALID_DATA_ERROR = errors.New("Invalid data")

var INVALID_KEY_ERROR = errors.New("Invalid key")

var INVALID_KEY_INDEX_ERROR = errors.New("Invalid key index")

var INVALID_KEY_SIZE_ERROR = errors.New("Invalid key size. All keys must have the same length")

var INVALID_POINTER_INDEX_ERROR = errors.New("Invalid pointer index")

var KEY_ALREADY_EXISTS_ERROR = errors.New("Key already exists")

var KEY_NOT_FOUND_ERROR = errors.New("Key not found")

var KEY_SIZE_TOO_LARGE = errors.New("The key size is too large.")

var TYPE_CONVERSION_ERROR = errors.New("Error while converting interface to type")

Types

type BTree

type BTree struct {
	// contains filtered or unexported fields
}

func NewTree

func NewTree() *BTree

Returns a pointer to a new in-memory B+ tree

func (*BTree) Delete

func (t *BTree) Delete(key []byte) error

Delete an entry from the tree with the given `key`

func (*BTree) Find

func (t *BTree) Find(key []byte) ([]byte, error)

Find the value associated with a key

func (*BTree) Insert

func (t *BTree) Insert(key, value []byte) error

Insert a new key/value into the tree

func (*BTree) Print

func (t *BTree) Print(withPointers bool) error

Print the tree

func (*BTree) PrintLeaves

func (t *BTree) PrintLeaves() error

Print the leaves of the tree

func (*BTree) PrintLeavesBackwards

func (t *BTree) PrintLeavesBackwards() error

Print the leaves of the tree in reverse, i.e. starting from the end to the beginning

func (*BTree) Update

func (t *BTree) Update(key, newValue []byte) error

Update the value of an existing key in the tree

type BTreeNode

type BTreeNode struct {
	Keys     [][]byte
	Numkeys  int
	Pointers []interface{}
	IsLeaf   bool
	Parent   *BTreeNode
	Next     *BTreeNode
	Prev     *BTreeNode
}

type Record

type Record struct {
	Value []byte
}