python (3.12.0)

Browse
Build Log
Usage
Build Options
Dependencies
Source
Versions
Version Info
(root)/
lib/
python3.12/
__pycache__/
functools.cpython-312.opt-1.pyc

ˑedZgdZddlmZddlmZddlmZddlm	Z	ddl
mZdZd	Z
ee
fd
Zee
fdZdZd
ZdZdZdZdZdZdZdZdZdZdZdefdefdefgdefdefdefgdefdefdefgdefdefdefgdZdZdZ	ddlmZe!Z"e"fd Z#	dd!lm#Z#Gd"d#Z$	dd$lm$Z$Gd%d&e!Z%d'Z&ed(gd)Z'Gd*d+e(Z)e!fe*e+he,e-e.fd,Z/d;d-Z0d.Z1	dd/lm1Z1d0Z2d1Z3d<d3Z4d4Z5d5Z6d6Z7Gd7d8Z8e!Z9Gd9d:Z:y2#e $rYwxYw#e $rYwxYw#e $rYwxYw#e $rYWwxYw)=zEfunctools.py - Tools for working with functions and callable objects
)update_wrapperwrapsWRAPPER_ASSIGNMENTSWRAPPER_UPDATEStotal_orderingcache
cmp_to_key	lru_cachereducepartial
partialmethodsingledispatchsingledispatchmethodcached_property)get_cache_token)
namedtuple)recursive_repr)RLock)GenericAlias)
__module____name____qualname____doc____annotations____type_params__)__dict__c|D]}	t||}t||||D](}t||jt||i*||_|S#t$rY`wxYw)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)
    )getattrsetattrAttributeErrorupdate__wrapped__)wrapperwrappedassignedupdatedattrvalues      =/BuggyBox/python/3.12.0/bootstrap/lib/python3.12/functools.pyrr#s*	*GT*E
