ó õ^‚Rc@sIdZddlmZmZddlZdddddd d d d d ddddddgZd„Zdd%d„ƒYZdd&d„ƒYZej e ƒdefd„ƒYZ dd'd„ƒYZ dd(d„ƒYZ d d)d„ƒYZd e ee fd„ƒYZej eƒd efd„ƒYZej eƒd e ee fd„ƒYZde fd„ƒYZdeefd„ƒYZdeefd „ƒYZdefd!„ƒYZd efd"„ƒYZej eƒde ee fd#„ƒYZej eƒej eƒej eƒej eƒdefd$„ƒYZej e ƒdS(*sAbstract Base Classes (ABCs) for collections, according to PEP 3119. DON'T USE THIS MODULE DIRECTLY! The classes here should be imported via collections; they are defined here only to alleviate certain bootstrapping issues. Unit tests are in test_collections. iÿÿÿÿ(tABCMetatabstractmethodNtHashabletIterabletIteratortSizedt ContainertCallabletSett MutableSettMappingtMutableMappingt MappingViewtKeysViewt ItemsViewt ValuesViewtSequencetMutableSequencecsCy!t‡fd†|jDƒƒSWntk r>t|ˆƒSXdS(Nc3s|]}ˆ|jkVqdS(N(t__dict__(t.0tB(tattr(s/usr/lib/python2.7/_abcoll.pys s(tanyt__mro__tAttributeErrorthasattr(tCR((Rs/usr/lib/python2.7/_abcoll.pyt_hasattrs! cBs,eZeZed„ƒZed„ƒZRS(cCsdS(Ni((tself((s/usr/lib/python2.7/_abcoll.pyt__hash__#scCsy|tkruy<x5|jD]*}d|jkr|jdr?tSPqqWWqutk rqt|ddƒrrtSquXntS(NR(RRRtTrueRtgetattrtNonetNotImplemented(tclsRR((s/usr/lib/python2.7/_abcoll.pyt__subclasshook__'s     (t__name__t __module__Rt __metaclass__RRt classmethodR#(((s/usr/lib/python2.7/_abcoll.pyR scBs,eZeZed„ƒZed„ƒZRS(ccsxtrdVqWdS(N(tFalseR (R((s/usr/lib/python2.7/_abcoll.pyt__iter__:s cCs&|tkr"t|dƒr"tSntS(NR)(RRRR!(R"R((s/usr/lib/python2.7/_abcoll.pyR#?s (R$R%RR&RR)R'R#(((s/usr/lib/python2.7/_abcoll.pyR7scBs/eZed„ƒZd„Zed„ƒZRS(cCs t‚dS(sKReturn the next item from the iterator. When exhausted, raise StopIterationN(t StopIteration(R((s/usr/lib/python2.7/_abcoll.pytnextKscCs|S(N((R((s/usr/lib/python2.7/_abcoll.pyR)PscCs5|tkr1t|dƒr1t|dƒr1tSntS(NR+R)(RRRR!(R"R((s/usr/lib/python2.7/_abcoll.pyR#Ss (R$R%RR+R)R'R#(((s/usr/lib/python2.7/_abcoll.pyRIs cBs,eZeZed„ƒZed„ƒZRS(cCsdS(Ni((R((s/usr/lib/python2.7/_abcoll.pyt__len__^scCs&|tkr"t|dƒr"tSntS(NR,(RRRR!(R"R((s/usr/lib/python2.7/_abcoll.pyR#bs (R$R%RR&RR,R'R#(((s/usr/lib/python2.7/_abcoll.pyR[scBs,eZeZed„ƒZed„ƒZRS(cCstS(N(R((Rtx((s/usr/lib/python2.7/_abcoll.pyt __contains__mscCs&|tkr"t|dƒr"tSntS(NR.(RRRR!(R"R((s/usr/lib/python2.7/_abcoll.pyR#qs (R$R%RR&RR.R'R#(((s/usr/lib/python2.7/_abcoll.pyRjscBs,eZeZed„ƒZed„ƒZRS(cOstS(N(R((Rtargstkwds((s/usr/lib/python2.7/_abcoll.pyt__call__|scCs&|tkr"t|dƒr"tSntS(NR1(RRRR!(R"R((s/usr/lib/python2.7/_abcoll.pyR#€s (R$R%RR&RR1R'R#(((s/usr/lib/python2.7/_abcoll.pyRyscBseZdZd„Zd„Zd„Zd„Zd„Zd„Ze d„ƒZ d„Z d „Z d „Z d „Zd „ZdZd „ZRS(shA set is a finite, iterable container. This class provides concrete generic implementations of all methods except for __contains__, __iter__ and __len__. 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. cCsTt|tƒstSt|ƒt|ƒkr/tSx|D]}||kr6tSq6WtS(N(t isinstanceRR!tlenR(R(Rtothertelem((s/usr/lib/python2.7/_abcoll.pyt__le__–s  cCs8t|tƒstSt|ƒt|ƒko7|j|ƒS(N(R2RR!R3R6(RR4((s/usr/lib/python2.7/_abcoll.pyt__lt__ scCst|tƒstS||kS(N(R2RR!(RR4((s/usr/lib/python2.7/_abcoll.pyt__gt__¥scCst|tƒstS||kS(N(R2RR!(RR4((s/usr/lib/python2.7/_abcoll.pyt__ge__ªscCs8t|tƒstSt|ƒt|ƒko7|j|ƒS(N(R2RR!R3R6(RR4((s/usr/lib/python2.7/_abcoll.pyt__eq__¯scCs ||k S(N((RR4((s/usr/lib/python2.7/_abcoll.pyt__ne__´scCs ||ƒS(s¼Construct an instance of the class from any iterable input. Must override this method if the class constructor signature does not accept an iterable for an input. ((R"tit((s/usr/lib/python2.7/_abcoll.pyt_from_iterable·scs0t|tƒstSˆj‡fd†|DƒƒS(Nc3s!|]}|ˆkr|VqdS(N((Rtvalue(R(s/usr/lib/python2.7/_abcoll.pys Ãs(R2RR!R=(RR4((Rs/usr/lib/python2.7/_abcoll.pyt__and__ÀscCs%x|D]}||krtSqWtS(s1Return True if two sets have a null intersection.(R(R(RR4R>((s/usr/lib/python2.7/_abcoll.pyt isdisjointÅs  cCs6t|tƒstSd„||fDƒ}|j|ƒS(Ncss"|]}|D] }|Vq qdS(N((Rtste((s/usr/lib/python2.7/_abcoll.pys Ïs(R2RR!R=(RR4tchain((s/usr/lib/python2.7/_abcoll.pyt__or__ÌscsQtˆtƒs4tˆtƒs"tS|jˆƒ‰n|j‡fd†|DƒƒS(Nc3s!|]}|ˆkr|VqdS(N((RR>(R4(s/usr/lib/python2.7/_abcoll.pys ×s(R2RRR!R=(RR4((R4s/usr/lib/python2.7/_abcoll.pyt__sub__Òs cCsDt|tƒs4t|tƒs"tS|j|ƒ}n||||BS(N(R2RRR!R=(RR4((s/usr/lib/python2.7/_abcoll.pyt__xor__Ús cCsÊtj}d|d}t|ƒ}d|d}||M}x>|D]6}t|ƒ}|||d>AdAdN}||M}qBW|dd}||M}||kr±||d8}n|d krÆd }n|S( s+Compute the hash value of a set. Note that we don't define __hash__: not all sets are hashable. But if you define a hashable set type, its __hash__ should call this function. This must be compatible __eq__. All sets ought to compare equal if they contain the same elements, regardless of how they are implemented, and regardless of the order of the elements; so there's not much freedom for __eq__ or __hash__. We match the algorithm used by the built-in frozenset type. iiiMïèrii³M[l×4~2iÍ iãÃ6iÿÿÿÿiÁÇ8#(tsystmaxintR3thash(RtMAXtMASKtnthR-thx((s/usr/lib/python2.7/_abcoll.pyt_hashäs          N(R$R%t__doc__R6R7R8R9R:R;R'R=R?R@RDRERFR RRO(((s/usr/lib/python2.7/_abcoll.pyR‹s           cBskeZdZed„ƒZed„ƒZd„Zd„Zd„Zd„Z d„Z d„Z d „Z RS( s‡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. cCs t‚dS(sAdd an element.N(tNotImplementedError(RR>((s/usr/lib/python2.7/_abcoll.pytaddscCs t‚dS(s8Remove an element. Do not raise an exception if absent.N(RQ(RR>((s/usr/lib/python2.7/_abcoll.pytdiscardscCs,||krt|ƒ‚n|j|ƒdS(s5Remove an element. If not a member, raise a KeyError.N(tKeyErrorRS(RR>((s/usr/lib/python2.7/_abcoll.pytremoves cCsGt|ƒ}yt|ƒ}Wntk r5t‚nX|j|ƒ|S(s2Return the popped value. Raise KeyError if empty.(titerR+R*RTRS(RR<R>((s/usr/lib/python2.7/_abcoll.pytpop#s    cCs3yxtr|jƒqWWntk r.nXdS(s6This is slow (creates N new iterators!) but effective.N(RRWRT(R((s/usr/lib/python2.7/_abcoll.pytclear-s   cCs"x|D]}|j|ƒqW|S(N(RR(RR<R>((s/usr/lib/python2.7/_abcoll.pyt__ior__5s cCs&x||D]}|j|ƒq W|S(N(RS(RR<R>((s/usr/lib/python2.7/_abcoll.pyt__iand__:scCsx||kr|jƒn[t|tƒs:|j|ƒ}nx7|D]/}||krc|j|ƒqA|j|ƒqAW|S(N(RXR2RR=RSRR(RR<R>((s/usr/lib/python2.7/_abcoll.pyt__ixor__?s    cCs;||kr|jƒnx|D]}|j|ƒq W|S(N(RXRS(RR<R>((s/usr/lib/python2.7/_abcoll.pyt__isub__Ls    ( R$R%RPRRRRSRURWRXRYRZR[R\(((s/usr/lib/python2.7/_abcoll.pyR s      cBs€eZdZed„ƒZd d„Zd„Zd„Zd„Z d„Z d„Z d„Z d „Z d Zd „Zd „ZRS( sÇA Mapping is a generic container for associating key/value pairs. This class provides concrete generic implementations of all methods except for __getitem__, __iter__, and __len__. cCs t‚dS(N(RT(Rtkey((s/usr/lib/python2.7/_abcoll.pyt __getitem__dscCs%y ||SWntk r |SXdS(s<D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.N(RT(RR]tdefault((s/usr/lib/python2.7/_abcoll.pytgeths  cCs)y ||Wntk r tSXtSdS(N(RTR(R(RR]((s/usr/lib/python2.7/_abcoll.pyR.os   cCs t|ƒS(s.D.iterkeys() -> an iterator over the keys of D(RV(R((s/usr/lib/python2.7/_abcoll.pytiterkeyswsccsx|D]}||VqWdS(s2D.itervalues() -> an iterator over the values of DN((RR]((s/usr/lib/python2.7/_abcoll.pyt itervalues{s ccs$x|D]}|||fVqWdS(s=D.iteritems() -> an iterator over the (key, value) items of DN((RR]((s/usr/lib/python2.7/_abcoll.pyt iteritems€s cCs t|ƒS(sD.keys() -> list of D's keys(tlist(R((s/usr/lib/python2.7/_abcoll.pytkeys…scCs!g|D]}|||f^qS(s8D.items() -> list of D's (key, value) pairs, as 2-tuples((RR]((s/usr/lib/python2.7/_abcoll.pytitems‰scCsg|D]}||^qS(s D.values() -> list of D's values((RR]((s/usr/lib/python2.7/_abcoll.pytvaluesscCs5t|tƒstSt|jƒƒt|jƒƒkS(N(R2R R!tdictRf(RR4((s/usr/lib/python2.7/_abcoll.pyR:”scCs ||k S(N((RR4((s/usr/lib/python2.7/_abcoll.pyR;™sN(R$R%RPRR^R R`R.RaRbRcReRfRgRR:R;(((s/usr/lib/python2.7/_abcoll.pyR Zs         cBs#eZd„Zd„Zd„ZRS(cCs ||_dS(N(t_mapping(Rtmapping((s/usr/lib/python2.7/_abcoll.pyt__init__žscCs t|jƒS(N(R3Ri(R((s/usr/lib/python2.7/_abcoll.pyR,¡scCs dj|ƒS(Ns&{0.__class__.__name__}({0._mapping!r})(tformat(R((s/usr/lib/python2.7/_abcoll.pyt__repr__¤s(R$R%RkR,Rm(((s/usr/lib/python2.7/_abcoll.pyR œs  cBs)eZed„ƒZd„Zd„ZRS(cCs t|ƒS(N(tset(RR<((s/usr/lib/python2.7/_abcoll.pyR=ªscCs ||jkS(N(Ri(RR]((s/usr/lib/python2.7/_abcoll.pyR.®sccsx|jD] }|Vq WdS(N(Ri(RR]((s/usr/lib/python2.7/_abcoll.pyR)±s(R$R%R'R=R.R)(((s/usr/lib/python2.7/_abcoll.pyR ¨s cBs)eZed„ƒZd„Zd„ZRS(cCs t|ƒS(N(Rn(RR<((s/usr/lib/python2.7/_abcoll.pyR=¸scCs@|\}}y|j|}Wntk r1tSX||kSdS(N(RiRTR((RtitemR]R>tv((s/usr/lib/python2.7/_abcoll.pyR.¼s   ccs*x#|jD]}||j|fVq WdS(N(Ri(RR]((s/usr/lib/python2.7/_abcoll.pyR)Ås(R$R%R'R=R.R)(((s/usr/lib/python2.7/_abcoll.pyR¶s cBseZd„Zd„ZRS(cCs/x(|jD]}||j|kr tSq WtS(N(RiRR((RR>R]((s/usr/lib/python2.7/_abcoll.pyR.Ìsccs$x|jD]}|j|Vq WdS(N(Ri(RR]((s/usr/lib/python2.7/_abcoll.pyR)Òs(R$R%R.R)(((s/usr/lib/python2.7/_abcoll.pyRÊs cBsheZdZed„ƒZed„ƒZeƒZed„Zd„Z d„Z d„Z dd„Z RS( sìA MutableMapping is a generic container for associating key/value pairs. This class provides concrete generic implementations of all methods except for __getitem__, __setitem__, __delitem__, __iter__, and __len__. cCs t‚dS(N(RT(RR]R>((s/usr/lib/python2.7/_abcoll.pyt __setitem__âscCs t‚dS(N(RT(RR]((s/usr/lib/python2.7/_abcoll.pyt __delitem__æscCsGy||}Wn'tk r7||jkr3‚n|SX||=|SdS(s©D.pop(k[,d]) -> v, remove specified key and return the corresponding value. If key is not found, d is returned if given, otherwise KeyError is raised. N(RTt_MutableMapping__marker(RR]R_R>((s/usr/lib/python2.7/_abcoll.pyRWìs cCsKytt|ƒƒ}Wntk r/t‚nX||}||=||fS(sƒD.popitem() -> (k, v), remove and return some (key, value) pair as a 2-tuple; but raise KeyError if D is empty. (R+RVR*RT(RR]R>((s/usr/lib/python2.7/_abcoll.pytpopitemús   cCs3yxtr|jƒqWWntk r.nXdS(s,D.clear() -> None. Remove all items from D.N(RRtRT(R((s/usr/lib/python2.7/_abcoll.pyRXs   cOs%t|ƒdkr0tdjt|ƒƒƒ‚n|sEtdƒ‚n|d}t|ƒdkrk|dnd}t|tƒr¢xw|D]}|||| None. Update D from mapping/iterable E and F. If E present and has a .keys() method, does: for k in E: D[k] = E[k] If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k, v in F.items(): D[k] = v is8update() takes at most 2 positional arguments ({} given)s,update() takes at least 1 argument (0 given)iiReN((R3t TypeErrorRlR2R RReRf(R/R0RR4R]R>((s/usr/lib/python2.7/_abcoll.pytupdates"  " cCs.y ||SWntk r)||| D.get(k,d), also set D[k]=d if k not in D(RT(RR]R_((s/usr/lib/python2.7/_abcoll.pyt setdefault(s   N(R$R%RPRRqRrtobjectRsRWRtRXRvR Rw(((s/usr/lib/python2.7/_abcoll.pyR ×s     cBsJeZdZed„ƒZd„Zd„Zd„Zd„Zd„Z RS(sŠAll the operations on a read-only sequence. Concrete subclasses must override __new__ or __init__, __getitem__, and __len__. cCs t‚dS(N(t IndexError(Rtindex((s/usr/lib/python2.7/_abcoll.pyR^=sccsId}y*x#tr.||}|V|d7}q WWntk rDdSXdS(Nii(RRy(RtiRp((s/usr/lib/python2.7/_abcoll.pyR)As   cCs%x|D]}||krtSqWtS(N(RR((RR>Rp((s/usr/lib/python2.7/_abcoll.pyR.Ks  ccs0x)ttt|ƒƒƒD]}||VqWdS(N(treversedtrangeR3(RR{((s/usr/lib/python2.7/_abcoll.pyt __reversed__QscCs7x*t|ƒD]\}}||kr |Sq Wt‚dS(s|S.index(value) -> integer -- return first index of value. Raises ValueError if the value is not present. N(t enumeratet ValueError(RR>R{Rp((s/usr/lib/python2.7/_abcoll.pyRzUs cst‡fd†|DƒƒS(sBS.count(value) -> integer -- return number of occurrences of valuec3s!|]}|ˆkrdVqdS(iN((RRp(R>(s/usr/lib/python2.7/_abcoll.pys `s(tsum(RR>((R>s/usr/lib/python2.7/_abcoll.pytcount^s( R$R%RPRR^R)R.R~RzR‚(((s/usr/lib/python2.7/_abcoll.pyR6s   cBsteZdZed„ƒZed„ƒZed„ƒZd„Zd„Zd„Z dd„Z d „Z d „Z RS( s®All the operations on a read-only sequence. Concrete subclasses must provide __new__ or __init__, __getitem__, __setitem__, __delitem__, __len__, and insert(). cCs t‚dS(N(Ry(RRzR>((s/usr/lib/python2.7/_abcoll.pyRqqscCs t‚dS(N(Ry(RRz((s/usr/lib/python2.7/_abcoll.pyRruscCs t‚dS(s5S.insert(index, object) -- insert object before indexN(Ry(RRzR>((s/usr/lib/python2.7/_abcoll.pytinsertyscCs|jt|ƒ|ƒdS(s<S.append(object) -- append object to the end of the sequenceN(RƒR3(RR>((s/usr/lib/python2.7/_abcoll.pytappend~scCsXt|ƒ}xEt|dƒD]3}|||d||||<|||d item -- remove and return item at index (default last). Raise IndexError if list is empty or index is out of range. ((RRzRp((s/usr/lib/python2.7/_abcoll.pyRWs cCs||j|ƒ=dS(svS.remove(value) -- remove first occurrence of value. Raise ValueError if the value is not present. N(Rz(RR>((s/usr/lib/python2.7/_abcoll.pyRU•scCs|j|ƒ|S(N(R†(RRg((s/usr/lib/python2.7/_abcoll.pyt__iadd__›s ( R$R%RPRRqRrRƒR„R…R†RWRUR‡(((s/usr/lib/python2.7/_abcoll.pyRhs     ((((((!RPtabcRRRGt__all__RRRtregistertstrRRRRRt frozensetR RnR R R RRR RhRttuplet basestringtbuffertxrangeRRd(((s/usr/lib/python2.7/_abcoll.pyt sD       y M B  Y ,    7