Success! Find is slow no more

[H. S. Teoh]

On Wed, May 22, 2019 at 11:52:12PM +0000, Brian Schott via Digitalmars-d wrote:
> On Wednesday, 22 May 2019 at 23:24:47 UTC, H. S. Teoh wrote:
> > But if your code shows improvement with ldc/gdc, *then* we have
> > something interesting to talk about.
> 
> Cloning the repository and running "make ldc" on my machine gives the
> following:
> 
> Search in Alice in Wonderland
>        std: 178 ±13
>     manual: 124 ±10
>   A2Phobos: 100 ±0
>      Chris: 121 ±10
>     Andrei: 172 ±11
>    Andrei2: 116 ±8
>     Faster: 143 ±10
[...]

Interesting! So A2Phobos (which version does it refer to?) is faster in
all these cases. Looks like that's what we should merge. The `Faster`
algorithm doesn't seem to do very well, I'm guessing because the manual
optimizations have confused LDC's optimizer enough that it's unable to
produce good code.


T

-- 
"You know, maybe we don't *need* enemies." "Yeah, best friends are about all I can take." -- Calvin & Hobbes