hash

Documentation

Index

• func AllExist[K comparable, V any](m map[K]V, keys ...K) bool
• func Copy[K comparable, V any](m map[K]V) map[K]V
• func Exist[K comparable, V any](m map[K]V, key K) bool
• func KeyToSlice[K comparable, V any](m map[K]V) []K
• func Reversal[K comparable, V comparable](m map[K]V) map[V]K
• func Sum[K comparable, V generic.Number](m map[K]V) V
• func ToJson[K comparable, V any](m map[K]V) string
• func ToMap[V any](slice []V) map[int]V
• func ToMapBool[V comparable](slice []V) map[V]bool
• func ToSlice[K comparable, V any](m map[K]V) []V
• type Consistency
  • func NewConsistency(replicas int) *Consistency
  • func (slf *Consistency) AddNode(keys ...int)
  • func (slf *Consistency) PickNode(key any) int
• type Map
• type MapReadonly
• type SortMap
  • func NewSortMap[K comparable, V any]() *SortMap[K, V]
  • func ToSortMap[V any](slice []V) SortMap[int, V]
  • func (slf *SortMap[K, V]) Del(key K)
  • func (slf *SortMap[K, V]) For(handle func(key K, value V) bool)
  • func (slf *SortMap[K, V]) ForSort(handle func(key K, value V) bool)
  • func (slf *SortMap[K, V]) Get(key K) V
  • func (slf *SortMap[K, V]) KeyToSlice() []K
  • func (slf *SortMap[K, V]) Set(key K, value V)
  • func (slf *SortMap[K, V]) ToMap() map[K]V
  • func (slf *SortMap[K, V]) ToSlice() []V
  • func (slf *SortMap[K, V]) ToSliceSort() []V

Functions

func AllExist

func AllExist[K comparable, V any](m map[K]V, keys ...K) bool

AllExist 检查多个 key 是否存在

func Copy

func Copy[K comparable, V any](m map[K]V) map[K]V

Copy 复制一个map

func Exist

func Exist[K comparable, V any](m map[K]V, key K) bool

Exist 检查特定 key 是否存在

func KeyToSlice

func KeyToSlice[K comparable, V any](m map[K]V) []K

KeyToSlice 将 map 的 key 转换为切片

func Reversal

func Reversal[K comparable, V comparable](m map[K]V) map[V]K

Reversal 将 map 的 key 和 value 互换

func Sum

func Sum[K comparable, V generic.Number](m map[K]V) V

Sum 计算一个 map 中的 value 总和

func ToJson

func ToJson[K comparable, V any](m map[K]V) string

ToJson 将 map 转换为 json 字符串

func ToMap

func ToMap[V any](slice []V) map[int]V

ToMap 将切片转换为 map

func ToMapBool

func ToMapBool[V comparable](slice []V) map[V]bool

ToMapBool 将切片转换为 map，value作为Key

func ToSlice

func ToSlice[K comparable, V any](m map[K]V) []V

ToSlice 将 map 的 value 转换为切片

Types

type Consistency

type Consistency struct {
	// contains filtered or unexported fields
}

Consistency 一致性哈希生成

https://blog.csdn.net/zhpCSDN921011/article/details/126845397

func NewConsistency

func NewConsistency(replicas int) *Consistency

func (*Consistency) AddNode

func (slf *Consistency) AddNode(keys ...int)

AddNode 添加节点

func (*Consistency) PickNode

func (slf *Consistency) PickNode(key any) int

PickNode 获取与 key 最接近的节点

type Map

type Map[Key comparable, Value any] interface {
	Set(key Key, value Value)
	Get(key Key) Value
	// AtomGetSet 原子方式获取一个值并在之后进行赋值
	AtomGetSet(key Key, handle func(value Value, exist bool) (newValue Value, isSet bool))
	// Atom 原子操作
	Atom(handle func(m Map[Key, Value]))
	Exist(key Key) bool
	GetExist(key Key) (Value, bool)
	Delete(key Key)
	DeleteGet(key Key) Value
	DeleteGetExist(key Key) (Value, bool)
	DeleteExist(key Key) bool
	Clear()
	ClearHandle(handle func(key Key, value Value))
	Range(handle func(key Key, value Value))
	RangeSkip(handle func(key Key, value Value) bool)
	RangeBreakout(handle func(key Key, value Value) bool)
	RangeFree(handle func(key Key, value Value, skip func(), breakout func()))
	Keys() []Key
	Slice() []Value
	Map() map[Key]Value
	Size() int
	// GetOne 获取一个
	GetOne() (value Value)
}

Map 提供了map集合接口

type MapReadonly

type MapReadonly[Key comparable, Value any] interface {
	Get(key Key) Value
	Exist(key Key) bool
	GetExist(key Key) (Value, bool)
	Length() int
	Range(handle func(key Key, value Value))
	RangeSkip(handle func(key Key, value Value) bool)
	RangeBreakout(handle func(key Key, value Value) bool)
	RangeFree(handle func(key Key, value Value, skip func(), breakout func()))
	Keys() []Key
	Slice() []Value
	Map() map[Key]Value
	Size() int
	GetOne() (value Value)
}

MapReadonly 只读字典接口

type SortMap

type SortMap[K comparable, V any] struct {
	// contains filtered or unexported fields
}

SortMap 有序的 map 实现

func NewSortMap

func NewSortMap[K comparable, V any]() *SortMap[K, V]

func ToSortMap

func ToSortMap[V any](slice []V) SortMap[int, V]

ToSortMap 将切片转换为 SortMap

func (*SortMap[K, V]) Del

func (slf *SortMap[K, V]) Del(key K)

func (*SortMap[K, V]) For

func (slf *SortMap[K, V]) For(handle func(key K, value V) bool)

func (*SortMap[K, V]) ForSort

func (slf *SortMap[K, V]) ForSort(handle func(key K, value V) bool)

func (*SortMap[K, V]) Get

func (slf *SortMap[K, V]) Get(key K) V

func (*SortMap[K, V]) KeyToSlice

func (slf *SortMap[K, V]) KeyToSlice() []K

func (*SortMap[K, V]) Set

func (slf *SortMap[K, V]) Set(key K, value V)

func (*SortMap[K, V]) ToMap

func (slf *SortMap[K, V]) ToMap() map[K]V

func (*SortMap[K, V]) ToSlice

func (slf *SortMap[K, V]) ToSlice() []V

func (*SortMap[K, V]) ToSliceSort

func (slf *SortMap[K, V]) ToSliceSort() []V