gtree

package

Go to main page

Versions in this module

v1

v1.8.3

Jul 28, 2019

v1.8.2

Jul 24, 2019

v1.8.1

Jul 23, 2019

v1.8.0

Jul 13, 2019

v1.7.3

Jul 9, 2019

v1.7.2

Jul 4, 2019

v1.7.1

Jul 2, 2019

v1.7.0

Jun 10, 2019

v1.6.17

Jun 4, 2019

v1.6.16

Jun 4, 2019

v1.6.15

May 23, 2019

v1.6.14

May 22, 2019

v1.6.13

May 15, 2019

v1.6.12

May 14, 2019

v1.6.11

May 13, 2019

v1.6.10

May 12, 2019

Changes in this version

type AVLTreeNode

+ func (node *AVLTreeNode) String() string

type BTreeEntry

+ func (entry *BTreeEntry) String() string

type RedBlackTreeNode

+ func (node *RedBlackTreeNode) String() string

v0

v0.0.0

Jul 18, 2019

Changes in this version

+ type AVLTree struct

+ func NewAVLTree(comparator func(v1, v2 interface{}) int, unsafe ...bool) *AVLTree

+ func NewAVLTreeFrom(comparator func(v1, v2 interface{}) int, data map[interface{}]interface{}, ...) *AVLTree

+ func (tree *AVLTree) Ceiling(key interface{}) (ceiling *AVLTreeNode, found bool)

+ func (tree *AVLTree) Clear()

+ func (tree *AVLTree) Clone(unsafe ...bool) *AVLTree

+ func (tree *AVLTree) Contains(key interface{}) bool

+ func (tree *AVLTree) Flip(comparator ...func(v1, v2 interface{}) int)

+ func (tree *AVLTree) Floor(key interface{}) (floor *AVLTreeNode, found bool)

+ func (tree *AVLTree) Get(key interface{}) (value interface{})

+ func (tree *AVLTree) GetOrSet(key interface{}, value interface{}) interface{}

+ func (tree *AVLTree) GetOrSetFunc(key interface{}, f func() interface{}) interface{}

+ func (tree *AVLTree) GetOrSetFuncLock(key interface{}, f func() interface{}) interface{}

+ func (tree *AVLTree) GetVar(key interface{}) *gvar.Var

+ func (tree *AVLTree) GetVarOrSet(key interface{}, value interface{}) *gvar.Var

+ func (tree *AVLTree) GetVarOrSetFunc(key interface{}, f func() interface{}) *gvar.Var

+ func (tree *AVLTree) GetVarOrSetFuncLock(key interface{}, f func() interface{}) *gvar.Var

+ func (tree *AVLTree) IsEmpty() bool

+ func (tree *AVLTree) Iterator(f func(key, value interface{}) bool)

+ func (tree *AVLTree) IteratorAsc(f func(key, value interface{}) bool)

+ func (tree *AVLTree) IteratorDesc(f func(key, value interface{}) bool)

+ func (tree *AVLTree) Keys() []interface{}

+ func (tree *AVLTree) Left() *AVLTreeNode

+ func (tree *AVLTree) Map() map[interface{}]interface{}

+ func (tree *AVLTree) MarshalJSON() ([]byte, error)

+ func (tree *AVLTree) Print()

+ func (tree *AVLTree) Remove(key interface{}) (value interface{})

+ func (tree *AVLTree) Removes(keys []interface{})

+ func (tree *AVLTree) Right() *AVLTreeNode

+ func (tree *AVLTree) Search(key interface{}) (value interface{}, found bool)

+ func (tree *AVLTree) Set(key interface{}, value interface{})

+ func (tree *AVLTree) SetIfNotExist(key interface{}, value interface{}) bool

+ func (tree *AVLTree) SetIfNotExistFunc(key interface{}, f func() interface{}) bool

+ func (tree *AVLTree) SetIfNotExistFuncLock(key interface{}, f func() interface{}) bool

+ func (tree *AVLTree) Sets(data map[interface{}]interface{})

+ func (tree *AVLTree) Size() int

+ func (tree *AVLTree) String() string

+ func (tree *AVLTree) Values() []interface{}

+ type AVLTreeNode struct

+ Key interface{}

+ Value interface{}

+ func (node *AVLTreeNode) Next() *AVLTreeNode

+ func (node *AVLTreeNode) Prev() *AVLTreeNode

+ type BTree struct

+ func NewBTree(m int, comparator func(v1, v2 interface{}) int, unsafe ...bool) *BTree

+ func NewBTreeFrom(m int, comparator func(v1, v2 interface{}) int, ...) *BTree

+ func (tree *BTree) Clear()

+ func (tree *BTree) Clone(unsafe ...bool) *BTree

+ func (tree *BTree) Contains(key interface{}) bool

+ func (tree *BTree) Get(key interface{}) (value interface{})

+ func (tree *BTree) GetOrSet(key interface{}, value interface{}) interface{}

+ func (tree *BTree) GetOrSetFunc(key interface{}, f func() interface{}) interface{}

+ func (tree *BTree) GetOrSetFuncLock(key interface{}, f func() interface{}) interface{}

+ func (tree *BTree) GetVar(key interface{}) *gvar.Var

+ func (tree *BTree) GetVarOrSet(key interface{}, value interface{}) *gvar.Var

