B
I0`3+ @ s d Z ddlmZmZ ddlmZ dZdZdZdZ dZ
dZ ee e e e e
Z dd Z
d
d Zd d
dZdd Zdd Zdd Zdd ZeddZdd Zdd Zd S ) zVarious utility functions. )
namedtupleCounter) commonprefixTP c C sB t | | | }|tkr>d| d | || t | | d f } | S )Nz%s[%d chars]%s)len_PLACEHOLDER_LEN)s prefixlenZ suffixlenskip 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 krxt
t| t fdd| D S t
tt t fdd| D S )Nc 3 s | ]} |d V qd S )Nr
).0r
)prefixr r
r ' s z'_common_shorten_repr..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 ) tuplemap safe_reprmaxr _MAX_LENGTHr _MIN_BEGIN_LENr _MIN_COMMON_LENr )argsmaxlenZ
common_lenr
)r r r _common_shorten_repr s r Fc C sP y t | }W n tk
r* t| }Y nX |r| rB| }y|| W q tk
r> || Y qX qW ||fS )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. r1 itemr
r
r unorderable_list_differenceb s r9 c C s | |k| |k S )z.Return -1 if x < y, 0 if x == y and 1 if x > yr
)xyr
r
r
three_way_cmps s r< ZMismatchzactual expected valuec C sD t | t | }}t|t| }}t }g }xt|D ]\}} | |krJq8d }
} x.t||D ] } || | kr^|
d7 }
||| < q^W x,t|D ] \} }
|
| kr| d7 } ||| < qW |
| kr8t|
| | }|| q8W xlt|D ]`\}} | |krqd} x2t||D ]$} || | k r| d7 } ||| < qW td| | }|| qW |S )zHReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr r) )listr r! enumeraterange _Mismatchr* )r. r- r
tmnZNULLr$ r/ elemcnt_scnt_tr0 Z
other_elemdiffr
r
r _count_diff_all_purposey s< rH 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 itemsgetr@ r* ) r. r- r
rA r$ rD rE rF rG r
r
r _count_diff_hashable s rK N)F)__doc__ collectionsr r Zos.pathr Z
__unittestr r r r r r r r r r( r4 r9 r< r@ rH rK r
r
r
r s(
)
#