Mini Shell

Direktori : /proc/thread-self/root/opt/alt/python39/lib64/python3.9/__pycache__/
Current File : //proc/thread-self/root/opt/alt/python39/lib64/python3.9/__pycache__/functools.cpython-39.pyc
a

���e��@s�dZgd�ZddlmZddlmZddlmZddlm	Z	ddl
mZdZd	Z
ee
fd
d�Zee
fdd
�Zefdd�Zefdd�Zefdd�Zefdd�Zefdd�Zefdd�Zefdd�Zefdd�Zefdd�Zefd d!�Zefd"d#�Zefd$d%�Zd&efd'efd(efgd(efd)efd&efgd)efd(efd'efgd'efd&efd)efgd*�Zd+d,�Zd-d.�Zzdd/l mZWne!�y�Yn0e"�Z#e#fd0d1�Z$zdd2l m$Z$Wne!�y�Yn0Gd3d4�d4�Z%zdd5l m%Z%Wne!�y�Yn0Gd6d7�d7e"�Z&d8d9�Z'ed:gd;��Z(Gd<d=�d=e)�Z*e"�fe+e,he-e.e/fd>d?�Z0dXdBdC�Z1dDdE�Z2zddFl m2Z2Wne!�y|Yn0dGdH�Z3dIdJ�Z4dYdLdM�Z5dNdO�Z6dPdQ�Z7dRdS�Z8GdTdU�dU�Z9e"�Z:GdVdW�dW�Z;dKS)ZzEfunctools.py - Tools for working with functions and callable objects
)�update_wrapper�wraps�WRAPPER_ASSIGNMENTS�WRAPPER_UPDATES�total_ordering�cache�
cmp_to_key�	lru_cache�reduce�partial�
partialmethod�singledispatch�singledispatchmethod�cached_property�)�get_cache_token)�
namedtuple)�recursive_repr)�RLock)�GenericAlias)�
__module__�__name__�__qualname__�__doc__�__annotations__)�__dict__c	Csd|D]2}zt||�}Wnty(Yq0t|||�q|D]}t||��t||i��q<||_|S)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)
    )�getattr�AttributeError�setattr�update�__wrapped__)�wrapper�wrapped�assigned�updated�attr�value�r&�./opt/alt/python39/lib64/python3.9/functools.pyr#srcCstt|||d�S)a�Decorator 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#)r
