Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Delete ¶
type Delete[K constraints.Key, V any] interface { Delete(key K) }
type Get ¶
type Get[K constraints.Key, V any] interface { Get(key K) V }
type KeyNode ¶ added in v1.6.13
type KeyNode[K comparable, T any] struct { Next *KeyNode[K, T] Key K Value T }
type LinkedKeyNode ¶ added in v1.6.13
type LinkedKeyNode[K comparable, T any] struct { Prev, Next *LinkedKeyNode[K, T] Key K Value T }
type LinkedNode ¶ added in v1.6.13
type LinkedNode[T any] struct { Prev, Next *LinkedNode[T] Value T }
type LinkedOrderedKeyNode ¶ added in v1.6.13
type LinkedOrderedKeyNode[K constraints.Ordered, T any] struct { Prev, Next *LinkedOrderedKeyNode[K, T] Key K Value T }
type OrderedKeyNode ¶ added in v1.6.13
type OrderedKeyNode[K constraints.Ordered, T any] struct { Next *OrderedKeyNode[K, T] Key K Value T }
type Set ¶
type Set[K constraints.Key, V any] interface { Set(key K, v V) }
type SetWithExpire ¶
type SetWithExpire[K constraints.Key, V any] interface { SetWithExpire(key K, v V, expire time.Duration) }
type StoreWithExpire ¶
type StoreWithExpire[K constraints.Key, V any] interface { SetWithExpire[K, V] Get[K, V] Delete[K, V] }
Directories
¶
| Path | Synopsis |
|---|---|
|
cache
|
|
|
Package consistenthash provides an implementation of a ring hash.
|
Package consistenthash provides an implementation of a ring hash. |
|
tree
|
|
Click to show internal directories.
Click to hide internal directories.