rbtree

Documentation

Index

• Constants
• Variables
• type InsertOrUpdateCb
• type RBTree
  • func New[K constraints.Ordered, V any]() *RBTree[K, V]
  • func (r *RBTree[K, V]) Delete(k K)
  • func (r *RBTree[K, V]) First() (v V, ok bool)
  • func (r *RBTree[K, V]) Get(k K) (v V)
  • func (r *RBTree[K, V]) InsertOrUpdate(k K, v V, cb InsertOrUpdateCb[V])
  • func (r *RBTree[K, V]) Last() (v V, ok bool)
  • func (r *RBTree[K, V]) Len() int
  • func (a *RBTree[K, V]) Range(callback func(k K, v V) bool)
  • func (r *RBTree[K, V]) RangePrev(callback func(k K, v V) bool)
  • func (r *RBTree[K, V]) Set(k K, v V)
  • func (r *RBTree[K, V]) Swap(k K, v V) (prev V, replaced bool)
  • func (r *RBTree[K, V]) TopMax(limit int, callback func(k K, v V) bool)
  • func (r *RBTree[K, V]) TopMin(limit int, callback func(k K, v V) bool)
  • func (r *RBTree[K, V]) TryGet(k K) (v V, ok bool)

Constants

const (
	RED   color = 1
	BLACK color = 2
)

Variables

var ErrNotFound = errors.New("rbtree: not found value")

Types

type InsertOrUpdateCb

type InsertOrUpdateCb[V any] func(prev V, new V) V

type RBTree

type RBTree[K constraints.Ordered, V any] struct {
	// contains filtered or unexported fields
}

红黑树

func New

func New[K constraints.Ordered, V any]() *RBTree[K, V]

初始化函数

func (*RBTree[K, V]) Delete

func (r *RBTree[K, V]) Delete(k K)

func (*RBTree[K, V]) First

func (r *RBTree[K, V]) First() (v V, ok bool)

第一个节点

func (*RBTree[K, V]) Get

func (r *RBTree[K, V]) Get(k K) (v V)

Get

func (*RBTree[K, V]) InsertOrUpdate

func (r *RBTree[K, V]) InsertOrUpdate(k K, v V, cb InsertOrUpdateCb[V])

InsertOrUpdate inserts or updates an element in the RBTree

func (*RBTree[K, V]) Last

func (r *RBTree[K, V]) Last() (v V, ok bool)

最后一个节点

func (*RBTree[K, V]) Len

func (r *RBTree[K, V]) Len() int

func (*RBTree[K, V]) Range

func (a *RBTree[K, V]) Range(callback func(k K, v V) bool)

遍历rbtree

func (*RBTree[K, V]) RangePrev

func (r *RBTree[K, V]) RangePrev(callback func(k K, v V) bool)

遍历rbtree

func (*RBTree[K, V]) Set

func (r *RBTree[K, V]) Set(k K, v V)

func (*RBTree[K, V]) Swap

func (r *RBTree[K, V]) Swap(k K, v V) (prev V, replaced bool)

设置

func (*RBTree[K, V]) TopMax

func (r *RBTree[K, V]) TopMax(limit int, callback func(k K, v V) bool)

func (*RBTree[K, V]) TopMin

func (r *RBTree[K, V]) TopMin(limit int, callback func(k K, v V) bool)

func (*RBTree[K, V]) TryGet

func (r *RBTree[K, V]) TryGet(k K) (v V, ok bool)

从rbtree 找到需要的值