Home | Trees | Index | Help |
|
---|
Package ldaptor :: Module attributeset :: Class LDAPAttributeSet |
|
object
--+ |BaseSet
--+ |Set
--+ | LDAPAttributeSet
JournaledLDAPAttributeSet
,
Modification
Method Summary | |
---|---|
__init__(self,
key,
*a,
**kw)
| |
Return a shallow copy of a set. | |
Return a deep copy of a set; used by copy module. | |
Note that LDAPAttributeSets can also be compared against any iterator. | |
__ne__(self,
other)
| |
Return string representation of a 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. | |
Return the symmetric difference of two sets as a new set. | |
Return the union of two sets as a new set. | |
Inherited from Set | |
| |
| |
| |
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. | |
| |
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. | |
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 the difference of two sets as a new Set. | |
Return the symmetric difference of two sets as a new set. | |
Report whether another set contains this set. | |
Report whether this set contains another 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 | |
---|---|
Inherited from Set | |
list |
__slots__ = []
|
Method Details |
---|
__copy__(self)Return a shallow copy of a set.
|
__deepcopy__(self, memo)Return a deep copy of a set; used by copy module.
|
__eq__(self,
other)
Note that LDAPAttributeSets can also be compared against any
iterator. In that case the attributeType will be ignored.
|
__repr__(self)
|
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.)
|
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.)
|
Home | Trees | Index | Help |
|
---|
Generated by Epydoc 2.1 on Tue Aug 17 17:08:21 2004 | http://epydoc.sf.net |