sets

package module
Version: v0.2.0 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Aug 8, 2021 License: Apache-2.0 Imports: 2 Imported by: 16

README

PkgGoDev

sets

This library has been forked from https://github.com/kubernetes/apimachinery/tree/v0.18.3/pkg/util/sets so that it can easily used in non-k8s related projects.

Generate set types

set-gen \
  --input-dirs=gomodules.xyz/sets/types \
  --output-package=gomodules.xyz/sets

Documentation

Overview

Package sets has auto-generated set types.

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type Byte

type Byte map[byte]Empty

sets.Byte is a set of bytes, implemented via map[byte]struct{} for minimal memory consumption.

func ByteKeySet

func ByteKeySet(theMap interface{}) Byte

ByteKeySet creates a Byte from a keys of a map[byte](? extends interface{}). If the value passed in is not actually a map, this will panic.

func NewByte

func NewByte(items ...byte) Byte

NewByte creates a Byte from a list of values.

func (Byte) Delete

func (s Byte) Delete(items ...byte) Byte

Delete removes all items from the set.

func (Byte) Difference

func (s Byte) Difference(s2 Byte) Byte

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Byte) Equal

func (s1 Byte) Equal(s2 Byte) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Byte) Has

func (s Byte) Has(item byte) bool

Has returns true if and only if item is contained in the set.

func (Byte) HasAll

func (s Byte) HasAll(items ...byte) bool

HasAll returns true if and only if all items are contained in the set.

func (Byte) HasAny

func (s Byte) HasAny(items ...byte) bool

HasAny returns true if any items are contained in the set.

func (Byte) Insert

func (s Byte) Insert(items ...byte) Byte

Insert adds items to the set.

func (Byte) Intersection

func (s1 Byte) Intersection(s2 Byte) Byte

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Byte) IsSuperset

func (s1 Byte) IsSuperset(s2 Byte) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Byte) Len

func (s Byte) Len() int

Len returns the size of the set.

func (Byte) List

func (s Byte) List() []byte

List returns the contents as a sorted byte slice.

func (Byte) PopAny

func (s Byte) PopAny() (byte, bool)

Returns a single element from the set.

func (Byte) Union

func (s1 Byte) Union(s2 Byte) Byte

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Byte) UnsortedList

func (s Byte) UnsortedList() []byte

UnsortedList returns the slice with contents in random order.

type Empty

type Empty struct{}

Empty is public since it is used by some internal API objects for conversions between external string arrays and internal sets, and conversion logic requires public types today.

type Float32

type Float32 map[float32]Empty

sets.Float32 is a set of float32s, implemented via map[float32]struct{} for minimal memory consumption.

func Float32KeySet

func Float32KeySet(theMap interface{}) Float32

Float32KeySet creates a Float32 from a keys of a map[float32](? extends interface{}). If the value passed in is not actually a map, this will panic.

func NewFloat32

func NewFloat32(items ...float32) Float32

NewFloat32 creates a Float32 from a list of values.

func (Float32) Delete

func (s Float32) Delete(items ...float32) Float32

Delete removes all items from the set.

func (Float32) Difference

func (s Float32) Difference(s2 Float32) Float32

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Float32) Equal

func (s1 Float32) Equal(s2 Float32) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Float32) Has

func (s Float32) Has(item float32) bool

Has returns true if and only if item is contained in the set.

func (Float32) HasAll

func (s Float32) HasAll(items ...float32) bool

HasAll returns true if and only if all items are contained in the set.

func (Float32) HasAny

func (s Float32) HasAny(items ...float32) bool

HasAny returns true if any items are contained in the set.

func (Float32) Insert

func (s Float32) Insert(items ...float32) Float32

Insert adds items to the set.

func (Float32) Intersection

func (s1 Float32) Intersection(s2 Float32) Float32

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Float32) IsSuperset

func (s1 Float32) IsSuperset(s2 Float32) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Float32) Len

func (s Float32) Len() int

Len returns the size of the set.

func (Float32) List

func (s Float32) List() []float32

List returns the contents as a sorted float32 slice.

func (Float32) PopAny

func (s Float32) PopAny() (float32, bool)

Returns a single element from the set.

func (Float32) Union

func (s1 Float32) Union(s2 Float32) Float32

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Float32) UnsortedList

