/opt/imh/python3.13/lib/python3.13/unittest/__pycache__
Edit: /opt/imh/python3.13/lib/python3.13/unittest/__pycache__/util.cpython-313.pyc (7176B)
e_ S r SSKJrJr SSKJr SrSrSrSr Sr
Sr \\ \- \ - \- \
- -
r \ S: d eS r
S rSS
jrS rS rS
rS r\" SS5 rS rS rg)zVarious utility functions. )
namedtupleCounter) commonprefixTP c n [ U 5 U-
U-
nU[ : a SU S U X0[ U 5 U-
S 4- n U $ )Nz%s[%d chars]%s)len_PLACEHOLDER_LEN)s prefixlen suffixlenskips 3/opt/imh/python3.13/lib/python3.13/unittest/util.py_shortenr sI q6I )D *9
ts1v 7I7J5K L L H c ^^ [ [ [ U 5 5 n [ [ [ U 5 5 nU[
:: a U $ [
U 5 m[ T5 m[
UT-
[ - [ - -
nU[ : aK [ [ - [ - UT-
- [
: d e[ T[ U5 m[ UU4S jU 5 5 $ [ T[ [ 5 m[ UU4S jU 5 5 $ )Nc 3 4 ># U H
nTUTS - v M g 7fN .0r prefixr
s r
'_common_shorten_repr..' s :TVa
m+Ts c 3 Z ># U H nT[ UTS [ [ 5 - v M" g 7fr )r
_MIN_DIFF_LEN _MIN_END_LENr s r r r * 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 [ U 5 nU( a [ U5 [
: a U$ US [
S- $ ! [ a [ R U 5 n NIf = f)Nz [truncated]...)repr Exceptionobject__repr__r
r# )objshortresults r r! r! - sW &c CK+-
,; "3 33 & %&s 5 AAc < U R < SU R < 3$ )N.)
__module__ __qualname__)clss r strclassr7 6 s nnc&6&6 77r c S=p#/ n/ n X nX nXg: a. UR U5 US-
nX U:X a US-
nX U:X a M OlXg: a. UR U5 US-
nX U:X a US-
nX U:X a M O9US-
n X U:X a US-
nX U:X a M US-
nX U:X a US-
nX U:X a M M ! US-
nX U:X a US-
nX U:X a M f f = f! [ a+ UR XS 5 UR XS 5 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
IndexErrorextend)expectedactualijmissing
unexpectedeas r sorted_list_differencerE 9 sa
IAGJ
A Auq!Q kQ&FA kQ&!!!$Q i1nFA i1n Q "+*Q #+* FA )q.Q !)q.+ ( FA )q.Q !)q. NN8B< ( fRj ) s; 8C 0C 8C >B3 C 3CCC 0D
D
c / nU ( a+ U R 5 n UR U5 U ( a M+ X!4$ ! [ a UR U5 N)f = f)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
ValueErrorr: )r= r> rA items r unorderable_list_differencerK b sV G
||~ ! MM$ ( ? ! NN4 !s 8 AAc X: X: -
$ )z.Return -1 if x < y, 0 if x == y and 1 if x > yr )xys r
three_way_cmprO s s
Eae r Mismatchzactual expected valuec B [ U 5 [ U5 p2[ U5 [ U5 pT[ 5 n/ n[ U5 H{ u pXL a M S=p[ X5 H n X, U :X d M
U
S-
n
XbU ' M [ U5 H u pX:X d M U S-
n XcU ' M X:w d M^ [ XU 5 nUR
U5 M} [ U5 HO u pXL a M Sn [ X5 H n X< U :X d M
U S-
n XcU ' M [ SX5 nUR
U5 MQ U$ )HReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr r9 )listr
r- enumeraterange _Mismatchr: )r> r= r tmnNULLr1 r? elemcnt_scnt_tr@
other_elemdiffs r _count_diff_all_purposer` y s# <h q q63q6q 8D
F Q< < qAtt|
! 'q\MA!
! * > U40D MM$ Q< < qAtt|
! E(
d Mr c L [ U 5 [ U5 p2/ nUR 5 H; u pVUR US5 nXg:w d M [ XgU5 nUR U5 M= UR 5 H) u pWXR; d M [ SXu5 nUR U5 M+ U$ )rR r )r itemsgetrV r: ) r> r= r rW r1 r[ r\ r] r_ s r _count_diff_hashablerd s 6?GH -q
Fwwy dA > U40D MM$ !
wwy = Q,D MM$ ! Mr N)F)__doc__ collectionsr r os.pathr
__unittestr# r r$ r r% r r r) r! r7 rE rK rO rV r` rd r r r ri s +
!11OC !#/01
*48& R"
z#: ; !Fr