set

Documentation

Index

• func Apply[K comparable](in []K, f func(K) K) []K
• func Contains[K comparable](in []K, e K) bool
• func Filter[K comparable](in []K, r ...K) []K
• func Map[K comparable](in []K) map[K]bool
• func Sorted[K constraints.Ordered](l []K) []K
• func SortedFiltered[K constraints.Ordered](l []K, want func(K) bool) []K
• func SortedKeys[K constraints.Ordered, V any](m map[K]V) []K
• type Set
  • func New[K constraints.Ordered](elems ...K) Set[K]
  • func (s *Set[K]) Add(elems ...K) bool
  • func (s Set[K]) Choose(f func(K) bool) (K, bool)
  • func (s Set[K]) Clone() Set[K]
  • func (s Set[K]) Contains(e K) bool
  • func (s Set[K]) Count(f func(K) bool) int
  • func (s Set[K]) Difference(s2 Set[K]) Set[K]
  • func (s Set[K]) Discard(elems ...K) bool
  • func (s Set[K]) Each(f func(K))
  • func (s Set[K]) Elements() []K
  • func (s Set[K]) Empty() bool
  • func (s Set[K]) Equals(s2 Set[K]) bool
  • func (s Set[K]) IsSubset(s2 Set[K]) bool
  • func (s Set[K]) Len() int
  • func (s Set[K]) Map(f func(K) K) Set[K]
  • func (s Set[K]) Partition(f func(K) bool) (Set[K], Set[K])
  • func (s Set[K]) Remove(s2 Set[K]) bool
  • func (s Set[K]) Select(f func(K) bool) Set[K]
  • func (s Set[K]) String() string
  • func (s Set[K]) SymmetricDifference(s2 Set[K]) Set[K]
  • func (s Set[K]) Union(s2 Set[K]) Set[K]
  • func (s *Set[K]) Update(s2 Set[K]) bool

Functions

func Apply

func Apply[K comparable](in []K, f func(K) K) []K

Apply applies the given function to every element of the slice.

func Contains

func Contains[K comparable](in []K, e K) bool

Contains returns true if e is contained in the input list.

func Filter

func Filter[K comparable](in []K, r ...K) []K

Filter filters all r's from the input list.

func Map

func Map[K comparable](in []K) map[K]bool

Map takes a slice of a given type and create a boolean map with keys of that type.

func Sorted

func Sorted[K constraints.Ordered](l []K) []K

Sorted returns a sorted set of the input.

func SortedFiltered

func SortedFiltered[K constraints.Ordered](l []K, want func(K) bool) []K

SortedFiltered returns a sorted set of the input, filtered by the predicate.

func SortedKeys

func SortedKeys[K constraints.Ordered, V any](m map[K]V) []K

SortedKeys returns the sorted keys of the map.

Types

type Set

type Set[K constraints.Ordered] map[K]bool

Set is a generic set type.

func New

func New[K constraints.Ordered](elems ...K) Set[K]

New initializes a new Set with the given elements.

func (*Set[K]) Add

func (s *Set[K]) Add(elems ...K) bool

Add adds the given elements to the set.

func (Set[K]) Choose

func (s Set[K]) Choose(f func(K) bool) (K, bool)

Choose returns the first element for which f returns true.

func (Set[K]) Clone

func (s Set[K]) Clone() Set[K]

Clone creates a copy of the set.

func (Set[K]) Contains

func (s Set[K]) Contains(e K) bool

Contains returs true if the set contains the presented element.

func (Set[K]) Count

func (s Set[K]) Count(f func(K) bool) int

Count returns the number of elements for which f returns true.

func (Set[K]) Difference

func (s Set[K]) Difference(s2 Set[K]) Set[K]

Difference returns the set difference. That is all the things that are in s but not in s2. A \ B.

func (Set[K]) Discard

func (s Set[K]) Discard(elems ...K) bool

Discard deletes the given elements from the set.

func (Set[K]) Each

func (s Set[K]) Each(f func(K))

Each applies the function f to all it's elements.

func (Set[K]) Elements

func (s Set[K]) Elements() []K

Elements returns the elements of the set in sorted order.

func (Set[K]) Empty

func (s Set[K]) Empty() bool

Empty returns true if the set is empty.

func (Set[K]) Equals

func (s Set[K]) Equals(s2 Set[K]) bool

Equals returns true if s and s2 contain exactly the same elements.

func (Set[K]) IsSubset

func (s Set[K]) IsSubset(s2 Set[K]) bool

IsSubset returns true if all elements of s are contained in s2.

func (Set[K]) Len

func (s Set[K]) Len() int

Len returns the length of the set.

func (Set[K]) Map

func (s Set[K]) Map(f func(K) K) Set[K]

Map returns a new set by applied the function f to all it's elements.

func (Set[K]) Partition

func (s Set[K]) Partition(f func(K) bool) (Set[K], Set[K])

Partition returns two new sets: the first contains all the elements for which f returns true. The seconds the others.

func (Set[K]) Remove

func (s Set[K]) Remove(s2 Set[K]) bool

Remove deletes the given element from the set.

func (Set[K]) Select

func (s Set[K]) Select(f func(K) bool) Set[K]

Select returns a new set with all the elements for that f returns true.

func (Set[K]) String

func (s Set[K]) String() string

String returns a string representation of the set.

func (Set[K]) SymmetricDifference

func (s Set[K]) SymmetricDifference(s2 Set[K]) Set[K]

SymmetricDifference returns the symmetric difference. That is all the things that are in s or s2 but not in both. A Δ B.

func (Set[K]) Union

func (s Set[K]) Union(s2 Set[K]) Set[K]

Union returns a new set containing all elements from s and s2. A ∪ B.

func (*Set[K]) Update

func (s *Set[K]) Update(s2 Set[K]) bool

Update adds all elements from s2 to the set.