Originally Posted by smf
If you work on a project like this you are often bombarded with advice from people you don't know on how to do things better. While in a few rare cases they might have a point, it's just not worth taking the time to find that out. Even when an idea sounds plausible, there might be a reason why implementing it is too hard or doesn't actually work out so well in practise because of reasons you haven't considered.
You should implement the idea yourself and submit the patch if you want someone to take notice.
One of the points about binary search instead of switch/case statements. Sometimes the compiler will actually implement it that way, it depends on which compiler and whether it thinks it will be faster that way. It also depends on the processor, because a big set of if checks might actually work out faster if branch prediction allows the common cases to execute quicker.
|
Dolphin builds a big lookup table which is even easier to implement than both and the fastest way. I work on it but this takes time to implement nothing done in some days.
The lookup table is fast implemented but the recompilation is tricky.