ÿØÿà JFIF 

  
 
  ÿÛ „ 	 ( %"1!%)+...383,7(-.+




-+++--++++---+-+-----+---------------+---+-++7-----ÿÀ  ß â
" 

ÿÄ   

           
 ÿÄ H 
     
 !1AQaq"‘¡2B±ÁÑð#R“Ò Tbr‚²á3csƒ’ÂñDS¢³$CÿÄ 
 


            
ÿÄ %

 
       
!1AQa"23‘ÿÚ 
  ? ôÿ ¨pŸªáÿ —åYõõ\?àÒü©ŠÄï¨pŸªáÿ —åYõõ\?àÓü©ŠÄá 0Ÿªáÿ Ÿå[úƒ	ú®ði~TÁb
qÐ8OÕpÿ ƒOò¤Oè`–RÂáœá™êi€ßÉ< FtŸI“öÌ8úDf´°å}“¾œ6
öFá°y¥jñÇh†ˆ¢ã/ÃÐ:ªcÈ
"Y¡ðÑl>ÿ ”ÏËte:qž\oäŠe÷󲍷˜HT4&ÿ ÓÐü6ö®¿øþßèô	Ÿ•7Ñi’•j|“ñì>b…þS?*Óôÿ ÓÐü*h¥£ír¶ü UãSç‚Ÿ[AÐaè[ûª•õ&õj?†Éö+EzP—WeÒírJFt	‘BŒ†Ï‡%#tE Øz ¥OÛ«!1›üä±Í™%º<!vB™'èÔ6´Ña¿«e`Àà0U[-ÂБ4)M÷YK*³hï÷%ÎÎkÇ«m‘-íWŽLsã?nÂ~«†üö®þ¡ÂlÃaÿ ‰ÿ l©°Õ¥ åÜá¿r ºL[Çâ°(Çè'Vãôl8´ÏRÀvLvPõ:…ÙNçF™÷ë>Íãö]°î(–:@<‹ŒÊö×òÆt¦ãº+‡¦%ÌÁ²h´OƒJŒtMÜ>ÀÜÊw3
Y´•牋4ǍýʏTì>œú=Íwhyë,¾Ôò×õ¿ßÊa»«þˆѪQ|%6ž™A	õ%:øj<>É—ÿ Å_ˆCbõ¥š±ý¯Ýƒï…¶|RëócÍf溪“t.СøTÿ *Ä¿-{†çàczůŽ_–^XþŒ±miB[X±d 1,é”zEù»&
î9gœf™9Ð'.;—™i}!ôšåîqêÛ٤ёý£½ÆA–àôe"A$˝Úsäÿ 
÷Û	#°xŸëí(l
	 »ý3—¥5m!
rt`†0~'j2(]S¦¦kv,ÚÇl¦øJA£Šƒ
J3E8ÙiŽ:cÉžúeZ°€¯\®kÖ(79«Ž:¯X”¾³Š&¡* ….‰Ž(ÜíŸ2¥ª‡×Hi²TF¤ò[¨íÈRëÉ䢍mgÑ.Ÿ<öäS0í„ǹÁU´f#Vß;Õ–…P@3ío<ä-±»Ž.L|kªÀê›fÂ6@»eu‚|ÓaÞÆŸ…¨ááå>åŠ?cKü6ùTÍÆ”†sĤÚ;H2RÚ†õ\Ö·Ÿn'¾ ñ#ºI¤Å´%çÁ­‚â7›‹qT3Iï¨Ö
Ú5I7Ë!ÅOóŸ¶øÝñØôת¦$Tcö‘[«Ö³šÒ';Aþ ¸èíg
A2Z
"i¸vdÄ÷.iõ®§)¿]¤À†–‡É&ä{V¶iŽ”.Ó×Õÿ û?h¬Mt–íª[ÿ Ñÿ ÌV(í}=ibÔ¡›¥¢±b
 Lô¥‡piη_Z<‡z§èŒ)iÖwiÇ 2hÙ3·=’d÷8éŽ1¦¸c¤µ€7›7Ø	ð\á)}	¹fËí›pAÃL%âc2 í§æQz¿;T8sæ°qø)QFMð‰XŒÂ±
N¢aF¨…8¯!U		Z©RÊ ÖPVÄÀÍin™Ì-GˆªÅËŠ›•zË}º±ŽÍFò¹}Uw×#ä5B¤{î}Ð<ÙD
é©¤&‡ïDbàÁôMÁ."
¤‡ú*õ'VŽ|¼´Úgllº¼klz[Æüï÷Aób‡Eÿ dÑ»Xx9ÃÜ£ÁT/`¼¸vI±Ýµ·Ë‚“G³þ*Ÿû´r|*}<¨îºœ @¦mÄ’M¹”.œ«Y–|6ÏU¤jç¥ÕÞqO
˜kDÆÁ¨5ÿ š;Њ¦¦€GÙk \
	–Þ=â¼=SͧµªS°ÚÍpÜãQűÀõ¬?ÃÁ1Ñ•õZà?hóœ€
L¦l{Y*K˜Ù›zc˜–ˆâø+¾	­-Ök¥%ùEÜA'}ˆ><ÊIè“bpÍ/qÞâvoX€w,\úªò6Z[XdÒæ­@Ö—€$òJí#é>'°Ú
ôª˜<)4ryÙ£|óAÅn5žêŸyÒäMÝ2{"}‰–¤l÷ûWX\l¾Á¸góÉOÔ /óñB¤f¸çñ[.P˜ZsÊË*ßT܈§QN¢’¡¨§V¼(Üù*eÕ“”5T¨‹Âê¥FŒã½Dü[8'Ò¥a…Ú¶k7a
*•›¼'Ò·\8¨ª\@\õ¢¦íq+DÙrmÎ…_ªæ»ŠÓœ¡¯’Ré9MÅ×D™lælffc+ŒÑ,ý™ÿ ¯þǤ=Å’Á7µ÷ÚÛ/“Ü
€ñýã¼àí¾ÕÑ+ƒ,uµMâÀÄbm:ÒÎPæ{˜Gz[ƒ¯«® KHà`ßØŠéí¯P8Aq.C‰ à€kòpj´kN¶qô€…Õ,ÜNŠª-­{Zö’æû44‰sŽè‰îVíRœÕm"
6?³D9¡ÇTíÅꋇ`4«¸ÝÁô ï’ýorqКÇZ«x4Žâéþuïf¹µö[P ,Q£éaX±`PÉÍZ ¸äYúgüAx
’6Lê‚xÝÓ*äQ
Ï’¨hÍ
=²,6ï#rÃ<¯–£»ƒ‹,–ê•€ aÛsñ'%Æ"®ÛüìBᝠHÚ3ß°©$“XnœÖ’î2ËTeûìxîß
¦å¿çÉ
ðK§þ{‘t‚Ϋ¬jéîZ[”š7L¥4VÚCE×]m¤Øy”ä4-dz£œ§¸x.*ã
ÊÊ b÷•h:©‡¦s`BTÁRû¾g⻩‹jø sF¢àJøFl‘È•Xᓁà~*j¯ +(ÚÕ6-£¯÷GŠØy‚<Ç’.F‹Hœw(+)ÜÜâÈzÄäT§FߘãÏ;DmVœ3Àu@mÚüXÝü•3B¨òÌÁÛ<·ÃÜz,Ì@õÅ·d2]ü8s÷IôÞ¯^Ç9¢u„~ëAŸï4«M?
K]­ÅàPl@s_ p:°¬ZR”´›JC[CS.h‹ƒïËœ«Æ]–÷ó‚wR×k7X‰k›‘´ù¦=¡«‰¨¨Â')—71ó’c‡Ðúµ
`é.{§p¹ój\Ž{1h{o±Ý=áUÊïGÖŒõ–-BÄm+AZX¶¡
ïHðæ¥JmÙ;…ä¡Ÿˆ¦ ° äšiÉg«$üMk5¤L“’çÊvïâï	,=f“"íἊ5ô¬x6{ɏžID0e¸vçmi'︧ºð9$ò¹÷*£’9ÿ ²TÔ…×>JV¥}Œ}$p[bÔ®*[jzS*8
”·T›Í–ñUîƒwo$áè=LT™ç—~ô·¤ÈÚ$榍q‰„+´kFm)ž‹©i–ËqÞŠ‰à¶ü( ‚•§ •°ò·‡#5ª•µÊ﯅¡X¨šÁ*F#TXJÊ
ušJVÍ&=iÄs1‚3•'fý§5Ñ<=[íÞ­
PÚ;ѱÌ_~Ä££8rÞ
²w;’hDT°>ÈG¬8Á²ÚzŽ®ò®qZcqJêäÞ-ö[ܘbň±çb“Š¶31²n×iƒðÕ;1¶þÉ
ªX‰,ßqÏ$>•î íZ¥Z 1{ç൵+ƒÕµ¥°T$§K]á»Ûï*·¤tMI’ÂZbŽÕiÒ˜}bÓ0£ª5›¨[5Ž^ÝœWøÂÝh°
¢OWun£¤5 a2Z.G2³YL]jåtì”
ä	ÁÓ‘%"©<ÔúÊ°sº UZvä‡ÄiÆÒM .÷V·™ø#kèýií<NçŽôª¦„lË»{ƒ®<
[¦Y‹éƒ}j•*‚±€I‡e&gbéšp9å^!®€ö?ù^àTzo@Q¨Aêœ& [”…üÔ}пF’Hq‚©´{“ëH·?.½%úå»É Á´9¿¼Ò‰Á¼Ì¥Ús¼zW¶aÃhwÖ…ÑÏ$mò´ë:×Ñγ|”x§
µ0Âз$·aÆn µ†šÇ³£‰Ì®ž
õ@kŽ«gtí䢩ÒP×5¤?µÿ m´Ì^ ‡8¸Á8‹”žÆWÑ ¡™„,Ì“»à‹ÃéV¸®á›ÐÇŽBÀ®Ã…Z”ØÛë8;é|Ñ5)7aÕ&2Ù¸÷©ö—Ð;‡¬7"¿"7M·d
ñœÒÌf5”ê ;"Ãp5¯¬3‹ùJÚÝG›½&¯<{òñKÎÖ“3:¦ÀòGPÅS¨;
à‘Ün´öpð±W)z'¬öÀÖ#Xf2& æ
Œ‹é¾"‹\!Ñ9…
0±2A›*ØMÄ $X
끫ØXÖ,X¥ ô'ËnFÍãlqJXçuaJ4¦„ëµ7ê;h"Zã¾Áä£,vÛ‹’N©E(Öu÷)…ÁaÜÇÔkˆ$‘1kmG¨øtÛ>Ì–ª)µT[)BˆõÑ
xB¾B€ÖT¨.¥~ð@VĶr#¸ü*åZNDŽH;âi 
],©£öØpù(šºãö¼T.uCê•4@ÿ GÕÛ)Cx›®0ø#:ÏðFÒbR\(€€Ä
®fã4Þ‰Fä¯HXƒÅ,†öEÑÔÜ]Öv²?tLÃvBY£ú6Êu5ÅAQ³1‘’¬x–HŒÐ‡ ^	¸KwJôÖŽ5×CÚ¨vÜ«/B0$×k°=ðbÇ(Ï)w±A†Á†	11Í=èQšµ626ŒÜ/`G«µ<}—-Ö7KEHÈÉðóȤmݱû±·ø«Snmá=“ä«šmݱŸ¡¶~ó·“äUóJæúòB|E LêŽy´jDÔ$G¢þÐñ7óR8ýÒ…Ç›	WVe#·Ÿ	p·Fx~•ݤF÷0Èÿ K¯æS<6’¡WШ
;´ÿ ¥Êø\Òuî†åÝ–VNœkÒ7oòX¨Á­Ø÷FÎÑä±g÷ÿ M~Çî=p,X´
ÝÌÚÅ‹
’ÃjÖ.ØöÏñ
qïQ¤ÓZE†° =6·]܈ s¸>v•Ž^Ý\wq9r‰Î\¸¡kURÒ$­*‹Nq?Þª*!sŠÆ:TU_u±T+øX¡
®¹¡,ÄâÃBTsÜ$Ø›4m椴zÜK]’’›Pƒ@€#â˜`é¹=I‡fiV•Ôî“nRm+µFPOhÍ0B£
€+¬5c
v•:P'ÒyÎ ‰V~‚Ó†ÖuókDoh$å\*ö%Ю=£«…aȼ½÷Û.-½VŒŠ¼'lyî±1¬3ó#ÞE¿ÔS¤gV£m›<HqÚ,sVºóÆß¼Hïô…¹…Méi‡Ò" µùEîØÏj|ÓøVOuœ"f’aÞÞëx…˜ÌO`dHHš×4K*H$‡5×
ÚÄ
Â×CUÅAŠŒsr»2°ÄÁiÚ±Çéõe•¶_SÕÆÃ3ˆ•-3´‘¸¡‡cgDîÚ¦ÃcX}'êûJè½9ñìÓ­ä±	×ÓûçÁmO”üVÞ¸÷¥ I~“ÒôhhûýÑwxlïZ¹G¡4ž=”)º£ò
®vÆŽ%UqÝ4qž©­hûÎí‡š§é1R±cÜèðà y' °ôy¦£q§Ýï¬;šÖõ„Sÿ ›  z('S†$Ï}*evÚ¾Kýº8ý
¨å	jÛ]´-‚6«¶ÖK+8ÊiS45jrœèËQDüDØ]R”˜SPÃ
xJÕl>
=§\û"—WU¤ÚǼÿ ÂnÁ
GŒÃ
‚õN	D³õNÚíŒÕ;HôyÄÈ©P¹Ä{:?R‘Ô¨âF÷ø£bÅó® JS|‚R÷ivýáâ€Æé¡è³´IئÑT!§˜•Øª‚¬â@q€wnïCWÄ@JU€ê¯m6]Ï:£âx
'+ÒðXvÓ¦Úm=–´7œ $ì“B£~p%ÕŸUþ« N@¼üï~w˜ñø5®—'Ôe»¤5ã//€ž~‰Tþ›Å7•#¤×Íö
pÄ$ùeåì*«ÓŠEØWEÈsßg¦ûvžSsLpºÊW–âµEWöˬH;™!CYõZÃÄf æ#1W.
\uWâ\,\Çfj’<qTbên›Î[vxx£ë 'ö¨1›˜ÀM¼Pÿ H)ƒêêŒA7s,|F“꺸k³9Ìö*ç®;Ö!Ö$Eiž•¹ÒÚ†ýóéÝû¾ÕS®ó$’NÝäŸz¤5r¦ãÄÃD÷Üø!°ø‡Ô&@m™Ì^Ãä­d	q5Lnÿ N;.6½·N|#ä"1Nƒx“ã<3('&ñß
t  ~ªu”1Tb㫨9ê–›–bìd$ߣ=#ÕãÒmU¯eí$EFù5ýYô櫨æ왍Ǘ±ssM]·á¿
0ÕåJRÓªîiƒ+O58ÖñªŠÒx"	\µâá¨i’¤i
—Ö
”
M+M¤ë9‚‰A¦°Qõ¾ßøK~¼Ã‘g…Ö´~÷Ï[3GUœÒ½#…kàÔ®Ò”‰³·dWV‰IP‰Ú8u¹”E
ÖqLj¾êÕCBš{A^Âß;–¨`¯¬ìö
˼	×tìø.tƐm*n¨y4o&Àx¥n¦×î‡aupáÛj8¿m›è¶ã!o½;ß0y^ý×^EÑ¿ÒjzŒ­)vÚÑnÄL
…^ªô× ‡—‚3k	Îý­hï]içå–îÏ*÷ñþ»Ô
CÒjøjÍznˆ´
¹#b'Fô‹
‰v¥'’à'T´ƒHýÍ%M‰ ƒ&ÆÇŒï1 ‘	–Þ
‰i¬s žR-Ÿ kŠ¬á¬7:þ 0ŒÅÒÕ/aÙ¬ÃÝ#Úøœ
©aiVc‰. ¹¦ãµ”
›Yg¦›ÆÎýº°f³7ƒhá·¸­}&D9¡ÂsÉÙÞèŠõØàC™¨ñbFC|´Ü(ŸƒÚÒ-%»'a	Ì¿)ËÇn¿úÿ ÞŽX…4ÊÅH^ôΑí@ù¹Eh¶“L8Çjù
¼ÎåVªóR©Ï5uÃ
V4lZß®=€xÖŸ–ÑÈ
÷”¨°¾__yM1tÉ?uÆþIkÄgæ@þ[¢†°XÃJ£j·:nkÅ¢u‘}âGzö­/IµèŠ¬¼48q¦F°ŽR¼=ûì{´¯RýicS
ÕÛ íNtÍÙï£,w4rêì®»~x(©Uñ§#Ñ&œÕ¤>ÎåÍÓ9’Ö{9eV­[Öjâ²ãu]˜å2›qÑšÕJç0€sÄ|Êëè0튔bÁ>“{×_F`Ø©ºê:µä,v¤ðfc1±"«ÔÍän1#=·
Âøv~H<Q-Ìk7Æ;•L´©ÙC°.7
¯hKL@ävÊâž$´4¸ð‚¦­R–ÂZ7ÕÃj±·¿rÓrªJ_PÕ.#g¤gÀ)©`ª<KžèÝ'ä©èÒ3rwû€Ø¦ÒƒLf¤
,¿I½{Ƕ8‘$KÝU/Oi>½ÐßA¾¿Ü€Óš]Õ; I¾÷ç‚Qi†î¹9ywÔKG˜áñ zQY—§ÃÕZ07§X‚Áh;ÁM)iÌCH-¯T‘ë|A0{Ò½LÚ–TâÖkÜ’dÀ“rmm»”جPF³ÖcbE§T€ÒxKºû’Ó®7±²(\4ŽÃ¸Uu@j™yĵ;³µ!Á¢b.W¤=mõ´êµKk
¸K^ÜÛ#p*Ü14qkZç5ïë†°5Ï%ÍÛ<Õ¤×Ô¥ê†C	Õ´¼ú$ƒÖ“”]Ù¬qÞÚ[4©ý!ûÏ—Áb쳐XµA¬â~`›Çr¸8ìùÝ䫦<>ä÷«?xs´ÇÑ	/á;¹øüÊÈÙà{"@Žïzâ¬[âß‚ U_<ÇŸ½4èN˜ú61®qŠu ¦þF£»äJ_ˆÙÎ~ ÞAã–Ý„Ï—rŠD;xTž‘ô`É«…suãO`?³à™ô
Lý#Íc5öoæØ‚y´´÷«ZR§<&JÇ+éâô´€i!Àˆ0æAoàðLèÖ-2ŸõW.’t^–(KÁmHµV@xÜÇy®Ñø­â^:Ú3w· 7½¹°ñ¸â¹®:',«Mœ—n­Á+Ãbš
LÈ‘ÄnRÓÅœ%¦²‰¨ùQ:¤f‚ "PÕtô¸…cæl…&˜Ú˜Ôkv‹ž+vŠ,=¢v­6—X
y*¥t£«<™:“aï<QÝ&Ó]i4音äzçáíHÚÕxcòãæäÝÔm퐡 `Â)C×ehÀdHP6ÅMEöZ®Í¨	é¾Tr뢘6*¶;´sÙì]ÊŽŽÛíÉwRÈ´up* Ã	‚m´:Û{·”MUë©õ̤êÔo7:ŽÕ
qÏ'E ˆk^uãT€$Ú$Æ{•ŸBP°al¾Ž©ŒÃ^}äA
,º­$Ü]ºÚ.í:‹¤ÜöXnno7X€¥BÂà ±1ã>Œºîϲ=¦6rO]XI¿Œ÷¤zÚ­›¶ 6÷”w\dü~v®ˆÌk«^m<ÿ ¢‰Õ\)ùºŽ;… lîÙÅEŠ®cѾ@vnMÏ,¼“
ñ•ŽBxðÃzãÇç%3ˆ"}Ù•Åî>
BÉú;Ò]V+P˜F_´ßé>
Øše|ï‡ÄOmFæÇ ãqÞ$/xÐx­z`ï9"œÜij‚!7.\Td…9M‡•iŽ‹¾‘50ÞŽn¥ß4ÉôO¹*í^QêËÜÇÌ8=Ž
§s‰'ÂëÙ«á%Pú[O
†ÅP¯VsŽ°.‰,kc¶ ¬A9n˜XÎ-ÞšN["¹QÕ‰ƒMýÁߺXJæÍaLj¾×Ãmã¾ãÚ uñÒþåQô¦¥
/ÄUx:‚ÍÜ’ Đ©ØÝ3V¨‰ÕnÐ6ó*óúK­«…c ¯U òhsý­jóÔj#,ímŒRµ«lbïUTŒÑ8†Ä0œÏr`ð¡¬É	Ї
ë"À²

™	6¥ f¶¢ÚoܱԷ-<Àî)†a¶ž'Ú»¨TXqØæ¶÷Y
ÄHy˜9ÈIW­YÀuMFë
ºÏ’AqÌ4·/Ú
†ô'i$øä­=Ä
Ý|öK×40è|È6p‘0§)o¥ctî§H+CA-“ xØ|ÐXŠç
l8íºð3Ø:³¤¬KX¯UÿÙ
3

�^dg�@srdZd
dl
mZmZ
d
dlZdddddd	d
ddd
dddddddddddddddgZdZeed�
�
Z	eee
��
�
Zeeij��
�
Z
eeij��
�
Zeeij��
�
Zeeg�
�
Zeeeg�
�
�
Zeeed
�
�
�
Zeeedd >�
�
�
Zeee��
�
Zeed!�
�
Zeef�
�
Zeee��
�
Zeij��
Zeij��
Zeij��
Z eej!�
Z"ed"d#���
Z#d$d%�Z$e$�Z$ee$�
Z%e$j&�
[$d&d'�Z'e'�Z'ee'�
Z(['d(d)�Z)Gd*d	�d	ed+�Z*Gd,d�ded+�Z+Gd-d�de+�Z,e,j-e%�

Gd.d�ded+�Z.Gd/d�de.�Z/Gd0d�de/�Z0e0j-e(�

Gd1d
�d
ed+�Z1Gd2d�de1�Z2e2j-e	�

e2j-e�

e2j-e
�

e2j-e�

e2j-e�

e2j-e�

e2j-e�

e2j-e�

e2j-e�

e2j-e�

e2j-e�

e2j-e�

e2j-e�

Gd3d
�d
e1�Z3Gd4d�de2�Z4e4j-e#�

Gd5d�ded+�Z5Gd6d�ded+�Z6Gd7d�de5e1e6�Z7Gd8d�ded+�Z8Gd9d�de7�Z9e9j-e:�

Gd:d�de9�Z;e;j-e�

Gd;d�de7�Z<e<j-e"�

Gd<d�de5�Z=Gd=d�de=e9�Z>e>j-e�

Gd>d�de=e9�Z?e?j-e �

Gd?d�de=�Z@e@j-e�

Gd@d�de<�ZAeAj-eB�

GdAd�de3e7�ZCeCj-eD�

eCj-eE�

eCj-e�

eCj-eF�

GdBd�deC�ZGeGj-eH�

eGj-e
�

GdCd�deC�ZIeIj-eJ�

eIj-e
�

dS)DzjAbstract Base Classes (ABCs) for collections, according to PEP 3119.

Unit tests are in test_collections.
�)�ABCMeta�abstractmethodN�	Awaitable�	Coroutine�
AsyncIterable�
AsyncIterator�AsyncGenerator�Hashable�Iterable�Iterator�	Generator�
Reversible�Sized�	Container�Callable�
Collection�Set�
MutableSet�Mapping�MutableMapping�MappingView�KeysView�	ItemsView�
ValuesView�Sequence�MutableSequence�
ByteStringzcollections.abc��
i��c
csdVS)
N�r r r �&/usr/lib/python3.6/_collections_abc.py�<lambda>8sr"c
�sdS)
Nr r r r r!�_coro:sr#c
Cs
dV
dS)
Nr r r r r!�_ag@sr$c
GsH|j}x<|
D]4}x.|D]"}||j
kr|j
|dkr6tSPqWtSqWd
S)NT)�__mro__�__dict__�NotImplemented)�
C�methods�mro�method�
Br r r!�_check_methodsHs










