!in

[Michel Fortin]

On 2010-02-17 12:56:51 -0500, BCS <none at anon.com> said:

> How about expanding that to compile time constants of any kind. From 
> that, even with long arrays, you should always be able to get n-log(n) 
> performance (tree search) or better (translate it into a normal AA 'in' 
> or even a perfect hash).  --

I agree with this. I wrote an example of it in my reply to Andrei.

-- 
Michel Fortin
michel.fortin at michelf.com
http://michelf.com/