Name	Size	Mode	Actions
case.cpython-35.opt-1.pyc	51881	0644	editdlrm
case.cpython-35.opt-2.pyc	36468	0644	editdlrm
case.cpython-35.pyc	51941	0644	editdlrm
loader.cpython-35.opt-1.pyc	14994	0644	editdlrm
loader.cpython-35.opt-2.pyc	12299	0644	editdlrm
loader.cpython-35.pyc	15122	0644	editdlrm
main.cpython-35.opt-1.pyc	7742	0644	editdlrm
main.cpython-35.opt-2.pyc	7551	0644	editdlrm
main.cpython-35.pyc	7742	0644	editdlrm
mock.cpython-35.opt-1.pyc	65756	0644	editdlrm
mock.cpython-35.opt-2.pyc	50228	0644	editdlrm
mock.cpython-35.pyc	65756	0644	editdlrm
result.cpython-35.opt-1.pyc	7774	0644	editdlrm
result.cpython-35.opt-2.pyc	6163	0644	editdlrm
result.cpython-35.pyc	7774	0644	editdlrm
runner.cpython-35.opt-1.pyc	7499	0644	editdlrm
runner.cpython-35.opt-2.pyc	6865	0644	editdlrm
runner.cpython-35.pyc	7499	0644	editdlrm
signals.cpython-35.opt-1.pyc	2377	0644	editdlrm
signals.cpython-35.opt-2.pyc	2368	0644	editdlrm
signals.cpython-35.pyc	2377	0644	editdlrm
suite.cpython-35.opt-1.pyc	9913	0644	editdlrm
suite.cpython-35.opt-2.pyc	8824	0644	editdlrm
suite.cpython-35.pyc	9913	0644	editdlrm
util.cpython-35.opt-1.pyc	5148	0644	editdlrm
util.cpython-35.opt-2.pyc	4287	0644	editdlrm
util.cpython-35.pyc	5227	0644	editdlrm
__init__.cpython-35.opt-1.pyc	3183	0644	editdlrm
__init__.cpython-35.opt-2.pyc	1411	0644	editdlrm
__init__.cpython-35.pyc	3183	0644	editdlrm
__main__.cpython-35.opt-1.pyc	464	0644	editdlrm
__main__.cpython-35.opt-2.pyc	420	0644	editdlrm
__main__.cpython-35.pyc	464	0644	editdlrm

 y�zf9�@s
dZd
dl
mZmZ
d
dlmZ
dZdZdZdZ dZ dZee eeee Zed
ks|t �
dd �Zd d�Zdd d�
Zdd�Zdd�Zdd�Zdd�Zedd�Zdd�Zdd�Zdd�ZdS) zVarious utility functions.�)� namedtuple�OrderedDict)
�commonprefixT�P��cCsUt|�
|
|}|t
krQd
|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


1
rcs�tt
t|��
}tt
t|��
}
|
tk
r:|St|�
�t��
�
t|
�
tt}|t kr�ttt |
�
tks�t �
t�t|��t��
fd
d�|D�
�
St�tt ��t��
fdd�|D�
�
S)Nc
3s#|]}
�|
�
d�V
qdS)
Nr )�.0r )�prefixrr r� 'sz'_common_shorten_repr..c
3s/|]%}
�t|
�
d�t
t�V
qdS)
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!t
k r3


tj|�
}Yn
X|
sMt|�
tkrQ|S|dt�d
S)Nz [truncated]...)�repr� Exception�object�__repr__rr)�objZshort�resultr r rr-s






rc

Csd
|j|j
fS)Nz%s.%s)� __module__�__qualname__)
�clsr r r�strclass6s
r)cCso
d
}}g}g}xL
y
||}|
|}||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�WXWqt
k r`



|j||d��

|j|
|d��

PYqXqW||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_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} |||
s,






 )#