+ func (tree *BTree) GetVarOrSetFunc(key interface{}, f func() interface{}) *gvar.Var

+ func (tree *BTree) GetVarOrSetFuncLock(key interface{}, f func() interface{}) *gvar.Var

+ func (tree *BTree) Height() int

+ func (tree *BTree) IsEmpty() bool

+ func (tree *BTree) Iterator(f func(key, value interface{}) bool)

+ func (tree *BTree) IteratorAsc(f func(key, value interface{}) bool)

+ func (tree *BTree) IteratorDesc(f func(key, value interface{}) bool)

+ func (tree *BTree) Keys() []interface{}

+ func (tree *BTree) Left() *BTreeEntry

+ func (tree *BTree) Map() map[interface{}]interface{}

+ func (tree *BTree) MarshalJSON() ([]byte, error)

+ func (tree *BTree) Print()

+ func (tree *BTree) Remove(key interface{}) (value interface{})

+ func (tree *BTree) Removes(keys []interface{})

+ func (tree *BTree) Right() *BTreeEntry

+ func (tree *BTree) Search(key interface{}) (value interface{}, found bool)

+ func (tree *BTree) Set(key interface{}, value interface{})

+ func (tree *BTree) SetIfNotExist(key interface{}, value interface{}) bool

+ func (tree *BTree) SetIfNotExistFunc(key interface{}, f func() interface{}) bool

+ func (tree *BTree) SetIfNotExistFuncLock(key interface{}, f func() interface{}) bool

+ func (tree *BTree) Sets(data map[interface{}]interface{})

+ func (tree *BTree) Size() int

+ func (tree *BTree) String() string

+ func (tree *BTree) Values() []interface{}

+ type BTreeEntry struct

+ Key interface{}

+ Value interface{}

+ type BTreeNode struct

+ Children []*BTreeNode

+ Entries []*BTreeEntry

+ Parent *BTreeNode

+ type RedBlackTree struct

+ func NewRedBlackTree(comparator func(v1, v2 interface{}) int, unsafe ...bool) *RedBlackTree

+ func NewRedBlackTreeFrom(comparator func(v1, v2 interface{}) int, data map[interface{}]interface{}, ...) *RedBlackTree

+ func (tree *RedBlackTree) Ceiling(key interface{}) (ceiling *RedBlackTreeNode, found bool)

+ func (tree *RedBlackTree) Clear()

+ func (tree *RedBlackTree) Clone(unsafe ...bool) *RedBlackTree

+ func (tree *RedBlackTree) Contains(key interface{}) bool

+ func (tree *RedBlackTree) Flip(comparator ...func(v1, v2 interface{}) int)

+ func (tree *RedBlackTree) Floor(key interface{}) (floor *RedBlackTreeNode, found bool)

+ func (tree *RedBlackTree) Get(key interface{}) (value interface{})

+ func (tree *RedBlackTree) GetOrSet(key interface{}, value interface{}) interface{}

+ func (tree *RedBlackTree) GetOrSetFunc(key interface{}, f func() interface{}) interface{}

+ func (tree *RedBlackTree) GetOrSetFuncLock(key interface{}, f func() interface{}) interface{}

+ func (tree *RedBlackTree) GetVar(key interface{}) *gvar.Var

+ func (tree *RedBlackTree) GetVarOrSet(key interface{}, value interface{}) *gvar.Var

+ func (tree *RedBlackTree) GetVarOrSetFunc(key interface{}, f func() interface{}) *gvar.Var

+ func (tree *RedBlackTree) GetVarOrSetFuncLock(key interface{}, f func() interface{}) *gvar.Var

+ func (tree *RedBlackTree) IsEmpty() bool

+ func (tree *RedBlackTree) Iterator(f func(key, value interface{}) bool)

+ func (tree *RedBlackTree) IteratorAsc(f func(key, value interface{}) bool)

+ func (tree *RedBlackTree) IteratorDesc(f func(key, value interface{}) bool)

+ func (tree *RedBlackTree) Keys() []interface{}

+ func (tree *RedBlackTree) Left() *RedBlackTreeNode

+ func (tree *RedBlackTree) Map() map[interface{}]interface{}

+ func (tree *RedBlackTree) MarshalJSON() ([]byte, error)

+ func (tree *RedBlackTree) Print()

+ func (tree *RedBlackTree) Remove(key interface{}) (value interface{})

+ func (tree *RedBlackTree) Removes(keys []interface{})

+ func (tree *RedBlackTree) Right() *RedBlackTreeNode

+ func (tree *RedBlackTree) Search(key interface{}) (value interface{}, found bool)

+ func (tree *RedBlackTree) Set(key interface{}, value interface{})

+ func (tree *RedBlackTree) SetIfNotExist(key interface{}, value interface{}) bool

+ func (tree *RedBlackTree) SetIfNotExistFunc(key interface{}, f func() interface{}) bool

+ func (tree *RedBlackTree) SetIfNotExistFuncLock(key interface{}, f func() interface{}) bool

+ func (tree *RedBlackTree) Sets(data map[interface{}]interface{})

+ func (tree *RedBlackTree) Size() int

+ func (tree *RedBlackTree) String() string

+ func (tree *RedBlackTree) Values() []interface{}

+ type RedBlackTreeNode struct

+ Key interface{}

+ Value interface{}

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