📦 robzwolf / sm-ai-search

sm-ai-search / venv / Lib / __pycache__ / functools.cpython-36.pyc
📄 functools.cpython-36.pyc · 230 lines 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
2303

��EY�|�+@s�dZddddddddd	d
dgZydd
lmZWnek
rBYnXddlmZddlmZddl	m
Z
ddlmZddl
mZyddlmZWn"ek
r�Gdd�d�ZYnXdZZd[Zeefdd�Zeefdd�Zefdd�Zefd d!�Zefd"d#�Zefd$d%�Zefd&d'�Zefd(d)�Zefd*d+�Zefd,d-�Zefd.d/�Zefd0d1�Zefd2d3�Z efd4d5�Z!d6efd7efd8efgd8efd9efd6efgd9efd8efd7efgd7efd6e fd9e!fgd:�Z"d;d�Z#d<d�Z$ydd=lm$Z$Wnek
�r�YnXGd>d	�d	�Z%ydd?lm%Z%Wnek
�r*YnXGd@d
�d
e&�Z'edAdBdCdDdEg�Z(GdFdG�dGe)�Z*e&�fe+e,e-e.dH�he/e.e0fdIdJ�Z1d\dMd�Z2dNdO�Z3yddPlm3Z3Wnek
�r�YnXdQdR�Z4d]dSdT�Z5dUdV�Z6dWdX�Z7dYd�Z8dHS)^zEfunctools.py - Tools for working with functions and callable objects
�update_wrapper�wraps�WRAPPER_ASSIGNMENTS�WRAPPER_UPDATES�total_ordering�
cmp_to_key�	lru_cache�reduce�partial�
partialmethod�singledispatch�)r)�get_cache_token)�
namedtuple)�MappingProxyType)�WeakKeyDictionary)�recursive_repr)�RLockc@s eZdZdZdd�Zdd�ZdS)rz/Dummy reentrant lock for builds without threadscCsdS)N�)�selfrr�:D:\Robbie\Documents\dev\sm-ai-search\venv\lib\functools.py�	__enter__szRLock.__enter__cCsdS)Nr)rZexctypeZexcinstZexctbrrr�__exit__szRLock.__exit__N)�__name__�
__module__�__qualname__�__doc__rrrrrrrsrrrrr�__annotations__�__dict__c
Csnx<|D]4}yt||�}Wntk
r,YqXt|||�qWx$|D]}t||�jt||i��qDW||_|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�updateZ__wrapped__)�wrapper�wrapped�assigned�updated�attr�valuerrrr,s

