⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.144
Server IP:
157.245.143.252
Server:
Linux www 6.11.0-9-generic #9-Ubuntu SMP PREEMPT_DYNAMIC Mon Oct 14 13:19:59 UTC 2024 x86_64
Server Software:
nginx/1.26.0
PHP Version:
8.3.11
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
lib
/
python3
/
dist-packages
/
rich
/
__pycache__
/
View File Name :
_ratio.cpython-312.pyc
"TeS d dl Z d dlmZ d dlmZ d dlmZmZmZm Z e j dk\ rd dlm Z nd dl m Z G d de Z d ed e e d ee fd Zd ed ee dee dee d ee f dZ dd ed ee deee d ee fdZedk( rHd dlmZ e G d d Z ed eddd eddd eddd g Z e ee yy) N)Fraction)ceil)castListOptionalSequence) )Protocolc B e Zd ZU dZdZee ed< dZeed< dZ eed< y)Edgez1Any object that defines an edge (such as Layout).Nsize ratio minimum_size) __name__ __module__ __qualname____doc__r r int__annotations__r r -/usr/lib/python3/dist-packages/rich/_ratio.pyr r s& ; D(3- E3NL#r r totaledgesreturnc |D cg c] }|j xs d }}t }d|v rt t || D cg c] \ }\ }}|||f }}}}| t d |D z }|dk r1t || D cg c] \ }}||j xs dn| c}}S ||t d |D } |D ]2 \ }}| |j z |j k s#|j ||< n8 |d } |D ]) \ }}t | |j z | z d \ }} |||< + nd|v rt t t | S c c}w c c}}}w c c}}w )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. Nc 3 ( K | ] }|xs d yw)r Nr ).0r s r <genexpr>z ratio_resolve.<locals>.<genexpr>2 s <ed es r r c 3 B K | ] \ }}|j xs d yw)r N)r )r _edges r r! z ratio_resolve.<locals>.<genexpr>; s KNDDJJO!ONs ) r r enumeratezipsumr r divmodr r r ) r r r$ sizes _Fractionindexr flexible_edges remainingportion remainders r ratio_resolver0 s " .3 3UTdii 4 UE 3I %- (1UE1B'C 'C#|d| DM'C C <e < << > #&eU"3"3JD$ .2\$##(qtC"3 sKNKK *KE4#t'8'88 # 0 0e * "! I - t"(4::)= )I1"Mi #e . E %-H S 5 !!S 4 s EE Eratiosmaximumsvaluesc F t || D cg c] \ }}|r|nd }}}t | }|s|dd S | }g }|j } t ||| D ]F \ }} } |r6|dkD r1t | t ||z |z } | | | z || z }||z }? | | H |S c c}}w )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. r N)r& r' appendminround) r r1 r2 r3 r _max total_ratiototal_remainingresultr5 maximumvalue distributeds r ratio_reducer? Q s 7:&(6K L6K{udte"6KF Lf+K ayOF ]]F!$VXv!> w [1_ guU_-D{-R'STK 5;& ' { *O 5 K 5M "? M Ms B minimumsc b |r"t || D cg c] \ }}|r|nd }}}t | }|dkD sJ d | }g }|j }|dgt | z } n|} t || D ]: \ }} |dkD r t | t ||z |z } n|} || ||z }|| z }< |S c c}}w )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. r zSum of ratios must be > 0)r& r' r5 lenmaxr ) r r1 r@ r _minr9 r: distributed_totalr5 _minimumsminimumr> s r ratio_distributerH q s :=fh:OP:O;5$4%Q&:OPf+K ?7 77?O#% % %FC#f+% fi0w ? gtEO,Ck,Q'RSK)K{u ;& 1 ' Qs B+__main__) dataclassc > e Zd ZU dZee ed< dZeed< dZeed< y)ENr r r r ) r r r r r r r r r r r r rL rL s# "hsm"s c r rL n r )N)sys fractionsr mathr typingr r r r version_infor typing_extensionsr r r0 r? rH r dataclassesrJ rL resolvedprintr' r r r <module>rW s5 1 1v *8 :" :"Xd^ :"S :"z S -1#Y @DS #Y B DH! ! S ! -5d3i-@! #Y! H z% S1T1a=!D!Q-4A "OPH #h- r