GT5)
*B%%ggtR&@AB"GN		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().
    r$r%r&)rrr+s   r)rrAs>7$g77c`t|j||}|tur|S|xr||k7S)zIReturn a > b.  Computed by @total_ordering from (not a < b) and (a != b).type__lt__NotImplementedselfother	op_results   r)_gt_from_ltr6Y7T
!!$.IN"=*TU]*r,c^t|j||}|tur|S|xs||k(S)zEReturn a <= b.  Computed by @total_ordering from (a < b) or (a == b).r.r2s   r)_le_from_ltr9`5T
!!$.IN"%
%r,cRt|j||}|tur|S|S)z=Return a >= b.  Computed by @total_ordering from (not a < b).r.r2s   r)_ge_from_ltr<g.T
!!$.IN"=r,c`t|j||}|tur|S|xs||k(S)zJReturn a >= b.  Computed by @total_ordering from (not a <= b) or (a == b).r/__le__r1r2s   r)_ge_from_lerAn7T
!!$.IN"=)DEM)r,c^t|j||}|tur|S|xr||k7S)zFReturn a < b.  Computed by @total_ordering from (a <= b) and (a != b).r?r2s   r)_lt_from_lerDu5T
!!$.IN"&&r,cRt|j||}|tur|S|S)z=Return a > b.  Computed by @total_ordering from (not a <= b).r?r2s   r)_gt_from_lerG|r=r,c`t|j||}|tur|S|xr||k7S)zIReturn a < b.  Computed by @total_ordering from (not a > b) and (a != b).r/__gt__r1r2s   r)_lt_from_gtrKr7r,c^t|j||}|tur|S|xs||k(S)zEReturn a >= b.  Computed by @total_ordering from (a > b) or (a == b).rIr2s   r)_ge_from_gtrMr:r,cRt|j||}|tur|S|S)z=Return a <= b.  Computed by @total_ordering from (not a > b).rIr2s   r)_le_from_gtrOr=r,c`t|j||}|tur|S|xs||k(S)zJReturn a <= b.  Computed by @total_ordering from (not a >= b) or (a == b).r/__ge__r1r2s   r)_le_from_gerSrBr,c^t|j||}|tur|S|xr||k7S)zFReturn a > b.  Computed by @total_ordering from (a >= b) and (a != b).rQr2s   r)_gt_from_gerUrEr,cRt|j||}|tur|S|S)z=Return a < b.  Computed by @total_ordering from (not a >= b).rQr2s   r)_lt_from_gerWr=r,rJr@rRr0)r0r@rJrRc	tDchc]#}t||dtt|dus"|%}}|stdt	|}t|D]\}}||vs||_t
||| |Scc}w)z6Class decorator that fills in missing ordering methodsNz6must define at least one ordering operation: < > <= >=)_convertrobject
ValueErrormaxrr)clsoprootsrootopnameopfuncs      r)rrs#^Bgc2t&<GFTVX\D]&]R^E^QRRu:D"4.)$FOC()J
_s
#A7A7c*Gfddt}|S)z,Convert a cmp= function into a key= functioncPeZdZdgZdZfdZfdZfdZfdZfdZ	dZ
y)	cmp_to_key.<locals>.Kobjc||_yNrf)r3rfs  r)__init__zcmp_to_key.<locals>.K.__init__s	DHr,cD|j|jdkSNrrir3r4mycmps  r)r0zcmp_to_key.<locals>.K.__lt__599-11r,cD|j|jdkDSrlrirms  r)rJzcmp_to_key.<locals>.K.__gt__ror,cD|j|jdk(Srlrirms  r)__eq__zcmp_to_key.<locals>.K.__eq__599-22r,cD|j|jdkSrlrirms  r)r@zcmp_to_key.<locals>.K.__le__rsr,cD|j|jdk\Srlrirms  r)rRzcmp_to_key.<locals>.K.__ge__rsr,N)rrr	__slots__rjr0rJrrr@rR__hash__)rnsr)Kres-G			2	2	3	3	3r,rx)rZ)rnrxs` r)rrsF
Hr,)rct|}|tur
	t|}n|}|D]}|||}
|S#t$r
t	ddwxYw)a
    reduce(function, iterable[, initial]) -> value

    Apply a function of two arguments cumulatively to the items of a sequence
    or iterable, from left to right, so as to reduce the iterable to a single
    value.  For example, reduce(lambda x, y: x+y, [1, 2, 3, 4, 5]) calculates
    ((((1+2)+3)+4)+5).  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.
    z0reduce() of empty iterable with no initial valueN)iter_initial_missingnext
StopIteration	TypeError)functionsequenceinitialitr(elements      r)r
r
sv
hB""	NHE
)()L	NBDIM
N	Ns	5A)r
cReZdZdZdZfdZdZedZdZ	dZ
xZS)rzSNew function with partial application of the given arguments
    and keywords.
    )funcargskeywordsr__weakref__ct|stdt|dr+|j|z}i|j|}|j
}tt|#|}||_||_||_|S)Nz#the first argument must be callabler)	callabler~hasattrrrrsuperr__new__)r]rrrr3	__class__s     r)rzpartial.__new__su~ABB4 99t#D4$--484H99DWc*3/		 
r,cdi|j|}|jg|j|i|Srhrrr)r3rrs   r)__call__zpartial.__call__+s70dmm0x0tyy7$))7d7h77r,ct|j}t|jg}|j	d|j
D|j	d|jjDt|jdk(rd|ddj|dS|ddj|dS)Nc32K|]}t|ywrh)repr).0xs  r)	<genexpr>z#partial.__repr__.<locals>.<genexpr>3s/DG/sc30K|]\}}|d|yw)=Nrkvs   r)rz#partial.__repr__.<locals>.<genexpr>4sEVaqc1%LEs	functoolsz
functools.(, ))
r/rrrextendrritemsrjoin)r3qualnamers   r)__repr__zpartial.__repr__/s:**TYY /TYY//Et}}/B/B/DEE:  K/z499T?*;1==1TYYt_-Q//r,ct||jf|j|j|jxsd|jxsdffSrh)r/rrrrr3s r)
__reduce__zpartial.__reduce__9sCDzDII<$))TYY}}$dmm&;t*==	=r,ct|tstdt|dk7rtdt||\}}}}t	|r4t|tr$|t|t
r|t|t
stdt|}|i}nt
|t
urt|}|i}||_||_||_	||_
y)Nz(argument to __setstate__ must be a tuplezexpected 4 items in state, got zinvalid partial state)
isinstancetupler~lenrdictr/rrrr)r3staterrkwds	namespaces      r)__setstate__zpartial.__setstate__=s%'FGGu:?=c%j\JKK&+#dD)ju&=Zd%;!*Y*E344T{<D
$Zt
#:DI!
		
r,)rrrrrvrrrrrr
__classcell__)rs@r)rrs;FI 800=r,r)rcJeZdZdZdZdZdZddZedZ	e
eZy)	rzMethod descriptor with partial application of the given arguments
    and keywords.

    Supports wrapping existing descriptors and handles non-descriptor
    callables as instance methods.
    c&t|s&t|dstdj|t	|t
r;|j|_|j|z|_i|j||_y||_||_||_y)N__get__z${!r} is not callable or a descriptor)	rrr~formatrrrrr)r3rrrs    r)rjzpartialmethod.__init__cs~~gdI&>B"(&,0
0
dM*		DI		D(DI9t}}99DMDIDI$DMr,cHdjtt|j}djd|jjD}d}|j
|jj|jj|j||S)Nrc3FK|]\}}dj||yw)z{}={!r}N)rrs   r)rz)partialmethod.__repr__.<locals>.<genexpr>xs+D%)Q'--a3Ds!z*{module}.{cls}({func}, {args}, {keywords}))moduler]rrr)rmaprrrrrrrrr)r3rr
format_strings    r)rzpartialmethod.__repr__vsyyT499-.99D-1]]-@-@-BDDD
##4>>+D+D(,(C(C)-)--5	$7	7r,cBfd}j|_|_|S)Nchij|}j|gj|i|Srhr)cls_or_selfrrr3s   r)_methodz3partialmethod._make_unbound_method.<locals>._methods:4$--484H499[H499HtHxHHr,)__isabstractmethod___partialmethod)r3rs` r)_make_unbound_methodz"partialmethod._make_unbound_methods&	I(,'@'@$!%r,Nc6t|jdd}d}|L|||}||jur5t|g|ji|j}	|j
|_| |jj||}|S#t$rY/wxYw)Nr)	rrrrr__self__r rr)r3rfr]getresultnew_funcs      r)rzpartialmethod.__get__sdiiD1?3}Htyy(!GDIIGG&.&7&7FO>..088cBF

