��Yf9 � @ s
d Z d d l m Z m Z d d l m Z d Z d Z d Z d Z d Z
d Z e e e e e e
Z e d k s| t
� d d � Z d
d � Z d d
d � Z d d � Z d d � Z d d � Z d d � Z e d d � Z d d � Z d d � Z d d � Z d S) zVarious utility functions.� )�
namedtuple� OrderedDict)� commonprefixT�P � � c C sU t | � | | } | t k rQ d | d | � | | t | � | d � f } | S)Nz%s[%d chars]%s)�len�_PLACEHOLDER_LEN)�s� prefixlenZ suffixlen�skip� r
�2/opt/alt/python35/lib64/python3.5/unittest/util.py�_shorten s 1r c s� t t t | � � } t t t | � � } | t k r: | St | � � t � � � t | � t t } | t k r� t t t | � t k s� t
� t � t | � � t � � f d d � | D� � St � t t � � t � � f d d � | D� � S)Nc 3 s# | ] } � | � d � Vq d S)Nr
)�.0r
)�prefixr r
r � <genexpr>' s z'_common_shorten_repr.<locals>.<genexpr>c 3 s/ | ]% } � t | � d � t t � Vq d S)N)r �
_MIN_DIFF_LEN� _MIN_END_LEN)r r
)r r r
r r * s ) �tuple�map� safe_repr�maxr � _MAX_LENGTHr �_MIN_BEGIN_LENr �_MIN_COMMON_LEN�AssertionErrorr )�args�maxlenZ
common_lenr
)r r r �_common_shorten_repr s r Fc C sc y t | � } Wn! t k
r3 t j | � } Yn X| sM t | � t k rQ | S| d t � d S)Nz [truncated]...)�repr� Exception�object�__repr__r r )�objZshort�resultr
r
r r - s
r c C s d | j | j f S)Nz%s.%s)�
__module__� __qualname__)�clsr
r
r �strclass6 s r) c C so d } } g } g } xLy| | } | | } | | k rw | j | � | d 7} x� | | | k rs | d 7} qV Wn� | | k r� | j | � | d 7} x | | | k r� | d 7} q� Wn^ | d 7} z% x | | | k r� | d 7} q� WWd | d 7} x | | | k r| d 7} q� WXWq t k
r`| j | | d � � | j | | d � � PYq Xq W| | f S)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�
IndexError�extend)�expected�actual�i�j�missingZ
unexpected�e�ar
r
r �sorted_list_difference9 s:
r5 c C s\ g } xI | rQ | j � } y | j | � Wq t k
rM | j | � Yq Xq W| | f S)z�Same 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.)�pop�remove�
ValueErrorr+ )r. r/ r2 �itemr
r
r �unorderable_list_differenceb s
r: c C s | | k | | k S)z.Return -1 if x < y, 0 if x == y and 1 if x > yr
)�x�yr
r
r �
three_way_cmps s r= ZMismatchzactual expected valuec C s� t | � t | � } } t | � t | � } } t � } g } x� t | � D]� \ } } | | k ri qN d }
} x; t | | � D]* } | | | k r� |
d 7}
| | | <q� Wx: t | � D], \ } }
|
| k r� | d 7} | | | <q� W|
| k rN t |
| | � } | j | � qN Wx� t | � D]~ \ } } | | k rEq*d } x; t | | � D]* } | | | k r[| d 7} | | | <q[Wt d | | � } | j | � q*W| S)zHReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr r* )�listr r" � enumerate�range� _Mismatchr+ )r/ r. r
�t�m�nZNULLr% r0 �elem�cnt_s�cnt_tr1 Z
other_elem�diffr
r
r �_count_diff_all_purposey s<
rI c C s8 t � } x( | D] } | j | d � d | | <q W| S)z@Return dict of element counts, in the order they were first seenr r* )r �get)�iterable�crE r
r
r �_ordered_count� s
rM c C s� t | � t | � } } g } xW | j � D]I \ } } | j | d � } | | k r, t | | | � } | j | � q, WxE | j � D]7 \ } } | | k r� t d | | � } | j | � q� W| S)zHReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr )rM �itemsrJ rA r+ ) r/ r. r
rB r% rE rF rG rH r
r
r �_count_diff_hashable� s rO N)�__doc__� collectionsr r Zos.pathr Z
__unittestr r r r r r r r r r r) r5 r: r= rA rI rM rO r
r
r
r �<module> s, ) #