func (s Float32) UnsortedList() []float32

UnsortedList returns the slice with contents in random order.

type Float64

type Float64 map[float64]Empty

sets.Float64 is a set of float64s, implemented via map[float64]struct{} for minimal memory consumption.

func Float64KeySet

func Float64KeySet(theMap interface{}) Float64

Float64KeySet creates a Float64 from a keys of a map[float64](? extends interface{}). If the value passed in is not actually a map, this will panic.

func NewFloat64

func NewFloat64(items ...float64) Float64

NewFloat64 creates a Float64 from a list of values.

func (Float64) Delete

func (s Float64) Delete(items ...float64) Float64

Delete removes all items from the set.

func (Float64) Difference

func (s Float64) Difference(s2 Float64) Float64

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Float64) Equal

func (s1 Float64) Equal(s2 Float64) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Float64) Has

func (s Float64) Has(item float64) bool

Has returns true if and only if item is contained in the set.

func (Float64) HasAll

func (s Float64) HasAll(items ...float64) bool

HasAll returns true if and only if all items are contained in the set.

func (Float64) HasAny

func (s Float64) HasAny(items ...float64) bool

HasAny returns true if any items are contained in the set.

func (Float64) Insert

func (s Float64) Insert(items ...float64) Float64

Insert adds items to the set.

func (Float64) Intersection

func (s1 Float64) Intersection(s2 Float64) Float64

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Float64) IsSuperset

func (s1 Float64) IsSuperset(s2 Float64) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Float64) Len

func (s Float64) Len() int

Len returns the size of the set.

func (Float64) List

func (s Float64) List() []float64

List returns the contents as a sorted float64 slice.

func (Float64) PopAny

func (s Float64) PopAny() (float64, bool)

Returns a single element from the set.

func (Float64) Union

func (s1 Float64) Union(s2 Float64) Float64

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Float64) UnsortedList

func (s Float64) UnsortedList() []float64

UnsortedList returns the slice with contents in random order.

type Int

type Int map[int]Empty

sets.Int is a set of ints, implemented via map[int]struct{} for minimal memory consumption.

func IntKeySet

func IntKeySet(theMap interface{}) Int

IntKeySet creates a Int from a keys of a map[int](? extends interface{}). If the value passed in is not actually a map, this will panic.

func NewInt

func NewInt(items ...int) Int

NewInt creates a Int from a list of values.

func (Int) Delete

func (s Int) Delete(items ...int) Int

Delete removes all items from the set.

func (Int) Difference

func (s Int) Difference(s2 Int) Int

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Int) Equal

func (s1 Int) Equal(s2 Int) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Int) Has

func (s Int) Has(item int) bool

Has returns true if and only if item is contained in the set.

func (Int) HasAll

func (s Int) HasAll(items ...int) bool

HasAll returns true if and only if all items are contained in the set.

func (Int) HasAny

func (s Int) HasAny(items ...int) bool

HasAny returns true if any items are contained in the set.

func (Int) Insert

func (s Int) Insert(items ...int) Int

Insert adds items to the set.

func (Int) Intersection

func (s1 Int) Intersection(s2 Int) Int

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Int) IsSuperset

func (s1 Int) IsSuperset(s2 Int) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Int) Len

func (s Int) Len() int

Len returns the size of the set.

func (Int) List

func (s Int) List() []int

List returns the contents as a sorted int slice.

func (Int) PopAny

func (s Int) PopAny() (int, bool)

Returns a single element from the set.

func (Int) Union

func (s1 Int) Union(s2 Int) Int

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Int) UnsortedList

func (s Int) UnsortedList() []int

UnsortedList returns the slice with contents in random order.

type Int32

type Int32 map[int32]Empty

sets.Int32 is a set of int32s, implemented via map[int32]struct{} for minimal memory consumption.

func Int32KeySet

func Int32KeySet(theMap interface{}) Int32

Int32KeySet creates a Int32 from a keys of a map[int32](? extends interface{}). If the value passed in is not actually a map, this will panic.

func NewInt32

func NewInt32(items ...int32) Int32

NewInt32 creates a Int32 from a list of values.

func (Int32) Delete

func (s Int32) Delete(items ...int32) Int32

Delete removes all items from the set.

func (Int32) Difference

