sets

Documentation

Index

• func ChooseSet[T any](start, stopInclusive int, ...) func(propcheck.SimpleRNG) ([]T, propcheck.SimpleRNG)
• func SetEquality[T any](aa []T, bb []T, equality func(l, r T) bool) bool
• func SetIntersection[T any](a []T, b []T, lt, eq func(l, r T) bool) []T
• func SetMinus[T any](a []T, b []T, equality func(l, r T) bool) []T
• func SetUnion[T any](a []T, b []T, lt, eq func(l, r T) bool) []T
• func ToSet[T any](a []T, lt, eq func(l, r T) bool) []T

Functions

func ChooseSet

func ChooseSet[T any](start, stopInclusive int, kind func(pair propcheck.SimpleRNG) (T, propcheck.SimpleRNG), lt func(l, r T) bool, eq func(l, r T) bool) func(propcheck.SimpleRNG) ([]T, propcheck.SimpleRNG)

Generates a set with A size in the indicated range using the given Gen lt - a predicate function that returns true if l is lexically less than r eq - a predicate function that returns true if l is equal to r Note that the returned set may not meet the minimum size requirement after de-duplication. This is impossible to handle in any general way(i.e. the set of bools with cardinality == 3).

func SetEquality

func SetEquality[T any](aa []T, bb []T, equality func(l, r T) bool) bool

The efficiency of this algorithm is O(N)

func SetIntersection

func SetIntersection[T any](a []T, b []T, lt, eq func(l, r T) bool) []T

Returns the intersection of set 'a' and 'b' The efficiency of this algorithm is O(5 * N)

func SetMinus

func SetMinus[T any](a []T, b []T, equality func(l, r T) bool) []T

Returns the set 'a' minus set 'b' The efficiency of this algorithm is O(N)

func SetUnion

func SetUnion[T any](a []T, b []T, lt, eq func(l, r T) bool) []T

Returns the set union of set 'a' and 'b'

func ToSet

func ToSet[T any](a []T, lt, eq func(l, r T) bool) []T

Makes a "real" set from an array. A "real" set is an array without duplicates based upon the given equality predicate. Note the set operations in arrays package do not depend on the array being "real". Making a set is expensive because it requires sorting and de-duplication. lt - a predicate function that returns true if l is lexically less than r eq - a predicate function that returns true if l is equal to r NOTE -- this is not a pure function. It mutates the input array a.