1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
|
<!-- Generated with Stardoc: http://skydoc.bazel.build -->
Skylib module containing common hash-set algorithms.
An empty set can be created using: `sets.make()`, or it can be created with some starting values
if you pass it an sequence: `sets.make([1, 2, 3])`. This returns a struct containing all of the
values as keys in a dictionary - this means that all passed in values must be hashable. The
values in the set can be retrieved using `sets.to_list(my_set)`.
An arbitrary object can be tested whether it is a set generated by `sets.make()` or not with the
`types.is_set()` method in types.bzl.
<a id="sets.make"></a>
## sets.make
<pre>
sets.make(<a href="#sets.make-elements">elements</a>)
</pre>
Creates a new set.
All elements must be hashable.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.make-elements"></a>elements | Optional sequence to construct the set out of. | <code>None</code> |
**RETURNS**
A set containing the passed in values.
<a id="sets.copy"></a>
## sets.copy
<pre>
sets.copy(<a href="#sets.copy-s">s</a>)
</pre>
Creates a new set from another set.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.copy-s"></a>s | A set, as returned by <code>sets.make()</code>. | none |
**RETURNS**
A new set containing the same elements as `s`.
<a id="sets.to_list"></a>
## sets.to_list
<pre>
sets.to_list(<a href="#sets.to_list-s">s</a>)
</pre>
Creates a list from the values in the set.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.to_list-s"></a>s | A set, as returned by <code>sets.make()</code>. | none |
**RETURNS**
A list of values inserted into the set.
<a id="sets.insert"></a>
## sets.insert
<pre>
sets.insert(<a href="#sets.insert-s">s</a>, <a href="#sets.insert-e">e</a>)
</pre>
Inserts an element into the set.
Element must be hashable. This mutates the original set.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.insert-s"></a>s | A set, as returned by <code>sets.make()</code>. | none |
| <a id="sets.insert-e"></a>e | The element to be inserted. | none |
**RETURNS**
The set `s` with `e` included.
<a id="sets.contains"></a>
## sets.contains
<pre>
sets.contains(<a href="#sets.contains-a">a</a>, <a href="#sets.contains-e">e</a>)
</pre>
Checks for the existence of an element in a set.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.contains-a"></a>a | A set, as returned by <code>sets.make()</code>. | none |
| <a id="sets.contains-e"></a>e | The element to look for. | none |
**RETURNS**
True if the element exists in the set, False if the element does not.
<a id="sets.is_equal"></a>
## sets.is_equal
<pre>
sets.is_equal(<a href="#sets.is_equal-a">a</a>, <a href="#sets.is_equal-b">b</a>)
</pre>
Returns whether two sets are equal.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.is_equal-a"></a>a | A set, as returned by <code>sets.make()</code>. | none |
| <a id="sets.is_equal-b"></a>b | A set, as returned by <code>sets.make()</code>. | none |
**RETURNS**
True if `a` is equal to `b`, False otherwise.
<a id="sets.is_subset"></a>
## sets.is_subset
<pre>
sets.is_subset(<a href="#sets.is_subset-a">a</a>, <a href="#sets.is_subset-b">b</a>)
</pre>
Returns whether `a` is a subset of `b`.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.is_subset-a"></a>a | A set, as returned by <code>sets.make()</code>. | none |
| <a id="sets.is_subset-b"></a>b | A set, as returned by <code>sets.make()</code>. | none |
**RETURNS**
True if `a` is a subset of `b`, False otherwise.
<a id="sets.disjoint"></a>
## sets.disjoint
<pre>
sets.disjoint(<a href="#sets.disjoint-a">a</a>, <a href="#sets.disjoint-b">b</a>)
</pre>
Returns whether two sets are disjoint.
Two sets are disjoint if they have no elements in common.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.disjoint-a"></a>a | A set, as returned by <code>sets.make()</code>. | none |
| <a id="sets.disjoint-b"></a>b | A set, as returned by <code>sets.make()</code>. | none |
**RETURNS**
True if `a` and `b` are disjoint, False otherwise.
<a id="sets.intersection"></a>
## sets.intersection
<pre>
sets.intersection(<a href="#sets.intersection-a">a</a>, <a href="#sets.intersection-b">b</a>)
</pre>
Returns the intersection of two sets.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.intersection-a"></a>a | A set, as returned by <code>sets.make()</code>. | none |
| <a id="sets.intersection-b"></a>b | A set, as returned by <code>sets.make()</code>. | none |
**RETURNS**
A set containing the elements that are in both `a` and `b`.
<a id="sets.union"></a>
## sets.union
<pre>
sets.union(<a href="#sets.union-args">args</a>)
</pre>
Returns the union of several sets.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.union-args"></a>args | An arbitrary number of sets. | none |
**RETURNS**
The set union of all sets in `*args`.
<a id="sets.difference"></a>
## sets.difference
<pre>
sets.difference(<a href="#sets.difference-a">a</a>, <a href="#sets.difference-b">b</a>)
</pre>
Returns the elements in `a` that are not in `b`.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.difference-a"></a>a | A set, as returned by <code>sets.make()</code>. | none |
| <a id="sets.difference-b"></a>b | A set, as returned by <code>sets.make()</code>. | none |
**RETURNS**
A set containing the elements that are in `a` but not in `b`.
<a id="sets.length"></a>
## sets.length
<pre>
sets.length(<a href="#sets.length-s">s</a>)
</pre>
Returns the number of elements in a set.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.length-s"></a>s | A set, as returned by <code>sets.make()</code>. | none |
**RETURNS**
An integer representing the number of elements in the set.
<a id="sets.remove"></a>
## sets.remove
<pre>
sets.remove(<a href="#sets.remove-s">s</a>, <a href="#sets.remove-e">e</a>)
</pre>
Removes an element from the set.
Element must be hashable. This mutates the original set.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.remove-s"></a>s | A set, as returned by <code>sets.make()</code>. | none |
| <a id="sets.remove-e"></a>e | The element to be removed. | none |
**RETURNS**
The set `s` with `e` removed.
<a id="sets.repr"></a>
## sets.repr
<pre>
sets.repr(<a href="#sets.repr-s">s</a>)
</pre>
Returns a string value representing the set.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.repr-s"></a>s | A set, as returned by <code>sets.make()</code>. | none |
**RETURNS**
A string representing the set.
<a id="sets.str"></a>
## sets.str
<pre>
sets.str(<a href="#sets.str-s">s</a>)
</pre>
Returns a string value representing the set.
**PARAMETERS**
| Name | Description | Default Value |
| :------------- | :------------- | :------------- |
| <a id="sets.str-s"></a>s | A set, as returned by <code>sets.make()</code>. | none |
**RETURNS**
A string representing the set.
|
