vbtkey

Mar 4, 2020

Changes in this version

type Iterator

+ func (iter *Iterator) Key() interface{}

Dec 22, 2019

Changes in this version

type Tree

+ func (tree *Tree) IndexNode(idx int) *Node

+ func (tree *Tree) RemoveNode(n *Node)

Jul 28, 2019

Changes in this version

+ type Iterator struct

+ func NewIterator(n *Node) *Iterator

+ func NewIteratorWithCap(n *Node, cap int) *Iterator

+ func (iter *Iterator) GetNext(cur *Node, idx int) *Node

+ func (iter *Iterator) GetNode() *Node

+ func (iter *Iterator) GetPrev(cur *Node, idx int) *Node

+ func (iter *Iterator) Next() (result bool)

+ func (iter *Iterator) Prev() (result bool)

+ func (iter *Iterator) SetNode(n *Node)

+ func (iter *Iterator) ToHead()

+ func (iter *Iterator) ToTail()

+ func (iter *Iterator) Value() interface{}

+ type Node struct

+ func (n *Node) String() string

+ type TraversalMethod int

+ const DLR

+ const DRL

+ const LDR

+ const LRD

+ const RDL

+ const RLD

+ type Tree struct

+ Compare compare.Compare

+ func New(Compare compare.Compare) *Tree

+ func (tree *Tree) Clear()

+ func (tree *Tree) Get(key interface{}) (interface{}, bool)

+ func (tree *Tree) GetAround(key interface{}) (result [3]interface{})

+ func (tree *Tree) GetNode(key interface{}) (*Node, bool)

+ func (tree *Tree) GetRange(k1, k2 interface{}) (result []interface{})

+ func (tree *Tree) Index(idx int) (interface{}, bool)

+ func (tree *Tree) IndexRange(idx1, idx2 int) (result []interface{}, ok bool)

+ func (tree *Tree) Iterator() *Iterator

+ func (tree *Tree) Put(key, value interface{})

+ func (tree *Tree) Remove(key interface{}) (interface{}, bool)

+ func (tree *Tree) RemoveIndex(idx int) (interface{}, bool)

+ func (tree *Tree) Size() int

+ func (tree *Tree) String() string

+ func (tree *Tree) Traversal(every func(k, v interface{}) bool, traversalMethod ...interface{})

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