mirror of
https://github.com/jpawlowski/hass.tibber_prices.git
synced 2026-07-27 17:26:48 +00:00
find_cheapest_block, find_cheapest_hours, and find_cheapest_schedule accept an optional power_profile (fixed per-interval watt array matching the requested duration/task length). When allow_relaxation was enabled and no full-duration window could be found, the duration-reduction relaxation phase silently reduced the interval count without shrinking power_profile accordingly. Downstream code (find_cheapest_contiguous_window, calculate_window_statistics, _find_cheapest_window_in_pool) then truncated the profile from the front to match, dropping trailing appliance-cycle phases and using the wrong per-interval weights for both window selection and the reported cost estimate. Disable duration-reduction relaxation whenever a power_profile is supplied (find_cheapest_schedule guards per-task via any_task_has_power_profile); distance and level-filter relaxation phases remain available since they don't affect interval count. Impact: Services with a power_profile no longer silently pick a shorter window with mismatched power weighting during relaxation; they now correctly report no window found if the full duration isn't available, preserving the accuracy of appliance-cycle cost estimates. |
||
|---|---|---|
| .. | ||
| __init__.py | ||
| test_connect_segments.py | ||
| test_energy_calculator.py | ||
| test_find_cheapest_schedule_internals.py | ||
| test_find_service_responses.py | ||
| test_period_data_format.py | ||
| test_plan_charging.py | ||
| test_power_scheduler.py | ||
| test_search_range.py | ||
| test_sequential_scheduling.py | ||