sets

type OrderSet[E comparable] struct {
	// contains filtered or unexported fields
}

type SeenSet[E comparable] struct {
	// contains filtered or unexported fields
}

type Set[E comparable] interface {
	// Insert adds an element to the set. Returns false and nil if the
	// element is already in the set.
	//
	// Parameters:
	//   - elem: The element to add.
	//
	// Returns:
	//   - bool: True if the element was added, false if the element
	//   - error: An error if the element could not be added.
	//
	// Errors:
	//   - ErrFullSet: If the set is full.
	//   - common.ErrNilReceiver: If the receiver is nil.
	//   - any other error: Implementation-dependent.
	Insert(elem E) (bool, error)

	// Contains checks if the set contains the element.
	//
	// Parameters:
	//   - elem: The element to check.
	//
	// Returns:
	//   - bool: True if the set contains the element, false otherwise.
	Contains(elem E) bool

	// IsEmpty checks if the set is empty.
	//
	// Returns:
	//   - bool: True if the set is empty, false otherwise.
	IsEmpty() bool

	// IsFull checks if the set is full.
	//
	// Returns:
	//   - bool: True if the set is full, false otherwise.
	IsFull() bool

	// All returns a sequence of all elements in the set. The order of
	// the elements is undefined.
	//
	// Returns:
	//   - iter.Seq[E]: A sequence of all elements in the set. Never
	//     returns nil.
	All() iter.Seq[E]

	// Reset clears the set for reuse.
	//
	// Returns:
	//   - error: An error if the set could not be reset.
	//
	// Errors:
	//   - common.ErrNilReceiver: If the receiver is nil.
	//   - any other error: Implementation-dependent.
	Reset() error
}

type SortSet[E cmp.Ordered] struct {
	// contains filtered or unexported fields
}