Total Complexity | 3 |
Total Lines | 17 |
Duplicated Lines | 0 % |
Changes | 0 |
1 | import numpy as np |
||
2 | from hyperactive import BaseSearchSpace |
||
3 | |||
4 | |||
5 | class SearchSpace: |
||
6 | search_space: dict = None |
||
7 | |||
8 | def __init__(self, **params): |
||
9 | super().__init__() |
||
10 | |||
11 | for key, value in params.items(): |
||
12 | setattr(self, key, value) |
||
13 | self.search_space[key] = value |
||
14 | |||
15 | def __call__(self): |
||
16 | return self.search_space |
||
17 |