/usr/lib64/python2.7/unittest
NameSizeModeActions
test/-0755rm
case.py439840644editdlrm
case.pyc416780644editdlrm
case.pyo416780644editdlrm
loader.py134970644editdlrm
loader.pyc113760644editdlrm
loader.pyo112360644editdlrm
main.py90830644editdlrm
main.pyc79960644editdlrm
main.pyo79960644editdlrm
result.py63080644editdlrm
result.pyc79250644editdlrm
result.pyo79250644editdlrm
runner.py65330644editdlrm
runner.pyc76310644editdlrm
runner.pyo76310644editdlrm
signals.py24110644editdlrm
signals.pyc27810644editdlrm
signals.pyo27810644editdlrm
suite.py98090644editdlrm
suite.pyc105380644editdlrm
suite.pyo105380644editdlrm
util.py46060644editdlrm
util.pyc45180644editdlrm
util.pyo45180644editdlrm
__init__.py27820644editdlrm
__init__.pyc30370644editdlrm
__init__.pyo30370644editdlrm
__main__.py2380644editdlrm
__main__.pyc4880644editdlrm
__main__.pyo4880644editdlrm
Edit: /usr/lib64/python2.7/unittest/util.pyc (4518B)
 {fc@sdZddlmZmZeZdZedZdZ dZ edZ edd Z d Z d Zd Zd S(sVarious utility functions.i(t namedtuplet OrderedDictiPcCs\yt|}Wn tk r2tj|}nX| sLt|tkrP|S|t dS(Ns [truncated]...(treprt Exceptiontobjectt__repr__tlent _MAX_LENGTH(tobjtshorttresult((s%/usr/lib64/python2.7/unittest/util.pyt safe_reprs cCsd|j|jfS(Ns%s.%s(t __module__t__name__(tcls((s%/usr/lib64/python2.7/unittest/util.pytstrclassscCshd}}g}g}xEtr]y||}||}||kr}|j||d7}x|||kry|d7}q\Wn||kr|j||d7}x|||kr|d7}qWn^|d7}z%x|||kr|d7}qWWd|d7}x|||kr |d7}qWXWqtk rY|j|||j||PqXqW||fS(srFinds 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. iiN(tTruetappendt IndexErrortextend(texpectedtactualtitjtmissingt unexpectedteta((s%/usr/lib64/python2.7/unittest/util.pytsorted_list_differences:              cCsg}g}x|r|j}y|j|Wntk rR|j|nX|rxI||fD]8}yxtr|j|qrWWqftk rqfXqfWqqW|rxU|r|j}|j|yxtr|j|qWWqtk rqXqW||fS||fS(sSame 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. (tpoptremovet ValueErrorRR(RRtignore_duplicateRRtitemtlst((s%/usr/lib64/python2.7/unittest/util.pytunorderable_list_difference>s4           tMismatchsactual expected valuecCst|t|}}t|t|}}t}g}xt|D]\}} | |krlqNnd} } x>t||D]-} || | kr| d7} ||| t||D]-} || | krj| d7} ||| s  ) $ #