func (s Int32) Difference(s2 Int32) Int32

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Int32) Equal

func (s1 Int32) Equal(s2 Int32) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Int32) Has

func (s Int32) Has(item int32) bool

Has returns true if and only if item is contained in the set.

func (Int32) HasAll

func (s Int32) HasAll(items ...int32) bool

HasAll returns true if and only if all items are contained in the set.

func (Int32) HasAny

func (s Int32) HasAny(items ...int32) bool

HasAny returns true if any items are contained in the set.

func (Int32) Insert

func (s Int32) Insert(items ...int32) Int32

Insert adds items to the set.

func (Int32) Intersection

func (s1 Int32) Intersection(s2 Int32) Int32

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Int32) IsSuperset

func (s1 Int32) IsSuperset(s2 Int32) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Int32) Len

func (s Int32) Len() int

Len returns the size of the set.

func (Int32) List

func (s Int32) List() []int32

List returns the contents as a sorted int32 slice.

func (Int32) PopAny

func (s Int32) PopAny() (int32, bool)

Returns a single element from the set.

func (Int32) Union

func (s1 Int32) Union(s2 Int32) Int32

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Int32) UnsortedList

func (s Int32) UnsortedList() []int32

UnsortedList returns the slice with contents in random order.

type Int64

type Int64 map[int64]Empty

sets.Int64 is a set of int64s, implemented via map[int64]struct{} for minimal memory consumption.

func Int64KeySet

func Int64KeySet(theMap interface{}) Int64

Int64KeySet creates a Int64 from a keys of a map[int64](? extends interface{}). If the value passed in is not actually a map, this will panic.

func NewInt64

func NewInt64(items ...int64) Int64

NewInt64 creates a Int64 from a list of values.

func (Int64) Delete

func (s Int64) Delete(items ...int64) Int64

Delete removes all items from the set.

func (Int64) Difference

func (s Int64) Difference(s2 Int64) Int64

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Int64) Equal

func (s1 Int64) Equal(s2 Int64) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Int64) Has

func (s Int64) Has(item int64) bool

Has returns true if and only if item is contained in the set.

func (Int64) HasAll

func (s Int64) HasAll(items ...int64) bool

HasAll returns true if and only if all items are contained in the set.

func (Int64) HasAny

func (s Int64) HasAny(items ...int64) bool

HasAny returns true if any items are contained in the set.

func (Int64) Insert

func (s Int64) Insert(items ...int64) Int64

Insert adds items to the set.

func (Int64) Intersection

func (s1 Int64) Intersection(s2 Int64) Int64

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Int64) IsSuperset

func (s1 Int64) IsSuperset(s2 Int64) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Int64) Len

func (s Int64) Len() int

Len returns the size of the set.

func (Int64) List

func (s Int64) List() []int64

List returns the contents as a sorted int64 slice.

func (Int64) PopAny

func (s Int64) PopAny() (int64, bool)

Returns a single element from the set.

func (Int64) Union

func (s1 Int64) Union(s2 Int64) Int64

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Int64) UnsortedList

func (s Int64) UnsortedList() []int64

UnsortedList returns the slice with contents in random order.

type String

type String map[string]Empty

sets.String is a set of strings, implemented via map[string]struct{} for minimal memory consumption.

func NewString

func NewString(items ...string) String

NewString creates a String from a list of values.

func StringKeySet

func StringKeySet(theMap interface{}) String

StringKeySet creates a String from a keys of a map[string](? extends interface{}). If the value passed in is not actually a map, this will panic.

func (String) Delete

func (s String) Delete(items ...string) String

Delete removes all items from the set.

func (String) Difference

func (s String) Difference(s2 String) String

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (String) Equal

func (s1 String) Equal(s2 String) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (String) Has

func (s String) Has(item string) bool

Has returns true if and only if item is contained in the set.

func (String) HasAll

func (s String) HasAll(items ...string) bool

HasAll returns true if and only if all items are contained in the set.

func (String) HasAny

func (s String) HasAny(items ...string) bool

HasAny returns true if any items are contained in the set.

func (String) Insert

func (s String) Insert(items ...string) String

Insert adds items to the set.

func (String) Intersection

func (s1 String) Intersection(s2 String) String

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (String) IsSuperset

