This should also optimize speed and memory usage for small-ish
windows (which is the only usecase right now)

This implements the usecase where you want to replace a value in
a sorted range while keeping the range sorted.
This serves as an efficient alternative to what would otherwise
be an erase followed by an insert, which requires unnecessary
moves.