a DOg_@sdZddlmZmZddlmZdZdZdZdZ dZ dZ ee ee ee Z dd Z d d Zdd dZddZddZddZddZeddZddZddZdS)zVarious utility functions.) namedtupleCounter) commonprefixTP cCsBt|||}|tkr>d|d|||t||df}|S)Nz%s[%d chars]%s)len_PLACEHOLDER_LEN)s prefixlenZ suffixlenskipr 2/opt/alt/python39/lib64/python3.9/unittest/util.py_shortens&rcsttt|}ttt|}|tkr(|St|tt|tt}|t krxt t|tfdd|DSt tt tfdd|DS)Nc3s|]}|dVqdSNr .0r prefixr r r 'z'_common_shorten_repr..c3s&|]}t|dttVqdSr)r _MIN_DIFF_LEN _MIN_END_LENrrr rr*s) tuplemap safe_reprmaxr _MAX_LENGTHr_MIN_BEGIN_LENr _MIN_COMMON_LENr)argsmaxlenZ common_lenr rr_common_shorten_reprs   r"FcCsNz t|}Wnty(t|}Yn0|r:t|tkr>|S|dtdS)Nz [truncated]...)repr Exceptionobject__repr__rr)objZshortresultr r rr-s  rcCsd|j|jfS)Nz%s.%s) __module__ __qualname__)clsr r rstrclass6sr,cCs4d}}g}g}z||}||}||krT|||d7}|||kr|d7}q           r8cCsFg}|r>|}z||Wqty:||Yq0q||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.)r1r2r5itemr 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 valuecCs,t|t|}}t|t|}}t}g}t|D]\}} | |urHq6d} } t||D] } || | krZ| d7} ||| <qZt|D] \} } | | kr| d7} ||| <q| | kr6t| | | }||q6t|D]X\}} | |urqd} t||D] } || | kr| d7} ||| <qtd| | }||q|S)HReturns list of (cnt_act, cnt_exp, elem) triples where the counts differrr-)listrr% enumeraterange _Mismatchr.)r2r1r tmnZNULLr(r3elemcnt_scnt_tr4Z other_elemdiffr r r_count_diff_all_purposeys<         rMc Cst|t|}}g}|D]2\}}||d}||krt|||}||q|D]&\}}||vrZtd||}||qZ|S)rAr)ritemsgetrEr.) r2r1r rFr(rIrJrKrLr r r_count_diff_hashables     rPN)F)__doc__ collectionsrrZos.pathrZ __unittestrr rrrrrr"rr,r8r=r@rErMrPr r r rs2   ) #