/usr/lib64/python3.6/unittest/__pycache__
Edit: /usr/lib64/python3.6/unittest/__pycache__/util.cpython-36.opt-1.pyc (4688B)
3
\9 @ 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 d Zd S )!zVarious utility functions. )
namedtuple OrderedDict) commonprefixTP c C sB t | | | }|tkr>d| d | || t | | d f } | S )Nz%s[%d chars]%s)len_PLACEHOLDER_LEN)s prefixlenZ suffixlenskip r
%/usr/lib64/python3.6/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 sR y t | }W n tk
r* tj| }Y nX | s>t|tk rB|S |d t d S )Nz [truncated]...)repr Exceptionobject__repr__r r )objZshortresultr
r
r r - s r c C s d| j | jf S )Nz%s.%s)
__module__ __qualname__)clsr
r
r strclass6 s r( c C s* d }}g }g }xy| | }|| }||k r\|j | |d7 }x| | |krX|d7 }qBW n||kr|j | |d7 }xf|| |kr|d7 }qxW nL|d7 }z x| | |kr|d7 }qW W d|d7 }x|| |kr|d7 }qW X W q tk
r |j| |d |j||d P Y qX qW ||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
IndexErrorextend)expectedactualijmissingZ
unexpectedear
r
r sorted_list_difference9 s:
r4 c C sL g }x>| rB| j }y|j| W q tk
r> |j| 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|
| | }|j| q8W xlt|D ]`\}} | |krqd} x2t||D ]$} || | k r| d7 } ||| < qW td| | }|j| 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 }x | D ]}|j|dd ||< q W |S )z@Return dict of element counts, in the order they were first seenr r) )r get)iterablecrD r
r
r _ordered_count s
rL c C s t | t | }}g }x>|j D ]2\}}|j|d}||kr t|||}|j| q W x2|j D ]&\}}||kr`td||}|j| q`W |S )zHReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr )rL itemsrI r@ r* ) r. r- r
rA r$ rD rE rF rG r
r
r _count_diff_hashable s rN N)F)__doc__ collectionsr r Zos.pathr Z
__unittestr r r r r r r r r r( r4 r9 r< r@ rH rL rN r
r
r
r s*
)
#