r-c@s(eZ
dZfZed
d��
Zedd��
ZdS)r	c


Csd
S)Nr
r )
�selfr r r!�__hash__XszHashable.__hash__cCs|tkrt
|
d
�StS)Nr/)r	r-r')�clsr(r r r!�__subclasshook__\s


zHashable.__subclasshook__N)�__name__�
__module__�__qualname__�	__slots__rr/�classmethodr1r r r r!r	Ts)
�	metaclassc@s(eZ
dZfZed
d��
Zedd��
ZdS)rc


cs
dV
dS)
Nr )
r.r r r!�	__await__gszAwaitable.__await__cCs|tkrt
|
d
�StS)Nr8)rr-r')r0r(r r r!r1ks


zAwaitable.__subclasshook__N)r2r3r4r5rr8r6r1r r r r!rcsc@s>eZ
dZfZed
d��
Zed
dd�
�
Zdd�Zedd	��
Z	dS)rc
Cst�
d
S)zcSend a value into the coroutine.
        Return next yielded value or raise StopIteration.
        N)
�
StopIteration)r.�valuer r r!�sendvszCoroutine.sendNcCs4|d
kr|d
kr|
�
|
�}|d
k	r,|j|�
}|�
d
S)zgRaise an exception in the coroutine.
        Return next yielded value or raise StopIteration.
        N)
