Operation   : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64
Software     : Apache
Server IP    : 162.0.232.56 | Your IP: 216.73.216.111
Domains      : 1034 Domain(s)
Permission   : [ 0755 ]

U

e5d_�@s�dZd
dl
mZmZ
d
dlmZ
dZdZdZdZ	dZ
dZee	eeee
Zdd	�Z
d
d�Zdd
d�
Zdd�Zdd�Zdd�Zdd�Zedd�Zdd�Zdd�ZdS)zVarious utility functions.�)�
namedtuple�Counter)
�commonprefixT�P��cCsBt|�
|
|}|t
kr>d
|d|
�||t|�
|d�f}|S)Nz%s[%d chars]%s)�len�_PLACEHOLDER_LEN)�
s�	prefixlenZ	suffixlen�skip�r
�%/usr/lib64/python3.8/unittest/util.py�_shortens


&
rcs�tt
t|��
}tt
t|��
}
|
tk
r(|St|�
�t��
�
t|
�
tt}|t	krxt
�t|��t��
fd
d�|D�
�
St
�tt	��t��
fdd�|D�
�
S)Nc
3s|]}
�|
�
d�V
qdS�
Nr
��.0r
��prefixrr
r�	<genexpr>'sz'_common_shorten_repr.<locals>.<genexpr>c
3s&|]}
�t|
�
d�t
t�V
qdSr)r�
_MIN_DIFF_LEN�_MIN_END_LENrrr
rr*s
�)�tuple�map�	safe_repr�maxr�_MAX_LENGTHr�_MIN_BEGIN_LENr	�_MIN_COMMON_LENr)�args�maxlenZ
common_lenr
rr�_common_shorten_reprs 





�


�r!FcCsPzt|�
}Wnt
k
r*


t�|�
}YnX|
r<t|�
tkr@|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+cCs
d
}}g}g}z�||}|
|}||krT|�|�

|d7}|||kr�|d7}q<nv||kr�|�|�

|d7}|
||kr�|d7}qnnD|d7}z|||kr�|d7}q�W5|d7}|
||kr�|d7}q�XWqt
k
�
r


|�||d��

|�|
|d��

Y�
qYqXq||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_difference9s8

























r7cCsHg}|r@|��}z|
�
|�

Wqtk
r<


|�|�

YqXq||
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-)r0r1r4�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}t|�
D]�\}}	|	|krHq6d
}
}t||�D] }|||	krZ|
d7}
|||<qZt|�
D] \}}
|
|	kr�|d7}|||<q�|
|kr6t|
||	�}|�|�

q6t|�
D]X\}}	|	|kr�q�d
}t||�D] }|||	kr�|d7}|||<q�td
||	�}|�|�

q�|S)�HReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr
r,)�listrr$�	enumerate�range�	_Mismatchr-)r1r0r
�
t�
m�
nZNULLr'r2�elem�cnt_s�cnt_tr3Z
other_elem�diffr
r
r�_count_diff_all_purposeys<






























rLc	Cs�t|�
t|
�
}}g}|�
�D]2\}}|�|d
�}||krt|||�}|�|�

q|�
�D]&\}}||krZtd
||�}|�|�

qZ|S)r@r
)r�items�getrDr-)	r1r0r
rEr'rHrIrJrKr
r
r�_count_diff_hashable�s










rON)
F)�__doc__�collectionsrrZos.pathrZ
__unittestrr	rrrrrr!rr+r7r<r?rDrLrOr
r
r
r�<module>
s2








�
��
	)
#