e fM @ s d Z d d l m Z m Z d d l Z d d d d d d d
d d d
d d d d d d d g Z d Z e e d Z e e e
Z e e i j Z
e e i j Z e e i j Z e e g Z e e e g Z e e e d Z e e e Z e e d Z e e f Z e e e Z e i j Z e i j Z e i j Z e e j Z! Gd d d d e Z" Gd d d d e Z# Gd d d e# Z$ e$ j% e e$ j% e e$ j% e
e$ j% e e$ j% e e$ j% e e$ j% e e$ j% e e$ j% e e$ j% e e$ j% e e$ j% e Gd d d d e Z& Gd d d d e Z' Gd d d d e Z( Gd d
d
e& e# e' Z) e) j% e* Gd d d e) Z+ e+ j% e Gd! d d e& e# e' Z, e, j% e! Gd" d d e& Z- Gd# d d e- e) Z. e. j% e Gd$ d d e- e) Z/ e/ j% e Gd% d d e- Z0 e0 j% e Gd& d
d
e, Z1 e1 j% e2 Gd' d d e& e# e' Z3 e3 j% e4 e3 j% e5 e3 j% e e3 j% e6 Gd( d d e3 Z7 e7 j% e8 e7 j% e
Gd) d d e3 Z9 e9 j% e: e9 j% e
d S)*zjAbstract Base Classes (ABCs) for collections, according to PEP 3119.
Unit tests are in test_collections.
)ABCMetaabstractmethodNHashableIterableIteratorSized ContainerCallableSet
MutableSetMappingMutableMapping MappingViewKeysView ItemsView
ValuesViewSequenceMutableSequence
ByteStringzcollections.abc c @ s: e Z d Z f Z e d d Z e d d Z d S)r c C s d S)Nr )selfr r 5/opt/alt/python34/lib64/python3.4/_collections_abc.py__hash__= s zHashable.__hash__c C sK | t k rG x8 | j D]* } d | j k r | j d r< d SPq q Wn t S)Nr T)r __mro____dict__NotImplemented)clsCBr r r __subclasshook__A s
zHashable.__subclasshook__N)__name__
__module__ __qualname__ __slots__r r classmethodr! r r r r r 9 s metaclassc @ s: e Z d Z f Z e d d Z e d d Z d S)r c c s d S)Nr )r r r r __iter__P s zIterable.__iter__c C s3 | t k r/ t d d | j D r/ d Sn t S)Nc s s | ] } d | j k Vq d S)r( N)r ).0r r r r X s z,Iterable.__subclasshook__..T)r anyr r )r r r r r r! U s zIterable.__subclasshook__N)r" r# r$ r% r r( r& r! r r r r r L s c @ sF e Z d Z f Z e d d Z d d Z e d d Z d S)r c C s
t d S)zKReturn the next item from the iterator. When exhausted, raise StopIterationN)
StopIteration)r r r r __next__a s zIterator.__next__c C s | S)Nr )r r r r r( f s zIterator.__iter__c C sO | t k rK t d d | j D rK t d d | j D rK d Sn t S)Nc s s | ] } d | j k Vq d S)r- N)r )r) r r r r r* l s z,Iterator.__subclasshook__..c s s | ] } d | j k Vq d S)r( N)r )r) r r r r r* m s T)r r+ r r )r r r r r r! i s
zIterator.__subclasshook__N) r" r# r$ r% r r- r( r& r! r r r r r ] s c @ s: e Z d Z f Z e d d Z e d d Z d S)r c C s d S)Nr r )r r r r __len__ s z
Sized.__len__c C s3 | t k r/ t d d | j D r/ d Sn t S)Nc s s | ] } d | j k Vq d S)r. N)r )r) r r r r r* s z)Sized.__subclasshook__..T)r r+ r r )r r r r r r! s zSized.__subclasshook__N)r" r# r$ r% r r. r& r! r r r r r s c @ s: e Z d Z f Z e d d Z e d d Z d S)r c C s d S)NFr )r xr r r __contains__ s zContainer.__contains__c C s3 | t k r/ t d d | j D r/ d Sn t S)Nc s s | ] } d | j k Vq d S)r0 N)r )r) r r r r r* s z-Container.__subclasshook__..T)r r+ r r )r r r r r r! s zContainer.__subclasshook__N)r" r# r$ r% r r0 r& r! r r r r r s c @ s: e Z d Z f Z e d d Z e d d Z d S)r c O s d S)NFr )r argskwdsr r r __call__ s zCallable.__call__c C s3 | t k r/ t d d | j D r/ d Sn t S)Nc s s | ] } d | j k Vq d S)r3 N)r )r) r r r r r* s z,Callable.__subclasshook__..T)r r+ r r )r r r r r r! s zCallable.__subclasshook__N)r" r# r$ r% r r3 r& r! r r r r r s c @ s e Z d Z d Z f Z d d Z d d Z d d Z d d Z d
d Z e
d d
Z d d Z e Z
d d Z d d Z e Z d d Z d d Z d d Z e Z d d Z d S) r
aZ A 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), redefine __le__ and __ge__,
then the other operations will automatically follow suit.
c C sT t | t s t St | t | k r/ d Sx | D] } | | k r6 d Sq6 Wd S)NFT)
isinstancer
r len)r otherelemr r r __le__ s
z
Set.__le__c C s8 t | t s t St | t | k o7 | j | S)N)r4 r
r r5 r8 )r r6 r r r __lt__ s z
Set.__lt__c C s8 t | t s t St | t | k o7 | j | S)N)r4 r
r r5 __ge__)r r6 r r r __gt__ s z
Set.__gt__c C sT t | t s t St | t | k r/ d Sx | D] } | | k r6 d Sq6 Wd S)NFT)r4 r
r r5 )r r6 r7 r r r r: s
z
Set.__ge__c C s8 t | t s t St | t | k o7 | j | S)N)r4 r
r r5 r8 )r r6 r r r __eq__ s z
Set.__eq__c C s
| | S)zConstruct 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 )r itr r r _from_iterable s zSet._from_iterablec s3 t | t s t S j f d d | D S)Nc 3 s! | ] } | k r | Vq d S)Nr )r) value)r r r r* s z Set.__and__..)r4 r r r> )r r6 r )r r __and__ s z Set.__and__c C s% x | D] } | | k r d Sq Wd S)z1Return True if two sets have a null intersection.FTr )r r6 r? r r r
isdisjoint s
zSet.isdisjointc C s9 t | t s t Sd d | | f D } | j | S)Nc s s" | ] } | D] } | Vq
q d S)Nr )r) ser r r r* s z Set.__or__..)r4 r r r> )r r6 chainr r r __or__ s z
Set.__or__c sT t t s4 t t s" t S| j n | j f d d | D S)Nc 3 s! | ] } | k r | Vq d S)Nr )r) r? )r6 r r r* s z Set.__sub__..)r4 r
r r r> )r r6 r )r6 r __sub__ s
z Set.__sub__c sT t | t s4 t | t s" t S j | } n j f d d | D S)Nc 3 s! | ] } | k r | Vq d S)Nr )r) r? )r r r r* s z Set.__rsub__..)r4 r
r r r> )r r6 r )r r __rsub__
s
z Set.__rsub__c C sD t | t s4 t | t s" t S| j | } n | | | | BS)N)r4 r
r r r> )r r6 r r r __xor__ s
z Set.__xor__c C s t j } d | d } t | } d | d } | | M} x> | D]6 } t | } | | | d >Ad Ad N} | | M} qB W| d d } | | M} | | k r | | d 8} n | d
k r d } n | S) a+ 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.
iMr iM[l 4~2 i
i6i8#)sysmaxsizer5 hash)r MAXMASKnhr/ hxr r r _hash s
z Set._hashN)r" r# r$ __doc__r% r8 r9 r; r: r< r& r> r@ __rand__rA rE __ror__rF rG rH __rxor__rU r r r r r
s$
c @ s e Z d Z d Z f Z e d d Z e d d Z d d Z d d Z d
d Z
d d
Z d d Z d d Z
d d Z d S)r a 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.
c C s
t d S)zAdd an element.N)NotImplementedError)r r? r r r addL s zMutableSet.addc C s
t d S)z8Remove an element. Do not raise an exception if absent.N)rZ )r r? r r r discardQ s zMutableSet.discardc C s, | | k r t | n | j | d S)z5Remove an element. If not a member, raise a KeyError.N)KeyErrorr\ )r r? r r r removeV s zMutableSet.removec C sH t | } y t | } Wn t k
r6 t Yn X| j | | S)z2Return the popped value. Raise KeyError if empty.)iternextr, r] r\ )r r= r? r r r pop\ s
zMutableSet.popc C s. y x | j q WWn t k
r) Yn Xd S)z6This is slow (creates N new iterators!) but effective.N)ra r] )r r r r clearf s
zMutableSet.clearc C s" x | D] } | j | q W| S)N)r[ )r r= r? r r r __ior__n s
zMutableSet.__ior__c C s& x | | D] } | j | q W| S)N)r\ )r r= r? r r r __iand__s s zMutableSet.__iand__c C sx | | k r | j n[ t | t s: | j | } n x7 | D]/ } | | k rc | j | qA | j | qA W| S)N)rb r4 r
r> r\ r[ )r r= r? r r r __ixor__x s
zMutableSet.__ixor__c C s; | | k r | j n x | D] } | j | q W| S)N)rb r\ )r r= r? r r r __isub__ s
zMutableSet.__isub__N)r" r# r$ rV r% r r[ r\ r^ ra rb rc rd re rf r r r r r > s
c @ ss e Z d Z f Z e d d Z d d d Z d d Z d d Z d
d Z d d
Z
d d Z d S)r c C s
t d S)N)r] )r keyr r r __getitem__ s zMapping.__getitem__Nc C s) y | | SWn t k
r$ | SYn Xd S)z D[k] if k in D, else d. d defaults to None.N)r] )r rg defaultr r r get s
z Mapping.getc C s- y | | Wn t k
r$ d SYn Xd Sd S)NFT)r] )r rg r r r r0 s
zMapping.__contains__c C s
t | S)z:D.keys() -> a set-like object providing a view on D's keys)r )r r r r keys s z Mapping.keysc C s
t | S)z a set-like object providing a view on D's items)r )r r r r items s z
Mapping.itemsc C s
t | S)z6D.values() -> an object providing a view on D's values)r )r r r r values s zMapping.valuesc C s5 t | t s t St | j t | j k S)N)r4 r r dictrl )r r6 r r r r< s zMapping.__eq__) r" r# r$ r% r rh rj r0 rk rl rm r< r r r r r s
c @ s4 e Z d Z d d Z d d Z d d Z d S)r c C s
| | _ d S)N)_mapping)r mappingr r r __init__ s zMappingView.__init__c C s
t | j S)N)r5 ro )r r r r r. s zMappingView.__len__c C s
d j | S)Nz&{0.__class__.__name__}({0._mapping!r}))format)r r r r __repr__ s zMappingView.__repr__N)r" r# r$ rq r. rs r r r r r s c @ s: e Z d Z e d d Z d d Z d d Z d S)r c C s
t | S)N)set)r r= r r r r> s zKeysView._from_iterablec C s
| | j k S)N)ro )r rg r r r r0 s zKeysView.__contains__c c s | j Dd Hd S)N)ro )r r r r r( s zKeysView.__iter__N)r" r# r$ r& r> r0 r( r r r r r s c @ s: e Z d Z e d d Z d d Z d d Z d S)r c C s
t | S)N)rt )r r= r r r r> s zItemsView._from_iterablec C sD | \ } } y | j | } Wn t k
r5 d SYn X| | k Sd S)NF)ro r] )r itemrg r? vr r r r0 s
zItemsView.__contains__c c s* x# | j D] } | | j | f Vq
Wd S)N)ro )r rg r r r r( s zItemsView.__iter__N)r" r# r$ r& r> r0 r( r r r r r s c @ s( e Z d Z d d Z d d Z d S)r c C s/ x( | j D] } | | j | k r
d Sq
Wd S)NTF)ro )r r? rg r r r r0 s zValuesView.__contains__c c s$ x | j D] } | j | Vq
Wd S)N)ro )r rg r r r r( s zValuesView.__iter__N)r" r# r$ r0 r( r r r r r s c @ s e Z d Z f Z e d d Z e d d Z e Z e d d Z d d Z
d d
Z d d Z d
d d Z
d
S)r
c C s
t d S)N)r] )r rg r? r r r __setitem__ s zMutableMapping.__setitem__c C s
t d S)N)r] )r rg r r r __delitem__ s zMutableMapping.__delitem__c C sK y | | } Wn+ t k
r; | | j k r3 n | SYn X| | =| Sd S)zD.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)r] _MutableMapping__marker)r rg ri r? r r r ra s
zMutableMapping.popc C sL y t t | } Wn t k
r0 t Yn X| | } | | =| | f S)zD.popitem() -> (k, v), remove and return some (key, value) pair
as a 2-tuple; but raise KeyError if D is empty.
)r` r_ r, r] )r rg r? r r r popitem+ s
zMutableMapping.popitemc C s. y x | j q WWn t k
r) Yn Xd S)z,D.clear() -> None. Remove all items from D.N)rz r] )r r r r rb 7 s
zMutableMapping.clearc O s | s t d n | ^ } } t | d k rL t d t | n | r | d } 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
z@descriptor 'update' of 'MutableMapping' object needs an argumentrJ z+update expected at most 1 arguments, got %dr rk N) TypeErrorr5 r4 r hasattrrk rl )r1 r2 r r6 rg r? r r r update? s$
zMutableMapping.updateNc C s/ y | | SWn t k
r* | | | D.get(k,d), also set D[k]=d if k not in D)r] )r rg ri r r r
setdefaultZ s
zMutableMapping.setdefault)r" r# r$ r% r rw rx objectry ra rz rb r} r~ r r r r r
s c @ sj e Z d Z d Z f Z e d d Z d d Z d d Z d d Z d
d Z
d d
Z d S)r zAll the operations on a read-only sequence.
Concrete subclasses must override __new__ or __init__,
__getitem__, and __len__.
c C s
t d S)N)
IndexError)r indexr r r rh r s zSequence.__getitem__c c sG d } y$ x | | } | V| d 7} q WWn t k
rB d SYn Xd S)Nr rJ )r )r irv r r r r( v s
zSequence.__iter__c C s% x | D] } | | k r d Sq Wd S)NTFr )r r? rv r r r r0 s
zSequence.__contains__c c s0 x) t t t | D] } | | Vq Wd S)N)reversedranger5 )r r r r r __reversed__ s zSequence.__reversed__c C s7 x* t | D] \ } } | | k r
| Sq
Wt d S)z|S.index(value) -> integer -- return first index of value.
Raises ValueError if the value is not present.
N) enumerate
ValueError)r r? r rv r r r r s zSequence.indexc s t f d d | D S)zBS.count(value) -> integer -- return number of occurrences of valuec 3 s! | ] } | k r d Vq d S)rJ Nr )r) rv )r? r r r* s z!Sequence.count..)sum)r r? r )r? r count s zSequence.countN) r" r# r$ rV r% r rh r( r0 r r r r r r r r h s
c @ s e Z d Z d Z f Z d S)r zMThis unifies bytes and bytearray.
XXX Should add all their methods.
N)r" r# r$ rV r% r r r r r s c @ s e Z d Z f Z e d d Z e d d Z e d d Z d d Z d d
Z d d Z
d
d Z d d d Z d d Z
d d Z d S)r c C s
t d S)N)r )r r r? r r r rw s zMutableSequence.__setitem__c C s
t d S)N)r )r r r r r rx s zMutableSequence.__delitem__c C s
t d S)z3S.insert(index, value) -- insert value before indexN)r )r r r? r r r insert s zMutableSequence.insertc C s | j t | | d S)z:S.append(value) -- append value to the end of the sequenceN)r r5 )r r? r r r append s zMutableSequence.appendc C s. y x | j q WWn t k
r) Yn Xd S)z,S.clear() -> None -- remove all items from SN)ra r )r r r r rb s
zMutableSequence.clearc C sX t | } xE t | 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.
r )r r rv r r r ra s
zMutableSequence.popc C s | | j | =d S)zvS.remove(value) -- remove first occurrence of value.
Raise ValueError if the value is not present.
N)r )r r? r r r r^ s zMutableSequence.removec C s | j | | S)N)r )r rm r r r __iadd__ s
zMutableSequence.__iadd__NrL )r" r# r$ r% r rw rx r r rb r r ra r^ r r r r r r s );rV abcr r rM __all__r" typer_ bytes_iterator bytearraybytearray_iteratorrk dict_keyiteratorrm dict_valueiteratorrl dict_itemiterator
list_iteratorr list_reverseiteratorr range_iteratorrt set_iterator str_iteratortuple_iteratorzip zip_iterator dict_keys dict_values
dict_itemsr mappingproxyr r r registerr r r r
frozensetr r r r r r r
rn r tuplestr
memoryviewr bytesr listr r r r s
O
0
\
/
A