cCstt|||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	r)r#r$r%rrrrJscCs$|j|�}||kr|S|o"||kS)zIReturn a > b.  Computed by @total_ordering from (not a < b) and (a != b).)�__lt__)r�other�NotImplemented�	op_resultrrr�_gt_from_ltbs
r,cCs|j|�}|p||kS)zEReturn a <= b.  Computed by @total_ordering from (a < b) or (a == b).)r()rr)r*r+rrr�_le_from_ltis
r-cCs|j|�}||kr|S|S)z=Return a >= b.  Computed by @total_ordering from (not a < b).)r()rr)r*r+rrr�_ge_from_ltns
r.cCs$|j|�}||kr|S|p"||kS)zJReturn a >= b.  Computed by @total_ordering from (not a <= b) or (a == b).)�__le__)rr)r*r+rrr�_ge_from_leus
r0cCs"|j|�}||kr|S|o ||kS)zFReturn a < b.  Computed by @total_ordering from (a <= b) and (a != b).)r/)rr)r*r+rrr�_lt_from_le|s
r1cCs|j|�}||kr|S|S)z=Return a > b.  Computed by @total_ordering from (not a <= b).)r/)rr)r*r+rrr�_gt_from_le�s
r2cCs$|j|�}||kr|S|o"||kS)zIReturn a < b.  Computed by @total_ordering from (not a > b) and (a != b).)�__gt__)rr)r*r+rrr�_lt_from_gt�s
r4cCs|j|�}|p||kS)zEReturn a >= b.  Computed by @total_ordering from (a > b) or (a == b).)r3)rr)r*r+rrr�_ge_from_gt�s
r5cCs|j|�}||kr|S|S)z=Return a <= b.  Computed by @total_ordering from (not a > b).)r3)rr)r*r+rrr�_le_from_gt�s
r6cCs$|j|�}||kr|S|p"||kS)zJReturn a <= b.  Computed by @total_ordering from (not a >= b) or (a == b).)�__ge__)rr)r*r+rrr�_le_from_ge�s
r8cCs"|j|�}||kr|S|o ||kS)zFReturn a > b.  Computed by @total_ordering from (a >= b) and (a != b).)r7)rr)r*r+rrr�_gt_from_ge�s
r9cCs|j|�}||kr|S|S)z=Return a < b.  Computed by @total_ordering from (not a >= b).)r7)rr)r*r+rrr�_lt_from_ge�s
r:r3r/r7r()r(r/r3r7csZ�fdd�tD�}|std��t|�}x.t|D]"\}}||kr0||_t�||�q0W�S)z6Class decorator that fills in missing ordering methodscs(g|] }t�|d�tt|d�k	r|�qS)N)r�object)�.0Zop)�clsrr�
<listcomp>�sz"total_ordering.<locals>.<listcomp>z6must define at least one ordering operation: < > <= >=)�_convert�
ValueError�maxrr )r=Zroots�rootZopnameZopfuncr)r=rr�scsG�fdd�dt�}|S)z,Convert a cmp= function into a key= functioncsZeZdZdgZdd�Z�fdd�Z�fdd�Z�fdd	�Z�fd
d�Z�fdd
�Z	dZ
dS)zcmp_to_key.<locals>.K�objcSs
||_dS)N)rC)rrCrrr�__init__�szcmp_to_key.<locals>.K.__init__cs�|j|j�dkS)Nr)rC)rr))�mycmprrr(�szcmp_to_key.<locals>.K.__lt__cs�|j|j�dkS)Nr)rC)rr))rErrr3�szcmp_to_key.<locals>.K.__gt__cs�|j|j�dkS)Nr)rC)rr))rErr�__eq__�szcmp_to_key.<locals>.K.__eq__cs�|j|j�dkS)Nr)rC)rr))rErrr/�szcmp_to_key.<locals>.K.__le__cs�|j|j�dkS)Nr)rC)rr))rErrr7�szcmp_to_key.<locals>.K.__ge__N)rrr�	__slots__rDr(r3rFr/r7�__hash__r)rErr�K�srI)r;)rErIr)rErr�s)rcsJeZdZdZdZ�fdd�Zd	d
�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�|std��t|�dkr td��|^}}}t|�s:td��t|�}t|d�rv|j|}|jj�}|j|�|}~|j	}t
t|�j|�}||_	||_||_|S)Nz1descriptor '__new__' of partial needs an argument�z*type 'partial' takes at least one argumentz#the first argument must be callablerJ)
�	TypeError�len�callable�tuple�hasattrrKrL�copyr!rJ�superr	�__new__)rKrLr=rJZtmpkwr)�	__class__rrrV�s(




zpartial.__new__cOs:|std��|^}}|jj�}|j|�|j|j|�|�S)Nz2descriptor '__call__' of partial needs an argument)rOrLrTr!rJrK)rKrLrZnewkeywordsrrr�__call__s

zpartial.__call__cCs�t|�j}t|j�g}|jdd�|jD��|jdd�|jj�D��t|�jdkrld|�ddj	|��d�S|�ddj	|��d�S)	Ncss|]}t|�VqdS)N)�repr)r<�xrrr�	<genexpr>sz#partial.__repr__.<locals>.<genexpr>css |]\}}|�d|��VqdS)�=Nr)r<�k�vrrrr[s�	functoolsz
functools.�(z, �))
�typerrYrJ�extendrKrL�itemsr�join)r�qualnamerKrrr�__repr__s
zpartial.__repr__cCs*t|�|jf|j|j|jpd|jp$dffS)N)rbrJrKrLr)rrrr�
__reduce__#szpartial.__reduce__cCs�t|t�std��t|�dkr0tdt|�����|\}}}}t|�szt|t�sz|dk	rft|t�sz|dk	r�t|t�r�td��t|�}|dkr�i}nt|�tk	r�t|�}|dkr�i}||_||_||_	||_
dS)Nz(argument to __setstate__ must be a tuple�zexpected 4 items in state, got zinvalid partial state)�
isinstancerRrOrPrQ�dictrbrrJrKrL)r�staterJrK�kwds�	namespacerrr�__setstate__'s(
zpartial.__setstate__)rJrKrLrrM)rrrrrGrVrXrrgrhro�
__classcell__rr)rWrr	�s
)r	c@s<eZdZdZdd�Zdd�Zdd�Zdd	�Zed
d��Z	dS)
r
z�Method descriptor with partial application of the given arguments
    and keywords.

    Supports wrapping existing descriptors and handles non-descriptor
    callables as instance methods.
    cOsrt|�r$t|d�r$tdj|���t|t�r\|j|_|j||_|jj	�|_|jj
