isucache

Aug 9, 2024

Changes in this version

+ func AllPurge()

+ func New[K comparable, V any](name string, replaceFn func(ctx context.Context, key K) (V, error), ...) (*sc.Cache[K, V], error)

+ type AtomicMap struct

+ func NewAtomicMap[K comparable, V *T, T any](name string) *AtomicMap[K, V, T]

+ func (m *AtomicMap[K, V, T]) Forget(key K)

+ func (m *AtomicMap[K, V, T]) Len() int

+ func (m *AtomicMap[K, V, T]) Load(key K) (V, bool)

+ func (m *AtomicMap[K, V, T]) LoadFromGob(r io.Reader) error

+ func (m *AtomicMap[K, V, T]) LoadOrStore(key K, value V) (V, bool)

+ func (m *AtomicMap[K, V, T]) Purge()

+ func (m *AtomicMap[K, V, T]) Range(f func(K, V) bool)

+ func (m *AtomicMap[K, V, T]) RangeUpdate(f func(K, V) (V, bool))

+ func (m *AtomicMap[K, V, T]) Store(key K, value V)

+ func (m *AtomicMap[K, V, T]) Update(key K, f func(V) (V, bool))

+ func (m *AtomicMap[K, V, T]) WriteToGob(w io.Writer) error

+ type BPTree struct

+ func NewBPTreeWithOrdered[K constraints.Ordered, V any](name string, order int) (*BPTree[K, V], error)

+ func NewBPTreeWithTime[V any](name string, order int) (*BPTree[time.Time, V], error)

+ func NewBPTree[V any, K any](name string, order int, comparator func(K, K) int8) (*BPTree[K, V], error)

+ func (t *BPTree[K, V]) Len() int64

+ func (t *BPTree[K, V]) Load(key K) (V, bool)

+ func (t *BPTree[K, V]) Purge()

+ func (t *BPTree[K, V]) ReverseSlice(start, end K) []V

+ func (t *BPTree[K, V]) Slice(start, end K) []V

+ func (t *BPTree[K, V]) Store(key K, value V)

+ type Map struct

+ func NewMap[K comparable, V any](name string) *Map[K, V]

+ func (m *Map[K, V]) Forget(key K)

+ func (m *Map[K, V]) Len() int

+ func (m *Map[K, V]) Load(key K) (V, bool)

+ func (m *Map[K, V]) LoadFromGob(r io.Reader) error

+ func (m *Map[K, V]) LoadOrStore(key K, value V) (V, bool)

+ func (m *Map[K, V]) Purge()

+ func (m *Map[K, V]) Range(f func(K, V) bool)

+ func (m *Map[K, V]) RangeUpdate(f func(K, V) (V, bool))

+ func (m *Map[K, V]) Store(key K, value V)

+ func (m *Map[K, V]) Update(key K, f func(V) (V, bool))

+ func (m *Map[K, V]) WriteToGob(w io.Writer) error

+ type NoDeleteSlice struct

+ func NewNoDeleteSlice[T any](name string, capacity, shard int) *NoDeleteSlice[T]

+ func (s *NoDeleteSlice[T]) Append(values ...T)

+ func (s *NoDeleteSlice[T]) Cap() int

+ func (s *NoDeleteSlice[T]) Get(i int) (T, bool)

+ func (s *NoDeleteSlice[T]) Len() int

+ func (s *NoDeleteSlice[T]) Purge()

+ func (s *NoDeleteSlice[T]) Range(f func(int, T) bool)

+ func (s *NoDeleteSlice[T]) Set(index int, value T)

+ func (s *NoDeleteSlice[T]) Slice(start, end int) *NoDeleteSlice[T]

+ type Slice struct

+ func NewSlice[T any](name string, size int) *Slice[T]

+ func (s *Slice[T]) Append(values ...T)

+ func (s *Slice[T]) Edit(f func([]T) []T)

+ func (s *Slice[T]) Get(i int) (T, bool)

+ func (s *Slice[T]) Len() int

+ func (s *Slice[T]) LoadFromGob(r io.Reader) error

+ func (s *Slice[T]) Purge()

+ func (s *Slice[T]) Range(f func(int, T) bool)

+ func (s *Slice[T]) Set(index int, value T)

+ func (s *Slice[T]) Slice(start, end int, f func([]T))

+ func (s *Slice[T]) WriteToGob(w io.Writer) error