mirror of
https://github.com/microsoft/PowerToys.git
synced 2026-04-10 05:06:36 +02:00
47 lines
4.3 KiB
Plaintext
47 lines
4.3 KiB
Plaintext
|
<03>
|
|||
|
|
<EFBFBD>W`Sc @ s<> d Z d d l m Z m Z e Z d Z e d <00> Z d <00> Z d <00> Z
|
|||
|
|
e d <00> Z e d d <00> Z d
|
|||
|
|
<00> Z
d <00> Z d <00> Z d
S( s Various utility functions.i<><69><EFBFBD><EFBFBD>( t
|
|||
|
|
namedtuplet OrderedDictiP c C s\ y t | <00> } Wn t k
|
|||
|
|
r2 t j | <00> } n X| sL t | <00> t k rP | S| t d S( Ns [truncated]...( t reprt Exceptiont objectt __repr__t lent _MAX_LENGTH( t objt shortt result( ( s .\Lib\unittest\util.pyt safe_repr s
c C s d | j | j f S( Ns %s.%s( t
|
|||
|
|
__module__t __name__( t cls( ( s .\Lib\unittest\util.pyt strclass s c C sh d } } g } g } xEt r]y| | } | | } | | k r} | j | <00> | d 7} x<> | | | k ry | d 7} q\ Wn<57> | | k r<> | j | <00> | 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} qWXWq t k
|
|||
|
|
rY| j | | <1F> | j | | <1F> Pq Xq W| | f S( sr 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.
|
|||
|
|
i i N( t Truet appendt
|
|||
|
|
IndexErrort extend( t expectedt actualt it jt missingt
|
|||
|
|
unexpectedt et a( ( s .\Lib\unittest\util.pyt sorted_list_difference s:
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
c C s g } g } x<> | r<> | j <00> } y | j | <00> Wn t k
|
|||
|
|
rR | j | <00> n X| r xI | | f D]8 } y x t r<> | j | <00> qr WWqf t k
|
|||
|
|
r<> qf Xqf Wq q W| rxU | r| j <00> } | j | <00> y x t r<> | j | <00> q<> WWq<57> t k
|
|||
|
|
rq<> Xq<58> W| | f S| | f S( s<> 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.
|
|||
|
|
( t popt removet
|
|||
|
|
ValueErrorR R ( R R t ignore_duplicateR R t itemt lst( ( s .\Lib\unittest\util.pyt unorderable_list_difference> s4
|
|||
|
|
t Mismatchs actual expected valuec C s<> t | <00> t | <00> } } t | <00> t | <00> } } t <00> } g } x<> t | <00> D]<5D> \ } } | | k rl qN n d }
|
|||
|
|
} x> t | | <00> D]- } | | | k r<> |
|
|||
|
|
d 7}
|
|||
|
|
| | | <q<> q<> Wx= t | <00> D]/ \ } }
|
| k r<> | d 7} | | | <q<> q<> W|
|
|||
|
|
| k rN t |
|
|||
|
|
| | <00> } | j | <00> qN qN Wx<57> t | <00> D]<5D> \ } } | | k rTq6n d } x> t | | <00> D]- } | | | k rj| d 7} | | | <qjqjWt d | | <00> } | j | <00> q6W| S( sH Returns list of (cnt_act, cnt_exp, elem) triples where the counts differi i ( t listR R t enumeratet ranget _MismatchR ( R R t st tt mt nt NULLR
|
|||
|
|
R t elemt cnt_st cnt_tR t
|
|||
|
|
other_elemt diff( ( s .\Lib\unittest\util.pyt _count_diff_all_purposed s<
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
c C s8 t <00> } x( | D] } | j | d <00> d | | <q W| S( s@ Return dict of element counts, in the order they were first seeni i ( R t get( t iterablet cR. ( ( s .\Lib\unittest\util.pyt _ordered_count<6E> s
c C s<> t | <00> t | <00> } } g } xZ | j <00> D]L \ } } | j | d <00> } | | k r, t | | | <00> } | j | <00> q, q, WxH | j <00> D]: \ } } | | k r<> t d | | <00> } | j | <00> q<> q<> W| S( sH Returns list of (cnt_act, cnt_exp, elem) triples where the counts differi ( R7 t itemsR4 R( R ( R R R) R* R
|
|||
|
|
R. R/ R0 R2 ( ( s .\Lib\unittest\util.pyt _count_diff_hashable<6C> s N( t __doc__t collectionsR R R t
|
|||
|
|
__unittestR t FalseR R R R# R( R3 R7 R9 ( ( ( s .\Lib\unittest\util.pyt <module> s
|
|||
|
|
) $ #
|