Documentation ¶
Index ¶
- type 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
- type TraversalMethod
- type 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(value interface{}) (*Node, bool)
- func (tree *Tree) GetRange(k1, k2 interface{}) (result []interface{})
- func (tree *Tree) Iterator() *Iterator
- func (tree *Tree) Put(value interface{})
- func (tree *Tree) Remove(key interface{}) (interface{}, bool)
- func (tree *Tree) Size() int
- func (tree *Tree) String() string
- func (tree *Tree) Traversal(every func(v interface{}) bool, traversalMethod ...interface{})
- func (tree *Tree) Values() []interface{}
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Iterator ¶
type Iterator struct {
// contains filtered or unexported fields
}
func NewIterator ¶
func NewIteratorWithCap ¶
type TraversalMethod ¶
type TraversalMethod int
const ( //DLR 先值 然后左递归 右递归 下面同理 DLR TraversalMethod //LDR 先从左边有序访问到右边 从小到大 LDR // LRD 同理 LRD // DRL 同理 DRL // RDL 先从右边有序访问到左边 从大到小 RDL // RLD 同理 RLD )
Click to show internal directories.
Click to hide internal directories.