shell bypass 403
3
�� fp � @ s� d dl Z d dlZejd dkZer,eZeZneZeZG dd� d�Z dd� Z
d dd �Z d
d � Z d d
� Z
G dd� d�Zejd k r�dd� Zn d dlmZ dd� Zedkr�d dlZe ejdd�Zejd� x"ed�D ]Zej� ejd� q�W dS ) � N� c @ s* e Zd Zd dd�Zd dd�Zd
d d
�ZdS )�ConsoleProgressBar�d �#c C s( d| _ d| _|| _|| _|| _d| _d S )Nr F)�blocks�current�steps� indicator�out�done)�selfr
r r � r
�/usr/lib/python3.6/util.py�__init__" s zConsoleProgressBar.__init__Nc C s* d| _ |r| jjd| � | jjd� d S )NFz
%s:
z3%--10---20---30---40---50---60---70---80---90--100
)r r
�write)r �messager
r
r �start* s zConsoleProgressBar.start� c C s� | j |7 _ | j}tt| j t| j� d �d �| _| jdkrFd| _| j| }| jj| j| � | jj � | jdkr�| j
r�d| _
| jjd� d S )Nr � �2 T�
) r r �int�round�floatr r
r r �flushr )r �n�old�newr
r
r �step0 s "
zConsoleProgressBar.step)r r )N)r )�__name__�
__module__� __qualname__r r r r
r
r
r r ! s
r c C s g }|j | � |S )N)�extend)�s�lr
r
r � set_to_listB s
r% Fc C s@ t | �std��|r,t| �}|j� |d S x| D ]}|S W dS )a�
Return the first element of a set.
It sometimes useful to return the first element from a set but,
because sets are not indexable, this is rather hard. This function
will return the first element from a set. If sorted is True, then
the set will first be sorted (making this an expensive operation).
Otherwise a random element will be returned (as sets are not ordered).
zempty containterr N)�len�
IndexErrorr% �sort)r# �sortedr$ �xr
r
r �firstG s
r+ c C s: t j� }y| j|�}W n tk
r4 | jd�}Y nX |S )z/Encode given text via preferred system encodingzutf-8)�locale�getpreferredencoding�encode� UnicodeError)�text�encodingZ encoded_textr
r
r � encode_input\ s r2 c C s: t j� }y| j|�}W n tk
r4 | jd�}Y nX |S )z/Decode given text via preferred system encodingzutf-8)r, r- �decoder/ )r0 r1 Z decoded_textr
r
r � decode_inputi s r4 c @ sH e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dS )�
Comparisonz�Class used when implementing rich comparison.
Inherit from this class if you want to have a rich
comparison withing the class, afterwards implement
_compare function within your class.c C s t S )N)�NotImplemented)r �other�methodr
r
r �_compare} s zComparison._comparec C s | j |dd� �S )Nc S s | |kS )Nr
)�a�br
r
r �<lambda>� s z#Comparison.__eq__.<locals>.<lambda>)r9 )r r7 r
r
r �__eq__� s zComparison.__eq__c C s | j |dd� �S )Nc S s | |k S )Nr
)r: r; r
r
r r< � s z#Comparison.__lt__.<locals>.<lambda>)r9 )r r7 r
r
r �__lt__� s zComparison.__lt__c C s | j |dd� �S )Nc S s | |kS )Nr
)r: r; r
r
r r< � s z#Comparison.__le__.<locals>.<lambda>)r9 )r r7 r
r
r �__le__� s zComparison.__le__c C s | j |dd� �S )Nc S s | |kS )Nr
)r: r; r
r
r r< � s z#Comparison.__ge__.<locals>.<lambda>)r9 )r r7 r
r
r �__ge__� s zComparison.__ge__c C s | j |dd� �S )Nc S s | |kS )Nr
)r: r; r
r
r r< � s z#Comparison.__gt__.<locals>.<lambda>)r9 )r r7 r
r
r �__gt__� s zComparison.__gt__c C s | j |dd� �S )Nc S s | |kS )Nr
)r: r; r
r
r r< � s z#Comparison.__ne__.<locals>.<lambda>)r9 )r r7 r
r
r �__ne__� s zComparison.__ne__N) r r r! �__doc__r9 r= r> r? r@ rA rB r
r
r
r r5 v s r5 r � c s G � fdd�d�}|S )z,Convert a cmp= function into a key= functionc s\ e Zd Zdd� Z� fdd�Z� fdd�Z� fdd�Z� fd d
�Z� fd d �Z� fd
d�Z dS )zcmp_to_key.<locals>.Kc W s
|| _ d S )N)�obj)r rE �argsr
r
r r � s z cmp_to_key.<locals>.K.__init__c s � | j |j �dk S )Nr )rE )r r7 )�mycmpr
r r> � s z cmp_to_key.<locals>.K.__lt__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r rA � s z cmp_to_key.<locals>.K.__gt__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r r= � s z cmp_to_key.<locals>.K.__eq__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r r? � s z cmp_to_key.<locals>.K.__le__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r r@ � s z cmp_to_key.<locals>.K.__ge__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r rB � s z cmp_to_key.<locals>.K.__ne__N)
r r r! r r> rA r= r? r@ rB r
)rG r
r �K� s rH r
)rG rH r
)rG r �
cmp_to_key� s rI )rI c C s | |k|| k S )Nr
)r+ �secondr
r
r �cmp� s rK �__main__i� )r z computing pig����MbP?)F)r rD )r, �sys� version_infoZPY3�bytesZ
bytes_type�strZ string_typeZunicoder r% r+ r2 r4 r5 rI � functoolsrK r Ztime�stdout�pr �range�ir Zsleepr
r
r
r �<module> s0 !