set

type CartesianElement[T, U comparable] struct {
	First  T
	Second U
}

type MutableSet[T comparable] interface {
	Set[T]
	// Modify by adding elements
	Add(elements ...T)
	// Modify by removing elements
	Remove(elements ...T)
	// Modify to Difference between sets
	ToDifference(rhs Set[T])
	// Modify to Union of sets
	ToUnion(rhs Set[T])
	// Modify to Intersection of sets
	ToIntersection(rhs Set[T])
	// Modify to Complement the set
	ToComplement()
}

type Set[T comparable] interface {
	fmt.Stringer
	patterns.Iteratable[T]
	// Set is empty
	IsEmpty() bool
	// Length of set
	Len() int
	// Elements as a slice
	Elements() []T
	// Equals another set (ignore universal)
	Equals(rhs Set[T]) bool
	// Hash code
	Hash() uint64
	// Operate on each element
	Foreach(action func(element T))
	// Does set contain element
	Contains(element T) bool
	// Is subset
	IsSubsetOf(rhs Set[T]) bool
	IsProperSubsetOf(rhs Set[T]) bool
	// Is superset
	IsSupersetOf(rhs Set[T]) bool
	IsProperSupersetOf(rhs Set[T]) bool
	// Add elements
	Plus(elements ...T) Set[T]
	// Remove elements
	Minus(elements ...T) Set[T]
	// Difference between sets
	Difference(rhs Set[T]) Set[T]
	// Union of sets
	Union(rhs Set[T]) Set[T]
	// Intersection of sets
	Intersection(rhs Set[T]) Set[T]
	// Complement the set
	Complement() Set[T]
	// The universal set
	UniversalSet() Set[T]
	// Create a mutable set from this
	CreateMutableSet(increaseCapacity uint) MutableSet[T]
	// contains filtered or unexported methods
}