rng | Pure-functional random value generation

You need to sort the range using the Range.Sort method

In ranges-v3, there is iterator_range which you can use to wrap the iterators into a range object.

In C++20, you can use std::span to wrap those iterators into an range object

You could store both the functions and results in separate lists like this

Put the for loop code in a function and repeat the code for n times using replicate -

I've commented where I've made changes and why.

The key points are that since you are counting 2 values, you can just store the count of each value in an index of an array, rather than fill an array with a new value each time one of 2 options happen.

This lets you cut out the counting loop, making your program much more efficient, always try to count as you add rather than add then count at the end.

Also, you need to refresh the rng value each time the method is called, so I moved it into the top of the function.

Give it ago!

I figure out by myself I dont know if it is a common problem that loop multiple tables to copy and paste while clearing " " cells, but here is my code maybe someone will need it in the future;

Define dependencies(The random generator here) as local variables are not recommended, it's much harder to do dependencies injection(Or it won't be possible), so I change the functions Rng_t into template function and pass the Rng as a parameter.

In practice to construct a random generation may be heavy work, it needs to initialize its internal status, to construct it every time we call the function flipCoin is waste.

The non-virtual function can be mocked, one most commonly used strategy is to use the template, here we make the class CoinFlipper's member function as a template function, then we can test the dependency with our MockRng.

Be aware that for the template function, we need to define the member function in the header file.

coinflipper.h:

There is no such thing as a vectorized integral modulo operation in the x64 architecture. This means that the code by itself is not inherently vectorizable, and needs to be transformed beforehand before that can be done.

You can see the vectorization working just fine in both cases in the much easier case where a SIMD-friendly evenness test is used: https://godbolt.org/z/hc5ffbePY

So if anything, it could be argued that GCC managing to vectorize the inlined version at all, and clang inlining both of them, is actually pretty impressive.

That being said, since we know for a fact that GCC is capable of performing that transformation, it would appear that it is only performed before inlining happens, which is unfortunate, and probably deserves being brought up to the maintainer's attention.

Loop through each sheet and then set an PrintArea. The printarea will be the ranges you specify. Each PrintArea will then be exported to a single page in the PDF file.