set

Documentation

Index

• type Set
  • func New() *Set
  • func (s *Set) Difference(set *Set) *Set
  • func (s *Set) Do(f func(interface{}))
  • func (s *Set) Get(key interface{}) interface{}
  • func (s *Set) GetDigest() (uint64, error)
  • func (s *Set) Has(key interface{}) bool
  • func (s *Set) Insert(key, val interface{})
  • func (s *Set) InsertKey(key interface{})
  • func (s *Set) Intersection(otherSet *Set) *Set
  • func (s *Set) Len() int
  • func (s *Set) ProperSubsetOf(set *Set) bool
  • func (s *Set) Remove(key interface{})
  • func (s *Set) SubsetOf(set *Set) bool
  • func (s *Set) Union(set *Set) *Set

Types

type Set

type Set map[interface{}]interface{}

func New

func New() *Set

Create a new set

func (*Set) Difference

func (s *Set) Difference(set *Set) *Set

Find the difference between two sets (s - set)

func (*Set) Do

func (s *Set) Do(f func(interface{}))

Call f for each item in the set

func (*Set) Get

func (s *Set) Get(key interface{}) interface{}

func (*Set) GetDigest

func (s *Set) GetDigest() (uint64, error)

Digest is the xor sum of the entire set's hash.

func (*Set) Has

func (s *Set) Has(key interface{}) bool

Test to see whether or not the element is in the set

func (*Set) Insert

func (s *Set) Insert(key, val interface{})

Add an element to the set, val can be struct{}

func (*Set) InsertKey

func (s *Set) InsertKey(key interface{})

func (*Set) Intersection

func (s *Set) Intersection(otherSet *Set) *Set

Find the intersection of two sets

func (*Set) Len

func (s *Set) Len() int

Return the number of items in the set

func (*Set) ProperSubsetOf

func (s *Set) ProperSubsetOf(set *Set) bool

Test whether or not this set is a proper subset of "set"

func (*Set) Remove

func (s *Set) Remove(key interface{})

Remove an element from the set

func (*Set) SubsetOf

func (s *Set) SubsetOf(set *Set) bool

Test whether or not this set is a subset of "set"

func (*Set) Union

func (s *Set) Union(set *Set) *Set

Find the union of two sets