relib 1.0.4__py3-none-any.whl → 1.0.6__py3-none-any.whl

relib/__init__.py

@@ -2,12 +2,14 @@ from .utils import (
   list_split,
   drop_none,
   distinct,
-  find,
+  first,
+  move_value,
   transpose_dict,
   make_combinations_by_dict,
   merge_dicts,
   intersect,
   ensure_tuple,
+  key_of,
   omit,
   pick,
   dict_by,

relib/utils.py

@@ -22,9 +22,14 @@ def drop_none(l: Iterable[Union[T, None]]) -> list[T]:
 def distinct(items: Iterable[T]) -> list[T]:
   return list(set(items))
 
-def find(iterable: Iterable[T]) -> Union[T, None]:
+def first(iterable: Iterable[T]) -> Union[T, None]:
   return next(iter(iterable), None)
 
+def move_value(l: Iterable[T], from_i: int, to_i: int) -> list[T]:
+  l = list(l)
+  l.insert(to_i, l.pop(from_i))
+  return l
+
 def transpose_dict(des):
   if isinstance(des, list):
     keys = list(des[0].keys()) if des else []
@@ -55,10 +60,10 @@ def make_combinations_by_dict(des, keys=None, pairs=[]):
   ])
 
 def merge_dicts(*dicts: dict[K, T]) -> dict[K, T]:
-  result = {}
-  for dictionary in dicts:
-    result.update(dictionary)
-  return result
+  output = {}
+  for d in dicts:
+    output.update(d)
+  return output
 
 def intersect(*lists: Iterable[T]) -> list[T]:
   return list(set.intersection(*map(set, lists)))
@@ -66,6 +71,9 @@ def intersect(*lists: Iterable[T]) -> list[T]:
 def ensure_tuple(value: Union[T, tuple[T, ...]]) -> tuple[T, ...]:
   return value if isinstance(value, tuple) else (value,)
 
+def key_of(dicts: Iterable[dict[T, U]], key: T) -> list[U]:
+  return [d[key] for d in dicts]
+
 def omit(d: dict[K, T], keys: Iterable[K]) -> dict[K, T]:
   if keys:
     d = dict(d)
@@ -83,29 +91,27 @@ def tuple_by(d: dict[K, T], keys: Iterable[K]) -> tuple[T, ...]:
   return tuple(d[key] for key in keys)
 
 def flatten(l: Iterable[Iterable[T]]) -> list[T]:
-  # TODO: compare performance and ensure all types of iterables works
   return list(chain.from_iterable(l))
-  return [value for inner_list in l for value in inner_list]
 
 def transpose(tuples, default_num_returns=0):
-  result = tuple(zip(*tuples))
-  if not result:
+  output = tuple(zip(*tuples))
+  if not output:
     return ([],) * default_num_returns
-  return tuple(map(list, result))
+  return tuple(map(list, output))
 
 def map_dict(fn: Callable[[T], U], d: dict[K, T]) -> dict[K, U]:
   return {key: fn(value) for key, value in d.items()}
 
 def deepen_dict(d):
-  result = {}
+  output = {}
   for (*tail, head), value in d.items():
-    curr = result
+    curr = output
     for key in tail:
       if key not in curr:
         curr[key] = {}
       curr = curr[key]
     curr[head] = value
-  return result
+  return output
 
 def group(pairs: Iterable[tuple[K, T]]) -> dict[K, list[T]]:
   values_by_key = {}
@@ -141,24 +147,23 @@ def _cat_tile(cats, n_tile):
 def df_from_array(
   value_cols: dict[str, np.ndarray],
   dim_labels: list[tuple[str, list[Union[str, int, float]]]],
-  set_index=True,
+  indexed=False,
 ):
   import pandas as pd
   dim_names = [name for name, _ in dim_labels]
   dim_sizes = np.array([len(labels) for _, labels in dim_labels])
