containers

Mar 11, 2024

Changes in this version

+ type SyncMap struct

+ func (m *SyncMap[K, V]) CompareAndDelete(key K, old V) (deleted bool)

+ func (m *SyncMap[K, V]) CompareAndSwap(key K, old, newValue V) bool

+ func (m *SyncMap[K, V]) Delete(key K)

+ func (m *SyncMap[K, V]) Load(key K) (value V, ok bool)

+ func (m *SyncMap[K, V]) LoadAndDelete(key K) (value V, loaded bool)

+ func (m *SyncMap[K, V]) LoadOrStore(key K, value V) (actual V, loaded bool)

+ func (m *SyncMap[K, V]) Range(f func(key K, value V) bool)

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

+ func (m *SyncMap[K, V]) Swap(key K, value V) (previous V, loaded bool)

Sep 17, 2023

Changes in this version

type BiMap

+ func (m *BiMap[K, V]) FilterInPlace(f func(K, V) bool)

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

type ConcurrentMap

+ func (m *ConcurrentMap[K, V]) FilterInPlace(f func(K, V) bool)

type LazyBiMap

+ func (m *LazyBiMap[K, V]) FilterInPlace(f func(K, V) bool)

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

type LazyMap

+ func (m *LazyMap[K, V]) FilterInPlace(f func(K, V) bool)

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

Apr 24, 2023

Changes in this version

type BiMap

+ func (m *BiMap[K, V]) Clear()

+ func (m *BiMap[K, V]) ForEach(f func(K, V))

+ func (m *BiMap[K, V]) GetInverse(val V) (K, bool)

+ func (m *BiMap[K, V]) Remove(key K)

+ func (m *BiMap[K, V]) RemoveInverse(val V)

type LazyBiMap

+ func (m *LazyBiMap[K, V]) Clear()

+ func (m *LazyBiMap[K, V]) ForEach(f func(K, V))

+ func (m *LazyBiMap[K, V]) GetInverse(value V) (K, bool)

+ func (m *LazyBiMap[K, V]) Remove(key K)

+ func (m *LazyBiMap[K, V]) RemoveInverse(value V)

type LazyMap

+ func (m *LazyMap[K, V]) Clear()

+ func (m *LazyMap[K, V]) ForEach(f func(K, V))

Dec 1, 2022

Changes in this version

type ConcurrentMap

+ func (m *ConcurrentMap[K, V]) GetOrCall(key K, fn func() V) (V, bool)

+ func (m *ConcurrentMap[K, V]) GetOrCreate(key K, val V) (V, bool)

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

+ func (m *ConcurrentMap[K, V]) RemoveAndGet(key K) (V, bool)

+ func (m *ConcurrentMap[K, V]) Reset()

Sep 21, 2022

Changes in this version

+ type BiMap struct

+ func (m *BiMap[K, V]) Get(key K) (V, bool)

+ func (m *BiMap[K, V]) Set(key K, val V)

+ type ConcurrentMap struct

+ func (m *ConcurrentMap[K, V]) Clear()

+ func (m *ConcurrentMap[K, V]) ForEach(f func(K, V))

+ func (m *ConcurrentMap[K, V]) Get(key K) (V, bool)

+ func (m *ConcurrentMap[K, V]) Remove(key K)

+ func (m *ConcurrentMap[K, V]) Set(key K, val V)

+ type LazyBiMap struct

+ Creator func(K) (V, error)

+ func (m *LazyBiMap[K, V]) Get(key K) (V, bool)

+ func (m *LazyBiMap[K, V]) GetOrCreate(key K) (V, error)

+ type LazyMap struct

+ Creator func(K) (V, error)

+ func (m *LazyMap[K, V]) Get(key K) (V, bool)

+ func (m *LazyMap[K, V]) GetOrCreate(key K) (V, error)

+ func (m *LazyMap[K, V]) Remove(key K)