Documentation
¶
Overview ¶
Package sets has auto-generated set types.
Index ¶
- type Byte
- func (s Byte) Delete(items ...byte)
- func (s Byte) Difference(s2 Byte) Byte
- func (s1 Byte) Equal(s2 Byte) bool
- func (s Byte) Has(item byte) bool
- func (s Byte) HasAll(items ...byte) bool
- func (s Byte) HasAny(items ...byte) bool
- func (s Byte) Insert(items ...byte)
- func (s1 Byte) Intersection(s2 Byte) Byte
- func (s1 Byte) IsSuperset(s2 Byte) bool
- func (s Byte) Len() int
- func (s Byte) List() []byte
- func (s Byte) PopAny() (byte, bool)
- func (s1 Byte) Union(s2 Byte) Byte
- func (s Byte) UnsortedList() []byte
- type Empty
- type Int
- func (s Int) Delete(items ...int)
- func (s Int) Difference(s2 Int) Int
- func (s1 Int) Equal(s2 Int) bool
- func (s Int) Has(item int) bool
- func (s Int) HasAll(items ...int) bool
- func (s Int) HasAny(items ...int) bool
- func (s Int) Insert(items ...int)
- func (s1 Int) Intersection(s2 Int) Int
- func (s1 Int) IsSuperset(s2 Int) bool
- func (s Int) Len() int
- func (s Int) List() []int
- func (s Int) PopAny() (int, bool)
- func (s1 Int) Union(s2 Int) Int
- func (s Int) UnsortedList() []int
- type Int32
- func (s Int32) Delete(items ...int32)
- func (s Int32) Difference(s2 Int32) Int32
- func (s1 Int32) Equal(s2 Int32) bool
- func (s Int32) Has(item int32) bool
- func (s Int32) HasAll(items ...int32) bool
- func (s Int32) HasAny(items ...int32) bool
- func (s Int32) Insert(items ...int32)
- func (s1 Int32) Intersection(s2 Int32) Int32
- func (s1 Int32) IsSuperset(s2 Int32) bool
- func (s Int32) Len() int
- func (s Int32) List() []int32
- func (s Int32) PopAny() (int32, bool)
- func (s1 Int32) Union(s2 Int32) Int32
- func (s Int32) UnsortedList() []int32
- type Int64
- func (s Int64) Delete(items ...int64)
- func (s Int64) Difference(s2 Int64) Int64
- func (s1 Int64) Equal(s2 Int64) bool
- func (s Int64) Has(item int64) bool
- func (s Int64) HasAll(items ...int64) bool
- func (s Int64) HasAny(items ...int64) bool
- func (s Int64) Insert(items ...int64)
- func (s1 Int64) Intersection(s2 Int64) Int64
- func (s1 Int64) IsSuperset(s2 Int64) bool
- func (s Int64) Len() int
- func (s Int64) List() []int64
- func (s Int64) PopAny() (int64, bool)
- func (s1 Int64) Union(s2 Int64) Int64
- func (s Int64) UnsortedList() []int64
- type String
- func (s String) Delete(items ...string)
- func (s String) Difference(s2 String) String
- func (s1 String) Equal(s2 String) bool
- func (s String) Has(item string) bool
- func (s String) HasAll(items ...string) bool
- func (s String) HasAny(items ...string) bool
- func (s String) Insert(items ...string)
- func (s1 String) Intersection(s2 String) String
- func (s1 String) IsSuperset(s2 String) bool
- func (s String) Len() int
- func (s String) List() []string
- func (s String) PopAny() (string, bool)
- func (s1 String) Union(s2 String) String
- func (s String) UnsortedList() []string
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Byte ¶
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 (Byte) Difference ¶
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 ¶
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) Intersection ¶
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 ¶
IsSuperset returns true if and only if s1 is a superset of s2.
func (Byte) Union ¶
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 ¶
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 Int ¶
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 (Int) Difference ¶
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 ¶
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) Intersection ¶
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 ¶
IsSuperset returns true if and only if s1 is a superset of s2.
func (Int) Union ¶
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 ¶
UnsortedList returns the slice with contents in random order.
type Int32 ¶
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 (Int32) Difference ¶
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 ¶
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) Intersection ¶
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 ¶
IsSuperset returns true if and only if s1 is a superset of s2.
func (Int32) Union ¶
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 ¶
UnsortedList returns the slice with contents in random order.
type Int64 ¶
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 (Int64) Difference ¶
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 ¶
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) Intersection ¶
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 ¶
IsSuperset returns true if and only if s1 is a superset of s2.
func (Int64) Union ¶
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 ¶
UnsortedList returns the slice with contents in random order.
type String ¶
sets.String is a set of strings, implemented via map[string]struct{} for minimal memory consumption.
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) Difference ¶
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 ¶
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) Intersection ¶
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 ¶
IsSuperset returns true if and only if s1 is a superset of s2.
func (String) Union ¶
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 ¶
UnsortedList returns the slice with contents in random order.
Source Files
Directories