On 25/06/2018 16:18, J. Gareth Moreton wrote:
One would need to develop some tight timing tests to determine the
fastest method for a given number of cases. As Florian once stated...
it takes a large number of jumps before the standard linear
subtraction search (where the ordinal difference is subtracted from
each case branch in turn) becomes prohibitive. On modern processors
it can be as high as 64.
How well does kcachegrind represent those timings?
Granted you don't want to run the entire compiler in kcachegrind, that
might take very long. But if you extract the relevant code into a
test/benchmark project, then that might help.
_______________________________________________
fpc-devel maillist - [email protected]
http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-devel
