zset

Documentation

Index

• type HashSet
  • func NewHashSet[T any, K comparable](hash Hasher[T, K], vals ...T) *HashSet[T, K]
  • func NewHashSetUnion[T any, K comparable](sets ...HashSet[T, K]) (s *HashSet[T, K])
  • func (s *HashSet[T, K]) Add(items ...T) *HashSet[T, K]
  • func (s *HashSet[T, K]) Clear() *HashSet[T, K]
  • func (s *HashSet[T, K]) Clone() *HashSet[T, K]
  • func (s *HashSet[T, K]) Complement(others ...HashSet[T, K]) *HashSet[T, K]
  • func (s HashSet[T, K]) Contains(item T) bool
  • func (s HashSet[T, K]) ContainsAll(items ...T) bool
  • func (s HashSet[T, K]) ContainsAny(items ...T) bool
  • func (s *HashSet[T, K]) Delete(items ...T)
  • func (s *HashSet[T, K]) Equal(other HashSet[T, K]) bool
  • func (s *HashSet[T, K]) Intersection(others ...HashSet[T, K]) *HashSet[T, K]
  • func (s *HashSet[T, K]) Items() (res []T)
  • func (s *HashSet[T, K]) Size() int
  • func (s *HashSet[T, K]) Union(others ...HashSet[T, K]) *HashSet[T, K]
• type Hasher
• type Set
  • func New[T comparable](vals ...T) *Set[T]
  • func NewUnion[T comparable](sets ...Set[T]) (s *Set[T])
  • func (s *Set[T]) Add(items ...T) *Set[T]
  • func (s *Set[T]) Clear() *Set[T]
  • func (s *Set[T]) Clone() *Set[T]
  • func (s *Set[T]) Complement(others ...Set[T]) *Set[T]
  • func (s Set[T]) Contains(item T) bool
  • func (s Set[T]) ContainsAll(items ...T) bool
  • func (s Set[T]) ContainsAny(items ...T) bool
  • func (s *Set[T]) Delete(items ...T) *Set[T]
  • func (s *Set[T]) Equal(other Set[T]) bool
  • func (s *Set[T]) Intersection(others ...Set[T]) *Set[T]
  • func (s *Set[T]) Items() (res []T)
  • func (s *Set[T]) Size() int
  • func (s *Set[T]) Union(others ...Set[T]) *Set[T]

Types

type HashSet

type HashSet[T any, K comparable] struct {
	// contains filtered or unexported fields
}

func NewHashSet

func NewHashSet[T any, K comparable](hash Hasher[T, K], vals ...T) *HashSet[T, K]

func NewHashSetUnion

func NewHashSetUnion[T any, K comparable](sets ...HashSet[T, K]) (s *HashSet[T, K])

Create a new set that is the union of all provided sets

func (*HashSet[T, K]) Add

func (s *HashSet[T, K]) Add(items ...T) *HashSet[T, K]

func (*HashSet[T, K]) Clear

func (s *HashSet[T, K]) Clear() *HashSet[T, K]

func (*HashSet[T, K]) Clone

func (s *HashSet[T, K]) Clone() *HashSet[T, K]

func (*HashSet[T, K]) Complement

func (s *HashSet[T, K]) Complement(others ...HashSet[T, K]) *HashSet[T, K]

func (HashSet[T, K]) Contains

func (s HashSet[T, K]) Contains(item T) bool

func (HashSet[T, K]) ContainsAll

func (s HashSet[T, K]) ContainsAll(items ...T) bool

func (HashSet[T, K]) ContainsAny

func (s HashSet[T, K]) ContainsAny(items ...T) bool

func (*HashSet[T, K]) Delete

func (s *HashSet[T, K]) Delete(items ...T)

func (*HashSet[T, K]) Equal

func (s *HashSet[T, K]) Equal(other HashSet[T, K]) bool

Two sets are considered equal if they contain exactly the same elements.

func (*HashSet[T, K]) Intersection

func (s *HashSet[T, K]) Intersection(others ...HashSet[T, K]) *HashSet[T, K]

Intersection will reduce this set to the items that are present in this set and the other sets

func (*HashSet[T, K]) Items

func (s *HashSet[T, K]) Items() (res []T)

func (*HashSet[T, K]) Size

func (s *HashSet[T, K]) Size() int

func (*HashSet[T, K]) Union

func (s *HashSet[T, K]) Union(others ...HashSet[T, K]) *HashSet[T, K]

type Hasher

type Hasher[T any, K comparable] func(T) K

type Set

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

func New

func New[T comparable](vals ...T) *Set[T]

func NewUnion

func NewUnion[T comparable](sets ...Set[T]) (s *Set[T])

Create a new set that is the union of all provided sets

func (*Set[T]) Add

func (s *Set[T]) Add(items ...T) *Set[T]

func (*Set[T]) Clear

func (s *Set[T]) Clear() *Set[T]

func (*Set[T]) Clone

func (s *Set[T]) Clone() *Set[T]

Clone will create a new set with the same items as this set. This

func (*Set[T]) Complement

func (s *Set[T]) Complement(others ...Set[T]) *Set[T]

Complement will remove all items from this set that are present in the other sets. This mutates the set.

func (Set[T]) Contains

func (s Set[T]) Contains(item T) bool

func (Set[T]) ContainsAll

func (s Set[T]) ContainsAll(items ...T) bool

func (Set[T]) ContainsAny

func (s Set[T]) ContainsAny(items ...T) bool

func (*Set[T]) Delete

func (s *Set[T]) Delete(items ...T) *Set[T]

func (*Set[T]) Equal

func (s *Set[T]) Equal(other Set[T]) bool

Two sets are considered equal if they contain exactly the same elements.

func (*Set[T]) Intersection

func (s *Set[T]) Intersection(others ...Set[T]) *Set[T]

Intersection will reduce this set to the items that are present in this set and the other sets. This mutates the set.

func (*Set[T]) Items

func (s *Set[T]) Items() (res []T)

func (*Set[T]) Size

func (s *Set[T]) Size() int

func (*Set[T]) Union

func (s *Set[T]) Union(others ...Set[T]) *Set[T]

Union will add all items from the other sets to this set. This mutates the set.