func (s1 String) IsSuperset(s2 String) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (String) Len

func (s String) Len() int

Len returns the size of the set.

func (String) List

func (s String) List() []string

List returns the contents as a sorted string slice.

func (String) PopAny

func (s String) PopAny() (string, bool)

Returns a single element from the set.

func (String) Union

func (s1 String) Union(s2 String) String

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (String) UnsortedList

func (s String) UnsortedList() []string

UnsortedList returns the slice with contents in random order.

type Uint

type Uint map[uint]Empty

sets.Uint is a set of uints, implemented via map[uint]struct{} for minimal memory consumption.

func NewUint

func NewUint(items ...uint) Uint

NewUint creates a Uint from a list of values.

func UintKeySet

func UintKeySet(theMap interface{}) Uint

UintKeySet creates a Uint from a keys of a map[uint](? extends interface{}). If the value passed in is not actually a map, this will panic.

func (Uint) Delete

func (s Uint) Delete(items ...uint) Uint

Delete removes all items from the set.

func (Uint) Difference

func (s Uint) Difference(s2 Uint) Uint

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Uint) Equal

func (s1 Uint) Equal(s2 Uint) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Uint) Has

func (s Uint) Has(item uint) bool

Has returns true if and only if item is contained in the set.

func (Uint) HasAll

func (s Uint) HasAll(items ...uint) bool

HasAll returns true if and only if all items are contained in the set.

func (Uint) HasAny

func (s Uint) HasAny(items ...uint) bool

HasAny returns true if any items are contained in the set.

func (Uint) Insert

func (s Uint) Insert(items ...uint) Uint

Insert adds items to the set.

func (Uint) Intersection

func (s1 Uint) Intersection(s2 Uint) Uint

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Uint) IsSuperset

func (s1 Uint) IsSuperset(s2 Uint) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Uint) Len

func (s Uint) Len() int

Len returns the size of the set.

func (Uint) List

func (s Uint) List() []uint

List returns the contents as a sorted uint slice.

func (Uint) PopAny

func (s Uint) PopAny() (uint, bool)

Returns a single element from the set.

func (Uint) Union

func (s1 Uint) Union(s2 Uint) Uint

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Uint) UnsortedList

func (s Uint) UnsortedList() []uint

UnsortedList returns the slice with contents in random order.

type Uint16

type Uint16 map[uint16]Empty

sets.Uint16 is a set of uint16s, implemented via map[uint16]struct{} for minimal memory consumption.

func NewUint16

func NewUint16(items ...uint16) Uint16

NewUint16 creates a Uint16 from a list of values.

func Uint16KeySet

func Uint16KeySet(theMap interface{}) Uint16

Uint16KeySet creates a Uint16 from a keys of a map[uint16](? extends interface{}). If the value passed in is not actually a map, this will panic.

func (Uint16) Delete

func (s Uint16) Delete(items ...uint16) Uint16

Delete removes all items from the set.

func (Uint16) Difference

func (s Uint16) Difference(s2 Uint16) Uint16

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Uint16) Equal

func (s1 Uint16) Equal(s2 Uint16) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Uint16) Has

func (s Uint16) Has(item uint16) bool

Has returns true if and only if item is contained in the set.

func (Uint16) HasAll

func (s Uint16) HasAll(items ...uint16) bool

HasAll returns true if and only if all items are contained in the set.

func (Uint16) HasAny

func (s Uint16) HasAny(items ...uint16) bool

HasAny returns true if any items are contained in the set.

func (Uint16) Insert

func (s Uint16) Insert(items ...uint16) Uint16

Insert adds items to the set.

func (Uint16) Intersection

func (s1 Uint16) Intersection(s2 Uint16) Uint16

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Uint16) IsSuperset

func (s1 Uint16) IsSuperset(s2 Uint16) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Uint16) Len

func (s Uint16) Len() int

Len returns the size of the set.

func (Uint16) List

func (s Uint16) List() []uint16

List returns the contents as a sorted uint16 slice.

func (Uint16) PopAny

func (s Uint16) PopAny() (uint16, bool)

Returns a single element from the set.

func (Uint16) Union

func (s1 Uint16) Union(s2 Uint16) Uint16

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Uint16) UnsortedList

func (s Uint16) UnsortedList() []uint16

