Documentation
¶
Overview ¶
Package sets has generic set and specified sets. Generic set will replace specified ones over time. And specific ones are deprecated.
Index ¶
- func List[T cmp.Ordered](s Set[T]) []T
- type Bytedeprecated
- func (s Byte) Clone() Byte
- func (s Byte) Delete(items ...byte) Byte
- func (s1 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) 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) SymmetricDifference(s2 Byte) Byte
- func (s1 Byte) Union(s2 Byte) Byte
- func (s Byte) UnsortedList() []byte
- type Empty
- type Intdeprecated
- func (s Int) Clone() Int
- func (s Int) Delete(items ...int) Int
- func (s1 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) 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) SymmetricDifference(s2 Int) Int
- func (s1 Int) Union(s2 Int) Int
- func (s Int) UnsortedList() []int
- type Int32deprecated
- func (s Int32) Clone() Int32
- func (s Int32) Delete(items ...int32) Int32
- func (s1 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) 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) SymmetricDifference(s2 Int32) Int32
- func (s1 Int32) Union(s2 Int32) Int32
- func (s Int32) UnsortedList() []int32
- type Int64deprecated
- func (s Int64) Clone() Int64
- func (s Int64) Delete(items ...int64) Int64
- func (s1 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) 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) SymmetricDifference(s2 Int64) Int64
- func (s1 Int64) Union(s2 Int64) Int64
- func (s Int64) UnsortedList() []int64
- type Set
- func (s Set[T]) Clear() Set[T]
- func (s Set[T]) Clone() Set[T]
- func (s Set[T]) Delete(items ...T) Set[T]
- func (s1 Set[T]) Difference(s2 Set[T]) Set[T]
- func (s1 Set[T]) Equal(s2 Set[T]) bool
- func (s Set[T]) Has(item T) bool
- func (s Set[T]) HasAll(items ...T) bool
- func (s Set[T]) HasAny(items ...T) bool
- func (s Set[T]) Insert(items ...T) Set[T]
- func (s1 Set[T]) Intersection(s2 Set[T]) Set[T]
- func (s1 Set[T]) IsSuperset(s2 Set[T]) bool
- func (s Set[T]) Len() int
- func (s Set[T]) PopAny() (T, bool)
- func (s1 Set[T]) SymmetricDifference(s2 Set[T]) Set[T]
- func (s1 Set[T]) Union(s2 Set[T]) Set[T]
- func (s Set[T]) UnsortedList() []T
- type Stringdeprecated
- func (s String) Clone() String
- func (s String) Delete(items ...string) String
- func (s1 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) 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) SymmetricDifference(s2 String) String
- func (s1 String) Union(s2 String) String
- func (s String) UnsortedList() []string
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
Types ¶
type Byte
deprecated
Byte is a set of bytes, implemented via map[byte]struct{} for minimal memory consumption.
Deprecated: use generic Set instead. new ways: s1 := Set[byte]{} s2 := New[byte]()
func ByteKeySet ¶
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) SymmetricDifference ¶ added in v0.26.0
SymmetricDifference returns a set of elements which are in either of the sets, but not in their intersection. For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.SymmetricDifference(s2) = {a3, a4, a5} s2.SymmetricDifference(s1) = {a3, a4, a5}
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
deprecated
Int is a set of ints, implemented via map[int]struct{} for minimal memory consumption.
Deprecated: use generic Set instead. new ways: s1 := Set[int]{} s2 := New[int]()
func IntKeySet ¶
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) SymmetricDifference ¶ added in v0.26.0
SymmetricDifference returns a set of elements which are in either of the sets, but not in their intersection. For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.SymmetricDifference(s2) = {a3, a4, a5} s2.SymmetricDifference(s1) = {a3, a4, a5}
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
deprecated
Int32 is a set of int32s, implemented via map[int32]struct{} for minimal memory consumption.
Deprecated: use generic Set instead. new ways: s1 := Set[int32]{} s2 := New[int32]()
func Int32KeySet ¶
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) SymmetricDifference ¶ added in v0.26.0
SymmetricDifference returns a set of elements which are in either of the sets, but not in their intersection. For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.SymmetricDifference(s2) = {a3, a4, a5} s2.SymmetricDifference(s1) = {a3, a4, a5}
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
deprecated
Int64 is a set of int64s, implemented via map[int64]struct{} for minimal memory consumption.
Deprecated: use generic Set instead. new ways: s1 := Set[int64]{} s2 := New[int64]()
func Int64KeySet ¶
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) SymmetricDifference ¶ added in v0.26.0
SymmetricDifference returns a set of elements which are in either of the sets, but not in their intersection. For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.SymmetricDifference(s2) = {a3, a4, a5} s2.SymmetricDifference(s1) = {a3, a4, a5}
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 Set ¶ added in v0.26.0
type Set[T comparable] map[T]Empty
Set is a set of the same type elements, implemented via map[comparable]struct{} for minimal memory consumption.
func Insert ¶ added in v0.26.0
func Insert[T comparable](set Set[T], items ...T) Set[T]
func KeySet ¶ added in v0.26.0
func KeySet[T comparable, V any](theMap map[T]V) Set[T]
KeySet creates a Set from a keys of a map[comparable](? extends interface{}). If the value passed in is not actually a map, this will panic.
func New ¶ added in v0.26.0
func New[T comparable](items ...T) Set[T]
New creates a Set from a list of values. NOTE: type param must be explicitly instantiated if given items are empty.
func (Set[T]) Clear ¶ added in v0.27.0
Clear empties the set. It is preferable to replace the set with a newly constructed set, but not all callers can do that (when there are other references to the map).
func (Set[T]) Difference ¶ added in v0.26.0
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 (Set[T]) Equal ¶ added in v0.26.0
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 (Set[T]) HasAll ¶ added in v0.26.0
HasAll returns true if and only if all items are contained in the set.
func (Set[T]) Intersection ¶ added in v0.26.0
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 (Set[T]) IsSuperset ¶ added in v0.26.0
IsSuperset returns true if and only if s1 is a superset of s2.
func (Set[T]) SymmetricDifference ¶ added in v0.26.0
SymmetricDifference returns a set of elements which are in either of the sets, but not in their intersection. For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.SymmetricDifference(s2) = {a3, a4, a5} s2.SymmetricDifference(s1) = {a3, a4, a5}
func (Set[T]) Union ¶ added in v0.26.0
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 (Set[T]) UnsortedList ¶ added in v0.26.0
func (s Set[T]) UnsortedList() []T
UnsortedList returns the slice with contents in random order.
type String
deprecated
String is a set of strings, implemented via map[string]struct{} for minimal memory consumption.
Deprecated: use generic Set instead. new ways: s1 := Set[string]{} s2 := New[string]()
func StringKeySet ¶
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) SymmetricDifference ¶ added in v0.26.0
SymmetricDifference returns a set of elements which are in either of the sets, but not in their intersection. For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.SymmetricDifference(s2) = {a3, a4, a5} s2.SymmetricDifference(s1) = {a3, a4, a5}
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