Compute a complete schedule from pure desired-placement inputs, sampled
every 1 / rate seconds from start to end: (end - start) rate samples.
Throws when that period no longer advances the clock at some sample.
Every scheduled swing and reservation, ordered by lift time.
Binary search returns a new placement; callers cannot mutate the cache.
Deterministic drift-triggered support placement, precomputed at a fixed rate. Reservations have priority. Direction chooses the leading support, cyclic phase orders ties, and minimumSupports prevents unrequested suspension. Sampling is O(log steps per limb); construction is O(ticks × limbs).