relib 1.3.0__py3-none-any.whl → 1.3.1__py3-none-any.whl

relib/dict_utils.py

@@ -52,9 +52,8 @@ def get_at[T](d: dict, keys: Iterable[Any], default: T) -> T:
 
 def dict_firsts[T, K](pairs: Iterable[tuple[K, T]]) -> dict[K, T]:
   result: dict[K, T] = {}
-  for key, item in pairs:
-    if key not in result:
-      result[key] = item
+  for key, value in pairs:
+    result.setdefault(key, value)
   return result
 
 def group[T, K](pairs: Iterable[tuple[K, T]]) -> dict[K, list[T]]:
@@ -63,6 +62,16 @@ def group[T, K](pairs: Iterable[tuple[K, T]]) -> dict[K, list[T]]:
     values_by_key.setdefault(key, []).append(value)
   return values_by_key
 
+def flatten_dict_inner(d, prefix=()):
+  for key, value in d.items():
+    if not isinstance(value, dict) or value == {}:
+      yield prefix + (key,), value
+    else:
+      yield from flatten_dict_inner(value, prefix + (key,))
+
+def flatten_dict(deep_dict: dict, prefix=()) -> dict:
+  return dict(flatten_dict_inner(deep_dict, prefix))
+
 @overload
 def deepen_dict[K1, U](d: dict[tuple[K1], U]) -> dict[K1, U]: ...
 @overload
@@ -85,13 +94,3 @@ def deepen_dict(d: dict[tuple[Any, ...], Any]) -> dict:
       curr = curr.setdefault(key, {})
     curr[head] = value
   return output
-
-def flatten_dict_inner(d, prefix=()):
-  for key, value in d.items():
-    if not isinstance(value, dict) or value == {}:
-      yield prefix + (key,), value
-    else:
-      yield from flatten_dict_inner(value, prefix + (key,))
-
-def flatten_dict(deep_dict: dict, prefix=()) -> dict:
-  return dict(flatten_dict_inner(deep_dict, prefix))

relib/iter_utils.py

