safety

Documentation

Index

• func Counter[T constraints.Integer]() func() T
• type Map
  • func NewMap[K comparable, V any]() *Map[K, V]
  • func (m *Map[K, V]) Delete(key K)
  • func (m *Map[K, V]) Flush()
  • func (m *Map[K, V]) Keys() []K
  • func (m *Map[K, V]) Len() int
  • func (m *Map[K, V]) Load(key K) (value V, ok bool)
  • func (m *Map[K, V]) LoadAndDelete(key K) (value V, loaded bool)
  • func (m *Map[K, V]) LoadOrStore(key K, value V) (actual V, loaded bool)
  • func (m *Map[K, V]) Range(f func(key K, value V) bool)
  • func (m *Map[K, V]) Store(key K, value V)
  • func (m *Map[K, V]) Value(key K) (v V)
• type RWMap
  • func NewRWMap[K comparable, V any](val ...map[K]V) *RWMap[K, V]
  • func (v *RWMap[K, V]) Copy() map[K]V
  • func (v *RWMap[K, V]) Delete(keys ...K)
  • func (v *RWMap[K, V]) Len() int
  • func (v *RWMap[K, V]) Load(key K) (V, bool)
  • func (v *RWMap[K, V]) Range(fn func(K, V) bool)
  • func (v *RWMap[K, V]) Set(m map[K]V)
  • func (v *RWMap[K, V]) Store(key K, val V)
• type Slice
  • func NewSlice[T any](a ...[]T) *Slice[T]
  • func (r *Slice[T]) Append(t ...T)
  • func (r *Slice[T]) Load() (a []T)
  • func (r *Slice[T]) Store(a []T)
• type Var
  • func NewVar[T any](vals ...T) *Var[T]
  • func (r *Var[T]) Delete()
  • func (r *Var[T]) Flush()
  • func (r *Var[T]) Load() T
  • func (r *Var[T]) Store(v T)

Functions

func Counter

func Counter[T constraints.Integer]() func() T

Types

type Map

type Map[K comparable, V any] struct {
	// contains filtered or unexported fields
}

Map 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 Map 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 Map 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 Map may significantly reduce lock contention compared to a Go map paired with a separate Mutex or RWMutex.

The zero Map is empty and ready for use. A Map must not be copied after first use.

func NewMap

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

func (*Map[K, V]) Delete

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

Delete deletes the value for a key.

func (*Map[K, V]) Flush

func (m *Map[K, V]) Flush()

func (*Map[K, V]) Keys

func (m *Map[K, V]) Keys() []K

func (*Map[K, V]) Len

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

func (*Map[K, V]) Load

func (m *Map[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 (*Map[K, V]) LoadAndDelete

func (m *Map[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 (*Map[K, V]) LoadOrStore

func (m *Map[K, V]) LoadOrStore(key K, value V) (actual 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 (*Map[K, V]) Range

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

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 Map'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.

func (*Map[K, V]) Store

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

Store sets the value for a key.

func (*Map[K, V]) Value

func (m *Map[K, V]) Value(key K) (v V)

type RWMap

type RWMap[K comparable, V any] struct {
	// contains filtered or unexported fields
}

func NewRWMap

func NewRWMap[K comparable, V any](val ...map[K]V) *RWMap[K, V]

func (*RWMap[K, V]) Copy

func (v *RWMap[K, V]) Copy() map[K]V

func (*RWMap[K, V]) Delete

func (v *RWMap[K, V]) Delete(keys ...K)

func (*RWMap[K, V]) Len

func (v *RWMap[K, V]) Len() int

func (*RWMap[K, V]) Load

func (v *RWMap[K, V]) Load(key K) (V, bool)

func (*RWMap[K, V]) Range

func (v *RWMap[K, V]) Range(fn func(K, V) bool)

func (*RWMap[K, V]) Set

func (v *RWMap[K, V]) Set(m map[K]V)

func (*RWMap[K, V]) Store

func (v *RWMap[K, V]) Store(key K, val V)

type Slice

type Slice[T any] struct {
	Var []T
	// contains filtered or unexported fields
}

func NewSlice

func NewSlice[T any](a ...[]T) *Slice[T]

func (*Slice[T]) Append

func (r *Slice[T]) Append(t ...T)

func (*Slice[T]) Load

func (r *Slice[T]) Load() (a []T)

func (*Slice[T]) Store

func (r *Slice[T]) Store(a []T)

type Var

type Var[T any] struct {
	// contains filtered or unexported fields
}

func NewVar

func NewVar[T any](vals ...T) *Var[T]

func (*Var[T]) Delete

func (r *Var[T]) Delete()

func (*Var[T]) Flush

func (r *Var[T]) Flush()

func (*Var[T]) Load

func (r *Var[T]) Load() T

func (*Var[T]) Store

func (r *Var[T]) Store(v T)