Trees | Index | Help |
|
---|
Module sets :: Class Set |
|
object
--+ |BaseSet
--+ | Set
Method Summary | |
---|---|
Construct a set from an optional iterable. | |
__as_immutable__(self)
| |
__as_temporarily_immutable__(self)
| |
__getstate__(self)
| |
A Set cannot be hashed. | |
Update a set with the intersection of itself and another. | |
Update a set with the union of itself and another. | |
Remove all elements of another set from this set. | |
Update a set with the symmetric difference of itself and another. | |
__setstate__(self,
data)
| |
Add an element to a set. | |
Remove all elements from this set. | |
Remove all elements of another set from this set. | |
Remove an element from a set if it is a member. | |
Update a set with the intersection of itself and another. | |
Remove and return an arbitrary set element. | |
Remove an element from a set; it must be a member. | |
Update a set with the symmetric difference of itself and another. | |
Update a set with the union of itself and another. | |
Add all values from an iterable (such as a list or file). | |
Inherited from BaseSet | |
Return the intersection of two sets as a new set. | |
| |
Report whether an element is a member of a set. | |
Return a shallow copy of a set. | |
Return a deep copy of a set; used by copy module. | |
| |
Report whether this set contains another set. | |
| |
Return an iterator over the elements or a set. | |
Report whether another set contains this set. | |
Return the number of elements of a set. | |
| |
| |
Return the union of two sets as a new set. | |
Return string representation of a set. | |
Return string representation of a set. | |
Return the difference of two sets as a new Set. | |
Return the symmetric difference of two sets as a new set. | |
Return a shallow copy of a set. | |
Return the difference of two sets as a new Set. | |
Return the intersection of two sets as a new set. | |
Report whether another set contains this set. | |
Report whether this set contains another set. | |
Return the symmetric difference of two sets as a new set. | |
Return the union of two sets as a new set. | |
Inherited from object | |
x.__delattr__('name') <==> del x.name | |
x.__getattribute__('name') <==> x.name | |
T.__new__(S, ...) -> a new object with type S, a subtype of T | |
helper for pickle | |
helper for pickle | |
x.__setattr__('name', value) <==> x.name = value |
Class Variable Summary | |
---|---|
list |
__slots__ = []
|
Method Details |
---|
__init__(self,
iterable=None)
Construct a set from an optional iterable.
|
__hash__(self)
A Set cannot be hashed.
|
__iand__(self, other)Update a set with the intersection of itself and another. |
__ior__(self, other)Update a set with the union of itself and another. |
__isub__(self, other)Remove all elements of another set from this set. |
__ixor__(self, other)Update a set with the symmetric difference of itself and another. |
add(self, element)Add an element to a set. This has no effect if the element is already present. |
clear(self)Remove all elements from this set. |
difference_update(self, other)Remove all elements of another set from this set. |
discard(self, element)Remove an element from a set if it is a member. If the element is not a member, do nothing. |
intersection_update(self, other)Update a set with the intersection of itself and another. |
pop(self)Remove and return an arbitrary set element. |
remove(self, element)Remove an element from a set; it must be a member. If the element is not a member, raise a KeyError. |
symmetric_difference_update(self, other)Update a set with the symmetric difference of itself and another. |
union_update(self, other)Update a set with the union of itself and another. |
update(self, iterable)Add all values from an iterable (such as a list or file). |
Class Variable Details |
---|
__slots__
|
Trees | Index | Help |
|
---|
Generated by Epydoc 2.1 on Fri Jun 24 12:01:23 2005 | http://epydoc.sf.net |