/usr/lib64/python3.12/unittest/__pycache__
Edit: /usr/lib64/python3.12/unittest/__pycache__/util.cpython-312.pyc (7259B)
{|j_ d Z ddlmZmZ ddlmZ dZdZdZdZ dZ
dZ ee ez e z ez e
z z
Z e dk\ sJ d Z
d Zdd
Zd Zd Zd
Zd Z edd Zd Zd Zy)zVarious utility functions. )
namedtupleCounter) commonprefixTP c n t | |z
|z
}|t kD rd| d | || t | |z
d fz } | S )Nz%s[%d chars]%s)len_PLACEHOLDER_LEN)s prefixlen suffixlenskips &/usr/lib64/python3.12/unittest/util.py_shortenr sK q6I )D *9
tQs1v 7I7J5K L L H c t t t | } t t t | }|t
k r| S t
| t t
|z
t z t z z
}|t kD rIt t z t z |z
z t
k sJ t t | t fd| D S t t t t fd| D S )Nc 3 . K | ] }|d z y wN .0r prefixr
s r
z'_common_shorten_repr..' s :TVa
m+Ts c 3 T K | ] }t |d t t z ! y wr )r
_MIN_DIFF_LEN _MIN_END_LENr s r r z'_common_shorten_repr..* s- Q (1YZ=- NN s %() tuplemap safe_reprmaxr
_MAX_LENGTHr _MIN_BEGIN_LENr _MIN_COMMON_LENr )argsmaxlen
common_lenr r
s @@r _common_shorten_reprr( s Y% &D
S$
F
$
FF I 9$~58HHJJO# 00?B"$&12 2 2&.*=:T:::
fno
>F r c t | }|rt | t
k r|S |d t
dz S # t $ r t j | }Y Bw xY w)Nz [truncated]...)repr Exceptionobject__repr__r
r" )objshortresults r r r - sW &c CK+-
,; "3 33 & %&s / AAc 8 | j d| j S )N.)
__module__ __qualname__)clss r strclassr6 6 s nnc&6&6 77r c dx}}g }g } | | }|| }||k r-|j | |dz
}| | |k( ry|dz
}| | |k( rnj||kD r-|j | |dz
}|| |k( rG|dz
}|| |k( rn8|dz
} | | |k( r|dz
}| | |k( r|dz
}|| |k( r|dz
}|| |k( r # |dz
}|| |k( r|dz
}|| |k( rw w xY w# t $ r. |j | |d |j ||d Y ||fS w xY w)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
IndexErrorextend)expectedactualijmissing
unexpectedeas r sorted_list_differencerD 9 s
IAGJ
Aq A1uq!Q qkQ&FA qkQ&Q!!!$Q Qi1nFA Qi1n Q "1+*Q #1+* FA )q.Q !)q.+ ( FA )q.Q !)q. NN8AB< ( fQRj ) J sA :C 1C 8C ?B2 C 0C 2CCC 1D
D
c g }| r%| j } |j | | r%||fS # t $ r |j | Y #w xY w)zSame 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.)popremove
ValueErrorr9 )r< r= r@ items r unorderable_list_differencerJ b sV G
||~ ! MM$ F? ! NN4 !s . A
A c | |kD | |k z
S )z.Return -1 if x < y, 0 if x == y and 1 if x > yr )xys r
three_way_cmprN s s
Ea!e r Mismatchzactual expected valuec < t | t | }}t | t | }}t }g }t | D ]y \ }} | |u r dx}
} t || D ] } || | k( s |
dz
}
||| < t | D ] \ } }
|
| k( s | dz
} ||| < |
| k7 s\t |
| | }|j
| { t | D ]N \ }} | |u r d} t || D ] } || | k( s | dz
} ||| < t d| | }|j
| P |S )HReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr r8 )listr
r, enumeraterange _Mismatchr9 )r= r< r tmnNULLr0 r> elemcnt_scnt_tr?
other_elemdiffs r _count_diff_all_purposer_ y sI <h qA q63q6qA 8D
F Q<4 4< q!Att|
! 'q\MAzT!
! * E> UE40D MM$ Q<4 4< q!Att|
! E4(
d Mr c H t | t | }}g }|j D ]; \ }}|j |d }||k7 s t ||| }|j | = |j D ]( \ }}||vs t d|| }|j | * |S )rQ r )r itemsgetrU r9 ) r= r< r rV r0 rZ r[ r\ r^ s r _count_diff_hashablerc s 6?GH -qA
Fwwy edA E> UE40D MM$ !
wwy e q= Qt,D MM$ ! Mr N)F)__doc__ collectionsr r os.pathr
__unittestr" r r# r r$ r r r( r r6 rD rJ rN rU r_ rc r r r rh s +
!11OC !#/01
*48& R"
z#: ; !Fr