set

Documentation

Index

• type HashSet
  • func New[T comparable](elements ...T) HashSet[T]
  • func (s HashSet[T]) Add(element T)
  • func (s HashSet[T]) Contains(element T) bool
  • func (s HashSet[T]) Remove(e T)
  • func (s HashSet[T]) Slice() []T

Types

type HashSet

type HashSet[T comparable] map[T]struct{}

HashSet is unordered set of unique elements. It's built on top of map, so you can iterate over set like over map:

hashSet := containers.NewHashSet[string]()
for element := range hashSet {
	fmt.Println(element)
}

func New

func New[T comparable](elements ...T) HashSet[T]

func (HashSet[T]) Add

func (s HashSet[T]) Add(element T)

Add adds element to the set.

func (HashSet[T]) Contains

func (s HashSet[T]) Contains(element T) bool

Contains checks if element is in the set.

func (HashSet[T]) Remove

func (s HashSet[T]) Remove(e T)

Remove removes element from the set.

func (HashSet[T]) Slice

func (s HashSet[T]) Slice() []T

Slice return elements of the set as slice with the same type. Order of elements is not guaranteed.