README
¶
gsync
Documentation
¶
Index ¶
- Variables
- func GetZero[T any]() T
- type MapOf
- func (m *MapOf[K, V]) Delete(key K)
- func (m *MapOf[K, V]) Load(key K) (value V, ok bool)
- func (m *MapOf[K, V]) LoadAndDelete(key K) (value V, loaded bool)
- func (m *MapOf[K, V]) LoadOrStore(key K, value V) (actual V, loaded bool)
- func (m *MapOf[K, V]) Range(f func(key K, value V) bool)
- func (m *MapOf[K, V]) Store(key K, value V)
- func (m *MapOf[K, V]) Swap(key K, value V) (previous V, loaded bool)
- type Pool
- type QueueOf
- func (q *QueueOf[T]) Clear()
- func (q *QueueOf[T]) IsEmpty() bool
- func (q *QueueOf[T]) Len() int
- func (q *QueueOf[T]) MustPeek() T
- func (q *QueueOf[T]) MustPeekN(n int) []T
- func (q *QueueOf[T]) MustPop() T
- func (q *QueueOf[T]) MustPopN(n int) []T
- func (q *QueueOf[T]) Peek() (T, error)
- func (q *QueueOf[T]) PeekN(n int) ([]T, error)
- func (q *QueueOf[T]) Pop() (T, error)
- func (q *QueueOf[T]) PopAll() []T
- func (q *QueueOf[T]) PopN(n int) ([]T, error)
- func (q *QueueOf[T]) PopUntil(f func(T) bool) []T
- func (q *QueueOf[T]) PopWhile(f func(T) bool) []T
- func (q *QueueOf[T]) Push(v T)
Constants ¶
This section is empty.
Variables ¶
var ( ErrQueueEmpty = errors.New("queue is empty") ErrQueueLess = errors.New("queue len less than n") )
Functions ¶
Types ¶
type MapOf ¶
type MapOf[K comparable, V any] struct { // contains filtered or unexported fields }
MapOf is like a Go map[interface{}]interface{} but is safe for concurrent use by multiple goroutines without additional locking or coordination. Loads, stores, and deletes run in amortized constant time.
The MapOf type is specialized. Most code should use a plain Go map instead, with separate locking or coordination, for better type safety and to make it easier to maintain other invariants along with the map content.
The MapOf type is optimized for two common use cases: (1) when the entry for a given key is only ever written once but read many times, as in caches that only grow, or (2) when multiple goroutines read, write, and overwrite entries for disjoint sets of keys. In these two cases, use of a MapOf may significantly reduce lock contention compared to a Go map paired with a separate Mutex or RWMutex.
The zero MapOf is empty and ready for use. A MapOf must not be copied after first use.
In the terminology of the Go memory model, MapOf arranges that a write operation “synchronizes before” any read operation that observes the effect of the write, where read and write operations are defined as follows. Load, LoadAndDelete, LoadOrStore, Swap, CompareAndSwap, and CompareAndDelete are read operations; Delete, LoadAndDelete, Store, and Swap are write operations; LoadOrStore is a write operation when it returns loaded set to false; CompareAndSwap is a write operation when it returns swapped set to true; and CompareAndDelete is a write operation when it returns deleted set to true.
func NewMapOf ¶
func NewMapOf[K comparable, V any]() *MapOf[K, V]
func (*MapOf[K, V]) Delete ¶
func (m *MapOf[K, V]) Delete(key K)
Delete deletes the value for a key.
func (*MapOf[K, V]) Load ¶
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 (*MapOf[K, V]) LoadAndDelete ¶
LoadAndDelete deletes the value for a key, returning the previous value if any. The loaded result reports whether the key was present.
func (*MapOf[K, V]) LoadOrStore ¶
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 (*MapOf[K, V]) Range ¶
Range calls f sequentially for each key and value present in the map. If f returns false, range stops the iteration.
Range does not necessarily correspond to any consistent snapshot of the MapOf's contents: no key will be visited more than once, but if the value for any key is stored or deleted concurrently (including by f), Range may reflect any mapping for that key from any point during the Range call. Range does not block other methods on the receiver; even f itself may call any method on m.
Range may be O(N) with the number of elements in the map even if f returns false after a constant number of calls.
Source Files
Directories