mirror of
https://github.com/crazy-max/diun.git
synced 2024-12-23 03:48:00 +00:00
138 lines
3.9 KiB
Go
138 lines
3.9 KiB
Go
/*
|
|
Copyright 2022 The Kubernetes Authors.
|
|
|
|
Licensed under the Apache License, Version 2.0 (the "License");
|
|
you may not use this file except in compliance with the License.
|
|
You may obtain a copy of the License at
|
|
|
|
http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
Unless required by applicable law or agreed to in writing, software
|
|
distributed under the License is distributed on an "AS IS" BASIS,
|
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
See the License for the specific language governing permissions and
|
|
limitations under the License.
|
|
*/
|
|
|
|
package sets
|
|
|
|
// 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]()
|
|
type Byte map[byte]Empty
|
|
|
|
// NewByte creates a Byte from a list of values.
|
|
func NewByte(items ...byte) Byte {
|
|
return Byte(New[byte](items...))
|
|
}
|
|
|
|
// 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 ByteKeySet[T any](theMap map[byte]T) Byte {
|
|
return Byte(KeySet(theMap))
|
|
}
|
|
|
|
// Insert adds items to the set.
|
|
func (s Byte) Insert(items ...byte) Byte {
|
|
return Byte(cast(s).Insert(items...))
|
|
}
|
|
|
|
// Delete removes all items from the set.
|
|
func (s Byte) Delete(items ...byte) Byte {
|
|
return Byte(cast(s).Delete(items...))
|
|
}
|
|
|
|
// Has returns true if and only if item is contained in the set.
|
|
func (s Byte) Has(item byte) bool {
|
|
return cast(s).Has(item)
|
|
}
|
|
|
|
// HasAll returns true if and only if all items are contained in the set.
|
|
func (s Byte) HasAll(items ...byte) bool {
|
|
return cast(s).HasAll(items...)
|
|
}
|
|
|
|
// HasAny returns true if any items are contained in the set.
|
|
func (s Byte) HasAny(items ...byte) bool {
|
|
return cast(s).HasAny(items...)
|
|
}
|
|
|
|
// Clone returns a new set which is a copy of the current set.
|
|
func (s Byte) Clone() Byte {
|
|
return Byte(cast(s).Clone())
|
|
}
|
|
|
|
// 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 (s1 Byte) Difference(s2 Byte) Byte {
|
|
return Byte(cast(s1).Difference(cast(s2)))
|
|
}
|
|
|
|
// 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 (s1 Byte) SymmetricDifference(s2 Byte) Byte {
|
|
return Byte(cast(s1).SymmetricDifference(cast(s2)))
|
|
}
|
|
|
|
// 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 (s1 Byte) Union(s2 Byte) Byte {
|
|
return Byte(cast(s1).Union(cast(s2)))
|
|
}
|
|
|
|
// 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 (s1 Byte) Intersection(s2 Byte) Byte {
|
|
return Byte(cast(s1).Intersection(cast(s2)))
|
|
}
|
|
|
|
// IsSuperset returns true if and only if s1 is a superset of s2.
|
|
func (s1 Byte) IsSuperset(s2 Byte) bool {
|
|
return cast(s1).IsSuperset(cast(s2))
|
|
}
|
|
|
|
// 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 (s1 Byte) Equal(s2 Byte) bool {
|
|
return cast(s1).Equal(cast(s2))
|
|
}
|
|
|
|
// List returns the contents as a sorted byte slice.
|
|
func (s Byte) List() []byte {
|
|
return List(cast(s))
|
|
}
|
|
|
|
// UnsortedList returns the slice with contents in random order.
|
|
func (s Byte) UnsortedList() []byte {
|
|
return cast(s).UnsortedList()
|
|
}
|
|
|
|
// PopAny returns a single element from the set.
|
|
func (s Byte) PopAny() (byte, bool) {
|
|
return cast(s).PopAny()
|
|
}
|
|
|
|
// Len returns the size of the set.
|
|
func (s Byte) Len() int {
|
|
return len(s)
|
|
}
|