On Mon, 25 Sep 2006, Nico Erfurth wrote:
> > are going to optimize it, maybe a binary-chop search on an ordered list
> > would be faster still?
>
> Just a guess, but I don't think it will be much faster, especially
> because the options are of different types, so you need some special
> treatment anyway.
True, but the way you program that is to use the binary chop to
recognize option number N, and then switch on N. But yes, I agree there
may not be much in it.
--
Philip Hazel University of Cambridge Computing Service
Get the Exim 4 book: http://www.uit.co.uk/exim-book