�with_traceback)r.�typ�val�tbr r r!�throw}s






zCoroutine.throwc

Cs4y|jt
�

Wnt
tfk
r&


Yn
Xtd
�
�
dS)z.Raise GeneratorExit inside coroutine.
        zcoroutine ignored GeneratorExitN)r@�
GeneratorExitr9�RuntimeError)
r.r r r!�close�s



zCoroutine.closecCs|tkrt
|
d
ddd�StS)Nr8r;r@rC)rr-r')r0r(r r r!r1�s

zCoroutine.__subclasshook__)NN)
r2r3r4r5rr;r@rCr6r1r r r r!rrs

c@s(eZ
dZfZed
d��
Zedd��
ZdS)rc


Cst�S)
N)
r)
r.r r r!�	__aiter__�szAsyncIterable.__aiter__cCs|tkrt
|
d
�StS)NrD)rr-r')r0r(r r r!r1�s


zAsyncIterable.__subclasshook__N)r2r3r4r5rrDr6r1r r r r!r�sc@s0eZ
dZfZed
d��
Zdd�Zedd��
ZdS)rc


�st�
d
S)z@Return the next item or raise StopAsyncIteration when exhausted.N)
�StopAsyncIteration)
r.r r r!�	__anext__�szAsyncIterator.__anext__c


