relib 1.2.9__py3-none-any.whl → 1.2.11__py3-none-any.whl

relib/system.py

@@ -31,7 +31,8 @@ def read_json(path: Path, default=default_sentinel) -> Any:
 
 def write_json(path: Path, obj: object, indent: None | int = None) -> None:
   with path.open("w") as f:
-    return json.dump(obj, f, indent=indent)
+    separators = (",", ":") if indent is None else None
+    return json.dump(obj, f, indent=indent, separators=separators)
 
 def clear_console() -> None:
   os.system("cls" if os.name == "nt" else "clear")

relib/utils.py

@@ -1,9 +1,10 @@
 import re
 from itertools import chain
-from typing import Any, Callable, Iterable, overload
+from typing import Any, Callable, Iterable, Literal, overload
 
 __all__ = [
   "noop",
+  "clamp",
   "non_none",
   "as_any",
   "list_split",
@@ -11,6 +12,7 @@ __all__ = [
   "distinct",
   "dict_firsts",
   "distinct_by",
+  "sort_by",
   "first",
   "move_value",
   "transpose_dict",
@@ -43,6 +45,13 @@ __all__ = [
 def noop() -> None:
   pass
 
+@overload
+def clamp(value: int, low: int, high: int) -> int: ...
+@overload
+def clamp(value: float, low: float, high: float) -> float: ...
+def clamp(value: float, low: float, high: float) -> float:
+    return max(low, min(value, high))
+
 def non_none[T](obj: T | None) -> T:
   assert obj is not None
   return obj
@@ -50,38 +59,42 @@ def non_none[T](obj: T | None) -> T:
 def as_any(obj: Any) -> Any:
   return obj
 
-def list_split[T](l: list[T], sep: T) -> list[list[T]]:
-  l = [sep, *l, sep]
-  split_at = [i for i, x in enumerate(l) if x is sep]
+def list_split[T](iterable: Iterable[T], sep: T) -> list[list[T]]:
+  values = [sep, *iterable, sep]
+  split_at = [i for i, x in enumerate(values) if x is sep]
   ranges = list(zip(split_at[0:-1], split_at[1:]))
   return [
-    l[start + 1:end]
+    values[start + 1:end]
     for start, end in ranges
   ]
 
 def drop_none[T](iterable: Iterable[T | None]) -> list[T]:
   return [x for x in iterable if x is not None]
 
-def distinct[T](items: Iterable[T]) -> list[T]:
-  return list(dict.fromkeys(items))
+def distinct[T](iterable: Iterable[T]) -> list[T]:
+  return list(dict.fromkeys(iterable))
 
-def dict_firsts[T, K](items: Iterable[tuple[K, T]]) -> dict[K, T]:
+def dict_firsts[T, K](pairs: Iterable[tuple[K, T]]) -> dict[K, T]:
   result: dict[K, T] = {}
-  for key, item in items:
+  for key, item in pairs:
     if key not in result:
       result[key] = item
   return result
 
-def distinct_by[T](items: Iterable[tuple[object, T]]) -> list[T]:
-  return list(dict_firsts(items).values())
+def distinct_by[T](pairs: Iterable[tuple[object, T]]) -> list[T]:
+  return list(dict_firsts(pairs).values())
+
+def sort_by[T](pairs: Iterable[tuple[Any, T]]) -> list[T]:
+  pairs = sorted(pairs, key=lambda p: p[0])
+  return [v for _, v in pairs]
 
 def first[T](iterable: Iterable[T]) -> T | None:
   return next(iter(iterable), None)
 
 def move_value[T](iterable: Iterable[T], from_i: int, to_i: int) -> list[T]:
-  l = list(iterable)
-  l.insert(to_i, l.pop(from_i))
-  return l
+  values = list(iterable)
+  values.insert(to_i, values.pop(from_i))
+  return values
 
 def transpose_dict(des):
   if isinstance(des, list):
@@ -101,7 +114,7 @@ def transpose_dict(des):
   raise ValueError("transpose_dict only accepts dict or list")
 
 def make_combinations_by_dict(des, keys=None, pairs=[]):
-  keys = sorted(des.keys()) if keys == None else keys
+  keys = sorted(des.keys()) if keys is None else keys
   if len(keys) == 0:
     return [dict(pairs)]
   key = keys[0]
@@ -145,10 +158,36 @@ def dict_by[T, K](keys: Iterable[K], values: Iterable[T]) -> dict[K, T]:
 def tuple_by[T, K](d: dict[K, T], keys: Iterable[K]) -> tuple[T, ...]:
   return tuple(d[key] for key in keys)
 
-def flatten[T](iterable: Iterable[Iterable[T]]) -> list[T]:
-  return list(chain.from_iterable(iterable))
+@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: int = 0) -> tuple[list[T1], list[T2]]: ...
+@overload
+def transpose[T1, T2, T3](tuples: Iterable[tuple[T1, T2, T3]], default_num_returns: int = 0) -> tuple[list[T1], list[T2], list[T3]]: ...
+@overload
+def transpose[T1, T2, T3, T4](tuples: Iterable[tuple[T1, T2, T3, T4]], default_num_returns: int = 0) -> tuple[list[T1], list[T2], list[T3], list[T4]]: ...
+@overload
+def transpose[T1, T2, T3, T4, T5](tuples: Iterable[tuple[T1, T2, T3, T4, T5]], default_num_returns: int = 0) -> tuple[list[T1], list[T2], list[T3], list[T4], list[T5]]: ...
+@overload
+def transpose(tuples: Iterable[tuple], default_num_returns: int = 0) -> tuple[list, ...]: ...
 
-def transpose(tuples, default_num_returns=0):
+def transpose(tuples: Iterable[tuple], default_num_returns=0) -> tuple[list, ...]:
   output = tuple(zip(*tuples))
   if not output:
     return ([],) * default_num_returns
@@ -196,8 +235,8 @@ 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 reversed_enumerate[T](l: list[T] | tuple[T, ...]) -> Iterable[tuple[int, T]]:
-  return zip(reversed(range(len(l))), reversed(l))
+def reversed_enumerate[T](values: list[T] | tuple[T, ...]) -> Iterable[tuple[int, T]]:
+  return zip(reversed(range(len(values))), reversed(values))
 
 def get_at[T](d: dict, keys: Iterable[Any], default: T) -> T:
   try:

{relib-1.2.9.dist-info → relib-1.2.11.dist-info}/METADATA

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

relib-1.2.11.dist-info/RECORD

@@ -0,0 +1,9 @@
+relib/__init__.py,sha256=4_nmex7mRhCwdtLF8k0XLbxxPs-UeN2sP-EEImm5JGs,126
+relib/hashing.py,sha256=DB_fnkj0ls01FgZbf4nPFHl4EBU8X_0OrmDvty4HlRE,6020
+relib/measure_duration.py,sha256=LCTo_D_qReNprD3fhtJ0daeWycS6xQE_cwxeg2_h0xo,456
+relib/system.py,sha256=3RWmSweTCQtB1wzsgpUqcAsMo6TIhVRq2oSt28Ul_1E,2733
+relib/utils.py,sha256=bwOJXfsNx5nZf1fZxWtT_hLwjTbWo2cP9qfsqca1aHI,9680
+relib-1.2.11.dist-info/METADATA,sha256=WxEfPUA2Ox2t1ulJZFIXX5ynIOf1jw1u6iWbvtcx9HI,1296
+relib-1.2.11.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
+relib-1.2.11.dist-info/licenses/LICENSE,sha256=9xVsdtv_-uSyY9Xl9yujwAPm4-mjcCLeVy-ljwXEWbo,1059
+relib-1.2.11.dist-info/RECORD,,

relib-1.2.9.dist-info/RECORD

@@ -1,9 +0,0 @@
-relib/__init__.py,sha256=4_nmex7mRhCwdtLF8k0XLbxxPs-UeN2sP-EEImm5JGs,126
-relib/hashing.py,sha256=DB_fnkj0ls01FgZbf4nPFHl4EBU8X_0OrmDvty4HlRE,6020
-relib/measure_duration.py,sha256=LCTo_D_qReNprD3fhtJ0daeWycS6xQE_cwxeg2_h0xo,456
-relib/system.py,sha256=JOqH4oBM8XMzCfG65um9gQz9CHhEQ4JOaTwywIRgS8Q,2654
-relib/utils.py,sha256=QGAse1K_K9qaRyL7AOdkpNmATcUSNOcHECLiJKuMxgo,7803
-relib-1.2.9.dist-info/METADATA,sha256=idOhfbgIelWndDu3mSpUINq5EOag0O18WbDDJy2d8rc,1295
-relib-1.2.9.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
-relib-1.2.9.dist-info/licenses/LICENSE,sha256=9xVsdtv_-uSyY9Xl9yujwAPm4-mjcCLeVy-ljwXEWbo,1059
-relib-1.2.9.dist-info/RECORD,,