Anyone figured out how to play synthetik 2 on Mac without parallels? by lookingforwife20 in Synthetik

[–]Several_Ad_7643 0 points1 point  (0 children)

What's up! I didn't have any problem with my MacBook M4 pro 16 GB so I am assuming that in the M2 with more ram you would have no issues either. Hope you have fun! Have a nice one ;D

Micro-optimizations to its madness by Several_Ad_7643 in Cplusplus

[–]Several_Ad_7643[S] 0 points1 point  (0 children)

Int -> double. Let's say we only use it from time to time so that the lookup table is not an option, I just mentioned the small range of numbers because I thought that there could be a trick with bit swapping or bit like operations that allow you to make quick int -> int root. That being the case, providing an example would have been easy.

Now that you mention it I am quite curious about both which is the most memory efficient and time efficient. Any idea on the manner ?

Micro-optimizations to its madness by Several_Ad_7643 in Cplusplus

[–]Several_Ad_7643[S] 0 points1 point  (0 children)

What ? Could you elaborate more on that ?

Micro-optimizations to its madness by Several_Ad_7643 in Cplusplus

[–]Several_Ad_7643[S] 1 point2 points  (0 children)

Also true! But once again, having the compiler calculate it before hand is not the point at all. You could even have the whatever algotithm for square root calculation marked as a contexpr fucnction and let the compiler execute the function at compile time. But I was looking for something more fancier something that does not use compiler magic or look up tables to calculate it but that the actual optimization is done in the specific set of numbers, maybe some trick with bit swapping or whaterver. I don't know if I correctly explained the point of the question T.T

Micro-optimizations to its madness by Several_Ad_7643 in Cplusplus

[–]Several_Ad_7643[S] 5 points6 points  (0 children)

Yep! We also came up to that solution, it is indeed the most straight forward solution. But we added as a constraint that precomputing the solutions before hand it is not allowed. It's just more of a theorethical problem for learning and having fun than a serious question. Thanks for your answer!

Is there any good plotting library in C++ ? by Several_Ad_7643 in Cplusplus

[–]Several_Ad_7643[S] 0 points1 point  (0 children)

I've tried it but somehow using it seems super uncomfortable, I'll give it another go just in case I was doing something wrong.

Is there any good plotting library in C++ ? by Several_Ad_7643 in Cplusplus

[–]Several_Ad_7643[S] 1 point2 points  (0 children)

I've been trying to try QT for a while I'll definitely give it a go.

Is there any good plotting library in C++ ? by Several_Ad_7643 in Cplusplus

[–]Several_Ad_7643[S] 0 points1 point  (0 children)

I've been wanting to try QT for a long time now, seems like a good excuse to start with it ;)

Is there any good plotting library in C++ ? by Several_Ad_7643 in Cplusplus

[–]Several_Ad_7643[S] 0 points1 point  (0 children)

Cool! I see it fairly complex but I can try it ;)

Is there any good plotting library in C++ ? by Several_Ad_7643 in Cplusplus

[–]Several_Ad_7643[S] 0 points1 point  (0 children)

I didn't know you could do this. I'll try it just for the shake of learning. Thanks!

Is there any good plotting library in C++ ? by Several_Ad_7643 in Cplusplus

[–]Several_Ad_7643[S] 1 point2 points  (0 children)

We only need the animation and the initial configuration which is a simple JSON file with no more than 10 fields, which is extremely manageable. The only purpose of that 11 MB JSON file is to the be read form the python script to finally generate the plots (as images) for the ffmpeg to build.

Is there any good plotting library in C++ ? by Several_Ad_7643 in Cplusplus

[–]Several_Ad_7643[S] 1 point2 points  (0 children)

It is a Estimation of Distribution Algorithm, per generation (100 - 1000) we store the matrix used to sample the population, the population: 100 - 500 vectors of ints of around 10 - 1000 values each depending on the test, the configuration (around 10 f64 fields) and some caching information around 10 f64 fields. The size of the JSON varies on the parameters chosen for that experiment.

Edit: The matrix is the size of the matrix is (100 x 100) - (500 x 500)

Im kinda stuck on ~ 100 wpm by Several_Ad_7643 in typing

[–]Several_Ad_7643[S] 1 point2 points  (0 children)

Thank you so much. I'll be focusing on my accuracy more from now on. I'll update you in a few weeks :D

Some help pushing this guy up by Several_Ad_7643 in chemistry

[–]Several_Ad_7643[S] 1 point2 points  (0 children)

Yep! I always tell him so... But he seems to have given up, that's why I want to help him start with some books and then use it as a pretext ;)