Total Complexity | 2 |
Total Lines | 11 |
Duplicated Lines | 0 % |
Changes | 0 |
1 | import numpy as np |
||
2 | import itertools |
||
3 | |||
4 | |||
5 | def split_into_subspaces(search_space, split_per_dim=2): |
||
6 | sub_arrays = [] |
||
7 | for search_dim in search_space: |
||
8 | sub_arrays.append(np.array_split(search_dim, split_per_dim)) |
||
9 | |||
10 | return [list(p) for p in itertools.product(*sub_arrays)] |
||
11 |