??? 06/04/07 16:46 Read: times |
#140259 - Duhr and an answer Responding to: ???'s previous message |
Bob said:
this structure implies that it's considered better to keep the main loop going as fast as possible and check for time elapsed to perform actions, rather than stalling the main loop for that amount of time? Well, clearly this is true for the problem you posed, where you were missing messages because the main loop was stalled. However, as soon as we tried to make a general rule, somebody would come along with a valid exception! Every situation has its own set of tradeoffs. On a totally different topic, what program did you use to generate that nifty flow chart? I've looked around, but even the most 'intuitive' ones required me to read the manual to have even an idea of how to use them. New, topic, new thread. You'll still have to read some instructions, but they're short. -- Russ |
Topic | Author | Date |
Software design problem | 01/01/70 00:00 | |
Something like this, maybe? | 01/01/70 00:00 | |
Well, yes, actually... | 01/01/70 00:00 | |
Duhr and a question | 01/01/70 00:00 | |
Which ones did you look at ? | 01/01/70 00:00 | |
Duhr and an answer | 01/01/70 00:00 | |
Is it not possible to | 01/01/70 00:00 | |
Horses for courses | 01/01/70 00:00 | |
have fun | 01/01/70 00:00 | |
A Queue? | 01/01/70 00:00 | |
I used what I called a \'cache\' | 01/01/70 00:00 | |
Gah, code repost | 01/01/70 00:00 | |
you need to read it all, THEN process | 01/01/70 00:00 | |
Your approach is much more general... | 01/01/70 00:00 | |
Prioritizing? | 01/01/70 00:00 | |
Some suggestions Bob | 01/01/70 00:00 | |
Thank you, sir! | 01/01/70 00:00 | |
Division / modulus not always slow | 01/01/70 00:00 | |
Are we making this too difficult? | 01/01/70 00:00 | |
I don't think so, it seems to work pretty well...![]() | 01/01/70 00:00 |