|
Orbits
1
|
Public Member Functions | |
| def | add |
| def | discard |
| def | remove |
| def | pop |
| def | clear |
| def | __ior__ |
| def | __iand__ |
| def | __ixor__ |
| def | __isub__ |
Public Member Functions inherited from _abcoll.Set | |
| def | __le__ |
| def | __lt__ |
| def | __gt__ |
| def | __ge__ |
| def | __eq__ |
| def | __ne__ |
| def | __and__ |
| def | isdisjoint |
| def | __or__ |
| def | __sub__ |
| def | __xor__ |
Public Member Functions inherited from _abcoll.Sized | |
| def | __len__ |
| def | __subclasshook__ |
Public Member Functions inherited from _abcoll.Iterable | |
| def | __iter__ |
| def | __subclasshook__ |
Public Member Functions inherited from _abcoll.Container | |
| def | __contains__ |
| def | __subclasshook__ |
A mutable set is a finite, iterable container. This class provides concrete generic implementations of all methods except for __contains__, __iter__, __len__, add(), and discard(). To override the comparisons (presumably for speed, as the semantics are fixed), all you have to do is redefine __le__ and then the other operations will automatically follow suit.
| def _abcoll.MutableSet.__iand__ | ( | self, | |
| it | |||
| ) |
| def _abcoll.MutableSet.__ior__ | ( | self, | |
| it | |||
| ) |
| def _abcoll.MutableSet.__isub__ | ( | self, | |
| it | |||
| ) |
| def _abcoll.MutableSet.__ixor__ | ( | self, | |
| it | |||
| ) |
| def _abcoll.MutableSet.add | ( | self, | |
| value | |||
| ) |
Add an element.
| def _abcoll.MutableSet.clear | ( | self | ) |
This is slow (creates N new iterators!) but effective.
| def _abcoll.MutableSet.discard | ( | self, | |
| value | |||
| ) |
Remove an element. Do not raise an exception if absent.
| def _abcoll.MutableSet.pop | ( | self | ) |
Return the popped value. Raise KeyError if empty.
| def _abcoll.MutableSet.remove | ( | self, | |
| value | |||
| ) |
Remove an element. If not a member, raise a KeyError.
1.8.3.1
Copyright 2014 Google Inc. All rights reserved.