|�n||_||_||_dS)N�__get__z${!r} is not callable or a descriptor)rQrSrO�formatrjr
rJrKrLrTr!)rrJrKrLrrrrDMs
zpartialmethod.__init__cCsNdjtt|j��}djdd�|jj�D��}d}|j|jj|jj	|j
||d�S)Nz, css|]\}}dj||�VqdS)z{}={!r}N)rr)r<r]r^rrrr[csz)partialmethod.__repr__.<locals>.<genexpr>z*{module}.{cls}({func}, {args}, {keywords}))�moduler=rJrKrL)re�maprYrKrLrdrrrWrrrJ)rrKrL�
format_stringrrrrgas

zpartialmethod.__repr__cs�fdd�}�j|_�|_|S)Ncs<�jj�}|j|�|^}}|f�jt|�}�j||�S)N)rLrTr!rKrRrJ)rKrLZ
call_keywordsZcls_or_self�restZ	call_args)rrr�_methodms


z3partialmethod._make_unbound_method.<locals>._method)�__isabstractmethod__Z_partialmethod)rrwr)rr�_make_unbound_methodlsz"partialmethod._make_unbound_methodcCs�t|jdd�}d}|dk	rd|||�}||jk	rdt|f|j�|j�}y|j|_Wntk
rbYnX|dkr||j�j||�}|S)Nrq)	rrJr	rKrL�__self__rryrq)rrCr=�get�resultZnew_funcrrrrqws

zpartialmethod.__get__cCst|jdd�S)NrxF)rrJ)rrrrrx�sz"partialmethod.__isabstractmethod__N)
rrrrrDrgryrq�propertyrxrrrrr
EsZ	CacheInfo�hits�misses�maxsizeZcurrsizec@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�<||�|_dS)N)r�)rZtup�hashrrrrD�sz_HashedSeq.__init__cCs|jS)N)r�)rrrrrH�sz_HashedSeq.__hash__N)rrrrrGr�rDrHrrrrr��sr�Nc
s�|}|r*||7}x|j�D]}	||	7}qW|rl||�fdd�|D��7}|r�||�fdd�|j�D��7}n$||�dkr��|d�|kr�|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|]}�|�VqdS)Nr)r<r^)rbrrr[�sz_make_key.<locals>.<genexpr>c3s|]}�|�VqdS)Nr)r<r^)rbrrr[�s�r)rd�valuesr�)
rKrm�typedZkwd_markZ	fasttypesrRrbrP�key�itemr)rbr�	_make_key�s r��Fcs.�dk	rt�t�rtd����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:  http://en.wikipedia.org/wiki/Cache_algorithms#Least_Recently_Used

    Nz)Expected maxsize to be an integer or Nonecst|��t�}t||�S)N)�_lru_cache_wrapper�
_CacheInfor)�
user_functionr")r�r�rr�decorating_function�sz&lru_cache.<locals>.decorating_function)rj�intrO)r�r�r�r)r�r�rr�scs�t��t�d\����i�d�	�
d��j��j�t��
g���ddg�dd�<�dkrh�
�fdd�}nN�dkr����	��
���fdd�}n*���������	�
���
���fd	d�}���	�
��
fd
d�}���	�
�
�fdd
�}||_||_|S)Nrr�rN�Fcs�||�}�d7�|S)Nr�r)rKrmr|)rr�rrr"�s
z#_lru_cache_wrapper.<locals>.wrappercsH�||��}�|��}|�k	r*�d7�|S�||�}|�|<�d7�|S)Nr�r)rKrmr�r|)�cache�	cache_getr~�make_keyr�sentinelr�r�rrr"�s

cs2�
||��}�	�f�|�}|dk	rr|\}}}}||�<||�<�
�}||�<�
�<||�<�
|�<�d7�|SWdQRX�||�}�	��|�kr�n��r�
}	||	�<||	�<|	��
�
�}
�
�}d�
�<�
�<�|
=|	�|<n6�
�}|�
||g}||�<�
�<�|<���k��d7�WdQRX|S)Nr�r)rKrmr��linkZ	link_prevZ	link_nextZ_keyr|ZlastZoldrootZoldkeyZ	oldresult)�KEY�NEXT�PREV�RESULTr�r��	cache_len�fullr~�lockr�r�rrBr�r�rrr"sB


