File manager - Edit - /opt/saltstack/salt/lib/python3.10/site-packages/rich/__pycache__/_ratio.cpython-310.pyc
Back
o ;j� � @ s d dl mZ d dlmZ d dlmZmZmZmZm Z G dd� de �Z de dee dee fd d �Z de d ee d ee d ee dee f dd�Z dde d ee deee dee fdd�Zedkr�d dlmZ eG dd� d��Ze deddd�eddd�eddd�g�Zeee�� dS dS )� )�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 �?/opt/saltstack/salt/lib/python3.10/site-packages/rich/_ratio.pyr s r �total�edges�returnc C s� dd� |D �}t }d|v rtdd� tt||��D �}| tdd� |D �� }|dkr2dd� t||�D �S ||td d� |D ���}|D ]\}}||j |jkrS|j||< n q@|d�} |D ]\}}t||j | d �\} } | ||< qZnd|v s ttt |�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 u r||f�qS r r )r �indexr r r r r r & s �c s s � | ]}|pd V qdS )r Nr )r r r r r � <genexpr>, s � z ratio_resolve.<locals>.<genexpr>r c S s& g | ]\}}|d u r|j pdn|�qS )Nr )r )r r r r r r r / s �� �c s s � | ] \}}|j p d V qdS )r N)r )r �_r r r r r 5 s � r ) r � enumerate�zip�sumr r �divmodr r r ) r r ZsizesZ _FractionZflexible_edges� remainingZportionr r � remainderr r r r � ratio_resolve s4 ��� � �$r& �ratios�maximums�valuesc C s� dd� t ||�D �}t|�}|s|dd� S | }g }|j}t |||�D ])\}} } |rH|dkrHt| t|| | ��} || | � || 8 }||8 }q#|| � q#|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 � g | ] \}}|r |nd �qS �r r )r r Z_maxr r r r Y � z ratio_reduce.<locals>.<listcomp>Nr )r! r" �append�min�round) r r' r( r) � total_ratio�total_remaining�resultr- r Zmaximum�value� distributedr r r � ratio_reduceK s r5 N�minimumsc C s� |r dd� t ||�D �}t|�}|dksJ d��| }g }|j}|du r+dgt|� }n|}t ||�D ]"\}} |dkrFt| t|| | ��} n|} || � ||8 }|| 8 }q2|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 r* r+ r )r r Z_minr r r r y r, z$ratio_distribute.<locals>.<listcomp>r zSum of ratios must be > 0N)r! r" r- �len�maxr ) r r' r6 r0 r1 Zdistributed_totalr- Z _minimumsr Zminimumr4 r r r �ratio_distributek s$ r9 �__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 r< � s r< �n r r )Z fractionsr �mathr �typingr r r r r r r r& r5 r9 r Z dataclassesr; r< Zresolved�printr" r r r r �<module> sB =���� �!��� � �$ (�
| ver. 1.4 |
Github
|
.
| PHP 8.2.30 | Generation time: 0 |
proxy
|
phpinfo
|
Settings