OXIESEC PANEL
- Current Dir:
/
/
snap
/
certbot
/
4730
/
lib
/
python3.12
/
site-packages
/
pip
/
_vendor
/
rich
Server IP: 139.59.38.164
Upload:
Create Dir:
Name
Size
Modified
Perms
📁
..
-
06/10/2025 09:51:14 PM
rwxr-xr-x
📄
__init__.py
5.95 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
__main__.py
8.28 KB
06/10/2025 09:50:50 PM
rw-r--r--
📁
__pycache__
-
06/10/2025 09:51:14 PM
rwxr-xr-x
📄
_cell_widths.py
9.97 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_emoji_codes.py
136.95 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_emoji_replace.py
1.04 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_export_format.py
2.08 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_extension.py
265 bytes
06/10/2025 09:50:50 PM
rw-r--r--
📄
_fileno.py
799 bytes
06/10/2025 09:50:50 PM
rw-r--r--
📄
_inspect.py
9.43 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_log_render.py
3.15 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_loop.py
1.21 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_null_file.py
1.36 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_palettes.py
6.9 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_pick.py
423 bytes
06/10/2025 09:50:50 PM
rw-r--r--
📄
_ratio.py
5.34 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_spinners.py
19.45 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_stack.py
351 bytes
06/10/2025 09:50:50 PM
rw-r--r--
📄
_timer.py
417 bytes
06/10/2025 09:50:50 PM
rw-r--r--
📄
_win32_console.py
22.22 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_windows.py
1.88 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_windows_renderer.py
2.72 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
_wrap.py
3.32 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
abc.py
890 bytes
06/10/2025 09:50:50 PM
rw-r--r--
📄
align.py
10.22 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
ansi.py
6.76 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
bar.py
3.19 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
box.py
10.58 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
cells.py
5.01 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
color.py
17.78 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
color_triplet.py
1.03 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
columns.py
6.96 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
console.py
98.21 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
constrain.py
1.26 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
containers.py
5.37 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
control.py
6.47 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
default_styles.py
8.06 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
diagnose.py
998 bytes
06/10/2025 09:50:50 PM
rw-r--r--
📄
emoji.py
2.44 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
errors.py
642 bytes
06/10/2025 09:50:50 PM
rw-r--r--
📄
file_proxy.py
1.64 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
filesize.py
2.43 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
highlighter.py
9.36 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
json.py
4.91 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
jupyter.py
3.18 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
layout.py
13.68 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
live.py
13.94 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
live_render.py
3.58 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
logging.py
12.17 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
markup.py
8.25 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
measure.py
5.18 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
padding.py
4.79 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
pager.py
828 bytes
06/10/2025 09:50:50 PM
rw-r--r--
📄
palette.py
3.32 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
panel.py
10.96 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
pretty.py
35.54 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
progress.py
58.94 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
progress_bar.py
7.97 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
prompt.py
12.16 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
protocol.py
1.36 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
py.typed
0 bytes
06/10/2025 09:50:50 PM
rw-r--r--
📄
region.py
166 bytes
06/10/2025 09:50:50 PM
rw-r--r--
📄
repr.py
4.33 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
rule.py
4.49 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
scope.py
2.78 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
screen.py
1.55 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
segment.py
24.16 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
spinner.py
4.26 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
status.py
4.32 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
style.py
26.42 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
styled.py
1.23 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
syntax.py
34.92 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
table.py
39.11 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
terminal_theme.py
3.29 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
text.py
46.44 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
theme.py
3.68 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
themes.py
102 bytes
06/10/2025 09:50:50 PM
rw-r--r--
📄
traceback.py
34.35 KB
06/10/2025 09:50:50 PM
rw-r--r--
📄
tree.py
9.23 KB
06/10/2025 09:50:50 PM
rw-r--r--
Editing: _ratio.py
Close
import sys from fractions import Fraction from math import ceil from typing import cast, List, Optional, Sequence if sys.version_info >= (3, 8): from typing import Protocol else: from pip._vendor.typing_extensions import Protocol # pragma: no cover class Edge(Protocol): """Any object that defines an edge (such as Layout).""" size: Optional[int] = None ratio: int = 1 minimum_size: int = 1 def ratio_resolve(total: int, edges: Sequence[Edge]) -> List[int]: """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. """ # Size of edge or None for yet to be determined sizes = [(edge.size or None) for edge in edges] _Fraction = Fraction # While any edges haven't been calculated while None in sizes: # Get flexible edges and index to map these back on to sizes list flexible_edges = [ (index, edge) for index, (size, edge) in enumerate(zip(sizes, edges)) if size is None ] # Remaining space in total remaining = total - sum(size or 0 for size in sizes) if remaining <= 0: # No room for flexible edges return [ ((edge.minimum_size or 1) if size is None else size) for size, edge in zip(sizes, edges) ] # Calculate number of characters in a ratio portion portion = _Fraction( remaining, sum((edge.ratio or 1) for _, edge in flexible_edges) ) # If any edges will be less than their minimum, replace size with the minimum for index, edge in flexible_edges: if portion * edge.ratio <= edge.minimum_size: sizes[index] = edge.minimum_size # New fixed size will invalidate calculations, so we need to repeat the process break else: # Distribute flexible space and compensate for rounding error # Since edge sizes can only be integers we need to add the remainder # to the following line remainder = _Fraction(0) for index, edge in flexible_edges: size, remainder = divmod(portion * edge.ratio + remainder, 1) sizes[index] = size break # Sizes now contains integers only return cast(List[int], sizes) def ratio_reduce( total: int, ratios: List[int], maximums: List[int], values: List[int] ) -> List[int]: """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. """ ratios = [ratio if _max else 0 for ratio, _max in zip(ratios, maximums)] total_ratio = sum(ratios) if not total_ratio: return values[:] total_remaining = total result: List[int] = [] append = result.append for ratio, maximum, value in zip(ratios, maximums, values): if ratio and total_ratio > 0: distributed = min(maximum, round(ratio * total_remaining / total_ratio)) append(value - distributed) total_remaining -= distributed total_ratio -= ratio else: append(value) return result def ratio_distribute( total: int, ratios: List[int], minimums: Optional[List[int]] = None ) -> List[int]: """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. """ if minimums: ratios = [ratio if _min else 0 for ratio, _min in zip(ratios, minimums)] total_ratio = sum(ratios) assert total_ratio > 0, "Sum of ratios must be > 0" total_remaining = total distributed_total: List[int] = [] append = distributed_total.append if minimums is None: _minimums = [0] * len(ratios) else: _minimums = minimums for ratio, minimum in zip(ratios, _minimums): if total_ratio > 0: distributed = max(minimum, ceil(ratio * total_remaining / total_ratio)) else: distributed = total_remaining append(distributed) total_ratio -= ratio total_remaining -= distributed return distributed_total if __name__ == "__main__": from dataclasses import dataclass @dataclass class E: size: Optional[int] = None ratio: int = 1 minimum_size: int = 1 resolved = ratio_resolve(110, [E(None, 1, 1), E(None, 1, 1), E(None, 1, 1)]) print(sum(resolved))