&sB	BBc0t|jddSNrFrrrs r)rz"partialmethod.__isabstractmethod__tyy"8%@@r,rh)
rrrrrjrrrpropertyrclassmethodr__class_getitem__rr,r)rr[s>%&	7&AA$L1r,rc`t|tr|j}t|tr|Srh)rrrrs r)_unwrap_partialrs&
T7
#yyT7
#Kr,	CacheInfo)hitsmissesmaxsizecurrsizec$eZdZdZdZefdZdZy)
_HashedSeqz This 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(||dd|||_yrhr)r3tuphashs   r)rjz_HashedSeq.__init__sQcr,c|jSrhrrs r)rwz_HashedSeq.__hash__s~~r,N)rrrrrvrrjrwrr,r)rrsI!%#r,rc$|}|r||z
}|jD]}	||	z
}	|rC||fd|Dz
}|rJ||fd|jDz
}t|S||dk(r|d|vr|dSt|S)aMake 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.

    c3.K|]}|ywrhrrrr/s  r)rz_make_key.<locals>.<genexpr>s+T!W+c3.K|]}|ywrhrrs  r)rz_make_key.<locals>.<genexpr>s8Qa8rr)rvaluesr)
rrtypedkwd_mark	fasttypesrr/rkeyitems
      `   r)	_make_keyrs$CxJJL	D4KC	u+d+++58$++-888Cc?

