internal

type Iterator interface {
	Next() Iterator
	Prev() Iterator
	Key() compare.Item
	Value() any
	SetValue(any)
	Delete() Iterator //返回下一个迭代器
}

type Map interface {
	PrintTree()
	PrintTreeIter()
	Store(key compare.Item, val any)
	Load(key compare.Item) (val any, ok bool)
	LoadAndStore(key compare.Item, val any) (old any, ok bool)
	Delete(key compare.Item) (any, bool)
	Clean() map[compare.Item]any
	BeginIterator() Iterator
	EndIterator() Iterator
	Range(func(Iterator) bool)
	Search(key compare.Item) Iterator
	Len() int
}