forked from kaytu-io/kaytu
-
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.
Merge branch 'kaytu-io:main' into main
- Loading branch information
Showing
7 changed files
with
141 additions
and
81 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
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
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
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
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,57 @@ | ||
| package utils | ||
|
|
||
| import ( | ||
| "sync" | ||
| ) | ||
|
|
||
| type ConcurrentMap[K comparable, V any] struct { | ||
| data sync.Map | ||
| } | ||
|
|
||
| func NewConcurrentMap[K comparable, V any]() ConcurrentMap[K, V] { | ||
| return ConcurrentMap[K, V]{ | ||
| data: sync.Map{}, | ||
| } | ||
| } | ||
|
|
||
| func (cm *ConcurrentMap[K, V]) Set(key K, value V) { | ||
| cm.data.Store(key, value) | ||
| } | ||
|
|
||
| func (cm *ConcurrentMap[K, V]) Delete(key K) { | ||
| cm.data.Delete(key) | ||
| } | ||
|
|
||
| func (cm *ConcurrentMap[K, V]) Get(key K) (V, bool) { | ||
| v, ok := cm.data.Load(key) | ||
| if !ok { | ||
| return *new(V), false | ||
| } | ||
| return v.(V), true | ||
| } | ||
|
|
||
| func (cm *ConcurrentMap[K, V]) Range(f func(key K, value V) bool) { | ||
| cm.data.Range(func(key, value any) bool { | ||
| return f(key.(K), value.(V)) | ||
| }) | ||
| } | ||
|
|
||
| func (cm *ConcurrentMap[K, V]) CompareAndSwap(key K, old, new V) bool { | ||
| return cm.data.CompareAndSwap(key, old, new) | ||
| } | ||
|
|
||
| func (cm *ConcurrentMap[K, V]) CompareAndDelete(key K, value V) bool { | ||
| return cm.data.CompareAndDelete(key, value) | ||
| } | ||
|
|
||
| func (cm *ConcurrentMap[K, V]) LoadOrStore(key K, value V) (actual V, loaded bool) { | ||
| v, loaded := cm.data.LoadOrStore(key, value) | ||
| actual = v.(V) | ||
| return actual, loaded | ||
| } | ||
|
|
||
| func (cm *ConcurrentMap[K, V]) LoadAndDelete(key K) (value V, loaded bool) { | ||
| v, loaded := cm.data.LoadAndDelete(key) | ||
| value = v.(V) | ||
| return value, loaded | ||
| } |
Oops, something went wrong.