SQ4A<941v
c?r,cttrdkrYdnVtr>ttr.dc}t	|t
}fd|_t||Stdfd}|S)aLeast-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(3.0) and f(3) will be treated as distinct calls with
    distinct results.

    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)

    rcdSNrrrrsr)<lambda>zlru_cache.<locals>.<lambda>%,Pr,z=Expected first argument to be an integer, a callable, or NonecVt|t}fd|_t||S)NcdSrrrsr)rz8lru_cache.<locals>.decorating_function.<locals>.<lambda>rr,)_lru_cache_wrapper
_CacheInfocache_parametersr)
user_functionr#rrs  r)decorating_functionz&lru_cache.<locals>.decorating_functions($]GUJO#P g}55r,)	rintrboolrrrrr~)rrrr#rs``   r)r	r	s2'3Q;G	'	z%6!(#
w$]GUJO#P g}55		KM	M6
r,cd	

ttd\	
idxdjj
t	gddgdddk(rfd}n#
fd}n	

fd}
fd}fd}||_||_|S)	N)rrrFc"dz
|i|}|SNrr)rrrrrs   r)r#z#_lru_cache_wrapper.<locals>.wrappers"
aKF"D1D1FMr,ch||
}|	}|	urdz
|Sdz
|i|}||<|Srr)rrrrr	cache_getrmake_keyrsentinelrrs    r)r#z#_lru_cache_wrapper.<locals>.wrapper's[4u-CsH-FX%	
aKF"D1D1FE#JMr,c||}5|}|:|\}}}}||
<||<}|x|
<<||<|
<dz
|cdddSdz
ddd|i|}5|vrnTr.}	||	<||	<|	
}
}dx<<|
=|	|<n$}|||g}|x|
<x<|<k\ddd|S#1swYwxYw#1swY|SxYwrr)rrrlink	link_prev	link_next_keyrlastoldrootoldkey	oldresultKEYNEXTPREVRESULTrr	cache_lenfullrlockrrrr`rrs            r)r#z#_lru_cache_wrapper.<locals>.wrapper6s4u-C

 ~#9=6Iy$&/IdO&/IdO:D.22DJd!%DJ!%DJAID!



!

#D1D1F#
4%<
"G#&GCL&,GFO#4=D!#YF $VI/33DIVf
")E#J :D $V4D;??DJ?deCj&K72DG#
4HMg



#
4HMs;CC*ACCC$cT5cdddS#1swYyxYw)zReport cache statisticsNr)rrrrrrsr)
cache_infoz&_lru_cache_wrapper.<locals>.cache_infoos/
	BdFGY[A	B	B	Bs'cr5jddgdddxddddy#1swYyxYw)z$Clear the cache and cache statisticsNrF)clear)rrrrrr`sr)cache_clearz'_lru_cache_wrapper.<locals>.cache_cleartsG	KKMT4.DGD6D				s -6)rZrr__len__rrr)rrrrr#rrrrrrrrrrrrrrr`rs````   @@@@@@@@@@@@@@r)rr
sxHH(D$VED6D		I

I7D
DT4&DG!|	
		7	7	7	rBB
$G%GNr,)rc&td|S)z@Simple lightweight unbounded cache.  Sometimes called "memoize".N)r)r	)rs r)rrs"9T"=11r,cg}	|Dcgc]}|s|	}}|s|S|D]}|d}|D]
}||ddvsd}ntd|j||D]}|d|k(s|d=gcc}w)zMerges MROs in *sequences* to a single MRO using the C3 algorithm.

    Adapted from https://www.python.org/download/releases/2.3/mro/.

    rrNzInconsistent hierarchy)RuntimeErrorappend)	sequencesrss1	candidates2seqs       r)	_c3_merger'sF
 )/1QQ/	/M	B1I
12& $I

	788

