collection

Documentation

Index

• type SafeMap
  • func NewSafeMap[K comparable, V any]() *SafeMap[K, V]
  • func (m *SafeMap[K, V]) Del(key K)
  • func (m *SafeMap[K, V]) Get(key K) (V, bool)
  • func (m *SafeMap[K, V]) Set(key K, value V)
  • func (m *SafeMap[K, V]) Size() int

Types

type SafeMap

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

SafeMap provides a map alternative to avoid memory leak. This implementation is not needed until issue below fixed. https://github.com/golang/go/issues/20135

func NewSafeMap

func NewSafeMap[K comparable, V any]() *SafeMap[K, V]

NewSafeMap returns a SafeMap.

func (*SafeMap[K, V]) Del

func (m *SafeMap[K, V]) Del(key K)

Del deletes the value with the given key from m.

func (*SafeMap[K, V]) Get

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

Get gets the value with the given key from m.

func (*SafeMap[K, V]) Set

func (m *SafeMap[K, V]) Set(key K, value V)

Set sets the value into m with the given key.

func (*SafeMap[K, V]) Size

func (m *SafeMap[K, V]) Size() int

Size returns the size of m.