$16 GRAYBYTE WORDPRESS FILE MANAGER $70

�

E,bi_���SrS
SK
JrJr S
SKJr SrSrSrSr	Sr
Sr\\	\-\-\-\
--
r\S
:�de
Sr
S	rSS
j
rSrSrS
rSr\"SS5rSrSrg)zVarious utility functions.�)�
namedtuple�Counter)
�commonprefixT�P��c�n�[
U5
U
-
U-
nU[:�aS
USU
X0[
U5
U-
S4-nU$)Nz%s[%d chars]%s)�len�_PLACEHOLDER_LEN)�
s�	prefixlen�	suffixlen�skips    �4/opt/alt/python313/lib64/python3.13/unittest/util.py�_shortenrsI���q�6�I��	�)�D�����
�*�9�
�t�s�1�v�	�7I�7J�5K�L�L�
��H�c��
^^�[
[[U55
n[[[U55
n
U
[
::aU$[
U5
m[	T5
m[
U
T-
[-[--
nU[:�aK[[-[-U
T-
-[
:de
[T[U5m[
UU4S
jU55
$[T[[5m[
UU4SjU55
$)Nc
3�4># �UH
n
TU
TS-v� M g7f
�
N���.0r�prefixr
s  ��r�	<genexpr>�'_common_shorten_repr.<locals>.<genexpr>'s����:�T�
�V�a�	�
�m�+�T�s�
c
3�Z># �UH n
T[
U
TS[[5-v� M" g7f
r)r�
_MIN_DIFF_LEN�_MIN_END_LENrs  ��rrr*s,����
 ��Q��(�1�Y�Z�=�-��N�N��s�(+
)�tuple�map�	safe_repr�maxr
�_MAX_LENGTHr�_MIN_BEGIN_LENr�_MIN_COMMON_LENr)�args�maxlen�
common_lenrr
s   @@r�_common_shorten_reprr)s������Y��%�&�D�
��S�$��
 �F�
�����
�$�
�F��F��I���9�$�~�5�8H�H�
J
�J��O�#�� 0�0�?�B���"�
$�&1�
2�
	2�
2��&�.�*�=���:�T�:�:�:�
�f�n�o�
>�F��
 ��
 �
 �
 rc��[
U5
nU
(a[	U5
[
:aU$US[
S
-$![a [RU5
nNIf=f
)Nz [truncated]...)�repr�	Exception�object�__repr__r
r#)�obj�short�results   rr!r!-sW��&��c����C��K�+�-��
��,�;��"3�3�3��	�
&�����%��
&�s�5�A�
Ac
�<�UR<
S
UR<
3$)N�
.)�
__module__�__qualname__)
�clss
 r�strclassr76s���n�n�c�&6�&6�7�7rc��S
=
p#/n/nXnXnXg:a.UR
U5
 US-
nXU:XaUS-
nXU:XaMOlXg:�a.UR
U5
 US-
nXU:XaUS-
nXU:XaMO9US-
nXU:XaUS-
nXU:XaMUS-
nXU:XaUS-
nXU:XaMM�!US-
nXU:XaUS-
nXU:XaMff=f
![a+ URXS5
 URXS5
 XE4$f=f
)a^
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�missing�
unexpected�
e�
as        r�sorted_list_differencerE9sa
��
�I�A��G��J�
�	���A��	�A��u����q�!��Q��
��k�Q�&���F�A��k�Q�&�����!�!�!�$��Q��
��i�1�n���F�A��i�1�n���Q��
��"�+��*��Q��
�#�+��*���F�A� �)�q�.��Q��
�!�)�q�.�+��(��F�A� �)�q�.��Q��
�!�)�q�.���	��N�N�8�B�<�(����f�R�j�)�����		�s;�8C�0C�8C�>B3�C�3C�C�C�0D
�	
D
c��/nU(a+UR
5nU
RU5
 U(aM+X!4$![a URU5
 N)f=f
)
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>rA�items    r�unorderable_list_differencerKbsV���G�
��|�|�~��	!��M�M�$���(��?���	�
	!��N�N�4� �
	!�s�8�A�
Ac��X
:�X
:-
$)
z.Return -1 if x < y, 0 if x == y and 1 if x > yr)�
x�
ys  r�
three_way_cmprOss��
�E�a�e��r�Mismatchzactual expected valuec�B�[
U5
[
U
5
p2[U5
[U5
pT[5n/n[U5
H{up�X�LaMS
=
p�[	X�5HnX,U	:XdM
U
S-
n
XbU'M [U5
Hup�X�:XdMUS-
nXcU'M X�:wdM^[X�U	5nUR
U5
 M} [U5
HOup�X�LaMS
n[	X�5HnX<U	:XdM
US-
nXcU'M [S
X�5nUR
U5
 MQ U$)�HReturns list of (cnt_act, cnt_exp, elem) triples where the counts differrr9)�listr
r-�	enumerate�range�	_Mismatchr:)r>r=r�
t�
m�
n�NULLr1r?�elem�cnt_s�cnt_tr@�
other_elem�diffs               r�_count_diff_all_purposer`ys#
����<��h��q��q�6�3�q�6�q��8�D�
�F��Q�<��
��<������q��A��t�t�|���
���!���'�q�\�M�A��!���
���!��*��>��U�4�0�D��M�M�$�� � �Q�<��
��<�����q��A��t�t�|���
���!�����E�(���
�
�d�� ��Mrc�L
�[
U5
[
U
5
p2/nUR5H;upVURUS
5nXg:wdM[XgU5nUR	U5
 M= UR5H)upWXR;
dM[S
Xu5nUR	U5
 M+ U$)rRr)r�items�getrVr:)	r>r=rrWr1r[r\r]r_s	         r�_count_diff_hashablerd�s����6�?�G�H�-�q�
�F��w�w�y������d�A����>��U�4�0�D��M�M�$��	!�
�w�w�y����=��Q��,�D��M�M�$��!��MrN)
F)�__doc__�collectionsrr�os.pathr�
__unittestr#rr$rr%rrr)r!r7rErKrOrVr`rdrrr�<module>ri
s��


� �+� �
�
�������������!1�1�O�C� �
!�#/�
0�1�
��
����

�
 �*
4�

8�&
�R

�"
�
�z�#:�;�	�!
�F

r