i 	C1v"F	!/s
A+A+Nctt|jD]+\}tdst	|j|z
}nd}|rt|ng}t|jd|}g}t|j|d}|D]?t
|stfd|jDr/|jA|D]|j|Dcgc]}t||}}|Dcgc]}t||}	}|Dcgc]}t||}
}t|gg|z|	z|
z|gz|gz|gzScc}wcc}wcc}w)aComputes 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__rNc36K|]}t|ywrh)
issubclass)rbbases  r)rz_c3_mro.<locals>.<genexpr>s-()
1d#-sabcs)	enumeratereversed	__bases__rrlistr+anyr remove_c3_mror')r]r/iboundaryexplicit_basesabstract_basesother_basesr-explicit_c3_mrosabstract_c3_mros
other_c3_mross       `   r)r6r6s"Xcmm4544./3==)A-H
4:2D#--	23NNs}}XY/0K(c4 --0]]-*

!!$'
(D=KLT40LL=KLT40LL:EF$WT-FMF

	+	,.;	<		*+	,/:m	<MLFs1EE"%E'c	Xtjfd}Dcgc]
}||s|c}fd}Dcgc]
}||r|c}t}g}D]}g}|jD]B}	|	vst|	s|j	|	jD
cgc]	}
|
|vs|
c}
D|s|j	|n|jtd|D]}	|	D]}||vs|j	|!t|Scc}wcc}wcc}
w)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.

    cj|vxr-t|dxrt|txrt|S)N__mro__)rrrr+)typbasesr]s r)
is_relatedz _compose_mro.<locals>.is_relateds?5 :WS)%<:)3C)F%F:%/S%9	;r,c@D]}||k7s	||jvsyy)NTF)rA)rBr4typess  r)is_strict_basez$_compose_mro.<locals>.is_strict_bases,	Ee|u}} 4	r,T)rreverser.)setrA__subclasses__r+r sortrr6)
r]rFrDnrGtype_setmrorBfoundsubr"subclsrCs
``          @r)_compose_mrorRs2
E;/1AQ/E
71^A%6Q7E5zH
C
'%%'	HC%JsC$8FAX
aFG	HJJsO

sD
)	'C
'$JJv&
'	'
'3S!!7
0
8Gs"
DD
D"D"(	D'2D'ct||j}d}|D]T}|I||vrC||jvr5||jvr't||st	dj||n	||vsS|}V|j
|S)a^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.

    NzAmbiguous dispatch: {} or {})rRkeysrAr+rrr)r]registryrNmatchts     r)
_find_implrXssHMMO
,CE
X
!3;;"6"'s{{":&0&:"#A#H#H1$=E<<r,cB	
ddlddl}i
|jd
fdfdfdd
	
fd		fd}t|dd	|
t<	|_|_j
|_j|_
t|||S)akSingle-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.
    rNc!t}|k7rj|	|}|S#t$r+	|}n#t$rt|}YnwxYw||<Y|SwxYw)zgeneric_func.dispatch(cls) -> <function implementation>

        Runs the dispatch algorithm to return the best available implementation
        for the given *cls* registered on *generic_func*.

        )rrKeyErrorrX)r]
current_tokenimplcache_tokendispatch_cacherUs   r)dispatchz singledispatch.<locals>.dispatch2s"+-Mm+$$&+	'!#&D
	'
1}
1!#x0
1"&N3
	's/-	A!=A!AA!AA! A!c@ddlm}m}|||jhvS)Nr)
get_originUnion)typingrbrc	UnionType)r]rbrcrFs   r)_is_union_typez&singledispatch.<locals>._is_union_typeIs,#5%//":::r,cvt|tryddlm}|xrt	d||DS)NTrget_argsc3<K|]}t|tywrh)rr/)rargs  r)rzBsingledispatch.<locals>._is_valid_dispatch_type.<locals>.<genexpr>RsCcJsD)Cs)rr/rdriall)r]rirfs  r)_is_valid_dispatch_typez/singledispatch.<locals>._is_valid_dispatch_typeMs9c4 #s#DCXc]CC	Er,cr|fdS|tddtdi}|stdd}ddlm}t	t||j
\}s,rtd	|d
dtd	|d
drdd
lm}|D]}||<	n|<	tdr
t	
j|S)zgeneric_func.register(cls, func) -> func

        Registers a new implementation for the given *cls* on a *generic_func*.

        c|Srhr)fr]registers r)rz2singledispatch.<locals>.register.<locals>.<lambda>]s#q!1r,z(Invalid first argument to `register()`. z is not a class or union type.rz(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.rhr))r~rrdrrr|rzrrirrr)
r]rannrrargnamerirkrfrmr^r_rqrUs
`      r)rqz singledispatch.<locals>.registerTsQ#3'|11>g;=#0"5C>sgF01
D
.^D%9%?%?%A BCLGS*3/!#&#1'B'!@B
$1'B'!13
#'}
% $

