Commit 22758e32 authored by Yuncong Yu's avatar Yuncong Yu
Browse files

Correct some docstrings

parent 65c73cba
...@@ -241,7 +241,7 @@ def weights( ...@@ -241,7 +241,7 @@ def weights(
Parameters Parameters
---------- ----------
data : np.ndarray data : np.ndarray
Preprocessed data in shape 3d array [m][t][d]. Preprocessed data in shape 3d array [m][d][t].
query : Optional[np.ndarray] query : Optional[np.ndarray]
Query in shape 2d array [t][d]. Query in shape 2d array [t][d].
old_weights : List[float] old_weights : List[float]
...@@ -249,7 +249,7 @@ def weights( ...@@ -249,7 +249,7 @@ def weights(
labels : np.ndarray labels : np.ndarray
True positive labels in shape 1d array [?]. True positive labels in shape 1d array [?].
hash_functions : np.ndarray hash_functions : np.ndarray
Correct hash functions in shape 2d array [?][d] Correct hash functions in shape 2d array [L*K][d]
Returns Returns
------- -------
...@@ -322,7 +322,7 @@ def table_info(data: np.ndarray, table: Sequence[Sequence[int]]) -> Dict[str, An ...@@ -322,7 +322,7 @@ def table_info(data: np.ndarray, table: Sequence[Sequence[int]]) -> Dict[str, An
Parameters Parameters
---------- ----------
data : np.ndarray data : np.ndarray
Preprocessed data in shape 3d array [m][t][d]. Preprocessed data in shape 3d array [m][d][t].
table : Sequence[Sequence[int]] table : Sequence[Sequence[int]]
Hash tables in shape 2d array [x][?] Hash tables in shape 2d array [x][?]
...@@ -351,7 +351,7 @@ def query(data: np.ndarray, window_indices: Union[int, Dict[int, bool]]) -> List ...@@ -351,7 +351,7 @@ def query(data: np.ndarray, window_indices: Union[int, Dict[int, bool]]) -> List
Parameters Parameters
---------- ----------
data : np.ndarray data : np.ndarray
Preprocessed data in shape 3d array [m][t][d]. Preprocessed data in shape 3d array [m][d][t].
window_indices : Union[int, Dict[int, bool]] window_indices : Union[int, Dict[int, bool]]
Indices of true positive labels. Indices of true positive labels.
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment