Documentation
¶
Overview ¶
Package sync provides basic synchronization primitives such as mutual exclusion locks to internal packages (including ones that depend on sync).
Tests are defined in package sync.
Index ¶
- type HashTrieMap
- func (ht *HashTrieMap[K, V]) All() func(yield func(K, V) bool)
- func (ht *HashTrieMap[K, V]) Clear()
- func (ht *HashTrieMap[K, V]) CompareAndDelete(key K, old V) (deleted bool)
- func (ht *HashTrieMap[K, V]) CompareAndSwap(key K, old, new V) (swapped bool)
- func (ht *HashTrieMap[K, V]) Delete(key K)
- func (ht *HashTrieMap[K, V]) Load(key K) (value V, ok bool)
- func (ht *HashTrieMap[K, V]) LoadAndDelete(key K) (value V, loaded bool)
- func (ht *HashTrieMap[K, V]) LoadOrStore(key K, value V) (result V, loaded bool)
- func (ht *HashTrieMap[K, V]) Range(yield func(K, V) bool)
- func (ht *HashTrieMap[K, V]) Store(key K, old V)
- func (ht *HashTrieMap[K, V]) Swap(key K, new V) (previous V, loaded bool)
- type Mutex
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type HashTrieMap ¶
type HashTrieMap[K comparable, V any] struct { // contains filtered or unexported fields }
HashTrieMap is an implementation of a concurrent hash-trie. The implementation is designed around frequent loads, but offers decent performance for stores and deletes as well, especially if the map is larger. Its primary use-case is the unique package, but can be used elsewhere as well.
The zero HashTrieMap is empty and ready to use. It must not be copied after first use.
func (*HashTrieMap[K, V]) All ¶
func (ht *HashTrieMap[K, V]) All() func(yield func(K, V) bool)
All returns an iterator over each key and value present in the map.
The iterator does not necessarily correspond to any consistent snapshot of the HashTrieMap's contents: no key will be visited more than once, but if the value for any key is stored or deleted concurrently (including by yield), the iterator may reflect any mapping for that key from any point during iteration. The iterator does not block other methods on the receiver; even yield itself may call any method on the HashTrieMap.
func (*HashTrieMap[K, V]) Clear ¶
func (ht *HashTrieMap[K, V]) Clear()
Clear deletes all the entries, resulting in an empty HashTrieMap.
func (*HashTrieMap[K, V]) CompareAndDelete ¶
func (ht *HashTrieMap[K, V]) CompareAndDelete(key K, old V) (deleted bool)
CompareAndDelete deletes the entry for key if its value is equal to old. The value type must be comparable, otherwise this CompareAndDelete will panic.
If there is no current value for key in the map, CompareAndDelete returns false (even if the old value is the nil interface value).
func (*HashTrieMap[K, V]) CompareAndSwap ¶
func (ht *HashTrieMap[K, V]) CompareAndSwap(key K, old, new V) (swapped bool)
CompareAndSwap swaps the old and new values for key if the value stored in the map is equal to old. The value type must be of a comparable type, otherwise CompareAndSwap will panic.
func (*HashTrieMap[K, V]) Delete ¶
func (ht *HashTrieMap[K, V]) Delete(key K)
Delete deletes the value for a key.
func (*HashTrieMap[K, V]) Load ¶
func (ht *HashTrieMap[K, V]) Load(key K) (value V, ok bool)
Load returns the value stored in the map for a key, or nil if no value is present. The ok result indicates whether value was found in the map.
func (*HashTrieMap[K, V]) LoadAndDelete ¶
func (ht *HashTrieMap[K, V]) LoadAndDelete(key K) (value V, loaded bool)
LoadAndDelete deletes the value for a key, returning the previous value if any. The loaded result reports whether the key was present.
func (*HashTrieMap[K, V]) LoadOrStore ¶
func (ht *HashTrieMap[K, V]) LoadOrStore(key K, value V) (result V, loaded bool)
LoadOrStore returns the existing value for the key if present. Otherwise, it stores and returns the given value. The loaded result is true if the value was loaded, false if stored.
func (*HashTrieMap[K, V]) Range ¶
func (ht *HashTrieMap[K, V]) Range(yield func(K, V) bool)
Range calls f sequentially for each key and value present in the map. If f returns false, range stops the iteration.
This exists for compatibility with sync.Map; All should be preferred. It provides the same guarantees as sync.Map, and All.
func (*HashTrieMap[K, V]) Store ¶
func (ht *HashTrieMap[K, V]) Store(key K, old V)
Store sets the value for a key.
func (*HashTrieMap[K, V]) Swap ¶
func (ht *HashTrieMap[K, V]) Swap(key K, new V) (previous V, loaded bool)
Swap swaps the value for a key and returns the previous value if any. The loaded result reports whether the key was present.
type Mutex ¶
type Mutex struct {
// contains filtered or unexported fields
}
A Mutex is a mutual exclusion lock.
See package sync.Mutex documentation.
func (*Mutex) TryLock ¶
TryLock tries to lock m and reports whether it succeeded.
See package sync.Mutex documentation.
func (*Mutex) Unlock ¶
func (m *Mutex) Unlock()
Unlock unlocks m.
See package sync.Mutex documentation.
Source Files