-
Notifications
You must be signed in to change notification settings - Fork 61
/
map.go
45 lines (38 loc) · 1.17 KB
/
map.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
// SPDX-License-Identifier: AGPL-3.0-only
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published
// by the Free Software Foundation, version 3.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
// See the GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>
package gmap
// Keys return []key of map, random ordered.
func Keys[M ~map[K]V, K comparable, V any](m M) []K {
var s = make([]K, 0, len(m))
for k := range m {
s = append(s, k)
}
return s
}
func Values[M map[K]V, K comparable, V any](m M) []V {
var s = make([]V, 0, len(m))
for _, v := range m {
s = append(s, v)
}
return s
}
func Copy[M1 ~map[K]V, M2 ~map[K]V, K comparable, V any](dst M1, src M2) {
for k, v := range src {
dst[k] = v
}
}
func Has[M ~map[K]V, K comparable, V any](m M, key K) bool {
_, ok := m[key]
return ok
}