UnsortedList returns the slice with contents in random order.

type Uint32

type Uint32 map[uint32]Empty

sets.Uint32 is a set of uint32s, implemented via map[uint32]struct{} for minimal memory consumption.

func NewUint32

func NewUint32(items ...uint32) Uint32

NewUint32 creates a Uint32 from a list of values.

func Uint32KeySet

func Uint32KeySet(theMap interface{}) Uint32

Uint32KeySet creates a Uint32 from a keys of a map[uint32](? extends interface{}). If the value passed in is not actually a map, this will panic.

func (Uint32) Delete

func (s Uint32) Delete(items ...uint32) Uint32

Delete removes all items from the set.

func (Uint32) Difference

func (s Uint32) Difference(s2 Uint32) Uint32

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Uint32) Equal

func (s1 Uint32) Equal(s2 Uint32) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Uint32) Has

func (s Uint32) Has(item uint32) bool

Has returns true if and only if item is contained in the set.

func (Uint32) HasAll

func (s Uint32) HasAll(items ...uint32) bool

HasAll returns true if and only if all items are contained in the set.

func (Uint32) HasAny

func (s Uint32) HasAny(items ...uint32) bool

HasAny returns true if any items are contained in the set.

func (Uint32) Insert

func (s Uint32) Insert(items ...uint32) Uint32

Insert adds items to the set.

func (Uint32) Intersection

func (s1 Uint32) Intersection(s2 Uint32) Uint32

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Uint32) IsSuperset

func (s1 Uint32) IsSuperset(s2 Uint32) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Uint32) Len

func (s Uint32) Len() int

Len returns the size of the set.

func (Uint32) List

func (s Uint32) List() []uint32

List returns the contents as a sorted uint32 slice.

func (Uint32) PopAny

func (s Uint32) PopAny() (uint32, bool)

Returns a single element from the set.

func (Uint32) Union

func (s1 Uint32) Union(s2 Uint32) Uint32

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Uint32) UnsortedList

func (s Uint32) UnsortedList() []uint32

UnsortedList returns the slice with contents in random order.

type Uint64

type Uint64 map[uint64]Empty

sets.Uint64 is a set of uint64s, implemented via map[uint64]struct{} for minimal memory consumption.

func NewUint64

func NewUint64(items ...uint64) Uint64

NewUint64 creates a Uint64 from a list of values.

func Uint64KeySet

func Uint64KeySet(theMap interface{}) Uint64

Uint64KeySet creates a Uint64 from a keys of a map[uint64](? extends interface{}). If the value passed in is not actually a map, this will panic.

func (Uint64) Delete

func (s Uint64) Delete(items ...uint64) Uint64

Delete removes all items from the set.

func (Uint64) Difference

func (s Uint64) Difference(s2 Uint64) Uint64

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Uint64) Equal

func (s1 Uint64) Equal(s2 Uint64) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Uint64) Has

func (s Uint64) Has(item uint64) bool

Has returns true if and only if item is contained in the set.

func (Uint64) HasAll

func (s Uint64) HasAll(items ...uint64) bool

HasAll returns true if and only if all items are contained in the set.

func (Uint64) HasAny

func (s Uint64) HasAny(items ...uint64) bool

HasAny returns true if any items are contained in the set.

func (Uint64) Insert

func (s Uint64) Insert(items ...uint64) Uint64

Insert adds items to the set.

func (Uint64) Intersection

func (s1 Uint64) Intersection(s2 Uint64) Uint64

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Uint64) IsSuperset

func (s1 Uint64) IsSuperset(s2 Uint64) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Uint64) Len

func (s Uint64) Len() int

Len returns the size of the set.

func (Uint64) List

func (s Uint64) List() []uint64

List returns the contents as a sorted uint64 slice.

func (Uint64) PopAny

func (s Uint64) PopAny() (uint64, bool)

Returns a single element from the set.

func (Uint64) Union

func (s1 Uint64) Union(s2 Uint64) Uint64

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Uint64) UnsortedList

func (s Uint64) UnsortedList() []uint64

UnsortedList returns the slice with contents in random order.

Directories

Path Synopsis
Package types just provides input types to the set generator.
Package types just provides input types to the set generator.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
t or T : Toggle theme light dark auto
y or Y : Canonical URL