>dZgdZddlmZmZddlmZmZddlm Z ddl m Z ddlZ dd lmZGd d eZGd d eZdZdZeefdZeefdZdZdZeddZddZ y#e$r dd lmZYGwxYw)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_lockceZdZdZy)_Link)prevnextkey __weakref__N)__name__ __module__ __qualname__ __slots__*lib/third_party/functools32/functools32.pyrrs4IrrcXeZdZdZdZej eefdZejfdZ dZ dZ dZ ddZ dd Zd Zej"xZZej&Zej(Zej*Zej,ZeZefd Zdd ZedZdZdZeddZ dZ!y ) OrderedDictz)Dictionary that remembers insertion orderc*t|dkDrtdt|z |j|j|i|y#t$rCt |_t |j x|_}|x|_|_i|_ Y^wxYw)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__zOrderedDict.__init__.s t9q=BSYNO O  KK  t$t$  #gDO!'!8 8DK$$( (DI DJ  s AA BBc||vrX|x|j|<}|j}|j}|||c|_|_|_||_|||_||||y)z!od.__setitem__(i, y) <==> od[i]=yN)r(r$rrr) r*rvalue dict_setitemrLinklinkr-lasts r __setitem__zOrderedDict.__setitem__?se d?%)V +DJJsOd;;D99D-14 *DIty$(DId DIT3&rc||||jj|}|j}|j}||_||_y)z od.__delitem__(y) <==> del od[y]N)r(poprr)r*r dict_delitemr3 link_prev link_nexts r __delitem__zOrderedDict.__delitem__Ms@ T3zz~~c"II II " " rc#K|j}|j}||ur |j|j}||uryyw)zod.__iter__() <==> iter(od)N)r$rrr*r-currs r__iter__zOrderedDict.__iter__X>{{yy$((N99D$ ;AAc#K|j}|j}||ur |j|j}||uryyw)z#od.__reversed__() <==> reversed(od)N)r$rrr=s r __reversed__zOrderedDict.__reversed__ar@rAc|j}|x|_|_|jj t j |y)z.od.clear() -> None. Remove all items from od.N)r$rrr(cleardict)r*r-s rrEzOrderedDict.clearjs5{{ $$ DI  4rc8|s td|j}|r'|j}|j}||_||_n&|j}|j}||_||_|j}|j |=t j||}||fS)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(rFr7)r*r4r-r3r9r:rr0s rpopitemzOrderedDict.popitemqs 01 1{{ 99D I!IN!DI99D I!DI!INhh JJsOs#Ezrc,|j|}|j}|j}||_||_|j}|r)|j}||_||_|x|_|_y|j}||_||_|x|_|_y)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*rr4r3r9r:r-firsts r move_to_endzOrderedDict.move_to_endszz#II II " " {{ 99DDIDI$( (DI IIEDIDI%) )DI rctj}t|dz}||j}|||jdzz }|||j |zz }|||j |zz }|S)Nr)_sys getsizeofr"__dict__r(r&r$)r*sizeofnsizes r __sizeof__zOrderedDict.__sizeof__ss IMdmm$ tzz"Q&& t'!++ t{{#a'' rcT||vr ||}||=|S||jur 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__markerrH)r*rdefaultresults rr7zOrderedDict.pops; $;#YFS M dmm #3- rNc"||vr||S|||<|S)zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr)r*rrXs r setdefaultzOrderedDict.setdefaults! $;9 S rc|s|jjdS|jjdt|jdS)zod.__repr__() <==> repr(od)z()()) __class__rlistitemsr*s r__repr__zOrderedDict.__repr__s:!^^446 6>>22D4FGGrc|Dcgc] }|||g }}t|j}ttD]}|j|d|r|j|f|fS|j|ffScc}w)z%Return state information for picklingN)varscopyr r7r_)r*kra inst_dicts r __reduce__zOrderedDict.__reduce__sy'+,t!!T!Wt,JOO% km$A MM!T "% NNUHi8 8~~x'' -sA9c$|j|S)z!od.copy() -> a shallow copy of od)r_rbs rrfzOrderedDict.copys~~d##rc,|}|D]}|||< |S)zOD.fromkeys(S[, v]) -> New ordered dictionary with keys from S. If not specified, the value defaults to None. r)clsiterabler0r*rs rfromkeyszOrderedDict.fromkeyss# uCDI rct|trQt|t|k(xr8tdt |j |j DSt j||S)zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive while comparison to a regular mapping is order-insensitive. c3,K|] \}}||k(ywNr).0pqs r z%OrderedDict.__eq__..sI(H1q!t(Hs) isinstancer r"allziprarF__eq__r*others rryzOrderedDict.__eq__s\ e[ )t9c%j(JIDJJL%++-(HII J{{4''r)Trq)"rrr__doc__r.rFr5r'rr;r?rCrErIrLrUr updater)keysvaluesra__ne__objectrWr7r[_recursive_reprrcrirf classmethodrnryrrrr r s/%$"&!1!1e '-1,<,< #.*0'---FX   D  " "F  E  " "FxH' HH ($(rr )rrr|)rQc||_|D]} t||}t||||D](}t||j t||i*|S#t$rYYwxYw)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})wrapperwrappedassignedupdatedattrr0s rrrsz"G *GT*E GT5 ) %%ggtR&@A N   s A A$#A$c(tt|||S)aDecorator 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 rrrs >7$g 77rcnddfddfddfgddfdd fdd fgdd fdd fdd fgddfddfddfgd}tt|t|z}|s tdt|}||D]=\}}||vs ||_t t |j|_t|||?|S)z6Class decorator that fills in missing ordering methods__gt__c||kxs||k( Srqrrzs rz total_ordering.."te|7Ttu}2Ur__le__c||kxs||k(Srqrrzs rrz total_ordering..#$,2O$%-2Or__ge__c||k Srqrrzs rrz total_ordering..$ dUl2Brc||k xs||k(Srqrrzs rrz total_ordering..%sdem2C2Ttu}2Tr__lt__c||kxr||k( Srqrrzs rrz total_ordering..&$%-2UPU DU2Urc||k Srqrrzs rrz total_ordering..' dem2Crc||kDxs||k( Srqrrzs rrz total_ordering..(rrc||kDxs||k(Srqrrzs rrz total_ordering..)rrc||kD Srqrrzs rrz total_ordering..*rrc||k\ xs||k(Srqrrzs rrz total_ordering..+stu}3D2VQV2Vrc||k\xr||k( Srqrrzs rrz total_ordering..,rrc||k\ Srqrrzs rrz total_ordering..-rr)rrrrz6must define at least one ordering operation: < > <= >=) setdir ValueErrormaxrrintr|r)rlconvertrootsr-opnameopfuncs rrrs UVOPBCETUUVCDFUVOPBCEVWUVCDF G CMCL (E QRR u:D!$-  $FO$S&199FN C ( ( Jrc*Gfddt}|S)z,Convert a cmp= function into a key= functioncZeZdZdgZdZfdZfdZfdZfdZfdZ fdZ d Z y ) cmp_to_key..Kobjc||_yrqr)r*rs rr.zcmp_to_key..K.__init__>s DHrcD|j|jdkSNr rr*r{mycmps rrzcmp_to_key..K.__lt__@599-1 1rcD|j|jdkDSrrrs rrzcmp_to_key..K.__gt__BrrcD|j|jdk(Srrrs rryzcmp_to_key..K.__eq__D599-2 2rcD|j|jdkSrrrs rrzcmp_to_key..K.__le__FrrcD|j|jdk\Srrrs rrzcmp_to_key..K.__ge__HrrcD|j|jdk7Srrrs rrzcmp_to_key..K.__ne__JrrN) rrrrr.rrryrrr__hash__)rsrKr<s2G   2 2 3 3 3 3rr)r)rrs` rrr:sF" Hr CacheInfozhits misses maxsize currsizec<ttttffd }|S)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 ch dgdgc tf t %tt fd}nAt j j t  f d}  fd} fd}||_||_|S)Nr c|}|r"|  |jzz } |}dxxdz cc<|S#$rYnwxYw |i|}||<dxxdz cc<|SNr rra) r+r,rrYrHcachehitskwd_markmissessortedtuple user_functions rrz7lru_cache..decorating_function..wrapperos8eF4::<,@&AAAC"3ZFGqLG!M&55#c q Q  s=AAcr |}|r"| |jzz } 5 |}|dxxdz cc<|cdddS#$rYnwxYw dddn #1swYnxYw|i|} 5||< dxxdz cc<  kDrdddd|S#1swY|SxYwrr)r+r,rrYrHr cache_popitem cache_renewrrr"lockmaxsizerrrrs rrz7lru_cache..decorating_function..wrappers8eF4::<,@&AAAC!&s#C(Q1 % T $TT'55!'E#J1INI5zG+%a(     s4A&AAA&AA&&A/<&B,,B6c h5tddcdddS#1swYyxYw)zReport cache statisticsr N) _CacheInfo)rrr"rrrsr cache_infoz:lru_cache..decorating_function..cache_infos*!$q'6!9gs5zJs(1ch5jdxd<d<dddy#1swYyxYw)z$Clear the cache and cache statisticsr N)rE)rrrrsr cache_clearz;lru_cache..decorating_function..cache_clears+ &''Q&)s(1) rLockrFrr rIrLrr)rrrr"rHrrrrrrrrrrrs````` @@@@@@@rdecorating_functionz&lru_cache..decorating_functionessQC fH;v ?FE = !  "  ME!MMM++K = !  " ( K K  ( ()r)rrr"rH)rrs` rrrQs*Fh@D r)d)!r|__all__ _functoolsr r collectionsr r reprlib32rrweakrefrr'sysrOthreadrr ImportError_dummy_thread32rrrFr rrrrrrrrrrrrs M'28#7,5F5O($O(h<2,:)# 76 * %C D Vy 767sA(( A65A6