][\5@s dZddlmZmZddlmZdZdZdZdZ dZ dZ ee ee ee Z e dks|t dd Zd d Zd d dZddZddZddZddZeddZddZddZddZdS) zVarious utility functions.) namedtuple OrderedDict) commonprefixTP cCsXt|||}|tkrTd|d|||t||df}n|S)Nz%s[%d chars]%s)len_PLACEHOLDER_LEN)s prefixlenZ suffixlenskipr #/usr/lib/python3.4/unittest/util.py_shortens 4rcsttt|}ttt|}|tkr:|St|tt|tt}|t krttt |tkst t t|tfdd|DSt tt tfdd|DS)Nc3s#|]}|dVqdS)Nr ).0r )prefixr r r 'sz'_common_shorten_repr..c3s/|]%}t|dttVqdS)N)r _MIN_DIFF_LEN _MIN_END_LEN)rr )rr r rr*s) tuplemap safe_reprmaxr _MAX_LENGTHr_MIN_BEGIN_LENr _MIN_COMMON_LENAssertionErrorr)argsmaxlenZ common_lenr )rr r_common_shorten_reprs       rFc Cscyt|}Wn!tk r3tj|}YnX| sMt|tkrQ|S|dtdS)Nz [truncated]...)repr Exceptionobject__repr__rr)objZshortresultr r rr-s rcCsd|j|jfS)Nz%s.%s) __module____name__)clsr r rstrclass6sr)cCsnd}}g}g}xKy||}||}||krw|j||d7}x|||krs|d7}qVWn||kr|j||d7}x|||kr|d7}qWn^|d7}z%x|||kr|d7}qWWd|d7}x|||kr|d7}qWXWqtk r`|j||d|j||dPYqXq||fS)arFinds 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. rN)append IndexErrorextend)expectedactualijmissingZ unexpectedear r rsorted_list_difference9s:             r5c Cs\g}xI|rQ|j}y|j|Wq tk rM|j|Yq Xq W||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/r2itemr r runorderable_list_differencebs   r:cCs||k||kS)z.Return -1 if x < y, 0 if x == y and 1 if x > yr )xyr r r three_way_cmpssr=ZMismatchzactual expected valuecCst|t|}}t|t|}}t}g}xt|D]\}} | |krlqNnd} } x>t||D]-} || | kr| d7} ||| t||D]-} || | krj| d7} ||| s,    )   #