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

fix bug

Browse Source
This commit is contained in:
charlie
2022-05-12 10:33:35 +08:00
parent 3dc3fbb0f2
commit 7930a64e59
5 changed files with 43 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
maps/sort_map.go
View File

@ -13,6 +13,7 @@ var (
)
type SortedMap[K constraints.Ordered, V any] interface {
Map[K, V]
Asc() SortedMap[K, V]
Desc() SortedMap[K, V]
}
@ -26,7 +27,7 @@ func NewSortedMap[K constraints.Ordered, V any](maps ...map[K]V) *sorted_map[K,
merged := Merge(maps...)
return &sorted_map[K, V]{
keys: keys(merged),
maps: newHashMap(merged),
maps: NewHashMap(merged),
}
}
@ -35,11 +36,11 @@ func NewSortedByMap[K constraints.Ordered, V any](m Map[K, V]) *sorted_map[K, V]
}
func (m *sorted_map[K, V]) Get(key K) (V, bool) {
return m.Get(key)
return m.maps.Get(key)
}
func (m *sorted_map[K, V]) Set(key K, value V) {
m.Set(key, value)
m.maps.Set(key, value)
m.keys = append(m.keys, key)
}
@ -85,11 +86,15 @@ func (m *sorted_map[K, V]) Iter() <-chan *Entry[K, V] {
}
func (m *sorted_map[K, V]) ForEach(f func(K, V)) {
m.maps.ForEach(f)
for _, k := range m.keys {
if v, ok := m.Get(k); ok {
f(k, v)
}
}
}
func (m *sorted_map[K, V]) Exist(key K) bool {
return m.Exist(key)
return m.maps.Exist(key)
}
func (m *sorted_map[K, V]) Keys() []K {