Home  Trees  Index  Help 

Module sets ::
Class BaseSet


object
+

BaseSet
ImmutableSet
Common base class for mutable and immutable sets.
Method Summary  

This is an abstract class.  
Return the intersection of two sets as a new set.  
__cmp__(self,
other)
 
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.  
__eq__(self,
other)
 
Report whether this set contains another set.  
__gt__(self,
other)
 
Return an iterator over the elements or a set.  
Report whether another set contains this set.  
Return the number of elements of a set.  
__lt__(self,
other)
 
__ne__(self,
other)
 
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.  
_binary_sanity_check(self,
other)
 
_compute_hash(self)
 
_repr(self,
sorted)
 
_update(self,
iterable)
 
Inherited from object  
x.__delattr__('name') <==> del x.name  
x.__getattribute__('name') <==> x.name  
x.__hash__() <==> hash(x)  
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__ = ['_data']

member_descriptor 
_data = <member '_data' of 'BaseSet' objects>

Method Details 

__init__(self)

__and__(self,
other)

__contains__(self,
element)

__copy__(self)Return a shallow copy of a set. 
__deepcopy__(self, memo)Return a deep copy of a set; used by copy module. 
__ge__(self,
other)

__iter__(self)Return an iterator over the elements or a set. This is the keys iterator for the underlying dict. 
__le__(self,
other)

__len__(self)

__or__(self,
other)

__repr__(self)

__str__(self)

__sub__(self,
other)

__xor__(self, other)Return the symmetric difference of two sets as a new set. (I.e. all elements that are in exactly one of the sets.) 
copy(self)Return a shallow copy of a set. 
difference(self, other)Return the difference of two sets as a new Set. (I.e. all elements that are in this set and not in the other.) 
intersection(self, other)Return the intersection of two sets as a new set. (I.e. all elements that are in both sets.) 
issubset(self, other)Report whether another set contains this set. 
issuperset(self, other)Report whether this set contains another set. 
symmetric_difference(self, other)Return the symmetric difference of two sets as a new set. (I.e. all elements that are in exactly one of the sets.) 
union(self, other)Return the union of two sets as a new set. (I.e. all elements that are in either set.) 
Class Variable Details 

__slots__

_data

Home  Trees  Index  Help 

Generated by Epydoc 2.1 on Sat Mar 3 21:14:16 2007  http://epydoc.sf.net 