On Friday, 4 August 2017 at 22:50:03 UTC, Stefan Koch wrote:
Hey Guys,
I just trans-compiled a brainfuck mandelbrot into ctfeable D.
newCTFE is able to execute it correctly (although it takes 3.5 minutes to do so).

The code is here
https://gist.github.com/UplinkCoder/d4e4426e6adf9434e34529e8e1f8cb47

The gist it evaluates the function at runtime since the newCTFE version capable of running this, is not yet available as a preview release.

If you want a laugh you can compile the code with ldc and -Oz flag set. LLVM will detect that the function is pure and will try to constant-fold it. I do not know how long this takes though since my patience is limited.

Cheers,
Stefan
I have interest in mandelbtott. Some day, a long time ago, when turbo pascal was the part of the world and EGA monitors had 320x240x1 bytes per pixel... That time it was interesting to algorithm to go around the Mandelbrott set because of one theorem where every point of manfelbrott set has continious connection with any other point. If I have time I'd love to write it in D.

Reply via email to