50 lines
3.6 KiB
Plaintext
50 lines
3.6 KiB
Plaintext
|
Ë
|
|||
|
|
†R jÏ ã ó@ — d dl mZ d dlZ dd„Zdd„Zy)é )Ú annotationsNc óš — t | du|du|dug« dkD r t d« ‚|dk s|dk rt d|› d|› d�« ‚|�N|dz
|
|||
|
|
|dz
|
|||
|
|
z }t t |d« |« }|dk( rd} n%||k( rd } n t |« }||kD r|}n
|
|||
|
|
|d |d f}|�‚t |t « r|\ }}n|x}}t t |d« |dz
|
|||
|
|
« }t t |d« |dz
|
|||
|
|
« }t j |dz
|
|||
|
|
|z « t j |dz
|
|||
|
|
|z « f} | €dx} }
|
|||
|
|
nt | t « r| \ } }
|
|||
|
|
n| x} }
|
|||
|
|
|
|
|||
|
|
dk s| dk r t d
|
|||
|
|
« ‚| |
|
|||
|
|
fS ) a1 Calculate chunk sizes.
|
|||
|
|
|
|||
|
|
Args:
|
|||
|
|
chunk_size (int or tuple(int, int), optional): Chunk size in (y, x) directions, or the same
|
|||
|
|
size in both directions if only one is specified. Cannot be negative.
|
|||
|
|
chunk_count (int or tuple(int, int), optional): Chunk count in (y, x) directions, or the
|
|||
|
|
same count in both directions if only one is specified. If less than 1, set to 1.
|
|||
|
|
total_chunk_count (int, optional): Total number of chunks. If less than 1, set to 1.
|
|||
|
|
ny (int): Number of grid points in y-direction.
|
|||
|
|
nx (int): Number of grid points in x-direction.
|
|||
|
|
|
|||
|
|
Return:
|
|||
|
|
tuple(int, int): Chunk sizes (y_chunk_size, x_chunk_size).
|
|||
|
|
|
|||
|
|
Note:
|
|||
|
|
Zero or one of ``chunk_size``, ``chunk_count`` and ``total_chunk_count`` should be
|
|||
|
|
specified.
|
|||
|
|
Né zGOnly one of chunk_size, chunk_count and total_chunk_count should be seté z'(ny, nx) must be at least (2, 2), not (z, ú)r )r r z chunk_size cannot be negative) ÚsumÚ
|
|||
|
|
ValueErrorÚminÚmaxÚ two_factorsÚ
|
|||
|
|
isinstanceÚtupleÚmathÚceil) Ú
|
|||
|
|
chunk_sizeÚ chunk_countÚtotal_chunk_countÚnyÚnxÚmax_chunk_countÚfactorsÚ
|
|||
|
|
y_chunk_countÚ
|
|||
|
|
x_chunk_countÚ y_chunk_sizeÚ x_chunk_sizes úR/home/antigravity/intellecton/venv/lib/python3.12/site-packages/contourpy/chunk.pyÚcalc_chunk_sizesr s¡ € ô2 ˆJ˜dÐ " K°tÐ$;Ð=NÐVZÐ=ZÐ [Ó\Ð_`Ò`ÜÐbÓcÐcà ˆA‚v��a’ÜÐBÀ2À$ÀbÈÈÈAÐNÓOÐOàÐ$Ø ˜a™4 " Q¡$™-ˆÜ ¤Ð$5°qÓ 9¸?Ó KÐØ Ò !؉JØ
|
|||
|
|
/Ò
|
|||
|
|
1Ø ‰Jä!Ð"3Ó4ˆGØ�BŠwØ %‘ à & q™z¨7°1©:Ð 6� àÐ Ü �k¤5Ô )Ø+6Ñ (ˆM™=à,7Ð 7ˆM˜MÜœC
|
|||
|
|
¨qÓ 1°2°a±4Ó8ˆ
|
|||
|
|
ÜœC
|
|||
|
|
¨qÓ 1°2°a±4Ó8ˆ
|
|||
|
|
Ü—i‘i A¡¨ Ñ 6Ó7¼¿¹ÀBÀqÁDÈMÑCYÓ9ZÐ[ˆ
|
|||
|
|
àÐØ&'Ð'ˆ ‘|Ü �J¤Ô &Ø%/Ñ"ˆ ‘là&0Ð0ˆ �|à�aÒ˜<¨!Ò+ÜÐ8Ó9Ð9à ˜ Ð %Ð%ó c óÈ — | dk rt d| › �« ‚t j t j | « « }| |z dk7 r|dz }| |z dk7 rŒ| |z }||kD r||fS ||fS )aR Split an integer into two integer factors.
|
|||
|
|
|
|||
|
|
The two factors will be as close as possible to the sqrt of n, and are returned in decreasing
|
|||
|
|
order. Worst case returns (n, 1).
|
|||
|
|
|
|||
|
|
Args:
|
|||
|
|
n (int): The integer to factorize, must be positive.
|