File Manager

Editing File: /lib64/python3.6/unittest/pycache/util.cpython-36.opt-1.pyc

� \9������������������@���s����d�Z�ddlmZmZ�ddlmZ�dZdZdZdZ	dZ
dZee	e�e�e�e
��Zdd	��Z
d
d��Zd d
d�Zdd��Zdd��Zdd��Zdd��Zedd�Zdd��Zdd��Zdd��ZdS�)!zVarious utility functions.�����)�
namedtuple�OrderedDict)�commonprefixT�P�����������c�������������C���sB���t�|��|�|�}|tkr>d|�d�|��||�t�|��|�d���f�}�|�S�)Nz%s[%d chars]%s)�len�_PLACEHOLDER_LEN)�s�	prefixlenZ	suffixlen�skip��r
����%/usr/lib64/python3.6/unittest/util.py�_shorten���s����&r���c�����������������s����t�tt|���}�ttt|���}|tkr(|�S�t|����t����t|��t�t��}|t	krxt
��t|���t����fdd�|�D���S�t
��tt	���t����fdd�|�D���S�)Nc�������������3���s���|�]}��|�d����V��qd�S�)Nr
���)�.0r
���)�prefixr���r
���r����	<genexpr>'���s����z'_common_shorten_repr.<locals>.<genexpr>c�������������3���s&���|�]}��t�|�d���tt��V��qd�S�)N)r����
_MIN_DIFF_LEN�_MIN_END_LEN)r���r
���)r���r���r
���r���r���*���s���)�tuple�map�	safe_repr�maxr����_MAX_LENGTHr����_MIN_BEGIN_LENr	����_MIN_COMMON_LENr���)�args�maxlenZ
common_lenr
���)r���r���r����_common_shorten_repr���s����r���Fc�������������C���sR���yt�|��}W�n�tk
r*���tj|��}Y�nX�|�s>t|�tk�rB|S�|d�t��d�S�)Nz [truncated]...)�repr�	Exception�object�__repr__r���r���)�objZshort�resultr
���r
���r���r���-���s����r���c�������������C���s���d|�j�|�jf�S�)Nz%s.%s)�
__module__�__qualname__)�clsr
���r
���r����strclass6���s����r(���c�������������C���s*��d�}}g�}g�}�xy�|�|�}||�}||k�r\|j�|��|d7�}x�|�|�|krX|d7�}qBW�n�||kr�|j�|��|d7�}xf||�|kr�|d7�}qxW�nL|d7�}zx|�|�|kr�|d7�}q�W�W�d|d7�}x||�|kr�|d7�}q�W�X�W�q�tk
�r���|j|�|d����|j||d����P�Y�qX�qW�||fS�)ar��Finds 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_difference9���s:����

r4���c�������������C���sL���g�}x>|�rB|�j���}y|j|��W�q�tk
r>���|j|��Y�qX�qW�||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.���r1����itemr
���r
���r����unorderable_list_differenceb���s����r9���c�������������C���s���|�|k|�|k��S�)z.Return -1 if x < y, 0 if x == y and 1 if x > yr
���)�x�yr
���r
���r����
three_way_cmps���s����r<���ZMismatchzactual expected valuec�������������C���sD��t�|��t�|��}}t|�t|��}}t��}g�}x�t|�D�]�\}}	|	|krJq8d�}
}x.t||�D�] }||�|	kr^|
d7�}
|||<�q^W�x,t|�D�] \}}
|
|	kr�|d7�}|||<�q�W�|
|kr8t|
||	�}|j|��q8W�xlt|�D�]`\}}	|	|kr�q�d}x2t||�D�]$}||�|	k��r�|d7�}|||<���q�W�td||	�}|j|��q�W�|S�)zHReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr���r)���)�listr���r!����	enumerate�range�	_Mismatchr*���)r.���r-���r
����t�m�nZNULLr$���r/����elem�cnt_s�cnt_tr0���Z
other_elem�diffr
���r
���r����_count_diff_all_purposey���s<����rH���c�������������C���s,���t���}x |�D�]}|j|d�d�||<�qW�|S�)z@Return dict of element counts, in the order they were first seenr���r)���)r����get)�iterable�crD���r
���r
���r����_ordered_count����s����
rL���c�������	������C���s����t�|��t�|��}}g�}x>|j��D�]2\}}|j|d�}||kr t|||�}|j|��q W�x2|j��D�]&\}}||kr`td||�}|j|��q`W�|S�)zHReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr���)rL����itemsrI���r@���r*���)	r.���r-���r
���rA���r$���rD���rE���rF���rG���r
���r
���r����_count_diff_hashable����s����rN���N)F)�__doc__�collectionsr���r���Zos.pathr���Z
__unittestr���r	���r���r���r���r���r���r���r���r(���r4���r9���r<���r@���rH���rL���rN���r
���r
���r
���r����<module>���s*���
	)
#

Back to Directory File Manager

Editing File: /lib64/python3.6/unittest/__pycache__/util.cpython-36.opt-1.pyc

Editing File: /lib64/python3.6/unittest/pycache/util.cpython-36.opt-1.pyc