-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
67 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
module typed-sync-map-go | ||
|
||
go 1.19 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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 | ||
} |