@@ -5,7 +5,7 @@ from .dict_utils import dict_firsts
 __all__ = [
   "distinct_by", "distinct", "drop_none",
   "first", "flatten",
-  "intersect",
+  "interleave", "intersect",
   "list_split",
   "move_value",
   "num_partitions",
@@ -36,27 +36,13 @@ def move_value[T](iterable: Iterable[T], from_i: int, to_i: int) -> list[T]:
   return values
 
 def reversed_enumerate[T](values: list[T] | tuple[T, ...]) -> Iterable[tuple[int, T]]:
-  return zip(reversed(range(len(values))), reversed(values))
+  return zip(range(len(values))[::1], reversed(values))
 
 def intersect[T](*iterables: Iterable[T]) -> list[T]:
   return list(set.intersection(*map(set, iterables)))
 
-@overload
-def flatten[T](iterable: Iterable[T], depth: Literal[0]) -> list[T]: ...
-@overload
-def flatten[T](iterable: Iterable[Iterable[T]], depth: Literal[1] = 1) -> list[T]: ...
-@overload
-def flatten[T](iterable: Iterable[Iterable[Iterable[T]]], depth: Literal[2]) -> list[T]: ...
-@overload
-def flatten[T](iterable: Iterable[Iterable[Iterable[Iterable[T]]]], depth: Literal[3]) -> list[T]: ...
-@overload
-def flatten[T](iterable: Iterable[Iterable[Iterable[Iterable[Iterable[T]]]]], depth: Literal[4]) -> list[T]: ...
-@overload
-def flatten(iterable: Iterable, depth: int) -> list: ...
-def flatten(iterable: Iterable, depth: int = 1) -> list:
-  for _ in range(depth):
-    iterable = chain.from_iterable(iterable)
-  return list(iterable)
+def interleave[T](*iterables: Iterable[T]) -> list[T]:
+  return flatten(zip(*iterables))
 
 def list_split[T](iterable: Iterable[T], sep: T) -> list[list[T]]:
   values = [sep, *iterable, sep]
@@ -77,6 +63,23 @@ def num_partitions[T](values: Iterable[T], num_parts: int) -> list[list[T]]:
   part_size = (len(values) / num_parts).__ceil__()
   return [values[i * part_size:(i + 1) * part_size] for i in range(num_parts)]
 
+@overload
+def flatten[T](iterable: Iterable[T], depth: Literal[0]) -> list[T]: ...
+@overload
+def flatten[T](iterable: Iterable[Iterable[T]], depth: Literal[1] = 1) -> list[T]: ...
+@overload
+def flatten[T](iterable: Iterable[Iterable[Iterable[T]]], depth: Literal[2]) -> list[T]: ...
+@overload
+def flatten[T](iterable: Iterable[Iterable[Iterable[Iterable[T]]]], depth: Literal[3]) -> list[T]: ...
+@overload
+def flatten[T](iterable: Iterable[Iterable[Iterable[Iterable[Iterable[T]]]]], depth: Literal[4]) -> list[T]: ...
+@overload
+def flatten(iterable: Iterable, depth: int) -> list: ...
+def flatten(iterable: Iterable, depth: int = 1) -> list:
+  for _ in range(depth):
+    iterable = chain.from_iterable(iterable)
+  return list(iterable)
+
 @overload
 def transpose[T1, T2](tuples: Iterable[tuple[T1, T2]], default_num_returns=0) -> tuple[list[T1], list[T2]]: ...
 @overload

relib/runtime_tools.py

@@ -10,6 +10,7 @@ from .processing_utils import noop
 __all__ = [
   "as_async", "async_limit",
   "clear_console", "console_link",
+  "default_executor", "default_workers",
   "roll_tasks",
   "measure_duration",
 ]
@@ -18,6 +19,7 @@ P = ParamSpec("P")
 R = TypeVar("R")
 
 default_workers = min(32, (os.cpu_count() or 1) + 4)
+default_executor = ThreadPoolExecutor(max_workers=default_workers)
 
 def clear_console() -> None:
   os.system("cls" if os.name == "nt" else "clear")
@@ -42,8 +44,8 @@ async def roll_tasks[T](tasks: Iterable[Awaitable[T]], workers=default_workers,
     update = partial(pbar.update, 1)
     return await asyncio.gather(*[worker(task, semaphore, update) for task in tasks])
 
-def as_async(workers=default_workers) -> Callable[[Callable[P, R]], Callable[P, Awaitable[R]]]:
-  executor = ThreadPoolExecutor(max_workers=workers)
+def as_async(workers: int | ThreadPoolExecutor = default_executor) -> Callable[[Callable[P, R]], Callable[P, Awaitable[R]]]:
+  executor = ThreadPoolExecutor(max_workers=workers) if isinstance(workers, int) else workers
 
   def on_fn(func: Callable[P, R]) -> Callable[P, Awaitable[R]]:
     @wraps(func)
@@ -79,7 +81,7 @@ class measure_duration:
   def __exit__(self, *_):
     duration = round(time() - self.start, 4)
     depth = len(active_mds) - 1
-    indent = ('──' * depth) + (' ' * (depth > 0))
-    text = '{}: {} seconds'.format(self.name, duration)
+    indent = "──" * depth + " " * (depth > 0)
+    text = f"{self.name}: {duration} seconds"
     print(indent + text)
     active_mds.remove(self)

{relib-1.3.0.dist-info → relib-1.3.1.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: relib
-Version: 1.3.0
+Version: 1.3.1
 Project-URL: Repository, https://github.com/Reddan/relib.git
 Author: Hampus Hallman
 License: Copyright 2018-2025 Hampus Hallman

relib-1.3.1.dist-info/RECORD

@@ -0,0 +1,11 @@
+relib/__init__.py,sha256=WerjUaM_sNvudjXFudLRtXB7viZWEW1RSinkDjrh4nE,163
+relib/dict_utils.py,sha256=jqW6bYSaQMt2AC2KFzDJKyl88idyMttWxXDu3t-fA5I,2980
+relib/io_utils.py,sha256=EtnIGQmLXjoHUPFteB5yPXDD3wGLvH4O3CahlCebXDQ,555
+relib/iter_utils.py,sha256=5N5WVx2oZmZSxv8EnMbKeDKsAOlmPJkEARscwC4zToo,3854
+relib/processing_utils.py,sha256=eMzjlxsEmfvtKafDITBWSp9D5RwegSWsUsvj1FpmBM0,1893
+relib/runtime_tools.py,sha256=l7B-C3Dz8o3ffRXHC2ysyf59QfbDrzOd-KCxPgyohnE,2842
+relib/type_utils.py,sha256=oY96cAAux1JwhXgWFFyqEv_f-wwyPc_Hm6I9Yeisu_M,323
+relib-1.3.1.dist-info/METADATA,sha256=J_X6XPYfnT_MNGLel5k8UHThx2N7eV6YK9SzQ9xcs-M,1295
+relib-1.3.1.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
+relib-1.3.1.dist-info/licenses/LICENSE,sha256=9xVsdtv_-uSyY9Xl9yujwAPm4-mjcCLeVy-ljwXEWbo,1059
+relib-1.3.1.dist-info/RECORD,,

relib-1.3.0.dist-info/RECORD

@@ -1,11 +0,0 @@
-relib/__init__.py,sha256=WerjUaM_sNvudjXFudLRtXB7viZWEW1RSinkDjrh4nE,163
-relib/dict_utils.py,sha256=PVB4og0ksHFP9q0VZ2LoFgW54lG98egh36jxyygxnYw,2996
-relib/io_utils.py,sha256=EtnIGQmLXjoHUPFteB5yPXDD3wGLvH4O3CahlCebXDQ,555
-relib/iter_utils.py,sha256=P2KQC8X2kP9EgxFefYfebtCdx481vA1X4Q19SIsnDWc,3755
-relib/processing_utils.py,sha256=eMzjlxsEmfvtKafDITBWSp9D5RwegSWsUsvj1FpmBM0,1893
-relib/runtime_tools.py,sha256=nT0nr8XVo3lMMFFxrub9rJKlY4ySfgr19uOXh2fF8RM,2678
-relib/type_utils.py,sha256=oY96cAAux1JwhXgWFFyqEv_f-wwyPc_Hm6I9Yeisu_M,323
-relib-1.3.0.dist-info/METADATA,sha256=cdAcJmRzSpExeyr77Tl8s-IFRhHglyGXGKFZtsAszIY,1295
-relib-1.3.0.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
-relib-1.3.0.dist-info/licenses/LICENSE,sha256=9xVsdtv_-uSyY9Xl9yujwAPm4-mjcCLeVy-ljwXEWbo,1059
-relib-1.3.0.dist-info/RECORD,,