Warning: file_get_contents(https://raw.githubusercontent.com/Den1xxx/Filemanager/master/languages/ru.json): failed to open stream: HTTP request failed! HTTP/1.1 404 Not Found
in /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php on line 88
Warning: Cannot modify header information - headers already sent by (output started at /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php:88) in /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php on line 215
Warning: Cannot modify header information - headers already sent by (output started at /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php:88) in /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php on line 216
Warning: Cannot modify header information - headers already sent by (output started at /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php:88) in /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php on line 217
Warning: Cannot modify header information - headers already sent by (output started at /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php:88) in /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php on line 218
Warning: Cannot modify header information - headers already sent by (output started at /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php:88) in /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php on line 219
Warning: Cannot modify header information - headers already sent by (output started at /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php:88) in /home/afelisqd/cppseducation.sc.tz/admin/images/photos/17587263121019776732_admin-dbb.php on line 220
PK ! א * __pycache__/__init__.cpython-311.opt-2.pycnu [
!A?h2 g d Z ddlZddlZddlmZ ddlmZ ddlm Z
ddl m Z
ddlmZ ddlmZ dd lmZ dd
lmZ dd lmZ ej e n # e $ r Y nw xY w dd lm Z n # e $ r Y nw xY w G d
dej Z G d dej! Z" G d dej# Z$ G d de% Z& G d de' Z( ddlm(Z( n # e $ r Y nw xY w ddlm)Z) n# e $ r d Z)Y nw xY wddddd Z*d Z+ dd lm+Z+ n # e $ r Y nw xY w G d d e' Z, G d! d"ej- Z. G d# d$ej- Z/ G d% d&ej Z0 G d' d(ej1 Z2dS ))) ChainMapCounter OrderedDictUserDictUserList
UserString defaultdictdeque
namedtuple N)chain)repeat)starmap) iskeyword)eq)
itemgetter)recursive_repr)proxy)r )r c e Zd Zd ZdS )_OrderedDictKeysViewc # > K t | j E d {V d S Nreversed_mappingselfs A/opt/alt/python-internal/lib64/python3.11/collections/__init__.py __reversed__z!_OrderedDictKeysView.__reversed__< s. DM*********** N__name__
__module__ __qualname__r r r r r : s# + + + + +r r c e Zd Zd ZdS )_OrderedDictItemsViewc # Z K t | j D ]}|| j | fV d S r r r keys r r z"_OrderedDictItemsView.__reversed__A sD DM** , ,C
c*+ + + + + , ,r Nr r$ r r r& r& ? s# , , , , ,r r& c e Zd Zd ZdS )_OrderedDictValuesViewc # V K t | j D ]}| j | V d S r r r( s r r z#_OrderedDictValuesView.__reversed__G s? DM** % %C-$ $ $ $ $ % %r Nr r$ r r r+ r+ E s# % % % % %r r+ c e Zd ZdZdS )_Link)prevnextr) __weakref__N)r! r" r# __slots__r$ r r r. r. K s 4IIIr r. c @ e Zd Z d ZddZej eefdZej fdZ d Z
d Z d Z d d
Z
d d Zd Zej j xZZd
Zd Zd Zej j Z e ZefdZd dZ e d Z d Z d Z e d d Z!d Z"d Z#d Z$d Z%dS ) r c t | }t |_ t |j x|_ }|x|_ |_ i |_ |S r ) dict__new__r. _OrderedDict__hardroot_proxy_OrderedDict__rootr/ r0 _OrderedDict__map)clsargskwdsr roots r r6 zOrderedDict.__new__] sQ N||C '' #DO 4 44 d $$ DI
r r$ c $ | j |fi | d S r )_OrderedDict__update)r otherr= s r __init__zOrderedDict.__init__f s)
e$$t$$$$$r c || vrO | x| j |< }| j }|j }|||c|_ |_ |_ ||_ || |_ || || d S r )r: r9 r/ r0 r) ) r r) value dict_setitemr Linklinkr> lasts r __setitem__zOrderedDict.__setitem__l sz + d??%)TVV +DJsOd;D9D-14 *DIty$( DI d DI T3&&&&&r c || | | j | }|j }|j }||_ ||_ d |_ d |_ d S r )r: popr/ r0 )r r) dict_delitemrG link_prev link_nexts r __delitem__zOrderedDict.__delitem__z sZ * T3 z~~c""I I " " r c # \ K | j }|j }||ur|j V |j }||ud S d S r )r9 r0 r) r r> currs r __iter__zOrderedDict.__iter__ sM %{y$ (NNN9D $ r c # \ K | j }|j }||ur|j V |j }||ud S d S r )r9 r/ r) rQ s r r zOrderedDict.__reversed__ sM -{y$ (NNN9D $ r c | j }|x|_ |_ | j t
| d S r )r9 r/ r0 r: clearr5 )r r> s r rV zOrderedDict.clear sF 8{ $$ DI
4r Tc | st d | j }|r |j }|j }||_ ||_ n |j }|j }||_ ||_ |j }| j |= t | | }||fS )Nzdictionary is empty)KeyErrorr9 r/ r0 r) r: r5 rK )r rH r> rG rM rN r) rD s r popitemzOrderedDict.popitem s 2011 1{ "9D I !IN!DII9D I!DI !INh JsOs##Ezr c
| j | }|j }|j }|j }||_ ||_ | j }|r%|j }||_ ||_ ||_ ||_ d S |j }||_ ||_ ||_ ||_ d S r )r: r/ r0 r9 ) r r) rH rG rM rN soft_linkr> firsts r move_to_endzOrderedDict.move_to_end s z#I I N " " { 9D DI DI!DI DIIIIE DI DI"EJ DIIIr c t j }t | dz } || j }| || j dz z
}| || j |z z
}| || j |z z
}|S )N )_sys getsizeoflen__dict__r: r7 r9 )r sizeofnsizes r
__sizeof__zOrderedDict.__sizeof__ s IIMvdm$$ tz""Q&& t''!++ t{##a'' r c " t | S r )r r s r keyszOrderedDict.keys s D#D)))r c " t | S r )r& r s r itemszOrderedDict.items s F$T***r c " t | S r )r+ r s r valueszOrderedDict.values s @%d+++r c | j }t | || }||urF| j | }|j }|j }||_ ||_ d |_ d |_ |S ||u rt
| |S r )_OrderedDict__markerr5 rK r: r/ r0 rX )r r) defaultmarkerresultrG rM rN s r rK zOrderedDict.pop s
$V,, :>>#&&D I I &IN &IN DI DIM f 3-- r Nc * || v r| | S || |< |S r r$ r r) rq s r
setdefaultzOrderedDict.setdefault s* $;;9 S r c | s| j j dS | j j dt | dS Nz()()) __class__r! listrl r s r __repr__zOrderedDict.__repr__ sM % 7 !^ 4 4 46 6 >222D 4F4F4F4FGGr c | }|rt |t r|\ }}ni }| }| }t t D ].}| |d | |d /|r||f}n|pd }| j d|d t | fS )Nr$ )
__getstate__
isinstancetuplecopyvarsr rK r{ iterrl )r stateslotsks r
__reduce__zOrderedDict.__reduce__ s /!!##
&%''
$ uuJJLLEJJLLE+--((
#
# !T""" !T""""
& u
~r5$TZZ\\0B0BBBr c . | | S r r{ r s r r zOrderedDict.copy% s +~~d###r c 0 | }|D ]}|||< |S r r$ )r; iterablerD r r) s r fromkeyszOrderedDict.fromkeys) s1 suu C DII r c t |t r>t | | o"t t t | | S t | | S r )r r r5 __eq__allmap_eqr rA s r r zOrderedDict.__eq__2 s] e[ ) ) K;;tU++JCT54I4I0J0J J{{4'''r c 0 | | | S r )updater s r __ior__zOrderedDict.__ior__; s E r c t |t st S | | }| | |S r r r5 NotImplementedr{ r r rA news r __or__zOrderedDict.__or__? sB %&& "! !nnT""
5
r c t |t st S | | }| | |S r r r s r __ror__zOrderedDict.__ror__F sB %&& "! !nnU##
4
r )r$ )Tr )&r! r" r# r6 rB r5 rI r8 r. rO rS r rV rY r] rh _collections_abcMutableMappingr r@ rj rl rn __ne__objectrp rK rv _recursive_reprr} r r classmethodr r r r r r$ r r r r N s / % % % % "&!1e ' ' ' ' -1,< . 2 )7>>FX* * *+ + +, , ,
,
3FvxxH ' , _H H H C C C&$ $ $ [( ( ( r r )r ) _tuplegetterc > t t | | S )N)doc)property _itemgetter)indexr s r r \ s h{5/A/As&K&K&K r F)renamedefaultsmodulec t t r( dd t t t t
j t | } |r|t }t D ]^\ }}|
r(t | s| d s||v rd| |< |
| _| gz D ]n}t | t urt d |
st! d| t | rt! d| ot }D ]V}| d r|st! d| ||v rt! d| |
| Wi }|t# | }t% | t% k rt d t' t) t t+ t) t) | }t# t t j t% d
} d k r| dz
} d d
d
D z dz t" j t& t" t$ t
t* f\ i d| d}
d| d| d} t1 | |
} d| _ d| d | d| _ ||| _ t8 fd }
d| d|
j _ fd}d| d|_ fd }fd }fd }| |
j ||||fD ]}| d |j |_ | d | dd || |
||||d! }t D ]/\ }}t
j d"| }t? || ||< 0t | t" f| }|F t
j d j! " d#d$ }n# tF t f$ r Y nw xY w|||_$ |S )%N, _z*Type names and field names must be stringsz6Type names and field names must be valid identifiers: z0Type names and field names cannot be a keyword: z-Field names cannot start with an underscore: z"Encountered duplicate field name: z(Got more default values than field names, r_ ry c 3 K | ] }| d V
dS )z=%rNr$ ).0names r z namedtuple.. s( D D$||| D D D D D Dr rz namedtuple_)
_tuple_new __builtins__r! z
lambda _cls, z: _tuple_new(_cls, (z))r6 zCreate new instance of c | | } | k r"t d dt | |S )Nz Expected z arguments, got ) TypeErrorrc )r; r rs _len
num_fields tuple_news r _makeznamedtuple.._make sQ 3)) 4<<: % % Q
Q QCKK Q QRR R
r z Make a new z# object from a sequence or iterablec | |j | }|r t dt | |S )Nz Got unexpected field names: )r rK
ValueErrorr| )r r= rs _map field_namess r _replacez namedtuple.._replace sO DD; = =>> L JDJJ J JKK K
r z
Return a new z2 object replacing specified fields with new valuesc * | j j | z z S r )r{ r! )r repr_fmts r r} z namedtuple..__repr__ s 9~&D 88r c : | j | S r )_fields)r _dict_zips r _asdictznamedtuple.._asdict s$ CuTT$,--...r c | S r r$ )r _tuples r __getnewargs__z"namedtuple..__getnewargs__ s Avd||r .r$ ) __doc__r2 r _field_defaultsr6 r r r} r r __match_args__zAlias for field number r! __main__)%r strreplacesplitr| r ra internset enumerate isidentifier
_iskeyword
startswithaddtyper r r rc r5 r zipjoinr6 evalr! r __defaults__r __func__r# r _getframe f_globalsgetAttributeErrorr" ) typenamer r r r seenr r field_defaultsarg_list namespacecoder6 r r r} r r methodclass_namespacer rs r r r r r r r r s ` @@@@@@@@r r
r
^ s 2 +s## <!))#s3399;; s3 ,,--K{3x==))H
uu$[11 KE4%%''
1 d##
1??3''
1 4<<%0[[ E" HHTNNNN
[( 3 3 ::S HII I "" 7 6-1 6 6 7 7
7 d 3 2)- 2 2 3 3
3 3 55D ??3 * * ) $ ) ) * *
* 4<< J$ J JKK K N?? x==3{++ + + FGG G htC0E0E080B0B-D -D (E (E F F G G DK5566K[!!Jyy%%HQCTYY D D D D DDDDsJH
I&*E3S&@#E64t
,(,, I
F8 E E E E ED4##G GFFF8FFFGO ' [ ,H , , ,EN 1 1 1 1H9 9 9 9 9/ / / / / /
> > "* = =FO = =
,,,,, ) (% O !-- 9 9 tk;E;;<< ,UC 8 8
(UHo
6
6F ~ ^A&&044ZLLFF
+ D
" Ms 8-Q& &Q:9Q:c D | j }|D ]} ||d dz | |< d S Nr r_ )r )mappingr mapping_getelems r _count_elementsr
sA '+K 1 1# D!,,q0
1 1r )r c e Zd Z d fd Zd Zd Zd dZd Zed d Z d fd Z
d d Z d
Z d Z
fd Zd
Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Z d Z d Z d Z d Z xZ!S ) r Nc f t | j |fi | d S r )superrB r )r r r= r{ s r rB zCounter.__init__K s@ H%%%%%%%r c dS Nr r$ r( s r __missing__zCounter.__missing__Y s
;qr c F t | S r )sumrn r s r totalz
Counter.total^ s 4;;==!!!r c |1t | t d d S dd l}| || t d S )Nr_ T)r) reverser )r) )sortedrl r heapqnlargest)r rf r s r most_commonzCounter.most_commonb sb
9$**,,KNNDIII I ~~a ;q>>~BBBr c v t j t t | S r )_chain
from_iterable_starmap_repeatrl r s r elementszCounter.elementsr s, " #HWdjjll$C$CDDDr c t d )Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)r; r vs r r zCounter.fromkeys s " NP P Pr c D |t |t j rX| r4| j }| D ]\ }}| ||d z | |< n2t | nt | | |r| | d S d S r )r r Mappingr rl r r r )r r r= self_getr countr{ s r r zCounter.update s & ($4$<==
0 - #xH'/~~'7'7 ? ? e%*XXdA->->%>T
? GGNN8,,,, h/// KK r c |e| j }t |t j r-| D ]\ }} ||d |z
| |< n|D ]} ||d dz
| |< |r| | d S d S r )r r r r rl subtract)r r r= r r r s r r zCounter.subtract s xH($4$<==
7#+>>#3#3 ; ;KD%!)$!2!2U!:DJJ; % 7 7D!)$!2!2Q!6DJJ MM$ r c . | | S r r r s r r z Counter.copy s ~~d###r c 0 | j t | ffS r )r{ r5 r s r r zCounter.__reduce__ s ~T
},,r c X || v r#t | d S d S r )r rO )r r r{ s r rO zCounter.__delitem__ s4 Q 4<< GG % % % % % . = II1qII!47eAh&IIIIIIIr r r r r r s ``r r zCounter.__eq__
sI G%)) "! !IIIIIu
IIIIIIr c J t |t st S | |k S r r r r r s r r zCounter.__ne__ s* J%)) "! !5= r c | t t st S t fd fD S )Nc 3 F K | ]}|D ]}| | k V d S r r$ r s r r z!Counter.__le__.. r r r r s ``r __le__zCounter.__le__ sI D%)) "! !IIIIIu
IIIIIIr c T t |t st S | |k o| |k S r r" r s r __lt__zCounter.__lt__ s0 K%)) "! !u}. .r c | t t st S t fd fD S )Nc 3 F K | ]}|D ]}| | k V d S r r$ r s r r z!Counter.__ge__..& r r r r s ``r __ge__zCounter.__ge__" sI F%)) "! !IIIIIu
IIIIIIr c T t |t st S | |k o| |k S r r" r s r __gt__zCounter.__gt__( s0 M%)) "! !u}. .r c t |t st S t }| D ]\ }}||| z }|dk r|||< | D ]\ }}|| vr |dk r|||< |S r r r r rl r rA rs r r newcounts r __add__zCounter.__add__. s %)) "! ! ::<< ( (KD% uT{*H!|| 't ;;== % %KD%4 EAII $t
r c t |t st S t }| D ]\ }}||| z
}|dk r|||< | D ]\ }}|| vr|dk rd|z
||< |S r r. r/ s r __sub__zCounter.__sub__A s %)) "! ! ::<< ( (KD% uT{*H!|| 't ;;== ) )KD%4 EAII 5yt
r c t |t st S t }| D ]"\ }}|| }||k r|n|}|dk r|||< #| D ]\ }}|| vr |dk r|||< |S r r. r rA rs r r other_countr0 s r r zCounter.__or__T s %)) "! ! ::<< ( (KD% +K&+k&9&9{{uH!|| 't ;;== % %KD%4 EAII $t
r c t |t st S t }| D ]"\ }}|| }||k r|n|}|dk r|||< #|S r r. r5 s r __and__zCounter.__and__h sy %)) "! ! ::<< ( (KD% +K % 3 3uuH!|| 't
r c n t }| D ]\ }}|dk r|||< |S r r rl r rs r r s r __pos__zCounter.__pos__y sA O ::<< % %KD%qyy $t
r c t t }| D ]\ }}|dk rd|z
||< |S r r: r; s r __neg__zCounter.__neg__ sI ::<< ) )KD%qyy 5yt
r c T d | D }|D ]}| |= | S )Nc $ g | ]
\ }}|d k |S )r r$ )r r r s r
z*Counter._keep_positive.. s! MMM e5199t999r )rl )r nonpositiver s r _keep_positivezCounter._keep_positive s= MMMtzz||MMM DT
r c | D ]\ }}| |xx |z
cc< | S r rl rC r rA r r s r __iadd__zCounter.__iadd__ N !;;== KD% JJJ% JJJJ""$$$r c | D ]\ }}| |xx |z cc< | S r rE rF s r __isub__zCounter.__isub__ rH r c | D ]\ }}| | }||k r|| |< | S r rE )r rA r r6 r s r r zCounter.__ior__ sU "' ) ) D+JEU"" (T
""$$$r c | D ]\ }}|| }||k r|| |< | S r rE )r rA r r r6 s r __iand__zCounter.__iand__ sT ::<< ) )KD% +KU"" (T
""$$$r r )"r! r" r# rB r r r r r r r r r r rO r} r r r% r' r* r, r1 r3 r r8 r< r> rC rG rJ r rM
__classcell__r s @r r r s1 *d & & & & & &
" " "C C C C E E E, P P P [ P D 6$ $ $- - -& & & & &
3 3 3ZJ J J ! ! ! J J J / / / J J J / / / & & ( " % % % % % %
%
%
%
%
%
%
%
%
%
%r r c e Zd Z d Zd Zd ZddZd Zd Zd Z d Z
e d
Z e
d Zd ZeZdd
Zed Zd Zd Zd Zd Zd Zd Zd Zd ZdS )r c 6 t | pi g| _ d S r )r| maps)r rQ s r rB zChainMap.__init__ s! JJ&2$ r c t | r )rX r( s r r zChainMap.__missing__ s smmr c t | j D ] } || c S # t $ r Y w xY w| | S r )rQ rX r )r r) r s r __getitem__zChainMap.__getitem__ s\ y G
s|###
$$$s
""Nc || v r| | n|S r r$ ru s r r z ChainMap.get s 4KKtCyyW4r c R t t j | j S r )rc r unionrQ r s r __len__zChainMap.__len__ s ;355; *+++r c i }t | j D ]/}| t | 0t | S r )r rQ r r5 r r )r r r s r rS zChainMap.__iter__ sL ** - -G
HHT]]7++ , , , ,Awwr c D t fd| j D S )Nc 3 K | ]}|v V d S r r$ )r mr) s r r z(ChainMap.__contains__.. s' //3!8//////r anyrQ r( s `r __contains__zChainMap.__contains__ s( ////TY//////r c * t | j S r r] r s r __bool__zChainMap.__bool__ 49~~ r c | | j j dd t t | j dS )Nry r rz )r{ r! r r reprrQ r s r r} zChainMap.__repr__ s6 .)NNDIIc$ 6J6J,K,KNNNNr c : | t j |g|R S r )r5 r )r; r r< s r r zChainMap.fromkeys s' Is4=1D111222r c t | j | j d g| j dd R S r )r{ rQ r r s r r z
ChainMap.copy s; R t~dil / / 1 1BDIabbMBBBBr c b ||}n|r| | | j |g| j R S r )r r{ rQ )r r\ kwargss r new_childzChainMap.new_child sK
9AA
HHV t~a,$),,,,r c 2 | j | j dd S )Nr_ )r{ rQ r s r parentszChainMap.parents s % t~ty}--r c & || j d |< d S r )rQ )r r) rD s r rI zChainMap.__setitem__! s ! ! Sr c d | j d |= d S # t $ r t d| w xY wNr z$Key not found in the first mapping: )rQ rX r( s r rO zChainMap.__delitem__$ sR K ! S!!! K K KI#IIJJ J Ks /c ~ | j d S # t $ r t d w xY w)Nr z#No keys found in the first mapping.)rQ rY rX r s r rY zChainMap.popitem* sQ Z B9Q<'')) ) B B B@AA A Bs " <c x | j d j |g|R S # t $ r t d| w xY wrn )rQ rK rX )r r) r< s r rK z ChainMap.pop1 sb a K#49Q<#C/$/// / K K KI#IIJJ J Ks 9c F | j d d S r )rQ rV r s r rV zChainMap.clear8 s# 1 ! r c F | j d | | S r )rQ r r s r r zChainMap.__ior__< s! ! E""" r c t |t j st S | }|j d | |S r )r r r r r rQ r )r rA r\ s r r zChainMap.__or__@ sJ %!1!9:: "! ! IIKK q r c t |t j st S t | }t | j D ]}| | | | S r ) r r r r r5 r rQ r r{ )r rA r\ childs r r zChainMap.__ror__G se %!1!9:: "! ! KK di(( E
HHUOOOO~~a r r ) r! r" r# rB r rT r rX rS r_ ra r r} r r r __copy__ri r rk rI rO rY rK rV r r r r$ r r r r s ' ' ' % % %5 5 5 5, , , 0 0 0 _O O O 3 3 [3C C C H - - - - . . X." " "K K K B B BK K K ! ! ! ! !r r c v e Zd ZddZd Zd Zd Zd Zd Zd Z d Z
d
Z d Z d Z
d
Zd Zedd ZdS )r Nc t i | _ || | |r| | d S d S r )datar )r r5 rh s r rB zUserDict.__init__W sK KK KK r c * t | j S r rc ry r s r rX zUserDict.__len__^ rb r c || j v r
| j | S t | j d r| j | | S t | )Nr )ry hasattrr{ r rX r( s r rT zUserDict.__getitem__a sS $) 9S> ! 4>= 1 1 9>--dC88 8smmr c || j |< d S r ry )r r) items r rI zUserDict.__setitem__h s #r c | j |= d S r r r( s r rO zUserDict.__delitem__k s IcNNNr c * t | j S r )r ry r s r rS zUserDict.__iter__n DI r c || j v S r r r( s r r_ zUserDict.__contains__r s di r c * t | j S r rd ry r s r r} zUserDict.__repr__v r r c t |t r"| | j |j z S t |t r | | j |z S t
S r r r r{ ry r5 r r s r r zUserDict.__or__y s` eX & & :>>$)ej"899 9 eT " " 5>>$)e"344 4 r c t |t r"| |j | j z S t |t r | || j z S t
S r r r s r r zUserDict.__ror__ s` eX & & :>>%*ty"899 9 eT " " 5>>%$)"344 4 r c | t |t r| xj |j z c_ n| xj |z c_ | S r )r r ry r s r r zUserDict.__ior__ s= eX & & II #III II II r c | j | j }|j | j | j d |j d< |S Nry )r{ r6 rd r r r insts r rv zUserDict.__copy__ sU ~%%dn55
T]+++ $
f 5 : : < <
f r c | j t u r&t | j S dd l}| j } i | _ | | }|| _ n # || _ w xY w| | |S r )r{ r ry r r )r r ry r s r r z
UserDict.copy s >X % %DINN , ,-- - y DI $A DIIDI s A% % A.c . | }|D ]}|||< |S r r$ )r; r rD r r) s r r zUserDict.fromkeys s, CEE CAcFFr r )r! r" r# rB rX rT rI rO rS r_ r} r r r rv r r r r$ r r r r T s [ r r c e Zd Z d!dZd Zd Zd Zd Zd Zd Z d Z
d
Z d Z d Z
d
Zd Zd Zd Zd Zd ZeZd Zd Zd Zd Zd"dZd Zd Zd Z d Z d Z d Z d Z d Z!dS )#r Nc
g | _ |yt | t | j k r|| j d d < d S t |t r|j d d | j d d < d S t | | _ d S d S r )ry r r r r| )r initlists r rB zUserList.__init__ s H~~di 00 ' !!! Hh//
+ '}QQQ / !!! NN r c * t | j S r r r s r r} zUserList.__repr__ r r c > | j | | k S r ry _UserList__castr s r r' zUserList.__lt__ y4;;u----r c > | j | | k S r r r s r r% zUserList.__le__ yDKK . ...r c > | j | | k S r r r s r r zUserList.__eq__ r r c > | j | | k S r r r s r r, zUserList.__gt__ r r c > | j | | k S r r r s r r* zUserList.__ge__ r r c > t |t r|j n|S r )r r ry r s r __castzUserList.__cast s 'x 8 8CuzzeCr c || j v S r r r r s r r_ zUserList.__contains__ s ty r c * t | j S r r{ r s r rX zUserList.__len__ rb r c t |t r | | j | S | j | S r )r slicer{ ry r is r rT zUserList.__getitem__ s8 a >>$)A,// /9Q< r c || j |< d S r r r r r s r rI zUserList.__setitem__ s ! r c | j |= d S r r r s r rO zUserList.__delitem__ s IaLLLr c B t |t r"| | j |j z S t |t | j r | | j |z S | | j t | z S r r r r{ ry r r| r s r r1 zUserList.__add__ s eX & & 5>>$)ej"899 9
tDI
/
/ 5>>$)e"344 4~~di$u++ 5666r c B t |t r"| |j | j z S t |t | j r | || j z S | t | | j z S r r r s r __radd__zUserList.__radd__ s eX & & 5>>%*ty"899 9
tDI
/
/ 5>>%$)"344 4~~d5kkDI 5666r c t |t r| xj |j z
c_ nPt |t | j r| xj |z
c_ n | xj t | z
c_ | S r )r r ry r r| r s r rG zUserList.__iadd__ so eX & & % II #III
tDI
/
/ % II III IIe $II r c < | | j |z S r r{ ry r rf s r __mul__zUserList.__mul__ ~~di!m,,,r c & | xj |z c_ | S r r r s r __imul__zUserList.__imul__ s Q r c | j | j }|j | j | j d d d |j d< |S r )r{ r6 rd r r s r rv zUserList.__copy__ sR ~%%dn55
T]+++ $
f 5aaa 8
f r c : | j | d S r )ry appendr s r r zUserList.append
r c < | j || d S r )ry insertr s r r zUserList.insert
s D!!!!!r c 6 | j | S r )ry rK r s r rK z UserList.pop s y}}Q r c : | j | d S r )ry remover s r r zUserList.remove r r c 8 | j d S r )ry rV r s r rV zUserList.clear s r c , | | S r r r s r r z
UserList.copy s ~~d###r c 6 | j | S r )ry r r s r r zUserList.count s yt$$$r c ( | j j |g|R S r ry r )r r r< s r r zUserList.index s tyt+d++++r c 8 | j d S r )ry r r s r r zUserList.reverse" s r c * | j j |i | d S r )ry sortr r< r= s r r z
UserList.sort% s! %%%%%%r c t |t r!| j |j d S | j | d S r )r r ry extendr s r r zUserList.extend( sN eX & & $ I UZ ( ( ( ( ( I U # # # # #r r r )"r! r" r# rB r} r' r% r r, r* r r_ rX rT rI rO r1 r rG r __rmul__r rv r r rK r rV r r r r r r r$ r r r r s K + + + + . . ./ / // / /. . ./ / /D D D! ! ! 7 7 77 7 7 - - - H " " " $ $ $% % %, , , & & &$ $ $ $ $r r c 4 e Zd Zd Zd Zd Zd Zd Zd Zd Z d Z
d Z d
Z d Z
d Zd
Zd Zd Zd Zd Zd Zd ZeZd Zd Zd Zd Zd Zde j fdZ d Z d Z dKd Z!de j fd Z"dLd"Z#de j fd#Z$d$ Z%d% Z&de j fd&Z'd' Z(d( Z)d) Z*d* Z+d+ Z,d, Z-d- Z.d. Z/d/ Z0d0 Z1d1 Z2d2 Z3d3 Z4d4 Z5d5 Z6dMd7Z7e8j9 Z9d8 Z:dNd:Z;de j fd;Zd> Z?dMd?Z@dOd@ZAdOdAZBdPdCZCde j fdDZDdMdEZEdF ZFdG ZGdH ZHdI ZIdJ ZJd6S )Qr c t |t r || _ d S t |t r|j d d | _ d S t | | _ d S r )r r ry r r seqs r rB zUserString.__init__5 sW c3 !DIII
Z
(
( ! DIIICDIIIr c * t | j S r )r ry r s r __str__zUserString.__str__= rb r c * t | j S r r r s r r} zUserString.__repr__@ r r c * t | j S r )intry r s r __int__zUserString.__int__C rb r c * t | j S r )floatry r s r __float__zUserString.__float__F s TY r c * t | j S r )complexry r s r __complex__zUserString.__complex__I s ty!!!r c * t | j S r )hashry r s r __hash__zUserString.__hash__L r r c " | j d d fS r r r s r r zUserString.__getnewargs__O s !!! r c b t |t r| j |j k S | j |k S r r r ry r strings r r zUserString.__eq__R 0 fj ) ) ,9 + +yF""r c b t |t r| j |j k S | j |k S r r r s r r' zUserString.__lt__W 0 fj ) ) +9v{* *y6!!r c b t |t r| j |j k S | j |k S r r r s r r% zUserString.__le__\ r r c b t |t r| j |j k S | j |k S r r r s r r, zUserString.__gt__a r r c b t |t r| j |j k S | j |k S r r r s r r* zUserString.__ge__f r r c L t |t r|j }|| j v S r r )r chars r r_ zUserString.__contains__k s( dJ ' ' 9Dty r c * t | j S r r{ r s r rX zUserString.__len__p rb r c B | | j | S r r )r r s r rT zUserString.__getitem__s s ~~di .///r c ( t |t r"| | j |j z S t |t r | | j |z S | | j t | z S r )r r r{ ry r r s r r1 zUserString.__add__v sy eZ ( ( 5>>$)ej"899 9
s
#
# 5>>$)e"344 4~~di#e** 4555r c t |t r | || j z S | t | | j z S r )r r r{ ry r s r r zUserString.__radd__} sL eS ! ! 5>>%$)"344 4~~c%jj49 4555r c < | | j |z S r r r s r r zUserString.__mul__ r r c < | | j |z S r r r r< s r __mod__zUserString.__mod__ s ~~di$ .///r c L | t | | z S r )r{ r )r templates r __rmod__zUserString.__rmod__ s ~~c(mmd 2333r c Z | | j S r )r{ ry
capitalizer s r r zUserString.capitalize s" ~~di 2 2 4 4555r c Z | | j S r )r{ ry casefoldr s r r zUserString.casefold " ~~di 0 0 2 2333r c N | | j j |g|R S r )r{ ry centerr widthr< s r r zUserString.center s, ~~ .di .u > > !dl 0 0 0 0
> > >
> > >
2 2 2 2
&'DL 6 6 6 6= = = = T\ / / / /
/ / /- - - !dl 0 0 0 0# # ## # ## # #% % %# # #( ( (# # #% % %' ' '# # ## # ## # ## # #= = =1 1 17 7 7 7
I( ( (E E E E !dl 0 0 0 0
!"t| 1 1 1 1= = =) ) )7 7 7 7. . . ./ / / /. . . . ()dl 8 8 8 86 6 6 64 4 41 1 1: : :1 1 16 6 6 6 6r r )3__all__r sysra itertoolsr r r
r
r r keywordr r operatorr r r r reprlibr r _weakrefr r8 _collectionsr MutableSequenceregister ImportErrorr KeysViewr ItemsViewr&
ValuesViewr+ r r. r5 r r r
r r r r r r Sequencer r$ r r r} sF
% % % % % % ' ' ' ' ' ' ) ) ) ) ) ) + + + + + + . . . . . . 5 5 5 5 5 5 $ $ $ $ $ $5"""""" $--e4444 D
((((((( D + + + + ++4 + + +
, , , , , , 6 , , , % % % % % - 8 % % % 5 5 5 5 5F 5 5 5} } } } }$ } } }@ ((((((( D L))))))) L L LKKLLLL 16T h h h h h^1 1 1 ,,,,,,, D q% q% q% q% q%d q% q% q%p
}! }! }! }! }! . }! }! }!HS S S S S . S S St~$ ~$ ~$ ~$ ~$ / ~$ ~$ ~$Ju6 u6 u6 u6 u6!* u6 u6 u6 u6 u6sY A A('A(,A3 3A;:A;C C#"C#'C. .C98C9D DDPK ! Cܝ1 1 $ __pycache__/__init__.cpython-311.pycnu [
!A?h2 d Z g dZddlZddlZddlmZ ddlmZ ddlm
Z ddl m
Z ddlmZ dd lmZ dd
lmZ dd lmZ dd lmZ ej e n # e $ r Y nw xY w dd
lm Z n # e $ r Y nw xY w G d dej Z! G d dej" Z# G d dej$ Z% G d de& Z' G d de( Z) ddlm)Z) n # e $ r Y nw xY w ddlm*Z* n# e $ r d Z*Y nw xY wdddd d Z+d Z, dd lm,Z, n # e $ r Y nw xY w G d d!e( Z- G d" d#ej. Z/ G d$ d%ej. Z0 G d& d'ej Z1 G d( d)ej2 Z3dS )*a? This module implements specialized container datatypes providing
alternatives to Python's general purpose built-in containers, dict,
list, set, and tuple.
* namedtuple factory function for creating tuple subclasses with named fields
* deque list-like container with fast appends and pops on either end
* ChainMap dict-like class for creating a single view of multiple mappings
* Counter dict subclass for counting hashable objects
* OrderedDict dict subclass that remembers the order entries were added
* defaultdict dict subclass that calls a factory function to supply missing values
* UserDict wrapper around dictionary objects for easier dict subclassing
* UserList wrapper around list objects for easier list subclassing
* UserString wrapper around string objects for easier string subclassing
) ChainMapCounter OrderedDictUserDictUserList
UserString defaultdictdeque
namedtuple N)chain)repeat)starmap) iskeyword)eq)
itemgetter)recursive_repr)proxy)r )r c e Zd Zd ZdS )_OrderedDictKeysViewc # > K t | j E d {V d S Nreversed_mappingselfs A/opt/alt/python-internal/lib64/python3.11/collections/__init__.py __reversed__z!_OrderedDictKeysView.__reversed__< s. DM*********** N__name__
__module__ __qualname__r r r r r : s# + + + + +r r c e Zd Zd ZdS )_OrderedDictItemsViewc # Z K t | j D ]}|| j | fV d S r r r keys r r z"_OrderedDictItemsView.__reversed__A sD DM** , ,C
c*+ + + + + , ,r Nr r$ r r r& r& ? s# , , , , ,r r& c e Zd Zd ZdS )_OrderedDictValuesViewc # V K t | j D ]}| j | V d S r r r( s r r z#_OrderedDictValuesView.__reversed__G s? DM** % %C-$ $ $ $ $ % %r Nr r$ r r r+ r+ E s# % % % % %r r+ c e Zd ZdZdS )_Link)prevnextr) __weakref__N)r! r" r# __slots__r$ r r r. r. K s 4IIIr r. c B e Zd ZdZd Zd dZej ee fdZej
fdZ
d Z d Z d Z
d d Zd d Zd
Zej j xZZd Zd Zd Zej j Z e ZefdZd dZ e d Z d Z d Z e!d d Z"d Z#d Z$d Z%d Z&dS ) r z)Dictionary that remembers insertion orderc t | }t |_ t |j x|_ }|x|_ |_ i |_ |S )zDCreate the ordered dict object and set up the underlying structures.) dict__new__r. _OrderedDict__hardroot_proxy_OrderedDict__rootr/ r0 _OrderedDict__map)clsargskwdsr roots r r6 zOrderedDict.__new__] sN ||C '' #DO 4 44 d $$ DI
r r$ c " | j |fi | dS )zInitialize an ordered dictionary. The signature is the same as
regular dictionaries. Keyword argument order is preserved.
N)_OrderedDict__update)r otherr= s r __init__zOrderedDict.__init__f s$
e$$t$$$$$r c || vrO | x| j |< }| j }|j }|||c|_ |_ |_ ||_ || |_ || || dS )z!od.__setitem__(i, y) <==> od[i]=yN)r: r9 r/ r0 r) ) r r) value dict_setitemr Linklinkr> lasts r __setitem__zOrderedDict.__setitem__l sw
d??%)TVV +DJsOd;D9D-14 *DIty$( DI d DI T3&&&&&r c || | | j | }|j }|j }||_ ||_ d|_ d|_ dS )z od.__delitem__(y) <==> del od[y]N)r: popr/ r0 )r r) dict_delitemrG link_prev link_nexts r __delitem__zOrderedDict.__delitem__z sW T3 z~~c""I I " " r c # Z K | j }|j }||ur|j V |j }||udS dS )zod.__iter__() <==> iter(od)N)r9 r0 r) r r> currs r __iter__zOrderedDict.__iter__ L {y$ (NNN9D $ r c # Z K | j }|j }||ur|j V |j }||udS dS )z#od.__reversed__() <==> reversed(od)N)r9 r/ r) rQ s r r zOrderedDict.__reversed__ rT r c | j }|x|_ |_ | j t
| dS )z.od.clear() -> None. Remove all items from od.N)r9 r/ r0 r: clearr5 )r r> s r rW zOrderedDict.clear sC { $$ DI
4r Tc | st d | j }|r |j }|j }||_ ||_ n |j }|j }||_ ||_ |j }| j |= t | | }||fS )zRemove and return a (key, value) pair from the dictionary.
Pairs are returned in LIFO order if last is true or FIFO order if false.
zdictionary is empty)KeyErrorr9 r/ r0 r) r: r5 rK )r rH r> rG rM rN r) rD s r popitemzOrderedDict.popitem s
2011 1{ "9D I !IN!DII9D I!DI !INh JsOs##Ezr c | j | }|j }|j }|j }||_ ||_ | j }|r%|j }||_ ||_ ||_ ||_ dS |j }||_ ||_ ||_ ||_ dS )zMove an existing element to the end (or beginning if last is false).
Raise KeyError if the element does not exist.
N)r: r/ r0 r9 ) r r) rH rG rM rN soft_linkr> firsts r move_to_endzOrderedDict.move_to_end s
z#I I N " " { 9D DI DI!DI DIIIIE DI DI"EJ DIIIr c t j }t | dz } || j }| || j dz z
}| || j |z z
}| || j |z z
}|S )N )_sys getsizeoflen__dict__r: r7 r9 )r sizeofnsizes r
__sizeof__zOrderedDict.__sizeof__ s IIMvdm$$ tz""Q&& t''!++ t{##a'' r c t | S )z:D.keys() -> a set-like object providing a view on D's keys)r r s r keyszOrderedDict.keys s #D)))r c t | S )z a set-like object providing a view on D's items)r& r s r itemszOrderedDict.items s $T***r c t | S )z6D.values() -> an object providing a view on D's values)r+ r s r valueszOrderedDict.values s %d+++r c | j }t | || }||urF| j | }|j }|j }||_ ||_ d|_ d|_ |S ||u rt
| |S )zod.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)_OrderedDict__markerr5 rK r: r/ r0 rY )r r) defaultmarkerresultrG rM rN s r rK zOrderedDict.pop s $V,, :>>#&&D I I &IN &IN DI DIM f 3-- r Nc ( || v r| | S || |< |S )zInsert key with a value of default if key is not in the dictionary.
Return the value for key if key is in the dictionary, else default.
r$ r r) rr s r
setdefaultzOrderedDict.setdefault s%
$;;9 S r c | s| j j dS | j j dt | dS )zod.__repr__() <==> repr(od)()()) __class__r! listrm r s r __repr__zOrderedDict.__repr__ sL 7 !^ 4 4 46 6 >222D 4F4F4F4FGGr c | }|rt |t r|\ }}ni }| }| }t t D ].}| |d | |d /|r||f}n|pd}| j d|dt | fS )z%Return state information for picklingNr$ )
__getstate__
isinstancetuplecopyvarsr rK r| iterrm )r stateslotsks r
__reduce__zOrderedDict.__reduce__ s !!##
&%''
$ uuJJLLEJJLLE+--((
#
# !T""" !T""""
& u
~r5$TZZ\\0B0BBBr c , | | S )z!od.copy() -> a shallow copy of odr| r s r r zOrderedDict.copy% ~~d###r c . | }|D ]}|||< |S )zYCreate a new ordered dictionary with keys from iterable and values set to value.
r$ )r; iterablerD r r) s r fromkeyszOrderedDict.fromkeys) s. suu C DII r c t |t r>t | | o"t t t | | S t | | S )zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)r r r5 __eq__allmap_eqr rA s r r zOrderedDict.__eq__2 sX
e[ ) ) K;;tU++JCT54I4I0J0J J{{4'''r c 0 | | | S r )updater s r __ior__zOrderedDict.__ior__; s E r c t |t st S | | }| | |S r r r5 NotImplementedr| r r rA news r __or__zOrderedDict.__or__? sB %&& "! !nnT""
5
r c t |t st S | | }| | |S r r r s r __ror__zOrderedDict.__ror__F sB %&& "! !nnU##
4
r )r$ )Tr )'r! r" r# __doc__r6 rB r5 rI r8 r. rO rS r rW rZ r^ ri _collections_abcMutableMappingr r@ rk rm ro __ne__objectrq rK rw _recursive_reprr~ r r classmethodr r r r r r$ r r r r N s // % % % % "&!1e ' ' ' ' -1,< . 2 )7>>FX* * *+ + +, , ,
,
3FvxxH ' , _H H H C C C&$ $ $ [( ( ( r r )r ) _tuplegetterc > t t | | S )N)doc)property _itemgetter)indexr s r r \ s h{5/A/As&K&K&K r F)renamedefaultsmodulec t t r( dd t t t t
j t | } |r|t }t D ]^\ }}|
r(t | s| d s||v rd| |< |
| _| gz D ]n}t | t urt d |
st! d| t | rt! d| ot }D ]V}| d r|st! d| ||v rt! d| |
| Wi }|t# | }t% | t% k rt d
t' t) t t+ t) t) | }t# t t j t% d } d k r| dz
} d
d d D z dz t" j t& t" t$ t
t* f\ i d| d}
d| d| d} t1 | |
} d| _ d| d
| d| _ ||| _ t8 fd }
d| d|
j _ fd}d| d |_ fd }fd }fd }| |
j ||||fD ]}| d |j |_ | d
| dd!|| |
||||d" }t D ]/\ }}t
j d#| }t? || ||< 0t | t" f| }|F t
j d j! " d$d% }n# tF t f$ r Y nw xY w|||_$ |S )&aC Returns a new subclass of tuple with named fields.
>>> Point = namedtuple('Point', ['x', 'y'])
>>> Point.__doc__ # docstring for the new class
'Point(x, y)'
>>> p = Point(11, y=22) # instantiate with positional args or keywords
>>> p[0] + p[1] # indexable like a plain tuple
33
>>> x, y = p # unpack like a regular tuple
>>> x, y
(11, 22)
>>> p.x + p.y # fields also accessible by name
33
>>> d = p._asdict() # convert to a dictionary
>>> d['x']
11
>>> Point(**d) # convert from a dictionary
Point(x=11, y=22)
>>> p._replace(x=100) # _replace() is like str.replace() but targets named fields
Point(x=100, y=22)
, _z*Type names and field names must be stringsz6Type names and field names must be valid identifiers: z0Type names and field names cannot be a keyword: z-Field names cannot start with an underscore: z"Encountered duplicate field name: Nz(Got more default values than field names, r` rz c 3 K | ] }| d V
dS )z=%rNr$ ).0names r z namedtuple.. s( D D$||| D D D D D Dr r{ namedtuple_)
_tuple_new __builtins__r! z
lambda _cls, z: _tuple_new(_cls, (z))r6 zCreate new instance of c | | } | k r"t d dt | |S )Nz Expected z arguments, got ) TypeErrorrd )r; r rt _len
num_fields tuple_news r _makeznamedtuple.._make sQ 3)) 4<<: % % Q
Q QCKK Q QRR R
r z Make a new z# object from a sequence or iterablec | |j | }|r t dt | |S )Nz Got unexpected field names: )r rK
ValueErrorr} )r r= rt _map field_namess r _replacez namedtuple.._replace sO DD; = =>> L JDJJ J JKK K
r z
Return a new z2 object replacing specified fields with new valuesc ( | j j | z z S )z/Return a nicely formatted representation string)r| r! )r repr_fmts r r~ z namedtuple..__repr__ s ~&D 88r c 8 | j | S )z9Return a new dict which maps field names to their values.)_fields)r _dict_zips r _asdictznamedtuple.._asdict s! uTT$,--...r c | S )z7Return self as a plain tuple. Used by copy and pickle.r$ )r _tuples r __getnewargs__z"namedtuple..__getnewargs__ s vd||r .r$ ) r r2 r _field_defaultsr6 r r r~ r r __match_args__zAlias for field number r! __main__)%r strreplacesplitr} r rb internset enumerate isidentifier
_iskeyword
startswithaddtyper r r rd r5 r zipjoinr6 evalr! r __defaults__r __func__r# r _getframe f_globalsgetAttributeErrorr" ) typenamer r r r seenr r field_defaultsarg_list namespacecoder6 r r r~ r r methodclass_namespacer rt r r r r r r r r s ` @@@@@@@@r r
r
^ s 4 +s## <!))#s3399;; s3 ,,--K{3x==))H
uu$[11 KE4%%''
1 d##
1??3''
1 4<<%0[[ E" HHTNNNN
[( 3 3 ::S HII I "" 7 6-1 6 6 7 7
7 d 3 2)- 2 2 3 3
3 3 55D ??3 * * ) $ ) ) * *
* 4<< J$ J JKK K N?? x==3{++ + + FGG G htC0E0E080B0B-D -D (E (E F F G G DK5566K[!!Jyy%%HQCTYY D D D D DDDDsJH
I&*E3S&@#E64t
,(,, I
F8 E E E E ED4##G GFFF8FFFGO ' [ ,H , , ,EN 1 1 1 1H9 9 9 9 9/ / / / / /
> > "* = =FO = =
,,,,, ) (% O !-- 9 9 tk;E;;<< ,UC 8 8
(UHo
6
6F ~ ^A&&044ZLLFF
+ D
" Ms 7-Q% %Q98Q9c B | j }|D ]} ||d dz | |< dS )z!Tally elements from the iterable.r r` N)r )mappingr mapping_getelems r _count_elementsr
s> +K 1 1# D!,,q0
1 1r )r c e Zd ZdZd fd Zd Zd Zd dZd Ze d d Z
d fd Z d d
Z d Z
d Z fd
Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Z d Z d Z d Z d Z d Z! xZ"S )!r a Dict subclass for counting hashable items. Sometimes called a bag
or multiset. Elements are stored as dictionary keys and their counts
are stored as dictionary values.
>>> c = Counter('abcdeabcdabcaba') # count elements from a string
>>> c.most_common(3) # three most common elements
[('a', 5), ('b', 4), ('c', 3)]
>>> sorted(c) # list all unique elements
['a', 'b', 'c', 'd', 'e']
>>> ''.join(sorted(c.elements())) # list elements with repetitions
'aaaaabbbbcccdde'
>>> sum(c.values()) # total of all counts
15
>>> c['a'] # count of letter 'a'
5
>>> for elem in 'shazam': # update counts from an iterable
... c[elem] += 1 # by adding 1 to each element's count
>>> c['a'] # now there are seven 'a'
7
>>> del c['b'] # remove all 'b'
>>> c['b'] # now there are zero 'b'
0
>>> d = Counter('simsalabim') # make another counter
>>> c.update(d) # add in the second counter
>>> c['a'] # now there are nine 'a'
9
>>> c.clear() # empty the counter
>>> c
Counter()
Note: If a count is set to zero or reduced to zero, it will remain
in the counter until the entry is deleted or the counter is cleared:
>>> c = Counter('aaabbc')
>>> c['b'] -= 2 # reduce the count of 'b' by two
>>> c.most_common() # 'b' is still in, but its count is zero
[('a', 3), ('c', 1), ('b', 0)]
Nc d t | j |fi | dS )a Create a new, empty Counter object. And if given, count elements
from an input iterable. Or, initialize the count from another mapping
of elements to their counts.
>>> c = Counter() # a new, empty counter
>>> c = Counter('gallahad') # a new counter from an iterable
>>> c = Counter({'a': 4, 'b': 2}) # a new counter from a mapping
>>> c = Counter(a=4, b=2) # a new counter from keyword args
N)superrB r )r r r= r| s r rB zCounter.__init__K s; H%%%%%%%r c dS )z1The count of elements not in the Counter is zero.r r$ r( s r __missing__zCounter.__missing__Y s qr c D t | S )zSum of the counts)sumro r s r totalz
Counter.total^ s 4;;==!!!r c |1t | t d d S ddl}| || t d S )zList the n most common elements and their counts from the most
common to the least. If n is None, then list all element counts.
>>> Counter('abracadabra').most_common(3)
[('a', 5), ('b', 2), ('r', 2)]
Nr` T)r) reverser )r) )sortedrm r heapqnlargest)r rg r s r most_commonzCounter.most_commonb s]
9$**,,KNNDIII I ~~a ;q>>~BBBr c t t j t t | S )a Iterator over elements repeating each as many times as its count.
>>> c = Counter('ABCABC')
>>> sorted(c.elements())
['A', 'A', 'B', 'B', 'C', 'C']
# Knuth's example for prime factors of 1836: 2**2 * 3**3 * 17**1
>>> import math
>>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
>>> math.prod(prime_factors.elements())
1836
Note, if an element's count has been set to zero or is a negative
number, elements() will ignore it.
)_chain
from_iterable_starmap_repeatrm r s r elementszCounter.elementsr s' $ #HWdjjll$C$CDDDr c t d )Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)r; r vs r r zCounter.fromkeys s " NP P Pr c B |t |t j rX| r4| j }| D ]\ }}| ||d z | |< n2t | nt | | |r| | dS dS )a Like dict.update() but add counts instead of replacing them.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.update('witch') # add elements from another iterable
>>> d = Counter('watch')
>>> c.update(d) # add elements from another counter
>>> c['h'] # four 'h' in which, witch, and watch
4
Nr )r r Mappingr rm r r r )r r r= self_getr countr| s r r zCounter.update s ( ($4$<==
0 - #xH'/~~'7'7 ? ? e%*XXdA->->%>T
? GGNN8,,,, h/// KK r c |e| j }t |t j r-| D ]\ }} ||d |z
| |< n|D ]} ||d dz
| |< |r| | dS dS )a Like dict.update() but subtracts counts instead of replacing them.
Counts can be reduced below zero. Both the inputs and outputs are
allowed to contain zero and negative counts.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.subtract('witch') # subtract elements from another iterable
>>> c.subtract(Counter('watch')) # subtract elements from another counter
>>> c['h'] # 2 in which, minus 1 in witch, minus 1 in watch
0
>>> c['w'] # 1 in which, minus 1 in witch, minus 1 in watch
-1
Nr r` )r r r r rm subtract)r r r= r r r s r r zCounter.subtract s xH($4$<==
7#+>>#3#3 ; ;KD%!)$!2!2U!:DJJ; % 7 7D!)$!2!2Q!6DJJ MM$ r c , | | S )zReturn a shallow copy.r r s r r z Counter.copy r r c 0 | j t | ffS r )r| r5 r s r r zCounter.__reduce__ s ~T
},,r c V || v r#t | dS dS )zGLike dict.__delitem__() but does not raise KeyError for missing values.N)r rO )r r r| s r rO zCounter.__delitem__ s1 4<< GG % % % % % . = II1qII!47eAh&IIIIIIIr r r r r r s ``r r zCounter.__eq__
F %)) "! !IIIIIu
IIIIIIr c H t |t st S | |k S )z@True if any counts disagree. Missing counts are treated as zero.r r r r s r r zCounter.__ne__ s' %)) "! !5= r c z t t st S t fd fD S )z:True if all counts in self are a subset of those in other.c 3 F K | ]}|D ]}| | k V d S r r$ r s r r z!Counter.__le__.. r r r r s ``r __le__zCounter.__le__ r! r c R t |t st S | |k o| |k S )zATrue if all counts in self are a proper subset of those in other.r# r s r __lt__zCounter.__lt__ - %)) "! !u}. .r c z t t st S t fd fD S )z.& r r r r s ``r __ge__zCounter.__ge__" r! r c R t |t st S | |k o| |k S )zCTrue if all counts in self are a proper superset of those in other.r# r s r __gt__zCounter.__gt__( r) r c t |t st S t }| D ]\ }}||| z }|dk r|||< | D ]\ }}|| vr |dk r|||< |S )zAdd counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
r r r r rm r rA rt r r newcounts r __add__zCounter.__add__. s %)) "! ! ::<< ( (KD% uT{*H!|| 't ;;== % %KD%4 EAII $t
r c t |t st S t }| D ]\ }}||| z
}|dk r|||< | D ]\ }}|| vr|dk rd|z
||< |S )z Subtract count, but keep only results with positive counts.
>>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
r r0 r1 s r __sub__zCounter.__sub__A s %)) "! ! ::<< ( (KD% uT{*H!|| 't ;;== ) )KD%4 EAII 5yt
r c t |t st S t }| D ]"\ }}|| }||k r|n|}|dk r|||< #| D ]\ }}|| vr |dk r|||< |S )zUnion is the maximum of value in either of the input counters.
>>> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
r r0 r rA rt r r other_countr2 s r r zCounter.__or__T s %)) "! ! ::<< ( (KD% +K&+k&9&9{{uH!|| 't ;;== % %KD%4 EAII $t
r c t |t st S t }| D ]"\ }}|| }||k r|n|}|dk r|||< #|S )z Intersection is the minimum of corresponding counts.
>>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
r r0 r7 s r __and__zCounter.__and__h st %)) "! ! ::<< ( (KD% +K % 3 3uuH!|| 't
r c l t }| D ]\ }}|dk r|||< |S )zEAdds an empty counter, effectively stripping negative and zero countsr r rm r rt r r s r __pos__zCounter.__pos__y s> ::<< % %KD%qyy $t
r c r t }| D ]\ }}|dk rd|z
||< |S )z{Subtracts from an empty counter. Strips positive and zero counts,
and flips the sign on negative counts.
r r< r= s r __neg__zCounter.__neg__ sD
::<< ) )KD%qyy 5yt
r c R d | D }|D ]}| |= | S )z?Internal method to strip elements with a negative or zero countc $ g | ]
\ }}|d k |S )r r$ )r r r s r
z*Counter._keep_positive.. s! MMM e5199t999r )rm )r nonpositiver s r _keep_positivezCounter._keep_positive s: MMtzz||MMM DT
r c ~ | D ]\ }}| |xx |z
cc< | S )zInplace add from another counter, keeping only positive counts.
>>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
rm rE r rA r r s r __iadd__zCounter.__iadd__ I !;;== KD% JJJ% JJJJ""$$$r c ~ | D ]\ }}| |xx |z cc< | S )zInplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
rG rH s r __isub__zCounter.__isub__ rJ r c | D ]\ }}| | }||k r|| |< | S )zInplace union is the maximum of value from either counter.
>>> c = Counter('abbb')
>>> c |= Counter('bcc')
>>> c
Counter({'b': 3, 'c': 2, 'a': 1})
rG )r rA r r8 r s r r zCounter.__ior__ sP "' ) ) D+JEU"" (T
""$$$r c | D ]\ }}|| }||k r|| |< | S )zInplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
rG )r rA r r r8 s r __iand__zCounter.__iand__ sO ::<< ) )KD% +KU"" (T
""$$$r r )#r! r" r# r rB r r r r r r r r r r rO r~ r r r& r( r, r. r3 r5 r r: r> r@ rE rI rL r rO
__classcell__r s @r r r s6 * *d & & & & & &
" " "C C C C E E E, P P P [ P D 6$ $ $- - -& & & & &
3 3 3ZJ J J ! ! ! J J J / / / J J J / / / & & ( " % % % % % %
%
%
%
%
%
%
%
%
%
%r r c e Zd ZdZd Zd Zd ZddZd Zd Z d Z
d
Z e d Z
ed Zd
ZeZddZed Zd Zd Zd Zd Zd Zd Zd Zd Z dS )r a A ChainMap groups multiple dicts (or other mappings) together
to create a single, updateable view.
The underlying mappings are stored in a list. That list is public and can
be accessed or updated using the *maps* attribute. There is no other
state.
Lookups search the underlying mappings successively until a key is found.
In contrast, writes, updates, and deletions only operate on the first
mapping.
c 4 t | pi g| _ dS )zInitialize a ChainMap by setting *maps* to the given mappings.
If no mappings are provided, a single empty dictionary is used.
N)r} maps)r rS s r rB zChainMap.__init__ s
JJ&2$ r c t | r )rY r( s r r zChainMap.__missing__ s smmr c t | j D ] } || c S # t $ r Y w xY w| | S r )rS rY r )r r) r s r __getitem__zChainMap.__getitem__ s\ y G
s|###
$$$s
""Nc || v r| | n|S r r$ rv s r r z ChainMap.get s 4KKtCyyW4r c R t t j | j S r )rd r unionrS r s r __len__zChainMap.__len__ s ;355; *+++r c i }t | j D ]/}| t | 0t | S r )r rS r r5 r r )r r r s r rS zChainMap.__iter__ sL ** - -G
HHT]]7++ , , , ,Awwr c D t fd| j D S )Nc 3 K | ]}|v V d S r r$ )r mr) s r r z(ChainMap.__contains__.. s' //3!8//////r anyrS r( s `r __contains__zChainMap.__contains__ s( ////TY//////r c * t | j S r r_ r s r __bool__zChainMap.__bool__ 49~~ r c | | j j dd t t | j dS )Nrz r r{ )r| r! r r reprrS r s r r~ zChainMap.__repr__ s6 .)NNDIIc$ 6J6J,K,KNNNNr c 8 | t j |g|R S )z?Create a ChainMap with a single dict created from the iterable.)r5 r )r; r r< s r r zChainMap.fromkeys s& s4=1D111222r c r | j | j d g| j dd R S )zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r r` N)r| rS r r s r r z
ChainMap.copy s8 t~dil / / 1 1BDIabbMBBBBr c ` ||}n|r| | | j |g| j R S )zNew ChainMap with a new map followed by all previous maps.
If no map is provided, an empty dict is used.
Keyword arguments update the map or new empty dict.
)r r| rS )r r^ kwargss r new_childzChainMap.new_child sF
9AA
HHV t~a,$),,,,r c 0 | j | j dd S )zNew ChainMap from maps[1:].r` N)r| rS r s r parentszChainMap.parents s t~ty}--r c & || j d |< d S Nr )rS )r r) rD s r rI zChainMap.__setitem__! s ! ! Sr c d | j d |= d S # t $ r t d| w xY w)Nr $Key not found in the first mapping: )rS rY r( s r rO zChainMap.__delitem__$ sR K ! S!!! K K KI#IIJJ J Ks /c | | j d S # t $ r t d w xY w)zPRemove and return an item pair from maps[0]. Raise KeyError is maps[0] is empty.r z#No keys found in the first mapping.)rS rZ rY r s r rZ zChainMap.popitem* sN B9Q<'')) ) B B B@AA A Bs ! ;c v | j d j |g|R S # t $ r t d| w xY w)zWRemove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].r rq )rS rK rY )r r) r< s r rK z ChainMap.pop1 s_ K#49Q<#C/$/// / K K KI#IIJJ J Ks 8c D | j d dS )z'Clear maps[0], leaving maps[1:] intact.r N)rS rW r s r rW zChainMap.clear8 s ! r c F | j d | | S ro )rS r r s r r zChainMap.__ior__< s! ! E""" r c t |t j st S | }|j d | |S ro )r r r r r rS r )r rA r^ s r r zChainMap.__or__@ sJ %!1!9:: "! ! IIKK q r c t |t j st S t | }t | j D ]}| | | | S r ) r r r r r5 r rS r r| )r rA r^ childs r r zChainMap.__ror__G se %!1!9:: "! ! KK di(( E
HHUOOOO~~a r r ) r! r" r# r rB r rV r rZ rS ra rc r r~ r r r __copy__rk r rm rI rO rZ rK rW r r r r$ r r r r s ' ' ' % % %5 5 5 5, , , 0 0 0 _O O O 3 3 [3C C C H - - - - . . X." " "K K K B B BK K K ! ! ! ! !r r c v e Zd ZddZd Zd Zd Zd Zd Zd Z d Z
d
Z d Z d Z
d
Zd Zedd ZdS )r Nc t i | _ || | |r| | d S d S r )datar )r r5 rj s r rB zUserDict.__init__W sK KK KK r c * t | j S r rd r| r s r rZ zUserDict.__len__^ rd r c || j v r
| j | S t | j d r| j | | S t | )Nr )r| hasattrr| r rY r( s r rV zUserDict.__getitem__a sS $) 9S> ! 4>= 1 1 9>--dC88 8smmr c || j |< d S r r| )r r) items r rI zUserDict.__setitem__h s #r c | j |= d S r r r( s r rO zUserDict.__delitem__k s IcNNNr c * t | j S r )r r| r s r rS zUserDict.__iter__n DI r c || j v S r r r( s r ra zUserDict.__contains__r s di r c * t | j S r rf r| r s r r~ zUserDict.__repr__v r r c t |t r"| | j |j z S t |t r | | j |z S t
S r r r r| r| r5 r r s r r zUserDict.__or__y s` eX & & :>>$)ej"899 9 eT " " 5>>$)e"344 4 r c t |t r"| |j | j z S t |t r | || j z S t
S r r r s r r zUserDict.__ror__ s` eX & & :>>%*ty"899 9 eT " " 5>>%$)"344 4 r c | t |t r| xj |j z c_ n| xj |z c_ | S r )r r r| r s r r zUserDict.__ior__ s= eX & & II #III II II r c | j | j }|j | j | j d |j d< |S Nr| )r| r6 re r r r insts r ry zUserDict.__copy__ sU ~%%dn55
T]+++ $
f 5 : : < <
f r c | j t u r&t | j S dd l}| j } i | _ | | }|| _ n # || _ w xY w| | |S ro )r| r r| r r )r r r| r s r r z
UserDict.copy s >X % %DINN , ,-- - y DI $A DIIDI s A% % A.c . | }|D ]}|||< |S r r$ )r; r rD r r) s r r zUserDict.fromkeys s, CEE CAcFFr r )r! r" r# rB rZ rV rI rO rS ra r~ r r r ry r r r r$ r r r r T s [ r r c e Zd ZdZd"dZd Zd Zd Zd Zd Z d Z
d
Z d Z d Z
d
Zd Zd Zd Zd Zd Zd ZeZd Zd Zd Zd Zd#dZd Zd Z d Z d Z d Z d Z d Z!d! Z"dS )$r zAA more or less complete user-defined wrapper around list objects.Nc
g | _ |yt | t | j k r|| j d d < d S t |t r|j d d | j d d < d S t | | _ d S d S r )r| r r r r} )r initlists r rB zUserList.__init__ s H~~di 00 ' !!! Hh//
+ '}QQQ / !!! NN r c * t | j S r r r s r r~ zUserList.__repr__ r r c > | j | | k S r r| _UserList__castr s r r( zUserList.__lt__ y4;;u----r c > | j | | k S r r r s r r& zUserList.__le__ yDKK . ...r c > | j | | k S r r r s r r zUserList.__eq__ r r c > | j | | k S r r r s r r. zUserList.__gt__ r r c > | j | | k S r r r s r r, zUserList.__ge__ r r c > t |t r|j n|S r )r r r| r s r __castzUserList.__cast s 'x 8 8CuzzeCr c || j v S r r r r s r ra zUserList.__contains__ s ty r c * t | j S r r~ r s r rZ zUserList.__len__ rd r c t |t r | | j | S | j | S r )r slicer| r| r is r rV zUserList.__getitem__ s8 a >>$)A,// /9Q< r c || j |< d S r r r r r s r rI zUserList.__setitem__ s ! r c | j |= d S r r r s r rO zUserList.__delitem__ s IaLLLr c B t |t r"| | j |j z S t |t | j r | | j |z S | | j t | z S r r r r| r| r r} r s r r3 zUserList.__add__ s eX & & 5>>$)ej"899 9
tDI
/
/ 5>>$)e"344 4~~di$u++ 5666r c B t |t r"| |j | j z S t |t | j r | || j z S | t | | j z S r r r s r __radd__zUserList.__radd__ s eX & & 5>>%*ty"899 9
tDI
/
/ 5>>%$)"344 4~~d5kkDI 5666r c t |t r| xj |j z
c_ nPt |t | j r| xj |z
c_ n | xj t | z
c_ | S r )r r r| r r} r s r rI zUserList.__iadd__ so eX & & % II #III
tDI
/
/ % II III IIe $II r c < | | j |z S r r| r| r rg s r __mul__zUserList.__mul__ ~~di!m,,,r c & | xj |z c_ | S r r r s r __imul__zUserList.__imul__ s Q r c | j | j }|j | j | j d d d |j d< |S r )r| r6 re r r s r ry zUserList.__copy__ sR ~%%dn55
T]+++ $
f 5aaa 8
f r c : | j | d S r )r| appendr s r r zUserList.append
r c < | j || d S r )r| insertr s r r zUserList.insert
s D!!!!!r c 6 | j | S r )r| rK r s r rK z UserList.pop s y}}Q r c : | j | d S r )r| remover s r r zUserList.remove r r c 8 | j d S r )r| rW r s r rW zUserList.clear s r c , | | S r r r s r r z
UserList.copy s ~~d###r c 6 | j | S r )r| r r s r r zUserList.count s yt$$$r c ( | j j |g|R S r r| r )r r r< s r r zUserList.index s tyt+d++++r c 8 | j d S r )r| r r s r r zUserList.reverse" s r c * | j j |i | d S r )r| sortr r< r= s r r z
UserList.sort% s! %%%%%%r c t |t r!| j |j d S | j | d S r )r r r| extendr s r r zUserList.extend( sN eX & & $ I UZ ( ( ( ( ( I U # # # # #r r r )#r! r" r# r rB r~ r( r& r r. r, r ra rZ rV rI rO r3 r rI r __rmul__r ry r r rK r rW r r r r r r r$ r r r r s KK + + + + . . ./ / // / /. . ./ / /D D D! ! ! 7 7 77 7 7 - - - H " " " $ $ $% % %, , , & & &$ $ $ $ $r r c 4 e Zd Zd Zd Zd Zd Zd Zd Zd Z d Z
d Z d
Z d Z
d Zd
Zd Zd Zd Zd Zd Zd ZeZd Zd Zd Zd Zd Zde j fdZ d Z d Z dKd Z!de j fd Z"dLd"Z#de j fd#Z$d$ Z%d% Z&de j fd&Z'd' Z(d( Z)d) Z*d* Z+d+ Z,d, Z-d- Z.d. Z/d/ Z0d0 Z1d1 Z2d2 Z3d3 Z4d4 Z5d5 Z6dMd7Z7e8j9 Z9d8 Z:dNd:Z;de j fd;Zd> Z?dMd?Z@dOd@ZAdOdAZBdPdCZCde j fdDZDdMdEZEdF ZFdG ZGdH ZHdI ZIdJ ZJd6S )Qr c t |t r || _ d S t |t r|j d d | _ d S t | | _ d S r )r r r| r r seqs r rB zUserString.__init__5 sW c3 !DIII
Z
(
( ! DIIICDIIIr c * t | j S r )r r| r s r __str__zUserString.__str__= rd r c * t | j S r r r s r r~ zUserString.__repr__@ r r c * t | j S r )intr| r s r __int__zUserString.__int__C rd r c * t | j S r )floatr| r s r __float__zUserString.__float__F s TY r c * t | j S r )complexr| r s r __complex__zUserString.__complex__I s ty!!!r c * t | j S r )hashr| r s r __hash__zUserString.__hash__L r r c " | j d d fS r r r s r r zUserString.__getnewargs__O s !!! r c b t |t r| j |j k S | j |k S r r r r| r strings r r zUserString.__eq__R 0 fj ) ) ,9 + +yF""r c b t |t r| j |j k S | j |k S r r r s r r( zUserString.__lt__W 0 fj ) ) +9v{* *y6!!r c b t |t r| j |j k S | j |k S r r r s r r& zUserString.__le__\ r r c b t |t r| j |j k S | j |k S r r r s r r. zUserString.__gt__a r r c b t |t r| j |j k S | j |k S r r r s r r, zUserString.__ge__f r r c L t |t r|j }|| j v S r r )r chars r ra zUserString.__contains__k s( dJ ' ' 9Dty r c * t | j S r r~ r s r rZ zUserString.__len__p rd r c B | | j | S r r )r r s r rV zUserString.__getitem__s s ~~di .///r c ( t |t r"| | j |j z S t |t r | | j |z S | | j t | z S r )r r r| r| r r s r r3 zUserString.__add__v sy eZ ( ( 5>>$)ej"899 9
s
#
# 5>>$)e"344 4~~di#e** 4555r c t |t r | || j z S | t | | j z S r )r r r| r| r s r r zUserString.__radd__} sL eS ! ! 5>>%$)"344 4~~c%jj49 4555r c < | | j |z S r r r s r r zUserString.__mul__ r r c < | | j |z S r r r r< s r __mod__zUserString.__mod__ s ~~di$ .///r c L | t | | z S r )r| r )r templates r __rmod__zUserString.__rmod__ s ~~c(mmd 2333r c Z | | j S r )r| r|
capitalizer s r r zUserString.capitalize s" ~~di 2 2 4 4555r c Z | | j S r )r| r| casefoldr s r r zUserString.casefold " ~~di 0 0 2 2333r c N | | j j |g|R S r )r| r| centerr widthr< s r r zUserString.center s, ~~ .di .u > > !dl 0 0 0 0
> > >
> > >
2 2 2 2
&'DL 6 6 6 6= = = = T\ / / / /
/ / /- - - !dl 0 0 0 0# # ## # ## # #% % %# # #( ( (# # #% % %' ' '# # ## # ## # ## # #= = =1 1 17 7 7 7
I( ( (E E E E !dl 0 0 0 0
!"t| 1 1 1 1= = =) ) )7 7 7 7. . . ./ / / /. . . . ()dl 8 8 8 86 6 6 64 4 41 1 1: : :1 1 16 6 6 6 6r r )4r __all__r sysrb itertoolsr r r
r
r r keywordr r operatorr r r r reprlibr r _weakrefr r8 _collectionsr MutableSequenceregister ImportErrorr KeysViewr ItemsViewr&
ValuesViewr+ r r. r5 r r r
r r r r r r Sequencer r$ r r r sK
% % % % % % ' ' ' ' ' ' ) ) ) ) ) ) + + + + + + . . . . . . 5 5 5 5 5 5 $ $ $ $ $ $5"""""" $--e4444 D
((((((( D + + + + ++4 + + +
, , , , , , 6 , , , % % % % % - 8 % % % 5 5 5 5 5F 5 5 5} } } } }$ } } }@ ((((((( D L))))))) L L LKKLLLL 16T h h h h h^1 1 1 ,,,,,,, D q% q% q% q% q%d q% q% q%p
}! }! }! }! }! . }! }! }!HS S S S S . S S St~$ ~$ ~$ ~$ ~$ / ~$ ~$ ~$Ju6 u6 u6 u6 u6!* u6 u6 u6 u6 u6sZ A! !A)(A)-A4 4A<;A<C C$#C$(C/ /C:9C: D DDPK ! < < __pycache__/abc.cpython-311.pycnu [
!A?hw & d dl T d dl mZ d dl mZ dS ) )*)__all__)_CallableGenericAliasN)_collections_abcr r r
s; $ $ $ $ $ $ 2 2 2 2 2 2 2 2r PK ! < < % __pycache__/abc.cpython-311.opt-1.pycnu [
!A?hw & d dl T d dl mZ d dl mZ dS ) )*)__all__)_CallableGenericAliasN)_collections_abcr r r
s; $ $ $ $ $ $ 2 2 2 2 2 2 2 2r PK ! Cܝ1 1 * __pycache__/__init__.cpython-311.opt-1.pycnu [
!A?h2 d Z g dZddlZddlZddlmZ ddlmZ ddlm
Z ddl m
Z ddlmZ dd lmZ dd
lmZ dd lmZ dd lmZ ej e n # e $ r Y nw xY w dd
lm Z n # e $ r Y nw xY w G d dej Z! G d dej" Z# G d dej$ Z% G d de& Z' G d de( Z) ddlm)Z) n # e $ r Y nw xY w ddlm*Z* n# e $ r d Z*Y nw xY wdddd d Z+d Z, dd lm,Z, n # e $ r Y nw xY w G d d!e( Z- G d" d#ej. Z/ G d$ d%ej. Z0 G d& d'ej Z1 G d( d)ej2 Z3dS )*a? This module implements specialized container datatypes providing
alternatives to Python's general purpose built-in containers, dict,
list, set, and tuple.
* namedtuple factory function for creating tuple subclasses with named fields
* deque list-like container with fast appends and pops on either end
* ChainMap dict-like class for creating a single view of multiple mappings
* Counter dict subclass for counting hashable objects
* OrderedDict dict subclass that remembers the order entries were added
* defaultdict dict subclass that calls a factory function to supply missing values
* UserDict wrapper around dictionary objects for easier dict subclassing
* UserList wrapper around list objects for easier list subclassing
* UserString wrapper around string objects for easier string subclassing
) ChainMapCounter OrderedDictUserDictUserList
UserString defaultdictdeque
namedtuple N)chain)repeat)starmap) iskeyword)eq)
itemgetter)recursive_repr)proxy)r )r c e Zd Zd ZdS )_OrderedDictKeysViewc # > K t | j E d {V d S Nreversed_mappingselfs A/opt/alt/python-internal/lib64/python3.11/collections/__init__.py __reversed__z!_OrderedDictKeysView.__reversed__< s. DM*********** N__name__
__module__ __qualname__r r r r r : s# + + + + +r r c e Zd Zd ZdS )_OrderedDictItemsViewc # Z K t | j D ]}|| j | fV d S r r r keys r r z"_OrderedDictItemsView.__reversed__A sD DM** , ,C
c*+ + + + + , ,r Nr r$ r r r& r& ? s# , , , , ,r r& c e Zd Zd ZdS )_OrderedDictValuesViewc # V K t | j D ]}| j | V d S r r r( s r r z#_OrderedDictValuesView.__reversed__G s? DM** % %C-$ $ $ $ $ % %r Nr r$ r r r+ r+ E s# % % % % %r r+ c e Zd ZdZdS )_Link)prevnextr) __weakref__N)r! r" r# __slots__r$ r r r. r. K s 4IIIr r. c B e Zd ZdZd Zd dZej ee fdZej
fdZ
d Z d Z d Z
d d Zd d Zd
Zej j xZZd Zd Zd Zej j Z e ZefdZd dZ e d Z d Z d Z e!d d Z"d Z#d Z$d Z%d Z&dS ) r z)Dictionary that remembers insertion orderc t | }t |_ t |j x|_ }|x|_ |_ i |_ |S )zDCreate the ordered dict object and set up the underlying structures.) dict__new__r. _OrderedDict__hardroot_proxy_OrderedDict__rootr/ r0 _OrderedDict__map)clsargskwdsr roots r r6 zOrderedDict.__new__] sN ||C '' #DO 4 44 d $$ DI
r r$ c " | j |fi | dS )zInitialize an ordered dictionary. The signature is the same as
regular dictionaries. Keyword argument order is preserved.
N)_OrderedDict__update)r otherr= s r __init__zOrderedDict.__init__f s$
e$$t$$$$$r c || vrO | x| j |< }| j }|j }|||c|_ |_ |_ ||_ || |_ || || dS )z!od.__setitem__(i, y) <==> od[i]=yN)r: r9 r/ r0 r) ) r r) value dict_setitemr Linklinkr> lasts r __setitem__zOrderedDict.__setitem__l sw
d??%)TVV +DJsOd;D9D-14 *DIty$( DI d DI T3&&&&&r c || | | j | }|j }|j }||_ ||_ d|_ d|_ dS )z od.__delitem__(y) <==> del od[y]N)r: popr/ r0 )r r) dict_delitemrG link_prev link_nexts r __delitem__zOrderedDict.__delitem__z sW T3 z~~c""I I " " r c # Z K | j }|j }||ur|j V |j }||udS dS )zod.__iter__() <==> iter(od)N)r9 r0 r) r r> currs r __iter__zOrderedDict.__iter__ L {y$ (NNN9D $ r c # Z K | j }|j }||ur|j V |j }||udS dS )z#od.__reversed__() <==> reversed(od)N)r9 r/ r) rQ s r r zOrderedDict.__reversed__ rT r c | j }|x|_ |_ | j t
| dS )z.od.clear() -> None. Remove all items from od.N)r9 r/ r0 r: clearr5 )r r> s r rW zOrderedDict.clear sC { $$ DI
4r Tc | st d | j }|r |j }|j }||_ ||_ n |j }|j }||_ ||_ |j }| j |= t | | }||fS )zRemove and return a (key, value) pair from the dictionary.
Pairs are returned in LIFO order if last is true or FIFO order if false.
zdictionary is empty)KeyErrorr9 r/ r0 r) r: r5 rK )r rH r> rG rM rN r) rD s r popitemzOrderedDict.popitem s
2011 1{ "9D I !IN!DII9D I!DI !INh JsOs##Ezr c | j | }|j }|j }|j }||_ ||_ | j }|r%|j }||_ ||_ ||_ ||_ dS |j }||_ ||_ ||_ ||_ dS )zMove an existing element to the end (or beginning if last is false).
Raise KeyError if the element does not exist.
N)r: r/ r0 r9 ) r r) rH rG rM rN soft_linkr> firsts r move_to_endzOrderedDict.move_to_end s
z#I I N " " { 9D DI DI!DI DIIIIE DI DI"EJ DIIIr c t j }t | dz } || j }| || j dz z
}| || j |z z
}| || j |z z
}|S )N )_sys getsizeoflen__dict__r: r7 r9 )r sizeofnsizes r
__sizeof__zOrderedDict.__sizeof__ s IIMvdm$$ tz""Q&& t''!++ t{##a'' r c t | S )z:D.keys() -> a set-like object providing a view on D's keys)r r s r keyszOrderedDict.keys s #D)))r c t | S )z a set-like object providing a view on D's items)r& r s r itemszOrderedDict.items s $T***r c t | S )z6D.values() -> an object providing a view on D's values)r+ r s r valueszOrderedDict.values s %d+++r c | j }t | || }||urF| j | }|j }|j }||_ ||_ d|_ d|_ |S ||u rt
| |S )zod.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)_OrderedDict__markerr5 rK r: r/ r0 rY )r r) defaultmarkerresultrG rM rN s r rK zOrderedDict.pop s $V,, :>>#&&D I I &IN &IN DI DIM f 3-- r Nc ( || v r| | S || |< |S )zInsert key with a value of default if key is not in the dictionary.
Return the value for key if key is in the dictionary, else default.
r$ r r) rr s r
setdefaultzOrderedDict.setdefault s%
$;;9 S r c | s| j j dS | j j dt | dS )zod.__repr__() <==> repr(od)()()) __class__r! listrm r s r __repr__zOrderedDict.__repr__ sL 7 !^ 4 4 46 6 >222D 4F4F4F4FGGr c | }|rt |t r|\ }}ni }| }| }t t D ].}| |d | |d /|r||f}n|pd}| j d|dt | fS )z%Return state information for picklingNr$ )
__getstate__
isinstancetuplecopyvarsr rK r| iterrm )r stateslotsks r
__reduce__zOrderedDict.__reduce__ s !!##
&%''
$ uuJJLLEJJLLE+--((
#
# !T""" !T""""
& u
~r5$TZZ\\0B0BBBr c , | | S )z!od.copy() -> a shallow copy of odr| r s r r zOrderedDict.copy% ~~d###r c . | }|D ]}|||< |S )zYCreate a new ordered dictionary with keys from iterable and values set to value.
r$ )r; iterablerD r r) s r fromkeyszOrderedDict.fromkeys) s. suu C DII r c t |t r>t | | o"t t t | | S t | | S )zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)r r r5 __eq__allmap_eqr rA s r r zOrderedDict.__eq__2 sX
e[ ) ) K;;tU++JCT54I4I0J0J J{{4'''r c 0 | | | S r )updater s r __ior__zOrderedDict.__ior__; s E r c t |t st S | | }| | |S r r r5 NotImplementedr| r r rA news r __or__zOrderedDict.__or__? sB %&& "! !nnT""
5
r c t |t st S | | }| | |S r r r s r __ror__zOrderedDict.__ror__F sB %&& "! !nnU##
4
r )r$ )Tr )'r! r" r# __doc__r6 rB r5 rI r8 r. rO rS r rW rZ r^ ri _collections_abcMutableMappingr r@ rk rm ro __ne__objectrq rK rw _recursive_reprr~ r r classmethodr r r r r r$ r r r r N s // % % % % "&!1e ' ' ' ' -1,< . 2 )7>>FX* * *+ + +, , ,
,
3FvxxH ' , _H H H C C C&$ $ $ [( ( ( r r )r ) _tuplegetterc > t t | | S )N)doc)property _itemgetter)indexr s r r \ s h{5/A/As&K&K&K r F)renamedefaultsmodulec t t r( dd t t t t
j t | } |r|t }t D ]^\ }}|
r(t | s| d s||v rd| |< |
| _| gz D ]n}t | t urt d |
st! d| t | rt! d| ot }D ]V}| d r|st! d| ||v rt! d| |
| Wi }|t# | }t% | t% k rt d
t' t) t t+ t) t) | }t# t t j t% d } d k r| dz
} d
d d D z dz t" j t& t" t$ t
t* f\ i d| d}
d| d| d} t1 | |
} d| _ d| d
| d| _ ||| _ t8 fd }
d| d|
j _ fd}d| d |_ fd }fd }fd }| |
j ||||fD ]}| d |j |_ | d
| dd!|| |
||||d" }t D ]/\ }}t
j d#| }t? || ||< 0t | t" f| }|F t
j d j! " d$d% }n# tF t f$ r Y nw xY w|||_$ |S )&aC Returns a new subclass of tuple with named fields.
>>> Point = namedtuple('Point', ['x', 'y'])
>>> Point.__doc__ # docstring for the new class
'Point(x, y)'
>>> p = Point(11, y=22) # instantiate with positional args or keywords
>>> p[0] + p[1] # indexable like a plain tuple
33
>>> x, y = p # unpack like a regular tuple
>>> x, y
(11, 22)
>>> p.x + p.y # fields also accessible by name
33
>>> d = p._asdict() # convert to a dictionary
>>> d['x']
11
>>> Point(**d) # convert from a dictionary
Point(x=11, y=22)
>>> p._replace(x=100) # _replace() is like str.replace() but targets named fields
Point(x=100, y=22)
, _z*Type names and field names must be stringsz6Type names and field names must be valid identifiers: z0Type names and field names cannot be a keyword: z-Field names cannot start with an underscore: z"Encountered duplicate field name: Nz(Got more default values than field names, r` rz c 3 K | ] }| d V
dS )z=%rNr$ ).0names r z namedtuple.. s( D D$||| D D D D D Dr r{ namedtuple_)
_tuple_new __builtins__r! z
lambda _cls, z: _tuple_new(_cls, (z))r6 zCreate new instance of c | | } | k r"t d dt | |S )Nz Expected z arguments, got ) TypeErrorrd )r; r rt _len
num_fields tuple_news r _makeznamedtuple.._make sQ 3)) 4<<: % % Q
Q QCKK Q QRR R
r z Make a new z# object from a sequence or iterablec | |j | }|r t dt | |S )Nz Got unexpected field names: )r rK
ValueErrorr} )r r= rt _map field_namess r _replacez namedtuple.._replace sO DD; = =>> L JDJJ J JKK K
r z
Return a new z2 object replacing specified fields with new valuesc ( | j j | z z S )z/Return a nicely formatted representation string)r| r! )r repr_fmts r r~ z namedtuple..__repr__ s ~&D 88r c 8 | j | S )z9Return a new dict which maps field names to their values.)_fields)r _dict_zips r _asdictznamedtuple.._asdict s! uTT$,--...r c | S )z7Return self as a plain tuple. Used by copy and pickle.r$ )r _tuples r __getnewargs__z"namedtuple..__getnewargs__ s vd||r .r$ ) r r2 r _field_defaultsr6 r r r~ r r __match_args__zAlias for field number r! __main__)%r strreplacesplitr} r rb internset enumerate isidentifier
_iskeyword
startswithaddtyper r r rd r5 r zipjoinr6 evalr! r __defaults__r __func__r# r _getframe f_globalsgetAttributeErrorr" ) typenamer r r r seenr r field_defaultsarg_list namespacecoder6 r r r~ r r methodclass_namespacer rt r r r r r r r r s ` @@@@@@@@r r
r
^ s 4 +s## <!))#s3399;; s3 ,,--K{3x==))H
uu$[11 KE4%%''
1 d##
1??3''
1 4<<%0[[ E" HHTNNNN
[( 3 3 ::S HII I "" 7 6-1 6 6 7 7
7 d 3 2)- 2 2 3 3
3 3 55D ??3 * * ) $ ) ) * *
* 4<< J$ J JKK K N?? x==3{++ + + FGG G htC0E0E080B0B-D -D (E (E F F G G DK5566K[!!Jyy%%HQCTYY D D D D DDDDsJH
I&*E3S&@#E64t
,(,, I
F8 E E E E ED4##G GFFF8FFFGO ' [ ,H , , ,EN 1 1 1 1H9 9 9 9 9/ / / / / /
> > "* = =FO = =
,,,,, ) (% O !-- 9 9 tk;E;;<< ,UC 8 8
(UHo
6
6F ~ ^A&&044ZLLFF
+ D
" Ms 7-Q% %Q98Q9c B | j }|D ]} ||d dz | |< dS )z!Tally elements from the iterable.r r` N)r )mappingr mapping_getelems r _count_elementsr
s> +K 1 1# D!,,q0
1 1r )r c e Zd ZdZd fd Zd Zd Zd dZd Ze d d Z
d fd Z d d
Z d Z
d Z fd
Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Z d Z d Z d Z d Z d Z! xZ"S )!r a Dict subclass for counting hashable items. Sometimes called a bag
or multiset. Elements are stored as dictionary keys and their counts
are stored as dictionary values.
>>> c = Counter('abcdeabcdabcaba') # count elements from a string
>>> c.most_common(3) # three most common elements
[('a', 5), ('b', 4), ('c', 3)]
>>> sorted(c) # list all unique elements
['a', 'b', 'c', 'd', 'e']
>>> ''.join(sorted(c.elements())) # list elements with repetitions
'aaaaabbbbcccdde'
>>> sum(c.values()) # total of all counts
15
>>> c['a'] # count of letter 'a'
5
>>> for elem in 'shazam': # update counts from an iterable
... c[elem] += 1 # by adding 1 to each element's count
>>> c['a'] # now there are seven 'a'
7
>>> del c['b'] # remove all 'b'
>>> c['b'] # now there are zero 'b'
0
>>> d = Counter('simsalabim') # make another counter
>>> c.update(d) # add in the second counter
>>> c['a'] # now there are nine 'a'
9
>>> c.clear() # empty the counter
>>> c
Counter()
Note: If a count is set to zero or reduced to zero, it will remain
in the counter until the entry is deleted or the counter is cleared:
>>> c = Counter('aaabbc')
>>> c['b'] -= 2 # reduce the count of 'b' by two
>>> c.most_common() # 'b' is still in, but its count is zero
[('a', 3), ('c', 1), ('b', 0)]
Nc d t | j |fi | dS )a Create a new, empty Counter object. And if given, count elements
from an input iterable. Or, initialize the count from another mapping
of elements to their counts.
>>> c = Counter() # a new, empty counter
>>> c = Counter('gallahad') # a new counter from an iterable
>>> c = Counter({'a': 4, 'b': 2}) # a new counter from a mapping
>>> c = Counter(a=4, b=2) # a new counter from keyword args
N)superrB r )r r r= r| s r rB zCounter.__init__K s; H%%%%%%%r c dS )z1The count of elements not in the Counter is zero.r r$ r( s r __missing__zCounter.__missing__Y s qr c D t | S )zSum of the counts)sumro r s r totalz
Counter.total^ s 4;;==!!!r c |1t | t d d S ddl}| || t d S )zList the n most common elements and their counts from the most
common to the least. If n is None, then list all element counts.
>>> Counter('abracadabra').most_common(3)
[('a', 5), ('b', 2), ('r', 2)]
Nr` T)r) reverser )r) )sortedrm r heapqnlargest)r rg r s r most_commonzCounter.most_commonb s]
9$**,,KNNDIII I ~~a ;q>>~BBBr c t t j t t | S )a Iterator over elements repeating each as many times as its count.
>>> c = Counter('ABCABC')
>>> sorted(c.elements())
['A', 'A', 'B', 'B', 'C', 'C']
# Knuth's example for prime factors of 1836: 2**2 * 3**3 * 17**1
>>> import math
>>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
>>> math.prod(prime_factors.elements())
1836
Note, if an element's count has been set to zero or is a negative
number, elements() will ignore it.
)_chain
from_iterable_starmap_repeatrm r s r elementszCounter.elementsr s' $ #HWdjjll$C$CDDDr c t d )Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)r; r vs r r zCounter.fromkeys s " NP P Pr c B |t |t j rX| r4| j }| D ]\ }}| ||d z | |< n2t | nt | | |r| | dS dS )a Like dict.update() but add counts instead of replacing them.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.update('witch') # add elements from another iterable
>>> d = Counter('watch')
>>> c.update(d) # add elements from another counter
>>> c['h'] # four 'h' in which, witch, and watch
4
Nr )r r Mappingr rm r r r )r r r= self_getr countr| s r r zCounter.update s ( ($4$<==
0 - #xH'/~~'7'7 ? ? e%*XXdA->->%>T
? GGNN8,,,, h/// KK r c |e| j }t |t j r-| D ]\ }} ||d |z
| |< n|D ]} ||d dz
| |< |r| | dS dS )a Like dict.update() but subtracts counts instead of replacing them.
Counts can be reduced below zero. Both the inputs and outputs are
allowed to contain zero and negative counts.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.subtract('witch') # subtract elements from another iterable
>>> c.subtract(Counter('watch')) # subtract elements from another counter
>>> c['h'] # 2 in which, minus 1 in witch, minus 1 in watch
0
>>> c['w'] # 1 in which, minus 1 in witch, minus 1 in watch
-1
Nr r` )r r r r rm subtract)r r r= r r r s r r zCounter.subtract s xH($4$<==
7#+>>#3#3 ; ;KD%!)$!2!2U!:DJJ; % 7 7D!)$!2!2Q!6DJJ MM$ r c , | | S )zReturn a shallow copy.r r s r r z Counter.copy r r c 0 | j t | ffS r )r| r5 r s r r zCounter.__reduce__ s ~T
},,r c V || v r#t | dS dS )zGLike dict.__delitem__() but does not raise KeyError for missing values.N)r rO )r r r| s r rO zCounter.__delitem__ s1 4<< GG % % % % % . = II1qII!47eAh&IIIIIIIr r r r r r s ``r r zCounter.__eq__
F %)) "! !IIIIIu
IIIIIIr c H t |t st S | |k S )z@True if any counts disagree. Missing counts are treated as zero.r r r r s r r zCounter.__ne__ s' %)) "! !5= r c z t t st S t fd fD S )z:True if all counts in self are a subset of those in other.c 3 F K | ]}|D ]}| | k V d S r r$ r s r r z!Counter.__le__.. r r r r s ``r __le__zCounter.__le__ r! r c R t |t st S | |k o| |k S )zATrue if all counts in self are a proper subset of those in other.r# r s r __lt__zCounter.__lt__ - %)) "! !u}. .r c z t t st S t fd fD S )z.& r r r r s ``r __ge__zCounter.__ge__" r! r c R t |t st S | |k o| |k S )zCTrue if all counts in self are a proper superset of those in other.r# r s r __gt__zCounter.__gt__( r) r c t |t st S t }| D ]\ }}||| z }|dk r|||< | D ]\ }}|| vr |dk r|||< |S )zAdd counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
r r r r rm r rA rt r r newcounts r __add__zCounter.__add__. s %)) "! ! ::<< ( (KD% uT{*H!|| 't ;;== % %KD%4 EAII $t
r c t |t st S t }| D ]\ }}||| z
}|dk r|||< | D ]\ }}|| vr|dk rd|z
||< |S )z Subtract count, but keep only results with positive counts.
>>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
r r0 r1 s r __sub__zCounter.__sub__A s %)) "! ! ::<< ( (KD% uT{*H!|| 't ;;== ) )KD%4 EAII 5yt
r c t |t st S t }| D ]"\ }}|| }||k r|n|}|dk r|||< #| D ]\ }}|| vr |dk r|||< |S )zUnion is the maximum of value in either of the input counters.
>>> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
r r0 r rA rt r r other_countr2 s r r zCounter.__or__T s %)) "! ! ::<< ( (KD% +K&+k&9&9{{uH!|| 't ;;== % %KD%4 EAII $t
r c t |t st S t }| D ]"\ }}|| }||k r|n|}|dk r|||< #|S )z Intersection is the minimum of corresponding counts.
>>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
r r0 r7 s r __and__zCounter.__and__h st %)) "! ! ::<< ( (KD% +K % 3 3uuH!|| 't
r c l t }| D ]\ }}|dk r|||< |S )zEAdds an empty counter, effectively stripping negative and zero countsr r rm r rt r r s r __pos__zCounter.__pos__y s> ::<< % %KD%qyy $t
r c r t }| D ]\ }}|dk rd|z
||< |S )z{Subtracts from an empty counter. Strips positive and zero counts,
and flips the sign on negative counts.
r r< r= s r __neg__zCounter.__neg__ sD
::<< ) )KD%qyy 5yt
r c R d | D }|D ]}| |= | S )z?Internal method to strip elements with a negative or zero countc $ g | ]
\ }}|d k |S )r r$ )r r r s r
z*Counter._keep_positive.. s! MMM e5199t999r )rm )r nonpositiver s r _keep_positivezCounter._keep_positive s: MMtzz||MMM DT
r c ~ | D ]\ }}| |xx |z
cc< | S )zInplace add from another counter, keeping only positive counts.
>>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
rm rE r rA r r s r __iadd__zCounter.__iadd__ I !;;== KD% JJJ% JJJJ""$$$r c ~ | D ]\ }}| |xx |z cc< | S )zInplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
rG rH s r __isub__zCounter.__isub__ rJ r c | D ]\ }}| | }||k r|| |< | S )zInplace union is the maximum of value from either counter.
>>> c = Counter('abbb')
>>> c |= Counter('bcc')
>>> c
Counter({'b': 3, 'c': 2, 'a': 1})
rG )r rA r r8 r s r r zCounter.__ior__ sP "' ) ) D+JEU"" (T
""$$$r c | D ]\ }}|| }||k r|| |< | S )zInplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
rG )r rA r r r8 s r __iand__zCounter.__iand__ sO ::<< ) )KD% +KU"" (T
""$$$r r )#r! r" r# r rB r r r r r r r r r r rO r~ r r r& r( r, r. r3 r5 r r: r> r@ rE rI rL r rO
__classcell__r s @r r r s6 * *d & & & & & &
" " "C C C C E E E, P P P [ P D 6$ $ $- - -& & & & &
3 3 3ZJ J J ! ! ! J J J / / / J J J / / / & & ( " % % % % % %
%
%
%
%
%
%
%
%
%
%r r c e Zd ZdZd Zd Zd ZddZd Zd Z d Z
d
Z e d Z
ed Zd
ZeZddZed Zd Zd Zd Zd Zd Zd Zd Zd Z dS )r a A ChainMap groups multiple dicts (or other mappings) together
to create a single, updateable view.
The underlying mappings are stored in a list. That list is public and can
be accessed or updated using the *maps* attribute. There is no other
state.
Lookups search the underlying mappings successively until a key is found.
In contrast, writes, updates, and deletions only operate on the first
mapping.
c 4 t | pi g| _ dS )zInitialize a ChainMap by setting *maps* to the given mappings.
If no mappings are provided, a single empty dictionary is used.
N)r} maps)r rS s r rB zChainMap.__init__ s
JJ&2$ r c t | r )rY r( s r r zChainMap.__missing__ s smmr c t | j D ] } || c S # t $ r Y w xY w| | S r )rS rY r )r r) r s r __getitem__zChainMap.__getitem__ s\ y G
s|###
$$$s
""Nc || v r| | n|S r r$ rv s r r z ChainMap.get s 4KKtCyyW4r c R t t j | j S r )rd r unionrS r s r __len__zChainMap.__len__ s ;355; *+++r c i }t | j D ]/}| t | 0t | S r )r rS r r5 r r )r r r s r rS zChainMap.__iter__ sL ** - -G
HHT]]7++ , , , ,Awwr c D t fd| j D S )Nc 3 K | ]}|v V d S r r$ )r mr) s r r z(ChainMap.__contains__.. s' //3!8//////r anyrS r( s `r __contains__zChainMap.__contains__ s( ////TY//////r c * t | j S r r_ r s r __bool__zChainMap.__bool__ 49~~ r c | | j j dd t t | j dS )Nrz r r{ )r| r! r r reprrS r s r r~ zChainMap.__repr__ s6 .)NNDIIc$ 6J6J,K,KNNNNr c 8 | t j |g|R S )z?Create a ChainMap with a single dict created from the iterable.)r5 r )r; r r< s r r zChainMap.fromkeys s& s4=1D111222r c r | j | j d g| j dd R S )zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r r` N)r| rS r r s r r z
ChainMap.copy s8 t~dil / / 1 1BDIabbMBBBBr c ` ||}n|r| | | j |g| j R S )zNew ChainMap with a new map followed by all previous maps.
If no map is provided, an empty dict is used.
Keyword arguments update the map or new empty dict.
)r r| rS )r r^ kwargss r new_childzChainMap.new_child sF
9AA
HHV t~a,$),,,,r c 0 | j | j dd S )zNew ChainMap from maps[1:].r` N)r| rS r s r parentszChainMap.parents s t~ty}--r c & || j d |< d S Nr )rS )r r) rD s r rI zChainMap.__setitem__! s ! ! Sr c d | j d |= d S # t $ r t d| w xY w)Nr $Key not found in the first mapping: )rS rY r( s r rO zChainMap.__delitem__$ sR K ! S!!! K K KI#IIJJ J Ks /c | | j d S # t $ r t d w xY w)zPRemove and return an item pair from maps[0]. Raise KeyError is maps[0] is empty.r z#No keys found in the first mapping.)rS rZ rY r s r rZ zChainMap.popitem* sN B9Q<'')) ) B B B@AA A Bs ! ;c v | j d j |g|R S # t $ r t d| w xY w)zWRemove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].r rq )rS rK rY )r r) r< s r rK z ChainMap.pop1 s_ K#49Q<#C/$/// / K K KI#IIJJ J Ks 8c D | j d dS )z'Clear maps[0], leaving maps[1:] intact.r N)rS rW r s r rW zChainMap.clear8 s ! r c F | j d | | S ro )rS r r s r r zChainMap.__ior__< s! ! E""" r c t |t j st S | }|j d | |S ro )r r r r r rS r )r rA r^ s r r zChainMap.__or__@ sJ %!1!9:: "! ! IIKK q r c t |t j st S t | }t | j D ]}| | | | S r ) r r r r r5 r rS r r| )r rA r^ childs r r zChainMap.__ror__G se %!1!9:: "! ! KK di(( E
HHUOOOO~~a r r ) r! r" r# r rB r rV r rZ rS ra rc r r~ r r r __copy__rk r rm rI rO rZ rK rW r r r r$ r r r r s ' ' ' % % %5 5 5 5, , , 0 0 0 _O O O 3 3 [3C C C H - - - - . . X." " "K K K B B BK K K ! ! ! ! !r r c v e Zd ZddZd Zd Zd Zd Zd Zd Z d Z
d
Z d Z d Z
d
Zd Zedd ZdS )r Nc t i | _ || | |r| | d S d S r )datar )r r5 rj s r rB zUserDict.__init__W sK KK KK r c * t | j S r rd r| r s r rZ zUserDict.__len__^ rd r c || j v r
| j | S t | j d r| j | | S t | )Nr )r| hasattrr| r rY r( s r rV zUserDict.__getitem__a sS $) 9S> ! 4>= 1 1 9>--dC88 8smmr c || j |< d S r r| )r r) items r rI zUserDict.__setitem__h s #r c | j |= d S r r r( s r rO zUserDict.__delitem__k s IcNNNr c * t | j S r )r r| r s r rS zUserDict.__iter__n DI r c || j v S r r r( s r ra zUserDict.__contains__r s di r c * t | j S r rf r| r s r r~ zUserDict.__repr__v r r c t |t r"| | j |j z S t |t r | | j |z S t
S r r r r| r| r5 r r s r r zUserDict.__or__y s` eX & & :>>$)ej"899 9 eT " " 5>>$)e"344 4 r c t |t r"| |j | j z S t |t r | || j z S t
S r r r s r r zUserDict.__ror__ s` eX & & :>>%*ty"899 9 eT " " 5>>%$)"344 4 r c | t |t r| xj |j z c_ n| xj |z c_ | S r )r r r| r s r r zUserDict.__ior__ s= eX & & II #III II II r c | j | j }|j | j | j d |j d< |S Nr| )r| r6 re r r r insts r ry zUserDict.__copy__ sU ~%%dn55
T]+++ $
f 5 : : < <
f r c | j t u r&t | j S dd l}| j } i | _ | | }|| _ n # || _ w xY w| | |S ro )r| r r| r r )r r r| r s r r z
UserDict.copy s >X % %DINN , ,-- - y DI $A DIIDI s A% % A.c . | }|D ]}|||< |S r r$ )r; r rD r r) s r r zUserDict.fromkeys s, CEE CAcFFr r )r! r" r# rB rZ rV rI rO rS ra r~ r r r ry r r r r$ r r r r T s [ r r c e Zd ZdZd"dZd Zd Zd Zd Zd Z d Z
d
Z d Z d Z
d
Zd Zd Zd Zd Zd Zd ZeZd Zd Zd Zd Zd#dZd Zd Z d Z d Z d Z d Z d Z!d! Z"dS )$r zAA more or less complete user-defined wrapper around list objects.Nc
g | _ |yt | t | j k r|| j d d < d S t |t r|j d d | j d d < d S t | | _ d S d S r )r| r r r r} )r initlists r rB zUserList.__init__ s H~~di 00 ' !!! Hh//
+ '}QQQ / !!! NN r c * t | j S r r r s r r~ zUserList.__repr__ r r c > | j | | k S r r| _UserList__castr s r r( zUserList.__lt__ y4;;u----r c > | j | | k S r r r s r r& zUserList.__le__ yDKK . ...r c > | j | | k S r r r s r r zUserList.__eq__ r r c > | j | | k S r r r s r r. zUserList.__gt__ r r c > | j | | k S r r r s r r, zUserList.__ge__ r r c > t |t r|j n|S r )r r r| r s r __castzUserList.__cast s 'x 8 8CuzzeCr c || j v S r r r r s r ra zUserList.__contains__ s ty r c * t | j S r r~ r s r rZ zUserList.__len__ rd r c t |t r | | j | S | j | S r )r slicer| r| r is r rV zUserList.__getitem__ s8 a >>$)A,// /9Q< r c || j |< d S r r r r r s r rI zUserList.__setitem__ s ! r c | j |= d S r r r s r rO zUserList.__delitem__ s IaLLLr c B t |t r"| | j |j z S t |t | j r | | j |z S | | j t | z S r r r r| r| r r} r s r r3 zUserList.__add__ s eX & & 5>>$)ej"899 9
tDI
/
/ 5>>$)e"344 4~~di$u++ 5666r c B t |t r"| |j | j z S t |t | j r | || j z S | t | | j z S r r r s r __radd__zUserList.__radd__ s eX & & 5>>%*ty"899 9
tDI
/
/ 5>>%$)"344 4~~d5kkDI 5666r c t |t r| xj |j z
c_ nPt |t | j r| xj |z
c_ n | xj t | z
c_ | S r )r r r| r r} r s r rI zUserList.__iadd__ so eX & & % II #III
tDI
/
/ % II III IIe $II r c < | | j |z S r r| r| r rg s r __mul__zUserList.__mul__ ~~di!m,,,r c & | xj |z c_ | S r r r s r __imul__zUserList.__imul__ s Q r c | j | j }|j | j | j d d d |j d< |S r )r| r6 re r r s r ry zUserList.__copy__ sR ~%%dn55
T]+++ $
f 5aaa 8
f r c : | j | d S r )r| appendr s r r zUserList.append
r c < | j || d S r )r| insertr s r r zUserList.insert
s D!!!!!r c 6 | j | S r )r| rK r s r rK z UserList.pop s y}}Q r c : | j | d S r )r| remover s r r zUserList.remove r r c 8 | j d S r )r| rW r s r rW zUserList.clear s r c , | | S r r r s r r z
UserList.copy s ~~d###r c 6 | j | S r )r| r r s r r zUserList.count s yt$$$r c ( | j j |g|R S r r| r )r r r< s r r zUserList.index s tyt+d++++r c 8 | j d S r )r| r r s r r zUserList.reverse" s r c * | j j |i | d S r )r| sortr r< r= s r r z
UserList.sort% s! %%%%%%r c t |t r!| j |j d S | j | d S r )r r r| extendr s r r zUserList.extend( sN eX & & $ I UZ ( ( ( ( ( I U # # # # #r r r )#r! r" r# r rB r~ r( r& r r. r, r ra rZ rV rI rO r3 r rI r __rmul__r ry r r rK r rW r r r r r r r$ r r r r s KK + + + + . . ./ / // / /. . ./ / /D D D! ! ! 7 7 77 7 7 - - - H " " " $ $ $% % %, , , & & &$ $ $ $ $r r c 4 e Zd Zd Zd Zd Zd Zd Zd Zd Z d Z
d Z d
Z d Z
d Zd
Zd Zd Zd Zd Zd Zd ZeZd Zd Zd Zd Zd Zde j fdZ d Z d Z dKd Z!de j fd Z"dLd"Z#de j fd#Z$d$ Z%d% Z&de j fd&Z'd' Z(d( Z)d) Z*d* Z+d+ Z,d, Z-d- Z.d. Z/d/ Z0d0 Z1d1 Z2d2 Z3d3 Z4d4 Z5d5 Z6dMd7Z7e8j9 Z9d8 Z:dNd:Z;de j fd;Zd> Z?dMd?Z@dOd@ZAdOdAZBdPdCZCde j fdDZDdMdEZEdF ZFdG ZGdH ZHdI ZIdJ ZJd6S )Qr c t |t r || _ d S t |t r|j d d | _ d S t | | _ d S r )r r r| r r seqs r rB zUserString.__init__5 sW c3 !DIII
Z
(
( ! DIIICDIIIr c * t | j S r )r r| r s r __str__zUserString.__str__= rd r c * t | j S r r r s r r~ zUserString.__repr__@ r r c * t | j S r )intr| r s r __int__zUserString.__int__C rd r c * t | j S r )floatr| r s r __float__zUserString.__float__F s TY r c * t | j S r )complexr| r s r __complex__zUserString.__complex__I s ty!!!r c * t | j S r )hashr| r s r __hash__zUserString.__hash__L r r c " | j d d fS r r r s r r zUserString.__getnewargs__O s !!! r c b t |t r| j |j k S | j |k S r r r r| r strings r r zUserString.__eq__R 0 fj ) ) ,9 + +yF""r c b t |t r| j |j k S | j |k S r r r s r r( zUserString.__lt__W 0 fj ) ) +9v{* *y6!!r c b t |t r| j |j k S | j |k S r r r s r r& zUserString.__le__\ r r c b t |t r| j |j k S | j |k S r r r s r r. zUserString.__gt__a r r c b t |t r| j |j k S | j |k S r r r s r r, zUserString.__ge__f r r c L t |t r|j }|| j v S r r )r chars r ra zUserString.__contains__k s( dJ ' ' 9Dty r c * t | j S r r~ r s r rZ zUserString.__len__p rd r c B | | j | S r r )r r s r rV zUserString.__getitem__s s ~~di .///r c ( t |t r"| | j |j z S t |t r | | j |z S | | j t | z S r )r r r| r| r r s r r3 zUserString.__add__v sy eZ ( ( 5>>$)ej"899 9
s
#
# 5>>$)e"344 4~~di#e** 4555r c t |t r | || j z S | t | | j z S r )r r r| r| r s r r zUserString.__radd__} sL eS ! ! 5>>%$)"344 4~~c%jj49 4555r c < | | j |z S r r r s r r zUserString.__mul__ r r c < | | j |z S r r r r< s r __mod__zUserString.__mod__ s ~~di$ .///r c L | t | | z S r )r| r )r templates r __rmod__zUserString.__rmod__ s ~~c(mmd 2333r c Z | | j S r )r| r|
capitalizer s r r zUserString.capitalize s" ~~di 2 2 4 4555r c Z | | j S r )r| r| casefoldr s r r zUserString.casefold " ~~di 0 0 2 2333r c N | | j j |g|R S r )r| r| centerr widthr< s r r zUserString.center s, ~~ .di .u > > !dl 0 0 0 0
> > >
> > >
2 2 2 2
&'DL 6 6 6 6= = = = T\ / / / /
/ / /- - - !dl 0 0 0 0# # ## # ## # #% % %# # #( ( (# # #% % %' ' '# # ## # ## # ## # #= = =1 1 17 7 7 7
I( ( (E E E E !dl 0 0 0 0
!"t| 1 1 1 1= = =) ) )7 7 7 7. . . ./ / / /. . . . ()dl 8 8 8 86 6 6 64 4 41 1 1: : :1 1 16 6 6 6 6r r )4r __all__r sysrb itertoolsr r r
r
r r keywordr r operatorr r r r reprlibr r _weakrefr r8 _collectionsr MutableSequenceregister ImportErrorr KeysViewr ItemsViewr&
ValuesViewr+ r r. r5 r r r
r r r r r r Sequencer r$ r r r sK
% % % % % % ' ' ' ' ' ' ) ) ) ) ) ) + + + + + + . . . . . . 5 5 5 5 5 5 $ $ $ $ $ $5"""""" $--e4444 D
((((((( D + + + + ++4 + + +
, , , , , , 6 , , , % % % % % - 8 % % % 5 5 5 5 5F 5 5 5} } } } }$ } } }@ ((((((( D L))))))) L L LKKLLLL 16T h h h h h^1 1 1 ,,,,,,, D q% q% q% q% q%d q% q% q%p
}! }! }! }! }! . }! }! }!HS S S S S . S S St~$ ~$ ~$ ~$ ~$ / ~$ ~$ ~$Ju6 u6 u6 u6 u6!* u6 u6 u6 u6 u6sZ A! !A)(A)-A4 4A<;A<C C$#C$(C/ /C:9C: D DDPK ! < < % __pycache__/abc.cpython-311.opt-2.pycnu [
!A?hw & d dl T d dl mZ d dl mZ dS ) )*)__all__)_CallableGenericAliasN)_collections_abcr r r
s; $ $ $ $ $ $ 2 2 2 2 2 2 2 2r PK ! "% ~2 2 __init__.pynu [ '''This module implements specialized container datatypes providing
alternatives to Python's general purpose built-in containers, dict,
list, set, and tuple.
* namedtuple factory function for creating tuple subclasses with named fields
* deque list-like container with fast appends and pops on either end
* ChainMap dict-like class for creating a single view of multiple mappings
* Counter dict subclass for counting hashable objects
* OrderedDict dict subclass that remembers the order entries were added
* defaultdict dict subclass that calls a factory function to supply missing values
* UserDict wrapper around dictionary objects for easier dict subclassing
* UserList wrapper around list objects for easier list subclassing
* UserString wrapper around string objects for easier string subclassing
'''
__all__ = [
'ChainMap',
'Counter',
'OrderedDict',
'UserDict',
'UserList',
'UserString',
'defaultdict',
'deque',
'namedtuple',
]
import _collections_abc
import sys as _sys
from itertools import chain as _chain
from itertools import repeat as _repeat
from itertools import starmap as _starmap
from keyword import iskeyword as _iskeyword
from operator import eq as _eq
from operator import itemgetter as _itemgetter
from reprlib import recursive_repr as _recursive_repr
from _weakref import proxy as _proxy
try:
from _collections import deque
except ImportError:
pass
else:
_collections_abc.MutableSequence.register(deque)
try:
from _collections import defaultdict
except ImportError:
pass
################################################################################
### OrderedDict
################################################################################
class _OrderedDictKeysView(_collections_abc.KeysView):
def __reversed__(self):
yield from reversed(self._mapping)
class _OrderedDictItemsView(_collections_abc.ItemsView):
def __reversed__(self):
for key in reversed(self._mapping):
yield (key, self._mapping[key])
class _OrderedDictValuesView(_collections_abc.ValuesView):
def __reversed__(self):
for key in reversed(self._mapping):
yield self._mapping[key]
class _Link(object):
__slots__ = 'prev', 'next', 'key', '__weakref__'
class OrderedDict(dict):
'Dictionary that remembers insertion order'
# An inherited dict maps keys to values.
# The inherited dict provides __getitem__, __len__, __contains__, and get.
# The remaining methods are order-aware.
# Big-O running times for all methods are the same as regular dictionaries.
# The internal self.__map dict maps keys to links in a doubly linked list.
# The circular doubly linked list starts and ends with a sentinel element.
# The sentinel element never gets deleted (this simplifies the algorithm).
# The sentinel is in self.__hardroot with a weakref proxy in self.__root.
# The prev links are weakref proxies (to prevent circular references).
# Individual links are kept alive by the hard reference in self.__map.
# Those hard references disappear when a key is deleted from an OrderedDict.
def __new__(cls, /, *args, **kwds):
"Create the ordered dict object and set up the underlying structures."
self = dict.__new__(cls)
self.__hardroot = _Link()
self.__root = root = _proxy(self.__hardroot)
root.prev = root.next = root
self.__map = {}
return self
def __init__(self, other=(), /, **kwds):
'''Initialize an ordered dictionary. The signature is the same as
regular dictionaries. Keyword argument order is preserved.
'''
self.__update(other, **kwds)
def __setitem__(self, key, value,
dict_setitem=dict.__setitem__, proxy=_proxy, Link=_Link):
'od.__setitem__(i, y) <==> od[i]=y'
# Setting a new item creates a new link at the end of the linked list,
# and the inherited dictionary is updated with the new key/value pair.
if key not in self:
self.__map[key] = link = Link()
root = self.__root
last = root.prev
link.prev, link.next, link.key = last, root, key
last.next = link
root.prev = proxy(link)
dict_setitem(self, key, value)
def __delitem__(self, key, dict_delitem=dict.__delitem__):
'od.__delitem__(y) <==> del od[y]'
# Deleting an existing item uses self.__map to find the link which gets
# removed by updating the links in the predecessor and successor nodes.
dict_delitem(self, key)
link = self.__map.pop(key)
link_prev = link.prev
link_next = link.next
link_prev.next = link_next
link_next.prev = link_prev
link.prev = None
link.next = None
def __iter__(self):
'od.__iter__() <==> iter(od)'
# Traverse the linked list in order.
root = self.__root
curr = root.next
while curr is not root:
yield curr.key
curr = curr.next
def __reversed__(self):
'od.__reversed__() <==> reversed(od)'
# Traverse the linked list in reverse order.
root = self.__root
curr = root.prev
while curr is not root:
yield curr.key
curr = curr.prev
def clear(self):
'od.clear() -> None. Remove all items from od.'
root = self.__root
root.prev = root.next = root
self.__map.clear()
dict.clear(self)
def popitem(self, last=True):
'''Remove and return a (key, value) pair from the dictionary.
Pairs are returned in LIFO order if last is true or FIFO order if false.
'''
if not self:
raise KeyError('dictionary is empty')
root = self.__root
if last:
link = root.prev
link_prev = link.prev
link_prev.next = root
root.prev = link_prev
else:
link = root.next
link_next = link.next
root.next = link_next
link_next.prev = root
key = link.key
del self.__map[key]
value = dict.pop(self, key)
return key, value
def move_to_end(self, key, last=True):
'''Move an existing element to the end (or beginning if last is false).
Raise KeyError if the element does not exist.
'''
link = self.__map[key]
link_prev = link.prev
link_next = link.next
soft_link = link_next.prev
link_prev.next = link_next
link_next.prev = link_prev
root = self.__root
if last:
last = root.prev
link.prev = last
link.next = root
root.prev = soft_link
last.next = link
else:
first = root.next
link.prev = root
link.next = first
first.prev = soft_link
root.next = link
def __sizeof__(self):
sizeof = _sys.getsizeof
n = len(self) + 1 # number of links including root
size = sizeof(self.__dict__) # instance dictionary
size += sizeof(self.__map) * 2 # internal dict and inherited dict
size += sizeof(self.__hardroot) * n # link objects
size += sizeof(self.__root) * n # proxy objects
return size
update = __update = _collections_abc.MutableMapping.update
def keys(self):
"D.keys() -> a set-like object providing a view on D's keys"
return _OrderedDictKeysView(self)
def items(self):
"D.items() -> a set-like object providing a view on D's items"
return _OrderedDictItemsView(self)
def values(self):
"D.values() -> an object providing a view on D's values"
return _OrderedDictValuesView(self)
__ne__ = _collections_abc.MutableMapping.__ne__
__marker = object()
def pop(self, key, default=__marker):
'''od.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.
'''
marker = self.__marker
result = dict.pop(self, key, marker)
if result is not marker:
# The same as in __delitem__().
link = self.__map.pop(key)
link_prev = link.prev
link_next = link.next
link_prev.next = link_next
link_next.prev = link_prev
link.prev = None
link.next = None
return result
if default is marker:
raise KeyError(key)
return default
def setdefault(self, key, default=None):
'''Insert key with a value of default if key is not in the dictionary.
Return the value for key if key is in the dictionary, else default.
'''
if key in self:
return self[key]
self[key] = default
return default
@_recursive_repr()
def __repr__(self):
'od.__repr__() <==> repr(od)'
if not self:
return '%s()' % (self.__class__.__name__,)
return '%s(%r)' % (self.__class__.__name__, list(self.items()))
def __reduce__(self):
'Return state information for pickling'
state = self.__getstate__()
if state:
if isinstance(state, tuple):
state, slots = state
else:
slots = {}
state = state.copy()
slots = slots.copy()
for k in vars(OrderedDict()):
state.pop(k, None)
slots.pop(k, None)
if slots:
state = state, slots
else:
state = state or None
return self.__class__, (), state, None, iter(self.items())
def copy(self):
'od.copy() -> a shallow copy of od'
return self.__class__(self)
@classmethod
def fromkeys(cls, iterable, value=None):
'''Create a new ordered dictionary with keys from iterable and values set to value.
'''
self = cls()
for key in iterable:
self[key] = value
return self
def __eq__(self, other):
'''od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
'''
if isinstance(other, OrderedDict):
return dict.__eq__(self, other) and all(map(_eq, self, other))
return dict.__eq__(self, other)
def __ior__(self, other):
self.update(other)
return self
def __or__(self, other):
if not isinstance(other, dict):
return NotImplemented
new = self.__class__(self)
new.update(other)
return new
def __ror__(self, other):
if not isinstance(other, dict):
return NotImplemented
new = self.__class__(other)
new.update(self)
return new
try:
from _collections import OrderedDict
except ImportError:
# Leave the pure Python version in place.
pass
################################################################################
### namedtuple
################################################################################
try:
from _collections import _tuplegetter
except ImportError:
_tuplegetter = lambda index, doc: property(_itemgetter(index), doc=doc)
def namedtuple(typename, field_names, *, rename=False, defaults=None, module=None):
"""Returns a new subclass of tuple with named fields.
>>> Point = namedtuple('Point', ['x', 'y'])
>>> Point.__doc__ # docstring for the new class
'Point(x, y)'
>>> p = Point(11, y=22) # instantiate with positional args or keywords
>>> p[0] + p[1] # indexable like a plain tuple
33
>>> x, y = p # unpack like a regular tuple
>>> x, y
(11, 22)
>>> p.x + p.y # fields also accessible by name
33
>>> d = p._asdict() # convert to a dictionary
>>> d['x']
11
>>> Point(**d) # convert from a dictionary
Point(x=11, y=22)
>>> p._replace(x=100) # _replace() is like str.replace() but targets named fields
Point(x=100, y=22)
"""
# Validate the field names. At the user's option, either generate an error
# message or automatically replace the field name with a valid name.
if isinstance(field_names, str):
field_names = field_names.replace(',', ' ').split()
field_names = list(map(str, field_names))
typename = _sys.intern(str(typename))
if rename:
seen = set()
for index, name in enumerate(field_names):
if (not name.isidentifier()
or _iskeyword(name)
or name.startswith('_')
or name in seen):
field_names[index] = f'_{index}'
seen.add(name)
for name in [typename] + field_names:
if type(name) is not str:
raise TypeError('Type names and field names must be strings')
if not name.isidentifier():
raise ValueError('Type names and field names must be valid '
f'identifiers: {name!r}')
if _iskeyword(name):
raise ValueError('Type names and field names cannot be a '
f'keyword: {name!r}')
seen = set()
for name in field_names:
if name.startswith('_') and not rename:
raise ValueError('Field names cannot start with an underscore: '
f'{name!r}')
if name in seen:
raise ValueError(f'Encountered duplicate field name: {name!r}')
seen.add(name)
field_defaults = {}
if defaults is not None:
defaults = tuple(defaults)
if len(defaults) > len(field_names):
raise TypeError('Got more default values than field names')
field_defaults = dict(reversed(list(zip(reversed(field_names),
reversed(defaults)))))
# Variables used in the methods and docstrings
field_names = tuple(map(_sys.intern, field_names))
num_fields = len(field_names)
arg_list = ', '.join(field_names)
if num_fields == 1:
arg_list += ','
repr_fmt = '(' + ', '.join(f'{name}=%r' for name in field_names) + ')'
tuple_new = tuple.__new__
_dict, _tuple, _len, _map, _zip = dict, tuple, len, map, zip
# Create all the named tuple methods to be added to the class namespace
namespace = {
'_tuple_new': tuple_new,
'__builtins__': {},
'__name__': f'namedtuple_{typename}',
}
code = f'lambda _cls, {arg_list}: _tuple_new(_cls, ({arg_list}))'
__new__ = eval(code, namespace)
__new__.__name__ = '__new__'
__new__.__doc__ = f'Create new instance of {typename}({arg_list})'
if defaults is not None:
__new__.__defaults__ = defaults
@classmethod
def _make(cls, iterable):
result = tuple_new(cls, iterable)
if _len(result) != num_fields:
raise TypeError(f'Expected {num_fields} arguments, got {len(result)}')
return result
_make.__func__.__doc__ = (f'Make a new {typename} object from a sequence '
'or iterable')
def _replace(self, /, **kwds):
result = self._make(_map(kwds.pop, field_names, self))
if kwds:
raise ValueError(f'Got unexpected field names: {list(kwds)!r}')
return result
_replace.__doc__ = (f'Return a new {typename} object replacing specified '
'fields with new values')
def __repr__(self):
'Return a nicely formatted representation string'
return self.__class__.__name__ + repr_fmt % self
def _asdict(self):
'Return a new dict which maps field names to their values.'
return _dict(_zip(self._fields, self))
def __getnewargs__(self):
'Return self as a plain tuple. Used by copy and pickle.'
return _tuple(self)
# Modify function metadata to help with introspection and debugging
for method in (
__new__,
_make.__func__,
_replace,
__repr__,
_asdict,
__getnewargs__,
):
method.__qualname__ = f'{typename}.{method.__name__}'
# Build-up the class namespace dictionary
# and use type() to build the result class
class_namespace = {
'__doc__': f'{typename}({arg_list})',
'__slots__': (),
'_fields': field_names,
'_field_defaults': field_defaults,
'__new__': __new__,
'_make': _make,
'_replace': _replace,
'__repr__': __repr__,
'_asdict': _asdict,
'__getnewargs__': __getnewargs__,
'__match_args__': field_names,
}
for index, name in enumerate(field_names):
doc = _sys.intern(f'Alias for field number {index}')
class_namespace[name] = _tuplegetter(index, doc)
result = type(typename, (tuple,), class_namespace)
# For pickling to work, the __module__ variable needs to be set to the frame
# where the named tuple is created. Bypass this step in environments where
# sys._getframe is not defined (Jython for example) or sys._getframe is not
# defined for arguments greater than 0 (IronPython), or where the user has
# specified a particular module.
if module is None:
try:
module = _sys._getframe(1).f_globals.get('__name__', '__main__')
except (AttributeError, ValueError):
pass
if module is not None:
result.__module__ = module
return result
########################################################################
### Counter
########################################################################
def _count_elements(mapping, iterable):
'Tally elements from the iterable.'
mapping_get = mapping.get
for elem in iterable:
mapping[elem] = mapping_get(elem, 0) + 1
try: # Load C helper function if available
from _collections import _count_elements
except ImportError:
pass
class Counter(dict):
'''Dict subclass for counting hashable items. Sometimes called a bag
or multiset. Elements are stored as dictionary keys and their counts
are stored as dictionary values.
>>> c = Counter('abcdeabcdabcaba') # count elements from a string
>>> c.most_common(3) # three most common elements
[('a', 5), ('b', 4), ('c', 3)]
>>> sorted(c) # list all unique elements
['a', 'b', 'c', 'd', 'e']
>>> ''.join(sorted(c.elements())) # list elements with repetitions
'aaaaabbbbcccdde'
>>> sum(c.values()) # total of all counts
15
>>> c['a'] # count of letter 'a'
5
>>> for elem in 'shazam': # update counts from an iterable
... c[elem] += 1 # by adding 1 to each element's count
>>> c['a'] # now there are seven 'a'
7
>>> del c['b'] # remove all 'b'
>>> c['b'] # now there are zero 'b'
0
>>> d = Counter('simsalabim') # make another counter
>>> c.update(d) # add in the second counter
>>> c['a'] # now there are nine 'a'
9
>>> c.clear() # empty the counter
>>> c
Counter()
Note: If a count is set to zero or reduced to zero, it will remain
in the counter until the entry is deleted or the counter is cleared:
>>> c = Counter('aaabbc')
>>> c['b'] -= 2 # reduce the count of 'b' by two
>>> c.most_common() # 'b' is still in, but its count is zero
[('a', 3), ('c', 1), ('b', 0)]
'''
# References:
# http://en.wikipedia.org/wiki/Multiset
# http://www.gnu.org/software/smalltalk/manual-base/html_node/Bag.html
# http://www.demo2s.com/Tutorial/Cpp/0380__set-multiset/Catalog0380__set-multiset.htm
# http://code.activestate.com/recipes/259174/
# Knuth, TAOCP Vol. II section 4.6.3
def __init__(self, iterable=None, /, **kwds):
'''Create a new, empty Counter object. And if given, count elements
from an input iterable. Or, initialize the count from another mapping
of elements to their counts.
>>> c = Counter() # a new, empty counter
>>> c = Counter('gallahad') # a new counter from an iterable
>>> c = Counter({'a': 4, 'b': 2}) # a new counter from a mapping
>>> c = Counter(a=4, b=2) # a new counter from keyword args
'''
super().__init__()
self.update(iterable, **kwds)
def __missing__(self, key):
'The count of elements not in the Counter is zero.'
# Needed so that self[missing_item] does not raise KeyError
return 0
def total(self):
'Sum of the counts'
return sum(self.values())
def most_common(self, n=None):
'''List the n most common elements and their counts from the most
common to the least. If n is None, then list all element counts.
>>> Counter('abracadabra').most_common(3)
[('a', 5), ('b', 2), ('r', 2)]
'''
# Emulate Bag.sortedByCount from Smalltalk
if n is None:
return sorted(self.items(), key=_itemgetter(1), reverse=True)
# Lazy import to speedup Python startup time
import heapq
return heapq.nlargest(n, self.items(), key=_itemgetter(1))
def elements(self):
'''Iterator over elements repeating each as many times as its count.
>>> c = Counter('ABCABC')
>>> sorted(c.elements())
['A', 'A', 'B', 'B', 'C', 'C']
# Knuth's example for prime factors of 1836: 2**2 * 3**3 * 17**1
>>> import math
>>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
>>> math.prod(prime_factors.elements())
1836
Note, if an element's count has been set to zero or is a negative
number, elements() will ignore it.
'''
# Emulate Bag.do from Smalltalk and Multiset.begin from C++.
return _chain.from_iterable(_starmap(_repeat, self.items()))
# Override dict methods where necessary
@classmethod
def fromkeys(cls, iterable, v=None):
# There is no equivalent method for counters because the semantics
# would be ambiguous in cases such as Counter.fromkeys('aaabbc', v=2).
# Initializing counters to zero values isn't necessary because zero
# is already the default value for counter lookups. Initializing
# to one is easily accomplished with Counter(set(iterable)). For
# more exotic cases, create a dictionary first using a dictionary
# comprehension or dict.fromkeys().
raise NotImplementedError(
'Counter.fromkeys() is undefined. Use Counter(iterable) instead.')
def update(self, iterable=None, /, **kwds):
'''Like dict.update() but add counts instead of replacing them.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.update('witch') # add elements from another iterable
>>> d = Counter('watch')
>>> c.update(d) # add elements from another counter
>>> c['h'] # four 'h' in which, witch, and watch
4
'''
# The regular dict.update() operation makes no sense here because the
# replace behavior results in some of the original untouched counts
# being mixed-in with all of the other counts for a mismash that
# doesn't have a straight-forward interpretation in most counting
# contexts. Instead, we implement straight-addition. Both the inputs
# and outputs are allowed to contain zero and negative counts.
if iterable is not None:
if isinstance(iterable, _collections_abc.Mapping):
if self:
self_get = self.get
for elem, count in iterable.items():
self[elem] = count + self_get(elem, 0)
else:
# fast path when counter is empty
super().update(iterable)
else:
_count_elements(self, iterable)
if kwds:
self.update(kwds)
def subtract(self, iterable=None, /, **kwds):
'''Like dict.update() but subtracts counts instead of replacing them.
Counts can be reduced below zero. Both the inputs and outputs are
allowed to contain zero and negative counts.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.subtract('witch') # subtract elements from another iterable
>>> c.subtract(Counter('watch')) # subtract elements from another counter
>>> c['h'] # 2 in which, minus 1 in witch, minus 1 in watch
0
>>> c['w'] # 1 in which, minus 1 in witch, minus 1 in watch
-1
'''
if iterable is not None:
self_get = self.get
if isinstance(iterable, _collections_abc.Mapping):
for elem, count in iterable.items():
self[elem] = self_get(elem, 0) - count
else:
for elem in iterable:
self[elem] = self_get(elem, 0) - 1
if kwds:
self.subtract(kwds)
def copy(self):
'Return a shallow copy.'
return self.__class__(self)
def __reduce__(self):
return self.__class__, (dict(self),)
def __delitem__(self, elem):
'Like dict.__delitem__() but does not raise KeyError for missing values.'
if elem in self:
super().__delitem__(elem)
def __repr__(self):
if not self:
return f'{self.__class__.__name__}()'
try:
# dict() preserves the ordering returned by most_common()
d = dict(self.most_common())
except TypeError:
# handle case where values are not orderable
d = dict(self)
return f'{self.__class__.__name__}({d!r})'
# Multiset-style mathematical operations discussed in:
# Knuth TAOCP Volume II section 4.6.3 exercise 19
# and at http://en.wikipedia.org/wiki/Multiset
#
# Outputs guaranteed to only include positive counts.
#
# To strip negative and zero counts, add-in an empty counter:
# c += Counter()
#
# Results are ordered according to when an element is first
# encountered in the left operand and then by the order
# encountered in the right operand.
#
# When the multiplicities are all zero or one, multiset operations
# are guaranteed to be equivalent to the corresponding operations
# for regular sets.
# Given counter multisets such as:
# cp = Counter(a=1, b=0, c=1)
# cq = Counter(c=1, d=0, e=1)
# The corresponding regular sets would be:
# sp = {'a', 'c'}
# sq = {'c', 'e'}
# All of the following relations would hold:
# set(cp + cq) == sp | sq
# set(cp - cq) == sp - sq
# set(cp | cq) == sp | sq
# set(cp & cq) == sp & sq
# (cp == cq) == (sp == sq)
# (cp != cq) == (sp != sq)
# (cp <= cq) == (sp <= sq)
# (cp < cq) == (sp < sq)
# (cp >= cq) == (sp >= sq)
# (cp > cq) == (sp > sq)
def __eq__(self, other):
'True if all counts agree. Missing counts are treated as zero.'
if not isinstance(other, Counter):
return NotImplemented
return all(self[e] == other[e] for c in (self, other) for e in c)
def __ne__(self, other):
'True if any counts disagree. Missing counts are treated as zero.'
if not isinstance(other, Counter):
return NotImplemented
return not self == other
def __le__(self, other):
'True if all counts in self are a subset of those in other.'
if not isinstance(other, Counter):
return NotImplemented
return all(self[e] <= other[e] for c in (self, other) for e in c)
def __lt__(self, other):
'True if all counts in self are a proper subset of those in other.'
if not isinstance(other, Counter):
return NotImplemented
return self <= other and self != other
def __ge__(self, other):
'True if all counts in self are a superset of those in other.'
if not isinstance(other, Counter):
return NotImplemented
return all(self[e] >= other[e] for c in (self, other) for e in c)
def __gt__(self, other):
'True if all counts in self are a proper superset of those in other.'
if not isinstance(other, Counter):
return NotImplemented
return self >= other and self != other
def __add__(self, other):
'''Add counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
'''
if not isinstance(other, Counter):
return NotImplemented
result = Counter()
for elem, count in self.items():
newcount = count + other[elem]
if newcount > 0:
result[elem] = newcount
for elem, count in other.items():
if elem not in self and count > 0:
result[elem] = count
return result
def __sub__(self, other):
''' Subtract count, but keep only results with positive counts.
>>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
'''
if not isinstance(other, Counter):
return NotImplemented
result = Counter()
for elem, count in self.items():
newcount = count - other[elem]
if newcount > 0:
result[elem] = newcount
for elem, count in other.items():
if elem not in self and count < 0:
result[elem] = 0 - count
return result
def __or__(self, other):
'''Union is the maximum of value in either of the input counters.
>>> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
'''
if not isinstance(other, Counter):
return NotImplemented
result = Counter()
for elem, count in self.items():
other_count = other[elem]
newcount = other_count if count < other_count else count
if newcount > 0:
result[elem] = newcount
for elem, count in other.items():
if elem not in self and count > 0:
result[elem] = count
return result
def __and__(self, other):
''' Intersection is the minimum of corresponding counts.
>>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
'''
if not isinstance(other, Counter):
return NotImplemented
result = Counter()
for elem, count in self.items():
other_count = other[elem]
newcount = count if count < other_count else other_count
if newcount > 0:
result[elem] = newcount
return result
def __pos__(self):
'Adds an empty counter, effectively stripping negative and zero counts'
result = Counter()
for elem, count in self.items():
if count > 0:
result[elem] = count
return result
def __neg__(self):
'''Subtracts from an empty counter. Strips positive and zero counts,
and flips the sign on negative counts.
'''
result = Counter()
for elem, count in self.items():
if count < 0:
result[elem] = 0 - count
return result
def _keep_positive(self):
'''Internal method to strip elements with a negative or zero count'''
nonpositive = [elem for elem, count in self.items() if not count > 0]
for elem in nonpositive:
del self[elem]
return self
def __iadd__(self, other):
'''Inplace add from another counter, keeping only positive counts.
>>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
'''
for elem, count in other.items():
self[elem] += count
return self._keep_positive()
def __isub__(self, other):
'''Inplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
'''
for elem, count in other.items():
self[elem] -= count
return self._keep_positive()
def __ior__(self, other):
'''Inplace union is the maximum of value from either counter.
>>> c = Counter('abbb')
>>> c |= Counter('bcc')
>>> c
Counter({'b': 3, 'c': 2, 'a': 1})
'''
for elem, other_count in other.items():
count = self[elem]
if other_count > count:
self[elem] = other_count
return self._keep_positive()
def __iand__(self, other):
'''Inplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
'''
for elem, count in self.items():
other_count = other[elem]
if other_count < count:
self[elem] = other_count
return self._keep_positive()
########################################################################
### ChainMap
########################################################################
class ChainMap(_collections_abc.MutableMapping):
''' A ChainMap groups multiple dicts (or other mappings) together
to create a single, updateable view.
The underlying mappings are stored in a list. That list is public and can
be accessed or updated using the *maps* attribute. There is no other
state.
Lookups search the underlying mappings successively until a key is found.
In contrast, writes, updates, and deletions only operate on the first
mapping.
'''
def __init__(self, *maps):
'''Initialize a ChainMap by setting *maps* to the given mappings.
If no mappings are provided, a single empty dictionary is used.
'''
self.maps = list(maps) or [{}] # always at least one map
def __missing__(self, key):
raise KeyError(key)
def __getitem__(self, key):
for mapping in self.maps:
try:
return mapping[key] # can't use 'key in mapping' with defaultdict
except KeyError:
pass
return self.__missing__(key) # support subclasses that define __missing__
def get(self, key, default=None):
return self[key] if key in self else default
def __len__(self):
return len(set().union(*self.maps)) # reuses stored hash values if possible
def __iter__(self):
d = {}
for mapping in reversed(self.maps):
d.update(dict.fromkeys(mapping)) # reuses stored hash values if possible
return iter(d)
def __contains__(self, key):
return any(key in m for m in self.maps)
def __bool__(self):
return any(self.maps)
@_recursive_repr()
def __repr__(self):
return f'{self.__class__.__name__}({", ".join(map(repr, self.maps))})'
@classmethod
def fromkeys(cls, iterable, *args):
'Create a ChainMap with a single dict created from the iterable.'
return cls(dict.fromkeys(iterable, *args))
def copy(self):
'New ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]'
return self.__class__(self.maps[0].copy(), *self.maps[1:])
__copy__ = copy
def new_child(self, m=None, **kwargs): # like Django's Context.push()
'''New ChainMap with a new map followed by all previous maps.
If no map is provided, an empty dict is used.
Keyword arguments update the map or new empty dict.
'''
if m is None:
m = kwargs
elif kwargs:
m.update(kwargs)
return self.__class__(m, *self.maps)
@property
def parents(self): # like Django's Context.pop()
'New ChainMap from maps[1:].'
return self.__class__(*self.maps[1:])
def __setitem__(self, key, value):
self.maps[0][key] = value
def __delitem__(self, key):
try:
del self.maps[0][key]
except KeyError:
raise KeyError(f'Key not found in the first mapping: {key!r}')
def popitem(self):
'Remove and return an item pair from maps[0]. Raise KeyError is maps[0] is empty.'
try:
return self.maps[0].popitem()
except KeyError:
raise KeyError('No keys found in the first mapping.')
def pop(self, key, *args):
'Remove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].'
try:
return self.maps[0].pop(key, *args)
except KeyError:
raise KeyError(f'Key not found in the first mapping: {key!r}')
def clear(self):
'Clear maps[0], leaving maps[1:] intact.'
self.maps[0].clear()
def __ior__(self, other):
self.maps[0].update(other)
return self
def __or__(self, other):
if not isinstance(other, _collections_abc.Mapping):
return NotImplemented
m = self.copy()
m.maps[0].update(other)
return m
def __ror__(self, other):
if not isinstance(other, _collections_abc.Mapping):
return NotImplemented
m = dict(other)
for child in reversed(self.maps):
m.update(child)
return self.__class__(m)
################################################################################
### UserDict
################################################################################
class UserDict(_collections_abc.MutableMapping):
# Start by filling-out the abstract methods
def __init__(self, dict=None, /, **kwargs):
self.data = {}
if dict is not None:
self.update(dict)
if kwargs:
self.update(kwargs)
def __len__(self):
return len(self.data)
def __getitem__(self, key):
if key in self.data:
return self.data[key]
if hasattr(self.__class__, "__missing__"):
return self.__class__.__missing__(self, key)
raise KeyError(key)
def __setitem__(self, key, item):
self.data[key] = item
def __delitem__(self, key):
del self.data[key]
def __iter__(self):
return iter(self.data)
# Modify __contains__ to work correctly when __missing__ is present
def __contains__(self, key):
return key in self.data
# Now, add the methods in dicts but not in MutableMapping
def __repr__(self):
return repr(self.data)
def __or__(self, other):
if isinstance(other, UserDict):
return self.__class__(self.data | other.data)
if isinstance(other, dict):
return self.__class__(self.data | other)
return NotImplemented
def __ror__(self, other):
if isinstance(other, UserDict):
return self.__class__(other.data | self.data)
if isinstance(other, dict):
return self.__class__(other | self.data)
return NotImplemented
def __ior__(self, other):
if isinstance(other, UserDict):
self.data |= other.data
else:
self.data |= other
return self
def __copy__(self):
inst = self.__class__.__new__(self.__class__)
inst.__dict__.update(self.__dict__)
# Create a copy and avoid triggering descriptors
inst.__dict__["data"] = self.__dict__["data"].copy()
return inst
def copy(self):
if self.__class__ is UserDict:
return UserDict(self.data.copy())
import copy
data = self.data
try:
self.data = {}
c = copy.copy(self)
finally:
self.data = data
c.update(self)
return c
@classmethod
def fromkeys(cls, iterable, value=None):
d = cls()
for key in iterable:
d[key] = value
return d
################################################################################
### UserList
################################################################################
class UserList(_collections_abc.MutableSequence):
"""A more or less complete user-defined wrapper around list objects."""
def __init__(self, initlist=None):
self.data = []
if initlist is not None:
# XXX should this accept an arbitrary sequence?
if type(initlist) == type(self.data):
self.data[:] = initlist
elif isinstance(initlist, UserList):
self.data[:] = initlist.data[:]
else:
self.data = list(initlist)
def __repr__(self):
return repr(self.data)
def __lt__(self, other):
return self.data < self.__cast(other)
def __le__(self, other):
return self.data <= self.__cast(other)
def __eq__(self, other):
return self.data == self.__cast(other)
def __gt__(self, other):
return self.data > self.__cast(other)
def __ge__(self, other):
return self.data >= self.__cast(other)
def __cast(self, other):
return other.data if isinstance(other, UserList) else other
def __contains__(self, item):
return item in self.data
def __len__(self):
return len(self.data)
def __getitem__(self, i):
if isinstance(i, slice):
return self.__class__(self.data[i])
else:
return self.data[i]
def __setitem__(self, i, item):
self.data[i] = item
def __delitem__(self, i):
del self.data[i]
def __add__(self, other):
if isinstance(other, UserList):
return self.__class__(self.data + other.data)
elif isinstance(other, type(self.data)):
return self.__class__(self.data + other)
return self.__class__(self.data + list(other))
def __radd__(self, other):
if isinstance(other, UserList):
return self.__class__(other.data + self.data)
elif isinstance(other, type(self.data)):
return self.__class__(other + self.data)
return self.__class__(list(other) + self.data)
def __iadd__(self, other):
if isinstance(other, UserList):
self.data += other.data
elif isinstance(other, type(self.data)):
self.data += other
else:
self.data += list(other)
return self
def __mul__(self, n):
return self.__class__(self.data * n)
__rmul__ = __mul__
def __imul__(self, n):
self.data *= n
return self
def __copy__(self):
inst = self.__class__.__new__(self.__class__)
inst.__dict__.update(self.__dict__)
# Create a copy and avoid triggering descriptors
inst.__dict__["data"] = self.__dict__["data"][:]
return inst
def append(self, item):
self.data.append(item)
def insert(self, i, item):
self.data.insert(i, item)
def pop(self, i=-1):
return self.data.pop(i)
def remove(self, item):
self.data.remove(item)
def clear(self):
self.data.clear()
def copy(self):
return self.__class__(self)
def count(self, item):
return self.data.count(item)
def index(self, item, *args):
return self.data.index(item, *args)
def reverse(self):
self.data.reverse()
def sort(self, /, *args, **kwds):
self.data.sort(*args, **kwds)
def extend(self, other):
if isinstance(other, UserList):
self.data.extend(other.data)
else:
self.data.extend(other)
################################################################################
### UserString
################################################################################
class UserString(_collections_abc.Sequence):
def __init__(self, seq):
if isinstance(seq, str):
self.data = seq
elif isinstance(seq, UserString):
self.data = seq.data[:]
else:
self.data = str(seq)
def __str__(self):
return str(self.data)
def __repr__(self):
return repr(self.data)
def __int__(self):
return int(self.data)
def __float__(self):
return float(self.data)
def __complex__(self):
return complex(self.data)
def __hash__(self):
return hash(self.data)
def __getnewargs__(self):
return (self.data[:],)
def __eq__(self, string):
if isinstance(string, UserString):
return self.data == string.data
return self.data == string
def __lt__(self, string):
if isinstance(string, UserString):
return self.data < string.data
return self.data < string
def __le__(self, string):
if isinstance(string, UserString):
return self.data <= string.data
return self.data <= string
def __gt__(self, string):
if isinstance(string, UserString):
return self.data > string.data
return self.data > string
def __ge__(self, string):
if isinstance(string, UserString):
return self.data >= string.data
return self.data >= string
def __contains__(self, char):
if isinstance(char, UserString):
char = char.data
return char in self.data
def __len__(self):
return len(self.data)
def __getitem__(self, index):
return self.__class__(self.data[index])
def __add__(self, other):
if isinstance(other, UserString):
return self.__class__(self.data + other.data)
elif isinstance(other, str):
return self.__class__(self.data + other)
return self.__class__(self.data + str(other))
def __radd__(self, other):
if isinstance(other, str):
return self.__class__(other + self.data)
return self.__class__(str(other) + self.data)
def __mul__(self, n):
return self.__class__(self.data * n)
__rmul__ = __mul__
def __mod__(self, args):
return self.__class__(self.data % args)
def __rmod__(self, template):
return self.__class__(str(template) % self)
# the following methods are defined in alphabetical order:
def capitalize(self):
return self.__class__(self.data.capitalize())
def casefold(self):
return self.__class__(self.data.casefold())
def center(self, width, *args):
return self.__class__(self.data.center(width, *args))
def count(self, sub, start=0, end=_sys.maxsize):
if isinstance(sub, UserString):
sub = sub.data
return self.data.count(sub, start, end)
def removeprefix(self, prefix, /):
if isinstance(prefix, UserString):
prefix = prefix.data
return self.__class__(self.data.removeprefix(prefix))
def removesuffix(self, suffix, /):
if isinstance(suffix, UserString):
suffix = suffix.data
return self.__class__(self.data.removesuffix(suffix))
def encode(self, encoding='utf-8', errors='strict'):
encoding = 'utf-8' if encoding is None else encoding
errors = 'strict' if errors is None else errors
return self.data.encode(encoding, errors)
def endswith(self, suffix, start=0, end=_sys.maxsize):
return self.data.endswith(suffix, start, end)
def expandtabs(self, tabsize=8):
return self.__class__(self.data.expandtabs(tabsize))
def find(self, sub, start=0, end=_sys.maxsize):
if isinstance(sub, UserString):
sub = sub.data
return self.data.find(sub, start, end)
def format(self, /, *args, **kwds):
return self.data.format(*args, **kwds)
def format_map(self, mapping):
return self.data.format_map(mapping)
def index(self, sub, start=0, end=_sys.maxsize):
return self.data.index(sub, start, end)
def isalpha(self):
return self.data.isalpha()
def isalnum(self):
return self.data.isalnum()
def isascii(self):
return self.data.isascii()
def isdecimal(self):
return self.data.isdecimal()
def isdigit(self):
return self.data.isdigit()
def isidentifier(self):
return self.data.isidentifier()
def islower(self):
return self.data.islower()
def isnumeric(self):
return self.data.isnumeric()
def isprintable(self):
return self.data.isprintable()
def isspace(self):
return self.data.isspace()
def istitle(self):
return self.data.istitle()
def isupper(self):
return self.data.isupper()
def join(self, seq):
return self.data.join(seq)
def ljust(self, width, *args):
return self.__class__(self.data.ljust(width, *args))
def lower(self):
return self.__class__(self.data.lower())
def lstrip(self, chars=None):
return self.__class__(self.data.lstrip(chars))
maketrans = str.maketrans
def partition(self, sep):
return self.data.partition(sep)
def replace(self, old, new, maxsplit=-1):
if isinstance(old, UserString):
old = old.data
if isinstance(new, UserString):
new = new.data
return self.__class__(self.data.replace(old, new, maxsplit))
def rfind(self, sub, start=0, end=_sys.maxsize):
if isinstance(sub, UserString):
sub = sub.data
return self.data.rfind(sub, start, end)
def rindex(self, sub, start=0, end=_sys.maxsize):
return self.data.rindex(sub, start, end)
def rjust(self, width, *args):
return self.__class__(self.data.rjust(width, *args))
def rpartition(self, sep):
return self.data.rpartition(sep)
def rstrip(self, chars=None):
return self.__class__(self.data.rstrip(chars))
def split(self, sep=None, maxsplit=-1):
return self.data.split(sep, maxsplit)
def rsplit(self, sep=None, maxsplit=-1):
return self.data.rsplit(sep, maxsplit)
def splitlines(self, keepends=False):
return self.data.splitlines(keepends)
def startswith(self, prefix, start=0, end=_sys.maxsize):
return self.data.startswith(prefix, start, end)
def strip(self, chars=None):
return self.__class__(self.data.strip(chars))
def swapcase(self):
return self.__class__(self.data.swapcase())
def title(self):
return self.__class__(self.data.title())
def translate(self, *args):
return self.__class__(self.data.translate(*args))
def upper(self):
return self.__class__(self.data.upper())
def zfill(self, width):
return self.__class__(self.data.zfill(width))
PK ! w w abc.pynu [ from _collections_abc import *
from _collections_abc import __all__
from _collections_abc import _CallableGenericAlias
PK ! 8 8 # __pycache__/__init__.cpython-33.pyonu [
f c @ s d d d d d d d d d g Z d d
l Td d l Z e e j j 7Z d d l m Z m Z d d
l m Z m
Z d d l m
Z d d l Z d d l Z d d l m Z d d l m Z m Z m Z d d l m Z Gd d d e Z! Gd d d e" Z# d Z$ d Z% d Z& e' e' d d Z( d d Z) y d d l m) Z) Wn e* k
r[Yn XGd d d e" Z+ Gd d d e, Z- Gd d d e, Z. Gd d d e/ Z0 Gd d d e1 Z2 d S(! u dequeu defaultdictu
namedtupleu UserDictu UserListu
UserStringu Counteru OrderedDictu ChainMapi ( u *N( u dequeu defaultdict( u
itemgetteru eq( u iskeyword( u proxy( u repeatu chainu starmap( u recursive_reprc B s | Ee Z d Z d Z d S( u _Linku prevu nextu keyu __weakref__N( u prevu nextu keyu __weakref__( u __name__u
__module__u __qualname__u __slots__( u
__locals__( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu _Link s u _Linkc B sD | Ee Z d Z d Z d d Z e j e e d d Z e j d d Z d d Z
d
d Z d d
Z d# d d Z d# d d Z d d Z e j Z Z e j Z e j Z e j Z e j Z e Z e d d Z d" d d Z e d d Z d d Z d d Z e! d" d d Z" d d! Z# d" S($ u OrderedDictu) Dictionary that remembers insertion orderc O s t | d k r+ t d t | n y | j WnM t k
r t | _ t | j | _ } | | _ | _ i | _ Yn X| j
| | d S( u Initialize an ordered dictionary. The signature is the same as
regular dictionaries, but keyword arguments are not recommended because
their insertion order is arbitrary.
i u$ expected at most 1 arguments, got %dN( u lenu TypeErroru _OrderedDict__rootu AttributeErroru _Linku _OrderedDict__hardrootu _proxyu prevu nextu _OrderedDict__mapu _OrderedDict__update( u selfu argsu kwdsu root( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __init__) s
u OrderedDict.__init__c C s~ | | k rj | | j | <} | j } | j } | | | | _ | _ | _ | | _ | | | _ n | | | | d S( u! od.__setitem__(i, y) <==> od[i]=yN( u _OrderedDict__mapu _OrderedDict__rootu prevu nextu key( u selfu keyu valueu dict_setitemu proxyu Linku linku rootu last( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __setitem__: s u OrderedDict.__setitem__c C sG | | | | j j | } | j } | j } | | _ | | _ d S( u od.__delitem__(y) <==> del od[y]N( u _OrderedDict__mapu popu prevu next( u selfu keyu dict_delitemu linku link_prevu link_next( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __delitem__H s
u OrderedDict.__delitem__c c s: | j } | j } x! | | k r5 | j V| j } q Wd S( u od.__iter__() <==> iter(od)N( u _OrderedDict__rootu nextu key( u selfu rootu curr( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __iter__S s
u OrderedDict.__iter__c c s: | j } | j } x! | | k r5 | j V| j } q Wd S( u# od.__reversed__() <==> reversed(od)N( u _OrderedDict__rootu prevu key( u selfu rootu curr( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __reversed__\ s
u OrderedDict.__reversed__c C s7 | j } | | _ | _ | j j t j | d S( u. od.clear() -> None. Remove all items from od.N( u _OrderedDict__rootu prevu nextu _OrderedDict__mapu clearu dict( u selfu root( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu cleare s
u OrderedDict.clearc C s | s t d n | j } | rK | j } | j } | | _ | | _ n$ | j } | j } | | _ | | _ | j } | j | =t j | | } | | f S( u od.popitem() -> (k, v), return and remove a (key, value) pair.
Pairs are returned in LIFO order if last is true or FIFO order if false.
u dictionary is empty( u KeyErroru _OrderedDict__rootu prevu nextu keyu _OrderedDict__mapu dictu pop( u selfu lastu rootu linku link_prevu link_nextu keyu value( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu popiteml s
u OrderedDict.popitemc C s | j | } | j } | j } | | _ | | _ | j } | rn | j } | | _ | | _ | | _ | _ n+ | j } | | _ | | _ | | _ | _ d S( u Move an existing element to the end (or beginning if last==False).
Raises KeyError if the element does not exist.
When last=True, acts like a fast version of self[key]=self.pop(key).
N( u _OrderedDict__mapu prevu nextu _OrderedDict__root( u selfu keyu lastu linku link_prevu link_nextu rootu first( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu move_to_end s
u OrderedDict.move_to_endc C sq t j } t | d } | | j } | | | j d 7} | | | j | 7} | | | j | 7} | S( Ni i ( u _sysu getsizeofu lenu __dict__u _OrderedDict__mapu _OrderedDict__hardrootu _OrderedDict__root( u selfu sizeofu nu size( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
__sizeof__ s u OrderedDict.__sizeof__c C sC | | k r! | | } | | =| S| | j k r? t | n | S( u od.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.
( u _OrderedDict__markeru KeyError( u selfu keyu defaultu result( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu pop s
u OrderedDict.popc C s" | | k r | | S| | | <| S( uD od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od( ( u selfu keyu default( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
setdefault s
u OrderedDict.setdefaultc C s7 | s d | j j f Sd | j j t | j f S( u od.__repr__() <==> repr(od)u %s()u %s(%r)( u __class__u __name__u listu items( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __repr__ s u OrderedDict.__repr__c s~ f d d D } t j } x' t t D] } | j | d q; W| rn j | f | f S j | f f S( u% Return state information for picklingc s g | ] } | | g q S( ( ( u .0u k( u self( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
s u* OrderedDict.__reduce__..N( u varsu copyu OrderedDictu popu Noneu __class__( u selfu itemsu inst_dictu k( ( u selfu9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
__reduce__ s u OrderedDict.__reduce__c C s
| j | S( u! od.copy() -> a shallow copy of od( u __class__( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu copy s u OrderedDict.copyc C s( | } x | D] } | | | New ordered dictionary with keys from S.
If not specified, the value defaults to None.
( ( u clsu iterableu valueu selfu key( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu fromkeys s
u OrderedDict.fromkeysc C sG t | t r7 t j | | o6 t t t | | St j | | S( u od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
( u
isinstanceu OrderedDictu dictu __eq__u allu mapu _eq( u selfu other( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __eq__ s (u OrderedDict.__eq__NT($ u __name__u
__module__u __qualname__u __doc__u __init__u dictu __setitem__u _proxyu _Linku __delitem__u __iter__u __reversed__u clearu Trueu popitemu move_to_endu
__sizeof__u MutableMappingu updateu _OrderedDict__updateu keysu valuesu itemsu __ne__u objectu _OrderedDict__markeru popu Noneu
setdefaultu _recursive_repru __repr__u
__reduce__u copyu classmethodu fromkeysu __eq__( u
__locals__( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu OrderedDict s0
u from builtins import property as _property, tuple as _tuple
from operator import itemgetter as _itemgetter
from collections import OrderedDict
class {typename}(tuple):
'{typename}({arg_list})'
__slots__ = ()
_fields = {field_names!r}
def __new__(_cls, {arg_list}):
'Create new instance of {typename}({arg_list})'
return _tuple.__new__(_cls, ({arg_list}))
@classmethod
def _make(cls, iterable, new=tuple.__new__, len=len):
'Make a new {typename} object from a sequence or iterable'
result = new(cls, iterable)
if len(result) != {num_fields:d}:
raise TypeError('Expected {num_fields:d} arguments, got %d' % len(result))
return result
def _replace(_self, **kwds):
'Return a new {typename} object replacing specified fields with new values'
result = _self._make(map(kwds.pop, {field_names!r}, _self))
if kwds:
raise ValueError('Got unexpected field names: %r' % list(kwds))
return result
def __repr__(self):
'Return a nicely formatted representation string'
return self.__class__.__name__ + '({repr_fmt})' % self
@property
def __dict__(self):
'A new OrderedDict mapping field names to their values'
return OrderedDict(zip(self._fields, self))
def _asdict(self):
'''Return a new OrderedDict which maps field names to their values.
This method is obsolete. Use vars(nt) or nt.__dict__ instead.
'''
return self.__dict__
def __getnewargs__(self):
'Return self as a plain tuple. Used by copy and pickle.'
return tuple(self)
def __getstate__(self):
'Exclude the OrderedDict from pickling'
return None
{field_defs}
u {name}=%ruW {name} = _property(_itemgetter({index:d}), doc='Alias for field number {index:d}')
c
C s t | t r* | j d d j } n t t t | } | r t } xo t | D]^ \ } } | j s t | s | j
d s | | k r d | | | >> Point = namedtuple('Point', ['x', 'y'])
>>> Point.__doc__ # docstring for the new class
'Point(x, y)'
>>> p = Point(11, y=22) # instantiate with positional args or keywords
>>> p[0] + p[1] # indexable like a plain tuple
33
>>> x, y = p # unpack like a regular tuple
>>> x, y
(11, 22)
>>> p.x + p.y # fields also accessable by name
33
>>> d = p._asdict() # convert to a dictionary
>>> d['x']
11
>>> Point(**d) # convert from a dictionary
Point(x=11, y=22)
>>> p._replace(x=100) # _replace() is like str.replace() but targets named fields
Point(x=100, y=22)
u ,u u _u _%du8 Type names and field names must be valid identifiers: %ru2 Type names and field names cannot be a keyword: %ru/ Field names cannot start with an underscore: %ru$ Encountered duplicate field name: %ru typenameu field_namesu
num_fieldsu arg_listu 'u i u repr_fmtu , c s s! | ] } t j d | Vq d S( u nameN( u _repr_templateu format( u .0u name( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu j s u namedtuple..u
field_defsu
c s s- | ]# \ } } t j d | d | Vq d S( u indexu nameN( u _field_templateu format( u .0u indexu name( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu l s u __name__u
namedtuple_%su __main__i( u
isinstanceu stru replaceu splitu listu mapu setu enumerateu isidentifieru
_iskeywordu
startswithu addu
ValueErroru _class_templateu formatu tupleu lenu repru joinu dictu execu _sourceu printu _sysu _getframeu f_globalsu getu
__module__u AttributeError(
u typenameu field_namesu verboseu renameu seenu indexu nameu class_definitionu namespaceu result( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
namedtuple. s^
(
%c C s5 | j } x% | D] } | | d d | | >> c = Counter('abcdeabcdabcaba') # count elements from a string
>>> c.most_common(3) # three most common elements
[('a', 5), ('b', 4), ('c', 3)]
>>> sorted(c) # list all unique elements
['a', 'b', 'c', 'd', 'e']
>>> ''.join(sorted(c.elements())) # list elements with repetitions
'aaaaabbbbcccdde'
>>> sum(c.values()) # total of all counts
15
>>> c['a'] # count of letter 'a'
5
>>> for elem in 'shazam': # update counts from an iterable
... c[elem] += 1 # by adding 1 to each element's count
>>> c['a'] # now there are seven 'a'
7
>>> del c['b'] # remove all 'b'
>>> c['b'] # now there are zero 'b'
0
>>> d = Counter('simsalabim') # make another counter
>>> c.update(d) # add in the second counter
>>> c['a'] # now there are nine 'a'
9
>>> c.clear() # empty the counter
>>> c
Counter()
Note: If a count is set to zero or reduced to zero, it will remain
in the counter until the entry is deleted or the counter is cleared:
>>> c = Counter('aaabbc')
>>> c['b'] -= 2 # reduce the count of 'b' by two
>>> c.most_common() # 'b' is still in, but its count is zero
[('a', 3), ('c', 1), ('b', 0)]
c s! t j | j | | d S( u Create a new, empty Counter object. And if given, count elements
from an input iterable. Or, initialize the count from another mapping
of elements to their counts.
>>> c = Counter() # a new, empty counter
>>> c = Counter('gallahad') # a new counter from an iterable
>>> c = Counter({'a': 4, 'b': 2}) # a new counter from a mapping
>>> c = Counter(a=4, b=2) # a new counter from keyword args
N( u superu __init__u update( u selfu iterableu kwds( u __class__( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __init__ s
u Counter.__init__c C s d S( u1 The count of elements not in the Counter is zero.i ( ( u selfu key( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __missing__ s u Counter.__missing__c C sP | d k r. t | j d t d d d St j | | j d t d S( u List the n most common elements and their counts from the most
common to the least. If n is None, then list all element counts.
>>> Counter('abcdeabcdabcaba').most_common(3)
[('a', 5), ('b', 4), ('c', 3)]
u keyi u reverseNT( u Noneu sortedu itemsu _itemgetteru Trueu _heapqu nlargest( u selfu n( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu most_common s "u Counter.most_commonc C s t j t t | j S( u Iterator over elements repeating each as many times as its count.
>>> c = Counter('ABCABC')
>>> sorted(c.elements())
['A', 'A', 'B', 'B', 'C', 'C']
# Knuth's example for prime factors of 1836: 2**2 * 3**3 * 17**1
>>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
>>> product = 1
>>> for factor in prime_factors.elements(): # loop over factors
... product *= factor # and multiply them
>>> product
1836
Note, if an element's count has been set to zero or is a negative
number, elements() will ignore it.
( u _chainu
from_iterableu _starmapu _repeatu items( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu elements s u Counter.elementsc C s t d d S( Nu@ Counter.fromkeys() is undefined. Use Counter(iterable) instead.( u NotImplementedError( u clsu iterableu v( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu fromkeys s u Counter.fromkeysc s | d k r t | t rt | ra | j } xD | j D]# \ } } | | | d | | >> c = Counter('which')
>>> c.update('witch') # add elements from another iterable
>>> d = Counter('watch')
>>> c.update(d) # add elements from another counter
>>> c['h'] # four 'h' in which, witch, and watch
4
i N( u Noneu
isinstanceu Mappingu getu itemsu superu updateu _count_elements( u selfu iterableu kwdsu self_getu elemu count( u __class__( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu update s u Counter.updatec K s | d k r | j } t | t r[ x\ | j D]# \ } } | | d | | | >> c = Counter('which')
>>> c.subtract('witch') # subtract elements from another iterable
>>> c.subtract(Counter('watch')) # subtract elements from another counter
>>> c['h'] # 2 in which, minus 1 in witch, minus 1 in watch
0
>>> c['w'] # 1 in which, minus 1 in witch, minus 1 in watch
-1
i i N( u Noneu getu
isinstanceu Mappingu itemsu subtract( u selfu iterableu kwdsu self_getu elemu count( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu subtract' s
u Counter.subtractc C s
| j | S( u Return a shallow copy.( u __class__( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu copyB s u Counter.copyc C s | j t | f f S( N( u __class__u dict( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
__reduce__F s u Counter.__reduce__c s# | | k r t j | n d S( uG Like dict.__delitem__() but does not raise KeyError for missing values.N( u superu __delitem__( u selfu elem( u __class__( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __delitem__I s u Counter.__delitem__c C s | s d | j j Sy9 d j t d j | j } d | j j | f SWn. t k
r} d j | j j t | SYn Xd S( Nu %s()u , u %r: %ru %s({%s})u
{0}({1!r})( u __class__u __name__u joinu mapu __mod__u most_commonu TypeErroru formatu dict( u selfu items( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __repr__N s !
u Counter.__repr__c C s t | t s t St } xA | j D]3 \ } } | | | } | d k r) | | | >> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
i ( u
isinstanceu Counteru NotImplementedu items( u selfu otheru resultu elemu countu newcount( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __add__a s u Counter.__add__c C s t | t s t St } xA | j D]3 \ } } | | | } | d k r) | | | >> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
i ( u
isinstanceu Counteru NotImplementedu items( u selfu otheru resultu elemu countu newcount( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __sub__t s u Counter.__sub__c C s t | t s t St } xU | j D]G \ } } | | } | | k rQ | n | } | d k r) | | | >> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
i ( u
isinstanceu Counteru NotImplementedu items( u selfu otheru resultu elemu countu other_countu newcount( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __or__ s
u Counter.__or__c C sx t | t s t St } xU | j D]G \ } } | | } | | k rQ | n | } | d k r) | | | >> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
i ( u
isinstanceu Counteru NotImplementedu items( u selfu otheru resultu elemu countu other_countu newcount( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __and__ s
u Counter.__and__c C s | t S( uE Adds an empty counter, effectively stripping negative and zero counts( u Counter( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __pos__ s u Counter.__pos__c C s t | S( u{ Subtracts from an empty counter. Strips positive and zero counts,
and flips the sign on negative counts.
( u Counter( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __neg__ s u Counter.__neg__c C s5 d d | j D } x | D]
} | | =q W| S( u? Internal method to strip elements with a negative or zero countc S s( g | ] \ } } | d k s | q S( i ( ( u .0u elemu count( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
s u* Counter._keep_positive..( u items( u selfu nonpositiveu elem( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu _keep_positive s
u Counter._keep_positivec C s5 x( | j D] \ } } | | | 7>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
( u itemsu _keep_positive( u selfu otheru elemu count( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __iadd__ s u Counter.__iadd__c C s5 x( | j D] \ } } | | | 8>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
( u itemsu _keep_positive( u selfu otheru elemu count( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __isub__ s u Counter.__isub__c C sJ x= | j D]/ \ } } | | } | | k r
| | | >> c = Counter('abbb')
>>> c |= Counter('bcc')
>>> c
Counter({'b': 3, 'c': 2, 'a': 1})
( u itemsu _keep_positive( u selfu otheru elemu other_countu count( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __ior__ s
u Counter.__ior__c C sJ x= | j D]/ \ } } | | } | | k r
| | | >> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
( u itemsu _keep_positive( u selfu otheru elemu countu other_count( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __iand__ s
u Counter.__iand__N( u __name__u
__module__u __qualname__u __doc__u Noneu __init__u __missing__u most_commonu elementsu classmethodu fromkeysu updateu subtractu copyu
__reduce__u __delitem__u __repr__u __add__u __sub__u __or__u __and__u __pos__u __neg__u _keep_positiveu __iadd__u __isub__u __ior__u __iand__( u
__locals__( ( u __class__u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu Counter s0 +
!
c B s | Ee Z d Z d Z d d Z d d Z d d Z d& d d Z d
d Z d d
Z
d d Z d d Z e
d d Z e d d Z d d Z e Z d d Z e d d Z d d Z d d Z d d! Z d" d# Z d$ d% Z d& S(' u ChainMapu A ChainMap groups multiple dicts (or other mappings) together
to create a single, updateable view.
The underlying mappings are stored in a list. That list is public and can
accessed or updated using the *maps* attribute. There is no other state.
Lookups search the underlying mappings successively until a key is found.
In contrast, writes, updates, and deletions only operate on the first
mapping.
c G s t | p i g | _ d S( u Initialize a ChainMap by setting *maps* to the given mappings.
If no mappings are provided, a single empty dictionary is used.
N( u listu maps( u selfu maps( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __init__ s u ChainMap.__init__c C s t | d S( N( u KeyError( u selfu key( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __missing__ s u ChainMap.__missing__c C sB x2 | j D]' } y | | SWq
t k
r0 Yq
Xq
W| j | S( N( u mapsu KeyErroru __missing__( u selfu keyu mapping( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __getitem__ s
u ChainMap.__getitem__c C s | | k r | | S| S( N( ( u selfu keyu default( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu get s u ChainMap.getc C s t t j | j S( N( u lenu setu unionu maps( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __len__ s u ChainMap.__len__c C s t t j | j S( N( u iteru setu unionu maps( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __iter__ s u ChainMap.__iter__c s t f d d | j D S( Nc 3 s | ] } | k Vq d S( N( ( u .0u m( u key( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu $ s u( ChainMap.__contains__..( u anyu maps( u selfu key( ( u keyu9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __contains__# s u ChainMap.__contains__c C s
t | j S( N( u anyu maps( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __bool__& s u ChainMap.__bool__c C s% d j | d j t t | j S( Nu {0.__class__.__name__}({1})u , ( u formatu joinu mapu repru maps( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __repr__) s u ChainMap.__repr__c G s | t j | | S( u? Create a ChainMap with a single dict created from the iterable.( u dictu fromkeys( u clsu iterableu args( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu fromkeys. s u ChainMap.fromkeysc C s* | j | j d j | j d d S( uH New ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]i i N( u __class__u mapsu copy( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu copy3 s u
ChainMap.copyc C s | j i | j S( u; New ChainMap with a new dict followed by all previous maps.( u __class__u maps( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu new_child9 s u ChainMap.new_childc C s | j | j d d S( u New ChainMap from maps[1:].i N( u __class__u maps( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu parents= s u ChainMap.parentsc C s | | j d | Z# d? S(A u UserListuA A more or less complete user-defined wrapper around list objects.c C s g | _ | d k r t | t | j k rF | | j d d Z$ d? d@ Z% dA dB Z& dC dD Z' dE dF Z( dG dH Z) dI dJ Z* dK dL Z+ dM dN Z, dO dP Z- dQ dR Z. dS dT Z/ dU dV Z0 d| dW dX Z1 dY dZ Z2 d} d\ d] Z3 d- e j d^ d_ Z4 d- e j d` da Z5 db dc Z6 dd de Z7 d| df dg Z8 d| d~ dh di Z9 d| d dj dk Z: d dl dm Z< d- e j dn do Z= d| dp dq Z> dr ds Z? dt du Z@ dv dw ZA dx dy ZB dz d{ ZC d| S( u
UserStringc C sV t | t r | | _ n7 t | t rC | j d d | _ n t | | _ d S( N( u
isinstanceu stru datau
UserString( u selfu seq( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __init__ s
u UserString.__init__c C s
t | j S( N( u stru data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __str__ s u UserString.__str__c C s
t | j S( N( u repru data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __repr__ s u UserString.__repr__c C s
t | j S( N( u intu data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __int__ s u UserString.__int__c C s
t | j S( N( u floatu data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __float__ s u UserString.__float__c C s
t | j S( N( u complexu data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __complex__ s u UserString.__complex__c C s
t | j S( N( u hashu data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __hash__ s u UserString.__hash__c C s, t | t r | j | j k S| j | k S( N( u
isinstanceu
UserStringu data( u selfu string( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __eq__ s u UserString.__eq__c C s, t | t r | j | j k S| j | k S( N( u
isinstanceu
UserStringu data( u selfu string( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __ne__ s u UserString.__ne__c C s, t | t r | j | j k S| j | k S( N( u
isinstanceu
UserStringu data( u selfu string( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __lt__ s u UserString.__lt__c C s, t | t r | j | j k S| j | k S( N( u
isinstanceu
UserStringu data( u selfu string( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __le__ s u UserString.__le__c C s, t | t r | j | j k S| j | k S( N( u
isinstanceu
UserStringu data( u selfu string( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __gt__ s u UserString.__gt__c C s, t | t r | j | j k S| j | k S( N( u
isinstanceu
UserStringu data( u selfu string( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __ge__ s u UserString.__ge__c C s( t | t r | j } n | | j k S( N( u
isinstanceu
UserStringu data( u selfu char( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __contains__ s u UserString.__contains__c C s
t | j S( N( u lenu data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __len__
s u UserString.__len__c C s | j | j | S( N( u __class__u data( u selfu index( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __getitem__ s u UserString.__getitem__c C sc t | t r& | j | j | j St | t rI | j | j | S| j | j t | S( N( u
isinstanceu
UserStringu __class__u datau str( u selfu other( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __add__ s
u UserString.__add__c C s= t | t r# | j | | j S| j t | | j S( N( u
isinstanceu stru __class__u data( u selfu other( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __radd__ s u UserString.__radd__c C s | j | j | S( N( u __class__u data( u selfu n( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __mul__ s u UserString.__mul__c C s | j | j | S( N( u __class__u data( u selfu args( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __mod__ s u UserString.__mod__c C s | j | j j S( N( u __class__u datau
capitalize( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
capitalize s u UserString.capitalizec G s | j | j j | | S( N( u __class__u datau center( u selfu widthu args( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu center! s u UserString.centeri c C s1 t | t r | j } n | j j | | | S( N( u
isinstanceu
UserStringu datau count( u selfu subu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu count# s u UserString.countc C sW | rA | r( | j | j j | | S| j | j j | S| j | j j S( N( u __class__u datau encode( u selfu encodingu errors( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu encode' s
u UserString.encodec C s | j j | | | S( N( u datau endswith( u selfu suffixu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu endswith- s u UserString.endswithi c C s | j | j j | S( N( u __class__u datau
expandtabs( u selfu tabsize( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
expandtabs/ s u UserString.expandtabsc C s1 t | t r | j } n | j j | | | S( N( u
isinstanceu
UserStringu datau find( u selfu subu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu find1 s u UserString.findc O s | j j | | S( N( u datau format( u selfu argsu kwds( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu format5 s u UserString.formatc C s | j j | | | S( N( u datau index( u selfu subu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu index7 s u UserString.indexc C s
| j j S( N( u datau isalpha( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isalpha9 s u UserString.isalphac C s
| j j S( N( u datau isalnum( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isalnum: s u UserString.isalnumc C s
| j j S( N( u datau isdecimal( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isdecimal; s u UserString.isdecimalc C s
| j j S( N( u datau isdigit( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isdigit< s u UserString.isdigitc C s
| j j S( N( u datau isidentifier( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isidentifier= s u UserString.isidentifierc C s
| j j S( N( u datau islower( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu islower> s u UserString.islowerc C s
| j j S( N( u datau isnumeric( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isnumeric? s u UserString.isnumericc C s
| j j S( N( u datau isspace( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isspace@ s u UserString.isspacec C s
| j j S( N( u datau istitle( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu istitleA s u UserString.istitlec C s
| j j S( N( u datau isupper( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isupperB s u UserString.isupperc C s | j j | S( N( u datau join( u selfu seq( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu joinC s u UserString.joinc G s | j | j j | | S( N( u __class__u datau ljust( u selfu widthu args( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu ljustD s u UserString.ljustc C s | j | j j S( N( u __class__u datau lower( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu lowerF s u UserString.lowerc C s | j | j j | S( N( u __class__u datau lstrip( u selfu chars( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu lstripG s u UserString.lstripc C s | j j | S( N( u datau partition( u selfu sep( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu partitionH s u UserString.partitioni c C sU t | t r | j } n t | t r6 | j } n | j | j j | | | S( N( u
isinstanceu
UserStringu datau __class__u replace( u selfu oldu newu maxsplit( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu replaceJ s
u UserString.replacec C s1 t | t r | j } n | j j | | | S( N( u
isinstanceu
UserStringu datau rfind( u selfu subu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu rfindP s u UserString.rfindc C s | j j | | | S( N( u datau rindex( u selfu subu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu rindexT s u UserString.rindexc G s | j | j j | | S( N( u __class__u datau rjust( u selfu widthu args( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu rjustV s u UserString.rjustc C s | j j | S( N( u datau
rpartition( u selfu sep( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
rpartitionX s u UserString.rpartitionc C s | j | j j | S( N( u __class__u datau rstrip( u selfu chars( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu rstripZ s u UserString.rstripc C s | j j | | S( N( u datau split( u selfu sepu maxsplit( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu split\ s u UserString.splitc C s | j j | | S( N( u datau rsplit( u selfu sepu maxsplit( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu rsplit^ s u UserString.rsplitc C s | j j | S( N( u datau
splitlines( u selfu keepends( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
splitlines` s u UserString.splitlinesc C s | j j | | | S( N( u datau
startswith( u selfu prefixu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
startswitha s u UserString.startswithc C s | j | j j | S( N( u __class__u datau strip( u selfu chars( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu stripc s u UserString.stripc C s | j | j j S( N( u __class__u datau swapcase( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu swapcased s u UserString.swapcasec C s | j | j j S( N( u __class__u datau title( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu titlee s u UserString.titlec G s | j | j j | S( N( u __class__u datau translate( u selfu args( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu translatef s u UserString.translatec C s | j | j j S( N( u __class__u datau upper( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu upperh s u UserString.upperc C s | j | j j | S( N( u __class__u datau zfill( u selfu width( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu zfilli s u UserString.zfillNiiiF(D u __name__u
__module__u __qualname__u __init__u __str__u __repr__u __int__u __float__u __complex__u __hash__u __eq__u __ne__u __lt__u __le__u __gt__u __ge__u __contains__u __len__u __getitem__u __add__u __radd__u __mul__u __rmul__u __mod__u
capitalizeu centeru _sysu maxsizeu countu Noneu encodeu endswithu
expandtabsu findu formatu indexu isalphau isalnumu isdecimalu isdigitu isidentifieru isloweru isnumericu isspaceu istitleu isupperu joinu ljustu loweru lstripu partitionu replaceu rfindu rindexu rjustu
rpartitionu rstripu splitu rsplitu Falseu
splitlinesu
startswithu stripu swapcaseu titleu translateu upperu zfill( u
__locals__( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
UserString sz (3 u __all__u collections.abcu collectionsu abcu _collectionsu dequeu defaultdictu operatoru
itemgetteru _itemgetteru equ _equ keywordu iskeywordu
_iskeywordu sysu _sysu heapqu _heapqu weakrefu proxyu _proxyu itertoolsu repeatu _repeatu chainu _chainu starmapu _starmapu reprlibu recursive_repru _recursive_repru objectu _Linku dictu OrderedDictu _class_templateu _repr_templateu _field_templateu Falseu
namedtupleu _count_elementsu ImportErroru Counteru MutableMappingu ChainMapu UserDictu MutableSequenceu UserListu Sequenceu
UserString( ( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu s<
[
hg4JPK ! |w& # __pycache__/__main__.cpython-33.pycnu [
f c @ sb d d l m Z d d l m Z m Z e d d d Z e d d d d Z e e e e k sk t Gd d d e d d
Z x0 e d d e d
d f D] Z e e q WGd d d e d d
Z e e d d j
d d e d e j d Z e e j
d d l Z d d l Z e d d Z e e e j e d S( i ( u
namedtuple( u loadsu dumpsu Pointu x, yu xi
u yi c B s8 | Ee Z d Z f Z e d d Z d d Z d S( u Pointc C s | j d | j d d S( Ni g ?( u xu y( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__main__.pyu hypot s u Point.hypotc C s d | j | j | j f S( Nu$ Point: x=%6.3f y=%6.3f hypot=%6.3f( u xu yu hypot( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__main__.pyu __str__ s u
Point.__str__N( u __name__u
__module__u __qualname__u __slots__u propertyu hypotu __str__( u
__locals__( ( u9 /opt/alt/python33/lib64/python3.3/collections/__main__.pyu Point
s u x yi i i i g @c B s> | Ee Z d Z d Z f Z e e j Z e d d Z
d S( u PointuH Point class with optimized _make() and _replace() without error-checkingc K s | j | | j d | S( Nu xu y( u xu y( u _makeu get( u selfu _mapu kwds( ( u9 /opt/alt/python33/lib64/python3.3/collections/__main__.pyu _replace s u Point._replaceN( u __name__u
__module__u __qualname__u __doc__u __slots__u classmethodu tupleu __new__u _makeu mapu _replace( u
__locals__( ( u9 /opt/alt/python33/lib64/python3.3/collections/__main__.pyu Point s i i id u Point3Du zNu TestResultsu failed attemptedTgm۶m?( u z( u collectionsu
namedtupleu pickleu loadsu dumpsu Trueu Pointu pu AssertionErroru printu _replaceu _fieldsu Point3Du __doc__u doctestu TestResultsu testmod( ( ( u9 /opt/alt/python33/lib64/python3.3/collections/__main__.pyu s %
PK ! 8 8 # __pycache__/__init__.cpython-33.pycnu [
f c @ s d d d d d d d d d g Z d d
l Td d l Z e e j j 7Z d d l m Z m Z d d
l m Z m
Z d d l m
Z d d l Z d d l Z d d l m Z d d l m Z m Z m Z d d l m Z Gd d d e Z! Gd d d e" Z# d Z$ d Z% d Z& e' e' d d Z( d d Z) y d d l m) Z) Wn e* k
r[Yn XGd d d e" Z+ Gd d d e, Z- Gd d d e, Z. Gd d d e/ Z0 Gd d d e1 Z2 d S(! u dequeu defaultdictu
namedtupleu UserDictu UserListu
UserStringu Counteru OrderedDictu ChainMapi ( u *N( u dequeu defaultdict( u
itemgetteru eq( u iskeyword( u proxy( u repeatu chainu starmap( u recursive_reprc B s | Ee Z d Z d Z d S( u _Linku prevu nextu keyu __weakref__N( u prevu nextu keyu __weakref__( u __name__u
__module__u __qualname__u __slots__( u
__locals__( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu _Link s u _Linkc B sD | Ee Z d Z d Z d d Z e j e e d d Z e j d d Z d d Z
d
d Z d d
Z d# d d Z d# d d Z d d Z e j Z Z e j Z e j Z e j Z e j Z e Z e d d Z d" d d Z e d d Z d d Z d d Z e! d" d d Z" d d! Z# d" S($ u OrderedDictu) Dictionary that remembers insertion orderc O s t | d k r+ t d t | n y | j WnM t k
r t | _ t | j | _ } | | _ | _ i | _ Yn X| j
| | d S( u Initialize an ordered dictionary. The signature is the same as
regular dictionaries, but keyword arguments are not recommended because
their insertion order is arbitrary.
i u$ expected at most 1 arguments, got %dN( u lenu TypeErroru _OrderedDict__rootu AttributeErroru _Linku _OrderedDict__hardrootu _proxyu prevu nextu _OrderedDict__mapu _OrderedDict__update( u selfu argsu kwdsu root( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __init__) s
u OrderedDict.__init__c C s~ | | k rj | | j | <} | j } | j } | | | | _ | _ | _ | | _ | | | _ n | | | | d S( u! od.__setitem__(i, y) <==> od[i]=yN( u _OrderedDict__mapu _OrderedDict__rootu prevu nextu key( u selfu keyu valueu dict_setitemu proxyu Linku linku rootu last( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __setitem__: s u OrderedDict.__setitem__c C sG | | | | j j | } | j } | j } | | _ | | _ d S( u od.__delitem__(y) <==> del od[y]N( u _OrderedDict__mapu popu prevu next( u selfu keyu dict_delitemu linku link_prevu link_next( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __delitem__H s
u OrderedDict.__delitem__c c s: | j } | j } x! | | k r5 | j V| j } q Wd S( u od.__iter__() <==> iter(od)N( u _OrderedDict__rootu nextu key( u selfu rootu curr( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __iter__S s
u OrderedDict.__iter__c c s: | j } | j } x! | | k r5 | j V| j } q Wd S( u# od.__reversed__() <==> reversed(od)N( u _OrderedDict__rootu prevu key( u selfu rootu curr( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __reversed__\ s
u OrderedDict.__reversed__c C s7 | j } | | _ | _ | j j t j | d S( u. od.clear() -> None. Remove all items from od.N( u _OrderedDict__rootu prevu nextu _OrderedDict__mapu clearu dict( u selfu root( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu cleare s
u OrderedDict.clearc C s | s t d n | j } | rK | j } | j } | | _ | | _ n$ | j } | j } | | _ | | _ | j } | j | =t j | | } | | f S( u od.popitem() -> (k, v), return and remove a (key, value) pair.
Pairs are returned in LIFO order if last is true or FIFO order if false.
u dictionary is empty( u KeyErroru _OrderedDict__rootu prevu nextu keyu _OrderedDict__mapu dictu pop( u selfu lastu rootu linku link_prevu link_nextu keyu value( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu popiteml s
u OrderedDict.popitemc C s | j | } | j } | j } | | _ | | _ | j } | rn | j } | | _ | | _ | | _ | _ n+ | j } | | _ | | _ | | _ | _ d S( u Move an existing element to the end (or beginning if last==False).
Raises KeyError if the element does not exist.
When last=True, acts like a fast version of self[key]=self.pop(key).
N( u _OrderedDict__mapu prevu nextu _OrderedDict__root( u selfu keyu lastu linku link_prevu link_nextu rootu first( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu move_to_end s
u OrderedDict.move_to_endc C sq t j } t | d } | | j } | | | j d 7} | | | j | 7} | | | j | 7} | S( Ni i ( u _sysu getsizeofu lenu __dict__u _OrderedDict__mapu _OrderedDict__hardrootu _OrderedDict__root( u selfu sizeofu nu size( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
__sizeof__ s u OrderedDict.__sizeof__c C sC | | k r! | | } | | =| S| | j k r? t | n | S( u od.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.
( u _OrderedDict__markeru KeyError( u selfu keyu defaultu result( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu pop s
u OrderedDict.popc C s" | | k r | | S| | | <| S( uD od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od( ( u selfu keyu default( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
setdefault s
u OrderedDict.setdefaultc C s7 | s d | j j f Sd | j j t | j f S( u od.__repr__() <==> repr(od)u %s()u %s(%r)( u __class__u __name__u listu items( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __repr__ s u OrderedDict.__repr__c s~ f d d D } t j } x' t t D] } | j | d q; W| rn j | f | f S j | f f S( u% Return state information for picklingc s g | ] } | | g q S( ( ( u .0u k( u self( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
s u* OrderedDict.__reduce__..N( u varsu copyu OrderedDictu popu Noneu __class__( u selfu itemsu inst_dictu k( ( u selfu9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
__reduce__ s u OrderedDict.__reduce__c C s
| j | S( u! od.copy() -> a shallow copy of od( u __class__( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu copy s u OrderedDict.copyc C s( | } x | D] } | | | New ordered dictionary with keys from S.
If not specified, the value defaults to None.
( ( u clsu iterableu valueu selfu key( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu fromkeys s
u OrderedDict.fromkeysc C sG t | t r7 t j | | o6 t t t | | St j | | S( u od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
( u
isinstanceu OrderedDictu dictu __eq__u allu mapu _eq( u selfu other( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __eq__ s (u OrderedDict.__eq__NT($ u __name__u
__module__u __qualname__u __doc__u __init__u dictu __setitem__u _proxyu _Linku __delitem__u __iter__u __reversed__u clearu Trueu popitemu move_to_endu
__sizeof__u MutableMappingu updateu _OrderedDict__updateu keysu valuesu itemsu __ne__u objectu _OrderedDict__markeru popu Noneu
setdefaultu _recursive_repru __repr__u
__reduce__u copyu classmethodu fromkeysu __eq__( u
__locals__( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu OrderedDict s0
u from builtins import property as _property, tuple as _tuple
from operator import itemgetter as _itemgetter
from collections import OrderedDict
class {typename}(tuple):
'{typename}({arg_list})'
__slots__ = ()
_fields = {field_names!r}
def __new__(_cls, {arg_list}):
'Create new instance of {typename}({arg_list})'
return _tuple.__new__(_cls, ({arg_list}))
@classmethod
def _make(cls, iterable, new=tuple.__new__, len=len):
'Make a new {typename} object from a sequence or iterable'
result = new(cls, iterable)
if len(result) != {num_fields:d}:
raise TypeError('Expected {num_fields:d} arguments, got %d' % len(result))
return result
def _replace(_self, **kwds):
'Return a new {typename} object replacing specified fields with new values'
result = _self._make(map(kwds.pop, {field_names!r}, _self))
if kwds:
raise ValueError('Got unexpected field names: %r' % list(kwds))
return result
def __repr__(self):
'Return a nicely formatted representation string'
return self.__class__.__name__ + '({repr_fmt})' % self
@property
def __dict__(self):
'A new OrderedDict mapping field names to their values'
return OrderedDict(zip(self._fields, self))
def _asdict(self):
'''Return a new OrderedDict which maps field names to their values.
This method is obsolete. Use vars(nt) or nt.__dict__ instead.
'''
return self.__dict__
def __getnewargs__(self):
'Return self as a plain tuple. Used by copy and pickle.'
return tuple(self)
def __getstate__(self):
'Exclude the OrderedDict from pickling'
return None
{field_defs}
u {name}=%ruW {name} = _property(_itemgetter({index:d}), doc='Alias for field number {index:d}')
c
C s t | t r* | j d d j } n t t t | } | r t } xo t | D]^ \ } } | j s t | s | j
d s | | k r d | | | >> Point = namedtuple('Point', ['x', 'y'])
>>> Point.__doc__ # docstring for the new class
'Point(x, y)'
>>> p = Point(11, y=22) # instantiate with positional args or keywords
>>> p[0] + p[1] # indexable like a plain tuple
33
>>> x, y = p # unpack like a regular tuple
>>> x, y
(11, 22)
>>> p.x + p.y # fields also accessable by name
33
>>> d = p._asdict() # convert to a dictionary
>>> d['x']
11
>>> Point(**d) # convert from a dictionary
Point(x=11, y=22)
>>> p._replace(x=100) # _replace() is like str.replace() but targets named fields
Point(x=100, y=22)
u ,u u _u _%du8 Type names and field names must be valid identifiers: %ru2 Type names and field names cannot be a keyword: %ru/ Field names cannot start with an underscore: %ru$ Encountered duplicate field name: %ru typenameu field_namesu
num_fieldsu arg_listu 'u i u repr_fmtu , c s s! | ] } t j d | Vq d S( u nameN( u _repr_templateu format( u .0u name( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu j s u namedtuple..u
field_defsu
c s s- | ]# \ } } t j d | d | Vq d S( u indexu nameN( u _field_templateu format( u .0u indexu name( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu l s u __name__u
namedtuple_%su __main__i( u
isinstanceu stru replaceu splitu listu mapu setu enumerateu isidentifieru
_iskeywordu
startswithu addu
ValueErroru _class_templateu formatu tupleu lenu repru joinu dictu execu _sourceu printu _sysu _getframeu f_globalsu getu
__module__u AttributeError(
u typenameu field_namesu verboseu renameu seenu indexu nameu class_definitionu namespaceu result( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
namedtuple. s^
(
%c C s5 | j } x% | D] } | | d d | | >> c = Counter('abcdeabcdabcaba') # count elements from a string
>>> c.most_common(3) # three most common elements
[('a', 5), ('b', 4), ('c', 3)]
>>> sorted(c) # list all unique elements
['a', 'b', 'c', 'd', 'e']
>>> ''.join(sorted(c.elements())) # list elements with repetitions
'aaaaabbbbcccdde'
>>> sum(c.values()) # total of all counts
15
>>> c['a'] # count of letter 'a'
5
>>> for elem in 'shazam': # update counts from an iterable
... c[elem] += 1 # by adding 1 to each element's count
>>> c['a'] # now there are seven 'a'
7
>>> del c['b'] # remove all 'b'
>>> c['b'] # now there are zero 'b'
0
>>> d = Counter('simsalabim') # make another counter
>>> c.update(d) # add in the second counter
>>> c['a'] # now there are nine 'a'
9
>>> c.clear() # empty the counter
>>> c
Counter()
Note: If a count is set to zero or reduced to zero, it will remain
in the counter until the entry is deleted or the counter is cleared:
>>> c = Counter('aaabbc')
>>> c['b'] -= 2 # reduce the count of 'b' by two
>>> c.most_common() # 'b' is still in, but its count is zero
[('a', 3), ('c', 1), ('b', 0)]
c s! t j | j | | d S( u Create a new, empty Counter object. And if given, count elements
from an input iterable. Or, initialize the count from another mapping
of elements to their counts.
>>> c = Counter() # a new, empty counter
>>> c = Counter('gallahad') # a new counter from an iterable
>>> c = Counter({'a': 4, 'b': 2}) # a new counter from a mapping
>>> c = Counter(a=4, b=2) # a new counter from keyword args
N( u superu __init__u update( u selfu iterableu kwds( u __class__( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __init__ s
u Counter.__init__c C s d S( u1 The count of elements not in the Counter is zero.i ( ( u selfu key( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __missing__ s u Counter.__missing__c C sP | d k r. t | j d t d d d St j | | j d t d S( u List the n most common elements and their counts from the most
common to the least. If n is None, then list all element counts.
>>> Counter('abcdeabcdabcaba').most_common(3)
[('a', 5), ('b', 4), ('c', 3)]
u keyi u reverseNT( u Noneu sortedu itemsu _itemgetteru Trueu _heapqu nlargest( u selfu n( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu most_common s "u Counter.most_commonc C s t j t t | j S( u Iterator over elements repeating each as many times as its count.
>>> c = Counter('ABCABC')
>>> sorted(c.elements())
['A', 'A', 'B', 'B', 'C', 'C']
# Knuth's example for prime factors of 1836: 2**2 * 3**3 * 17**1
>>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
>>> product = 1
>>> for factor in prime_factors.elements(): # loop over factors
... product *= factor # and multiply them
>>> product
1836
Note, if an element's count has been set to zero or is a negative
number, elements() will ignore it.
( u _chainu
from_iterableu _starmapu _repeatu items( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu elements s u Counter.elementsc C s t d d S( Nu@ Counter.fromkeys() is undefined. Use Counter(iterable) instead.( u NotImplementedError( u clsu iterableu v( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu fromkeys s u Counter.fromkeysc s | d k r t | t rt | ra | j } xD | j D]# \ } } | | | d | | >> c = Counter('which')
>>> c.update('witch') # add elements from another iterable
>>> d = Counter('watch')
>>> c.update(d) # add elements from another counter
>>> c['h'] # four 'h' in which, witch, and watch
4
i N( u Noneu
isinstanceu Mappingu getu itemsu superu updateu _count_elements( u selfu iterableu kwdsu self_getu elemu count( u __class__( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu update s u Counter.updatec K s | d k r | j } t | t r[ x\ | j D]# \ } } | | d | | | >> c = Counter('which')
>>> c.subtract('witch') # subtract elements from another iterable
>>> c.subtract(Counter('watch')) # subtract elements from another counter
>>> c['h'] # 2 in which, minus 1 in witch, minus 1 in watch
0
>>> c['w'] # 1 in which, minus 1 in witch, minus 1 in watch
-1
i i N( u Noneu getu
isinstanceu Mappingu itemsu subtract( u selfu iterableu kwdsu self_getu elemu count( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu subtract' s
u Counter.subtractc C s
| j | S( u Return a shallow copy.( u __class__( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu copyB s u Counter.copyc C s | j t | f f S( N( u __class__u dict( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
__reduce__F s u Counter.__reduce__c s# | | k r t j | n d S( uG Like dict.__delitem__() but does not raise KeyError for missing values.N( u superu __delitem__( u selfu elem( u __class__( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __delitem__I s u Counter.__delitem__c C s | s d | j j Sy9 d j t d j | j } d | j j | f SWn. t k
r} d j | j j t | SYn Xd S( Nu %s()u , u %r: %ru %s({%s})u
{0}({1!r})( u __class__u __name__u joinu mapu __mod__u most_commonu TypeErroru formatu dict( u selfu items( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __repr__N s !
u Counter.__repr__c C s t | t s t St } xA | j D]3 \ } } | | | } | d k r) | | | >> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
i ( u
isinstanceu Counteru NotImplementedu items( u selfu otheru resultu elemu countu newcount( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __add__a s u Counter.__add__c C s t | t s t St } xA | j D]3 \ } } | | | } | d k r) | | | >> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
i ( u
isinstanceu Counteru NotImplementedu items( u selfu otheru resultu elemu countu newcount( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __sub__t s u Counter.__sub__c C s t | t s t St } xU | j D]G \ } } | | } | | k rQ | n | } | d k r) | | | >> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
i ( u
isinstanceu Counteru NotImplementedu items( u selfu otheru resultu elemu countu other_countu newcount( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __or__ s
u Counter.__or__c C sx t | t s t St } xU | j D]G \ } } | | } | | k rQ | n | } | d k r) | | | >> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
i ( u
isinstanceu Counteru NotImplementedu items( u selfu otheru resultu elemu countu other_countu newcount( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __and__ s
u Counter.__and__c C s | t S( uE Adds an empty counter, effectively stripping negative and zero counts( u Counter( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __pos__ s u Counter.__pos__c C s t | S( u{ Subtracts from an empty counter. Strips positive and zero counts,
and flips the sign on negative counts.
( u Counter( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __neg__ s u Counter.__neg__c C s5 d d | j D } x | D]
} | | =q W| S( u? Internal method to strip elements with a negative or zero countc S s( g | ] \ } } | d k s | q S( i ( ( u .0u elemu count( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
s u* Counter._keep_positive..( u items( u selfu nonpositiveu elem( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu _keep_positive s
u Counter._keep_positivec C s5 x( | j D] \ } } | | | 7>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
( u itemsu _keep_positive( u selfu otheru elemu count( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __iadd__ s u Counter.__iadd__c C s5 x( | j D] \ } } | | | 8>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
( u itemsu _keep_positive( u selfu otheru elemu count( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __isub__ s u Counter.__isub__c C sJ x= | j D]/ \ } } | | } | | k r
| | | >> c = Counter('abbb')
>>> c |= Counter('bcc')
>>> c
Counter({'b': 3, 'c': 2, 'a': 1})
( u itemsu _keep_positive( u selfu otheru elemu other_countu count( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __ior__ s
u Counter.__ior__c C sJ x= | j D]/ \ } } | | } | | k r
| | | >> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
( u itemsu _keep_positive( u selfu otheru elemu countu other_count( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __iand__ s
u Counter.__iand__N( u __name__u
__module__u __qualname__u __doc__u Noneu __init__u __missing__u most_commonu elementsu classmethodu fromkeysu updateu subtractu copyu
__reduce__u __delitem__u __repr__u __add__u __sub__u __or__u __and__u __pos__u __neg__u _keep_positiveu __iadd__u __isub__u __ior__u __iand__( u
__locals__( ( u __class__u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu Counter s0 +
!
c B s | Ee Z d Z d Z d d Z d d Z d d Z d& d d Z d
d Z d d
Z
d d Z d d Z e
d d Z e d d Z d d Z e Z d d Z e d d Z d d Z d d Z d d! Z d" d# Z d$ d% Z d& S(' u ChainMapu A ChainMap groups multiple dicts (or other mappings) together
to create a single, updateable view.
The underlying mappings are stored in a list. That list is public and can
accessed or updated using the *maps* attribute. There is no other state.
Lookups search the underlying mappings successively until a key is found.
In contrast, writes, updates, and deletions only operate on the first
mapping.
c G s t | p i g | _ d S( u Initialize a ChainMap by setting *maps* to the given mappings.
If no mappings are provided, a single empty dictionary is used.
N( u listu maps( u selfu maps( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __init__ s u ChainMap.__init__c C s t | d S( N( u KeyError( u selfu key( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __missing__ s u ChainMap.__missing__c C sB x2 | j D]' } y | | SWq
t k
r0 Yq
Xq
W| j | S( N( u mapsu KeyErroru __missing__( u selfu keyu mapping( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __getitem__ s
u ChainMap.__getitem__c C s | | k r | | S| S( N( ( u selfu keyu default( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu get s u ChainMap.getc C s t t j | j S( N( u lenu setu unionu maps( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __len__ s u ChainMap.__len__c C s t t j | j S( N( u iteru setu unionu maps( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __iter__ s u ChainMap.__iter__c s t f d d | j D S( Nc 3 s | ] } | k Vq d S( N( ( u .0u m( u key( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu $ s u( ChainMap.__contains__..( u anyu maps( u selfu key( ( u keyu9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __contains__# s u ChainMap.__contains__c C s
t | j S( N( u anyu maps( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __bool__& s u ChainMap.__bool__c C s% d j | d j t t | j S( Nu {0.__class__.__name__}({1})u , ( u formatu joinu mapu repru maps( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __repr__) s u ChainMap.__repr__c G s | t j | | S( u? Create a ChainMap with a single dict created from the iterable.( u dictu fromkeys( u clsu iterableu args( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu fromkeys. s u ChainMap.fromkeysc C s* | j | j d j | j d d S( uH New ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]i i N( u __class__u mapsu copy( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu copy3 s u
ChainMap.copyc C s | j i | j S( u; New ChainMap with a new dict followed by all previous maps.( u __class__u maps( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu new_child9 s u ChainMap.new_childc C s | j | j d d S( u New ChainMap from maps[1:].i N( u __class__u maps( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu parents= s u ChainMap.parentsc C s | | j d | Z# d? S(A u UserListuA A more or less complete user-defined wrapper around list objects.c C s g | _ | d k r t | t | j k rF | | j d d Z$ d? d@ Z% dA dB Z& dC dD Z' dE dF Z( dG dH Z) dI dJ Z* dK dL Z+ dM dN Z, dO dP Z- dQ dR Z. dS dT Z/ dU dV Z0 d| dW dX Z1 dY dZ Z2 d} d\ d] Z3 d- e j d^ d_ Z4 d- e j d` da Z5 db dc Z6 dd de Z7 d| df dg Z8 d| d~ dh di Z9 d| d dj dk Z: d dl dm Z< d- e j dn do Z= d| dp dq Z> dr ds Z? dt du Z@ dv dw ZA dx dy ZB dz d{ ZC d| S( u
UserStringc C sV t | t r | | _ n7 t | t rC | j d d | _ n t | | _ d S( N( u
isinstanceu stru datau
UserString( u selfu seq( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __init__ s
u UserString.__init__c C s
t | j S( N( u stru data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __str__ s u UserString.__str__c C s
t | j S( N( u repru data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __repr__ s u UserString.__repr__c C s
t | j S( N( u intu data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __int__ s u UserString.__int__c C s
t | j S( N( u floatu data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __float__ s u UserString.__float__c C s
t | j S( N( u complexu data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __complex__ s u UserString.__complex__c C s
t | j S( N( u hashu data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __hash__ s u UserString.__hash__c C s, t | t r | j | j k S| j | k S( N( u
isinstanceu
UserStringu data( u selfu string( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __eq__ s u UserString.__eq__c C s, t | t r | j | j k S| j | k S( N( u
isinstanceu
UserStringu data( u selfu string( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __ne__ s u UserString.__ne__c C s, t | t r | j | j k S| j | k S( N( u
isinstanceu
UserStringu data( u selfu string( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __lt__ s u UserString.__lt__c C s, t | t r | j | j k S| j | k S( N( u
isinstanceu
UserStringu data( u selfu string( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __le__ s u UserString.__le__c C s, t | t r | j | j k S| j | k S( N( u
isinstanceu
UserStringu data( u selfu string( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __gt__ s u UserString.__gt__c C s, t | t r | j | j k S| j | k S( N( u
isinstanceu
UserStringu data( u selfu string( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __ge__ s u UserString.__ge__c C s( t | t r | j } n | | j k S( N( u
isinstanceu
UserStringu data( u selfu char( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __contains__ s u UserString.__contains__c C s
t | j S( N( u lenu data( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __len__
s u UserString.__len__c C s | j | j | S( N( u __class__u data( u selfu index( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __getitem__ s u UserString.__getitem__c C sc t | t r& | j | j | j St | t rI | j | j | S| j | j t | S( N( u
isinstanceu
UserStringu __class__u datau str( u selfu other( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __add__ s
u UserString.__add__c C s= t | t r# | j | | j S| j t | | j S( N( u
isinstanceu stru __class__u data( u selfu other( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __radd__ s u UserString.__radd__c C s | j | j | S( N( u __class__u data( u selfu n( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __mul__ s u UserString.__mul__c C s | j | j | S( N( u __class__u data( u selfu args( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu __mod__ s u UserString.__mod__c C s | j | j j S( N( u __class__u datau
capitalize( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
capitalize s u UserString.capitalizec G s | j | j j | | S( N( u __class__u datau center( u selfu widthu args( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu center! s u UserString.centeri c C s1 t | t r | j } n | j j | | | S( N( u
isinstanceu
UserStringu datau count( u selfu subu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu count# s u UserString.countc C sW | rA | r( | j | j j | | S| j | j j | S| j | j j S( N( u __class__u datau encode( u selfu encodingu errors( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu encode' s
u UserString.encodec C s | j j | | | S( N( u datau endswith( u selfu suffixu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu endswith- s u UserString.endswithi c C s | j | j j | S( N( u __class__u datau
expandtabs( u selfu tabsize( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
expandtabs/ s u UserString.expandtabsc C s1 t | t r | j } n | j j | | | S( N( u
isinstanceu
UserStringu datau find( u selfu subu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu find1 s u UserString.findc O s | j j | | S( N( u datau format( u selfu argsu kwds( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu format5 s u UserString.formatc C s | j j | | | S( N( u datau index( u selfu subu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu index7 s u UserString.indexc C s
| j j S( N( u datau isalpha( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isalpha9 s u UserString.isalphac C s
| j j S( N( u datau isalnum( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isalnum: s u UserString.isalnumc C s
| j j S( N( u datau isdecimal( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isdecimal; s u UserString.isdecimalc C s
| j j S( N( u datau isdigit( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isdigit< s u UserString.isdigitc C s
| j j S( N( u datau isidentifier( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isidentifier= s u UserString.isidentifierc C s
| j j S( N( u datau islower( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu islower> s u UserString.islowerc C s
| j j S( N( u datau isnumeric( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isnumeric? s u UserString.isnumericc C s
| j j S( N( u datau isspace( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isspace@ s u UserString.isspacec C s
| j j S( N( u datau istitle( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu istitleA s u UserString.istitlec C s
| j j S( N( u datau isupper( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu isupperB s u UserString.isupperc C s | j j | S( N( u datau join( u selfu seq( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu joinC s u UserString.joinc G s | j | j j | | S( N( u __class__u datau ljust( u selfu widthu args( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu ljustD s u UserString.ljustc C s | j | j j S( N( u __class__u datau lower( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu lowerF s u UserString.lowerc C s | j | j j | S( N( u __class__u datau lstrip( u selfu chars( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu lstripG s u UserString.lstripc C s | j j | S( N( u datau partition( u selfu sep( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu partitionH s u UserString.partitioni c C sU t | t r | j } n t | t r6 | j } n | j | j j | | | S( N( u
isinstanceu
UserStringu datau __class__u replace( u selfu oldu newu maxsplit( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu replaceJ s
u UserString.replacec C s1 t | t r | j } n | j j | | | S( N( u
isinstanceu
UserStringu datau rfind( u selfu subu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu rfindP s u UserString.rfindc C s | j j | | | S( N( u datau rindex( u selfu subu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu rindexT s u UserString.rindexc G s | j | j j | | S( N( u __class__u datau rjust( u selfu widthu args( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu rjustV s u UserString.rjustc C s | j j | S( N( u datau
rpartition( u selfu sep( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
rpartitionX s u UserString.rpartitionc C s | j | j j | S( N( u __class__u datau rstrip( u selfu chars( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu rstripZ s u UserString.rstripc C s | j j | | S( N( u datau split( u selfu sepu maxsplit( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu split\ s u UserString.splitc C s | j j | | S( N( u datau rsplit( u selfu sepu maxsplit( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu rsplit^ s u UserString.rsplitc C s | j j | S( N( u datau
splitlines( u selfu keepends( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
splitlines` s u UserString.splitlinesc C s | j j | | | S( N( u datau
startswith( u selfu prefixu startu end( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
startswitha s u UserString.startswithc C s | j | j j | S( N( u __class__u datau strip( u selfu chars( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu stripc s u UserString.stripc C s | j | j j S( N( u __class__u datau swapcase( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu swapcased s u UserString.swapcasec C s | j | j j S( N( u __class__u datau title( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu titlee s u UserString.titlec G s | j | j j | S( N( u __class__u datau translate( u selfu args( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu translatef s u UserString.translatec C s | j | j j S( N( u __class__u datau upper( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu upperh s u UserString.upperc C s | j | j j | S( N( u __class__u datau zfill( u selfu width( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu zfilli s u UserString.zfillNiiiF(D u __name__u
__module__u __qualname__u __init__u __str__u __repr__u __int__u __float__u __complex__u __hash__u __eq__u __ne__u __lt__u __le__u __gt__u __ge__u __contains__u __len__u __getitem__u __add__u __radd__u __mul__u __rmul__u __mod__u
capitalizeu centeru _sysu maxsizeu countu Noneu encodeu endswithu
expandtabsu findu formatu indexu isalphau isalnumu isdecimalu isdigitu isidentifieru isloweru isnumericu isspaceu istitleu isupperu joinu ljustu loweru lstripu partitionu replaceu rfindu rindexu rjustu
rpartitionu rstripu splitu rsplitu Falseu
splitlinesu
startswithu stripu swapcaseu titleu translateu upperu zfill( u
__locals__( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu
UserString sz (3 u __all__u collections.abcu collectionsu abcu _collectionsu dequeu defaultdictu operatoru
itemgetteru _itemgetteru equ _equ keywordu iskeywordu
_iskeywordu sysu _sysu heapqu _heapqu weakrefu proxyu _proxyu itertoolsu repeatu _repeatu chainu _chainu starmapu _starmapu reprlibu recursive_repru _recursive_repru objectu _Linku dictu OrderedDictu _class_templateu _repr_templateu _field_templateu Falseu
namedtupleu _count_elementsu ImportErroru Counteru MutableMappingu ChainMapu UserDictu MutableSequenceu UserListu Sequenceu
UserString( ( ( u9 /opt/alt/python33/lib64/python3.3/collections/__init__.pyu s<
[
hg4JPK ! VۍR R # __pycache__/__main__.cpython-33.pyonu [
f c @ sD d d l m Z d d l m Z m Z e d d d Z e d d d d Z Gd d d e d d
Z x0 e d d e d
d f D] Z e e q WGd d d e d d
Z e e d d j d d e d e j
d Z e e j d d l
Z
d d l Z e d d Z e e e
j e d S( i ( u
namedtuple( u loadsu dumpsu Pointu x, yu xi
u yi c B s8 | Ee Z d Z f Z e d d Z d d Z d S( u Pointc C s | j d | j d d S( Ni g ?( u xu y( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__main__.pyu hypot s u Point.hypotc C s d | j | j | j f S( Nu$ Point: x=%6.3f y=%6.3f hypot=%6.3f( u xu yu hypot( u self( ( u9 /opt/alt/python33/lib64/python3.3/collections/__main__.pyu __str__ s u
Point.__str__N( u __name__u
__module__u __qualname__u __slots__u propertyu hypotu __str__( u
__locals__( ( u9 /opt/alt/python33/lib64/python3.3/collections/__main__.pyu Point
s u x yi i i i g @c B s> | Ee Z d Z d Z f Z e e j Z e d d Z
d S( u PointuH Point class with optimized _make() and _replace() without error-checkingc K s | j | | j d | S( Nu xu y( u xu y( u _makeu get( u selfu _mapu kwds( ( u9 /opt/alt/python33/lib64/python3.3/collections/__main__.pyu _replace s u Point._replaceN( u __name__u
__module__u __qualname__u __doc__u __slots__u classmethodu tupleu __new__u _makeu mapu _replace( u
__locals__( ( u9 /opt/alt/python33/lib64/python3.3/collections/__main__.pyu Point s i i id u Point3Du zNu TestResultsu failed attemptedTgm۶m?( u z( u collectionsu
namedtupleu pickleu loadsu dumpsu Trueu Pointu pu printu _replaceu _fieldsu Point3Du __doc__u doctestu TestResultsu testmod( ( ( u9 /opt/alt/python33/lib64/python3.3/collections/__main__.pyu s %
PK ! ݿ __pycache__/abc.cpython-33.pyonu [
fJ c @ 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 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, Z/ e/ j$ e Gd% d
d
e+ Z0 e0 j$ e1 Gd& d d e% e" e& Z2 e2 j$ e3 e2 j$ e4 e2 j$ e Gd' d d e2 Z5 e5 j$ e6 e5 j$ e Gd( d d e2 Z7 e7 j$ e8 e7 j$ e d S() uj Abstract Base Classes (ABCs) for collections, according to PEP 3119.
Unit tests are in test_collections.
i ( u ABCMetau abstractmethodNu Hashableu Iterableu Iteratoru Sizedu Containeru Callableu Setu
MutableSetu Mappingu MutableMappingu MappingViewu KeysViewu ItemsViewu
ValuesViewu Sequenceu MutableSequenceu
ByteStrings u c B s> | Ee Z d Z f Z e d d Z e d d Z d S( u Hashablec C s d S( Ni ( ( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __hash__7 s u Hashable.__hash__c C sK | t k rG x8 | j D]* } d | j k r | j d r< d SPq q Wn t S( Nu __hash__T( u Hashableu __mro__u __dict__u Trueu NotImplemented( u clsu Cu B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__; s
u Hashable.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __hash__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Hashable3 s u metaclassc B s> | Ee Z d Z f Z e d d Z e d d Z d S( u Iterablec c s d S( N( ( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__J s u Iterable.__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( u __iter__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu R s u, Iterable.__subclasshook__..T( u Iterableu anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__O s u Iterable.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __iter__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu IterableF s c B sJ | Ee Z d Z f Z e d d Z d d Z e d d Z d S( u Iteratorc C s
t d S( uK Return the next item from the iterator. When exhausted, raise StopIterationN( u
StopIteration( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __next__[ s u Iterator.__next__c C s | S( N( ( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__` s u Iterator.__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( u __next__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu f s u, Iterator.__subclasshook__..c s s | ] } d | j k Vq d S( u __iter__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu g s T( u Iteratoru anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__c s
u Iterator.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __next__u __iter__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu IteratorW s c B s> | Ee Z d Z f Z e d d Z e d d Z d S( u Sizedc C s d S( Ni ( ( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __len__} s u
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( u __len__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u) Sized.__subclasshook__..T( u Sizedu anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__ s u Sized.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __len__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Sizedy s c B s> | Ee Z d Z f Z e d d Z e d d Z d S( u Containerc C s d S( NF( u False( u selfu x( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__ s u Container.__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( u __contains__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u- Container.__subclasshook__..T( u Containeru anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__ s u Container.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __contains__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Container s c B s> | Ee Z d Z f Z e d d Z e d d Z d S( u Callablec O s d S( NF( u False( u selfu argsu kwds( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __call__ s u Callable.__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( u __call__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u, Callable.__subclasshook__..T( u Callableu anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__ s u Callable.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __call__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Callable s c B s | Ee Z d Z d Z f Z d d Z d d Z d d Z d d Z d
d Z 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 S( u Setuh 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), all you have to do is redefine __le__ and
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( u
isinstanceu Setu NotImplementedu lenu Falseu True( u selfu otheru elem( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __le__ s
u
Set.__le__c C s8 t | t s t St | t | k o7 | j | S( N( u
isinstanceu Setu NotImplementedu lenu __le__( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __lt__ s u
Set.__lt__c C s t | t s t S| j | S( N( u
isinstanceu Setu NotImplementedu __lt__( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __gt__ s u
Set.__gt__c C s t | t s t S| j | S( N( u
isinstanceu Setu NotImplementedu __le__( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ge__ s u
Set.__ge__c C s8 t | t s t St | t | k o7 | j | S( N( u
isinstanceu Setu NotImplementedu lenu __le__( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __eq__ s u
Set.__eq__c C s | | k S( N( ( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ne__ s u
Set.__ne__c C s
| | S( u 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.
( ( u clsu it( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu _from_iterable s u Set._from_iterablec s3 t | t s t S j f d d | D S( Nc 3 s! | ] } | k r | Vq d S( N( ( u .0u value( u self( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u Set.__and__..( u
isinstanceu Iterableu NotImplementedu _from_iterable( u selfu other( ( u selfu4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __and__ s u Set.__and__c C s% x | D] } | | k r d Sq Wd S( u1 Return True if two sets have a null intersection.FT( u Falseu True( u selfu otheru value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
isdisjoint s
u Set.isdisjointc C s9 t | t s t Sd d | | f D } | j | S( Nc s s" | ] } | D] } | Vq
q d S( N( ( u .0u su e( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u Set.__or__..( u
isinstanceu Iterableu NotImplementedu _from_iterable( u selfu otheru chain( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __or__ s u
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( N( ( u .0u value( u other( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u Set.__sub__..( u
isinstanceu Setu Iterableu NotImplementedu _from_iterable( u selfu other( ( u otheru4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __sub__ s
u Set.__sub__c C sD t | t s4 t | t s" t S| j | } n | | | | BS( N( u
isinstanceu Setu Iterableu NotImplementedu _from_iterable( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __xor__ s
u 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( u+ 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.
i i iMri iM[l 4~2 i
i6i8#i( u sysu maxsizeu lenu hash( u selfu MAXu MASKu nu hu xu hx( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu _hash s
u Set._hashN( u __name__u
__module__u __qualname__u __doc__u __slots__u __le__u __lt__u __gt__u __ge__u __eq__u __ne__u classmethodu _from_iterableu __and__u
isdisjointu __or__u __sub__u __xor__u _hash( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Set s
c B s | Ee 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( u
MutableSetu 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( u Add an element.N( u NotImplementedError( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu add6 s u MutableSet.addc C s
t d S( u8 Remove an element. Do not raise an exception if absent.N( u NotImplementedError( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu discard; s u MutableSet.discardc C s, | | k r t | n | j | d S( u5 Remove an element. If not a member, raise a KeyError.N( u KeyErroru discard( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu remove@ s u MutableSet.removec C sH t | } y t | } Wn t k
r6 t Yn X| j | | S( u2 Return the popped value. Raise KeyError if empty.( u iteru nextu
StopIterationu KeyErroru discard( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu popF s
u MutableSet.popc C s- y x
| j q Wn t k
r( Yn Xd S( u6 This is slow (creates N new iterators!) but effective.N( u popu KeyError( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu clearP s
u MutableSet.clearc C s" x | D] } | j | q W| S( N( u add( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ior__X s
u MutableSet.__ior__c C s& x | | D] } | j | q W| S( N( u discard( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iand__] s u MutableSet.__iand__c C sx | | k r | j n[ t | t s: | j | } n x7 | D]/ } | | k rc | j | qA | j | qA W| S( N( u clearu
isinstanceu Setu _from_iterableu discardu add( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ixor__b s
u MutableSet.__ixor__c C s; | | k r | j n x | D] } | j | q W| S( N( u clearu discard( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __isub__o s
u MutableSet.__isub__N( u __name__u
__module__u __qualname__u __doc__u __slots__u abstractmethodu addu discardu removeu popu clearu __ior__u __iand__u __ixor__u __isub__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
MutableSet( s
c B s | Ee 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 d Z
d S( u Mappingc C s
t d S( N( u KeyError( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __getitem__ s u Mapping.__getitem__c C s) y | | SWn t k
r$ | SYn Xd S( u< D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.N( u KeyError( u selfu keyu default( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu get s
u Mapping.getc C s- y | | Wn t k
r$ d SYn Xd Sd S( NFT( u KeyErroru Falseu True( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__ s
u Mapping.__contains__c C s
t | S( u: D.keys() -> a set-like object providing a view on D's keys( u KeysView( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu keys s u Mapping.keysc C s
t | S( u< D.items() -> a set-like object providing a view on D's items( u ItemsView( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu items s u
Mapping.itemsc C s
t | S( u6 D.values() -> an object providing a view on D's values( u
ValuesView( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu values s u Mapping.valuesc C s5 t | t s t St | j t | j k S( N( u
isinstanceu Mappingu NotImplementedu dictu items( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __eq__ s u Mapping.__eq__c C s | | k S( N( ( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ne__ s u Mapping.__ne__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __getitem__u Noneu getu __contains__u keysu itemsu valuesu __eq__u __ne__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Mapping} s
c B s8 | Ee Z d Z d d Z d d Z d d Z d S( u MappingViewc C s
| | _ d S( N( u _mapping( u selfu mapping( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __init__ s u MappingView.__init__c C s
t | j S( N( u lenu _mapping( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __len__ s u MappingView.__len__c C s
d j | S( Nu& {0.__class__.__name__}({0._mapping!r})( u format( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __repr__ s u MappingView.__repr__N( u __name__u
__module__u __qualname__u __init__u __len__u __repr__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu MappingView s c B s> | Ee Z d Z e d d Z d d Z d d Z d S( u KeysViewc C s
t | S( N( u set( u selfu it( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu _from_iterable s u KeysView._from_iterablec C s
| | j k S( N( u _mapping( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__ s u KeysView.__contains__c c s x | j D] } | Vq
Wd S( N( u _mapping( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__ s u KeysView.__iter__N( u __name__u
__module__u __qualname__u classmethodu _from_iterableu __contains__u __iter__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu KeysView s c B s> | Ee Z d Z e d d Z d d Z d d Z d S( u ItemsViewc C s
t | S( N( u set( u selfu it( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu _from_iterable s u ItemsView._from_iterablec C sD | \ } } y | j | } Wn t k
r5 d SYn X| | k Sd S( NF( u _mappingu KeyErroru False( u selfu itemu keyu valueu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__ s
u ItemsView.__contains__c c s* x# | j D] } | | j | f Vq
Wd S( N( u _mapping( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__ s u ItemsView.__iter__N( u __name__u
__module__u __qualname__u classmethodu _from_iterableu __contains__u __iter__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu ItemsView s c B s, | Ee Z d Z d d Z d d Z d S( u
ValuesViewc C s/ x( | j D] } | | j | k r
d Sq
Wd S( NTF( u _mappingu Trueu False( u selfu valueu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__ s u ValuesView.__contains__c c s$ x | j D] } | j | Vq
Wd S( N( u _mapping( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__ s u ValuesView.__iter__N( u __name__u
__module__u __qualname__u __contains__u __iter__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
ValuesView s c B s | Ee 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( u MutableMappingc C s
t d S( N( u KeyError( u selfu keyu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __setitem__ s u MutableMapping.__setitem__c C s
t d S( N( u KeyError( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __delitem__ s u MutableMapping.__delitem__c C sK y | | } Wn+ t k
r; | | j k r3 n | SYn X| | =| Sd S( u 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( u KeyErroru _MutableMapping__marker( u selfu keyu defaultu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu pop s
u MutableMapping.popc C sL y t t | } Wn t k
r0 t Yn X| | } | | =| | f S( u D.popitem() -> (k, v), remove and return some (key, value) pair
as a 2-tuple; but raise KeyError if D is empty.
( u nextu iteru
StopIterationu KeyError( u selfu keyu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu popitem s
u MutableMapping.popitemc C s- y x
| j q Wn t k
r( Yn Xd S( u, D.clear() -> None. Remove all items from D.N( u popitemu KeyError( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu clear% s
u MutableMapping.clearc O s% t | d k r0 t d j t | n | sE t d n | d } t | d k rk | d n f } 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
i u8 update() takes at most 2 positional arguments ({} given)u, update() takes at least 1 argument (0 given)i i u keysN( u lenu TypeErroru formatu
isinstanceu Mappingu hasattru keysu items( u argsu kwdsu selfu otheru keyu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu update- s"
"
u MutableMapping.updatec C s/ y | | SWn t k
r* | | | D.get(k,d), also set D[k]=d if k not in D( u KeyError( u selfu keyu default( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
setdefaultG s
u MutableMapping.setdefaultN( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __setitem__u __delitem__u objectu _MutableMapping__markeru popu popitemu clearu updateu Noneu
setdefault( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu MutableMapping s c B sn | Ee 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( u Sequenceu All the operations on a read-only sequence.
Concrete subclasses must override __new__ or __init__,
__getitem__, and __len__.
c C s
t d S( N( u
IndexError( u selfu index( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __getitem___ s u Sequence.__getitem__c c sF d } y# x | | } | V| d 7} q Wn t k
rA d SYn Xd S( Ni i ( u
IndexError( u selfu iu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__c s
u Sequence.__iter__c C s% x | D] } | | k r d Sq Wd S( NTF( u Trueu False( u selfu valueu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__m s
u Sequence.__contains__c c s0 x) t t t | D] } | | Vq Wd S( N( u reversedu rangeu len( u selfu i( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __reversed__s s u Sequence.__reversed__c C s7 x* t | D] \ } } | | k r
| Sq
Wt d S( u| S.index(value) -> integer -- return first index of value.
Raises ValueError if the value is not present.
N( u enumerateu
ValueError( u selfu valueu iu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu indexw s u Sequence.indexc s t f d d | D S( uB S.count(value) -> integer -- return number of occurrences of valuec 3 s! | ] } | k r d Vq d S( i N( ( u .0u v( u value( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u! Sequence.count..( u sum( u selfu value( ( u valueu4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu count s u Sequence.countN( u __name__u
__module__u __qualname__u __doc__u __slots__u abstractmethodu __getitem__u __iter__u __contains__u __reversed__u indexu count( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu SequenceU s
c B s | Ee Z d Z d Z f Z d S( u
ByteStringuM This unifies bytes and bytearray.
XXX Should add all their methods.
N( u __name__u
__module__u __qualname__u __doc__u __slots__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
ByteString s c B s | Ee 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( u MutableSequencec C s
t d S( N( u
IndexError( u selfu indexu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __setitem__ s u MutableSequence.__setitem__c C s
t d S( N( u
IndexError( u selfu index( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __delitem__ s u MutableSequence.__delitem__c C s
t d S( u3 S.insert(index, value) -- insert value before indexN( u
IndexError( u selfu indexu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu insert s u MutableSequence.insertc C s | j t | | d S( u: S.append(value) -- append value to the end of the sequenceN( u insertu len( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu append s u MutableSequence.appendc C s- y x
| j q Wn t k
r( Yn Xd S( u, S.clear() -> None -- remove all items from SN( u popu
IndexError( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu clear s
u MutableSequence.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.
( ( u selfu indexu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu pop s
u MutableSequence.popc C s | | j | =d S( uv S.remove(value) -- remove first occurrence of value.
Raise ValueError if the value is not present.
N( u index( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu remove s u MutableSequence.removec C s | j | | S( N( u extend( u selfu values( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iadd__ s
u MutableSequence.__iadd__Ni( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __setitem__u __delitem__u insertu appendu clearu reverseu extendu popu removeu __iadd__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu MutableSequence s (9 u __doc__u abcu ABCMetau abstractmethodu sysu __all__u typeu iteru bytes_iteratoru bytearrayu bytearray_iteratoru keysu dict_keyiteratoru valuesu dict_valueiteratoru itemsu dict_itemiteratoru
list_iteratoru reversedu list_reverseiteratoru rangeu range_iteratoru setu set_iteratoru str_iteratoru tuple_iteratoru zipu zip_iteratoru dict_keysu dict_valuesu
dict_itemsu __dict__u mappingproxyu Hashableu Iterableu Iteratoru registeru Sizedu Containeru Callableu Setu frozensetu
MutableSetu Mappingu MappingViewu KeysViewu ItemsViewu
ValuesViewu MutableMappingu dictu Sequenceu tupleu stru
ByteStringu bytesu MutableSequenceu list( ( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s
y
O
3
[
/
A
PK ! ݿ __pycache__/abc.cpython-33.pycnu [
fJ c @ 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 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, Z/ e/ j$ e Gd% d
d
e+ Z0 e0 j$ e1 Gd& d d e% e" e& Z2 e2 j$ e3 e2 j$ e4 e2 j$ e Gd' d d e2 Z5 e5 j$ e6 e5 j$ e Gd( d d e2 Z7 e7 j$ e8 e7 j$ e d S() uj Abstract Base Classes (ABCs) for collections, according to PEP 3119.
Unit tests are in test_collections.
i ( u ABCMetau abstractmethodNu Hashableu Iterableu Iteratoru Sizedu Containeru Callableu Setu
MutableSetu Mappingu MutableMappingu MappingViewu KeysViewu ItemsViewu
ValuesViewu Sequenceu MutableSequenceu
ByteStrings u c B s> | Ee Z d Z f Z e d d Z e d d Z d S( u Hashablec C s d S( Ni ( ( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __hash__7 s u Hashable.__hash__c C sK | t k rG x8 | j D]* } d | j k r | j d r< d SPq q Wn t S( Nu __hash__T( u Hashableu __mro__u __dict__u Trueu NotImplemented( u clsu Cu B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__; s
u Hashable.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __hash__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Hashable3 s u metaclassc B s> | Ee Z d Z f Z e d d Z e d d Z d S( u Iterablec c s d S( N( ( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__J s u Iterable.__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( u __iter__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu R s u, Iterable.__subclasshook__..T( u Iterableu anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__O s u Iterable.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __iter__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu IterableF s c B sJ | Ee Z d Z f Z e d d Z d d Z e d d Z d S( u Iteratorc C s
t d S( uK Return the next item from the iterator. When exhausted, raise StopIterationN( u
StopIteration( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __next__[ s u Iterator.__next__c C s | S( N( ( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__` s u Iterator.__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( u __next__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu f s u, Iterator.__subclasshook__..c s s | ] } d | j k Vq d S( u __iter__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu g s T( u Iteratoru anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__c s
u Iterator.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __next__u __iter__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu IteratorW s c B s> | Ee Z d Z f Z e d d Z e d d Z d S( u Sizedc C s d S( Ni ( ( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __len__} s u
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( u __len__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u) Sized.__subclasshook__..T( u Sizedu anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__ s u Sized.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __len__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Sizedy s c B s> | Ee Z d Z f Z e d d Z e d d Z d S( u Containerc C s d S( NF( u False( u selfu x( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__ s u Container.__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( u __contains__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u- Container.__subclasshook__..T( u Containeru anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__ s u Container.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __contains__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Container s c B s> | Ee Z d Z f Z e d d Z e d d Z d S( u Callablec O s d S( NF( u False( u selfu argsu kwds( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __call__ s u Callable.__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( u __call__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u, Callable.__subclasshook__..T( u Callableu anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__ s u Callable.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __call__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Callable s c B s | Ee Z d Z d Z f Z d d Z d d Z d d Z d d Z d
d Z 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 S( u Setuh 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), all you have to do is redefine __le__ and
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( u
isinstanceu Setu NotImplementedu lenu Falseu True( u selfu otheru elem( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __le__ s
u
Set.__le__c C s8 t | t s t St | t | k o7 | j | S( N( u
isinstanceu Setu NotImplementedu lenu __le__( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __lt__ s u
Set.__lt__c C s t | t s t S| j | S( N( u
isinstanceu Setu NotImplementedu __lt__( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __gt__ s u
Set.__gt__c C s t | t s t S| j | S( N( u
isinstanceu Setu NotImplementedu __le__( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ge__ s u
Set.__ge__c C s8 t | t s t St | t | k o7 | j | S( N( u
isinstanceu Setu NotImplementedu lenu __le__( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __eq__ s u
Set.__eq__c C s | | k S( N( ( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ne__ s u
Set.__ne__c C s
| | S( u 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.
( ( u clsu it( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu _from_iterable s u Set._from_iterablec s3 t | t s t S j f d d | D S( Nc 3 s! | ] } | k r | Vq d S( N( ( u .0u value( u self( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u Set.__and__..( u
isinstanceu Iterableu NotImplementedu _from_iterable( u selfu other( ( u selfu4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __and__ s u Set.__and__c C s% x | D] } | | k r d Sq Wd S( u1 Return True if two sets have a null intersection.FT( u Falseu True( u selfu otheru value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
isdisjoint s
u Set.isdisjointc C s9 t | t s t Sd d | | f D } | j | S( Nc s s" | ] } | D] } | Vq
q d S( N( ( u .0u su e( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u Set.__or__..( u
isinstanceu Iterableu NotImplementedu _from_iterable( u selfu otheru chain( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __or__ s u
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( N( ( u .0u value( u other( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u Set.__sub__..( u
isinstanceu Setu Iterableu NotImplementedu _from_iterable( u selfu other( ( u otheru4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __sub__ s
u Set.__sub__c C sD t | t s4 t | t s" t S| j | } n | | | | BS( N( u
isinstanceu Setu Iterableu NotImplementedu _from_iterable( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __xor__ s
u 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( u+ 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.
i i iMri iM[l 4~2 i
i6i8#i( u sysu maxsizeu lenu hash( u selfu MAXu MASKu nu hu xu hx( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu _hash s
u Set._hashN( u __name__u
__module__u __qualname__u __doc__u __slots__u __le__u __lt__u __gt__u __ge__u __eq__u __ne__u classmethodu _from_iterableu __and__u
isdisjointu __or__u __sub__u __xor__u _hash( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Set s
c B s | Ee 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( u
MutableSetu 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( u Add an element.N( u NotImplementedError( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu add6 s u MutableSet.addc C s
t d S( u8 Remove an element. Do not raise an exception if absent.N( u NotImplementedError( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu discard; s u MutableSet.discardc C s, | | k r t | n | j | d S( u5 Remove an element. If not a member, raise a KeyError.N( u KeyErroru discard( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu remove@ s u MutableSet.removec C sH t | } y t | } Wn t k
r6 t Yn X| j | | S( u2 Return the popped value. Raise KeyError if empty.( u iteru nextu
StopIterationu KeyErroru discard( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu popF s
u MutableSet.popc C s- y x
| j q Wn t k
r( Yn Xd S( u6 This is slow (creates N new iterators!) but effective.N( u popu KeyError( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu clearP s
u MutableSet.clearc C s" x | D] } | j | q W| S( N( u add( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ior__X s
u MutableSet.__ior__c C s& x | | D] } | j | q W| S( N( u discard( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iand__] s u MutableSet.__iand__c C sx | | k r | j n[ t | t s: | j | } n x7 | D]/ } | | k rc | j | qA | j | qA W| S( N( u clearu
isinstanceu Setu _from_iterableu discardu add( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ixor__b s
u MutableSet.__ixor__c C s; | | k r | j n x | D] } | j | q W| S( N( u clearu discard( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __isub__o s
u MutableSet.__isub__N( u __name__u
__module__u __qualname__u __doc__u __slots__u abstractmethodu addu discardu removeu popu clearu __ior__u __iand__u __ixor__u __isub__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
MutableSet( s
c B s | Ee 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 d Z
d S( u Mappingc C s
t d S( N( u KeyError( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __getitem__ s u Mapping.__getitem__c C s) y | | SWn t k
r$ | SYn Xd S( u< D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.N( u KeyError( u selfu keyu default( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu get s
u Mapping.getc C s- y | | Wn t k
r$ d SYn Xd Sd S( NFT( u KeyErroru Falseu True( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__ s
u Mapping.__contains__c C s
t | S( u: D.keys() -> a set-like object providing a view on D's keys( u KeysView( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu keys s u Mapping.keysc C s
t | S( u< D.items() -> a set-like object providing a view on D's items( u ItemsView( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu items s u
Mapping.itemsc C s
t | S( u6 D.values() -> an object providing a view on D's values( u
ValuesView( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu values s u Mapping.valuesc C s5 t | t s t St | j t | j k S( N( u
isinstanceu Mappingu NotImplementedu dictu items( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __eq__ s u Mapping.__eq__c C s | | k S( N( ( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ne__ s u Mapping.__ne__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __getitem__u Noneu getu __contains__u keysu itemsu valuesu __eq__u __ne__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Mapping} s
c B s8 | Ee Z d Z d d Z d d Z d d Z d S( u MappingViewc C s
| | _ d S( N( u _mapping( u selfu mapping( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __init__ s u MappingView.__init__c C s
t | j S( N( u lenu _mapping( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __len__ s u MappingView.__len__c C s
d j | S( Nu& {0.__class__.__name__}({0._mapping!r})( u format( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __repr__ s u MappingView.__repr__N( u __name__u
__module__u __qualname__u __init__u __len__u __repr__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu MappingView s c B s> | Ee Z d Z e d d Z d d Z d d Z d S( u KeysViewc C s
t | S( N( u set( u selfu it( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu _from_iterable s u KeysView._from_iterablec C s
| | j k S( N( u _mapping( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__ s u KeysView.__contains__c c s x | j D] } | Vq
Wd S( N( u _mapping( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__ s u KeysView.__iter__N( u __name__u
__module__u __qualname__u classmethodu _from_iterableu __contains__u __iter__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu KeysView s c B s> | Ee Z d Z e d d Z d d Z d d Z d S( u ItemsViewc C s
t | S( N( u set( u selfu it( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu _from_iterable s u ItemsView._from_iterablec C sD | \ } } y | j | } Wn t k
r5 d SYn X| | k Sd S( NF( u _mappingu KeyErroru False( u selfu itemu keyu valueu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__ s
u ItemsView.__contains__c c s* x# | j D] } | | j | f Vq
Wd S( N( u _mapping( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__ s u ItemsView.__iter__N( u __name__u
__module__u __qualname__u classmethodu _from_iterableu __contains__u __iter__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu ItemsView s c B s, | Ee Z d Z d d Z d d Z d S( u
ValuesViewc C s/ x( | j D] } | | j | k r
d Sq
Wd S( NTF( u _mappingu Trueu False( u selfu valueu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__ s u ValuesView.__contains__c c s$ x | j D] } | j | Vq
Wd S( N( u _mapping( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__ s u ValuesView.__iter__N( u __name__u
__module__u __qualname__u __contains__u __iter__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
ValuesView s c B s | Ee 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( u MutableMappingc C s
t d S( N( u KeyError( u selfu keyu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __setitem__ s u MutableMapping.__setitem__c C s
t d S( N( u KeyError( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __delitem__ s u MutableMapping.__delitem__c C sK y | | } Wn+ t k
r; | | j k r3 n | SYn X| | =| Sd S( u 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( u KeyErroru _MutableMapping__marker( u selfu keyu defaultu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu pop s
u MutableMapping.popc C sL y t t | } Wn t k
r0 t Yn X| | } | | =| | f S( u D.popitem() -> (k, v), remove and return some (key, value) pair
as a 2-tuple; but raise KeyError if D is empty.
( u nextu iteru
StopIterationu KeyError( u selfu keyu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu popitem s
u MutableMapping.popitemc C s- y x
| j q Wn t k
r( Yn Xd S( u, D.clear() -> None. Remove all items from D.N( u popitemu KeyError( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu clear% s
u MutableMapping.clearc O s% t | d k r0 t d j t | n | sE t d n | d } t | d k rk | d n f } 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
i u8 update() takes at most 2 positional arguments ({} given)u, update() takes at least 1 argument (0 given)i i u keysN( u lenu TypeErroru formatu
isinstanceu Mappingu hasattru keysu items( u argsu kwdsu selfu otheru keyu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu update- s"
"
u MutableMapping.updatec C s/ y | | SWn t k
r* | | | D.get(k,d), also set D[k]=d if k not in D( u KeyError( u selfu keyu default( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
setdefaultG s
u MutableMapping.setdefaultN( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __setitem__u __delitem__u objectu _MutableMapping__markeru popu popitemu clearu updateu Noneu
setdefault( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu MutableMapping s c B sn | Ee 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( u Sequenceu All the operations on a read-only sequence.
Concrete subclasses must override __new__ or __init__,
__getitem__, and __len__.
c C s
t d S( N( u
IndexError( u selfu index( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __getitem___ s u Sequence.__getitem__c c sF d } y# x | | } | V| d 7} q Wn t k
rA d SYn Xd S( Ni i ( u
IndexError( u selfu iu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__c s
u Sequence.__iter__c C s% x | D] } | | k r d Sq Wd S( NTF( u Trueu False( u selfu valueu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__m s
u Sequence.__contains__c c s0 x) t t t | D] } | | Vq Wd S( N( u reversedu rangeu len( u selfu i( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __reversed__s s u Sequence.__reversed__c C s7 x* t | D] \ } } | | k r
| Sq
Wt d S( u| S.index(value) -> integer -- return first index of value.
Raises ValueError if the value is not present.
N( u enumerateu
ValueError( u selfu valueu iu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu indexw s u Sequence.indexc s t f d d | D S( uB S.count(value) -> integer -- return number of occurrences of valuec 3 s! | ] } | k r d Vq d S( i N( ( u .0u v( u value( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s u! Sequence.count..( u sum( u selfu value( ( u valueu4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu count s u Sequence.countN( u __name__u
__module__u __qualname__u __doc__u __slots__u abstractmethodu __getitem__u __iter__u __contains__u __reversed__u indexu count( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu SequenceU s
c B s | Ee Z d Z d Z f Z d S( u
ByteStringuM This unifies bytes and bytearray.
XXX Should add all their methods.
N( u __name__u
__module__u __qualname__u __doc__u __slots__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
ByteString s c B s | Ee 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( u MutableSequencec C s
t d S( N( u
IndexError( u selfu indexu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __setitem__ s u MutableSequence.__setitem__c C s
t d S( N( u
IndexError( u selfu index( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __delitem__ s u MutableSequence.__delitem__c C s
t d S( u3 S.insert(index, value) -- insert value before indexN( u
IndexError( u selfu indexu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu insert s u MutableSequence.insertc C s | j t | | d S( u: S.append(value) -- append value to the end of the sequenceN( u insertu len( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu append s u MutableSequence.appendc C s- y x
| j q Wn t k
r( Yn Xd S( u, S.clear() -> None -- remove all items from SN( u popu
IndexError( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu clear s
u MutableSequence.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.
( ( u selfu indexu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu pop s
u MutableSequence.popc C s | | j | =d S( uv S.remove(value) -- remove first occurrence of value.
Raise ValueError if the value is not present.
N( u index( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu remove s u MutableSequence.removec C s | j | | S( N( u extend( u selfu values( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iadd__ s
u MutableSequence.__iadd__Ni( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __setitem__u __delitem__u insertu appendu clearu reverseu extendu popu removeu __iadd__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu MutableSequence s (9 u __doc__u abcu ABCMetau abstractmethodu sysu __all__u typeu iteru bytes_iteratoru bytearrayu bytearray_iteratoru keysu dict_keyiteratoru valuesu dict_valueiteratoru itemsu dict_itemiteratoru
list_iteratoru reversedu list_reverseiteratoru rangeu range_iteratoru setu set_iteratoru str_iteratoru tuple_iteratoru zipu zip_iteratoru dict_keysu dict_valuesu
dict_itemsu __dict__u mappingproxyu Hashableu Iterableu Iteratoru registeru Sizedu Containeru Callableu Setu frozensetu
MutableSetu Mappingu MappingViewu KeysViewu ItemsViewu
ValuesViewu MutableMappingu dictu Sequenceu tupleu stru
ByteStringu bytesu MutableSequenceu list( ( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu s
y
O
3
[
/
A
PK !
/ __main__.pynu [ ################################################################################
### Simple tests
################################################################################
# verify that instances can be pickled
from collections import namedtuple
from pickle import loads, dumps
Point = namedtuple('Point', 'x, y', True)
p = Point(x=10, y=20)
assert p == loads(dumps(p))
# test and demonstrate ability to override methods
class Point(namedtuple('Point', 'x y')):
__slots__ = ()
@property
def hypot(self):
return (self.x ** 2 + self.y ** 2) ** 0.5
def __str__(self):
return 'Point: x=%6.3f y=%6.3f hypot=%6.3f' % (self.x, self.y, self.hypot)
for p in Point(3, 4), Point(14, 5/7.):
print (p)
class Point(namedtuple('Point', 'x y')):
'Point class with optimized _make() and _replace() without error-checking'
__slots__ = ()
_make = classmethod(tuple.__new__)
def _replace(self, _map=map, **kwds):
return self._make(_map(kwds.get, ('x', 'y'), self))
print(Point(11, 22)._replace(x=100))
Point3D = namedtuple('Point3D', Point._fields + ('z',))
print(Point3D.__doc__)
import doctest, collections
TestResults = namedtuple('TestResults', 'failed attempted')
print(TestResults(*doctest.testmod(collections)))
PK ! M铎 # __pycache__/__init__.cpython-36.pycnu [ 3
f $ @ s d Z ddddddddd g Zd
d lT d
d lZeej7 Zd
d
lmZmZ d
dlm Z
d
d l Z d
d l
Zd
dlmZ d
dlmZmZmZ d
dlmZ yd
dl m Z W n e k
r Y n X e j e yd
dl m!Z! W n e k
r Y nX G dd de"Z#G dd de$Z%G dd de&Z'G dd de(Z)G d d de*Z+yd
d l m+Z+ W n e k
rX Y nX d Z,d Z-d Z.d!d!d d"d#dZ/d$d% Z0yd
d&l m0Z0 W n e k
r Y nX G d'd de*Z1G d(d d e2Z3G d)d de2Z4G d*d de Z5G d+d de6Z7d S ),a? This module implements specialized container datatypes providing
alternatives to Python's general purpose built-in containers, dict,
list, set, and tuple.
* namedtuple factory function for creating tuple subclasses with named fields
* deque list-like container with fast appends and pops on either end
* ChainMap dict-like class for creating a single view of multiple mappings
* Counter dict subclass for counting hashable objects
* OrderedDict dict subclass that remembers the order entries were added
* defaultdict dict subclass that calls a factory function to supply missing values
* UserDict wrapper around dictionary objects for easier dict subclassing
* UserList wrapper around list objects for easier list subclassing
* UserString wrapper around string objects for easier string subclassing
deque defaultdict
namedtupleUserDictUserList
UserStringCounter OrderedDictChainMap )*N)
itemgettereq) iskeyword)proxy)repeatchainstarmap)recursive_repr)r )r c @ s e Zd Zdd ZdS )_OrderedDictKeysViewc c s t | jE d H d S )N)reversed_mapping)self r 9/opt/alt/python36/lib64/python3.6/collections/__init__.py __reversed__5 s z!_OrderedDictKeysView.__reversed__N)__name__
__module__ __qualname__r r r r r r 3 s r c @ s e Zd Zdd ZdS )_OrderedDictItemsViewc c s( x"t | jD ]}|| j| fV q W d S )N)r r )r keyr r r r : s z"_OrderedDictItemsView.__reversed__N)r r r r r r r r r 8 s r c @ s e Zd Zdd ZdS )_OrderedDictValuesViewc c s$ x t | jD ]}| j| V q W d S )N)r r )r r r r r r @ s z#_OrderedDictValuesView.__reversed__N)r r r r r r r r r > s r c @ s e Zd ZdZdS )_Linkprevnextr __weakref__N)r" r# r r$ )r r r __slots__r r r r r! D s r! c @ s e Zd ZdZdd ZejeefddZej fddZ dd Z
d
d Z d d
Z d*ddZ
d+ddZdd Zej ZZdd Zdd Zdd ZejZe Zefdd Zd,d d Ze d d! Z d"d# Z d$d% Z e d-d&d'Z d(d) Z!d S ).r z)Dictionary that remembers insertion orderc O s | s t d| ^}} t| dkr0t dt| y
|j W n> tk
rx t |_t|j |_}| |_|_i |_ Y nX |j
| | dS )zInitialize an ordered dictionary. The signature is the same as
regular dictionaries. Keyword argument order is preserved.
z?descriptor '__init__' of 'OrderedDict' object needs an argument z$expected at most 1 arguments, got %dN) TypeErrorlen_OrderedDict__rootAttributeErrorr! _OrderedDict__hardroot_proxyr" r# _OrderedDict__map_OrderedDict__update)argskwdsr rootr r r __init__V s
zOrderedDict.__init__c C sZ || krJ| | j |< }| j}|j}||| |_|_|_||_|||_|| || dS )z!od.__setitem__(i, y) <==> od[i]=yN)r- r) r" r# r ) r r valueZ dict_setitemr ZLinklinkr1 lastr r r __setitem__i s
zOrderedDict.__setitem__c C s> || | | j j|}|j}|j}||_||_d|_d|_dS )z od.__delitem__(y) <==> del od[y]N)r- popr" r# )r r Z dict_delitemr4 link_prev link_nextr r r __delitem__w s
zOrderedDict.__delitem__c c s, | j }|j}x||k r&|jV |j}qW dS )zod.__iter__() <==> iter(od)N)r) r# r )r r1 currr r r __iter__ s
zOrderedDict.__iter__c c s, | j }|j}x||k r&|jV |j}qW dS )z#od.__reversed__() <==> reversed(od)N)r) r" r )r r1 r; r r r r s
zOrderedDict.__reversed__c C s* | j }| |_|_| jj tj| dS )z.od.clear() -> None. Remove all items from od.N)r) r" r# r- cleardict)r r1 r r r r= s
zOrderedDict.clearTc C sj | s t d| j}|r0|j}|j}||_||_n|j}|j}||_||_|j}| j|= tj| |}||fS )zRemove and return a (key, value) pair from the dictionary.
Pairs are returned in LIFO order if last is true or FIFO order if false.
zdictionary is empty)KeyErrorr) r" r# r r- r> r7 )r r5 r1 r4 r8 r9 r r3 r r r popitem s zOrderedDict.popitemc C st | j | }|j}|j}|j}||_||_| j}|rR|j}||_||_||_||_n |j}||_||_||_||_dS )zMove an existing element to the end (or beginning if last==False).
Raises KeyError if the element does not exist.
When last=True, acts like a fast version of self[key]=self.pop(key).
N)r- r" r# r) ) r r r5 r4 r8 r9 Z soft_linkr1 firstr r r move_to_end s$
zOrderedDict.move_to_endc C sV t j}t| d }|| j}||| jd 7 }||| j| 7 }||| j| 7 }|S )Nr& )_sys getsizeofr( __dict__r- r+ r) )r Zsizeofnsizer r r
__sizeof__ s
zOrderedDict.__sizeof__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 zOrderedDict.keysc C s t | S )z a set-like object providing a view on D's items)r )r r r r items s zOrderedDict.itemsc C s t | S )z6D.values() -> an object providing a view on D's values)r )r r r r values s zOrderedDict.valuesc C s0 || kr| | }| |= |S || j kr,t||S )zod.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.
)_OrderedDict__markerr? )r r defaultresultr r r r7 s
zOrderedDict.popNc C s || kr| | S || |< |S )zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr )r r rN r r r
setdefault s zOrderedDict.setdefaultc C s* | sd| j jf S d| j jt| j f S )zod.__repr__() <==> repr(od)z%s()z%s(%r)) __class__r listrK )r r r r __repr__ s zOrderedDict.__repr__c C sH t | j }x t t D ]}|j|d qW | jf |p8ddt| j fS )z%Return state information for picklingN)varscopyr r7 rQ iterrK )r Z inst_dictkr r r
__reduce__ s zOrderedDict.__reduce__c C s
| j | S )z!od.copy() -> a shallow copy of od)rQ )r r r r rU
s zOrderedDict.copyc C s | }x|D ] }|||< q W |S )zOD.fromkeys(S[, v]) -> New ordered dictionary with keys from S.
If not specified, the value defaults to None.
r )clsiterabler3 r r r r r fromkeys s
zOrderedDict.fromkeysc C s2 t |tr&tj| |o$ttt| |S tj| |S )zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)
isinstancer r> __eq__allmap_eq)r otherr r r r] s
zOrderedDict.__eq__)T)T)N)N)"r r r __doc__r2 r> r6 r, r! r: r< r r= r@ rB rI MutableMappingupdater. rJ rK rL __ne__objectrM r7 rP _recursive_reprrS rX rU classmethodr[ r] r r r r r G s0
)r a from builtins import property as _property, tuple as _tuple
from operator import itemgetter as _itemgetter
from collections import OrderedDict
class {typename}(tuple):
'{typename}({arg_list})'
__slots__ = ()
_fields = {field_names!r}
def __new__(_cls, {arg_list}):
'Create new instance of {typename}({arg_list})'
return _tuple.__new__(_cls, ({arg_list}))
@classmethod
def _make(cls, iterable, new=tuple.__new__, len=len):
'Make a new {typename} object from a sequence or iterable'
result = new(cls, iterable)
if len(result) != {num_fields:d}:
raise TypeError('Expected {num_fields:d} arguments, got %d' % len(result))
return result
def _replace(_self, **kwds):
'Return a new {typename} object replacing specified fields with new values'
result = _self._make(map(kwds.pop, {field_names!r}, _self))
if kwds:
raise ValueError('Got unexpected field names: %r' % list(kwds))
return result
def __repr__(self):
'Return a nicely formatted representation string'
return self.__class__.__name__ + '({repr_fmt})' % self
def _asdict(self):
'Return a new OrderedDict which maps field names to their values.'
return OrderedDict(zip(self._fields, self))
def __getnewargs__(self):
'Return self as a plain tuple. Used by copy and pickle.'
return tuple(self)
{field_defs}
z {name}=%rzW {name} = _property(_itemgetter({index:d}), doc='Alias for field number {index:d}')
F)verboserenamemodulec C s t |tr|jddj }ttt|}t| } |rt }xNt|D ]B\}}|j spt |sp|j
dsp||kr|d| ||< |j | qDW xN| g| D ]@}t |tk rt
d|j std| t |rtd| qW t }xJ|D ]B}|j
do| rtd| ||kr td | |j | qW tj| t|t|tt|jd
d d d d
jdd |D djdd t|D d}td| d} t|| | | }
||
_|rt|
j |dkrytjd jj dd}W n t tfk
r Y nX |dk r
||
_ |
S )aC Returns a new subclass of tuple with named fields.
>>> Point = namedtuple('Point', ['x', 'y'])
>>> Point.__doc__ # docstring for the new class
'Point(x, y)'
>>> p = Point(11, y=22) # instantiate with positional args or keywords
>>> p[0] + p[1] # indexable like a plain tuple
33
>>> x, y = p # unpack like a regular tuple
>>> x, y
(11, 22)
>>> p.x + p.y # fields also accessible by name
33
>>> d = p._asdict() # convert to a dictionary
>>> d['x']
11
>>> Point(**d) # convert from a dictionary
Point(x=11, y=22)
>>> p._replace(x=100) # _replace() is like str.replace() but targets named fields
Point(x=100, y=22)
, _z_%dz*Type names and field names must be stringsz8Type names and field names must be valid identifiers: %rz2Type names and field names cannot be a keyword: %rz/Field names cannot start with an underscore: %rz$Encountered duplicate field name: %r' r& z, c s s | ]}t j|d V qdS ))nameN)_repr_templateformat).0rq r r r s z namedtuple..
c s s | ]\}}t j||d V qdS ))indexrq N)_field_templaters )rt rw rq r r r ru s )typename field_names
num_fieldsarg_listrepr_fmt
field_defsz
namedtuple_%s)r Nr __main__) r\ strreplacesplitrR r_ set enumerate isidentifier
_iskeyword
startswithaddtyper'
ValueError_class_templaters tupler( reprjoinr> exec_sourceprintrD _getframe f_globalsgetr* r ) ry rz ri rj rk seenrw rq class_definition namespacerO r r r r e sj
c C s* | j }x |D ]}||dd | |< q W dS )z!Tally elements from the iterable.r
r& N)r )mappingrZ Z mapping_getelemr r r _count_elements s
r )r c s e Zd ZdZ fddZdd Zd/ddZd d
Zed0d d Z fd
dZ
dd Z dd Z dd Z
fddZdd Zdd Zdd Zd d Zd d Zd!d" Zd#d$ Zd%d& Zd'd( Zd)d* Zd+d, Zd-d. Z ZS )1r a Dict subclass for counting hashable items. Sometimes called a bag
or multiset. Elements are stored as dictionary keys and their counts
are stored as dictionary values.
>>> c = Counter('abcdeabcdabcaba') # count elements from a string
>>> c.most_common(3) # three most common elements
[('a', 5), ('b', 4), ('c', 3)]
>>> sorted(c) # list all unique elements
['a', 'b', 'c', 'd', 'e']
>>> ''.join(sorted(c.elements())) # list elements with repetitions
'aaaaabbbbcccdde'
>>> sum(c.values()) # total of all counts
15
>>> c['a'] # count of letter 'a'
5
>>> for elem in 'shazam': # update counts from an iterable
... c[elem] += 1 # by adding 1 to each element's count
>>> c['a'] # now there are seven 'a'
7
>>> del c['b'] # remove all 'b'
>>> c['b'] # now there are zero 'b'
0
>>> d = Counter('simsalabim') # make another counter
>>> c.update(d) # add in the second counter
>>> c['a'] # now there are nine 'a'
9
>>> c.clear() # empty the counter
>>> c
Counter()
Note: If a count is set to zero or reduced to zero, it will remain
in the counter until the entry is deleted or the counter is cleared:
>>> c = Counter('aaabbc')
>>> c['b'] -= 2 # reduce the count of 'b' by two
>>> c.most_common() # 'b' is still in, but its count is zero
[('a', 3), ('c', 1), ('b', 0)]
c sN | s t d| ^}} t| dkr0t dt| tt|j |j| | dS )a Create a new, empty Counter object. And if given, count elements
from an input iterable. Or, initialize the count from another mapping
of elements to their counts.
>>> c = Counter() # a new, empty counter
>>> c = Counter('gallahad') # a new counter from an iterable
>>> c = Counter({'a': 4, 'b': 2}) # a new counter from a mapping
>>> c = Counter(a=4, b=2) # a new counter from keyword args
z;descriptor '__init__' of 'Counter' object needs an argumentr& z$expected at most 1 arguments, got %dN)r' r( superr r2 rd )r/ r0 r )rQ r r r2 s zCounter.__init__c C s dS )z1The count of elements not in the Counter is zero.r
r )r r r r r __missing__ s zCounter.__missing__Nc C s6 |dkr t | j tdddS tj|| j tddS )zList the n most common elements and their counts from the most
common to the least. If n is None, then list all element counts.
>>> Counter('abcdeabcdabcaba').most_common(3)
[('a', 5), ('b', 4), ('c', 3)]
Nr& T)r reverse)r )sortedrK _itemgetter_heapqnlargest)r rG r r r most_common s zCounter.most_commonc C s t jtt| j S )a Iterator over elements repeating each as many times as its count.
>>> c = Counter('ABCABC')
>>> sorted(c.elements())
['A', 'A', 'B', 'B', 'C', 'C']
# Knuth's example for prime factors of 1836: 2**2 * 3**3 * 17**1
>>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
>>> product = 1
>>> for factor in prime_factors.elements(): # loop over factors
... product *= factor # and multiply them
>>> product
1836
Note, if an element's count has been set to zero or is a negative
number, elements() will ignore it.
)_chain
from_iterable_starmap_repeatrK )r r r r elements+ s zCounter.elementsc C s t dd S )Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)rY rZ vr r r r[ C s zCounter.fromkeysc s | s t d| ^}} t| dkr0t dt| | r<| d nd}|dk rt|tr|r|j}x8|j D ]\}}|||d ||< qfW qtt|j| n
t || |r|j| dS )a Like dict.update() but add counts instead of replacing them.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.update('witch') # add elements from another iterable
>>> d = Counter('watch')
>>> c.update(d) # add elements from another counter
>>> c['h'] # four 'h' in which, witch, and watch
4
z9descriptor 'update' of 'Counter' object needs an argumentr& z$expected at most 1 arguments, got %dr
N)
r' r( r\ Mappingr rK r r rd r )r/ r0 r rZ self_getr count)rQ r r rd J s
zCounter.updatec O s | s t d| ^}} t| dkr0t dt| | r<| d nd}|dk r|j}t|trxH|j D ]\}}||d| ||< qbW n x |D ]}||dd ||< qW |r|j| dS )a Like dict.update() but subtracts counts instead of replacing them.
Counts can be reduced below zero. Both the inputs and outputs are
allowed to contain zero and negative counts.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.subtract('witch') # subtract elements from another iterable
>>> c.subtract(Counter('watch')) # subtract elements from another counter
>>> c['h'] # 2 in which, minus 1 in witch, minus 1 in watch
0
>>> c['w'] # 1 in which, minus 1 in witch, minus 1 in watch
-1
z;descriptor 'subtract' of 'Counter' object needs an argumentr& z$expected at most 1 arguments, got %dr
N)r' r( r r\ r rK subtract)r/ r0 r rZ r r r r r r r r s
zCounter.subtractc C s
| j | S )zReturn a shallow copy.)rQ )r r r r rU s z Counter.copyc C s | j t| ffS )N)rQ r> )r r r r rX s zCounter.__reduce__c s || krt j| dS )zGLike dict.__delitem__() but does not raise KeyError for missing values.N)r r: )r r )rQ r r r: s zCounter.__delitem__c C s` | sd| j j S y&djtdj| j }d| j j|f S tk
rZ dj| j jt| S X d S )Nz%s()z, z%r: %rz%s({%s})z
{0}({1!r})) rQ r r r_ __mod__r r' rs r> )r rK r r r rS s zCounter.__repr__c C sx t |tstS t }x0| j D ]$\}}||| }|dkr |||< q W x,|j D ] \}}|| krP|dkrP|||< qPW |S )zAdd counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
r
)r\ r NotImplementedrK )r ra rO r r newcountr r r __add__ s
zCounter.__add__c C s| t |tstS t }x0| j D ]$\}}||| }|dkr |||< q W x0|j D ]$\}}|| krP|dk rPd| ||< qPW |S )z Subtract count, but keep only results with positive counts.
>>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
r
)r\ r r rK )r ra rO r r r r r r __sub__ s
zCounter.__sub__c C s t |tstS t }x<| j D ]0\}}|| }||k r:|n|}|dkr |||< q W x,|j D ] \}}|| kr\|dkr\|||< q\W |S )zUnion is the maximum of value in either of the input counters.
>>> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
r
)r\ r r rK )r ra rO r r other_countr r r r __or__ s
zCounter.__or__c C sV t |tstS t }x<| j D ]0\}}|| }||k r:|n|}|dkr |||< q W |S )z Intersection is the minimum of corresponding counts.
>>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
r
)r\ r r rK )r ra rO r r r r r r r __and__ s
zCounter.__and__c C s0 t }x$| j D ]\}}|dkr|||< qW |S )zEAdds an empty counter, effectively stripping negative and zero countsr
)r rK )r rO r r r r r __pos__ s
zCounter.__pos__c C s4 t }x(| j D ] \}}|dk rd| ||< qW |S )z{Subtracts from an empty counter. Strips positive and zero counts,
and flips the sign on negative counts.
r
)r rK )r rO r r r r r __neg__ s
zCounter.__neg__c C s* dd | j D }x|D ]
}| |= qW | S )z?Internal method to strip elements with a negative or zero countc S s g | ]\}}|d ks|qS )r
r )rt r r r r r
s z*Counter._keep_positive..)rK )r nonpositiver r r r _keep_positive s
zCounter._keep_positivec C s. x$|j D ]\}}| | |7 < q
W | j S )zInplace add from another counter, keeping only positive counts.
>>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
)rK r )r ra r r r r r __iadd__ s zCounter.__iadd__c C s. x$|j D ]\}}| | |8 < q
W | j S )zInplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
)rK r )r ra r r r r r __isub__% s zCounter.__isub__c C s6 x,|j D ] \}}| | }||kr
|| |< q
W | j S )zInplace union is the maximum of value from either counter.
>>> c = Counter('abbb')
>>> c |= Counter('bcc')
>>> c
Counter({'b': 3, 'c': 2, 'a': 1})
)rK r )r ra r r r r r r __ior__2 s
zCounter.__ior__c C s6 x,| j D ] \}}|| }||k r
|| |< q
W | j S )zInplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
)rK r )r ra r r r r r r __iand__A s
zCounter.__iand__)N)N) r r r rb r2 r r r rh r[ rd r rU rX r: rS r r r r r r r r r r r
__classcell__r r )rQ r r s0 +
("
c @ s e Zd ZdZdd Zdd Zdd Zd'd d
Zd d Zd
d Z dd Z
dd Z e dd Z
edd Zdd ZeZd(ddZedd Zd d Zd d Zd!d" Zd#d$ Zd%d& ZdS ))r a A ChainMap groups multiple dicts (or other mappings) together
to create a single, updateable view.
The underlying mappings are stored in a list. That list is public and can
be accessed or updated using the *maps* attribute. There is no other
state.
Lookups search the underlying mappings successively until a key is found.
In contrast, writes, updates, and deletions only operate on the first
mapping.
c G s t |p i g| _dS )zInitialize a ChainMap by setting *maps* to the given mappings.
If no mappings are provided, a single empty dictionary is used.
N)rR maps)r r r r r r2 c s zChainMap.__init__c C s t |d S )N)r? )r r r r r r j s zChainMap.__missing__c C s8 x,| j D ]"}y|| S tk
r( Y qX qW | j|S )N)r r? r )r r r r r r __getitem__m s
zChainMap.__getitem__Nc C s || kr| | S |S )Nr )r r rN r r r r u s z ChainMap.getc C s t t j| j S )N)r( r unionr )r r r r __len__x s zChainMap.__len__c C s t t j| j S )N)rV r r r )r r r r r< { s zChainMap.__iter__c s t fdd| jD S )Nc 3 s | ]} |kV qd S )Nr )rt m)r r r ru s z(ChainMap.__contains__..)anyr )r r r )r r __contains__~ s zChainMap.__contains__c C s
t | jS )N)r r )r r r r __bool__ s zChainMap.__bool__c C s dj | djtt| jS )Nz{0.__class__.__name__}({1})z, )rs r r_ r r )r r r r rS s zChainMap.__repr__c G s | t j|f| S )z?Create a ChainMap with a single dict created from the iterable.)r> r[ )rY rZ r/ r r r r[ s zChainMap.fromkeysc C s$ | j | jd j f| jdd S )zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r
r& N)rQ r rU )r r r r rU s z
ChainMap.copyc C s |dkr i }| j |f| j S )zyNew ChainMap with a new map followed by all previous maps.
If no map is provided, an empty dict is used.
N)rQ r )r r r r r new_child s zChainMap.new_childc C s | j | jdd S )zNew ChainMap from maps[1:].r& N)rQ r )r r r r parents s zChainMap.parentsc C s || j d |< d S )Nr
)r )r r r3 r r r r6 s zChainMap.__setitem__c C s8 y| j d |= W n" tk
r2 tdj|Y nX d S )Nr
z(Key not found in the first mapping: {!r})r r? rs )r r r r r r: s zChainMap.__delitem__c C s0 y| j d j S tk
r* tdY nX dS )zPRemove and return an item pair from maps[0]. Raise KeyError is maps[0] is empty.r
z#No keys found in the first mapping.N)r r@ r? )r r r r r@ s zChainMap.popitemc G s> y| j d j|f| S tk
r8 tdj|Y nX dS )zWRemove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].r
z(Key not found in the first mapping: {!r}N)r r7 r? rs )r r r/ r r r r7 s z ChainMap.popc C s | j d j dS )z'Clear maps[0], leaving maps[1:] intact.r
N)r r= )r r r r r= s zChainMap.clear)N)N)r r r rb r2 r r r r r< r r rg rS rh r[ rU __copy__r propertyr r6 r: r@ r7 r= r r r r r U s(
c @ sb e Zd Zdd Zdd Zdd Zdd Zd d
Zd d Zd
d Z dd Z
dd Z e dddZ
dS )r c O s | s t d| ^}} t| dkr0t dt| | r>| d }n0d|krj|jd}dd l}|jdtdd nd }i |_|d k r|j| t|r|j| d S ) Nz z0Passing 'dict' as keyword argument is deprecatedrC )
stacklevel)r' r( r7 warningswarnDeprecationWarningdatard )r/ kwargsr r> r r r r r2 s$
zUserDict.__init__c C s
t | jS )N)r( r )r r r r r s zUserDict.__len__c C s: || j kr| j | S t| jdr.| jj| |S t|d S )Nr )r hasattrrQ r r? )r r r r r r s
zUserDict.__getitem__c C s || j |< d S )N)r )r r itemr r r r6 s zUserDict.__setitem__c C s | j |= d S )N)r )r r r r r r: s zUserDict.__delitem__c C s
t | jS )N)rV r )r r r r r< s zUserDict.__iter__c C s
|| j kS )N)r )r r r r r r s zUserDict.__contains__c C s
t | jS )N)r r )r r r r rS s zUserDict.__repr__c C sR | j tkrt| jj S dd l}| j}zi | _|j| }W d || _X |j| |S )Nr
)rQ r r rU rd )r rU r cr r r rU s
z
UserDict.copyNc C s | }x|D ] }|||< q W |S )Nr )rY rZ r3 dr r r r r[ s
zUserDict.fromkeys)N)r r r r2 r r r6 r: r< r rS rU rh r[ r r r r r s c @ s e Zd ZdZd>ddZdd Zdd Zd d
Zd d Zd
d Z dd Z
dd Z dd Z dd Z
dd Zdd Zdd Zd d Zd d Zd!d" Zd#d$ ZeZd%d& Zd'd( Zd)d* Zd@d,d-Zd.d/ Zd0d1 Zd2d3 Z d4d5 Z d6d7 Z d8d9 Z d:d; Z d s zUserList.indexc C s | j j d S )N)r r )r r r r r ? s zUserList.reversec O s | j j|| d S )N)r sort)r r/ r0 r r r r @ s z
UserList.sortc C s* t |tr| jj|j n | jj| d S )N)r\ r r extend)r ra r r r r A s
zUserList.extend)Nr )r )"r r r rb r2 rS r r r] r r r r r r r6 r: r r r r __rmul__r r r r7 r r= rU r rw r r r r r r r r s>
c @ s` e Zd Zdd Zdd Zdd Zdd Zd d
Zd d Zd
d Z dd Z
dd Z dd Z dd Z
dd Zdd Zdd Zd d Zd d Zd!d" Zd#d$ Zd%d& ZeZd'd( Zd)d* Zd+d, Zd-d. Zd/d0 Zd1e j fd2d3Z dd5d6Z d1e j fd7d8Z dd:d;Z!d1e j fdd? Z#d@dA Z$d1e j fdBdCZ%dDdE Z&dFdG Z'dHdI Z(dJdK Z)dLdM Z*dNdO Z+dPdQ Z,dRdS Z-dTdU Z.dVdW Z/dXdY Z0dZd[ Z1d\d] Z2d^d_ Z3dd`daZ4e5j6Z6dbdc Z7ddedfZ8d1e j fdgdhZ9d1e j fdidjZ:dkdl Z;dmdn ZddsdtZ?ddvdwZ@d1e j fdxdyZAddzd{ZBd|d} ZCd~d ZDdd ZEdd ZFdd ZGd4S )r c C s< t |tr|| _n&t |tr.|jd d | _n
t|| _d S )N)r\ r r r )r seqr r r r2 N s
zUserString.__init__c C s
t | jS )N)r r )r r r r __str__U s zUserString.__str__c C s
t | jS )N)r r )r r r r rS V s zUserString.__repr__c C s
t | jS )N)intr )r r r r __int__W s zUserString.__int__c C s
t | jS )N)floatr )r r r r __float__X s zUserString.__float__c C s
t | jS )N)complexr )r r r r __complex__Y s zUserString.__complex__c C s
t | jS )N)hashr )r r r r __hash__Z s zUserString.__hash__c C s | j d d fS )N)r )r r r r __getnewargs__[ s zUserString.__getnewargs__c C s t |tr| j|jkS | j|kS )N)r\ r r )r stringr r r r] ^ s
zUserString.__eq__c C s t |tr| j|jk S | j|k S )N)r\ r r )r r r r r r b s
zUserString.__lt__c C s t |tr| j|jkS | j|kS )N)r\ r r )r r r r r r f s
zUserString.__le__c C s t |tr| j|jkS | j|kS )N)r\ r r )r r r r r r j s
zUserString.__gt__c C s t |tr| j|jkS | j|kS )N)r\ r r )r r r r r r n s
zUserString.__ge__c C s t |tr|j}|| jkS )N)r\ r r )r charr r r r s s
zUserString.__contains__c C s
t | jS )N)r( r )r r r r r x s zUserString.__len__c C s | j | j| S )N)rQ r )r rw r r r r y s zUserString.__getitem__c C sJ t |tr | j| j|j S t |tr6| j| j| S | j| jt| S )N)r\ r rQ r r )r ra r r r r z s
zUserString.__add__c C s. t |tr| j|| j S | jt|| j S )N)r\ r rQ r )r ra r r r r s
zUserString.__radd__c C s | j | j| S )N)rQ r )r rG r r r r s zUserString.__mul__c C s | j | j| S )N)rQ r )r r/ r r r r s zUserString.__mod__c C s | j |t S )N)rQ r/ )r rs r r r __rmod__ s zUserString.__rmod__c C s | j | jj S )N)rQ r
capitalize)r r r r r s zUserString.capitalizec C s | j | jj S )N)rQ r casefold)r r r r r s zUserString.casefoldc G s | j | jj|f| S )N)rQ r center)r widthr/ r r r r s zUserString.centerr
c C s t |tr|j}| jj|||S )N)r\ r r r )r substartendr r r r s
zUserString.countNc C s> |r.|r | j | jj||S | j | jj|S | j | jj S )N)rQ r encode)r encodingerrorsr r r r s
zUserString.encodec C s | j j|||S )N)r endswith)r suffixr r r r r r s zUserString.endswith c C s | j | jj|S )N)rQ r
expandtabs)r tabsizer r r r s zUserString.expandtabsc C s t |tr|j}| jj|||S )N)r\ r r find)r r r r r r r r s
zUserString.findc O s | j j||S )N)r rs )r r/ r0 r r r rs s zUserString.formatc C s | j j|S )N)r
format_map)r r r r r r s zUserString.format_mapc C s | j j|||S )N)r rw )r r r r r r r rw s zUserString.indexc C s
| j j S )N)r isalpha)r r r r r s zUserString.isalphac C s
| j j S )N)r isalnum)r r r r r s zUserString.isalnumc C s
| j j S )N)r isdecimal)r r r r r s zUserString.isdecimalc C s
| j j S )N)r isdigit)r r r r r
s zUserString.isdigitc C s
| j j S )N)r r )r r r r r s zUserString.isidentifierc C s
| j j S )N)r islower)r r r r r s zUserString.islowerc C s
| j j S )N)r isnumeric)r r r r r s zUserString.isnumericc C s
| j j S )N)r isprintable)r r r r r
s zUserString.isprintablec C s
| j j S )N)r isspace)r r r r r s zUserString.isspacec C s
| j j S )N)r istitle)r r r r r s zUserString.istitlec C s
| j j S )N)r isupper)r r r r r s zUserString.isupperc C s | j j|S )N)r r )r r r r r r s zUserString.joinc G s | j | jj|f| S )N)rQ r ljust)r r r/ r r r r s zUserString.ljustc C s | j | jj S )N)rQ r lower)r r r r r s zUserString.lowerc C s | j | jj|S )N)rQ r lstrip)r charsr r r r s zUserString.lstripc C s | j j|S )N)r partition)r sepr r r r s zUserString.partitionr& c C s6 t |tr|j}t |tr |j}| j| jj|||S )N)r\ r r rQ r )r oldnewmaxsplitr r r r s
zUserString.replacec C s t |tr|j}| jj|||S )N)r\ r r rfind)r r r r r r r r s
zUserString.rfindc C s | j j|||S )N)r rindex)r r r r r r r r s zUserString.rindexc G s | j | jj|f| S )N)rQ r rjust)r r r/ r r r r s zUserString.rjustc C s | j j|S )N)r
rpartition)r r r r r r s zUserString.rpartitionc C s | j | jj|S )N)rQ r rstrip)r r r r r r s zUserString.rstripc C s | j j||S )N)r r )r r r r r r r s zUserString.splitc C s | j j||S )N)r rsplit)r r r r r r r s zUserString.rsplitFc C s | j j|S )N)r
splitlines)r keependsr r r r s zUserString.splitlinesc C s | j j|||S )N)r r )r prefixr r r r r r s zUserString.startswithc C s | j | jj|S )N)rQ r strip)r r r r r r# s zUserString.stripc C s | j | jj S )N)rQ r swapcase)r r r r r$ s zUserString.swapcasec C s | j | jj S )N)rQ r title)r r r r r% s zUserString.titlec G s | j | jj| S )N)rQ r translate)r r/ r r r r& s zUserString.translatec C s | j | jj S )N)rQ r upper)r r r r r' s zUserString.upperc C s | j | jj|S )N)rQ r zfill)r r r r r r( s zUserString.zfill)NN)r )Nr )r )Nr )Nr r )Nr )F)N)Hr r r r2 r rS r r r r r r] r r r r r r r r r r r r r r r r rD maxsizer r r r r rs r rw r r r r
r r r r
r r r r r r r r maketransr r r r r r r r r r r r# r$ r% r& r' r( r r r r r M s
)8rb __all___collections_abcoperatorr r r
r` keywordr r sysrD heapqr _weakrefr r, itertoolsr r r r r r reprlibr rg _collectionsr ImportErrorMutableSequenceregisterr KeysViewr ItemsViewr
ValuesViewr rf r! r> r r rr rx r r r rc r r r Sequencer r r r r s`
`3b lCIPK ! ; $ __pycache__/abc.cpython-36.opt-1.pycnu [ 3
fD @ s d dl T d dl mZ dS ) )*)__all__N)_collections_abcr r r 4/opt/alt/python36/lib64/python3.6/collections/abc.py s PK ! >JQ/ ) __pycache__/__init__.cpython-36.opt-2.pycnu [ 3
2a $ @ s d ddddddddg Z d d
lT d d lZe ej 7 Z d d lmZmZ d d
lmZ d d l
Z d d l Z
d dlmZ d dlmZmZmZ d dlmZ yd dlm Z W n e k
r Y n X e j e yd dlm Z W n e k
r Y nX G dd de!Z"G dd de#Z$G dd de%Z&G dd de'Z(G dd de)Z*yd d lm*Z* W n e k
rT Y nX d Z+d Z,d Z-d d d d!d"dZ.d#d$ Z/yd d%lm/Z/ W n e k
r Y nX G d&d de)Z0G d'd de1Z2G d(d de1Z3G d)d de Z4G d*d de5Z6d S )+deque defaultdict
namedtupleUserDictUserList
UserStringCounter OrderedDictChainMap )*N)
itemgettereq) iskeyword)proxy)repeatchainstarmap)recursive_repr)r )r c @ s e Zd Zdd ZdS )_OrderedDictKeysViewc c s t | jE d H d S )N)reversed_mapping)self r -/opt/alt/python36/lib64/python3.6/__init__.py __reversed__5 s z!_OrderedDictKeysView.__reversed__N)__name__
__module__ __qualname__r r r r r r 3 s r c @ s e Zd Zdd ZdS )_OrderedDictItemsViewc c s( x"t | jD ]}|| j| fV q W d S )N)r r )r keyr r r r : s z"_OrderedDictItemsView.__reversed__N)r r r r r r r r r 8 s r c @ s e Zd Zdd ZdS )_OrderedDictValuesViewc c s$ x t | jD ]}| j| V q W d S )N)r r )r r r r r r @ s z#_OrderedDictValuesView.__reversed__N)r r r r r r r r r > s r c @ s e Zd ZdZdS )_Linkprevnextr __weakref__N)r" r# r r$ )r r r __slots__r r r r r! D s r! c @ s e Zd Zdd ZejeefddZejfddZdd Z d d
Z
d d Z d)ddZ d*ddZ
dd Zej ZZdd Zdd Zdd ZejZe ZefddZd+d d Ze d d Zd!d" Z d#d$ Z e d,d%d&Z d'd( Z d S )-r c O s | s t d| ^}} t| dkr0t dt| y
|j W n> tk
rx t |_t|j |_}| |_|_i |_ Y nX |j
| | d S )Nz?descriptor '__init__' of 'OrderedDict' object needs an argument z$expected at most 1 arguments, got %d) TypeErrorlen_OrderedDict__rootAttributeErrorr! _OrderedDict__hardroot_proxyr" r# _OrderedDict__map_OrderedDict__update)argskwdsr rootr r r __init__V s
zOrderedDict.__init__c C sZ || krJ| | j |< }| j}|j}||| |_|_|_||_|||_|| || d S )N)r- r) r" r# r ) r r valueZ dict_setitemr ZLinklinkr1 lastr r r __setitem__i s
zOrderedDict.__setitem__c C s> || | | j j|}|j}|j}||_||_d |_d |_d S )N)r- popr" r# )r r Z dict_delitemr4 link_prev link_nextr r r __delitem__w s
zOrderedDict.__delitem__c c s, | j }|j}x||k r&|jV |j}qW d S )N)r) r# r )r r1 currr r r __iter__ s
zOrderedDict.__iter__c c s, | j }|j}x||k r&|jV |j}qW d S )N)r) r" r )r r1 r; r r r r s
zOrderedDict.__reversed__c C s* | j }| |_|_| jj tj| d S )N)r) r" r# r- cleardict)r r1 r r r r= s
zOrderedDict.clearTc C sj | s t d| j}|r0|j}|j}||_||_n|j}|j}||_||_|j}| j|= tj| |}||fS )Nzdictionary is empty)KeyErrorr) r" r# r r- r> r7 )r r5 r1 r4 r8 r9 r r3 r r r popitem s zOrderedDict.popitemc C st | j | }|j}|j}|j}||_||_| j}|rR|j}||_||_||_||_n |j}||_||_||_||_d S )N)r- r" r# r) ) r r r5 r4 r8 r9 Z soft_linkr1 firstr r r move_to_end s$
zOrderedDict.move_to_endc C sV t j}t| d }|| j}||| jd 7 }||| j| 7 }||| j| 7 }|S )Nr& )_sys getsizeofr( __dict__r- r+ r) )r Zsizeofnsizer r r
__sizeof__ s
zOrderedDict.__sizeof__c C s t | S )N)r )r r r r keys s zOrderedDict.keysc C s t | S )N)r )r r r r items s zOrderedDict.itemsc C s t | S )N)r )r r r r values s zOrderedDict.valuesc C s0 || kr| | }| |= |S || j kr,t||S )N)_OrderedDict__markerr? )r r defaultresultr r r r7 s
zOrderedDict.popNc C s || kr| | S || |< |S )Nr )r r rN r r r
setdefault s zOrderedDict.setdefaultc C s* | sd| j jf S d| j jt| j f S )Nz%s()z%s(%r)) __class__r listrK )r r r r __repr__ s zOrderedDict.__repr__c C sH t | j }x t t D ]}|j|d qW | jf |p8d d t| j fS )N)varscopyr r7 rQ iterrK )r Z inst_dictkr r r
__reduce__ s zOrderedDict.__reduce__c C s
| j | S )N)rQ )r r r r rU
s zOrderedDict.copyc C s | }x|D ] }|||< q W |S )Nr )clsiterabler3 r r r r r fromkeys s
zOrderedDict.fromkeysc C s2 t |tr&tj| |o$ttt| |S tj| |S )N)
isinstancer r> __eq__allmap_eq)r otherr r r r] s
zOrderedDict.__eq__)T)T)N)N)!r r r r2 r> r6 r, r! r: r< r r= r@ rB rI MutableMappingupdater. rJ rK rL __ne__objectrM r7 rP _recursive_reprrS rX rU classmethodr[ r] r r r r r G s.
)r a from builtins import property as _property, tuple as _tuple
from operator import itemgetter as _itemgetter
from collections import OrderedDict
class {typename}(tuple):
'{typename}({arg_list})'
__slots__ = ()
_fields = {field_names!r}
def __new__(_cls, {arg_list}):
'Create new instance of {typename}({arg_list})'
return _tuple.__new__(_cls, ({arg_list}))
@classmethod
def _make(cls, iterable, new=tuple.__new__, len=len):
'Make a new {typename} object from a sequence or iterable'
result = new(cls, iterable)
if len(result) != {num_fields:d}:
raise TypeError('Expected {num_fields:d} arguments, got %d' % len(result))
return result
def _replace(_self, **kwds):
'Return a new {typename} object replacing specified fields with new values'
result = _self._make(map(kwds.pop, {field_names!r}, _self))
if kwds:
raise ValueError('Got unexpected field names: %r' % list(kwds))
return result
def __repr__(self):
'Return a nicely formatted representation string'
return self.__class__.__name__ + '({repr_fmt})' % self
def _asdict(self):
'Return a new OrderedDict which maps field names to their values.'
return OrderedDict(zip(self._fields, self))
def __getnewargs__(self):
'Return self as a plain tuple. Used by copy and pickle.'
return tuple(self)
{field_defs}
z {name}=%rzW {name} = _property(_itemgetter({index:d}), doc='Alias for field number {index:d}')
F)verboserenamemodulec C s t |tr|jddj }ttt|}t| } |rt }xNt|D ]B\}}|j spt |sp|j
dsp||kr|d| ||< |j | qDW xN| g| D ]@}t |tk rt
d|j std| t |rtd| qW t }xJ|D ]B}|j
do| rtd| ||kr td | |j | qW tj| t|t|tt|jd
d d d d
jdd |D djdd t|D d}td| d} t|| | | }
||
_|rt|
j |d krytjd jj dd}W n t tfk
r Y nX |d k r
||
_ |
S )N, _z_%dz*Type names and field names must be stringsz8Type names and field names must be valid identifiers: %rz2Type names and field names cannot be a keyword: %rz/Field names cannot start with an underscore: %rz$Encountered duplicate field name: %r' r& z, c s s | ]}t j|d V qdS ))nameN)_repr_templateformat).0rp r r r s z namedtuple..
c s s | ]\}}t j||d V qdS ))indexrp N)_field_templaterr )rs rv rp r r r rt s )typename field_names
num_fieldsarg_listrepr_fmt
field_defsz
namedtuple_%s)r r __main__) r\ strreplacesplitrR r_ set enumerate isidentifier
_iskeyword
startswithaddtyper'
ValueError_class_templaterr tupler( reprjoinr> exec_sourceprintrD _getframe f_globalsgetr* r ) rx ry rh ri rj seenrv rp class_definition namespacerO r r r r e sj
c C s* | j }x |D ]}||dd | |< q W d S )Nr
r& )r )mappingrZ Z mapping_getelemr r r _count_elements s
r )r c s e Zd Z fddZdd Zd.ddZdd Zed/d
d Z fd d
Z dd Z
dd Z dd Z fddZ
dd Zdd Zdd Zd d Zd d Zd d! Zd"d# Zd$d% Zd&d' Zd(d) Zd*d+ Zd,d- Z ZS )0r c sN | s t d| ^}} t| dkr0t dt| tt|j |j| | d S )Nz;descriptor '__init__' of 'Counter' object needs an argumentr& z$expected at most 1 arguments, got %d)r' r( superr r2 rc )r/ r0 r )rQ r r r2 s zCounter.__init__c C s dS )Nr
r )r r r r r __missing__ s zCounter.__missing__Nc C s6 |d kr t | j tdddS tj|| j tddS )Nr& T)r reverse)r )sortedrK _itemgetter_heapqnlargest)r rG r r r most_common s zCounter.most_commonc C s t jtt| j S )N)_chain
from_iterable_starmap_repeatrK )r r r r elements+ s zCounter.elementsc C s t dd S )Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)rY rZ vr r r r[ C s zCounter.fromkeysc s | s t d| ^}} t| dkr0t dt| | r<| d nd }|d k rt|tr|r|j}x8|j D ]\}}|||d ||< qfW qtt|j| n
t || |r|j| d S )Nz9descriptor 'update' of 'Counter' object needs an argumentr& z$expected at most 1 arguments, got %dr
)
r' r( r\ Mappingr rK r r rc r )r/ r0 r rZ self_getr count)rQ r r rc J s
zCounter.updatec O s | s t d| ^}} t| dkr0t dt| | r<| d nd }|d k r|j}t|trxH|j D ]\}}||d| ||< qbW n x |D ]}||dd ||< qW |r|j| d S )Nz;descriptor 'subtract' of 'Counter' object needs an argumentr& z$expected at most 1 arguments, got %dr
)r' r( r r\ r rK subtract)r/ r0 r rZ r r r r r r r r s
zCounter.subtractc C s
| j | S )N)rQ )r r r r rU s z Counter.copyc C s | j t| ffS )N)rQ r> )r r r r rX s zCounter.__reduce__c s || krt j| d S )N)r r: )r r )rQ r r r: s zCounter.__delitem__c C s` | sd| j j S y&djtdj| j }d| j j|f S tk
rZ dj| j jt| S X d S )Nz%s()z, z%r: %rz%s({%s})z
{0}({1!r})) rQ r r r_ __mod__r r' rr r> )r rK r r r rS s zCounter.__repr__c C sx t |tstS t }x0| j D ]$\}}||| }|dkr |||< q W x,|j D ] \}}|| krP|dkrP|||< qPW |S )Nr
)r\ r NotImplementedrK )r ra rO r r newcountr r r __add__ s
zCounter.__add__c C s| t |tstS t }x0| j D ]$\}}||| }|dkr |||< q W x0|j D ]$\}}|| krP|dk rPd| ||< qPW |S )Nr
)r\ r r rK )r ra rO r r r r r r __sub__ s
zCounter.__sub__c C s t |tstS t }x<| j D ]0\}}|| }||k r:|n|}|dkr |||< q W x,|j D ] \}}|| kr\|dkr\|||< q\W |S )Nr
)r\ r r rK )r ra rO r r other_countr r r r __or__ s
zCounter.__or__c C sV t |tstS t }x<| j D ]0\}}|| }||k r:|n|}|dkr |||< q W |S )Nr
)r\ r r rK )r ra rO r r r r r r r __and__ s
zCounter.__and__c C s0 t }x$| j D ]\}}|dkr|||< qW |S )Nr
)r rK )r rO r r r r r __pos__ s
zCounter.__pos__c C s4 t }x(| j D ] \}}|dk rd| ||< qW |S )Nr
)r rK )r rO r r r r r __neg__ s
zCounter.__neg__c C s* dd | j D }x|D ]
}| |= qW | S )Nc S s g | ]\}}|d ks|qS )r
r )rs r r r r r
s z*Counter._keep_positive..)rK )r nonpositiver r r r _keep_positive s
zCounter._keep_positivec C s. x$|j D ]\}}| | |7 < q
W | j S )N)rK r )r ra r r r r r __iadd__ s zCounter.__iadd__c C s. x$|j D ]\}}| | |8 < q
W | j S )N)rK r )r ra r r r r r __isub__% s zCounter.__isub__c C s6 x,|j D ] \}}| | }||kr
|| |< q
W | j S )N)rK r )r ra r r r r r r __ior__2 s
zCounter.__ior__c C s6 x,| j D ] \}}|| }||k r
|| |< q
W | j S )N)rK r )r ra r r r r r r __iand__A s
zCounter.__iand__)N)N)r r r r2 r r r rg r[ rc r rU rX r: rS r r r r r r r r r r r
__classcell__r r )rQ r r s. 3
("
c @ s e Zd Zdd Zdd Zdd Zd&dd Zd
d Zd d
Zdd Z dd Z
e dd Z e
dd Zdd ZeZd'ddZedd Zd d Zd d Zd d! Zd"d# Zd$d% ZdS )(r c G s t |p i g| _d S )N)rR maps)r r r r r r2 c s zChainMap.__init__c C s t |d S )N)r? )r r r r r r j s zChainMap.__missing__c C s8 x,| j D ]"}y|| S tk
r( Y qX qW | j|S )N)r r? r )r r r r r r __getitem__m s
zChainMap.__getitem__Nc C s || kr| | S |S )Nr )r r rN r r r r u s z ChainMap.getc C s t t j| j S )N)r( r unionr )r r r r __len__x s zChainMap.__len__c C s t t j| j S )N)rV r r r )r r r r r< { s zChainMap.__iter__c s t fdd| jD S )Nc 3 s | ]} |kV qd S )Nr )rs m)r r r rt s z(ChainMap.__contains__..)anyr )r r r )r r __contains__~ s zChainMap.__contains__c C s
t | jS )N)r r )r r r r __bool__ s zChainMap.__bool__c C s dj | djtt| jS )Nz{0.__class__.__name__}({1})z, )rr r r_ r r )r r r r rS s zChainMap.__repr__c G s | t j|f| S )N)r> r[ )rY rZ r/ r r r r[ s zChainMap.fromkeysc C s$ | j | jd j f| jdd S )Nr
r& )rQ r rU )r r r r rU s z
ChainMap.copyc C s |d kr i }| j |f| j S )N)rQ r )r r r r r new_child s zChainMap.new_childc C s | j | jdd S )Nr& )rQ r )r r r r parents s zChainMap.parentsc C s || j d |< d S )Nr
)r )r r r3 r r r r6 s zChainMap.__setitem__c C s8 y| j d |= W n" tk
r2 tdj|Y nX d S )Nr
z(Key not found in the first mapping: {!r})r r? rr )r r r r r r: s zChainMap.__delitem__c C s0 y| j d j S tk
r* tdY nX d S )Nr
z#No keys found in the first mapping.)r r@ r? )r r r r r@ s zChainMap.popitemc G s> y| j d j|f| S tk
r8 tdj|Y nX d S )Nr
z(Key not found in the first mapping: {!r})r r7 r? rr )r r r/ r r r r7 s z ChainMap.popc C s | j d j d S )Nr
)r r= )r r r r r= s zChainMap.clear)N)N)r r r r2 r r r r r< r r rf rS rg r[ rU __copy__r propertyr r6 r: r@ r7 r= r r r r r U s&
c @ sb e Zd Zdd Zdd Zdd Zdd Zd d
Zd d Zd
d Z dd Z
dd Z e dddZ
dS )r c O s | s t d| ^}} t| dkr0t dt| | r>| d }n0d|krj|jd}dd l}|jdtdd nd }i |_|d k r|j| t|r|j| d S ) Nz z0Passing 'dict' as keyword argument is deprecatedrC )
stacklevel)r' r( r7 warningswarnDeprecationWarningdatarc )r/ kwargsr r> r r r r r2 s$
zUserDict.__init__c C s
t | jS )N)r( r )r r r r r s zUserDict.__len__c C s: || j kr| j | S t| jdr.| jj| |S t|d S )Nr )r hasattrrQ r r? )r r r r r r s
zUserDict.__getitem__c C s || j |< d S )N)r )r r itemr r r r6 s zUserDict.__setitem__c C s | j |= d S )N)r )r r r r r r: s zUserDict.__delitem__c C s
t | jS )N)rV r )r r r r r< s zUserDict.__iter__c C s
|| j kS )N)r )r r r r r r s zUserDict.__contains__c C s
t | jS )N)r r )r r r r rS s zUserDict.__repr__c C sR | j tkrt| jj S dd l}| j}zi | _|j| }W d || _X |j| |S )Nr
)rQ r r rU rc )r rU r cr r r rU s
z
UserDict.copyNc C s | }x|D ] }|||< q W |S )Nr )rY rZ r3 dr r r r r[ s
zUserDict.fromkeys)N)r r r r2 r r r6 r: r< r rS rU rg r[ r r r r r s c @ s e Zd Zd=ddZdd Zdd Zdd Zd
d Zd d
Zdd Z dd Z
dd Z dd Z dd Z
dd Zdd Zd d Zd d Zd d! Zd"d# ZeZd$d% Zd&d' Zd(d) Zd?d+d,Zd-d. Zd/d0 Zd1d2 Zd3d4 Z d5d6 Z d7d8 Z d9d: Z d;d< Z dS )@r Nc C sb g | _ |d k r^t|t| j kr0|| j d d < n.t|trT|j d d | j d d < n
t|| _ d S )N)r r r\ r rR )r initlistr r r r2 s
zUserList.__init__c C s
t | jS )N)r r )r r r r rS s zUserList.__repr__c C s | j | j|k S )N)r _UserList__cast)r ra r r r __lt__ s zUserList.__lt__c C s | j | j|kS )N)r r )r ra r r r __le__ s zUserList.__le__c C s | j | j|kS )N)r r )r ra r r r r] s zUserList.__eq__c C s | j | j|kS )N)r r )r ra r r r __gt__ s zUserList.__gt__c C s | j | j|kS )N)r r )r ra r r r __ge__ s zUserList.__ge__c C s t |tr|jS |S )N)r\ r r )r ra r r r __cast s zUserList.__castc C s
|| j kS )N)r )r r r r r r s zUserList.__contains__c C s
t | jS )N)r( r )r r r r r s zUserList.__len__c C s
| j | S )N)r )r ir r r r s zUserList.__getitem__c C s || j |< d S )N)r )r r r r r r r6 s zUserList.__setitem__c C s | j |= d S )N)r )r r r r r r: s zUserList.__delitem__c C sP t |tr | j| j|j S t |t| jr<| j| j| S | j| jt| S )N)r\ r rQ r r rR )r ra r r r r s
zUserList.__add__c C sP t |tr | j|j| j S t |t| jr<| j|| j S | jt|| j S )N)r\ r rQ r r rR )r ra r r r __radd__# s
zUserList.__radd__c C sR t |tr | j|j7 _n2t |t| jr<| j|7 _n| jt|7 _| S )N)r\ r r r rR )r ra r r r r ) s
zUserList.__iadd__c C s | j | j| S )N)rQ r )r rG r r r __mul__1 s zUserList.__mul__c C s | j |9 _ | S )N)r )r rG r r r __imul__4 s zUserList.__imul__c C s | j j| d S )N)r append)r r r r r r 7 s zUserList.appendc C s | j j|| d S )N)r insert)r r r r r r r 8 s zUserList.insertr& c C s | j j|S )N)r r7 )r r r r r r7 9 s z UserList.popc C s | j j| d S )N)r remove)r r r r r r : s zUserList.removec C s | j j d S )N)r r= )r r r r r= ; s zUserList.clearc C s
| j | S )N)rQ )r r r r rU < s z
UserList.copyc C s | j j|S )N)r r )r r r r r r = s zUserList.countc G s | j j|f| S )N)r rv )r r r/ r r r rv > s zUserList.indexc C s | j j d S )N)r r )r r r r r ? s zUserList.reversec O s | j j|| d S )N)r sort)r r/ r0 r r r r @ s z
UserList.sortc C s* t |tr| jj|j n | jj| d S )N)r\ r r extend)r ra r r r r A s
zUserList.extend)Nr )r )!r r r r2 rS r r r] r r r r r r r6 r: r r r r __rmul__r r r r7 r r= rU r rv r r r r r r r r s<
c @ s` e Zd Zdd Zdd Zdd Zdd Zd d
Zd d Zd
d Z dd Z
dd Z dd Z dd Z
dd Zdd Zdd Zd d Zd d Zd!d" Zd#d$ Zd%d& ZeZd'd( Zd)d* Zd+d, Zd-d. Zd/d0 Zd1e j fd2d3Z dd5d6Z d1e j fd7d8Z dd:d;Z!d1e j fdd? Z#d@dA Z$d1e j fdBdCZ%dDdE Z&dFdG Z'dHdI Z(dJdK Z)dLdM Z*dNdO Z+dPdQ Z,dRdS Z-dTdU Z.dVdW Z/dXdY Z0dZd[ Z1d\d] Z2d^d_ Z3dd`daZ4e5j6Z6dbdc Z7ddedfZ8d1e j fdgdhZ9d1e j fdidjZ:dkdl Z;dmdn ZddsdtZ?ddvdwZ@d1e j fdxdyZAddzd{ZBd|d} ZCd~d ZDdd ZEdd ZFdd ZGd4S )r c C s< t |tr|| _n&t |tr.|jd d | _n
t|| _d S )N)r\ r r r )r seqr r r r2 N s
zUserString.__init__c C s
t | jS )N)r r )r r r r __str__U s zUserString.__str__c C s
t | jS )N)r r )r r r r rS V s zUserString.__repr__c C s
t | jS )N)intr )r r r r __int__W s zUserString.__int__c C s
t | jS )N)floatr )r r r r __float__X s zUserString.__float__c C s
t | jS )N)complexr )r r r r __complex__Y s zUserString.__complex__c C s
t | jS )N)hashr )r r r r __hash__Z s zUserString.__hash__c C s | j d d fS )N)r )r r r r __getnewargs__[ s zUserString.__getnewargs__c C s t |tr| j|jkS | j|kS )N)r\ r r )r stringr r r r] ^ s
zUserString.__eq__c C s t |tr| j|jk S | j|k S )N)r\ r r )r r r r r r b s
zUserString.__lt__c C s t |tr| j|jkS | j|kS )N)r\ r r )r r r r r r f s
zUserString.__le__c C s t |tr| j|jkS | j|kS )N)r\ r r )r r r r r r j s
zUserString.__gt__c C s t |tr| j|jkS | j|kS )N)r\ r r )r r r r r r n s
zUserString.__ge__c C s t |tr|j}|| jkS )N)r\ r r )r charr r r r s s
zUserString.__contains__c C s
t | jS )N)r( r )r r r r r x s zUserString.__len__c C s | j | j| S )N)rQ r )r rv r r r r y s zUserString.__getitem__c C sJ t |tr | j| j|j S t |tr6| j| j| S | j| jt| S )N)r\ r rQ r r )r ra r r r r z s
zUserString.__add__c C s. t |tr| j|| j S | jt|| j S )N)r\ r rQ r )r ra r r r r s
zUserString.__radd__c C s | j | j| S )N)rQ r )r rG r r r r s zUserString.__mul__c C s | j | j| S )N)rQ r )r r/ r r r r s zUserString.__mod__c C s | j |t S )N)rQ r/ )r rr r r r __rmod__ s zUserString.__rmod__c C s | j | jj S )N)rQ r
capitalize)r r r r r s zUserString.capitalizec C s | j | jj S )N)rQ r casefold)r r r r r s zUserString.casefoldc G s | j | jj|f| S )N)rQ r center)r widthr/ r r r r s zUserString.centerr
c C s t |tr|j}| jj|||S )N)r\ r r r )r substartendr r r r s
zUserString.countNc C s> |r.|r | j | jj||S | j | jj|S | j | jj S )N)rQ r encode)r encodingerrorsr r r r s
zUserString.encodec C s | j j|||S )N)r endswith)r suffixr r r r r r s zUserString.endswith c C s | j | jj|S )N)rQ r
expandtabs)r tabsizer r r r s zUserString.expandtabsc C s t |tr|j}| jj|||S )N)r\ r r find)r r r r r r r r s
zUserString.findc O s | j j||S )N)r rr )r r/ r0 r r r rr s zUserString.formatc C s | j j|S )N)r
format_map)r r r r r r s zUserString.format_mapc C s | j j|||S )N)r rv )r r r r r r r rv s zUserString.indexc C s
| j j S )N)r isalpha)r r r r r s zUserString.isalphac C s
| j j S )N)r isalnum)r r r r r s zUserString.isalnumc C s
| j j S )N)r isdecimal)r r r r r s zUserString.isdecimalc C s
| j j S )N)r isdigit)r r r r r s zUserString.isdigitc C s
| j j S )N)r r )r r r r r s zUserString.isidentifierc C s
| j j S )N)r islower)r r r r r
s zUserString.islowerc C s
| j j S )N)r isnumeric)r r r r r s zUserString.isnumericc C s
| j j S )N)r isprintable)r r r r r s zUserString.isprintablec C s
| j j S )N)r isspace)r r r r r
s zUserString.isspacec C s
| j j S )N)r istitle)r r r r r s zUserString.istitlec C s
| j j S )N)r isupper)r r r r r s zUserString.isupperc C s | j j|S )N)r r )r r r r r r s zUserString.joinc G s | j | jj|f| S )N)rQ r ljust)r r r/ r r r r s zUserString.ljustc C s | j | jj S )N)rQ r lower)r r r r r s zUserString.lowerc C s | j | jj|S )N)rQ r lstrip)r charsr r r r s zUserString.lstripc C s | j j|S )N)r partition)r sepr r r r s zUserString.partitionr& c C s6 t |tr|j}t |tr |j}| j| jj|||S )N)r\ r r rQ r )r oldnewmaxsplitr r r r s
zUserString.replacec C s t |tr|j}| jj|||S )N)r\ r r rfind)r r r r r r r r s
zUserString.rfindc C s | j j|||S )N)r rindex)r r r r r r r r s zUserString.rindexc G s | j | jj|f| S )N)rQ r rjust)r r r/ r r r r s zUserString.rjustc C s | j j|S )N)r
rpartition)r r r r r r s zUserString.rpartitionc C s | j | jj|S )N)rQ r rstrip)r r r r r r s zUserString.rstripc C s | j j||S )N)r r )r r r r r r r s zUserString.splitc C s | j j||S )N)r rsplit)r r r r r r r s zUserString.rsplitFc C s | j j|S )N)r
splitlines)r keependsr r r r s zUserString.splitlinesc C s | j j|||S )N)r r )r prefixr r r r r r s zUserString.startswithc C s | j | jj|S )N)rQ r strip)r r r r r r" s zUserString.stripc C s | j | jj S )N)rQ r swapcase)r r r r r# s zUserString.swapcasec C s | j | jj S )N)rQ r title)r r r r r$ s zUserString.titlec G s | j | jj| S )N)rQ r translate)r r/ r r r r% s zUserString.translatec C s | j | jj S )N)rQ r upper)r r r r r& s zUserString.upperc C s | j | jj|S )N)rQ r zfill)r r r r r r' s zUserString.zfill)NN)r )Nr )r )Nr )Nr r )Nr )F)N)Hr r r r2 r rS r r r r r r] r r r r r r r r r r r r r r r r rD maxsizer r r r r rr r rv r r r r r r
r r r
r r r r r r r maketransr r r r r r r r r r r r" r# r$ r% r& r' r r r r r M s
)7__all___collections_abcoperatorr r r
r` keywordr r sysrD heapqr _weakrefr r, itertoolsr r r r r r reprlibr rf _collectionsr ImportErrorMutableSequenceregisterr KeysViewr ItemsViewr
ValuesViewr re r! r> r r rq rw r r r rb r r r Sequencer r r r r s^
`3b lCIPK ! ; __pycache__/abc.cpython-36.pycnu [ 3
fD @ s d dl T d dl mZ dS ) )*)__all__N)_collections_abcr r r 4/opt/alt/python36/lib64/python3.6/collections/abc.py s PK ! M铎 ) __pycache__/__init__.cpython-36.opt-1.pycnu [ 3
f $ @ s d Z ddddddddd g Zd
d lT d
d lZeej7 Zd
d
lmZmZ d
dlm Z
d
d l Z d
d l
Zd
dlmZ d
dlmZmZmZ d
dlmZ yd
dl m Z W n e k
r Y n X e j e yd
dl m!Z! W n e k
r Y nX G dd de"Z#G dd de$Z%G dd de&Z'G dd de(Z)G d d de*Z+yd
d l m+Z+ W n e k
rX Y nX d Z,d Z-d Z.d!d!d d"d#dZ/d$d% Z0yd
d&l m0Z0 W n e k
r Y nX G d'd de*Z1G d(d d e2Z3G d)d de2Z4G d*d de Z5G d+d de6Z7d S ),a? This module implements specialized container datatypes providing
alternatives to Python's general purpose built-in containers, dict,
list, set, and tuple.
* namedtuple factory function for creating tuple subclasses with named fields
* deque list-like container with fast appends and pops on either end
* ChainMap dict-like class for creating a single view of multiple mappings
* Counter dict subclass for counting hashable objects
* OrderedDict dict subclass that remembers the order entries were added
* defaultdict dict subclass that calls a factory function to supply missing values
* UserDict wrapper around dictionary objects for easier dict subclassing
* UserList wrapper around list objects for easier list subclassing
* UserString wrapper around string objects for easier string subclassing
deque defaultdict
namedtupleUserDictUserList
UserStringCounter OrderedDictChainMap )*N)
itemgettereq) iskeyword)proxy)repeatchainstarmap)recursive_repr)r )r c @ s e Zd Zdd ZdS )_OrderedDictKeysViewc c s t | jE d H d S )N)reversed_mapping)self r 9/opt/alt/python36/lib64/python3.6/collections/__init__.py __reversed__5 s z!_OrderedDictKeysView.__reversed__N)__name__
__module__ __qualname__r r r r r r 3 s r c @ s e Zd Zdd ZdS )_OrderedDictItemsViewc c s( x"t | jD ]}|| j| fV q W d S )N)r r )r keyr r r r : s z"_OrderedDictItemsView.__reversed__N)r r r r r r r r r 8 s r c @ s e Zd Zdd ZdS )_OrderedDictValuesViewc c s$ x t | jD ]}| j| V q W d S )N)r r )r r r r r r @ s z#_OrderedDictValuesView.__reversed__N)r r r r r r r r r > s r c @ s e Zd ZdZdS )_Linkprevnextr __weakref__N)r" r# r r$ )r r r __slots__r r r r r! D s r! c @ s e Zd ZdZdd ZejeefddZej fddZ dd Z
d
d Z d d
Z d*ddZ
d+ddZdd Zej ZZdd Zdd Zdd ZejZe Zefdd Zd,d d Ze d d! Z d"d# Z d$d% Z e d-d&d'Z d(d) Z!d S ).r z)Dictionary that remembers insertion orderc O s | s t d| ^}} t| dkr0t dt| y
|j W n> tk
rx t |_t|j |_}| |_|_i |_ Y nX |j
| | dS )zInitialize an ordered dictionary. The signature is the same as
regular dictionaries. Keyword argument order is preserved.
z?descriptor '__init__' of 'OrderedDict' object needs an argument z$expected at most 1 arguments, got %dN) TypeErrorlen_OrderedDict__rootAttributeErrorr! _OrderedDict__hardroot_proxyr" r# _OrderedDict__map_OrderedDict__update)argskwdsr rootr r r __init__V s
zOrderedDict.__init__c C sZ || krJ| | j |< }| j}|j}||| |_|_|_||_|||_|| || dS )z!od.__setitem__(i, y) <==> od[i]=yN)r- r) r" r# r ) r r valueZ dict_setitemr ZLinklinkr1 lastr r r __setitem__i s
zOrderedDict.__setitem__c C s> || | | j j|}|j}|j}||_||_d|_d|_dS )z od.__delitem__(y) <==> del od[y]N)r- popr" r# )r r Z dict_delitemr4 link_prev link_nextr r r __delitem__w s
zOrderedDict.__delitem__c c s, | j }|j}x||k r&|jV |j}qW dS )zod.__iter__() <==> iter(od)N)r) r# r )r r1 currr r r __iter__ s
zOrderedDict.__iter__c c s, | j }|j}x||k r&|jV |j}qW dS )z#od.__reversed__() <==> reversed(od)N)r) r" r )r r1 r; r r r r s
zOrderedDict.__reversed__c C s* | j }| |_|_| jj tj| dS )z.od.clear() -> None. Remove all items from od.N)r) r" r# r- cleardict)r r1 r r r r= s
zOrderedDict.clearTc C sj | s t d| j}|r0|j}|j}||_||_n|j}|j}||_||_|j}| j|= tj| |}||fS )zRemove and return a (key, value) pair from the dictionary.
Pairs are returned in LIFO order if last is true or FIFO order if false.
zdictionary is empty)KeyErrorr) r" r# r r- r> r7 )r r5 r1 r4 r8 r9 r r3 r r r popitem s zOrderedDict.popitemc C st | j | }|j}|j}|j}||_||_| j}|rR|j}||_||_||_||_n |j}||_||_||_||_dS )zMove an existing element to the end (or beginning if last==False).
Raises KeyError if the element does not exist.
When last=True, acts like a fast version of self[key]=self.pop(key).
N)r- r" r# r) ) r r r5 r4 r8 r9 Z soft_linkr1 firstr r r move_to_end s$
zOrderedDict.move_to_endc C sV t j}t| d }|| j}||| jd 7 }||| j| 7 }||| j| 7 }|S )Nr& )_sys getsizeofr( __dict__r- r+ r) )r Zsizeofnsizer r r
__sizeof__ s
zOrderedDict.__sizeof__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 zOrderedDict.keysc C s t | S )z a set-like object providing a view on D's items)r )r r r r items s zOrderedDict.itemsc C s t | S )z6D.values() -> an object providing a view on D's values)r )r r r r values s zOrderedDict.valuesc C s0 || kr| | }| |= |S || j kr,t||S )zod.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.
)_OrderedDict__markerr? )r r defaultresultr r r r7 s
zOrderedDict.popNc C s || kr| | S || |< |S )zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr )r r rN r r r
setdefault s zOrderedDict.setdefaultc C s* | sd| j jf S d| j jt| j f S )zod.__repr__() <==> repr(od)z%s()z%s(%r)) __class__r listrK )r r r r __repr__ s zOrderedDict.__repr__c C sH t | j }x t t D ]}|j|d qW | jf |p8ddt| j fS )z%Return state information for picklingN)varscopyr r7 rQ iterrK )r Z inst_dictkr r r
__reduce__ s zOrderedDict.__reduce__c C s
| j | S )z!od.copy() -> a shallow copy of od)rQ )r r r r rU
s zOrderedDict.copyc C s | }x|D ] }|||< q W |S )zOD.fromkeys(S[, v]) -> New ordered dictionary with keys from S.
If not specified, the value defaults to None.
r )clsiterabler3 r r r r r fromkeys s
zOrderedDict.fromkeysc C s2 t |tr&tj| |o$ttt| |S tj| |S )zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)
isinstancer r> __eq__allmap_eq)r otherr r r r] s
zOrderedDict.__eq__)T)T)N)N)"r r r __doc__r2 r> r6 r, r! r: r< r r= r@ rB rI MutableMappingupdater. rJ rK rL __ne__objectrM r7 rP _recursive_reprrS rX rU classmethodr[ r] r r r r r G s0
)r a from builtins import property as _property, tuple as _tuple
from operator import itemgetter as _itemgetter
from collections import OrderedDict
class {typename}(tuple):
'{typename}({arg_list})'
__slots__ = ()
_fields = {field_names!r}
def __new__(_cls, {arg_list}):
'Create new instance of {typename}({arg_list})'
return _tuple.__new__(_cls, ({arg_list}))
@classmethod
def _make(cls, iterable, new=tuple.__new__, len=len):
'Make a new {typename} object from a sequence or iterable'
result = new(cls, iterable)
if len(result) != {num_fields:d}:
raise TypeError('Expected {num_fields:d} arguments, got %d' % len(result))
return result
def _replace(_self, **kwds):
'Return a new {typename} object replacing specified fields with new values'
result = _self._make(map(kwds.pop, {field_names!r}, _self))
if kwds:
raise ValueError('Got unexpected field names: %r' % list(kwds))
return result
def __repr__(self):
'Return a nicely formatted representation string'
return self.__class__.__name__ + '({repr_fmt})' % self
def _asdict(self):
'Return a new OrderedDict which maps field names to their values.'
return OrderedDict(zip(self._fields, self))
def __getnewargs__(self):
'Return self as a plain tuple. Used by copy and pickle.'
return tuple(self)
{field_defs}
z {name}=%rzW {name} = _property(_itemgetter({index:d}), doc='Alias for field number {index:d}')
F)verboserenamemodulec C s t |tr|jddj }ttt|}t| } |rt }xNt|D ]B\}}|j spt |sp|j
dsp||kr|d| ||< |j | qDW xN| g| D ]@}t |tk rt
d|j std| t |rtd| qW t }xJ|D ]B}|j
do| rtd| ||kr td | |j | qW tj| t|t|tt|jd
d d d d
jdd |D djdd t|D d}td| d} t|| | | }
||
_|rt|
j |dkrytjd jj dd}W n t tfk
r Y nX |dk r
||
_ |
S )aC Returns a new subclass of tuple with named fields.
>>> Point = namedtuple('Point', ['x', 'y'])
>>> Point.__doc__ # docstring for the new class
'Point(x, y)'
>>> p = Point(11, y=22) # instantiate with positional args or keywords
>>> p[0] + p[1] # indexable like a plain tuple
33
>>> x, y = p # unpack like a regular tuple
>>> x, y
(11, 22)
>>> p.x + p.y # fields also accessible by name
33
>>> d = p._asdict() # convert to a dictionary
>>> d['x']
11
>>> Point(**d) # convert from a dictionary
Point(x=11, y=22)
>>> p._replace(x=100) # _replace() is like str.replace() but targets named fields
Point(x=100, y=22)
, _z_%dz*Type names and field names must be stringsz8Type names and field names must be valid identifiers: %rz2Type names and field names cannot be a keyword: %rz/Field names cannot start with an underscore: %rz$Encountered duplicate field name: %r' r& z, c s s | ]}t j|d V qdS ))nameN)_repr_templateformat).0rq r r r s z namedtuple..
c s s | ]\}}t j||d V qdS ))indexrq N)_field_templaters )rt rw rq r r r ru s )typename field_names
num_fieldsarg_listrepr_fmt
field_defsz
namedtuple_%s)r Nr __main__) r\ strreplacesplitrR r_ set enumerate isidentifier
_iskeyword
startswithaddtyper'
ValueError_class_templaters tupler( reprjoinr> exec_sourceprintrD _getframe f_globalsgetr* r ) ry rz ri rj rk seenrw rq class_definition namespacerO r r r r e sj
c C s* | j }x |D ]}||dd | |< q W dS )z!Tally elements from the iterable.r
r& N)r )mappingrZ Z mapping_getelemr r r _count_elements s
r )r c s e Zd ZdZ fddZdd Zd/ddZd d
Zed0d d Z fd
dZ
dd Z dd Z dd Z
fddZdd Zdd Zdd Zd d Zd d Zd!d" Zd#d$ Zd%d& Zd'd( Zd)d* Zd+d, Zd-d. Z ZS )1r a Dict subclass for counting hashable items. Sometimes called a bag
or multiset. Elements are stored as dictionary keys and their counts
are stored as dictionary values.
>>> c = Counter('abcdeabcdabcaba') # count elements from a string
>>> c.most_common(3) # three most common elements
[('a', 5), ('b', 4), ('c', 3)]
>>> sorted(c) # list all unique elements
['a', 'b', 'c', 'd', 'e']
>>> ''.join(sorted(c.elements())) # list elements with repetitions
'aaaaabbbbcccdde'
>>> sum(c.values()) # total of all counts
15
>>> c['a'] # count of letter 'a'
5
>>> for elem in 'shazam': # update counts from an iterable
... c[elem] += 1 # by adding 1 to each element's count
>>> c['a'] # now there are seven 'a'
7
>>> del c['b'] # remove all 'b'
>>> c['b'] # now there are zero 'b'
0
>>> d = Counter('simsalabim') # make another counter
>>> c.update(d) # add in the second counter
>>> c['a'] # now there are nine 'a'
9
>>> c.clear() # empty the counter
>>> c
Counter()
Note: If a count is set to zero or reduced to zero, it will remain
in the counter until the entry is deleted or the counter is cleared:
>>> c = Counter('aaabbc')
>>> c['b'] -= 2 # reduce the count of 'b' by two
>>> c.most_common() # 'b' is still in, but its count is zero
[('a', 3), ('c', 1), ('b', 0)]
c sN | s t d| ^}} t| dkr0t dt| tt|j |j| | dS )a Create a new, empty Counter object. And if given, count elements
from an input iterable. Or, initialize the count from another mapping
of elements to their counts.
>>> c = Counter() # a new, empty counter
>>> c = Counter('gallahad') # a new counter from an iterable
>>> c = Counter({'a': 4, 'b': 2}) # a new counter from a mapping
>>> c = Counter(a=4, b=2) # a new counter from keyword args
z;descriptor '__init__' of 'Counter' object needs an argumentr& z$expected at most 1 arguments, got %dN)r' r( superr r2 rd )r/ r0 r )rQ r r r2 s zCounter.__init__c C s dS )z1The count of elements not in the Counter is zero.r
r )r r r r r __missing__ s zCounter.__missing__Nc C s6 |dkr t | j tdddS tj|| j tddS )zList the n most common elements and their counts from the most
common to the least. If n is None, then list all element counts.
>>> Counter('abcdeabcdabcaba').most_common(3)
[('a', 5), ('b', 4), ('c', 3)]
Nr& T)r reverse)r )sortedrK _itemgetter_heapqnlargest)r rG r r r most_common s zCounter.most_commonc C s t jtt| j S )a Iterator over elements repeating each as many times as its count.
>>> c = Counter('ABCABC')
>>> sorted(c.elements())
['A', 'A', 'B', 'B', 'C', 'C']
# Knuth's example for prime factors of 1836: 2**2 * 3**3 * 17**1
>>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
>>> product = 1
>>> for factor in prime_factors.elements(): # loop over factors
... product *= factor # and multiply them
>>> product
1836
Note, if an element's count has been set to zero or is a negative
number, elements() will ignore it.
)_chain
from_iterable_starmap_repeatrK )r r r r elements+ s zCounter.elementsc C s t dd S )Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)rY rZ vr r r r[ C s zCounter.fromkeysc s | s t d| ^}} t| dkr0t dt| | r<| d nd}|dk rt|tr|r|j}x8|j D ]\}}|||d ||< qfW qtt|j| n
t || |r|j| dS )a Like dict.update() but add counts instead of replacing them.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.update('witch') # add elements from another iterable
>>> d = Counter('watch')
>>> c.update(d) # add elements from another counter
>>> c['h'] # four 'h' in which, witch, and watch
4
z9descriptor 'update' of 'Counter' object needs an argumentr& z$expected at most 1 arguments, got %dr
N)
r' r( r\ Mappingr rK r r rd r )r/ r0 r rZ self_getr count)rQ r r rd J s
zCounter.updatec O s | s t d| ^}} t| dkr0t dt| | r<| d nd}|dk r|j}t|trxH|j D ]\}}||d| ||< qbW n x |D ]}||dd ||< qW |r|j| dS )a Like dict.update() but subtracts counts instead of replacing them.
Counts can be reduced below zero. Both the inputs and outputs are
allowed to contain zero and negative counts.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.subtract('witch') # subtract elements from another iterable
>>> c.subtract(Counter('watch')) # subtract elements from another counter
>>> c['h'] # 2 in which, minus 1 in witch, minus 1 in watch
0
>>> c['w'] # 1 in which, minus 1 in witch, minus 1 in watch
-1
z;descriptor 'subtract' of 'Counter' object needs an argumentr& z$expected at most 1 arguments, got %dr
N)r' r( r r\ r rK subtract)r/ r0 r rZ r r r r r r r r s
zCounter.subtractc C s
| j | S )zReturn a shallow copy.)rQ )r r r r rU s z Counter.copyc C s | j t| ffS )N)rQ r> )r r r r rX s zCounter.__reduce__c s || krt j| dS )zGLike dict.__delitem__() but does not raise KeyError for missing values.N)r r: )r r )rQ r r r: s zCounter.__delitem__c C s` | sd| j j S y&djtdj| j }d| j j|f S tk
rZ dj| j jt| S X d S )Nz%s()z, z%r: %rz%s({%s})z
{0}({1!r})) rQ r r r_ __mod__r r' rs r> )r rK r r r rS s zCounter.__repr__c C sx t |tstS t }x0| j D ]$\}}||| }|dkr |||< q W x,|j D ] \}}|| krP|dkrP|||< qPW |S )zAdd counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
r
)r\ r NotImplementedrK )r ra rO r r newcountr r r __add__ s
zCounter.__add__c C s| t |tstS t }x0| j D ]$\}}||| }|dkr |||< q W x0|j D ]$\}}|| krP|dk rPd| ||< qPW |S )z Subtract count, but keep only results with positive counts.
>>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
r
)r\ r r rK )r ra rO r r r r r r __sub__ s
zCounter.__sub__c C s t |tstS t }x<| j D ]0\}}|| }||k r:|n|}|dkr |||< q W x,|j D ] \}}|| kr\|dkr\|||< q\W |S )zUnion is the maximum of value in either of the input counters.
>>> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
r
)r\ r r rK )r ra rO r r other_countr r r r __or__ s
zCounter.__or__c C sV t |tstS t }x<| j D ]0\}}|| }||k r:|n|}|dkr |||< q W |S )z Intersection is the minimum of corresponding counts.
>>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
r
)r\ r r rK )r ra rO r r r r r r r __and__ s
zCounter.__and__c C s0 t }x$| j D ]\}}|dkr|||< qW |S )zEAdds an empty counter, effectively stripping negative and zero countsr
)r rK )r rO r r r r r __pos__ s
zCounter.__pos__c C s4 t }x(| j D ] \}}|dk rd| ||< qW |S )z{Subtracts from an empty counter. Strips positive and zero counts,
and flips the sign on negative counts.
r
)r rK )r rO r r r r r __neg__ s
zCounter.__neg__c C s* dd | j D }x|D ]
}| |= qW | S )z?Internal method to strip elements with a negative or zero countc S s g | ]\}}|d ks|qS )r
r )rt r r r r r
s z*Counter._keep_positive..)rK )r nonpositiver r r r _keep_positive s
zCounter._keep_positivec C s. x$|j D ]\}}| | |7 < q
W | j S )zInplace add from another counter, keeping only positive counts.
>>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
)rK r )r ra r r r r r __iadd__ s zCounter.__iadd__c C s. x$|j D ]\}}| | |8 < q
W | j S )zInplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
)rK r )r ra r r r r r __isub__% s zCounter.__isub__c C s6 x,|j D ] \}}| | }||kr
|| |< q
W | j S )zInplace union is the maximum of value from either counter.
>>> c = Counter('abbb')
>>> c |= Counter('bcc')
>>> c
Counter({'b': 3, 'c': 2, 'a': 1})
)rK r )r ra r r r r r r __ior__2 s
zCounter.__ior__c C s6 x,| j D ] \}}|| }||k r
|| |< q
W | j S )zInplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
)rK r )r ra r r r r r r __iand__A s
zCounter.__iand__)N)N) r r r rb r2 r r r rh r[ rd r rU rX r: rS r r r r r r r r r r r
__classcell__r r )rQ r r s0 +
("
c @ s e Zd ZdZdd Zdd Zdd Zd'd d
Zd d Zd
d Z dd Z
dd Z e dd Z
edd Zdd ZeZd(ddZedd Zd d Zd d Zd!d" Zd#d$ Zd%d& ZdS ))r a A ChainMap groups multiple dicts (or other mappings) together
to create a single, updateable view.
The underlying mappings are stored in a list. That list is public and can
be accessed or updated using the *maps* attribute. There is no other
state.
Lookups search the underlying mappings successively until a key is found.
In contrast, writes, updates, and deletions only operate on the first
mapping.
c G s t |p i g| _dS )zInitialize a ChainMap by setting *maps* to the given mappings.
If no mappings are provided, a single empty dictionary is used.
N)rR maps)r r r r r r2 c s zChainMap.__init__c C s t |d S )N)r? )r r r r r r j s zChainMap.__missing__c C s8 x,| j D ]"}y|| S tk
r( Y qX qW | j|S )N)r r? r )r r r r r r __getitem__m s
zChainMap.__getitem__Nc C s || kr| | S |S )Nr )r r rN r r r r u s z ChainMap.getc C s t t j| j S )N)r( r unionr )r r r r __len__x s zChainMap.__len__c C s t t j| j S )N)rV r r r )r r r r r< { s zChainMap.__iter__c s t fdd| jD S )Nc 3 s | ]} |kV qd S )Nr )rt m)r r r ru s z(ChainMap.__contains__..)anyr )r r r )r r __contains__~ s zChainMap.__contains__c C s
t | jS )N)r r )r r r r __bool__ s zChainMap.__bool__c C s dj | djtt| jS )Nz{0.__class__.__name__}({1})z, )rs r r_ r r )r r r r rS s zChainMap.__repr__c G s | t j|f| S )z?Create a ChainMap with a single dict created from the iterable.)r> r[ )rY rZ r/ r r r r[ s zChainMap.fromkeysc C s$ | j | jd j f| jdd S )zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r
r& N)rQ r rU )r r r r rU s z
ChainMap.copyc C s |dkr i }| j |f| j S )zyNew ChainMap with a new map followed by all previous maps.
If no map is provided, an empty dict is used.
N)rQ r )r r r r r new_child s zChainMap.new_childc C s | j | jdd S )zNew ChainMap from maps[1:].r& N)rQ r )r r r r parents s zChainMap.parentsc C s || j d |< d S )Nr
)r )r r r3 r r r r6 s zChainMap.__setitem__c C s8 y| j d |= W n" tk
r2 tdj|Y nX d S )Nr
z(Key not found in the first mapping: {!r})r r? rs )r r r r r r: s zChainMap.__delitem__c C s0 y| j d j S tk
r* tdY nX dS )zPRemove and return an item pair from maps[0]. Raise KeyError is maps[0] is empty.r
z#No keys found in the first mapping.N)r r@ r? )r r r r r@ s zChainMap.popitemc G s> y| j d j|f| S tk
r8 tdj|Y nX dS )zWRemove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].r
z(Key not found in the first mapping: {!r}N)r r7 r? rs )r r r/ r r r r7 s z ChainMap.popc C s | j d j dS )z'Clear maps[0], leaving maps[1:] intact.r
N)r r= )r r r r r= s zChainMap.clear)N)N)r r r rb r2 r r r r r< r r rg rS rh r[ rU __copy__r propertyr r6 r: r@ r7 r= r r r r r U s(
c @ sb e Zd Zdd Zdd Zdd Zdd Zd d
Zd d Zd
d Z dd Z
dd Z e dddZ
dS )r c O s | s t d| ^}} t| dkr0t dt| | r>| d }n0d|krj|jd}dd l}|jdtdd nd }i |_|d k r|j| t|r|j| d S ) Nz z0Passing 'dict' as keyword argument is deprecatedrC )
stacklevel)r' r( r7 warningswarnDeprecationWarningdatard )r/ kwargsr r> r r r r r2 s$
zUserDict.__init__c C s
t | jS )N)r( r )r r r r r s zUserDict.__len__c C s: || j kr| j | S t| jdr.| jj| |S t|d S )Nr )r hasattrrQ r r? )r r r r r r s
zUserDict.__getitem__c C s || j |< d S )N)r )r r itemr r r r6 s zUserDict.__setitem__c C s | j |= d S )N)r )r r r r r r: s zUserDict.__delitem__c C s
t | jS )N)rV r )r r r r r< s zUserDict.__iter__c C s
|| j kS )N)r )r r r r r r s zUserDict.__contains__c C s
t | jS )N)r r )r r r r rS s zUserDict.__repr__c C sR | j tkrt| jj S dd l}| j}zi | _|j| }W d || _X |j| |S )Nr
)rQ r r rU rd )r rU r cr r r rU s
z
UserDict.copyNc C s | }x|D ] }|||< q W |S )Nr )rY rZ r3 dr r r r r[ s
zUserDict.fromkeys)N)r r r r2 r r r6 r: r< r rS rU rh r[ r r r r r s c @ s e Zd ZdZd>ddZdd Zdd Zd d
Zd d Zd
d Z dd Z
dd Z dd Z dd Z
dd Zdd Zdd Zd d Zd d Zd!d" Zd#d$ ZeZd%d& Zd'd( Zd)d* Zd@d,d-Zd.d/ Zd0d1 Zd2d3 Z d4d5 Z d6d7 Z d8d9 Z d:d; Z d s zUserList.indexc C s | j j d S )N)r r )r r r r r ? s zUserList.reversec O s | j j|| d S )N)r sort)r r/ r0 r r r r @ s z
UserList.sortc C s* t |tr| jj|j n | jj| d S )N)r\ r r extend)r ra r r r r A s
zUserList.extend)Nr )r )"r r r rb r2 rS r r r] r r r r r r r6 r: r r r r __rmul__r r r r7 r r= rU r rw r r r r r r r r s>
c @ s` e Zd Zdd Zdd Zdd Zdd Zd d
Zd d Zd
d Z dd Z
dd Z dd Z dd Z
dd Zdd Zdd Zd d Zd d Zd!d" Zd#d$ Zd%d& ZeZd'd( Zd)d* Zd+d, Zd-d. Zd/d0 Zd1e j fd2d3Z dd5d6Z d1e j fd7d8Z dd:d;Z!d1e j fdd? Z#d@dA Z$d1e j fdBdCZ%dDdE Z&dFdG Z'dHdI Z(dJdK Z)dLdM Z*dNdO Z+dPdQ Z,dRdS Z-dTdU Z.dVdW Z/dXdY Z0dZd[ Z1d\d] Z2d^d_ Z3dd`daZ4e5j6Z6dbdc Z7ddedfZ8d1e j fdgdhZ9d1e j fdidjZ:dkdl Z;dmdn ZddsdtZ?ddvdwZ@d1e j fdxdyZAddzd{ZBd|d} ZCd~d ZDdd ZEdd ZFdd ZGd4S )r c C s< t |tr|| _n&t |tr.|jd d | _n
t|| _d S )N)r\ r r r )r seqr r r r2 N s
zUserString.__init__c C s
t | jS )N)r r )r r r r __str__U s zUserString.__str__c C s
t | jS )N)r r )r r r r rS V s zUserString.__repr__c C s
t | jS )N)intr )r r r r __int__W s zUserString.__int__c C s
t | jS )N)floatr )r r r r __float__X s zUserString.__float__c C s
t | jS )N)complexr )r r r r __complex__Y s zUserString.__complex__c C s
t | jS )N)hashr )r r r r __hash__Z s zUserString.__hash__c C s | j d d fS )N)r )r r r r __getnewargs__[ s zUserString.__getnewargs__c C s t |tr| j|jkS | j|kS )N)r\ r r )r stringr r r r] ^ s
zUserString.__eq__c C s t |tr| j|jk S | j|k S )N)r\ r r )r r r r r r b s
zUserString.__lt__c C s t |tr| j|jkS | j|kS )N)r\ r r )r r r r r r f s
zUserString.__le__c C s t |tr| j|jkS | j|kS )N)r\ r r )r r r r r r j s
zUserString.__gt__c C s t |tr| j|jkS | j|kS )N)r\ r r )r r r r r r n s
zUserString.__ge__c C s t |tr|j}|| jkS )N)r\ r r )r charr r r r s s
zUserString.__contains__c C s
t | jS )N)r( r )r r r r r x s zUserString.__len__c C s | j | j| S )N)rQ r )r rw r r r r y s zUserString.__getitem__c C sJ t |tr | j| j|j S t |tr6| j| j| S | j| jt| S )N)r\ r rQ r r )r ra r r r r z s
zUserString.__add__c C s. t |tr| j|| j S | jt|| j S )N)r\ r rQ r )r ra r r r r s
zUserString.__radd__c C s | j | j| S )N)rQ r )r rG r r r r s zUserString.__mul__c C s | j | j| S )N)rQ r )r r/ r r r r s zUserString.__mod__c C s | j |t S )N)rQ r/ )r rs r r r __rmod__ s zUserString.__rmod__c C s | j | jj S )N)rQ r
capitalize)r r r r r s zUserString.capitalizec C s | j | jj S )N)rQ r casefold)r r r r r s zUserString.casefoldc G s | j | jj|f| S )N)rQ r center)r widthr/ r r r r s zUserString.centerr
c C s t |tr|j}| jj|||S )N)r\ r r r )r substartendr r r r s
zUserString.countNc C s> |r.|r | j | jj||S | j | jj|S | j | jj S )N)rQ r encode)r encodingerrorsr r r r s
zUserString.encodec C s | j j|||S )N)r endswith)r suffixr r r r r r s zUserString.endswith c C s | j | jj|S )N)rQ r
expandtabs)r tabsizer r r r s zUserString.expandtabsc C s t |tr|j}| jj|||S )N)r\ r r find)r r r r r r r r s
zUserString.findc O s | j j||S )N)r rs )r r/ r0 r r r rs s zUserString.formatc C s | j j|S )N)r
format_map)r r r r r r s zUserString.format_mapc C s | j j|||S )N)r rw )r r r r r r r rw s zUserString.indexc C s
| j j S )N)r isalpha)r r r r r s zUserString.isalphac C s
| j j S )N)r isalnum)r r r r r s zUserString.isalnumc C s
| j j S )N)r isdecimal)r r r r r s zUserString.isdecimalc C s
| j j S )N)r isdigit)r r r r r
s zUserString.isdigitc C s
| j j S )N)r r )r r r r r s zUserString.isidentifierc C s
| j j S )N)r islower)r r r r r s zUserString.islowerc C s
| j j S )N)r isnumeric)r r r r r s zUserString.isnumericc C s
| j j S )N)r isprintable)r r r r r
s zUserString.isprintablec C s
| j j S )N)r isspace)r r r r r s zUserString.isspacec C s
| j j S )N)r istitle)r r r r r s zUserString.istitlec C s
| j j S )N)r isupper)r r r r r s zUserString.isupperc C s | j j|S )N)r r )r r r r r r s zUserString.joinc G s | j | jj|f| S )N)rQ r ljust)r r r/ r r r r s zUserString.ljustc C s | j | jj S )N)rQ r lower)r r r r r s zUserString.lowerc C s | j | jj|S )N)rQ r lstrip)r charsr r r r s zUserString.lstripc C s | j j|S )N)r partition)r sepr r r r s zUserString.partitionr& c C s6 t |tr|j}t |tr |j}| j| jj|||S )N)r\ r r rQ r )r oldnewmaxsplitr r r r s
zUserString.replacec C s t |tr|j}| jj|||S )N)r\ r r rfind)r r r r r r r r s
zUserString.rfindc C s | j j|||S )N)r rindex)r r r r r r r r s zUserString.rindexc G s | j | jj|f| S )N)rQ r rjust)r r r/ r r r r s zUserString.rjustc C s | j j|S )N)r
rpartition)r r r r r r s zUserString.rpartitionc C s | j | jj|S )N)rQ r rstrip)r r r r r r s zUserString.rstripc C s | j j||S )N)r r )r r r r r r r s zUserString.splitc C s | j j||S )N)r rsplit)r r r r r r r s zUserString.rsplitFc C s | j j|S )N)r
splitlines)r keependsr r r r s zUserString.splitlinesc C s | j j|||S )N)r r )r prefixr r r r r r s zUserString.startswithc C s | j | jj|S )N)rQ r strip)r r r r r r# s zUserString.stripc C s | j | jj S )N)rQ r swapcase)r r r r r$ s zUserString.swapcasec C s | j | jj S )N)rQ r title)r r r r r% s zUserString.titlec G s | j | jj| S )N)rQ r translate)r r/ r r r r& s zUserString.translatec C s | j | jj S )N)rQ r upper)r r r r r' s zUserString.upperc C s | j | jj|S )N)rQ r zfill)r r r r r r( s zUserString.zfill)NN)r )Nr )r )Nr )Nr r )Nr )F)N)Hr r r r2 r rS r r r r r r] r r r r r r r r r r r r r r r r rD maxsizer r r r r rs r rw r r r r
r r r r
r r r r r r r r maketransr r r r r r r r r r r r# r$ r% r& r' r( r r r r r M s
)8rb __all___collections_abcoperatorr r r
r` keywordr r sysrD heapqr _weakrefr r, itertoolsr r r r r r reprlibr rg _collectionsr ImportErrorMutableSequenceregisterr KeysViewr ItemsViewr
ValuesViewr rf r! r> r r rr rx r r r rc r r r Sequencer r r r r s`
`3b lCIPK ! 9m $ __pycache__/abc.cpython-36.opt-2.pycnu [ 3
2aD @ s d dl T d dl mZ dS ) )*)__all__N)_collections_abcr r r (/opt/alt/python36/lib64/python3.6/abc.py s PK ! א * __pycache__/__init__.cpython-311.opt-2.pycnu [ PK ! Cܝ1 1 $ [ __pycache__/__init__.cpython-311.pycnu [ PK ! < < L; __pycache__/abc.cpython-311.pycnu [ PK ! < < % < __pycache__/abc.cpython-311.opt-1.pycnu [ PK ! Cܝ1 1 * h> __pycache__/__init__.cpython-311.opt-1.pycnu [ PK ! < < % _p __pycache__/abc.cpython-311.opt-2.pycnu [ PK ! "% ~2 2 q __init__.pynu [ PK ! w w ]= abc.pynu [ PK ! 8 8 #
> __pycache__/__init__.cpython-33.pyonu [ PK ! |w& # : __pycache__/__main__.cpython-33.pycnu [ PK ! 8 8 # mD __pycache__/__init__.cpython-33.pycnu [ PK ! VۍR R # @ __pycache__/__main__.cpython-33.pyonu [ PK ! ݿ J __pycache__/abc.cpython-33.pyonu [ PK ! ݿ l __pycache__/abc.cpython-33.pycnu [ PK !
/ ;` __main__.pynu [ PK ! M铎 # qe __pycache__/__init__.cpython-36.pycnu [ PK ! ; $ __pycache__/abc.cpython-36.opt-1.pycnu [ PK ! >JQ/ ) __pycache__/__init__.cpython-36.opt-2.pycnu [ PK ! ; Q __pycache__/abc.cpython-36.pycnu [ PK ! M铎 ) e __pycache__/__init__.cpython-36.opt-1.pycnu [ PK ! 9m $ X __pycache__/abc.cpython-36.opt-2.pycnu [ PK Y