| ??? 06/28/05 01:12 Read: times Msg Score: -1 -1 Answer is Wrong |
#96063 - My 2 cents worth Responding to: ???'s previous message |
Well, I have been using FPs for a few of my project. Works great at implementing Finite State Machines.
Also, good at making function calls faster. Imagine . Switch(number) case 0: ... ; break; case 1: ... ; break; . . . case 100: ... ; break; So, Case100 is getting the least priority. Developers need to figure out which "Case" is important. A function pointer table would eliminate such issues. Your list can go on and on, and not worrying about the delay in doing a switch-case comparison. |
| Topic | Author | Date |
| Coding a Jmp table in C | 01/01/70 00:00 | |
| Jmp Tables in C | 01/01/70 00:00 | |
| you do not | 01/01/70 00:00 | |
| Call table? | 01/01/70 00:00 | |
| Of course not! | 01/01/70 00:00 | |
| use jmp@a+dptr | 01/01/70 00:00 | |
| jmp table not in C | 01/01/70 00:00 | |
| Wrong ends of sticks? | 01/01/70 00:00 | |
| You do not control the Compiler Output | 01/01/70 00:00 | |
| You can not have your cake and eat it to | 01/01/70 00:00 | |
| Jump Table in C | 01/01/70 00:00 | |
| Call Table? (again) | 01/01/70 00:00 | |
| Call Table? (again) | 01/01/70 00:00 | |
| I never did use function pointers | 01/01/70 00:00 | |
| No pain, no gain. | 01/01/70 00:00 | |
| the overlaying | 01/01/70 00:00 | |
| There can be a gain. | 01/01/70 00:00 | |
| My 2 cents worth | 01/01/70 00:00 | |
| Incorrect | 01/01/70 00:00 | |
As Matter of Fact.... | 01/01/70 00:00 |