>>I find CASE to be fast for what _I_ want to do.
>>So I ask the question again : Is CASE slow?
>>How would I test it for speed?

The only other fast branching mechanism I know of is using a CALL <function
pointer). Where in the function pointer is the address where the function
resides (i.e., gCasePtr&(0)  = @FN Case0)

I've done this in a "tedd's CALL/CASE demo" and found no difference between
using a CASE statement as compared to using a function CALL. In 100,000
loops, both were 10 ticks.

If anyone wants the demo, I'll post it.

tedd

___________________________________________________________________
<mailto:tedd@...>	               http://sperling.com/