mirror of
https://github.com/ceph/ceph-csi.git
synced 2024-10-30 11:00:22 +00:00
9c8de9471e
update kubernetes and its dependencies to v1.26.1 Signed-off-by: Madhu Rajanna <madhupr007@gmail.com>
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
|
|
|
|
// 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]()
|
|
type Int32 map[int32]Empty
|
|
|
|
// NewInt32 creates a Int32 from a list of values.
|
|
func NewInt32(items ...int32) Int32 {
|
|
return Int32(New[int32](items...))
|
|
}
|
|
|
|
// 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 Int32KeySet[T any](theMap map[int32]T) Int32 {
|
|
return Int32(KeySet(theMap))
|
|
}
|
|
|
|
// Insert adds items to the set.
|
|
func (s Int32) Insert(items ...int32) Int32 {
|
|
return Int32(cast(s).Insert(items...))
|
|
}
|
|
|
|
// Delete removes all items from the set.
|
|
func (s Int32) Delete(items ...int32) Int32 {
|
|
return Int32(cast(s).Delete(items...))
|
|
}
|
|
|
|
// Has returns true if and only if item is contained in the set.
|
|
func (s Int32) Has(item int32) bool {
|
|
return cast(s).Has(item)
|
|
}
|
|
|
|
// HasAll returns true if and only if all items are contained in the set.
|
|
func (s Int32) HasAll(items ...int32) bool {
|
|
return cast(s).HasAll(items...)
|
|
}
|
|
|
|
// HasAny returns true if any items are contained in the set.
|
|
func (s Int32) HasAny(items ...int32) bool {
|
|
return cast(s).HasAny(items...)
|
|
}
|
|
|
|
// Clone returns a new set which is a copy of the current set.
|
|
func (s Int32) Clone() Int32 {
|
|
return Int32(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 Int32) Difference(s2 Int32) Int32 {
|
|
return Int32(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 Int32) SymmetricDifference(s2 Int32) Int32 {
|
|
return Int32(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 Int32) Union(s2 Int32) Int32 {
|
|
return Int32(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 Int32) Intersection(s2 Int32) Int32 {
|
|
return Int32(cast(s1).Intersection(cast(s2)))
|
|
}
|
|
|
|
// IsSuperset returns true if and only if s1 is a superset of s2.
|
|
func (s1 Int32) IsSuperset(s2 Int32) 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 Int32) Equal(s2 Int32) bool {
|
|
return cast(s1).Equal(cast(s2))
|
|
}
|
|
|
|
// List returns the contents as a sorted int32 slice.
|
|
func (s Int32) List() []int32 {
|
|
return List(cast(s))
|
|
}
|
|
|
|
// UnsortedList returns the slice with contents in random order.
|
|
func (s Int32) UnsortedList() []int32 {
|
|
return cast(s).UnsortedList()
|
|
}
|
|
|
|
// PopAny returns a single element from the set.
|
|
func (s Int32) PopAny() (int32, bool) {
|
|
return cast(s).PopAny()
|
|
}
|
|
|
|
// Len returns the size of the set.
|
|
func (s Int32) Len() int {
|
|
return len(s)
|
|
}
|