relib 1.1.0__tar.gz → 1.1.1__tar.gz

{relib-1.1.0 → relib-1.1.1}/.gitignore

@@ -1,3 +1,3 @@
 __pycache__/
-/dist
+/dist/
 .DS_Store

{relib-1.1.0 → relib-1.1.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.3
 Name: relib
-Version: 1.1.0
+Version: 1.1.1
 Project-URL: Repository, https://github.com/Reddan/relib.git
 Author: Hampus Hallman
 License: Copyright 2023 Hampus Hallman
@@ -12,5 +12,5 @@ License: Copyright 2023 Hampus Hallman
         THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 License-File: LICENSE
 Requires-Python: >=3.12
-Requires-Dist: numpy>=2.1.0
-Requires-Dist: termcolor>=2.4.0
+Requires-Dist: numpy
+Requires-Dist: termcolor

{relib-1.1.0 → relib-1.1.1}/pyproject.toml

@@ -1,10 +1,10 @@
 [project]
 name = "relib"
-version = "1.1.0"
+version = "1.1.1"
 requires-python = ">=3.12"
 dependencies = [
-  "numpy>=2.1.0",
-  "termcolor>=2.4.0",
+  "numpy",
+  "termcolor",
 ]
 authors = [
   {name = "Hampus Hallman"}

{relib-1.1.0 → relib-1.1.1}/relib/__init__.py

@@ -19,7 +19,11 @@ from .utils import (
   transpose,
   map_dict,
   deepen_dict,
+  flatten_dict_inner,
+  flatten_dict,
   group,
+  reversed_enumerate,
+  get_at,
   sized_partitions,
   num_partitions,
   df_from_array,

{relib-1.1.0 → relib-1.1.1}/relib/utils.py

@@ -1,6 +1,7 @@
 from typing import TypeVar, Iterable, Callable, Any, cast, overload
 from itertools import chain
 import numpy as np
+import os
 import re
 
 T = TypeVar('T')
@@ -8,6 +9,9 @@ U = TypeVar('U')
 K = TypeVar('K')
 K1, K2, K3, K4, K5, K6 = TypeVar('K1'), TypeVar('K2'), TypeVar('K3'), TypeVar('K4'), TypeVar('K5'), TypeVar('K6')
 
+def clear_console():
+  os.system("cls" if os.name == "nt" else "clear")
+
 def non_none(obj: T | None) -> T:
   assert obj is not None
   return obj
@@ -129,23 +133,34 @@ def deepen_dict(d: dict[tuple[K1, K2, K3, K4, K5, K6], U]) -> dict[K1, dict[K2,
 
 def deepen_dict(d: dict[tuple[Any, ...], Any]) -> dict:
   output = {}
+  if () in d:
+    return d[()]
   for (*tail, head), value in d.items():
     curr = output
     for key in tail:
-      if key not in curr:
-        curr[key] = {}
-      curr = curr[key]
+      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))
+
 def group(pairs: Iterable[tuple[K, T]]) -> dict[K, list[T]]:
   values_by_key = {}
   for key, value in pairs:
-    if key not in values_by_key:
-      values_by_key[key] = []
-    values_by_key[key].append(value)
+    values_by_key.setdefault(key, []).append(value)
   return values_by_key
 
+def reversed_enumerate(l: list[T] | tuple[T, ...]) -> Iterable[tuple[int, T]]:
+  return zip(reversed(range(len(l))), reversed(l))
+
 def get_at(d: dict, keys: Iterable[Any], default: T) -> T:
   try:
     for key in keys: