Create New Item
Item Type
File
Folder
Item Name
Search file in folder and subfolders...
Are you sure want to rename?
File Manager
/
byp
/
izo
/
con7ext_sym404
/
rintoar.txt
/
opt
/
alt
/
python37
/
lib64
/
python3.7
/
unittest
/
__pycache__
:
util.cpython-37.pyc
Advanced Search
Upload
New Item
Settings
Back
Back Up
Advanced Editor
Save
B � f_ � @ s� d Z ddlmZmZ ddlmZ dZdZdZdZ dZ dZ ee e e e e Z e dks\t �dd � Zd d � Zd d d�Zdd� Zdd� Zdd� Zdd� Zedd�Zdd� Zdd � Zd S ) zVarious utility functions.� )� namedtuple�Counter)� 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 �2/opt/alt/python37/lib64/python3.7/unittest/util.py�_shorten s &r c s� t tt| ��} ttt| ��}|tkr(| S t| �� t� ��t|� t t }|t kr�tt t |� tk spt �t � 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_LEN�AssertionErrorr )�args�maxlenZ common_lenr )r r r �_common_shorten_repr s r Fc C sP y t | �}W n tk r* t�| �}Y nX |r<t|�tk r@|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\|� |� |d7 }x�| | |krX|d7 }qBW n�||kr�|� |� |d7 }xf|| |kr�|d7 }qxW nL|d7 }z x| | |kr�|d7 }q�W W d|d7 }x|| |kr�|d7 }q�W X W q tk �r |�| |d� � |�||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: r5 c C sL g }x>| rB| � � }y|�|� W q tk r> |�|� 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/ r2 �itemr r r �unorderable_list_differenceb s r: 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| | | �}|�|� q8W xlt|�D ]`\}} | |kr�q�d} x2t||�D ]$} || | k� r�| d7 } ||| < � q�W td| | �}|�|� 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% r0 �elem�cnt_s�cnt_tr1 Z other_elem�diffr r r �_count_diff_all_purposey s< rI c C s� t | �t |� }}g }x>|�� D ]2\}}|�|d�}||kr t|||�}|�|� q W x2|�� D ]&\}}||kr`td||�}|�|� q`W |S )zHReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr )r �items�getrA r+ ) r/ r. r rB r% rE rF rG rH r r r �_count_diff_hashable� s rL N)F)�__doc__� collectionsr r Zos.pathr Z __unittestr r r r r r r r r r r) r5 r: r= rA rI rL r r r r �<module> s* ) #