Current path: lib64/python2.7/
β Cloned to:
β¬οΈ Go up: /lib64
οΏ½
z fc @ sοΏ½ d Z d d l m Z m Z d d d g Z d d l Z e j d e d d οΏ½d e f d
οΏ½ οΏ½ YZ d e f d οΏ½ οΏ½ YZ
d e f d οΏ½ οΏ½ YZ d
e f d οΏ½ οΏ½ YZ d S( sοΏ½ Classes to represent arbitrary sets (including sets of sets).
This module implements sets using dictionaries whose values are
ignored. The usual operations (union, intersection, deletion, etc.)
are provided as both methods and operators.
Important: sets are not sequences! While they support 'x in s',
'len(s)', and 'for x in s', none of those operations are unique for
sequences; for example, mappings support all three as well. The
characteristic operation for sequences is subscripting with small
integers: s[i], for i in range(len(s)). Sets don't support
subscripting at all. Also, sequences allow multiple occurrences and
their elements have a definite order; sets on the other hand don't
record multiple occurrences and don't remember the order of element
insertion (which is why they don't support s[i]).
The following classes are provided:
BaseSet -- All the operations common to both mutable and immutable
sets. This is an abstract class, not meant to be directly
instantiated.
Set -- Mutable sets, subclass of BaseSet; not hashable.
ImmutableSet -- Immutable sets, subclass of BaseSet; hashable.
An iterable argument is mandatory to create an ImmutableSet.
_TemporarilyImmutableSet -- A wrapper around a Set, hashable,
giving the same hash value as the immutable set equivalent
would have. Do not use this class directly.
Only hashable objects can be added to a Set. In particular, you cannot
really add a Set as an element to another Set; if you try, what is
actually added is an ImmutableSet built from it (it compares equal to
the one you tried adding).
When you ask if `x in y' where x is a Set and y is a Set or
ImmutableSet, x is wrapped into a _TemporarilyImmutableSet z, and
what's tested is actually `z in y'.
iοΏ½οΏ½οΏ½οΏ½( t ifiltert ifilterfalset BaseSett Sett ImmutableSetNs the sets module is deprecatedt
stackleveli c B s" e Z d Z d g Z d οΏ½ Z d οΏ½ Z d οΏ½ Z e Z e d οΏ½ Z d οΏ½ Z
d οΏ½ Z d οΏ½ Z d οΏ½ Z
d
οΏ½ Z e Z d οΏ½ Z d οΏ½ Z d
οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z e Z e Z d οΏ½ Z d οΏ½ Z d Z! d οΏ½ Z" d οΏ½ Z# d οΏ½ Z$ RS( s1 Common base class for mutable and immutable sets.t _datac C s | j t k r t d οΏ½ n d S( s This is an abstract class.s7 BaseSet is an abstract class. Use Set or ImmutableSet.N( t __class__R t TypeError( t self( ( s /usr/lib64/python2.7/sets.pyt __init__H s c C s
t | j οΏ½ S( s' Return the number of elements of a set.( t lenR ( R ( ( s /usr/lib64/python2.7/sets.pyt __len__Q s c C s
| j οΏ½ S( se Return string representation of a set.
This looks like 'Set([<list of elements>])'.
( t _repr( R ( ( s /usr/lib64/python2.7/sets.pyt __repr__U s c C s6 | j j οΏ½ } | r" | j οΏ½ n d | j j | f S( Ns %s(%r)( R t keyst sortR t __name__( R t sortedt elements( ( s /usr/lib64/python2.7/sets.pyR
_ s
c C s
| j j οΏ½ S( ss Return an iterator over the elements or a set.
This is the keys iterator for the underlying dict.
( R t iterkeys( R ( ( s /usr/lib64/python2.7/sets.pyt __iter__e s c C s
t d οΏ½ d S( Ns can't compare sets using cmp()( R ( R t other( ( s /usr/lib64/python2.7/sets.pyt __cmp__q s c C s' t | t οΏ½ r | j | j k St Sd S( N( t
isinstanceR R t False( R R ( ( s /usr/lib64/python2.7/sets.pyt __eq__οΏ½ s c C s' t | t οΏ½ r | j | j k St Sd S( N( R R R t True( R R ( ( s /usr/lib64/python2.7/sets.pyt __ne__οΏ½ s c C s# | j οΏ½ } | j j | j οΏ½ | S( s Return a shallow copy of a set.( R R t update( R t result( ( s /usr/lib64/python2.7/sets.pyt copyοΏ½ s c C sc d d l m } | j οΏ½ } | | t | οΏ½ <| j } t } x! | D] } | | | | | οΏ½ <qB W| S( s1 Return a deep copy of a set; used by copy module.iοΏ½οΏ½οΏ½οΏ½( t deepcopy( R R R t idR R ( R t memoR R t datat valuet elt( ( s /usr/lib64/python2.7/sets.pyt __deepcopy__οΏ½ s
c C s t | t οΏ½ s t S| j | οΏ½ S( sh Return the union of two sets as a new set.
(I.e. all elements that are in either set.)
( R R t NotImplementedt union( R R ( ( s /usr/lib64/python2.7/sets.pyt __or__οΏ½ s c C s | j | οΏ½ } | j | οΏ½ | S( sh Return the union of two sets as a new set.
(I.e. all elements that are in either set.)
( R t _update( R R R ( ( s /usr/lib64/python2.7/sets.pyR( οΏ½ s
c C s t | t οΏ½ s t S| j | οΏ½ S( sn Return the intersection of two sets as a new set.
(I.e. all elements that are in both sets.)
( R R R' t intersection( R R ( ( s /usr/lib64/python2.7/sets.pyt __and__οΏ½ s c C su t | t οΏ½ s t | οΏ½ } n t | οΏ½ t | οΏ½ k rF | | } } n
| | } } t | j j | οΏ½ } | j | οΏ½ S( sn Return the intersection of two sets as a new set.
(I.e. all elements that are in both sets.)
( R R R R R R t __contains__R ( R R t littlet bigt common( ( s /usr/lib64/python2.7/sets.pyR+ οΏ½ s
c C s t | t οΏ½ s t S| j | οΏ½ S( sοΏ½ Return the symmetric difference of two sets as a new set.
(I.e. all elements that are in exactly one of the sets.)
( R R R' t symmetric_difference( R R ( ( s /usr/lib64/python2.7/sets.pyt __xor__οΏ½ s c C sοΏ½ | j οΏ½ } | j } t } | j } y
| j } Wn t k
rS t | οΏ½ j } n Xx$ t | j | οΏ½ D] } | | | <qg Wx$ t | j | οΏ½ D] } | | | <qοΏ½ W| S( sοΏ½ Return the symmetric difference of two sets as a new set.
(I.e. all elements that are in exactly one of the sets.)
( R R R t AttributeErrorR R R- ( R R R R# R$ t selfdatat otherdataR% ( ( s /usr/lib64/python2.7/sets.pyR1 οΏ½ s
c C s t | t οΏ½ s t S| j | οΏ½ S( sοΏ½ Return the difference of two sets as a new Set.
(I.e. all elements that are in this set and not in the other.)
( R R R' t
difference( R R ( ( s /usr/lib64/python2.7/sets.pyt __sub__οΏ½ s c C sv | j οΏ½ } | j } y
| j } Wn t k
rD t | οΏ½ j } n Xt } x$ t | j | οΏ½ D] } | | | <q^ W| S( sοΏ½ Return the difference of two sets as a new Set.
(I.e. all elements that are in this set and not in the other.)
( R R R3 R R R R- ( R R R R# R5 R$ R% ( ( s /usr/lib64/python2.7/sets.pyR6 s
c C sZ y | | j k SWnB t k
rU t | d d οΏ½ } | d k rE οΏ½ n | οΏ½ | j k SXd S( s{ Report whether an element is a member of a set.
(Called in response to the expression `element in self'.)
t __as_temporarily_immutable__N( R R t getattrt None( R t elementt transform( ( s /usr/lib64/python2.7/sets.pyR- s
c C sN | j | οΏ½ t | οΏ½ t | οΏ½ k r) t Sx t | j j | οΏ½ D] } t SWt S( s- Report whether another set contains this set.( t _binary_sanity_checkR R R R R- R ( R R R% ( ( s /usr/lib64/python2.7/sets.pyt issubset! s
c C sN | j | οΏ½ t | οΏ½ t | οΏ½ k r) t Sx t | j j | οΏ½ D] } t SWt S( s- Report whether this set contains another set.( R= R R R R R- R ( R R R% ( ( s /usr/lib64/python2.7/sets.pyt
issuperset* s
c C s2 | j | οΏ½ t | οΏ½ t | οΏ½ k o1 | j | οΏ½ S( N( R= R R> ( R R ( ( s /usr/lib64/python2.7/sets.pyt __lt__7 s
c C s2 | j | οΏ½ t | οΏ½ t | οΏ½ k o1 | j | οΏ½ S( N( R= R R? ( R R ( ( s /usr/lib64/python2.7/sets.pyt __gt__; s
c C s t | t οΏ½ s t d οΏ½ n d S( Ns, Binary operation only permitted between sets( R R R ( R R ( ( s /usr/lib64/python2.7/sets.pyR= D s c C s+ d } x | D] } | t | οΏ½ N} q
W| S( Ni ( t hash( R R R% ( ( s /usr/lib64/python2.7/sets.pyt
_compute_hashJ s
c C s9 | j } t | t οΏ½ r, | j | j οΏ½ d St } t | οΏ½ t t t f k rοΏ½ t | οΏ½ } xοΏ½ t rοΏ½ y# x | D] } | | | <ql Wd SWq\ t
k
rοΏ½ t | d d οΏ½ } | d k rοΏ½ οΏ½ n | | | οΏ½ <q\ Xq\ Wnd xa | D]Y } y | | | <WqοΏ½ t
k
r0t | d d οΏ½ } | d k r οΏ½ n | | | οΏ½ <qοΏ½ XqοΏ½ Wd S( Nt __as_immutable__(
R R R R R t typet listt tuplet xranget iterR R9 R: ( R t iterableR# R$ t itR; R< ( ( s /usr/lib64/python2.7/sets.pyR* U s2
N(% R t
__module__t __doc__t __slots__R
R R t __str__R R
R R R R R t __copy__R& R) R( R, R+ R2 R1 R7 R6 R- R> R? t __le__t __ge__R@ RA R: t __hash__R= RC R* ( ( ( s /usr/lib64/python2.7/sets.pyR A sB
c B s> e Z d Z d g Z d d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z RS( s Immutable set class.t _hashcodec C s2 d | _ i | _ | d k r. | j | οΏ½ n d S( s5 Construct an immutable set from an optional iterable.N( R: RT R R* ( R RJ ( ( s /usr/lib64/python2.7/sets.pyR
οΏ½ s c C s( | j d k r! | j οΏ½ | _ n | j S( N( RT R: RC ( R ( ( s /usr/lib64/python2.7/sets.pyRS οΏ½ s c C s | j | j f S( N( R RT ( R ( ( s /usr/lib64/python2.7/sets.pyt __getstate__οΏ½ s c C s | \ | _ | _ d S( N( R RT ( R t state( ( s /usr/lib64/python2.7/sets.pyt __setstate__οΏ½ s N( R RL RM RN R: R
RS RU RW ( ( ( s /usr/lib64/python2.7/sets.pyR z s c B sοΏ½ e Z d Z g Z d d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z
d οΏ½ Z d οΏ½ Z d οΏ½ Z
d
οΏ½ Z d οΏ½ Z d οΏ½ Z d
οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z d οΏ½ Z RS( s Mutable set class.c C s) i | _ | d k r% | j | οΏ½ n d S( s* Construct a set from an optional iterable.N( R R: R* ( R RJ ( ( s /usr/lib64/python2.7/sets.pyR
οΏ½ s c C s
| j f S( N( R ( R ( ( s /usr/lib64/python2.7/sets.pyRU οΏ½ s c C s | \ | _ d S( N( R ( R R# ( ( s /usr/lib64/python2.7/sets.pyRW οΏ½ s c C s$ | j | οΏ½ | j j | j οΏ½ | S( s2 Update a set with the union of itself and another.( R= R R ( R R ( ( s /usr/lib64/python2.7/sets.pyt __ior__οΏ½ s
c C s | j | οΏ½ d S( s2 Update a set with the union of itself and another.N( R* ( R R ( ( s /usr/lib64/python2.7/sets.pyt union_updateοΏ½ s c C s! | j | οΏ½ | | @j | _ | S( s9 Update a set with the intersection of itself and another.( R= R ( R R ( ( s /usr/lib64/python2.7/sets.pyt __iand__οΏ½ s
c C s5 t | t οΏ½ r | | M} n | j | οΏ½ j | _ d S( s9 Update a set with the intersection of itself and another.N( R R R+ R ( R R ( ( s /usr/lib64/python2.7/sets.pyt intersection_updateοΏ½ s
c C s | j | οΏ½ | j | οΏ½ | S( sA Update a set with the symmetric difference of itself and another.( R= t symmetric_difference_update( R R ( ( s /usr/lib64/python2.7/sets.pyt __ixor__οΏ½ s
c C s{ | j } t } t | t οΏ½ s- t | οΏ½ } n | | k rF | j οΏ½ n x. | D]& } | | k ri | | =qM | | | <qM Wd S( sA Update a set with the symmetric difference of itself and another.N( R R R R R t clear( R R R# R$ R% ( ( s /usr/lib64/python2.7/sets.pyR\ οΏ½ s
c C s | j | οΏ½ | j | οΏ½ | S( s1 Remove all elements of another set from this set.( R= t difference_update( R R ( ( s /usr/lib64/python2.7/sets.pyt __isub__οΏ½ s
c C sh | j } t | t οΏ½ s' t | οΏ½ } n | | k r@ | j οΏ½ n x! t | j | οΏ½ D]
} | | =qS Wd S( s1 Remove all elements of another set from this set.N( R R R R R^ R R- ( R R R# R% ( ( s /usr/lib64/python2.7/sets.pyR_ οΏ½ s
c C s | j | οΏ½ d S( s9 Add all values from an iterable (such as a list or file).N( R* ( R RJ ( ( s /usr/lib64/python2.7/sets.pyR οΏ½ s c C s | j j οΏ½ d S( s" Remove all elements from this set.N( R R^ ( R ( ( s /usr/lib64/python2.7/sets.pyR^ οΏ½ s c C s] y t | j | <WnE t k
rX t | d d οΏ½ } | d k rE οΏ½ n t | j | οΏ½ <n Xd S( s` Add an element to a set.
This has no effect if the element is already present.
RD N( R R R R9 R: ( R R; R< ( ( s /usr/lib64/python2.7/sets.pyt addοΏ½ s
c C sW y | j | =WnB t k
rR t | d d οΏ½ } | d k rB οΏ½ n | j | οΏ½ =n Xd S( sv Remove an element from a set; it must be a member.
If the element is not a member, raise a KeyError.
R8 N( R R R9 R: ( R R; R< ( ( s /usr/lib64/python2.7/sets.pyt remove s
c C s) y | j | οΏ½ Wn t k
r$ n Xd S( sm Remove an element from a set if it is a member.
If the element is not a member, do nothing.
N( Rb t KeyError( R R; ( ( s /usr/lib64/python2.7/sets.pyt discard
s
c C s | j j οΏ½ d S( s+ Remove and return an arbitrary set element.i ( R t popitem( R ( ( s /usr/lib64/python2.7/sets.pyt pop s c C s
t | οΏ½ S( N( R ( R ( ( s /usr/lib64/python2.7/sets.pyRD s c C s
t | οΏ½ S( N( t _TemporarilyImmutableSet( R ( ( s /usr/lib64/python2.7/sets.pyR8 s N( R RL RM RN R: R
RU RW RX RY RZ R[ R] R\ R` R_ R R^ Ra Rb Rd Rf RD R8 ( ( ( s /usr/lib64/python2.7/sets.pyR οΏ½ s*
Rg c B s e Z d οΏ½ Z d οΏ½ Z RS( c C s | | _ | j | _ d S( N( t _setR ( R t set( ( s /usr/lib64/python2.7/sets.pyR
( s c C s
| j j οΏ½ S( N( Rh RC ( R ( ( s /usr/lib64/python2.7/sets.pyRS , s ( R RL R
RS ( ( ( s /usr/lib64/python2.7/sets.pyRg $ s (
RM t itertoolsR R t __all__t warningst warnt DeprecationWarningt objectR R R Rg ( ( ( s /usr/lib64/python2.7/sets.pyt <module>) s οΏ½ :οΏ½