관리-도구
편집 파일: _ratio.cpython-38.pyc
U &?�f_ � @ s2 d dl Z d dlmZ d dlmZ d dlmZmZmZm Z e j dkrPd dlm Z n d dl m Z G dd� de �Z ee e ee d �d d �Zeee ee ee ee d �d d�Zdeee eee ee d�dd�Zedk�r.d dlmZ eG dd� d��Zededdd�eddd�eddd�g�Zeee�� dS )� N)�Fraction)�ceil)�cast�List�Optional�Sequence)� � )�Protocolc @ s: e Zd ZU dZdZee ed< dZeed< dZ eed< dS )�Edgez1Any object that defines an edge (such as Layout).N�size� �ratio� minimum_size) �__name__� __module__� __qualname__�__doc__r r �int�__annotations__r r � r r �E/opt/hc_python/lib/python3.8/site-packages/pip/_vendor/rich/_ratio.pyr s r )�total�edges�returnc C s� dd� |D �}t }d|kr�dd� tt||��D �}| tdd� |D �� }|dkrddd� t||�D �S ||td d� |D ���}|D ]&\}}||j |jkr�|j||< qq�|d�} |D ](\}}t||j | d �\} } | ||< q�q�qttt |�S ) a� Divide total space to satisfy size, ratio, and minimum_size, constraints. The returned list of integers should add up to total in most cases, unless it is impossible to satisfy all the constraints. For instance, if there are two edges with a minimum size of 20 each and `total` is 30 then the returned list will be greater than total. In practice, this would mean that a Layout object would clip the rows that would overflow the screen height. Args: total (int): Total number of characters. edges (List[Edge]): Edges within total space. Returns: List[int]: Number of characters for each edge. c S s g | ]}|j pd �qS �N)r )�.0�edger r r � <listcomp>% s z!ratio_resolve.<locals>.<listcomp>Nc S s$ g | ] \}\}}|d kr||f�qS r r )r �indexr r r r r r , s �c s s | ]}|p d V qdS )r Nr )r r r r r � <genexpr>2 s z ratio_resolve.<locals>.<genexpr>r c S s& g | ] \}}|d kr |j p dn|�qS )Nr )r )r r r r r r r 5 s �c s s | ]\}}|j pd V qdS )r N)r )r �_r r r r r ; s r ) r � enumerate�zip�sumr r �divmodr r r ) r r �sizes� _Fraction�flexible_edges� remaining�portionr r � remainderr r r r � ratio_resolve s2 �� � r, )r �ratios�maximums�valuesr c C s� dd� t ||�D �}t|�}|s,|dd� S | }g }|j}t |||�D ]R\}} } |r�|dkr�t| t|| | ��} || | � || 8 }||8 }qF|| � qF|S )ad Divide an integer total in to parts based on ratios. Args: total (int): The total to divide. ratios (List[int]): A list of integer ratios. maximums (List[int]): List of maximums values for each slot. values (List[int]): List of values Returns: List[int]: A list of integers guaranteed to sum to total. c S s g | ]\}}|r|nd �qS �r r )r r �_maxr r r r _ s z ratio_reduce.<locals>.<listcomp>Nr )r# r$ �append�min�round) r r- r. r/ � total_ratio�total_remaining�resultr2 r �maximum�value� distributedr r r � ratio_reduceQ s r; )r r- �minimumsr c C s� |rdd� t ||�D �}t|�}|dks0td��| }g }|j}|dkrVdgt|� }n|}t ||�D ]D\}} |dkr�t| t|| | ��} n|} || � ||8 }|| 8 }qd|S )a< Distribute an integer total in to parts based on ratios. Args: total (int): The total to divide. ratios (List[int]): A list of integer ratios. minimums (List[int]): List of minimum values for each slot. Returns: List[int]: A list of integers guaranteed to sum to total. c S s g | ]\}}|r|nd �qS r0 r )r r �_minr r r r s z$ratio_distribute.<locals>.<listcomp>r zSum of ratios must be > 0N)r# r$ �AssertionErrorr2 �len�maxr ) r r- r< r5 r6 �distributed_totalr2 � _minimumsr �minimumr: r r r �ratio_distributeq s$ rD �__main__)� dataclassc @ s6 e Zd ZU dZee ed< dZeed< dZeed< dS )�ENr r r r ) r r r r r r r r r r r r r rG � s rG �n r )N)�sys� fractionsr �mathr �typingr r r r � version_infor Z pip._vendor.typing_extensionsr r r, r; rD r � dataclassesrF rG �resolved�printr$ r r r r �<module> s6 > � ! � � $ (