data-structures: github.com/timtadh/data-structures/tree/bptree Index | Files

package bptree

import "github.com/timtadh/data-structures/tree/bptree"

Index

Package Files

bpmap.go bptree.go bptree_node.go

type BpMap Uses

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 Uses

func NewBpMap(node_size int) *BpMap

func (*BpMap) Get Uses

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

func (*BpMap) Has Uses

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

func (*BpMap) Iterate Uses

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

func (*BpMap) Keys Uses

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

func (*BpMap) Put Uses

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

func (*BpMap) Remove Uses

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

func (*BpMap) Size Uses

func (self *BpMap) Size() int

func (*BpMap) Values Uses

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

type BpNode Uses

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

func NewInternal Uses

func NewInternal(size int) *BpNode

func NewLeaf Uses

func NewLeaf(size int, no_dup bool) *BpNode

func (*BpNode) Full Uses

func (self *BpNode) Full() bool

func (*BpNode) Height Uses

func (self *BpNode) Height() int

func (*BpNode) Internal Uses

func (self *BpNode) Internal() bool

func (*BpNode) NodeSize Uses

func (self *BpNode) NodeSize() int

func (*BpNode) Pure Uses

func (self *BpNode) Pure() bool

type BpTree Uses

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 Uses

func NewBpTree(node_size int) *BpTree

func (*BpTree) Add Uses

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

func (*BpTree) Backward Uses

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

func (*BpTree) Count Uses

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

func (*BpTree) Find Uses

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

func (*BpTree) Has Uses

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

func (*BpTree) Items Uses

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

func (*BpTree) Iterate Uses

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

func (*BpTree) Keys Uses

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

func (*BpTree) Range Uses

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

func (*BpTree) RemoveWhere Uses

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

func (*BpTree) Replace Uses

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

func (*BpTree) Size Uses

func (self *BpTree) Size() int

func (*BpTree) Values Uses

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

Package bptree imports 2 packages (graph). Updated 2016-08-01. Refresh now. Tools for package owners.