blob: 88bd7096791e6a5c7a451f0ffe746734ac2240bb [file] [log] [blame]
Matteo Scandoloa4285862020-12-01 18:10:10 -08001/*
2Copyright The Kubernetes Authors.
3
4Licensed under the Apache License, Version 2.0 (the "License");
5you may not use this file except in compliance with the License.
6You may obtain a copy of the License at
7
8 http://www.apache.org/licenses/LICENSE-2.0
9
10Unless required by applicable law or agreed to in writing, software
11distributed under the License is distributed on an "AS IS" BASIS,
12WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13See the License for the specific language governing permissions and
14limitations under the License.
15*/
16
17// Code generated by set-gen. DO NOT EDIT.
18
19package sets
20
21import (
22 "reflect"
23 "sort"
24)
25
26// sets.Int is a set of ints, implemented via map[int]struct{} for minimal memory consumption.
27type Int map[int]Empty
28
29// NewInt creates a Int from a list of values.
30func NewInt(items ...int) Int {
31 ss := Int{}
32 ss.Insert(items...)
33 return ss
34}
35
36// IntKeySet creates a Int from a keys of a map[int](? extends interface{}).
37// If the value passed in is not actually a map, this will panic.
38func IntKeySet(theMap interface{}) Int {
39 v := reflect.ValueOf(theMap)
40 ret := Int{}
41
42 for _, keyValue := range v.MapKeys() {
43 ret.Insert(keyValue.Interface().(int))
44 }
45 return ret
46}
47
48// Insert adds items to the set.
49func (s Int) Insert(items ...int) Int {
50 for _, item := range items {
51 s[item] = Empty{}
52 }
53 return s
54}
55
56// Delete removes all items from the set.
57func (s Int) Delete(items ...int) Int {
58 for _, item := range items {
59 delete(s, item)
60 }
61 return s
62}
63
64// Has returns true if and only if item is contained in the set.
65func (s Int) Has(item int) bool {
66 _, contained := s[item]
67 return contained
68}
69
70// HasAll returns true if and only if all items are contained in the set.
71func (s Int) HasAll(items ...int) bool {
72 for _, item := range items {
73 if !s.Has(item) {
74 return false
75 }
76 }
77 return true
78}
79
80// HasAny returns true if any items are contained in the set.
81func (s Int) HasAny(items ...int) bool {
82 for _, item := range items {
83 if s.Has(item) {
84 return true
85 }
86 }
87 return false
88}
89
90// Difference returns a set of objects that are not in s2
91// For example:
92// s1 = {a1, a2, a3}
93// s2 = {a1, a2, a4, a5}
94// s1.Difference(s2) = {a3}
95// s2.Difference(s1) = {a4, a5}
96func (s Int) Difference(s2 Int) Int {
97 result := NewInt()
98 for key := range s {
99 if !s2.Has(key) {
100 result.Insert(key)
101 }
102 }
103 return result
104}
105
106// Union returns a new set which includes items in either s1 or s2.
107// For example:
108// s1 = {a1, a2}
109// s2 = {a3, a4}
110// s1.Union(s2) = {a1, a2, a3, a4}
111// s2.Union(s1) = {a1, a2, a3, a4}
112func (s1 Int) Union(s2 Int) Int {
113 result := NewInt()
114 for key := range s1 {
115 result.Insert(key)
116 }
117 for key := range s2 {
118 result.Insert(key)
119 }
120 return result
121}
122
123// Intersection returns a new set which includes the item in BOTH s1 and s2
124// For example:
125// s1 = {a1, a2}
126// s2 = {a2, a3}
127// s1.Intersection(s2) = {a2}
128func (s1 Int) Intersection(s2 Int) Int {
129 var walk, other Int
130 result := NewInt()
131 if s1.Len() < s2.Len() {
132 walk = s1
133 other = s2
134 } else {
135 walk = s2
136 other = s1
137 }
138 for key := range walk {
139 if other.Has(key) {
140 result.Insert(key)
141 }
142 }
143 return result
144}
145
146// IsSuperset returns true if and only if s1 is a superset of s2.
147func (s1 Int) IsSuperset(s2 Int) bool {
148 for item := range s2 {
149 if !s1.Has(item) {
150 return false
151 }
152 }
153 return true
154}
155
156// Equal returns true if and only if s1 is equal (as a set) to s2.
157// Two sets are equal if their membership is identical.
158// (In practice, this means same elements, order doesn't matter)
159func (s1 Int) Equal(s2 Int) bool {
160 return len(s1) == len(s2) && s1.IsSuperset(s2)
161}
162
163type sortableSliceOfInt []int
164
165func (s sortableSliceOfInt) Len() int { return len(s) }
166func (s sortableSliceOfInt) Less(i, j int) bool { return lessInt(s[i], s[j]) }
167func (s sortableSliceOfInt) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
168
169// List returns the contents as a sorted int slice.
170func (s Int) List() []int {
171 res := make(sortableSliceOfInt, 0, len(s))
172 for key := range s {
173 res = append(res, key)
174 }
175 sort.Sort(res)
176 return []int(res)
177}
178
179// UnsortedList returns the slice with contents in random order.
180func (s Int) UnsortedList() []int {
181 res := make([]int, 0, len(s))
182 for key := range s {
183 res = append(res, key)
184 }
185 return res
186}
187
188// Returns a single element from the set.
189func (s Int) PopAny() (int, bool) {
190 for key := range s {
191 s.Delete(key)
192 return key, true
193 }
194 var zeroValue int
195 return zeroValue, false
196}
197
198// Len returns the size of the set.
199func (s Int) Len() int {
200 return len(s)
201}
202
203func lessInt(lhs, rhs int) bool {
204 return lhs < rhs
205}