Documentation ¶
Index ¶
- type IntMap
- func (u *IntMap[K, V]) Delete(key K)
- func (u *IntMap[K, V]) HasKey(key K) bool
- func (u *IntMap[K, V]) Load(key K) (V, bool)
- func (u *IntMap[K, V]) LoadAndDelete(key K) (v V, loaded bool)
- func (u *IntMap[K, V]) LoadOrStore(key K, val V) (v V, loaded bool)
- func (u *IntMap[K, V]) LoadPtr(key K) *V
- func (u *IntMap[K, V]) LoadPtrAndDelete(key K) (v *V, loaded bool)
- func (u *IntMap[K, V]) LoadPtrOrStore(key K, val V) (v *V, loaded bool)
- func (u *IntMap[K, V]) Range(f func(K, V) bool)
- func (u *IntMap[K, V]) RangePtr(f func(K, *V) bool)
- func (u *IntMap[K, V]) Set(key K, val V) (v *V)
- func (u *IntMap[K, V]) Size() uint
- func (u *IntMap[K, V]) Store(key K, val V)
- func (u *IntMap[K, V]) Take() (key K, val V)
- func (u *IntMap[K, V]) TakePtr() (key K, val *V)
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type IntMap ¶
type IntMap[K comparable, V any] struct { // contains filtered or unexported fields }
IntMap is a specialized version of BucketMap for integers. It avoids all the interface operations.
func (*IntMap[K, V]) LoadAndDelete ¶
func (*IntMap[K, V]) LoadOrStore ¶
func (*IntMap[K, V]) LoadPtrAndDelete ¶
func (*IntMap[K, V]) LoadPtrOrStore ¶
Click to show internal directories.
Click to hide internal directories.