| /* |
| Copyright The containerd 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. |
| */ |
| |
| /* |
| 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 setutils |
| |
| // 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]() |
| type Int map[int]Empty |
| |
| // NewInt creates a Int from a list of values. |
| func NewInt(items ...int) Int { |
| return Int(New[int](items...)) |
| } |
| |
| // 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 IntKeySet[T any](theMap map[int]T) Int { |
| return Int(KeySet(theMap)) |
| } |
| |
| // Insert adds items to the set. |
| func (s Int) Insert(items ...int) Int { |
| return Int(cast(s).Insert(items...)) |
| } |
| |
| // Delete removes all items from the set. |
| func (s Int) Delete(items ...int) Int { |
| return Int(cast(s).Delete(items...)) |
| } |
| |
| // Has returns true if and only if item is contained in the set. |
| func (s Int) Has(item int) bool { |
| return cast(s).Has(item) |
| } |
| |
| // HasAll returns true if and only if all items are contained in the set. |
| func (s Int) HasAll(items ...int) bool { |
| return cast(s).HasAll(items...) |
| } |
| |
| // HasAny returns true if any items are contained in the set. |
| func (s Int) HasAny(items ...int) bool { |
| return cast(s).HasAny(items...) |
| } |
| |
| // Clone returns a new set which is a copy of the current set. |
| func (s Int) Clone() Int { |
| return Int(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 (s Int) Difference(s2 Int) Int { |
| return Int(cast(s).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 (s Int) SymmetricDifference(s2 Int) Int { |
| return Int(cast(s).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 (s Int) Union(s2 Int) Int { |
| return Int(cast(s).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 (s Int) Intersection(s2 Int) Int { |
| return Int(cast(s).Intersection(cast(s2))) |
| } |
| |
| // IsSuperset returns true if and only if s1 is a superset of s2. |
| func (s Int) IsSuperset(s2 Int) bool { |
| return cast(s).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 (s Int) Equal(s2 Int) bool { |
| return cast(s).Equal(cast(s2)) |
| } |
| |
| // List returns the contents as a sorted int slice. |
| func (s Int) List() []int { |
| return List(cast(s)) |
| } |
| |
| // UnsortedList returns the slice with contents in random order. |
| func (s Int) UnsortedList() []int { |
| return cast(s).UnsortedList() |
| } |
| |
| // PopAny returns a single element from the set. |
| func (s Int) PopAny() (int, bool) { |
| return cast(s).PopAny() |
| } |
| |
| // Len returns the size of the set. |
| func (s Int) Len() int { |
| return len(s) |
| } |