Cs|S)
Nr )
r.r r r!rD�s
zAsyncIterator.__aiter__cCs|tkrt
|
d
d�StS)NrFrD)rr-r')r0r(r r r!r1�s

zAsyncIterator.__subclasshook__N)	r2r3r4r5rrFrDr6r1r r r r!r�sc@sFeZ
dZfZd
d�Zedd��
Zeddd�
�
Zdd	�Ze	d
d��
Z
dS)
rc

�s|jd
�
Id
HS)zpReturn the next item from the asynchronous generator.
        When exhausted, raise StopAsyncIteration.
        N)
�asend)
r.r r r!rF�szAsyncGenerator.__anext__c
�st�
d
S)zuSend a value into the asynchronous generator.
        Return next yielded value or raise StopAsyncIteration.
        N)
rE)r.r:r r r!rG�szAsyncGenerator.asendNc�s4|d
kr|d
kr|
�
|
�}|d
k	r,|j|�
}|�
d
S)zyRaise an exception in the asynchronous generator.
        Return next yielded value or raise StopAsyncIteration.
        N)
r<)r.r=r>r?r r r!�athrow�s






zAsyncGenerator.athrowc

�s:y|jt
�
Id
H
Wnt
tfk
r,


Yn
Xtd�
�
d
S)z.Raise GeneratorExit inside coroutine.
        Nz,asynchronous generator ignored GeneratorExit)rHrArErB)
