Skip to content

Commit

Permalink
init
Browse files Browse the repository at this point in the history
  • Loading branch information
OS-M committed Mar 13, 2023
1 parent 21edb52 commit 891fadb
Show file tree
Hide file tree
Showing 2 changed files with 67 additions and 0 deletions.
3 changes: 3 additions & 0 deletions go.mod
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
module typed-sync-map-go

go 1.19
64 changes: 64 additions & 0 deletions pkg/map.go
Original file line number Diff line number Diff line change
@@ -0,0 +1,64 @@
package pkg

import "sync"

type SyncMap[K comparable, V any] struct {
sync.Map
}

// 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 (m *SyncMap[K, V]) Load(key K) (val V, ok bool) {
res, ok := m.Map.Load(key)
if res != nil {
val = res.(V)
}
return val, ok
}

// Store sets the value for a key.
func (m *SyncMap[K, V]) Store(key K, value V) {
m.Map.Store(key, value)
}

// Delete deletes the value for a key.
func (m *SyncMap[K, V]) Delete(key K) {
m.Map.Delete(key)
}

// LoadAndDelete deletes the value for a key, returning the previous value if any.
// The loaded result reports whether the key was present.
func (m *SyncMap[K, V]) LoadAndDelete(key K) (val V, ok bool) {
res, ok := m.Map.LoadAndDelete(key)
if res != nil {
val = res.(V)
}
return val, ok
}

// 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 (m *SyncMap[K, V]) Range(f func(key K, value V) bool) {
m.Map.Range(func(key, value any) bool { return f(key.(K), value.(V)) })
}

// 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 (m *SyncMap[K, V]) LoadOrStore(key K, value V) (actual V, loaded bool) {
act, loaded := m.Map.LoadOrStore(key, value)
if act != nil {
actual = act.(V)
}
return actual, loaded
}

0 comments on commit 891fadb

Please sign in to comment.