datastructure

type Queue[ITEM any] struct {
	// contains filtered or unexported fields
}

type QueueInterface[ITEM any] interface {
	WithMax(max int) QueueInterface[ITEM]
	Enqueue(item ITEM) error
	Dequeue() (ITEM, error)
	IsEmpty() bool
	IsFull() bool
	Front() (ITEM, error)
	Items() []ITEM
}

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

type SetInterface[E comparable] interface {
	// Added list element to set.
	Add(values ...E)

	// To check is element is exists on set.
	IsExists(value E) bool

	// Delete list element of set.
	Del(values ...E)

	// Convert set to slice. Maybe you need it for interation.
	Slice() []E

	// Clear list element from set.
	Clear()

	// Check is set is empty. Return true is empty and false is not empty.
	IsEmpty() bool

	// Get size of element on set.
	Size() int

	// Delete element from set if condition is matched.
	DelIf(condition func(value E) bool) SetInterface[E]

	// Filter elements of set. Will return new set with filtered elements.
	Filter(condition func(value E) bool) SetInterface[E]

	// Find first element in set that matches condition or return error with code `github.com/irdaislakhuafa/go-sdk/codes.CodeNotFound`.
	Find(condition func(value E) bool) (E, error)
}