r.r r r!�aclose�s



zAsyncGenerator.aclosecCs|tkrt
|
d
dddd�StS)NrDrFrGrHrI)rr-r')r0r(r r r!r1�s



zAsyncGenerator.__subclasshook__)NN)r2r3r4r5rFrrGrHrIr6r1r r r r!r�s

c@s(eZ
dZfZed
d��
Zedd��
ZdS)r
c


csdS)
Nr )
r.r r r!�__iter__�szIterable.__iter__cCs|tkrt
|
d
�StS)NrJ)r
r-r')r0r(r r r!r1�s


zIterable.__subclasshook__N)r2r3r4r5rrJr6r1r r r r!r
�sc@s0eZ
dZfZed
d��
Zdd�Zedd��
ZdS)rc


Cst�
d
S)zKReturn the next item from the iterator. When exhausted, raise StopIterationN)
r9)
r.r r r!�__next__
szIterator.__next__c


Cs|S)
Nr )
r.r r r!rJ
s
zIterator.__iter__cCs|tkrt
|
d
d�StS)NrJrK)rr-r')r0r(r r r!r1
s

zIterator.__subclasshook__N)	r2r3r4r5rrKrJr6r1r r r r!r
sc@s(eZ
dZfZed
d��
Zedd��
ZdS)r
c


csdS)
Nr )
r.r r r!�__reversed__)
szReversible.__reversed__cCs|tkrt
|
d
d�StS)NrLrJ)r
r-r')r0r(r r r!r1.
s

zReversible.__subclasshook__N)r2r3r4r5rrLr6r1r r r r!r
%
sc@sFeZ
dZfZd
d�Zedd��
Zeddd�
�
Zdd	�Ze	d
d��
Z
dS)
rc

Cs
|jd
�
S)z^Return the next item from the generator.
        When exhausted, raise StopIteration.
        N)
r;)
r.r r r!rK9
szGenerator.__next__c
Cst�
d
S)zcSend a value into the generator.
        Return next yielded value or raise StopIteration.
        N)
r9)r.r:r r r!r;?
szGenerator.sendNcCs4|d
kr|d
kr|
�
|
�}|d
k	r,|j|�
}|�
d
S)zgRaise an exception in the generator.
        Return next yielded value or raise StopIteration.
        N)
