| Total Complexity | 0 |
| Total Lines | 29 |
| Duplicated Lines | 0 % |
| Changes | 0 | ||
| 1 | """Module with implementations of tasks.""" |
||
| 2 | |||
| 3 | from NiaPy.task.task import ( |
||
| 4 | Task, |
||
| 5 | CountingTask, |
||
| 6 | StoppingTask, |
||
| 7 | MoveTask, |
||
| 8 | TaskComposition, |
||
| 9 | TaskConvPlot, |
||
| 10 | TaskConvPrint, |
||
| 11 | TaskConvSave, |
||
| 12 | ThrowingTask, |
||
| 13 | ScaledTask, |
||
| 14 | OptimizationType |
||
| 15 | ) |
||
| 16 | |||
| 17 | __all__ = [ |
||
| 18 | "Task", |
||
| 19 | "CountingTask", |
||
| 20 | "StoppingTask", |
||
| 21 | "MoveTask", |
||
| 22 | "TaskComposition", |
||
| 23 | "TaskConvPlot", |
||
| 24 | "TaskConvPrint", |
||
| 25 | "TaskConvSave", |
||
| 26 | "ThrowingTask", |
||
| 27 | "ScaledTask", |
||
| 28 | "OptimizationType" |
||
| 29 | ] |
||
| 30 |