Challenge problem: 'ladder of abstraction' iterative design in FRC

[SoftwareBug2.0]

Originally Posted by Colby Skeggs

I am well aware of this "solution".
I said "reasonably implement". Your suggestion, as I truly hope you know, pegs CPU usage at 100% and consumes all available processing power. This is not reasonable, except in very specific use cases.

Also, if you try this on the cRIO under Java, you'll notice that it hangs every single thread other than the main thread for the duration, because Squawk does cooperative multitasking and this code has no "Thread.yield()". (It's still a bad idea in C++, of course, but not quite as horrendous.)

By the way efficiency is not relavent to the point that I was trying to make. And if you're doing cooperative stuff, then your implemenatation can just change to:

void sleep(float len){
    float start=get_time();
    while(get_time()<start+len) yield();
}

This still pegs your CPU, which as I mentioned earlier, is not relevant.