AlkantarClanX12

Your IP : 18.117.172.189

Current Path : /proc/self/root/opt/alt/python35/lib64/python3.5/unittest/__pycache__/
Upload File :
Current File : //proc/self/root/opt/alt/python35/lib64/python3.5/unittest/__pycache__/util.cpython-35.pyc



��Yf9�@s
dZddlmZmZddlmZdZdZdZdZ	dZ
dZee	eeee
Zedks|t
�dd	�Zd
d�Zdd
d�Zdd�Zdd�Zdd�Zdd�Zedd�Zdd�Zdd�Zdd�ZdS) zVarious utility functions.�)�
namedtuple�OrderedDict)�commonprefixT�P��cCsUt|�||}|tkrQd|d|�||t|�|d�f}|S)Nz%s[%d chars]%s)�len�_PLACEHOLDER_LEN)�s�	prefixlenZ	suffixlen�skip�r
�2/opt/alt/python35/lib64/python3.5/unittest/util.py�_shortens1rcs�ttt|��}ttt|��}|tkr:|St|��t���t|�tt}|t	kr�ttt	|�tks�t
�t�t|��t��fdd�|D��St�tt	��t��fdd�|D��S)Nc3s#|]}�|�d�VqdS)Nr
)�.0r
)�prefixrr
r�	<genexpr>'sz'_common_shorten_repr.<locals>.<genexpr>c3s/|]%}�t|�d�tt�VqdS)N)r�
_MIN_DIFF_LEN�_MIN_END_LEN)rr
)rrr
rr*s)�tuple�map�	safe_repr�maxr�_MAX_LENGTHr�_MIN_BEGIN_LENr	�_MIN_COMMON_LEN�AssertionErrorr)�args�maxlenZ
common_lenr
)rrr�_common_shorten_reprs  rFcCscyt|�}Wn!tk
r3tj|�}YnX|sMt|�tkrQ|S|dt�dS)Nz [truncated]...)�repr�	Exception�object�__repr__rr)�objZshort�resultr
r
rr-s
rcCsd|j|jfS)Nz%s.%s)�
__module__�__qualname__)�clsr
r
r�strclass6sr)cCsod}}g}g}xLy||}||}||krw|j|�|d7}x�|||krs|d7}qVWn�||kr�|j|�|d7}x|||kr�|d7}q�Wn^|d7}z%x|||kr�|d7}q�WWd|d7}x|||kr|d7}q�WXWqtk
r`|j||d��|j||d��PYqXqW||fS)arFinds elements in only one or the other of two, sorted input lists.

    Returns a two-element tuple of lists.    The first list contains those
    elements in the "expected" list but not in the "actual" list, and the
    second contains those elements in the "actual" list but not in the
    "expected" list.    Duplicate elements in either input list are ignored.
    r�N)�append�
IndexError�extend)�expected�actual�i�j�missingZ
unexpected�e�ar
r
r�sorted_list_difference9s:










r5cCs\g}xI|rQ|j�}y|j|�Wq	tk
rM|j|�Yq	Xq	W||fS)z�Same behavior as sorted_list_difference but
    for lists of unorderable items (like dicts).

    As it does a linear search per item (remove) it
    has O(n*n) performance.)�pop�remove�
ValueErrorr+)r.r/r2�itemr
r
r�unorderable_list_differencebs	
r:cCs||k||kS)z.Return -1 if x < y, 0 if x == y and 1 if x > yr
)�x�yr
r
r�
three_way_cmpssr=ZMismatchzactual expected valuecCs�t|�t|�}}t|�t|�}}t�}g}x�t|�D]�\}}	|	|kriqNd}
}x;t||�D]*}|||	kr�|
d7}
|||<q�Wx:t|�D],\}}
|
|	kr�|d7}|||<q�W|
|krNt|
||	�}|j|�qNWx�t|�D]~\}}	|	|krEq*d}x;t||�D]*}|||	kr[|d7}|||<q[Wtd||	�}|j|�q*W|S)zHReturns list of (cnt_act, cnt_exp, elem) triples where the counts differrr*)�listrr"�	enumerate�range�	_Mismatchr+)r/r.r
�t�m�nZNULLr%r0�elem�cnt_s�cnt_tr1Z
other_elem�diffr
r
r�_count_diff_all_purposeys<	



rIcCs8t�}x(|D] }|j|d�d||<qW|S)z@Return dict of element counts, in the order they were first seenrr*)r�get)�iterable�crEr
r
r�_ordered_count�s	
rMc	Cs�t|�t|�}}g}xW|j�D]I\}}|j|d�}||kr,t|||�}|j|�q,WxE|j�D]7\}}||kr�td||�}|j|�q�W|S)zHReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr)rM�itemsrJrAr+)	r/r.r
rBr%rErFrGrHr
r
r�_count_diff_hashable�srON)�__doc__�collectionsrrZos.pathrZ
__unittestrr	rrrrrrrrr)r5r:r=rArIrMrOr
r
r
r�<module>s,	)#