*j S r / SQrSSKJr SSKJr SSKJr SSKJ r \
" \ \ 5 r
SrSr\\4S jr\\4S
jrS rS rS
rS rS rS rS rS rS rS rS r S r S\4S\4S\4/S\4S\4S\4/S\4S\4S\4/S\4S\ 4S\ 4/S.r S r S r SS K!J r \#" 5 r$\$4S jr% SS K!J%r% " S! S"5 r& SS#K!J&r& " S$ S%\#5 r'S& r(S' r)\" S(/ S)Q5 r* " S* S+\ 5 r+\#" 5 4\ \,1\-\
\.4S, jr/S;S- jr0S. r1 SS/K!J1r1 S0 r2S1 r3S7 $ 7 7 c p [ U 5 R X5 nU[ L a U$ U( + =( a X:g $ )zIReturn a > b. Computed by @total_ordering from (not a < b) and (a != b).type__lt__NotImplementedselfother op_results r( _gt_from_ltr5 Z 3 T
!!$.IN"= *T]*r+ c f [ U 5 R X5 nU[ L a U$ U=( d X:H $ )zEReturn a <= b. Computed by @total_ordering from (a < b) or (a == b).r- r1 s r( _le_from_ltr8 a 1 T
!!$.IN" %
%r+ c Z [ U 5 R X5 nU[ L a U$ U( + $ )z=Return a >= b. Computed by @total_ordering from (not a < b).r- r1 s r( _ge_from_ltr; h , T
!!$.IN"=r+ c p [ U 5 R X5 nU[ L a U$ U( + =( d X:H $ )zJReturn a >= b. Computed by @total_ordering from (not a <= b) or (a == b).r. __le__r0 r1 s r( _ge_from_ler@ o 3 T
!!$.IN"= )DM)r+ c f [ U 5 R X5 nU[ L a U$ U=( a X:g $ )zFReturn a < b. Computed by @total_ordering from (a <= b) and (a != b).r> r1 s r( _lt_from_lerC v 1 T
!!$.IN" & &r+ c Z [ U 5 R X5 nU[ L a U$ U( + $ )z=Return a > b. Computed by @total_ordering from (not a <= b).r> r1 s r( _gt_from_lerF } r< r+ c p [ U 5 R X5 nU[ L a U$ U( + =( a X:g $ )zIReturn a < b. Computed by @total_ordering from (not a > b) and (a != b).r. __gt__r0 r1 s r( _lt_from_gtrJ r6 r+ c f [ U 5 R X5 nU[ L a U$ U=( d X:H $ )zEReturn a >= b. Computed by @total_ordering from (a > b) or (a == b).rH r1 s r( _ge_from_gtrL r9 r+ c Z [ U 5 R X5 nU[ L a U$ U( + $ )z=Return a <= b. Computed by @total_ordering from (not a > b).rH r1 s r( _le_from_gtrN r< r+ c p [ U 5 R X5 nU[ L a U$ U( + =( d X:H $ )zJReturn a <= b. Computed by @total_ordering from (not a >= b) or (a == b).r. __ge__r0 r1 s r( _le_from_gerR rA r+ c f [ U 5 R X5 nU[ L a U$ U=( a X:g $ )zFReturn a > b. Computed by @total_ordering from (a >= b) and (a != b).rP r1 s r( _gt_from_gerT rD r+ c Z [ U 5 R X5 nU[ L a U$ U( + $ )z=Return a < b. Computed by @total_ordering from (not a >= b).rP r1 s r( _lt_from_gerV r< r+ rI r? rQ r/ )r/ r? rI rQ c [ Vs1 s H% n[ XS5 [ [ US5 Ld M# UiM' nnU( d [ S5 e[ U5 n[ U H u pEXB; d M XEl [
XU5 M U $ s snf )z6Class decorator that fills in missing ordering methodsNz6must define at least one ordering operation: < > <= >=)_convertr object
ValueErrormaxr r )clsoprootsrootopnameopfuncs r( r r s{ # ^(Bgct& \ rS rSrS/rS rU 4S jrU 4S jrU 4S jrU 4S jr U 4S jr
S r S
r g ) zcmp_to_key..K objc Xl g Nre )r2 re s r( __init__ cmp_to_key..K.__init__ s Hr+ c D > T" U R UR 5 S: $ Nr rh r2 r3 mycmps r( r/ cmp_to_key..K.__lt__ 599-1 1r+ c D > T" U R UR 5 S: $ rl rh rm s r( rI cmp_to_key..K.__gt__ rp r+ c D > T" U R UR 5 S:H $ rl rh rm s r( __eq__ cmp_to_key..K.__eq__ 599-2 2r+ c D > T" U R UR 5 S:* $ rl rh rm s r( r? cmp_to_key..K.__le__ rv r+ c D > T" U R UR 5 S: $ rl rh rm s r( rQ cmp_to_key..K.__ge__ rv r+ Nrh )
r r r __firstlineno__ __slots__ri r/ rI rt r? rQ __hash____static_attributes__)rn s r( Kcmp_to_key..K s- G 2 2 3 3 3r+ r )rY )rn r s ` r( r r s F
Hr+ )r c [ U5 nU[ L a
[ U5 nOUnU H nU " XE5 nM
U$ ! [ a
[ S5 Sef = f)a
reduce(function, iterable[, initial], /) -> value
Apply a function of two arguments cumulatively to the items of an iterable, from left to right.
This effectively reduces the iterable to a single value. If initial is present,
it is placed before the items of the iterable in the calculation, and serves as
a default when the iterable is empty.
For example, reduce(lambda x, y: x+y, [1, 2, 3, 4, 5])
calculates ((((1 + 2) + 3) + 4) + 5).
z0reduce() of empty iterable with no initial valueN)iter_initial_missingnext
StopIteration TypeError)functionsequenceinitialitr' elements r( r
r
so
h B"" NHE
( L NBDIM
N Ns 7 A)r
c v ^ \ rS rSrSrSrU 4S jrS r\" 5 S 5 r S S jr
S r S r \
" \5 rS
rU =r$ ) r i zKNew function with partial application of the given arguments
and keywords.
)funcargskeywordsr __weakref__c > [ U5 ( d [ S5 e[ U[ 5 ( a+ UR U- n0 UR
EUEnUR n[ [ U ]# U 5 nXl X$l X4l U$ )Nz#the first argument must be callable) callabler
isinstancer r r r super__new__)r\ r r r r2 __class__s r( r partial.__new__ st ~~ AB B dG $ $99t#D4$--484H99DWc*3/
r+ c d 0 U R EUEnU R " / U R QUQ70 UD6$ rg r r r )r2 r r s r( __call__partial.__call__. s5 0dmm0x0yy7$))7d7h77r+ c L [ U 5 nUR nUR n[ U R 5 /nUR S U R 5 5 UR S U R R 5 5 5 U SU SSR U5 S3$ )Nc 3 8 # U H n[ U5 v M g 7frg )repr).0xs r( #partial.__repr__..8 s /YDGGYs c 3 6 # U H u pU S U< 3v M g7f=N r kvs r( r r 9 s E/DVaqc1%L/D .(, ))
r. r r r r extendr r itemsjoin)r2 r\ qualnamemoduler s r( __repr__partial.__repr__2 s 4j## TYY /TYY// Et}}/B/B/DEE8*Adiio%6a88r+ c F Uc U $ SS K nUR S[ S5 U $ )Nr zfunctools.partial will be a method descriptor in future Python versions; wrap it in staticmethod() if you want to preserve the old behavior )warningswarn
FutureWarning)r2 re objtyper s r( __get__partial.__get__< s/ ;K
A $Q ( r+ c [ U 5 U R 4U R U R U R =( d S U R =( d S 44$ rg )r. r r r r r2 s r(
__reduce__partial.__reduce__F sC DzDII<$))TYY}}$dmm&;t*= = =r+ c [ U[ 5 ( d [ S5 e[ U5 S:w a [ S[ U5 35 eUu p#pE[ U5 ( aE [ U[ 5 ( a0 Ub [ U[
5 ( a Ub [ U[
5 ( d [ S5 e[ U5 nUc 0 nO [
U5 [
La [ U5 nUc 0 nXPl X l X0l X@l
g )Nz(argument to __setstate__ must be a tuple z expected 4 items in state, got zinvalid partial state) r tupler lenr dictr. r r r r )r2 stater r kwds namespaces r( __setstate__partial.__setstate__J s %'' FG G u:? =c%j\ JK K&+#Dju&=&= Zd%;%; !*Y*E*E 34 4T{ <D
$Zt
#:D I!
r+ )r r r r rg )r r r r{ r r| r r r r r r r classmethod GenericAlias__class_getitem__r~
__classcell__)r s @r( r r sM FI 8 9 9= 0 $L1r+ r )r c T \ rS rSrSrS rS rS rS
S jr\ S 5 r
\ " \ 5 r
S rg) r ik zMethod descriptor with partial application of the given arguments
and keywords.
Supports wrapping existing descriptors and handles non-descriptor
callables as instance methods.
c > [ U5 ( d+ [ US5 ( d [ SR U5 5 e[ U[
5 ( a; UR U l UR U- U l 0 UR EUEU l g Xl X l X0l g )Nr z${!r} is not callable or a descriptor) r hasattrr formatr r r r r )r2 r r r s r( ri partialmethod.__init__s s ~~gdI&>&> B"(&,0
0
dM * * DI D(DI 9t}} 9 9DM I I $Mr+ c Z [ U 5 nUR nUR n[ U R 5 /nUR [
[ U R 5 5 UR S U R R 5 5 5 U SU SSR U5 S3$ )Nc 3 6 # U H u pU S U< 3v M g7fr r r s r( r )partialmethod.__repr__.. s C-BTQqc1%L-Br r r r r ) r. r r r r r mapr r r r )r2 r\ r r r s r( r partialmethod.__repr__ s 4j ##TYY Cdii() CT]]-@-@-BCC8*Adiio%6a88r+ c D ^ U 4S jnT R Ul T Ul U$ )Nc h > 0 TR EUEnTR " U /TR QUQ70 UD6$ rg r ) cls_or_selfr r r2 s r( _method3partialmethod._make_unbound_method.._method s8 4$--484H99[H499HtHxH Hr+ )__isabstractmethod____partialmethod__)r2 r s ` r( _make_unbound_method"partialmethod._make_unbound_method s& I (,'@'@$$(!r+ Nc v [ U R SS 5 nS nUbj [ U R [ 5 ( dK U" X5 nXPR La5 [ U/U R Q70 U R
D6n UR Ul Uc U R 5 R X5 nU$ ! [ a N0f = f)Nr )
r r r r r r __self__r r r )r2 re r\ getresultnew_funcs r( r partialmethod.__get__ s diiD1 ?:dii#A#A3}Hyy( !GDIIG G&.&7&7FO > ..088BF
& s 6B+ +
B87B8c 0 [ U R SS5 $ Nr Fr r r s r( r "partialmethod.__isabstractmethod__ tyy"8%@@r+ )r r r rg )r r r r{ r ri r r r propertyr r r r r~ r r+ r( r r k s> %&9& A A $L1r+ r c v [ U [ 5 ( a# U R n [ U [ 5 ( a M# U $ rg )r r r r s r( _unwrap_partialr s,
T7
#
#yy T7
#
# Kr+ c D S nXLa U n[ [ U SS 5 [ 5 ( a. U R n [ [ U SS 5 [ 5 ( a M. [ U [ 5 ( a# [ U S5 n [ U [ 5 ( a M# [ U 5 n XLa M U $ )Nr r )r r r r r )r prevs r( _unwrap_partialmethodr s D
':DA=QQ))D ':DA=QQ}--4(D }-- t$
Kr+ CacheInfo)hitsmissesmaxsizecurrsizec . \ rS rSrSrSr\4S jrS rSr g)
_HashedSeqi zThis class guarantees that hash() will be called no more than once
per element. This is important because the lru_cache() will hash
the key multiple times on a cache miss.
hashvaluec & XS S & U" U5 U l g rg r )r2 tuphashs r( ri _HashedSeq.__init__ s Q cr+ c U R $ rg r r s r( r} _HashedSeq.__hash__ s ~~ r+ r N)
r r r r{ r r| r ri r} r~ r r+ r( r r s I!% # r+ r c 4 ^ U nU( a X-
nUR 5 H n X-
nM U( a> X" U4S jU 5 5 -
nU( a" X" U4S jUR 5 5 5 -
nO U" U5 S:X a T" US 5 U; a US $ [ U5 $ )ay Make a cache key from optionally typed positional and keyword arguments
The key is constructed in a way that is flat as possible rather than
as a nested structure that would take more memory.
If there is only a single argument and its data type is known to cache
its hash value, then that argument is returned without a wrapper. This
saves space and improves lookup speed.
c 3 4 ># U H
nT" U5 v M g 7frg r r r r. s r( r _make_key.. s +dT!WWd c 3 4 ># U H
nT" U5 v M g 7frg r r s r( r r s 8-Qa-r r )r valuesr )
r r typedkwd_mark fasttypesr r. r keyitems
` r( _make_keyr s $ C JJLD KC ! u+d+++ 58$++-88 8C SQ 4A<941v
c?r+ c ^ ^ [ T [ 5 ( a T S: a Sm Oa[ T 5 ( aC [ T[ 5 ( a. T Ssnm [ UT T[
5 nU U4S jUl [ X25 $ T b [ S5 eU U4S jnU$ )a Least-recently-used cache decorator.
If *maxsize* is set to None, the LRU features are disabled and the cache
can grow without bound.
If *typed* is True, arguments of different types will be cached
separately. For example, f(decimal.Decimal("3.0")) and f(3.0) will be
treated as distinct calls with distinct results. Some types such as
str and int may be cached separately even when typed is false.
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: https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)
r c > T TS.$ Nr r r r s r( lru_cache..
%,Pr+ z=Expected first argument to be an integer, a callable, or Nonec V > [ U TT[ 5 nUU4S jUl [ X5 $ )Nc > T TS.$ r r r s r( r 8lru_cache..decorating_function.." r r+ )_lru_cache_wrapper
_CacheInfocache_parametersr )
user_functionr" r r s r( decorating_function&lru_cache..decorating_function s& $]GUJO#P g55r+ ) r intr boolr r r r r )r r r r" r! s `` r( r r s 4 '3 Q;G ' z% 6 6!(#
w$]GUJO#P g55 KM M6
r+ c n ^ ^^^^^^ ^
^ ^ ^
^^^^^^^ [ 5 m[ mSu m mmm
0 m S=mmSmT R m T R m
[ 5 m/ mTTS S /TS S & TS:X a UU 4S jnO&Tc U U UUUUUU 4S jnOUUU U
U U U
UUUUUUUUU 4S jnUU
UUUU4S jnU UUUUU4S jnXTl Xdl U$ ) N)r r
r r Fc " > TS-
mT" U 0 UD6nU$ Nr
r )r r r r r s r( r" #_lru_cache_wrapper..wrapper8 s"
aKF"D1D1FMr+ c h > T" XT
5 nT" UT 5 nUT La TS-
mU$ TS-
mT " U 0 UD6nUTU' U$ r( r ) r r r r r cache_getr make_keyr sentinelr r s r( r" r) A sY 4u-C sH-FX%
aKF"D1D1F E#JMr+ c > T" XT5 nT T" U5 nUb5 Uu pEpgXTT
' XET' TT nU=UT
' TT' XT' TUT
' TS-
mUsS S S 5 $ TS-
mS S S 5 T" U 0 UD6nT UT; a OVT( a, Tn X)T ' XyT' U T
mTT n
TT n S =TT ' TT' TU
U TU' O#TT nUTX'/nU=UT
' =TT' TU' T" 5 T: mS S S 5 U$ ! , ( d f N= f! , ( d f U$ = fr( r ) r r r link link_prev link_next_keyr lastoldrootoldkey oldresultKEYNEXTPREVRESULTr r+ cache_lenfullr lockr, r r r_ r r s r( r" r) P sg 4u-C ~#9=6I$&/dO&/dO :D.22DJd!%J!%DJAID! ! #D1D1F%<
"G#&CL&,FO #4=D !#YF $V I/33DIV f
")E#J :D $4D;??DJ?deCj &K7 2DG H Mg H Ms 7C
C
%A C
C
C-c ^ > T T " TTTT" 5 5 sSSS5 $ ! , ( d f g= f)zReport cache statisticsNr )r r; r r= r r s r(
cache_info&_lru_cache_wrapper..cache_info s
dFGY[A TTs
,c | > T T R 5 TTSS/TSS& S=mmSmSSS5 g! , ( d f g= f)z$Clear the cache and cache statisticsNr F)clear)r r< r r= r r_ s r( cache_clear'_lru_cache_wrapper..cache_clear s< KKMT4.DG D6D TTs -
;)rY r r __len__r r? rC )r r r r r" r? rC r7 r8 r9 r: r r+ r; r< r r= r, r r_ r- s ```` @@@@@@@@@@@@@@r( r r ' s xHH (D$V ED6 D I
I 7D
DT4&DG!|
7 7 7 rB B
$% Nr+ )r c [ SS9" U 5 $ )z@Simple lightweight unbounded cache. Sometimes called "memoize".N)r )r )r s r( r r s T "= 11r+ c / n U Vs/ s H
o"( d M UPM n nU ( d U$ U H nUS nU H nXESS ; d M
Sn M O Wc [ S5 eUR U5 U H nUS U:X d M US M M s snf )z|Merges MROs in *sequences* to a single MRO using the C3 algorithm.
Adapted from https://docs.python.org/3/howto/mro.html.
r r
NzInconsistent hierarchy) RuntimeErrorappend) sequencesr ss1 candidates2seqs r( _c3_mergerP s F
)/ 1QQ /MB1I 12& $I
78 8
i C1v"F ! /s
BBNc ^ [ [ U R 5 5 H1 u nm[ TS5 ( d M [ U R 5 U-
n O SnU( a [ U5 O/ n[ U R SU 5 n/ n[ U R US 5 nU HM m[
U T5 ( d M [ U4S jU R 5 5 ( a M< UR T5 MO U H mUR T5 M U Vs/ s H n[ XqS9PM nnU Vs/ s H n[ XqS9PM n nU Vs/ s H n[ XqS9PM n
n[ U //U- U - U
- U/- U/- U/- 5 $ s snf s snf s snf )aS Computes the method resolution order using extended C3 linearization.
If no *abcs* are given, the algorithm works exactly like the built-in C3
linearization used for method resolution.
If given, *abcs* is a list of abstract base classes that should be inserted
into the resulting MRO. Unrelated ABCs are ignored and don't end up in the
result. The algorithm inserts ABCs where their functionality is introduced,
i.e. issubclass(cls, abc) returns True for the class itself but returns
False for all its direct base classes. Implicit ABCs for a given class
(either registered or inferred from the presence of a special method like
__len__) are inserted directly after the last ABC explicitly listed in the
MRO of said class. If two implicit ABCs end up next to each other in the
resulting MRO, their ordering depends on the order of types in *abcs*.
__abstractmethods__r Nc 3 < ># U H n[ UT5 v M g 7frg )
issubclass)r bbases r( r _c3_mro.. s --:
1d##]s abcs) enumeratereversed __bases__r r listrT anyrI remove_c3_mrorP ) r\ rY iboundaryexplicit_basesabstract_bases other_basesrV explicit_c3_mrosabstract_c3_mros
other_c3_mross ` r( r` r` s " Xcmm 454 4. / /3==)A-H 6
4:2D#-- 23NNs}}XY/0K c4 --0]]- * *
! !$ '
D =KL^T0^L=KL^T0^L:EF+$WT-+MF
+ ,.; < *+ ,/:m < MLFs E7'E< Fc ^ ^^ [ T R 5 m U U 4S jnT Vs/ s H o2" U5 ( d M UPM snmU4S jnT Vs/ s H o4" U5 ( a M UPM snm[ T5 n/ nT H n/ nUR 5 HQ n U T ; d M [ T U 5 ( d M UR U R V
s/ s H oU; d M
U
PM sn
5 MS U( d UR U5 M UR [ SS9 U H$ n U H n X; d M
UR U 5 M M& M [ T US9$ s snf s snf s sn
f )zCalculates the method resolution order for a given class *cls*.
Includes relevant abstract base classes (with their respective bases) from
the *types* iterable. Uses a modified C3 linearization algorithm.
c > U T; =( a; [ U S5 =( a( [ U [ 5 ( + =( a [ TU 5 $ )N__mro__)r r r rT )typbasesr\ s r(
is_related _compose_mro..is_related s? 5 :WS)%< :)3C )F%F:%/S%9 ;r+ c H > T H nX:w d M
XR ; d M g g)NTF)rk )rl r3 typess r( is_strict_base$_compose_mro..is_strict_base s# E|}} 4 r+ T)r reverserX )setrk __subclasses__rT rI sortr r` )
r\ rq rn nrr type_setmrorl foundsubrK subclsrm s
`` @r( _compose_mror~ s'
E; /1A Q /E
71^A%6Q 7E 5zH
C%%'C% JsC$8$8 FAX
a FG ( JJsO
sD
)C $JJv& 3S !!7
0
8 Gs" EE E E E E c " [ XR 5 5 nSnU H^ nUbO XA; aH X@R ; a9 X0R ; a* [ X45 ( d [ SR X45 5 e O
XA; d M\ UnM` UR
U5 $ )aJ Returns the best matching implementation from *registry* for type *cls*.
Where there is no registered implementation for a specific type, its method
resolution order is used to find a more generic implementation.
Note: if *registry* does not contain an implementation for the base
*object* type, this function may return None.
Nz Ambiguous dispatch: {} or {})r~ keysrk rT rH r r )r\ registryrz matchts r(
_find_implr s sMMO
,C E
!;;"6"'{{":&0&:&:"#A#H#H$ =E << r+ c L ^^^^^^^ ^
^ SSK m SSKn0 m
UR 5 mSmUUU
4S jmU 4S jmU4S jmS
UUUUU U
4S jjm UU4S jn[ U SS 5 mU T
[ ' T Ul TUl T R T
5 Ul TR Ul
[ X 5 U$ ) aS Single-dispatch generic function decorator.
Transforms a function into a generic function, which can have different
behaviours depending upon the type of its first argument. The decorated
function acts as the default implementation, and additional
implementations can be registered using the register() attribute of the
generic function.
r Nc > Tb" [ 5 nTU:w a TR 5 Um TU nU$ ! [ a, TU nO ! [ a [ U T5 n Of = fUTU ' U$ f = f)zgeneric_func.dispatch(cls) ->
Runs the dispatch algorithm to return the best available implementation
for the given *cls* registered on *generic_func*.
)r rB KeyErrorr )r\
current_tokenimpl cache_tokendispatch_cacher s r( dispatch singledispatch..dispatchL s " + -Mm+ $$& + '!#&D
'
1 }
1!#x0
1"&N3
's1 /
A%A A% AA%AA%$A%c B > SSK JnJn U" U 5 UTR 1; $ )Nr )
get_originUnion)typingr r UnionType)r\ r r rq s r( _is_union_type&singledispatch.._is_union_typec s ,#5%//":::r+ c > [ U [ 5 ( a gSSKJn T" U 5 =( a [ S U" U 5 5 5 $ )NTr get_argsc 3 B # U H n[ U[ 5 v M g 7frg )r r. )r args r( r Bsingledispatch.._is_valid_dispatch_type..l s C]cJsD))]s )r r. r r all)r\ r r s r( _is_valid_dispatch_type/singledispatch.._is_valid_dispatch_typeg s< c4 # s# DCXc]CC Er+ c H >^ T" T 5 ( a Uc U U 4S j$ OUb [ ST < S35 e[ T S0 5 nU( d [ ST < S35 eT nSSKJn [ [ U" U5 R
5 5 5 u nm T" T 5 ( d5 T" T 5 ( a [ S U< S
T < S 35 e[ S U< S
T < S 35 eT" T 5 ( a SS
KJn U" T 5 H nUT U' M
OUT T ' T c [ T S5 ( a
[ 5 m T
R 5 U$ )zsgeneric_func.register(cls, func) -> func
Registers a new implementation for the given *cls* on a *generic_func*.
c > T" TU 5 $ rg r )fr\ registers r( r 2singledispatch..register..w s #q!1r+ z(Invalid first argument to `register()`. z is not a class or union type.r z(Invalid first argument to `register()`: zS. Use either `@register(some_class)` or plain `@register` on an annotated function.r )get_type_hintszInvalid annotation for z. z not all arguments are classes.z is not a class.r rR ) r r r r r r r r r r rB )
r\ r annr argnamer r r r r r r r s
` r( r singledispatch..registern sb #3 ' '|11 >g ;= # 0"5C >sg F0 1
D
. ^D%9%?%?%A BCLGS*3//!#&'B '!@B
$1'B '!13
# ' } $
% !HSM 730E#F#F)+K r+ c d > U ( d [ T S35 eT" U S R 5 " U 0 UD6$ Nz( requires at least 1 positional argumentr )r r )r kwr funcnames r( r" singledispatch..wrapper s@ xj )4 4 5
5Q))*D7B77r+ r zsingledispatch functionrg ) rq weakrefWeakKeyDictionaryr rY r r MappingProxyTyper rB _clear_cacher ) r r r" r r r r r r r r rq s @@@@@@@@@r( r
r
: s H ..0NK.;E2 2h8 tZ)BCHHV G G --h7G)//G7! Nr+ c B \ rS rSrSrS rS S jrS S jr\S 5 r Sr
g)
r i zTSingle-dispatch generic method descriptor.
Supports wrapping existing descriptors.
c [ U5 ( d [ US5 ( d [ U< S35 e[ U5 U l Xl g )Nr z is not callable or a descriptor)r r r r
dispatcherr r2 r s r( ri singledispatchmethod.__init__ s; ~~gdI&>&>th&F GH H(. r+ Nc 4 U R R XS9$ )zvgeneric_method.register(cls, func) -> func
Registers a new implementation for the given *cls* on a *generic_method*.
r )r r )r2 r\ methods r( r singledispatchmethod.register s
'''99r+ c ^^^^ U R R m[ U R SS5 mUUUU4S jnU R Ul U R
Ul [
X0R 5 U$ )Nr zsingledispatchmethod methodc > U ( d [ T S35 eT" U S R 5 R TT5 " U 0 UD6$ r )r r r )r kwargsr\ r r re s r( r -singledispatchmethod.__get__.._method sM 8* -8 !8 9 9DG - -.66sC@$Q&Q Qr+ )r r r r r r r )r2 re r\ r r r s `` @@r( r singledispatchmethod.__get__ s^ ??++499j2OP R R (,'@'@$ ==w *r+ c 0 [ U R SS5 $ r r r s r( r )singledispatchmethod.__isabstractmethod__ r r+ )r r rg ) r r r r{ r ri r r r r r~ r r+ r( r r s,
:
A Ar+ r c : \ rS rSrS rS rSS jr\" \5 r Sr
g)r i c b Xl S U l UR U l UR U l g rg )r attrnamer r r s r( ri cached_property.__init__ s$
|| //r+ c U R c X l g X R :w a [ SU R < SU< S35 eg )Nz?Cannot assign the same cached_property to two different names (z and z).)r r )r2 ownernames r( __set_name__ cached_property.__set_name__ sI == M
]]
"MM$E$5
#r+ Nc Uc U $ U R c [ S5 e UR nUR
U R [ 5 nU[ L a" U R U5 n XSU R ' U$ U$ ! [ a5 S[ U5 R
< SU R < S3n[ U5 S ef = f! [ a5 S[ U5 R
< SU R < S3n[ U5 S ef = f)NzGCannot use cached_property instance without calling __set_name__ on it.zNo '__dict__' attribute on z instance to cache z
property.z The '__dict__' attribute on z7 instance does not support item assignment for caching ) r r r r r. r r
_NOT_FOUNDr )r2 instancer r msgvals r( r cached_property.__get__ s K == Y[
[ + %%E ii
z2 * ))H%C
/'*dmm$
s
# +-d8n.E.E-H I%%)]]$5ZA
C.d * +
/24>3J3J2M NDDHMMCTT^` n$.
/s A8 &B: 8?B7:?C9)r r r r rg ) r r r r{ ri r r r r r r~ r r+ r( r r s * 6 $L1r+ r )r Frg );r __all__abcr collectionsr reprlibr _threadr r. r] r# r r r r r r5 r8 r; r@ rC rF rJ rL rN rR rT rV rX r r
_functools ImportErrorrY r r
r r r r r r strr r r r r r rP r` r~ r r
r r r r r+ r( r sM
" " DI = 2 , > )# 70+&*'+&*' +&+&+&( +&+&+&( +&+&+&( +&+&+&(
$
& % 8 '7 < !K2 K2\ "
C2F C2P
%N
O
" st >- ^rh -26+Z("T 4ur%A %AX X
+2 +2{ T r l sH D5 &E 7E
?E 5D>=D>E
E
EEE"!E"