-  repeats_tiles = [
+  assert all(array.shape == tuple(dim_sizes) for array in value_cols.values())
+  array_offsets = [
     (dim_sizes[i + 1:].prod(), dim_sizes[:i].prod())
     for i in range(len(dim_sizes))
   ]
-  label_arrays = [
-    _cat_tile(pd.Categorical(labels).repeat(repeats), tiles)
-    for labels, (repeats, tiles) in zip(dim_labels, repeats_tiles)
-  ]
-  df = pd.DataFrame(dict(zip(dim_names, label_arrays)))
-  for col_name, array in value_cols.items():
-    assert array.shape == tuple(dim_sizes)
-    df[col_name] = array.reshape(-1)
-  if set_index:
+  category_cols = {
+    dim: _cat_tile(pd.Categorical(labels).repeat(repeats), tiles)
+    for dim, labels, (repeats, tiles) in zip(dim_names, dim_labels, array_offsets)
+  }
+  value_cols = {name: array.reshape(-1) for name, array in value_cols.items()}
+  df = pd.DataFrame({**category_cols, **value_cols}, copy=False)
+  if indexed:
     df = df.set_index(dim_names)
   return df
 

{relib-1.0.4.dist-info → relib-1.0.6.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: relib
-Version: 1.0.4
+Version: 1.0.6
 Home-page: https://github.com/Reddan/relib
 Author: Hampus Hallman
 Author-email: me@hampushallman.com

relib-1.0.6.dist-info/RECORD

@@ -0,0 +1,10 @@
+relib/__init__.py,sha256=4yr8xPi3VMbiFlApussB4OXU_U6wzhje06qD0Ad3Gq4,471
+relib/hashing.py,sha256=6iAPRiJI_4jaSooZRFJnqK2limXqTmErzcwpd050LAA,8943
+relib/measure_duration.py,sha256=jJa5Kh5FxaBysS__nkwqcnTt8Uc2niLucXfTzFE0j-E,555
+relib/raypipe.py,sha256=ynEoXs1dnD-360_uQC8v89xjiilt3knpocXpFaQ3plA,1905
+relib/utils.py,sha256=JM68czDzWLOa2ADbBEdAb7j4Zv3RFYMws5sy0ghxbW0,5353
+relib-1.0.6.dist-info/LICENSE.txt,sha256=t9LfkVbmcvZjP0x3Sq-jR38UfTNbNtRQvc0Q8HWmLak,1054
+relib-1.0.6.dist-info/METADATA,sha256=NVAMcPbnJrlRd_W8QRuX93F-gHSg47L9dGBf5ap7tnw,260
+relib-1.0.6.dist-info/WHEEL,sha256=oiQVh_5PnQM0E3gPdiz09WCNmwiHDMaGer_elqB3coM,92
+relib-1.0.6.dist-info/top_level.txt,sha256=Yc96FwkbRYj4AQVatga8uK4hH9ATKI9XIyEH_1ba6KQ,6
+relib-1.0.6.dist-info/RECORD,,

{relib-1.0.4.dist-info → relib-1.0.6.dist-info}/WHEEL

@@ -1,5 +1,5 @@
 Wheel-Version: 1.0
-Generator: bdist_wheel (0.40.0)
+Generator: bdist_wheel (0.42.0)
 Root-Is-Purelib: true
 Tag: py3-none-any
 

relib-1.0.4.dist-info/RECORD

@@ -1,10 +0,0 @@
-relib/__init__.py,sha256=d7vbtHV079on1ZRQeT5SAxNHtfSd14JDN1fHCGbbsjE,446
-relib/hashing.py,sha256=6iAPRiJI_4jaSooZRFJnqK2limXqTmErzcwpd050LAA,8943
-relib/measure_duration.py,sha256=jJa5Kh5FxaBysS__nkwqcnTt8Uc2niLucXfTzFE0j-E,555
-relib/raypipe.py,sha256=ynEoXs1dnD-360_uQC8v89xjiilt3knpocXpFaQ3plA,1905
-relib/utils.py,sha256=V5pdaO2qZWjOkr__eMbFfF2X4mdk9b2THQ8Ve26UJcU,5221
-relib-1.0.4.dist-info/LICENSE.txt,sha256=t9LfkVbmcvZjP0x3Sq-jR38UfTNbNtRQvc0Q8HWmLak,1054
-relib-1.0.4.dist-info/METADATA,sha256=lzPhG9j-DBJ_X6-camK9N7pAoTp8dLJ6V-e3GQWsPpI,260
-relib-1.0.4.dist-info/WHEEL,sha256=pkctZYzUS4AYVn6dJ-7367OJZivF2e8RA9b_ZBjif18,92
-relib-1.0.4.dist-info/top_level.txt,sha256=Yc96FwkbRYj4AQVatga8uK4hH9ATKI9XIyEH_1ba6KQ,6
-relib-1.0.4.dist-info/RECORD,,