r<)r.r=r>r?r r r!r@F
s






zGenerator.throwc

Cs4y|jt
�

Wnt
tfk
r&


Yn
Xtd
�
�
dS)z.Raise GeneratorExit inside generator.
        zgenerator ignored GeneratorExitN)r@rAr9rB)
r.r r r!rCS
s



zGenerator.closecCs|tkrt
|
d
dddd�StS)NrJrKr;r@rC)rr-r')r0r(r r r!r1]
s



zGenerator.__subclasshook__)NN)r2r3r4r5rKrr;r@rCr6r1r r r r!r5
s

c@s(eZ
dZfZed
d��
Zedd��
ZdS)rc


Csd
S)Nr
r )
r.r r r!�__len__k
sz
Sized.__len__cCs|tkrt
|
d
�StS)NrM)rr-r')r0r(r r r!r1o
s


zSized.__subclasshook__N)r2r3r4r5rrMr6r1r r r r!rg
sc@s(eZ
dZfZed
d��
Zedd��
ZdS)rc
Csd
S)NFr )r.�
xr r r!�__contains__z
szContainer.__contains__cCs|tkrt
|
d
�StS)NrO)rr-r')r0r(r r r!r1~
s


zContainer.__subclasshook__N)r2r3r4r5rrOr6r1r r r r!rv
sc@seZ
dZfZed
d��
ZdS)rcCs|tkrt
|
d
dd�StS)NrMrJrO)rr-r')r0r(r r r!r1�
s

zCollection.__subclasshook__N)r2r3r4r5r6r1r r r r!r�
sc@s(eZ
dZfZed
d��
Zedd��
ZdS)rc

Osd
S)NFr )r.�args�kwdsr r r!�__call__�
szCallable.__call__cCs|tkrt
|
d
�StS)NrR)rr-r')r0r(r r r!r1�
s


zCallable.__subclasshook__N)r2r3r4r5rrRr6r1r r r r!r�
sc@s�eZ
dZd
ZfZdd�Zdd�Zdd�Zdd	�Zd
d�Z	e
dd
��
Zdd�ZeZ
dd�Zdd�ZeZdd�Zdd�Zdd�ZeZdd�ZdS)raZ
A set is a finite, iterable container.

    This class provides concrete generic implementations of all
    methods except for __contains__, __iter__ and __len__.

    To override the comparisons (presumably for speed, as the
    semantics are fixed), redefine __le__ and __ge__,
    then the other operations will automatically follow suit.
    cCs@t|
t
�stSt|�
t|
�
kr"d
Sx|D]}||
kr(d
Sq(WdS)NFT)�
isinstancerr'�len)r.�other�elemr r r!�__le__�
s









z
Set.__le__cCs(t|
t
�stSt|�
t|
�
ko&|j|
�
S)
N)rSrr'rTrW)r.rUr r r!�__lt__�
s



z
Set.__lt__cCs(t|
t
�stSt|�
t|
�
ko&|j|
�
S)
N)rSrr'rT�__ge__)r.rUr r r!�__gt__�
s



z
Set.__gt__cCs@t|
t
�stSt|�
t|
�
kr"d
Sx|
D]}||kr(d
Sq(WdS)NFT)rSrr'rT)r.rUrVr r r!rY�
s









z
Set.__ge__cCs(t|
t
�stSt|�
t|
�
ko&|j|
�
S)
N)rSrr'rTrW)r.rUr r r!�__eq__�
s



z
Set.__eq__cCs||
�
S)
z�Construct an instance of the class from any iterable input.

        Must override this method if the class constructor signature
        does not accept an iterable for an input.
        r )r0�itr r r!�_from_iterable�
szSet._from_iterablecs&t|
t
�stS�j�f
d
d�|
D�
�
S)Nc
3s|]}
|
�kr|
V
qdS)
Nr )�.0r:)
r.r r!�	<genexpr>�
szSet.__and__.<locals>.<genexpr>)rSr
r'r])r.rUr )
r.r!�__and__�
s



zSet.__and__cCsx|
D]}||krd
SqWdS)z1Return True if two sets have a null intersection.FTr )r.rUr:r r r!�
isdisjoint�
s



zSet.isdisjointcCs*t|
t
�stSd
d�||
fD�
}|j|�
S)Nc
ss|]}
|
D]
}|V
q
qdS)
Nr )r^�
s�
er r r!r_�
szSet.__or__.<locals>.<genexpr>)rSr
r'r])r.rU�chainr r r!�__or__�
s




z
Set.__or__cs:t�t
�s"t�t�stS|j��
�|j�f
d
d�|D�
�
S)Nc
3s|]}
|
�kr|
V
qdS)
Nr )r^r:)
rUr r!r_�
s
zSet.__sub__.<locals>.<genexpr>)rSrr
r'r])r.rUr )
rUr!�__sub__�
s








zSet.__sub__cs:t|
t
�s"t|
t�stS�j|
�
}
�j�f
d
d�|
D�
�
S)Nc
3s|]}
|
�kr|
V
qdS)
Nr )r^r:)
r.r r!r_�
s
zSet.__rsub__.<locals>.<genexpr>)rSrr
r'r])r.rUr )
r.r!�__rsub__�
s








zSet.__rsub__cCs2t|
t
�s"t|
t�stS|j|
�
}
||
|
|BS)
N)rSrr
r'r])r.rUr r r!�__xor__s