%!HSM730E#F)+Kr,cZ|std|dj|i|S)Nz( requires at least 1 positional argumentr)r~r)rkwr`funcnames  r)r#zsingledispatch.<locals>.wrappersDxj)445
5+xQ))*D7B77r,rzsingledispatch functionrh)rFweakrefWeakKeyDictionaryrrZrqr`MappingProxyTyperUr_clear_cacher)rrxr#rfrmr^r`r_rwrqrUrFs   @@@@@@@@@r)r
r
 sH..0NK.;E22h8tZ)BCHHVGG--h7G)//G7D!Nr,c6eZdZdZdZddZddZedZy)rzSingle-dispatch generic method descriptor.

    Supports wrapping existing descriptors and handles non-descriptor
    callables as instance methods.
    c|t|st|dst|dt||_||_y)Nrz  is not callable or a descriptor)rrr~r

dispatcherrr3rs  r)rjzsingledispatchmethod.__init__s8~gdI&>th&FGHH(.	r,Nc<|jj||S)zgeneric_method.register(cls, func) -> func

        Registers a new implementation for the given *cls* on a *generic_method*.
        r)r~rq)r3r]methods   r)rqzsingledispatchmethod.registers
''&'99r,cfd}j|_j|_t|j|S)Ncjj|dj}|j|i|Srl)r~r`rr)rkwargsrr]rfr3s   r)rz-singledispatchmethod.__get__.<locals>._methods>__--d1g.?.?@F+6>>#s+T<V<<r,)rrqrr)r3rfr]rs``` r)rzsingledispatchmethod.__get__s7	=(,'@'@$==w		*r,c0t|jddSrrrs r)rz)singledispatchmethod.__isabstractmethod__rr,rh)	rrrrrjrqrrrrr,r)rrs,:AAr,rc0eZdZdZdZddZeeZy)rcB||_d|_|j|_yrh)rattrnamerrs  r)rjzcached_property.__init__s	
||r,c|j||_y||jk7rtd|jd|dy)Nz?Cannot assign the same cached_property to two different names (z and z).)rr~)r3ownernames   r)__set_name__zcached_property.__set_name__sM==  DM
T]]
"MM$E$5
#r,Nc||S|jtd	|j}|j
|jt}|tur#|j|}	|||j<|S|S#t$r3dt	|j
d|jd}t|dwxYw#t$r3dt	|j
d|jd}t|dwxYw)NzGCannot use cached_property instance without calling __set_name__ on it.zNo '__dict__' attribute on z instance to cache z
 property.zThe '__dict__' attribute on z7 instance does not support item assignment for caching )	rr~rr r/rr
_NOT_FOUNDr)r3instancerrmsgvals      r)rzcached_property.__get__s K== Y[
[	+%%Eii

z2*))H%C
/'*dmm$
s
#	+-d8n.E.E-HI%%)]]$5ZA
C.d*	+
/24>3J3J2MNDDHMMCTT^` n$.
/sA6#B56<B25<C1rh)	rrrrjrrrrrrr,r)rrs$
6$L1r,r)rFrh);r__all__abcrcollectionsrreprlibr_threadrrFrrrrrr6r9r<rArDrGrKrMrOrSrUrWrYrr
_functoolsImportErrorrZr{r
rrrrr3rrstrrr/rrr	rrr'r6rRrXr
rrrrr,r)<module>rs:
 ""=2,>)#70+&*'+&*'+&+&+&(+&+&+&(+&+&+&(+&+&+&(
$
&	%8'78	!??B	"
E2FE2T%N
O
" st>,\rh	-26+Z("T4vt!A!APX
*2*2C		P		X		X			sHD'D2/D=2E'D/.D/2D:9D:=EEEE