cs ���������SQRXdS)zReport cache statisticsNrr)r�r�r~r�r�rrr�
cache_infoGsz&_lru_cache_wrapper.<locals>.cache_infocs<��.�j���ddg�dd�<d��d�WdQRXdS)z$Clear the cache and cache statisticsNrF)�clearr)r�r�r~r�rrBrr�cache_clearLs
z'_lru_cache_wrapper.<locals>.cache_clear)rr�rNr�)r;r�r{�__len__rr�r�)r�r�r�r�r"r�r�r)r�r�r�r�r�r�r�r�r�r~r�r�r�rrBr�r�r�rr��s**9	r�)r�cCs�g}x�dd�|D�}|s|Sx:|D]2}|d}x$|D]}||dd�kr4d}Pq4WPq"W|dkrhtd��|j|�x|D]}|d|krx|d=qxWqWdS)z�Merges MROs in *sequences* to a single MRO using the C3 algorithm.

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

    cSsg|]}|r|�qSrr)r<�srrrr>ksz_c3_merge.<locals>.<listcomp>rr�NzInconsistent hierarchy)�RuntimeError�append)Z	sequencesr|�s1Z	candidate�s2Zseqrrr�	_c3_mergecs$



r�c
s&x8tt|j��D]"\}�t�d�rt|j�|}PqWd}�rFt��ng�t|jd|��}g}t|j|d��}x:�D]2�t|��rxt�fdd�|jD��rx|j��qxWx|D]��j	��q�W�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__rNc3s|]}t|��VqdS)N)�
issubclass)r<�b)�baserrr[�sz_c3_mro.<locals>.<genexpr>csg|]}t|�d��qS))�abcs)�_c3_mro)r<r�)r�rrr>�sz_c3_mro.<locals>.<listcomp>csg|]}t|�d��qS))r�)r�)r<r�)r�rrr>�scsg|]}t|�d��qS))r�)r�)r<r�)r�rrr>�s)�	enumerate�reversed�	__bases__rSrP�listr��anyr��remover�)
r=r��iZboundaryZexplicit_basesZabstract_basesZother_basesZexplicit_c3_mrosZabstract_c3_mrosZ
other_c3_mrosr)r�r�rr�~s(


r�cs�t�j����fdd���fdd��D���fdd���fdd��D��t���g}x��D]�}g}x<|j�D]0}|�krlt�|�rl|j�fdd�|jD��qlW|s�|j|�qZ|jtd	d
�x,|D]$}x|D]}||kr�|j|�q�Wq�WqZWt�|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|�kot|d�ot�|�S)N�__mro__)rSr�)�typ)�basesr=rr�
is_related�sz _compose_mro.<locals>.is_relatedcsg|]}�|�r|�qSrr)r<�n)r�rrr>�sz _compose_mro.<locals>.<listcomp>cs(x"�D]}||kr||jkrdSqWdS)NTF)r�)r�r))�typesrr�is_strict_base�s
z$_compose_mro.<locals>.is_strict_basecsg|]}�|�s|�qSrr)r<r�)r�rrr>�scsg|]}|�kr|�qSrr)r<r�)�type_setrrr>�sT)r��reverse)r�)�setr��__subclasses__r�r��sortrPr�)r=r��mror�Zfound�subZsubclsr)r�r=r�r�r�r�r�_compose_mro�s*




r�cCsxt||j��}d}xZ|D]R}|dk	r^||kr\||jkr\||jkr\t||�r\tdj||���P||kr|}qW|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 {})r��keysr�r�r�rrr{)r=�registryr��match�trrr�
_find_impl�s



r�csri�t��d����fdd��d����fdd�	��fdd�}|�t<�|_�|_t��|_�j|_t||�|S)	alSingle-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.

    Ncs|�dk	r"t�}�|kr"�j�|�y�|}WnHtk
rvy�|}Wntk
rht|��}YnX|�|<YnX|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)r
r��KeyErrorr�)r=Z
current_tokenZimpl)�cache_token�dispatch_cacher�rr�dispatch�sz singledispatch.<locals>.dispatchcsB|dkr��fdd�S|��<�dkr6t�d�r6t���j�|S)z�generic_func.register(cls, func) -> func

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

        Ncs
��|�S)Nr)�f)r=�registerrr�<lambda>sz2singledispatch.<locals>.register.<locals>.<lambda>r�)rSr
r�)r=rJ)r�r�r�r�)r=rr�sz singledispatch.<locals>.registercs�|dj�||�S)Nr)rW)rK�kw)r�rrr""szsingledispatch.<locals>.wrapper)N)	rr;r�r�rr�r�Z_clear_cacher)rJr"r)r�r�r�r�r�rr�s


)rrrrr)r)r�F)N)9r�__all__�
_functoolsr�ImportError�abcr
�collectionsrr�rZweakrefrZreprlibr�_threadrrrrrr*r,r-r.r0r1r2r4r5r6r8r9r:r?rrr	r;r
r�r�r�r��str�	frozensetrbrRrPr�rr�r�r�r�r�rrrrr�<module>s�


NN
%t
-)