Apply ruff rule RUF046

RUF046 Value being cast to `int` is already an integer

Author: DimitriPapadopoulos

distributed/deploy/local.py

@@ -211,7 +211,7 @@ def __init__(
             n_workers = max(1, CPU_COUNT // threads_per_worker) if processes else 1
         if n_workers and threads_per_worker is None:
             # Overcommit threads per worker, rather than undercommit
-            threads_per_worker = max(1, int(math.ceil(CPU_COUNT / n_workers)))
+            threads_per_worker = max(1, math.ceil(CPU_COUNT / n_workers))
         if n_workers and "memory_limit" not in worker_kwargs:
             worker_kwargs["memory_limit"] = parse_memory_limit(
                 "auto", 1, n_workers, logger=logger

distributed/deploy/spec.py

@@ -514,10 +514,10 @@ def _memory_per_worker(self) -> int:
 
     def scale(self, n=0, memory=None, cores=None):
         if memory is not None:
-            n = max(n, int(math.ceil(parse_bytes(memory) / self._memory_per_worker())))
+            n = max(n, math.ceil(parse_bytes(memory) / self._memory_per_worker()))
 
         if cores is not None:
-            n = max(n, int(math.ceil(cores / self._threads_per_worker())))
+            n = max(n, math.ceil(cores / self._threads_per_worker()))
 
         if len(self.worker_spec) > n:
             not_yet_launched = set(self.worker_spec) - {

distributed/deploy/subprocess.py

@@ -241,7 +241,7 @@ def SubprocessCluster(
         n_workers = max(1, CPU_COUNT // threads_per_worker)
     if n_workers and threads_per_worker is None:
         # Overcommit threads per worker, rather than undercommit
-        threads_per_worker = max(1, int(math.ceil(CPU_COUNT / n_workers)))
+        threads_per_worker = max(1, math.ceil(CPU_COUNT / n_workers))
     if n_workers and "memory_limit" not in worker_kwargs:
         worker_kwargs["memory_limit"] = parse_memory_limit(
             "auto", 1, n_workers, logger=logger

distributed/protocol/tests/test_serialize.py

@@ -284,8 +284,8 @@ def test_serialize_bytes(kwargs):
         1,
         "abc",
         b"ab" * int(40e6),
-        int(2**26) * b"ab",
-        (int(2**25) * b"ab", int(2**25) * b"ab"),
+        (2**26) * b"ab",
+        ((2**25) * b"ab", (2**25) * b"ab"),
     ]:
         b = serialize_bytes(x, **kwargs)
         assert isinstance(b, bytes)

distributed/shuffle/tests/test_buffer.py

@@ -15,7 +15,7 @@
 
 
 def gen_bytes(percentage: float, limit: int) -> bytes:
-    num_bytes = int(math.floor(percentage * limit))
+    num_bytes = math.floor(percentage * limit)
     return b"0" * num_bytes
 
 

distributed/shuffle/tests/test_comm_buffer.py

@@ -94,7 +94,7 @@ async def send(address, shards):
 
 
 def gen_bytes(percentage: float, memory_limit: int) -> bytes:
-    num_bytes = int(math.floor(percentage * memory_limit))
+    num_bytes = math.floor(percentage * memory_limit)
     return b"0" * num_bytes
 
 

distributed/stealing.py

@@ -293,7 +293,7 @@ def steal_time_ratio(self, ts: TaskState) -> tuple[float, int] | tuple[None, Non
         transfer_time = nbytes / self.scheduler.bandwidth + LATENCY
         cost_multiplier = transfer_time / compute_time
 
-        level = int(round(log2(cost_multiplier) + 6))
+        level = round(log2(cost_multiplier) + 6)
 
         if level < 1:
             level = 1