ACC SHELL
Ñò
o ÄMc @ s' d Z d d k l Z y d d k l Z l Z Wng e j
o[ d „ Z d „ Z y e e f Wn1 e j
o% d d j d d j f \ Z Z n Xn Xd d d g Z
d d
k Z e i 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
generators( t ifiltert ifilterfalsec c sE | d j o
d „ } n x$ | D] } | | ƒ o | Vq! q! Wd S( Nc S s | S( N( ( t x( ( s /usr/lib/python2.6/sets.pyt predicate@ s ( t None( R t iterableR ( ( s /usr/lib/python2.6/sets.pyR > s
c c sE | d j o
d „ } n x$ | D] } | | ƒ p | Vq! q! Wd S( Nc S s | S( N( ( R ( ( s /usr/lib/python2.6/sets.pyR G s ( R ( R R R ( ( s /usr/lib/python2.6/sets.pyR E s
i t 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" RS( s1 Common base class for mutable and immutable sets.t _datac C s! | i t j o
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/lib/python2.6/sets.pyt __init__^ s c C s
t | i ƒ S( s' Return the number of elements of a set.( t lenR ( R ( ( s /usr/lib/python2.6/sets.pyt __len__g s c C s
| i ƒ S( se Return string representation of a set.
This looks like 'Set([<list of elements>])'.
( t _repr( R ( ( s /usr/lib/python2.6/sets.pyt __repr__k s c C s8 | i i ƒ } | o | i ƒ n d | i i | f S( Ns %s(%r)( R t keyst sortR t __name__( R t sortedt elements( ( s /usr/lib/python2.6/sets.pyR u s c C s
| i i ƒ 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/lib/python2.6/sets.pyt __iter__{ s c C s
t d ‚ d S( Ns can't compare sets using cmp()( R
( R t other( ( s /usr/lib/python2.6/sets.pyt __cmp__‡ s c C s) t | t ƒ o | i | i j St Sd S( N( t
isinstanceR R t False( R R ( ( s /usr/lib/python2.6/sets.pyt __eq__™ s c C s) t | t ƒ o | i | i j St Sd S( N( R R R t True( R R ( ( s /usr/lib/python2.6/sets.pyt __ne__Ÿ s c C s# | i ƒ } | i i | i ƒ | S( s Return a shallow copy of a set.( R R t update( R t result( ( s /usr/lib/python2.6/sets.pyt copy§ s c C sc d d k l } | i ƒ } | | t | ƒ <| i } 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/lib/python2.6/sets.pyt __deepcopy__¯ s c C s" t | t ƒ p t S| i | ƒ 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/lib/python2.6/sets.pyt __or__È s c C s | i | ƒ } | i | ƒ | 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/lib/python2.6/sets.pyR- Ñ s
c C s" t | t ƒ p t S| i | ƒ 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/lib/python2.6/sets.pyt __and__Ú s c C sy t | t ƒ p t | ƒ } n t | ƒ t | ƒ j o | | } } n | | } } t | i i | ƒ } | i | ƒ 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 has_keyR ( R R t littlet bigt common( ( s /usr/lib/python2.6/sets.pyR0 ã s
c C s" t | t ƒ p t S| i | ƒ 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/lib/python2.6/sets.pyt __xor__ñ s c C s¨ | i ƒ } | i } t } | i } y
| i } Wn" t j
o t | ƒ i } n Xx$ t | i | ƒ D] } | | | <qi Wx$ t | i | ƒ 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 R2 ( R R R# R( R) t selfdatat otherdataR* ( ( s /usr/lib/python2.6/sets.pyR6 ú s
c C s" t | t ƒ p t S| i | ƒ 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/lib/python2.6/sets.pyt __sub__
s c C sx | i ƒ } | i } y
| i } Wn" t j
o t | ƒ i } n Xt } x$ t | i | ƒ 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 R8 R R R R2 ( R R R# R( R: R) R* ( ( s /usr/lib/python2.6/sets.pyR; s
c C s^ y | | i j SWnF t j
o: t | d d ƒ } | d j o ‚ n | ƒ | i j 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 getattrR ( R t elementt transform( ( s /usr/lib/python2.6/sets.pyt __contains__( s
c C sP | i | ƒ t | ƒ t | ƒ j o t Sx t | i i | ƒ D] } t SWt S( s- Report whether another set contains this set.( t _binary_sanity_checkR R R R R2 R ( R R R* ( ( s /usr/lib/python2.6/sets.pyt issubset7 s
c C sP | i | ƒ t | ƒ t | ƒ j o t Sx t | i i | ƒ D] } t SWt S( s- Report whether this set contains another set.( RB R R R R R2 R ( R R R* ( ( s /usr/lib/python2.6/sets.pyt
issuperset@ s
c C s3 | i | ƒ t | ƒ t | ƒ j o
| i | ƒ S( N( RB R RC ( R R ( ( s /usr/lib/python2.6/sets.pyt __lt__M s
c C s3 | i | ƒ t | ƒ t | ƒ j o
| i | ƒ S( N( RB R RD ( R R ( ( s /usr/lib/python2.6/sets.pyt __gt__Q s
c C s! t | t ƒ p
t d ‚ n d S( Ns, Binary operation only permitted between sets( R R R
( R R ( ( s /usr/lib/python2.6/sets.pyRB W s c C s+ d } x | D] } | t | ƒ N} q
W| S( Ni ( t hash( R R# R* ( ( s /usr/lib/python2.6/sets.pyt
_compute_hash] s
c C sG | i } t | t ƒ o | i | i ƒ d St } t | ƒ t t t f j o‹ t | ƒ } xä t op y# x | D] } | | | <qp Wd SWq_ t
j
o: t | d d ƒ } | d j o ‚ n | | | ƒ <q_ Xq_ Wni xe | D]] } y | | | <Wqâ t
j
o: t | d d ƒ } | d j o ‚ n | | | ƒ <qâ Xqâ Wd S( Nt __as_immutable__(
R R R R" R t typet listt tuplet xranget iterR
R> R ( R R R( R) t itR? R@ ( ( s /usr/lib/python2.6/sets.pyR/ h s8
(# R t
__module__t __doc__t __slots__R R R t __str__R R R R R R! R$ t __copy__R+ R. R- R1 R0 R7 R6 R< R; RA RC RD t __le__t __ge__RE RF RB RH R/ ( ( ( s /usr/lib/python2.6/sets.pyR W s@
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 s4 d | _ h | _ | d j o | i | ƒ n d S( s5 Construct an immutable set from an optional iterable.N( R RW R R/ ( R R ( ( s /usr/lib/python2.6/sets.pyR ” s
c C s* | i d j o | i ƒ | _ n | i S( N( RW R RH ( R ( ( s /usr/lib/python2.6/sets.pyt __hash__› s c C s | i | i f S( N( R RW ( R ( ( s /usr/lib/python2.6/sets.pyt __getstate__ s c C s | \ | _ | _ d S( N( R RW ( R t state( ( s /usr/lib/python2.6/sets.pyt __setstate__£ s N( R RP RQ RR R R RX RY R[ ( ( ( s /usr/lib/python2.6/sets.pyR 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 d „ Z RS( s Mutable set class.c C s+ h | _ | d j o | i | ƒ n d S( s* Construct a set from an optional iterable.N( R R R/ ( R R ( ( s /usr/lib/python2.6/sets.pyR s
c C s
| i f S( N( R ( R ( ( s /usr/lib/python2.6/sets.pyRY ³ s c C s | \ | _ d S( N( R ( R R( ( ( s /usr/lib/python2.6/sets.pyR[ · s c C s$ | i | ƒ | i i | i ƒ | S( s2 Update a set with the union of itself and another.( RB R R" ( R R ( ( s /usr/lib/python2.6/sets.pyt __ior__Â s
c C s | i | ƒ d S( s2 Update a set with the union of itself and another.N( R/ ( R R ( ( s /usr/lib/python2.6/sets.pyt union_updateÈ s c C s! | i | ƒ | | @i | _ | S( s9 Update a set with the intersection of itself and another.( RB R ( R R ( ( s /usr/lib/python2.6/sets.pyt __iand__Ì s
c C s7 t | t ƒ o | | M} n | i | ƒ i | _ d S( s9 Update a set with the intersection of itself and another.N( R R R0 R ( R R ( ( s /usr/lib/python2.6/sets.pyt intersection_updateÒ s c C s | i | ƒ | i | ƒ | S( sA Update a set with the symmetric difference of itself and another.( RB t symmetric_difference_update( R R ( ( s /usr/lib/python2.6/sets.pyt __ixor__Ù s
c C s | i } t } t | t ƒ p t | ƒ } n | | j o | i ƒ n x0 | D]( } | | j o | | =qQ | | | <qQ 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/lib/python2.6/sets.pyR` ß s
c C s | i | ƒ | i | ƒ | S( s1 Remove all elements of another set from this set.( RB t difference_update( R R ( ( s /usr/lib/python2.6/sets.pyt __isub__í s
c C sl | i } t | t ƒ p t | ƒ } n | | j o | i ƒ n x! t | i | ƒ D]
} | | =qW Wd S( s1 Remove all elements of another set from this set.N( R R R R Rb R R2 ( R R R( R* ( ( s /usr/lib/python2.6/sets.pyRc ó s
c C s | i | ƒ d S( s9 Add all values from an iterable (such as a list or file).N( R/ ( R R ( ( s /usr/lib/python2.6/sets.pyR" ÿ s c C s | i i ƒ d S( s" Remove all elements from this set.N( R Rb ( R ( ( s /usr/lib/python2.6/sets.pyRb s c C sa y t | i | <WnI t j
o= t | d d ƒ } | d j o ‚ n t | i | ƒ <n Xd S( s` Add an element to a set.
This has no effect if the element is already present.
RI N( R R R
R> R ( R R? R@ ( ( s /usr/lib/python2.6/sets.pyt add s
c C s[ y | i | =WnF t j
o: t | d d ƒ } | d j o ‚ n | i | ƒ =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.
R= N( R R
R> R ( R R? R@ ( ( s /usr/lib/python2.6/sets.pyt remove s
c C s+ y | i | ƒ Wn t j
o 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( Rf t KeyError( R R? ( ( s /usr/lib/python2.6/sets.pyt discard# s c C s | i i ƒ d S( s+ Remove and return an arbitrary set element.i ( R t popitem( R ( ( s /usr/lib/python2.6/sets.pyt pop- s c C s
t | ƒ S( N( R ( R ( ( s /usr/lib/python2.6/sets.pyRI 1 s c C s
t | ƒ S( N( t _TemporarilyImmutableSet( R ( ( s /usr/lib/python2.6/sets.pyR= 5 s N( R RP RQ RR R R RY R[ RX R\ R] R^ R_ Ra R` Rd Rc R" Rb Re Rf Rh Rj RI R= ( ( ( s /usr/lib/python2.6/sets.pyR ¦ s,
Rk c B s e Z d „ Z d „ Z RS( c C s | | _ | i | _ d S( N( t _setR ( R t set( ( s /usr/lib/python2.6/sets.pyR > s c C s
| i i ƒ S( N( Rl RH ( R ( ( s /usr/lib/python2.6/sets.pyRX B s ( R RP R RX ( ( ( s /usr/lib/python2.6/sets.pyRk : s ( RQ t
__future__R t itertoolsR R t ImportErrorR R t NameErrort __all__t warningst warnt DeprecationWarningt objectR R R Rk ( ( ( s /usr/lib/python2.6/sets.pyt <module>) s& ( ÿ 7”
ACC SHELL 2018