Should complex schedules created with `Sequence` be automatically `Shortened`, if they have finite length?

[gruberchr]

Motivation and description

The generation of a sequence of finite-length schedules like, e.g.,

Sequence(1e-1 => 5, 5e-2 => 4, 3.4e-3 => 10)

would conceptually be a finite-length schedule as well. In this example the sequence would have a length of 19 iterations. In contrast the following sequence would be infinite:

Sequence(1e-1 => 5, 5e-2 => 4, 3.4e-3 => Inf)

However, both sequences behave identical AFAICS.

Moreover there is the concept of Shortened schedules, which throw a BoundsError if the end of the schedule is reached. Therefore it might be more intuitive if the first example would generate a Shortened schedule in contrast to the second example.

Possible Implementation

No response