rr(r&r&r'rAs�rcCs*t|��||�}||ur|S|o(||kS)zIReturn a > b.  Computed by @total_ordering from (not a < b) and (a != b).��type�__lt__��self�other�NotImplemented�	op_resultr&r&r'�_gt_from_ltYsr1cCs(t|��||�}||ur|S|p&||kS)zEReturn a <= b.  Computed by @total_ordering from (a < b) or (a == b).r)r,r&r&r'�_le_from_lt`sr2cCs"t|��||�}||ur|S|S)z=Return a >= b.  Computed by @total_ordering from (not a < b).r)r,r&r&r'�_ge_from_ltgsr3cCs*t|��||�}||ur|S|p(||kS)zJReturn a >= b.  Computed by @total_ordering from (not a <= b) or (a == b).�r*�__le__r,r&r&r'�_ge_from_lensr6cCs(t|��||�}||ur|S|o&||kS)zFReturn a < b.  Computed by @total_ordering from (a <= b) and (a != b).r4r,r&r&r'�_lt_from_leusr7cCs"t|��||�}||ur|S|S)z=Return a > b.  Computed by @total_ordering from (not a <= b).r4r,r&r&r'�_gt_from_le|sr8cCs*t|��||�}||ur|S|o(||kS)zIReturn a < b.  Computed by @total_ordering from (not a > b) and (a != b).�r*�__gt__r,r&r&r'�_lt_from_gt�sr;cCs(t|��||�}||ur|S|p&||kS)zEReturn a >= b.  Computed by @total_ordering from (a > b) or (a == b).r9r,r&r&r'�_ge_from_gt�sr<cCs"t|��||�}||ur|S|S)z=Return a <= b.  Computed by @total_ordering from (not a > b).r9r,r&r&r'�_le_from_gt�sr=cCs*t|��||�}||ur|S|p(||kS)zJReturn a <= b.  Computed by @total_ordering from (not a >= b) or (a == b).�r*�__ge__r,r&r&r'�_le_from_ge�sr@cCs(t|��||�}||ur|S|o&||kS)zFReturn a > b.  Computed by @total_ordering from (a >= b) and (a != b).r>r,r&r&r'�_gt_from_ge�srAcCs"t|��||�}||ur|S|S)z=Return a < b.  Computed by @total_ordering from (not a >= b).r>r,r&r&r'�_lt_from_ge�srBr:r5r?r+)r+r5r:r?csV�fdd�tD�}|std��t|�}t|D]"\}}||vr.||_t�||�q.�S)z6Class decorator that fills in missing ordering methodscs(h|] }t�|d�tt|d�ur|�qS�N)r�object)�.0�op��clsr&r'�	<setcomp>��z!total_ordering.<locals>.<setcomp>z6must define at least one ordering operation: < > <= >=)�_convert�
ValueError�maxrr)rH�roots�root�opname�opfuncr&rGr'r�srcsG�fdd�dt�}|S)z,Convert a cmp= function into a key= functioncsZeZdZdgZdd�Z�fdd�Z�fdd�Z�fdd	�Z�fd
d�Z�fdd
�Z	dZ
dS)zcmp_to_key.<locals>.K�objcSs
||_dSrC�rR)r-rRr&r&r'�__init__�szcmp_to_key.<locals>.K.__init__cs�|j|j�dkS�NrrS�r-r.��mycmpr&r'r+�szcmp_to_key.<locals>.K.__lt__cs�|j|j�dkSrUrSrVrWr&r'r:�szcmp_to_key.<locals>.K.__gt__cs�|j|j�dkSrUrSrVrWr&r'�__eq__�szcmp_to_key.<locals>.K.__eq__cs�|j|j�dkSrUrSrVrWr&r'r5�szcmp_to_key.<locals>.K.__le__cs�|j|j�dkSrUrSrVrWr&r'r?�szcmp_to_key.<locals>.K.__ge__N)rrr�	__slots__rTr+r:rYr5r?�__hash__r&rWr&r'�K�sr\)rD)rXr\r&rWr'r�sr)rcCsXt|�}|tur<zt|�}Wq@ty8td�d�Yq@0n|}|D]}|||�}qD|S)a�
    reduce(function, sequence[, initial]) -> value

    Apply a function of two arguments cumulatively to the items of a sequence,
    from left to right, so as to reduce the sequence 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 sequence in the calculation, and serves as a default when the
    sequence is empty.
    z0reduce() of empty sequence with no initial valueN)�iter�_initial_missing�next�
StopIteration�	TypeError)ZfunctionZsequence�initial�itr%Zelementr&r&r'r	�sr	)r	csJeZdZdZdZ�fdd�Zdd�Ze�dd��Zd	d
�Z	dd�Z
�ZS)
r
zSNew function with partial application of the given arguments
    and keywords.
    )�func�args�keywordsr�__weakref__cs^t|�std��t|d�r8|j|}i|j�|�}|j}tt|��|�}||_||_||_|S)Nz#the first argument must be callablerd)	�callablera�hasattrrerfrd�superr
�__new__)rHrdrerfr-��	__class__r&r'rks

