1
0
mirror of https://github.com/jesseduffield/lazygit.git synced 2025-07-05 00:59:19 +02:00
Files
lazygit/vendor/github.com/jesseduffield/generics/set/set.go
2025-05-21 08:51:24 +02:00

47 lines
874 B
Go

package set
import "github.com/jesseduffield/generics/maps"
type Set[T comparable] struct {
hashMap map[T]bool
}
func New[T comparable]() *Set[T] {
return &Set[T]{hashMap: make(map[T]bool)}
}
func NewFromSlice[T comparable](slice []T) *Set[T] {
result := &Set[T]{hashMap: make(map[T]bool, len(slice))}
result.Add(slice...)
return result
}
func (s *Set[T]) Add(values ...T) {
for _, value := range values {
s.hashMap[value] = true
}
}
func (s *Set[T]) Remove(value T) {
delete(s.hashMap, value)
}
func (s *Set[T]) RemoveSlice(slice []T) {
for _, value := range slice {
s.Remove(value)
}
}
func (s *Set[T]) Includes(value T) bool {
return s.hashMap[value]
}
func (s *Set[T]) Len() int {
return len(s.hashMap)
}
// output slice is not necessarily in the same order that items were added
func (s *Set[T]) ToSlice() []T {
return maps.Keys(s.hashMap)
}