Table lookups - this is pretty definitive

[Walter Bright]

On 4/2/2014 12:38 PM, Dmitry Olshansky wrote:
> Ideally we'd need:
> a) A collection of meaningful (high-level compared to std.simd) primitives that
> can be accelerated by SIMD, in Phobos. Such as searching, bit-counting etc.

memchr is already optimized by SIMD, and std.algorithm.find uses memchr. In 
general, enormous effort has been poured into optimizing C standard library 
functions. If an algorithm can be implemented using such functions, we ought to.