mapset

Documentation

Overview

Credits to: https://github.com/zyedidia/generic Package mapset provides an implementation of a set using the built-in map.

Index

• type Set
  • func New[K comparable]() Set[K]
  • func Of[K comparable](vals ...K) Set[K]
  • func (s Set[K]) Clear()
  • func (s Set[K]) Each(fn func(key K))
  • func (s Set[K]) Has(val K) bool
  • func (s Set[K]) Put(val K)
  • func (s Set[K]) Remove(val K)
  • func (s Set[K]) Size() int

Types

type Set

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

Set implements a hashset, using the hashmap as the underlying storage.

func New

func New[K comparable]() Set[K]

New returns an empty hashset.

func Of

func Of[K comparable](vals ...K) Set[K]

Of returns a new hashset initialized with the given 'vals'

func (Set[K]) Clear

func (s Set[K]) Clear()

Clear removes all elements from the set.

func (Set[K]) Each

func (s Set[K]) Each(fn func(key K))

Each calls 'fn' on every item in the set in no particular order.

func (Set[K]) Has

func (s Set[K]) Has(val K) bool

Has returns true only if 'val' is in the set.

func (Set[K]) Put

func (s Set[K]) Put(val K)

Put adds 'val' to the set.

func (Set[K]) Remove

func (s Set[K]) Remove(val K)

Remove removes 'val' from the set.

func (Set[K]) Size

func (s Set[K]) Size() int

Size returns the number of elements in the set.