zpartial.__new__cOs*i|j�|�}|jg|j�|�Ri|��SrC�rfrdre)r-rerfr&r&r'�__call__*szpartial.__call__cCs�t|�j}t|j�g}|�dd�|jD��|�dd�|j��D��t|�jdkrld|�dd�	|��d�S|�dd�	|��d�S)	Ncss|]}t|�VqdSrC)�repr)rE�xr&r&r'�	<genexpr>2rJz#partial.__repr__.<locals>.<genexpr>css |]\}}|�d|��VqdS)�=Nr&�rE�k�vr&r&r'rr3rJ�	functoolsz
functools.�(�, �))
r*rrprd�extendrerf�itemsr�join)r-�qualnamerer&r&r'�__repr__.s
zpartial.__repr__cCs*t|�|jf|j|j|jpd|jp$dffSrC)r*rdrerfr�r-r&r&r'�
__reduce__8s�zpartial.__reduce__cCs�t|t�std��t|�dkr0tdt|�����|\}}}}t|�rrt|t�rr|dur`t|t�rr|durzt|t�sztd��t|�}|dur�i}nt|�tur�t|�}|dur�i}||_||_||_	||_
dS)Nz(argument to __setstate__ must be a tuple�zexpected 4 items in state, got zinvalid partial state)�
isinstance�tuplera�lenrh�dictr*rrdrerf)r-�staterdre�kwds�	namespacer&r&r'�__setstate__<s4
����zpartial.__setstate__)rrrrrZrkrorrr�r��
__classcell__r&r&rlr'r
s
	r
)r
c@sFeZdZdZdd�Zdd�Zdd�Zd
d	d
�Zedd��Z	e
e�ZdS)rz�Method descriptor with partial application of the given arguments
    and keywords.

    Supports wrapping existing descriptors and handles non-descriptor
    callables as instance methods.
    cOsft|�s t|d�s td�|���t|t�rP|j|_|j||_i|j�|�|_n||_||_||_dS)N�__get__z${!r} is not callable or a descriptor)	rhrira�formatr�rrdrerf)r-rdrerfr&r&r'rTbs�
zpartialmethod.__init__cCsNd�tt|j��}d�dd�|j��D��}d}|j|jj|jj	|j
||d�S)Nrycss|]\}}d�||�VqdS)z{}={!r}N)r�rtr&r&r'rrws�z)partialmethod.__repr__.<locals>.<genexpr>z*{module}.{cls}({func}, {args}, {keywords}))�modulerHrdrerf)r}�maprprerfr|r�rmrrrd)r-rerf�
format_stringr&r&r'rus
�
�zpartialmethod.__repr__cs�fdd�}�j|_�|_|S)Ncs,i�j�|�}�j|g�j�|�Ri|��SrCrn)�cls_or_selfrerfr�r&r'�_method�sz3partialmethod._make_unbound_method.<locals>._method)�__isabstractmethod__�_partialmethod)r-r�r&r�r'�_make_unbound_method�sz"partialmethod._make_unbound_methodNcCs�t|jdd�}d}|durh|||�}||jurht|g|j�Ri|j��}z|j|_WntyfYn0|dur�|���||�}|S)Nr�)	rrdr
rerf�__self__rr�r�)r-rRrH�get�result�new_funcr&r&r'r��s

zpartialmethod.__get__cCst|jdd�S�Nr�F�rrdr�r&r&r'r��sz"partialmethod.__isabstractmethod__)N)
rrrrrTrr�r��propertyr��classmethodr�__class_getitem__r&r&r&r'rZs

rcCst|t�r|j}q|SrC)r�r
rd�rdr&r&r'�_unwrap_partial�s
r��	CacheInfo)�hits�misses�maxsize�currsizec@s(eZdZdZdZefdd�Zdd�ZdS)�
_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.

    �	hashvaluecCs||dd�<||�|_dSrC�r�)r-�tup�hashr&r&r'rT�sz_HashedSeq.__init__cCs|jSrCr�r�r&r&r'r[�sz_HashedSeq.__hash__N)rrrrrZr�rTr[r&r&r&r'r��sr�c
s�|}|r&||7}|��D]}	||	7}q|rh||�fdd�|D��7}|r�||�fdd�|��D��7}n$||�dkr��|d�|vr�|dSt|�S)a�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.

    c3s|]}�|�VqdSrCr&�rErv�r*r&r'rr�rJz_make_key.<locals>.<genexpr>c3s|]}�|�VqdSrCr&r�r�r&r'rr�rJ�r)r|�valuesr�)
rer��typed�kwd_mark�	fasttypesr�r*r��key�itemr&r�r'�	_make_key�s
 r��Fcs~t�t�r�dkrld�nTt��r\t�t�r\�d}�t|��t�}��fdd�|_t||�S�durltd����fdd�}|S)	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(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)

    rr�cs
��d�S�N�r�r�r&r&r�r&r'�<lambda>�rJzlru_cache.<locals>.<lambda>Nz=Expected first argument to be an integer, a callable, or Nonecs(t|��t�}��fdd�|_t||�S)Ncs
��d�Sr�r&r&r�r&r'r�rJz8lru_cache.<locals>.decorating_function.<locals>.<lambda>)�_lru_cache_wrapper�
_CacheInfo�cache_parametersr)�
user_functionr r�r&r'�decorating_functionsz&lru_cache.<locals>.decorating_function)	r��intrh�boolr�r�r�rra)r�r�r�r r�r&r�r'r�s


�rcs�t��t�d\����i�d�	�
d��j��j�t��
g���ddg�dd�<�dkrh�
�fdd�}nN�dur����	��
���fdd�}n*���������	�
���
���fdd�}���	�
��
fdd	�}���	�
�
�fd
d�}||_||_|S)N)rr���rFcs�d7��|i|��}|S�Nr�r&)rer�r�)r�r�r&r'r sz#_lru_cache_wrapper.<locals>.wrappercsL�||��}�|��}|�ur*�d7�|S�d7��|i|��}|�|<|Sr�r&)rer�r�r�)r�	cache_getr��make_keyr��sentinelr�r�r&r'r &s
csp�
||��}�	���|�}|dur�|\}}}}||�<||�<�
�}||�<�
�<||�<�
|�<�d7�|Wd�S�d7�Wd�n1s�0Y�|i|��}�	��|�vr�n���r�
}	||	�<||	�<|	��
�
�}
�
�}d�
�<�
�<�|
=|	�|<n6�
�}|�
||g}||�<�
�<�|<���k�Wd�n1�sb0Y|Sr�r&)rer�r��linkZ	link_prevZ	link_nextZ_keyr�ZlastZoldrootZoldkeyZ	oldresult)�KEY�NEXT�PREV�RESULTrr��	cache_len�fullr��lockr�r�r�rOr�r�r&r'r 5sB&
*cs8�� �������Wd�S1s*0YdS)zReport cache statisticsNr&r&)r�r�r�r�r�r�r&r'�
cache_infonsz&_lru_cache_wrapper.<locals>.cache_infocsP��8�����ddg�dd�<d��d�Wd�n1sB0YdS)z$Clear the cache and cache statisticsNrF)�clearr&)rr�r�r�r�rOr&r'�cache_clearss
z'_lru_cache_wrapper.<locals>.cache_clear)rDr�r��__len__rr�r�)r�r�r�r�r r�r�r&)r�r�r�r�r�rr�r�r�r�r�r�r�r�rOr�r�r�r'r�s**9	r�)r�cCstdd�|�S)z@Simple lightweight unbounded cache.  Sometimes called "memoize".N)r�)r)r�r&r&r'r�srcCs�g}dd�|D�}|s|S|D]2}|d}|D]}||dd�vr.d}qq.qRq|durbtd��|�|�|D]}|d|krp|d=qpqdS)z�Merges MROs in *sequences* to a single MRO using the C3 algorithm.

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

    cSsg|]}|r|�qSr&r&�rE�sr&r&r'�
<listcomp>�rJz_c3_merge.<locals>.<listcomp>rr�NzInconsistent hierarchy)�RuntimeError�append)�	sequencesr��s1�	candidate�s2�seqr&r&r'�	_c3_merge�s"
r�Nc
stt|j��D]$\}�t�d�rt|j�|}q8qd}�rDt��ng�t|jd|��}g}t|j|d��}�D]0�t|��rtt�fdd�|jD��st|���qt|D]���	��q��fdd�|D�}�fdd�|D�}�fd	d�|D�}	t
|gg|||	|g|g|g�S)
a�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__rNc3s|]}t|��VqdSrC)�
issubclass)rE�b)�baser&r'rr�sz_c3_mro.<locals>.<genexpr>csg|]}t|�d��qS���abcs��_c3_mro�rEr�r�r&r'r��rJz_c3_mro.<locals>.<listcomp>csg|]}t|�d��qSr�r�r�r�r&r'r��rJcsg|]}t|�d��qSr�r�r�r�r&r'r��rJ)�	enumerate�reversed�	__bases__rir��listr��anyr��remover�)
rHr��i�boundary�explicit_bases�abstract_bases�other_bases�explicit_c3_mros�abstract_c3_mros�
other_c3_mrosr&)r�r�r'r��sD
��������r�cs�t�j����fdd���fdd��D���fdd���fdd��D��t���g}�D]�}g}|��D]0}|�vrht�|�rh|��fdd�|jD��qh|s�|�|�qX|jtd	d
�|D] }|D]}||vr�|�|�q�q�qXt�|d�S)z�Calculates 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.

    cs(|�vo&t|d�o&t|t�o&t�|�S)N�__mro__)rir�rr�)�typ)�basesrHr&r'�
is_related�s

��z _compose_mro.<locals>.is_relatedcsg|]}�|�r|�qSr&r&�rE�n)r�r&r'r��rJz _compose_mro.<locals>.<listcomp>cs&�D]}||kr||jvrdSqdS)NTF)r�)r�r.)�typesr&r'�is_strict_base�sz$_compose_mro.<locals>.is_strict_basecsg|]}�|�s|�qSr&r&r�)r�r&r'r��rJcsg|]}|�vr|�qSr&r&r�)�type_setr&r'r��rJT)r��reverser�)�setr��__subclasses__r�r��sortr�r�)rHr��mror��found�sub�subclsr&)r�rHr�r�r�r�r'�_compose_mro�s*

rcCstt||���}d}|D]R}|dur\||vrX||jvrX||jvrXt||�sXtd�||���qj||vr|}q|�|�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 {})r�keysr�r�r�r�r�)rH�registryr�match�tr&r&r'�
_find_impls 
���rcs�ddl}ddl}i�|���d����fdd��dd��d
�����fdd�	���fd	d
�}t|dd��|�t<�|_�|_|���|_�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.
    rNcsx�dur"t�}�|kr"���|�z�|}WnDtyrz�|}Wntydt|��}Yn0|�|<Yn0|S)z�generic_func.dispatch(cls) -> <function implementation>

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

        N)rr��KeyErrorr)rH�
current_token�impl)�cache_token�dispatch_cacherr&r'�dispatch1sz singledispatch.<locals>.dispatchcSst|t�ot|t�SrC)r�r*rrGr&r&r'�_is_valid_dispatch_typeHsz/singledispatch.<locals>._is_valid_dispatch_typecs����r |dur���fdd�Sn~|dur8td��d���t�di�}|sXtd��d����}d	d
lm}tt||�����\}����s�td|�d��d���|��<�dur�t�d
�r�t����	�|S)z�generic_func.register(cls, func) -> func

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

        Ncs
��|�SrCr&)�f)rH�registerr&r'r�TrJz2singledispatch.<locals>.register.<locals>.<lambda>z(Invalid first argument to `register()`. z is not a class.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. r�)
rar�typingrr_r]r|rirr�)rHrd�annr�argname)rrrrrrGr'rKs8��
���z singledispatch.<locals>.registercs*|st��d����|dj�|i|��S)Nz( requires at least 1 positional argumentr)rarm)re�kw)r�funcnamer&r'r sszsingledispatch.<locals>.wrapperrzsingledispatch function)N)r��weakref�WeakKeyDictionaryrrDrr�MappingProxyTyperr��_clear_cacher)rdr�rr r&)rrrrrrrr'rs (
rc@s8eZdZdZdd�Zddd�Zddd�Zed	d
��ZdS)
r
z�Single-dispatch generic method descriptor.

    Supports wrapping existing descriptors and handles non-descriptor
    callables as instance methods.
    cCsRt|�s t|d�s t|�d���t|�|_||_t|ttf�rH|j	|_
n||_
dS)Nr�z  is not callable or a descriptor)rhrirar�
dispatcherrdr��staticmethodr��__func__�
_wrapped_func�r-rdr&r&r'rT�s

zsingledispatchmethod.__init__NcCs.t|ttf�rt|jdi�|_|jj||d�S)z�generic_method.register(cls, func) -> func

        Registers a new implementation for the given *cls* on a *generic_method*.
        rr�)r�r r�rr!rrr)r-rH�methodr&r&r'r�s	zsingledispatchmethod.registercs0���fdd�}�j|_�j|_t|�j�|S)Ncs(�j�|dj�}|����|i|��SrU)rrrmr�)re�kwargsr$�rHrRr-r&r'r��sz-singledispatchmethod.__get__.<locals>._method)r�rrr")r-rRrHr�r&r&r'r��s
zsingledispatchmethod.__get__cCst|jdd�Sr�r�r�r&r&r'r��sz)singledispatchmethod.__isabstractmethod__)N)N)	rrrrrTrr�r�r�r&r&r&r'r
�s


r
c@s.eZdZdd�Zdd�Zddd�Zee�ZdS)	rcCs ||_d|_|j|_t�|_dSrC)rd�attrnamerrr�r#r&r&r'rT�szcached_property.__init__cCs8|jdur||_n"||jkr4td|j�d|�d���dS)Nz?Cannot assign the same cached_property to two different names (z and z).)r'ra)r-�owner�namer&r&r'�__set_name__�s

���zcached_property.__set_name__Nc	Cs|dur|S|jdurtd��z
|j}Wn6ty^dt|�j�d|j�d�}t|�d�Yn0|�|jt�}|tu�r|j�v|�|jt�}|tur�|�	|�}z|||j<Wn6ty�dt|�j�d|j�d�}t|�d�Yn0Wd�n1s�0Y|S)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 )
r'rarrr*rr��
_NOT_FOUNDr�rd)r-�instancer(r�msg�valr&r&r'r��s:
�
��

��.zcached_property.__get__)N)	rrrrTr*r�r�rr�r&r&r&r'r�s	
r)r�F)N)<r�__all__�abcr�collectionsr�reprlibr�_threadrr�rrrrrr/r1r2r3r6r7r8r;r<r=r@rArBrKrr�
_functools�ImportErrorrDr^r	r
rr�r�r�r�r��strr�r*r�r�rr�rr�r�rrrr
r+rr&r&r&r'�<module>s�
�
�
�����AJ	�

.t	
-*f5
Zerion Mini Shell 1.0