𝗖𝗨𝗥𝗥𝗘𝗡𝗧 𝗙𝗜𝗟𝗘 : /usr/lib/python3.9/site-packages/sepolgen/__pycache__//util.cpython-39.pyc
a
B�ij � @ s� d dl Z d dlZejd dkZer,eZeZneZeZG dd� d�Z dd� Z
ddd �Z d
d � Z d d
� Z
G dd� d�Zejdk r�dd� Zn d dlmZ dd� Zedkr�d dlZe ejdd�Ze�d� ed�D ]Ze�� e�d� q�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
�1/usr/lib/python3.9/site-packages/sepolgen/util.py�__init__" s zConsoleProgressBar.__init__Nc C s* d| _ |r| j�d| � | j�d� 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| }| j�| j| � | j� � | jdkr�| j
s�d| _
| j�d� 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 }|� | � |S �N)�extend)�s�lr
r
r � set_to_listB s
r& Fc C s@ t | �std��|r,t| �}|�� |d S | D ]
}| S 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 containerr N)�len�
IndexErrorr& �sort)r$ �sortedr% �xr
r
r �firstG s
r, c C s8 t �� }z| �|�}W n ty2 | �d�}Y n0 |S )z/Encode given text via preferred system encoding�utf-8)�locale�getpreferredencoding�encode� UnicodeError)�text�encodingZ encoded_textr
r
r � encode_input\ s r4 c C s8 t �� }z| �|�}W n ty2 | �d�}Y n0 |S )z/Decode given text via preferred system encodingr- )r. r/ �decoder1 )r2 r3 Z decoded_textr
r
r � decode_inputi s r6 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 within the class, afterwards implement
_compare function within your class.c C s t S r" )�NotImplemented)r �other�methodr
r
r �_compare} s zComparison._comparec C s | � |dd� �S )Nc S s | |kS r" r
��a�br
r
r �<lambda>� � z#Comparison.__eq__.<locals>.<lambda>�r; �r r9 r
r
r �__eq__� s zComparison.__eq__c C s | � |dd� �S )Nc S s | |k S r" r
r< r
r
r r? � r@ z#Comparison.__lt__.<locals>.<lambda>rA rB r
r
r �__lt__� s zComparison.__lt__c C s | � |dd� �S )Nc S s | |kS r" r
r< r
r
r r? � r@ z#Comparison.__le__.<locals>.<lambda>rA rB r
r
r �__le__� s zComparison.__le__c C s | � |dd� �S )Nc S s | |kS r" r
r< r
r
r r? � r@ z#Comparison.__ge__.<locals>.<lambda>rA rB r
r
r �__ge__� s zComparison.__ge__c C s | � |dd� �S )Nc S s | |kS r" r
r< r
r
r r? � r@ z#Comparison.__gt__.<locals>.<lambda>rA rB r
r
r �__gt__� s zComparison.__gt__c C s | � |dd� �S )Nc S s | |kS r" r
r< r
r
r r? � r@ z#Comparison.__ne__.<locals>.<lambda>rA rB r
r
r �__ne__� s zComparison.__ne__N) r r r! �__doc__r; rC rD rE rF rG rH r
r
r
r r7 v s r7 )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 r" ��obj)r rL �argsr
r
r r � s z cmp_to_key.<locals>.K.__init__c s � | j |j �dk S �Nr rK rB ��mycmpr
r rD � s z cmp_to_key.<locals>.K.__lt__c s � | j |j �dkS rN rK rB rO r
r rG � s z cmp_to_key.<locals>.K.__gt__c s � | j |j �dkS rN rK rB rO r
r rC � s z cmp_to_key.<locals>.K.__eq__c s � | j |j �dkS rN rK rB rO r
r rE � s z cmp_to_key.<locals>.K.__le__c s � | j |j �dkS rN rK rB rO r
r rF � s z cmp_to_key.<locals>.K.__ge__c s � | j |j �dkS rN rK rB rO r
r rH � s z cmp_to_key.<locals>.K.__ne__N)
r r r! r rD rG rC rE rF rH r
rO r
r �K� s rQ r
)rP rQ r
rO r �
cmp_to_key� s rR )rR c C s | |k|| k S r" r
)r, �secondr
r
r �cmp� s rT �__main__i� )r z computing pig����MbP?)F)r. �sys� version_infoZPY3�bytesZ
bytes_type�strZ string_typeZunicoder r& r, r4 r6 r7 rR � functoolsrT r �time�stdout�pr �range�ir �sleepr
r
r
r �<module> s0 !
