>Sr/SQrSSKJrJr SSKJrJr SSKJ r SSK J r SSKrSS KJr "S S \5r"S S \5rSrSr\\4Sjr\\4SjrSrSr\"SS5rSSjr g!\a SS KJr NKf=f)zEfunctools.py - Tools for working with functions and callable objects ) update_wrapperwrapsWRAPPER_ASSIGNMENTSWRAPPER_UPDATEStotal_ordering cmp_to_key lru_cachereducepartial)r r )MutableMapping namedtuple)recursive_repr)proxyN) allocate_lockc\rSrSrSrSrg)_Link)prevnextkey __weakref__N)__name__ __module__ __qualname____firstlineno__ __slots____static_attributes__r*lib/third_party/functools32/functools32.pyrrs4Ir rcn\rSrSrSrSr\R\\ 4Sjr\R4Sjr Sr Sr Sr SS jrSS jrS r\R$=rr\R(r\R*r\R,r\R.r\"5r\4S jrSSjr\"5S5rSrSr\ SSj5r!Sr"Sr#g ) OrderedDictz)Dictionary that remembers insertion orderc.[U5S:a[S[U5-5eUR UR"U0UD6 g![aC [ 5Ul[ UR 5=UlnU=UlUl0Ul N_f=f)zInitialize an ordered dictionary. The signature is the same as regular dictionaries, but keyword arguments are not recommended because their insertion order is arbitrary. rz$expected at most 1 arguments, got %dN) len TypeError_OrderedDict__rootAttributeErrorr_OrderedDict__hardroot_proxyrr_OrderedDict__map_OrderedDict__update)selfargskwdsroots r!__init__OrderedDict.__init__.s t9q=BSYNO O  KK t$t$  #gDO!'!8 8DK$$( (DI DJ  s AA BBcX;aVU"5=URU'nURnURnXUsUlUlUlXhlU"U5UlU"XU5 g)z!od.__setitem__(i, y) <==> od[i]=yN)r,r(rrr) r.rvalue dict_setitemrLinklinkr1lasts r! __setitem__OrderedDict.__setitem__?s] ?%)V +DJJsOd;;D99D-1 *DIty$(Id DIT&r cU"X5 URRU5nURnURnXTlXElg)z od.__delitem__(y) <==> del od[y]N)r,poprr)r.r dict_delitemr8 link_prev link_nexts r! __delitem__OrderedDict.__delitem__Ms: Tzz~~c"II II ""r c## URnURnX!La!URv URnX!LaM gg7f)zod.__iter__() <==> iter(od)N)r(rrr.r1currs r!__iter__OrderedDict.__iter__X9{{yy((N99D ;AAc## URnURnX!La!URv URnX!LaM gg7f)z#od.__reversed__() <==> reversed(od)N)r(rrrDs r! __reversed__OrderedDict.__reversed__arHrIcURnU=UlUlURR 5 [ R U5 g)z.od.clear() -> None. Remove all items from od.N)r(rrr,cleardict)r.r1s r!rNOrderedDict.clearjs5{{ $$ DI  4r c@U(d [S5eURnU(a%URnURnX$lXBlO$URnURnXRlX%lURnUR U [ RX5nXg4$)zod.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. zdictionary is empty)KeyErrorr(rrrr,rOr=)r.r9r1r8r?r@rr5s r!popitemOrderedDict.popitemqs 01 1{{ 99D I!N!I99D I!I!Nhh JJsO#zr c*URUnURnURnXTlXElURnU(a'URnX#lXclU=UlUlgURnXclXslU=UlUlg)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,rrr()r.rr9r8r?r@r1firsts r! move_to_endOrderedDict.move_to_ends{zz#II II ""{{ 99DII$( (DI IIEII%) )DI r c[Rn[U5S-nU"UR5nX1"UR5S-- nX1"UR 5U-- nX1"UR 5U-- nU$)Nr)_sys getsizeofr&__dict__r,r*r()r.sizeofnsizes r! __sizeof__OrderedDict.__sizeof__ss IMdmm$ tzz"Q&& t'!++ t{{#a'' r cRX;aXnX U$X RLa [U5eU$)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__markerrR)r.rdefaultresults r!r=OrderedDict.pops3 ;YF M mm #3- r Nc X;aX$X U'U$)zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr)r.rres r! setdefaultOrderedDict.setdefaults ;9 S r cU(dURR<S3$URR<S[UR55<S3$)zod.__repr__() <==> repr(od)z()()) __class__rlistitemsr.s r!__repr__OrderedDict.__repr__s:!^^446 6>>22D4FGGr c UVs/sHoX/PM nn[U5R5n[[55HnURUS5 M U(aURU4U4$URU44$s snf)z%Return state information for picklingN)varscopyr#r=rn)r.krp inst_dicts r! __reduce__OrderedDict.__reduce__su'+,t!TWt,JOO% km$A MM!T "% NNUHi8 8~~x'' -sBc$URU5$)z!od.copy() -> a shallow copy of od)rnrqs r!rvOrderedDict.copys~~d##r c.U"5nUHnX#U'M U$)zoOD.fromkeys(S[, v]) -> New ordered dictionary with keys from S. If not specified, the value defaults to None. r)clsiterabler5r.rs r!fromkeysOrderedDict.fromkeyss! uCI r c[U[5(aV[U5[U5:H=(a8 [S[ UR 5UR 5555$[ RX5$)zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive while comparison to a regular mapping is order-insensitive. c3.# UH upX:Hv M g7fNr).0pqs r! %OrderedDict.__eq__..sI(Hqt(Hs) isinstancer#r&allziprprO__eq__r.others r!rOrderedDict.__eq__s] e[ ) )t9c%j(JIDJJL%++-(HII J{{4''r ) __hardroot__map__root)Tr)$rrrr__doc__r2rOr:r+rrArFrKrNrSrWrar updater-keysvaluesrp__ne__objectrdr=ri_recursive_reprrrryrv classmethodrrrrr r!r#r#s/%$"&!1!1e '-1,<,< #.*0'---FX   D  " "F  E  " "FxH' HH ($(r r#)rrr)r]cXlUHn[X5n[XU5 M UH'n[X5R [X055 M) U$![a M[f=f)aUpdate a wrapper function to look like the wrapped function wrapper is the function to be updated wrapped is the original function assigned is a tuple naming the attributes assigned directly from the wrapped function to the wrapper function (defaults to functools.WRAPPER_ASSIGNMENTS) updated is a tuple naming the attributes of the wrapper that are updated with the corresponding attribute from the wrapped function (defaults to functools.WRAPPER_UPDATES) ) __wrapped__getattrsetattrr)r)wrapperwrappedassignedupdatedattrr5s r!rrsp" *G*E G5 ) %%ggR&@A N   s A A%$A%c [[UXS9$)adDecorator factory to apply update_wrapper() to a wrapper function Returns a decorator that invokes update_wrapper() with the decorated function as the wrapper argument and the arguments to wraps() as the remaining arguments. Default arguments are as for update_wrapper(). This is a convenience function to simplify applying partial() to update_wrapper(). rrr)r rrs r!rrs >7$ 77r cxSS4SS4SS4/SS4SS 4SS 4/SS 4SS 4SS 4/SS4SS4SS4/S.n[[U55[U5-nU(d [S5e[U5nXH=upEXB;dM XEl[ [ U5RUl[XU5 M? U$)z6Class decorator that fills in missing ordering methods__gt__c*X:=(d X:H(+$rrrs r! total_ordering.."t|7Tt}2Ur __le__c X:=(d X:H$rrrs r!rr#$,2O$-2Or __ge__c X:+$rrrs r!rr$d2Br c"X::+=(d X:H$rrrs r!rr%sd2C2Tt}2Tr __lt__c"X:*=(a X:X+$rrrs r!rr&$-2UDU2Ur c X::+$rrrs r!rr'd2Cr c*X:=(d X:H(+$rrrs r!rr(rr c X:=(d X:H$rrrs r!rr)rr c X:+$rrrs r!rr*rr c"X:+=(d X:H$rrrs r!rr+st3D2V2Vr c"X:=(a X:X+$rrrs r!rr,rr c X:+$rrrs r!rr-rr )rrrrz6must define at least one ordering operation: < > <= >=) setdir ValueErrormaxrrintrr)r~convertrootsr1opnameopfuncs r!rrsUVOPBCETUUVCDFUVOPBCEVWUVCDF G CMCL (E QRR u:D!-  $O$S&199FN C ( ( Jr c,^"U4SjS[5nU$)z,Convert a cmp= function into a key= functioncn>\rSrSrS/rSrU4SjrU4SjrU4SjrU4Sjr U4Sjr U4S jr S r S r g ) zcmp_to_key..Ki<objcXlgrr)r.rs r!r2cmp_to_key..K.__init__>sHr cD>T"URUR5S:$Nr rr.rmycmps r!rcmp_to_key..K.__lt__@599-1 1r cD>T"URUR5S:$rrrs r!rcmp_to_key..K.__gt__Brr cD>T"URUR5S:H$rrrs r!rcmp_to_key..K.__eq__D599-2 2r cD>T"URUR5S:*$rrrs r!rcmp_to_key..K.__le__Frr cD>T"URUR5S:$rrrs r!rcmp_to_key..K.__ge__Hrr cD>T"URUR5S:g$rrrs r!rcmp_to_key..K.__ne__Jrr Nr)rrrrrr2rrrrrr__hash__r)rsr!Kcmp_to_key..K<s2G   2 2 3 3 3 3r r)r)rrs` r!rr:sF" Hr CacheInfozhits misses maxsize currsizec@^[[[[4U4SjjnU$)aLeast-recently-used cache decorator. If *maxsize* is set to None, the LRU features are disabled and the cache can grow without bound. Arguments to the cached function must be hashable. View the cache statistics named tuple (hits, misses, maxsize, currsize) with f.cache_info(). Clear the cache and statistics with f.cache_clear(). Access the underlying function with f.__wrapped__. See: http://en.wikipedia.org/wiki/Cache_algorithms#Least_Recently_Used cn>^^^^^^^ ^ ^ ^ ^ ^S/S/sm m[54m [5m Tc&[5m[T5UUU U UUUU4Sj5nOB[ 5mTR m TR m [T5UUU U U U UU UUUUU4 Sj5nUU UU UU4SjnUU U U4SjnXelXulU$)Nr c>UnU(a"UTT "T "UR555-- nTUnTS==S- ss'U$!Ta Of=fT "U0UD6nUTU'TS==S- ss'U$Nr rrp) r/r0rrfrRcachehitskwd_markmissessortedtuple user_functions r!r7lru_cache..decorating_function..wrapperos8eF4::<,@&AAAC"3ZFGqLG!M&55#c q Q  sAA  A c> UnU(a"UT T"T"UR555-- nT  TUnT"U5 TS==S- ss'UsSSS5 $!Ta Of=fSSS5 O!,(df  O=fT"U0UD6nT  UTU'T S==S- ss'T "T5T :aT"S5 SSS5 U$!,(df  U$=frr)r/r0rrfrRr cache_popitem cache_renewrrr&lockmaxsizerrrrs r!rrs8eF4::<,@&AAAC!&s#C(Q1 % T $TT'55!'E#J1INI5zG+%a(   T  s4A,AAA,AA,, A:'B88 Cc r>T [TSTSTT"T55sSSS5 $!,(df  g=f)zReport cache statisticsr N) _CacheInfo)rrr&rrrsr! cache_info:lru_cache..decorating_function..cache_infos*!$q'6!9gs5zJs( 6cr>T TR5 S=TS'TS'SSS5 g!,(df  g=f)z$Clear the cache and cache statisticsr N)rN)rrrrsr! cache_clear;lru_cache..decorating_function..cache_clears+ &''Q&)s( 6) rLockrOrr#rSrWrr)rrrr&rRrrrrrrrrrrrs````` @@@@@@@r!decorating_function&lru_cache..decorating_functionessQC fH;v ?FE = !  "  ME!MMM++K = !   " ( K K  ( ( ()r )rrr&rR)rrs` r!rrQs*Fh@D r )d)!r__all__ _functoolsr r collectionsr r reprlib32rrweakrefrr+sysr[threadrr ImportError_dummy_thread32rrrOr#rrrrrrrrrr r!r s M'28#7,5F5O($O(h<2,:)# 76 * %C D Vy 767sA++ A:9A: