bptree

Documentation

Index

• type BpMap
  • func NewBpMap(node_size int) *BpMap
  • func (self *BpMap) Get(key types.Hashable) (value interface{}, err error)
  • func (self *BpMap) Has(key types.Hashable) bool
  • func (self *BpMap) Iterate() (kvi types.KVIterator)
  • func (self *BpMap) Keys() (ki types.KIterator)
  • func (self *BpMap) Put(key types.Hashable, value interface{}) (err error)
  • func (self *BpMap) Remove(key types.Hashable) (value interface{}, err error)
  • func (self *BpMap) Size() int
  • func (self *BpMap) Values() (vi types.Iterator)
• type BpNode
  • func NewInternal(size int) *BpNode
  • func NewLeaf(size int, no_dup bool) *BpNode
  • func (self *BpNode) Full() bool
  • func (self *BpNode) Height() int
  • func (self *BpNode) Internal() bool
  • func (self *BpNode) NodeSize() int
  • func (self *BpNode) Pure() bool
• type BpTree
  • func NewBpTree(node_size int) *BpTree
  • func (self *BpTree) Add(key types.Hashable, value interface{}) (err error)
  • func (self *BpTree) Backward() (kvi types.KVIterator)
  • func (self *BpTree) Count(key types.Hashable) int
  • func (self *BpTree) Find(key types.Hashable) (kvi types.KVIterator)
  • func (self *BpTree) Has(key types.Hashable) bool
  • func (self *BpTree) Items() (vi types.KIterator)
  • func (self *BpTree) Iterate() (kvi types.KVIterator)
  • func (self *BpTree) Keys() (ki types.KIterator)
  • func (self *BpTree) Range(from, to types.Hashable) (kvi types.KVIterator)
  • func (self *BpTree) RemoveWhere(key types.Hashable, where types.WhereFunc) (err error)
  • func (self *BpTree) Replace(key types.Hashable, where types.WhereFunc, value interface{}) (err error)
  • func (self *BpTree) Size() int
  • func (self *BpTree) Values() (vi types.Iterator)

Types

type BpMap

type BpMap BpTree

A BpMap is a B+Tree with support for duplicate keys disabled. This makes it * behave like a regular Map rather than a MultiMap.

func NewBpMap

func NewBpMap(node_size int) *BpMap

func (*BpMap) Get

func (self *BpMap) Get(key types.Hashable) (value interface{}, err error)

func (*BpMap) Has

func (self *BpMap) Has(key types.Hashable) bool

func (*BpMap) Iterate

func (self *BpMap) Iterate() (kvi types.KVIterator)

func (*BpMap) Keys

func (self *BpMap) Keys() (ki types.KIterator)

func (*BpMap) Put

func (self *BpMap) Put(key types.Hashable, value interface{}) (err error)

func (*BpMap) Remove

func (self *BpMap) Remove(key types.Hashable) (value interface{}, err error)

func (*BpMap) Size

func (self *BpMap) Size() int

func (*BpMap) Values

func (self *BpMap) Values() (vi types.Iterator)

type BpNode

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

func NewInternal

func NewInternal(size int) *BpNode

func NewLeaf

func NewLeaf(size int, no_dup bool) *BpNode

func (*BpNode) Full

func (self *BpNode) Full() bool

func (*BpNode) Height

func (self *BpNode) Height() int

func (*BpNode) Internal

func (self *BpNode) Internal() bool

func (*BpNode) NodeSize

func (self *BpNode) NodeSize() int

func (*BpNode) Pure

func (self *BpNode) Pure() bool

type BpTree

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

A BpTree is a B+Tree with support for duplicate keys. This makes it behave as * a MultiMap. Additionally you can use the Range operator to select k/v in a * range. If from > to it will iterate backwards.

func NewBpTree

func NewBpTree(node_size int) *BpTree

func (*BpTree) Add

func (self *BpTree) Add(key types.Hashable, value interface{}) (err error)

func (*BpTree) Backward

func (self *BpTree) Backward() (kvi types.KVIterator)

func (*BpTree) Count

func (self *BpTree) Count(key types.Hashable) int

func (*BpTree) Find

func (self *BpTree) Find(key types.Hashable) (kvi types.KVIterator)

func (*BpTree) Has

func (self *BpTree) Has(key types.Hashable) bool

func (*BpTree) Items

func (self *BpTree) Items() (vi types.KIterator)

func (*BpTree) Iterate

func (self *BpTree) Iterate() (kvi types.KVIterator)

func (*BpTree) Keys

func (self *BpTree) Keys() (ki types.KIterator)

func (*BpTree) Range

func (self *BpTree) Range(from, to types.Hashable) (kvi types.KVIterator)

func (*BpTree) RemoveWhere

func (self *BpTree) RemoveWhere(key types.Hashable, where types.WhereFunc) (err error)

func (*BpTree) Replace

func (self *BpTree) Replace(key types.Hashable, where types.WhereFunc, value interface{}) (err error)

func (*BpTree) Size

func (self *BpTree) Size() int

func (*BpTree) Values

func (self *BpTree) Values() (vi types.Iterator)