zSet.__xor__c
Cs�tj
}
d
|
d}t|�
}d|d}||M}x4|D],}t|�
}|||d>AdAdN}||M}q4W|dd}||M}||
kr�||d8}|d
kr�d	}|S)a+Compute the hash value of a set.

        Note that we don't define __hash__: not all sets are hashable.
        But if you define a hashable set type, its __hash__ should
        call this function.

        This must be compatible __eq__.

        All sets ought to compare equal if they contain the same
        elements, regardless of how they are implemented, and
        regardless of the order of the elements; so there's not much
        freedom for __eq__ or __hash__.  We match the algorithm used
        by the built-in frozenset type.
        �riM��r�i�M[l�4~2i�

i��6i��8#�����)�sys�maxsizerT�hash)r.�MAX�MASK�
n�
hrN�hxr r r!�_hash	s 















z	Set._hashN)r2r3r4�__doc__r5rWrXrZrYr[r6r]r`�__rand__rare�__ror__rfrgrh�__rxor__rtr r r r!r�
s$


	c@sdeZ
dZd
ZfZedd��
Zedd��
Zdd�Zdd	�Z	d
d�Z
dd
�Zdd�Zdd�Z
dd�ZdS)ra�
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
Cst�
d
S)zAdd an element.N)
�NotImplementedError)r.r:r r r!�add:szMutableSet.addc
Cst�
d
S)z8Remove an element.  Do not raise an exception if absent.N)
ry)r.r:r r r!�discard?szMutableSet.discardcCs|
|krt|
�
�
|j
|
�

d
S)z5Remove an element. If not a member, raise a KeyError.N)�KeyErrorr{)r.r:r r r!�removeDs

zMutableSet.removec
Cs<t|�
}
yt
|
�
}Wntk
r,


t�
YnX|j|�

|S)
z2Return the popped value.  Raise KeyError if empty.)�iter�nextr9r|r{)r.r\r:r r r!�popJs







zMutableSet.popc

Cs,yx|j�
qWWnt
k
r&


YnXd
S)z6This is slow (creates N new iterators!) but effective.N)r�r|)
r.r r r!�clearTs




zMutableSet.clearcCsx|
D]}|j|�

qW|S)
N)
rz)r.r\r:r r r!�__ior__\s



zMutableSet.__ior__cCs x||
D]}|j|�

q
W|S)
N)
r{)r.r\r:r r r!�__iand__as


zMutableSet.__iand__cCsV|
|kr|j�
n@t
|
t�s&|j|
�
}
x*|
D]"}||krD|j|�

q,|j|�

q,W|S)
N)r�rSrr]r{rz)r.r\r:r r r!�__ixor__fs










zMutableSet.__ixor__cCs.|
|kr|j�
nx|
D]}|j
|�

qW|S)
N)r�r{)r.r\r:r r r!�__isub__ss






zMutableSet.__isub__N)r2r3r4rur5rrzr{r}r�r�r�r�r�r�r r r r!r,s


c@sReZ
dZfZed
d��
Zddd�
Zdd�Zdd	�Zd
d�Z	dd
�Z
dd�ZdZdS)rc
Cst�
dS)
N)
r|)r.�keyr r r!�__getitem__�szMapping.__getitem__NcCs"y||
Stk
r


|SXd
S)z<D.get(k[,d]) -> D[k] if k in D, else d.  d defaults to None.N)
r|)r.r��defaultr r r!�get�s


zMapping.getcCs*y||

Wntk
r 


d
SXdSdS)NFT)
r|)r.r�r r r!rO�s




zMapping.__contains__c

Cst|�
S)
z:D.keys() -> a set-like object providing a view on D's keys)
r)
r.r r r!�keys�szMapping.keysc

Cst|�
S)
z<D.items() -> a set-like object providing a view on D's items)
r)
r.r r r!�items�sz
Mapping.itemsc

Cst|�
S)
z6D.values() -> an object providing a view on D's values)
r)
r.r r r!�values�szMapping.valuescCs&t|
t
�stSt|j��
t|
j��
kS)
N)rSrr'�dictr�)r.rUr r r!r[�s



zMapping.__eq__)
N)
r2r3r4r5rr�r�rOr�r�r�r[rLr r r r!r�s

c@s(eZ
dZd	Zdd�Zdd�Zdd�ZdS)
r�_mappingcCs
|
|_dS)
N)
r�)r.�mappingr r r!�__init__�s
zMappingView.__init__c

Cs
t|j
�
S)
N)rTr�)
r.r r r!rM�s
zMappingView.__len__c

Cs
d
j|�
S)Nz&{0.__class__.__name__}({0._mapping!r}))
�format)
r.r r r!�__repr__�s
zMappingView.__repr__N)
r�)r2r3r4r5r�rMr�r r r r!r�sc@s,eZ
dZfZed
d��
Zdd�Zdd�ZdS)rcCst|
�
S)
N)
�set)r.r\r r r!r]�szKeysView._from_iterablecCs
|
|jkS)
N)
r�)r.r�r r r!rO�s
zKeysView.__contains__c

cs|jEdH
dS)
N)
r�)
r.r r r!rJ�s
zKeysView.__iter__N)r2r3r4r5r6r]rOrJr r r r!r�sc@s,eZ
dZfZed
d��
Zdd�Zdd�ZdS)rcCst|
�
S)
N)
r�)r.r\r r r!r]�szItemsView._from_iterablecCs@|
\}}y|j|}Wnt
k
r*


d
SX||kp:||kSdS)NF)r�r|)r.�itemr�r:�
vr r r!rO�s




zItemsView.__contains__c
cs$x|jD]}
|
|j|
fV
qWdS)
N)
r�)r.r�r r r!rJ�s

zItemsView.__iter__N)r2r3r4r5r6r]rOrJr r r r!r�s	c@s eZ
dZfZd
d�Zdd�ZdS)rcCs2x,|jD]"}|j|}||
ks&||
krd
SqWdS)NTF)
r�)r.r:r�r�r r r!rO�s






zValuesView.__contains__c
cs x|jD]}
|j|
V
qWdS)
N)
r�)r.r�r r r!rJ�s

zValuesView.__iter__N)r2r3r4r5rOrJr r r r!r�sc@s\eZ
dZfZed
d��
Zedd��
Ze�Zef
dd�
Z	dd�Z
d	d
�Zdd�Zddd�
Z
d
S)rc
Cst�
dS)
N)
r|)r.r�r:r r r!�__setitem__szMutableMapping.__setitem__c
Cst�
dS)
N)
r|)r.r�r r r!�__delitem__szMutableMapping.__delitem__cCs<y||
}Wn tk
r,


||j
kr(�|SX||
=|Sd
S)z�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)r|�_MutableMapping__marker)r.r�r�r:r r r!r�s






zMutableMapping.popc
Cs@ytt
|�
�
}
Wntk
r(


t�
YnX||
}||
=|
|fS)
z�D.popitem() -> (k, v), remove and return some (key, value) pair
           as a 2-tuple; but raise KeyError if D is empty.
        )rr~r9r|)r.r�r:r r r!�popitem$s






zMutableMapping.popitemc

Cs,yx|j�
qWWnt
k
r&


YnXd
S)z,D.clear() -> None.  Remove all items from D.N)r�r|)
r.r r r!r�0s




zMutableMapping.clearcOs�|std
�
�
|^
}}t
|�
dkr0tdt
|�
�
�
|r�|d}t|t�rbx^|D]}||||<qLWnDt|d�r�x8|j�D]}||||<qvWnx|D]\}}|||<q�Wx|
j�D]\}}|||<q�WdS)aK
 D.update([E, ]**F) -> None.  Update D from mapping/iterable E and F.
            If E present and has a .keys() method, does:     for k in E: D[k] = E[k]
            If E present and lacks .keys() method, does:     for (k, v) in E: D[k] = v
            In either case, this is followed by: for k, v in F.items(): D[k] = v
        z@descriptor 'update' of 'MutableMapping' object needs an argumentrz+update expected at most 1 arguments, got %dr
r�N)�	TypeErrorrTrSr�hasattrr�r�)rPrQr.rUr�r:r r r!�update8s$

















zMutableMapping.updateNcCs*y||
Stk
r$


|||
<YnX|S)
z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D)
r|)r.r�r�r r r!�
setdefaultSs




zMutableMapping.setdefault)
N)r2r3r4r5rr�r��objectr�r�r�r�r�r�r r r r!r�sc@sJeZ
dZd
ZfZedd��
Zdd�Zdd�Zdd	�Z	ddd
�
Z
dd�ZdS)rz�All the operations on a read-only sequence.

    Concrete subclasses must override __new__ or __init__,
    __getitem__, and __len__.
    c
Cst�
dS)
N)
�
IndexError)r.�indexr r r!r�kszSequence.__getitem__c
cs>d
}
y x||
}|V
|
d7}
qWWntk
r8


dSXdS)Nr
r)
r�)r.�
ir�r r r!rJos







zSequence.__iter__cCs&x |D]}||
ks||
krd
SqWdS)NTFr )r.r:r�r r r!rOys




zSequence.__contains__c
cs(x"tt
t|�
�
�
D]}
||
V
qWdS)
N)�reversed�rangerT)r.r�r r r!rLs

zSequence.__reversed__r
NcCs�|d
k	r"|dkr"tt
|�
|d�}|d
k	r>|dkr>|t
|�
7}|}xT|d
ksT||kr�y ||}||
ksn||
krr|SWntk
r�


PYnX|d7}qDWt�
d
S)z�S.index(value, [start, [stop]]) -> integer -- return first index of value.
           Raises ValueError if the value is not present.

           Supporting start and stop arguments is optional, but
           recommended.
        Nr
r)�maxrTr��
ValueError)r.r:�start�stopr�r�r r r!r��s











zSequence.indexcst�f
d
d�|D�
�
S)zBS.count(value) -> integer -- return number of occurrences of valuec
3s"|]}
|
�ks|
�krdV
qd
S)rNr )r^r�)
r:r r!r_�sz!Sequence.count.<locals>.<genexpr>)
�sum)r.r:r )
r:r!�count�szSequence.count)r
N)r2r3r4rur5rr�rJrOrLr�r�r r r r!ras

c
@seZ
dZd
ZfZdS)rzMThis unifies bytes and bytearray.

    XXX Should add all their methods.
    N)r2r3r4rur5r r r r!r�sc@sneZ
dZfZed
d��
Zedd��
Zedd��
Zdd�Zd	d
�Z	dd�Z
d
d�Zddd�
Zdd�Z
dd�ZdS)rc
Cst�
dS)
N)
r�)r.r�r:r r r!r��szMutableSequence.__setitem__c
Cst�
dS)
N)
r�)r.r�r r r!r��szMutableSequence.__delitem__c
Cst�
d
S)z3S.insert(index, value) -- insert value before indexN)
r�)r.r�r:r r r!�insert�szMutableSequence.insertcCs|jt
|�
|
�
d
S)z:S.append(value) -- append value to the end of the sequenceN)r�rT)r.r:r r r!�append�szMutableSequence.appendc

Cs,yx|j�
qWWnt
k
r&


YnXd
S)z,S.clear() -> None -- remove all items from SN)r�r�)
r.r r r!r��s




zMutableSequence.clearc
CsLt|�
}
x>t
|
d
�
D].}||
|d||||<||
|d<qWdS)z!S.reverse() -- reverse *IN PLACE*rirN)rTr�)r.rqr�r r r!�reverse�s

zMutableSequence.reversecCsx|
D]}|j|�

qWd
S)zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)
r�)r.r�r�r r r!�extend�s

zMutableSequence.extendrcCs||
}||
=|S)
z�S.pop([index]) -> item -- remove and return item at index (default last).
           Raise IndexError if list is empty or index is out of range.
        r )r.r�r�r r r!r��s

zMutableSequence.popcCs||j|
�
=d
S)zvS.remove(value) -- remove first occurrence of value.
           Raise ValueError if the value is not present.
        N)
r�)r.r:r r r!r}�szMutableSequence.removecCs|j|
�

|S)
N)
r�)r.r�r r r!�__iadd__�s


zMutableSequence.__iadd__Nrk)
rk)r2r3r4r5rr�r�r�r�r�r�r�r�r}r�r r r r!r�s	
)Kru�abcrrrl�__all__r2�typer~�bytes_iterator�	bytearray�bytearray_iteratorr��dict_keyiteratorr��dict_valueiteratorr��dict_itemiterator�
list_iteratorr��list_reverseiteratorr��range_iterator�longrange_iteratorr��set_iterator�str_iterator�tuple_iterator�zip�zip_iterator�	dict_keys�dict_values�
dict_itemsr&�mappingproxy�	generatorr#�	coroutinerCr$�async_generatorr-r	rr�registerrrrr
rr
rrrrrr�	frozensetrrrrrrrr�r�tuple�str�
memoryviewr�bytesr�listr r r r!�<module>s�









	





















)
0
























/



O
2



\
=






	


A