Tryag File Manager
Home
-
Turbo Force
Current Path :
/
usr
/
lib
/
python2.4
/
Upload File :
New :
File
Dir
//usr/lib/python2.4/sets.pyc
mò ‚=5Dc @ sÿ d Z d k l Z y 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 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'. ( s generators( s ifilters ifilterfalsec c sD | d j o d „ } n x# | D] } | | ƒ o | Vq! q! Wd S( Nc C s | S( N( t x( R ( ( t /usr/lib/python2.4/sets.pyt predicate@ s ( R t Nonet iterableR ( R R R ( ( R t ifilter> s c c sD | d j o d „ } n x# | D] } | | ƒ p | Vq! q! Wd S( Nc C s | S( N( R ( R ( ( R R G s ( R R R R ( R R R ( ( R t ifilterfalseE s i t BaseSett Sett ImmutableSetc B s t 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 selft __class__R t TypeError( R ( ( R t __init__Z s c C s t | i ƒ S( s' Return the number of elements of a set.N( t lenR R ( R ( ( R t __len__c s c C s | i ƒ S( se Return string representation of a set. This looks like 'Set([<list of elements>])'. N( R t _repr( R ( ( R t __repr__g s c C s8 | i i ƒ } | o | i ƒ n d | i i | f S( Ns %s(%r)( R R t keyst elementst sortedt sortR t __name__( R R R ( ( R R q 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. N( R R t iterkeys( R ( ( R t __iter__w s c C s t d ‚ d S( Ns can't compare sets using cmp()( R ( R t other( ( R t __cmp__ƒ s c C s, t | t ƒ o | i | i j Sn t Sd S( N( t isinstanceR R R R t False( R R ( ( R t __eq__• s c C s, t | t ƒ o | i | i j Sn t Sd S( N( R R R R R t True( R R ( ( R t __ne__› s c C s# | i ƒ } | i i | i ƒ | S( s Return a shallow copy of a set.N( R R t resultR t update( R R! ( ( R t copy£ s c C s` d k l } | i ƒ } | | t | ƒ <| i } t } x! | D] } | | | | | ƒ <q? W| S( s1 Return a deep copy of a set; used by copy module.( s deepcopyN( R# t deepcopyR R R! t memot idR t dataR t valuet elt( R R% R( R! R$ R' R) ( ( R t __deepcopy__« s c C s% t | t ƒ p t Sn | i | ƒ S( sh Return the union of two sets as a new set. (I.e. all elements that are in either set.) N( R R R t NotImplementedR t union( R R ( ( R t __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.) N( R R R! t _updateR ( R R R! ( ( R R, Í s c C s% t | t ƒ p t Sn | i | ƒ S( sn Return the intersection of two sets as a new set. (I.e. all elements that are in both sets.) N( R R R R+ R t intersection( R R ( ( R t __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.) N( R R R R R R t littlet bigR R t has_keyt commonR ( R R R1 R2 R4 ( ( R R/ ß s c C s% t | t ƒ p t Sn | 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.) N( R R R R+ R t symmetric_difference( R R ( ( R t __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.) N( R R R! R R' R R( t selfdataR t otherdatat AttributeErrorR R R3 R) ( R R R' R( R8 R! R7 R) ( ( R R5 ö s c C s% t | t ƒ p t Sn | 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.) N( R R R R+ R t difference( R R ( ( R t __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.) N( R R R! R R' R R8 R9 R R R( R R3 R) ( R R R' R( R8 R! R) ( ( R R: s c C sa y | | i j SWnI t j o= t | d d ƒ } | d j o ‚ n | ƒ | i j Sn Xd 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( t elementR R R t getattrR t transform( R R= R? ( ( R t __contains__$ s c C sV | i | ƒ t | ƒ t | ƒ j o t Sn x! t | i i | ƒ D] } t SqD Wt S( s- Report whether another set contains this set.N( R t _binary_sanity_checkR R R R R R3 R) R ( R R R) ( ( R t issubset3 s c C sV | i | ƒ t | ƒ t | ƒ j o t Sn x! t | i i | ƒ D] } t SqD Wt S( s- Report whether this set contains another set.N( R RA R R R R R R3 R) R ( R R R) ( ( R t issuperset< s c C s3 | i | ƒ t | ƒ t | ƒ j o | i | ƒ S( N( R RA R R RB ( R R ( ( R t __lt__I s c C s3 | i | ƒ t | ƒ t | ƒ j o | i | ƒ S( N( R RA R R RC ( R R ( ( R t __gt__M s c C s! t | t ƒ p t d ‚ n d S( Ns, Binary operation only permitted between sets( R R R R ( R R ( ( R RA S s c C s+ d } x | D] } | t | ƒ N} q W| S( Ni ( R! R R) t hash( R R! R) ( ( R t _compute_hashY s c C sJ | i } t | t ƒ o | i | i ƒ d Sn t } t | ƒ t t t f j o‹ t | ƒ } xä t op y# x | D] } | | | <qs Wd SWqb t j o: t | d d ƒ } | d j o ‚ n | | | ƒ <qb Xqb 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 R R" R R( t typet listt tuplet xranget itert itR= R R> R R? ( R R R? RN R( R= R' ( ( R R. d 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, R0 R/ R6 R5 R; R: R@ RB RC t __le__t __ge__RD RE RA RG R. ( ( ( R R S s@ c B s> t Z d Z d g Z e 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 R RV R R R. ( R R ( ( R R s c C s* | i d j o | i ƒ | _ n | i S( N( R RV R RG ( R ( ( R t __hash__— s c C s | i | i f S( N( R R RV ( R ( ( R t __getstate__œ s c C s | \ | _ | _ d S( N( t stateR R RV ( R RY ( ( R t __setstate__Ÿ s ( R RO RP RQ R R RW RX RZ ( ( ( R R ‰ s c B sË t Z d Z g Z e 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. ( R R ( ( R R © s c C s | i f S( N( R R ( R ( ( R RX ¯ s c C s | \ | _ d S( N( R' R R ( R R' ( ( R RZ ³ s c C s t d ‚ d S( s A Set cannot be hashed.s' Can't hash a Set, only an ImmutableSet.N( R ( R ( ( R RW ¶ s c C s$ | i | ƒ | i i | i ƒ | S( s2 Update a set with the union of itself and another.N( R RA R R R" ( R R ( ( R t __ior__À s c C s | i | ƒ d S( s2 Update a set with the union of itself and another.N( R R. R ( R R ( ( R t union_updateÆ s c C s! | i | ƒ | | @i | _ | S( s9 Update a set with the intersection of itself and another.N( R RA R R ( R R ( ( R t __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 R R R/ R ( R R ( ( R t intersection_updateÐ s c C s | i | ƒ | i | ƒ | S( sA Update a set with the symmetric difference of itself and another.N( R RA R t symmetric_difference_update( R R ( ( R t __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( R R R R t clearR) ( R R R' R( R) ( ( R R_ Ý s c C s | i | ƒ | i | ƒ | S( s1 Remove all elements of another set from this set.N( R RA R t difference_update( R R ( ( R t __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 R R R Ra R R3 R) ( R R R' R) ( ( R Rb ñ s c C s | i | ƒ d S( s9 Add all values from an iterable (such as a list or file).N( R R. R ( R R ( ( R R" ý s c C s | i i ƒ d S( s" Remove all elements from this set.N( R R Ra ( R ( ( R Ra 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. RH N( R R R R= R R> R R? ( R R= R? ( ( R t 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? ( R R= R? ( ( R t 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( R Re R= t KeyError( R R= ( ( R t discard! s c C s | i i ƒ d S( s+ Remove and return an arbitrary set element.i N( R R t popitem( R ( ( R t pop+ s c C s t | ƒ S( N( R R ( R ( ( R RH / s c C s t | ƒ S( N( t _TemporarilyImmutableSetR ( R ( ( R R< 3 s ( R RO RP RQ R R RX RZ RW R[ R\ R] R^ R` R_ Rc Rb R" Ra Rd Re Rg Ri RH R< ( ( ( R R ¢ s, Rj c B s t Z d „ Z d „ Z RS( Nc C s | | _ | i | _ d S( N( t setR t _setR ( R Rk ( ( R R < s c C s | i i ƒ S( N( R Rl RG ( R ( ( R RW @ s ( R RO R RW ( ( ( R Rj 8 s N( RP t __future__t generatorst itertoolsR R t ImportErrorR R t NameErrort __all__t objectR R R Rj ( R R R R R Rr Rj R Rn R ( ( R t ?) s (ÿ 7–