Build an unordered collection of unique elements.
|
|
|
|
|
__contains__(x,
y)
y in x. |
|
|
|
|
|
|
|
|
|
|
|
|
new empty set object
|
__init__()
x.__init__(...) initializes x; see help(type(x)) for signature |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
a new object with type S, a subtype of T
|
|
|
|
|
|
|
__reduce__(...)
Return state information for pickling. |
|
|
|
|
|
|
|
|
|
|
size of S in memory, in bytes
|
|
|
|
|
|
|
add(...)
Add an element to a set. |
|
|
|
clear(...)
Remove all elements from this set. |
|
|
|
copy(...)
Return a shallow copy of a set. |
|
|
|
difference(...)
Return the difference of two or more sets as a new set. |
|
|
|
difference_update(...)
Remove all elements of another set from this set. |
|
|
|
discard(...)
Remove an element from a set if it is a member. |
|
|
|
intersection(...)
Return the intersection of two or more sets as a new set. |
|
|
|
intersection_update(...)
Update a set with the intersection of itself and another. |
|
|
|
isdisjoint(...)
Return True if two sets have a null intersection. |
|
|
|
issubset(...)
Report whether another set contains this set. |
|
|
|
issuperset(...)
Report whether this set contains another set. |
|
|
|
pop(...)
Remove and return an arbitrary set element. |
|
|
|
remove(...)
Remove an element from a set; it must be a member. |
|
|
|
|
|
symmetric_difference_update(...)
Update a set with the symmetric difference of itself and another. |
|
|
|
union(...)
Return the union of sets as a new set. |
|
|
|
update(...)
Update a set with the union of itself and others. |
|
|
Inherited from object :
__delattr__ ,
__format__ ,
__reduce_ex__ ,
__setattr__ ,
__str__ ,
__subclasshook__
|