ó EÑÕfc@s©dZddlmZmZdddgZddlZejdedd ƒdefd „ƒYZ de fd „ƒYZ de fd „ƒYZ d e fd„ƒYZ dS(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ÿÿÿÿ(tifiltert ifilterfalsetBaseSettSett ImmutableSetNsthe sets module is deprecatedt stacklevelicBs"eZdZdgZd„Zd„Zd„ZeZed„Z d„Z d„Z d„Z d „Z d „ZeZd „Zd „Zd „Zd„Zd„Zd„Zd„Zd„Zd„Zd„Zd„Zd„ZeZeZd„Zd„ZdZ!d„Z"d„Z#d„Z$RS(s1Common base class for mutable and immutable sets.t_datacCs|jtkrtd‚ndS(sThis is an abstract class.s7BaseSet is an abstract class. Use Set or ImmutableSet.N(t __class__Rt TypeError(tself((s/usr/lib64/python2.7/sets.pyt__init__HscCs t|jƒS(s'Return the number of elements of a set.(tlenR(R ((s/usr/lib64/python2.7/sets.pyt__len__QscCs |jƒS(seReturn string representation of a set. This looks like 'Set([])'. (t_repr(R ((s/usr/lib64/python2.7/sets.pyt__repr__UscCs6|jjƒ}|r"|jƒnd|jj|fS(Ns%s(%r)(RtkeystsortRt__name__(R tsortedtelements((s/usr/lib64/python2.7/sets.pyR _s cCs |jjƒS(ssReturn an iterator over the elements or a set. This is the keys iterator for the underlying dict. (Rtiterkeys(R ((s/usr/lib64/python2.7/sets.pyt__iter__escCs td‚dS(Nscan't compare sets using cmp()(R(R tother((s/usr/lib64/python2.7/sets.pyt__cmp__qscCs't|tƒr|j|jkStSdS(N(t isinstanceRRtFalse(R R((s/usr/lib64/python2.7/sets.pyt__eq__ƒscCs't|tƒr|j|jkStSdS(N(RRRtTrue(R R((s/usr/lib64/python2.7/sets.pyt__ne__‰scCs#|jƒ}|jj|jƒ|S(sReturn a shallow copy of a set.(RRtupdate(R tresult((s/usr/lib64/python2.7/sets.pytcopy‘s cCscddlm}|jƒ}||t|ƒ<|j}t}x!|D]}|||||ƒ(R R((s/usr/lib64/python2.7/sets.pyt__lt__7s cCs2|j|ƒt|ƒt|ƒko1|j|ƒS(N(R=R R?(R R((s/usr/lib64/python2.7/sets.pyt__gt__;s cCst|tƒstd‚ndS(Ns,Binary operation only permitted between sets(RRR(R R((s/usr/lib64/python2.7/sets.pyR=DscCs+d}x|D]}|t|ƒN}q W|S(Ni(thash(R RR%((s/usr/lib64/python2.7/sets.pyt _compute_hashJs cCs9|j}t|tƒr,|j|jƒdSt}t|ƒtttfkrÑt |ƒ}xÙtrÍy#x|D]}|||R?t__le__t__ge__R@RAR:t__hash__R=RCR*(((s/usr/lib64/python2.7/sets.pyRAsB                  cBs>eZdZdgZdd„Zd„Zd„Zd„ZRS(sImmutable set class.t _hashcodecCs2d|_i|_|dk r.|j|ƒndS(s5Construct an immutable set from an optional iterable.N(R:RTRR*(R RJ((s/usr/lib64/python2.7/sets.pyR s   cCs(|jdkr!|jƒ|_n|jS(N(RTR:RC(R ((s/usr/lib64/python2.7/sets.pyRSˆscCs|j|jfS(N(RRT(R ((s/usr/lib64/python2.7/sets.pyt __getstate__scCs|\|_|_dS(N(RRT(R tstate((s/usr/lib64/python2.7/sets.pyt __setstate__sN( RRLRMRNR:R RSRURW(((s/usr/lib64/python2.7/sets.pyRzs     cBsÂeZdZgZdd„Zd„Zd„Zd„Zd„Z d„Z d„Z d„Z d „Z d „Zd „Zd „Zd „Zd„Zd„Zd„Zd„Zd„Zd„ZRS(s Mutable set class.cCs)i|_|dk r%|j|ƒndS(s*Construct a set from an optional iterable.N(RR:R*(R RJ((s/usr/lib64/python2.7/sets.pyR šs  cCs |jfS(N(R(R ((s/usr/lib64/python2.7/sets.pyRU scCs|\|_dS(N(R(R R#((s/usr/lib64/python2.7/sets.pyRW¤scCs$|j|ƒ|jj|jƒ|S(s2Update a set with the union of itself and another.(R=RR(R R((s/usr/lib64/python2.7/sets.pyt__ior__¬s cCs|j|ƒdS(s2Update a set with the union of itself and another.N(R*(R R((s/usr/lib64/python2.7/sets.pyt union_update²scCs!|j|ƒ||@j|_|S(s9Update a set with the intersection of itself and another.(R=R(R R((s/usr/lib64/python2.7/sets.pyt__iand__¶s cCs5t|tƒr||M}n|j|ƒj|_dS(s9Update a set with the intersection of itself and another.N(RRR+R(R R((s/usr/lib64/python2.7/sets.pytintersection_update¼s cCs|j|ƒ|j|ƒ|S(sAUpdate a set with the symmetric difference of itself and another.(R=tsymmetric_difference_update(R R((s/usr/lib64/python2.7/sets.pyt__ixor__Ãs  cCs{|j}t}t|tƒs-t|ƒ}n||krF|jƒnx.|D]&}||kri||=qM|||)s ÿ:‘