slithymatt / multi-mandlebrot Goto Github PK

Hi Matt

Just a quick heads up that Uze (Alec), the designer of the open source Uzebox console, has implemented your mandelbrot test on the Uzebox after I alerted him to it so you may want to integrate it into your repo and mention it if you do another update video on the 8-bit battle?

https://uzebox.org/forums/viewtopic.php?f=4&p=34375#p34375

The code is GPL 3 licensed like your repo so no issues there.

Uze commented:

"For the kicks I made a little demo with the same code, parameters and resolutions as the video in order to have a fair comparison. Happens I either screwed up my calculation or was too optimistic. It's more like 1 second flush. So "just" 26x faster than the C64 and 3.5x faster than the X16. When the video is turned off, 0.08 second! 8-) "

Been hoping to port this code to my own CPU and so reading the repo.
But I've gotten stuck on this shared function.
Can't for the life of me see how it works.

Is it used or is it junk and buggy?
Seems for positive numbers it return zero, and for negative numbers other weird results, non zero fraction value gets returned and so on.

Any clues?

fp_floor looks sane tho.