go/go-mixed
1
0
Fork 0
mirror of https://github.com/charlienet/go-mixed.git synced 2025-07-18 00:22:41 +08:00
Code Issues Projects Releases Wiki Activity

maps

Browse Source
This commit is contained in:
charlie
2022-05-12 09:35:20 +08:00
parent ffaf129ddb
commit 6731e53d7c
6 changed files with 126 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
maps/hash_map.go
View File

@ -12,8 +12,8 @@ func NewHashMap[K constraints.Ordered, V any]() *hashMap[K, V] {
return &hashMap[K, V]{m: make(map[K]V)}
}
func newHashMap[K constraints.Ordered, V any](m map[K]V) *hashMap[K, V] {
return &hashMap[K, V]{m: m}
func newHashMap[K constraints.Ordered, V any](maps ...map[K]V) *hashMap[K, V] {
return &hashMap[K, V]{m: Merge(maps...)}
}
func (m *hashMap[K, V]) Set(key K, value V) {
@ -56,6 +56,33 @@ func (m *hashMap[K, V]) ForEach(f func(K, V)) {
}
}
func (m *hashMap[K, V]) Keys() []K {
keys := make([]K, 0, m.Count())
for k := range m.m {
keys = append(keys, k)
}
return keys
}
func (m *hashMap[K, V]) Values() []V {
values := make([]V, 0, m.Count())
for _, v := range m.m {
values = append(values, v)
}
return values
}
func (m *hashMap[K, V]) ToMap() map[K]V {
mm := make(map[K]V, m.Count())
for k, v := range m.m {
mm[k] = v
}
return mm
}
func (m *hashMap[K, V]) Clear() {
m.m = make(map[K]V)
}