File manager

3


 \9�@s�dZd
dl
mZmZ
d
dlmZ
dZdZdZdZ	dZ
dZee	eeee
Zed
ks\t
�
dd	�Zd
d�Zd d
d�
Zdd�Zdd�Zdd�Zdd�Zedd�Zdd�Zdd�Zdd�ZdS)!zVarious utility functions.�)�
namedtuple�OrderedDict)
�commonprefixT�P��cCsBt|�
|
|}|t
kr>d
|d|
�||t|�
|d�f}|S)Nz%s[%d chars]%s)�len�_PLACEHOLDER_LEN)�
s�	prefixlenZ	suffixlen�skip�r
�%/usr/lib64/python3.6/unittest/util.py�_shortens


&
rcs�tt
t|��
}tt
t|��
}
|
tk
r(|St|�
�t��
�
t|
�
tt}|t	kr�ttt	|
�
tkspt
�
t�t|��t��
fd
d�|D�
�
St�tt	��t��
fdd�|D�
�
S)Nc
3s|]}
�|
�
d�V
qdS)
Nr
)�.0r
)�prefixrr
r�	<genexpr>'sz'_common_shorten_repr.<locals>.<genexpr>c
3s&|]}
�t|
�
d�t
t�V
qdS)
N)r�
_MIN_DIFF_LEN�_MIN_END_LEN)rr
)rrr
rr*s
)�tuple�map�	safe_repr�maxr�_MAX_LENGTHr�_MIN_BEGIN_LENr	�_MIN_COMMON_LEN�AssertionErrorr)�args�maxlenZ
common_lenr
)rrr�_common_shorten_reprs 













rFcCsRyt|�
}Wnt
k
r*


tj|�
}YnX|
s>t|�
tkrB|S|dt�d
S)Nz [truncated]...)�repr�	Exception�object�__repr__rr)�objZshort�resultr
r
rr-s






rc

Csd
|j|j
fS)Nz%s.%s)�
__module__�__qualname__)
�clsr
r
r�strclass6s
r)cCs*
d
}}g}g}�
xy�||}|
|}||kr\|j|�

|d7}x�|||krX|d7}qBWn�||kr�|j|�

|d7}xf|
||kr�|d7}qxWnL|d7}zx|||kr�|d7}q�WWd|d7}x|
||kr�|d7}q�WXWqt
k
�
r


|j||d��

|j|
|d��

PYqXqW||fS)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_difference9s:



























r5cCsLg}x>|rB|j�}y|
j
|�

Wqtk
r>


|j|�

YqXqW||
fS)
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_differencebs





r:cCs||
k||
kS)
z.Return -1 if x < y, 0 if x == y and 1 if x > yr
)�
x�
yr
r
r�
three_way_cmpssr=ZMismatchzactual expected valuecCsD
t|�
t|
�
}}t
|�
t
|�
}}t�}g}x�t|�
D]�\}}	|	|krJq8d
}
}x.t||�D] }|||	kr^|
d7}
|||<q^Wx,t|�
D] \}}
|
|	kr�|d7}|||<q�W|
|kr8t|
||	�}|j|�

q8Wxlt|�
D]`\}}	|	|kr�q�d
}x2t||�D]$}|||	k�r�|d7}|||<�q�Wtd
||	�}|j|�

q�W|S)zHReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr
r*)�listrr"�	enumerate�range�	_Mismatchr+)r/r.r
�
t�
m�
nZNULLr%r0�elem�cnt_s�cnt_tr1Z
other_elem�diffr
r
r�_count_diff_all_purposeys<



























rIc
Cs,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�
crEr
r
r�_ordered_count�s



rMc	Cs�t|�
t|
�
}}g}x>|j
�D]2\}}|j|d
�}||kr t|||�}|j|�

q Wx2|j
�D]&\}}||kr`td
||�}|j|�

q`W|S)zHReturns list of (cnt_act, cnt_exp, elem) triples where the counts differr
)rM�itemsrJrAr+)	r/r.r
rBr%rErFrGrHr
r
r�_count_diff_hashable�s










rON)
F)�__doc__�collectionsrrZos.pathrZ
__unittestrr	rrrrrrrrr)r5r:r=rArIrMrOr
r
r
r�<module>
s,







	)
#