2020-08-05 03:46:16 +02:00
|
|
|
// Copyright (c) 2020 Shivaram Lingamneni
|
|
|
|
// released under the MIT license
|
|
|
|
|
|
|
|
package utils
|
|
|
|
|
|
|
|
type empty struct{}
|
|
|
|
|
2022-03-30 06:44:51 +02:00
|
|
|
type HashSet[T comparable] map[T]empty
|
2020-08-05 03:46:16 +02:00
|
|
|
|
2022-03-30 06:44:51 +02:00
|
|
|
func (s HashSet[T]) Has(elem T) bool {
|
|
|
|
_, ok := s[elem]
|
2020-08-05 03:46:16 +02:00
|
|
|
return ok
|
|
|
|
}
|
|
|
|
|
2022-03-30 06:44:51 +02:00
|
|
|
func (s HashSet[T]) Add(elem T) {
|
|
|
|
s[elem] = empty{}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s HashSet[T]) Remove(elem T) {
|
|
|
|
delete(s, elem)
|
|
|
|
}
|
|
|
|
|
|
|
|
func CopyMap[K comparable, V any](input map[K]V) (result map[K]V) {
|
|
|
|
result = make(map[K]V, len(input))
|
|
|
|
for key, value := range input {
|
|
|
|
result[key] = value
|
|
|
|
}
|
|
|
|
return
|
2020-08-05 03:46:16 +02:00
|
|
|
}
|