avl

package
Version: v0.5.3 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Jan 29, 2019 License: BSD-3-Clause, GPL-2.0 Imports: 3 Imported by: 3

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type AvlNode

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

func (*AvlNode) ChildCount

func (self *AvlNode) ChildCount() int

func (*AvlNode) Children

func (self *AvlNode) Children() types.TreeNodeIterator

func (*AvlNode) Get

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

func (*AvlNode) GetChild

func (self *AvlNode) GetChild(i int) types.TreeNode

func (*AvlNode) Has

func (self *AvlNode) Has(key types.Hashable) (has bool)

func (*AvlNode) Height

func (self *AvlNode) Height() int

func (*AvlNode) Iterate

func (self *AvlNode) Iterate() types.KVIterator

func (*AvlNode) Key

func (self *AvlNode) Key() types.Hashable

func (*AvlNode) Keys

func (self *AvlNode) Keys() types.KIterator

func (*AvlNode) Left

func (self *AvlNode) Left() types.BinaryTreeNode

func (*AvlNode) Put

func (self *AvlNode) Put(key types.Hashable, value interface{}) (_ *AvlNode, updated bool)

func (*AvlNode) Remove

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

func (*AvlNode) Right

func (self *AvlNode) Right() types.BinaryTreeNode

func (*AvlNode) Size

func (self *AvlNode) Size() int

func (*AvlNode) Value

func (self *AvlNode) Value() interface{}

func (*AvlNode) Values

func (self *AvlNode) Values() types.Iterator

type AvlTree

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

func NewAvlTree

func NewAvlTree() *AvlTree

func (*AvlTree) Get

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

func (*AvlTree) Has

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

func (*AvlTree) Items

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

func (*AvlTree) Iterate

func (self *AvlTree) Iterate() types.KVIterator

func (*AvlTree) Keys

func (self *AvlTree) Keys() types.KIterator

func (*AvlTree) Put

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

func (*AvlTree) Remove

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

func (*AvlTree) Root

func (self *AvlTree) Root() types.TreeNode

func (*AvlTree) Size

func (self *AvlTree) Size() int

func (*AvlTree) Values

func (self *AvlTree) Values() types.Iterator

type ImmutableAvlNode

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

func (*ImmutableAvlNode) ChildCount

func (self *ImmutableAvlNode) ChildCount() int

func (*ImmutableAvlNode) Children

func (self *ImmutableAvlNode) Children() types.TreeNodeIterator

func (*ImmutableAvlNode) Copy

func (self *ImmutableAvlNode) Copy() *ImmutableAvlNode

func (*ImmutableAvlNode) Get

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

func (*ImmutableAvlNode) GetChild

func (self *ImmutableAvlNode) GetChild(i int) types.TreeNode

func (*ImmutableAvlNode) Has

func (self *ImmutableAvlNode) Has(key types.Hashable) (has bool)

func (*ImmutableAvlNode) Height

func (self *ImmutableAvlNode) Height() int

func (*ImmutableAvlNode) Iterate

func (self *ImmutableAvlNode) Iterate() types.KVIterator

func (*ImmutableAvlNode) Key

func (self *ImmutableAvlNode) Key() types.Hashable

func (*ImmutableAvlNode) Keys

func (self *ImmutableAvlNode) Keys() types.KIterator

func (*ImmutableAvlNode) Left

func (self *ImmutableAvlNode) Left() types.BinaryTreeNode

func (*ImmutableAvlNode) Put

func (self *ImmutableAvlNode) Put(key types.Hashable, value interface{}) (_ *ImmutableAvlNode, updated bool)

func (*ImmutableAvlNode) Remove

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

func (*ImmutableAvlNode) Right

func (self *ImmutableAvlNode) Right() types.BinaryTreeNode

func (*ImmutableAvlNode) Size

func (self *ImmutableAvlNode) Size() int

func (*ImmutableAvlNode) Value

func (self *ImmutableAvlNode) Value() interface{}

func (*ImmutableAvlNode) Values

func (self *ImmutableAvlNode) Values() types.Iterator

type ImmutableAvlTree

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

func NewImmutableAvlTree

func NewImmutableAvlTree() *ImmutableAvlTree

func (*ImmutableAvlTree) Get

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

func (*ImmutableAvlTree) Has

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

func (*ImmutableAvlTree) Items

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

func (*ImmutableAvlTree) Iterate

func (self *ImmutableAvlTree) Iterate() types.KVIterator

func (*ImmutableAvlTree) Keys

func (self *ImmutableAvlTree) Keys() types.KIterator

func (*ImmutableAvlTree) Put

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

func (*ImmutableAvlTree) Remove

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

func (*ImmutableAvlTree) Root

func (self *ImmutableAvlTree) Root() types.TreeNode

func (*ImmutableAvlTree) Size

func (self *ImmutableAvlTree) Size() int

func (*ImmutableAvlTree) Values

func (self *ImmutableAvlTree) Values() types.Iterator

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL