package
Version:
v0.0.0-...-fb30d79
Opens a new window with list of versions in this module.
Published: Apr 1, 2024
License: MIT
Opens a new window with license information.
Imports: 2
Opens a new window with list of imports.
Imported by: 0
Opens a new window with list of known importers.
Documentation
¶
Package redblacktree 提供红黑树实现
-
type Node
-
type Tree
-
func (t *Tree[K, V]) Ceiling(k K) *Node[K, V]
-
func (t *Tree[K, V]) Clear()
-
func (t *Tree[K, V]) Floor(k K) *Node[K, V]
-
func (t *Tree[K, V]) Get(k K) (v V, exist bool)
-
func (t *Tree[K, V]) Iterate(f func(k K, v V) bool)
-
func (t *Tree[K, V]) Keys() (keys []K)
-
func (t *Tree[K, V]) Left() *Node[K, V]
-
func (t *Tree[K, V]) Put(k K, v V)
-
func (t *Tree[K, V]) Right() *Node[K, V]
-
func (t *Tree[K, V]) Set(k K, v V)
-
func (t *Tree[K, V]) Size() int
-
func (t *Tree[K, V]) Values() []V
Tree 表示一个红黑树实现
func (t *Tree[K, V]) Ceiling(k K) *Node[K, V]
Ceiling 获取某个值右边的第一个值, 如果集合为空或者当前值是最大值, 则返回 nil
func (t *Tree[K, V]) Clear()
Clear 清空红黑树
func (t *Tree[K, V]) Floor(k K) *Node[K, V]
Floor 获取某个值左边的第一个值, 如果集合为空或者当前值是最小值, 则返回 nil
func (t *Tree[K, V]) Get(k K) (v V, exist bool)
Get 获取某值
func (t *Tree[K, V]) Iterate(f func(k K, v V) bool)
ITerate 遍历每一个值
func (t *Tree[K, V]) Keys() (keys []K)
Keys 返回所有的 key, 列表为空则返回 nil
Left 返回整个集合的左值, 如果没有则返回 nil
func (t *Tree[K, V]) Put(k K, v V)
Put 设置一个值
func (t *Tree[K, V]) Right() *Node[K, V]
Right 返回整个集合的左值, 如果没有则返回 nil
func (t *Tree[K, V]) Set(k K, v V)
Set 设置一个值
func (t *Tree[K, V]) Values() []V
Values 从低到高返回所有值。如果没有值, 则返回 nil
Source Files
¶
Click to show internal directories.
Click to hide internal directories.
