Refactored ListScheduler, made it non-abstract and added better checks to...
2 unresolved threads
2 unresolved threads
- Refactored ListScheduler by breaking into sub-functions.
- Made ListScheduler non-abstract since one may want to provide custom sorting indicies.
- Added better checks to compare recreated SFG with original SFG in tests.
- Converted iteration period bound return type to Fraction
Edited by Simon Bjurek
Merge request reports
Activity
added Code quality Scheduling labels
assigned to @simbj106
added 1 commit
- 228ead73 - refactored ListScheduler, made it non-abstract and added better checks to...
1825 1825 if number_of_t_in_loop in (0, 1): 1826 1826 t_l_values.append(time_of_loop) 1827 1827 else: 1828 t_l_values.append(time_of_loop / number_of_t_in_loop) 1828 t_l_values.append(ceil(time_of_loop / number_of_t_in_loop)) Actually, it is probably better to return a Fraction: https://docs.python.org/3/library/fractions.html
Will be clearer and no way to decode what 0.5714285714285714 really means.
changed this line in version 3 of the diff
178 178 cyclic : bool | None, optional 179 179 If the scheduler is allowed to schedule cyclically (modulo), by default False 180 180 sort_order : tuple[tuple[int, bool]] 181 Specifies which columns in the priority table to sort on and in which order, where True is ascending order. 181 Specifies which columns in the priority table to sort on and in 182 which order, where True is ascending order. changed this line in version 3 of the diff
added 1 commit
- 130ea10c - fixes from MR + inactivated failing GUI test as of now
added 1 commit
- c0dc4686 - fixes from MR + inactivated failing GUI test as of now
mentioned in issue #314
Please register or sign in to reply