Table lookups - this is pretty definitive
Tove
tove at fransson.se
Tue Apr 1 12:42:28 PDT 2014
On Tuesday, 1 April 2014 at 18:35:50 UTC, Walter Bright wrote:
> Try this benchmark comparing various classification schemes:
> ---------------------------------
Original program... 3 4 1
10x as many iterations... 36 47 19
I think this benchmark is flawed...
1) Apparently there are rounding issues... assuming linear
scaling, 1.9 ms yields ~1ms? Probably better to use usecs...
2) Table lookups will nearly always win in isolated 1 function
tests... but not necessarily in real apps.
More information about the Digitalmars-d
mailing list