cellects 0.1.2__py3-none-any.whl → 0.2.6__py3-none-any.whl

cellects/utils/utilitarian.py

@@ -141,6 +141,65 @@ def translate_dict(old_dict: dict) -> Dict:
     return numba_dict
 
 
+def split_dict(c_space_dict: dict) -> Tuple[Dict, Dict, list]:
+    """
+
+    Split a dictionary into two dictionaries based on specific criteria and return their keys.
+
+    Split the input dictionary `c_space_dict` into two dictionaries: one for items not
+    ending with '2' and another where the key is truncated by removing its last
+    character if it does end with '2'. Additionally, return the keys that have been
+    processed.
+
+    Parameters
+    ----------
+    c_space_dict : dict
+        The dictionary to be split. Expected keys are strings and values can be any type.
+
+    Returns
+    -------
+    first_dict : dict
+        Dictionary containing items from `c_space_dict` whose keys do not end with '2'.
+    second_dict : dict
+        Dictionary containing items from `c_space_dict` whose keys end with '2',
+        where the key is truncated by removing its last character.
+    c_spaces : list
+        List of keys from `c_space_dict` that have been processed.
+
+    Raises
+    ------
+    None
+
+    Notes
+    -----
+    No critical information to share.
+
+    Examples
+    --------
+    >>> c_space_dict = {'key1': 10, 'key2': 20, 'logical': 30}
+    >>> first_dict, second_dict, c_spaces = split_dict(c_space_dict)
+    >>> print(first_dict)
+    {'key1': 10}
+    >>> print(second_dict)
+    {'key': 20}
+    >>> print(c_spaces)
+    ['key1', 'key']
+
+    """
+    first_dict = Dict()
+    second_dict = Dict()
+    c_spaces = []
+    for k, v in c_space_dict.items():
+        if k == 'PCA' or k != 'logical' and np.absolute(v).sum() > 0:
+            if k[-1] != '2':
+                first_dict[k] = v
+                c_spaces.append(k)
+            else:
+                second_dict[k[:-1]] = v
+                c_spaces.append(k[:-1])
+    return first_dict, second_dict, c_spaces
+
+
 def reduce_path_len(pathway: str, to_start: int, from_end: int) -> str:
     """
     Reduce the length of a given pathway string by truncating it from both ends.
@@ -435,7 +494,6 @@ def smallest_memory_array(array_object, array_type='uint') -> NDArray:
     if isinstance(array_object, np.ndarray):
         value_max = array_object.max()
     else:
-
         if len(array_object[0]) > 0:
             value_max = np.max((array_object[0].max(), array_object[1].max()))
         else:
@@ -474,17 +532,36 @@ def remove_coordinates(arr1: NDArray, arr2: NDArray) -> NDArray:
 
     Examples
     --------
-    >>> arr1 = np.arange(200).reshape(100, 2)
-    >>> arr2 = np.array([[196, 197], [198, 199]])
+    >>> arr1 = np.array([[1, 2], [3, 4]])
+    >>> arr2 = np.array([[3, 4]])
     >>> remove_coordinates(arr1, arr2)
-    array([[0, 0],
+    array([[1, 2],
            [3, 4]])
-    """
-    if arr1.shape[1] != 2 or arr2.shape[1] != 2:
-        raise ValueError("Both arrays must have shape (n, 2)")
-    mask = ~np.isin(arr1, arr2).all(axis=1)
-    return arr1[mask]
 
+    >>> arr1 = np.array([[1, 2], [3, 4]])
+    >>> arr2 = np.array([[3, 2], [1, 4]])
+    >>> remove_coordinates(arr1, arr2)
+    array([[1, 2],
+           [3, 4]])
 
+    >>> arr1 = np.array([[1, 2], [3, 4]])
+    >>> arr2 = np.array([[3, 2], [1, 2]])
+    >>> remove_coordinates(arr1, arr2)
+    array([[3, 4]])
 
+    >>> arr1 = np.arange(200).reshape(100, 2)
+    >>> arr2 = np.array([[196, 197], [198, 199]])
+    >>> new_arr1 = remove_coordinates(arr1, arr2)
+    >>> new_arr1.shape
+    (98, 2)
+    """
+    if arr2.shape[0] == 0:
+        return arr1
+    else:
+        if arr1.shape[1] != 2 or arr2.shape[1] != 2:
+            raise ValueError("Both arrays must have shape (n, 2)")
+        c_to_keep = ~np.all(arr1 == arr2[0], axis=1)
+        for row in arr2[1:]:
+            c_to_keep *= ~np.all(arr1 == row, axis=1)
+        return arr1[c_to_keep]