BenchmarkDotNet VS aoc

Let’s look at the first example you see, when you open up BenchmarkDotnet’s website, or Github page.

Or use BenchmarkDotNet which, among other things to get an accurate benchmark, does JIT warmup outside of measurement.

( https://github.com/dotnet/BenchmarkDotNet ).

You can also do proper statistically correct benchmarking by using - https://github.com/dotnet/BenchmarkDotNet. This will run warmup the jit, gauge the overheads, and run your function many times to give you proper data.

take a look at: https://benchmarkdotnet.org/

Yes, weak references are slower than direct calls. How much slower? Heck if I know offhand. But it's usually pretty easy to set up something with Benchmark .NET and find out if it hurts your use case.

For this purpose we are going to use our beloved BenchmarkDotNet tool.

To quantify and compare the performance of the object mapping strategies discussed earlier, we can employ BenchmarkDotNet.

BenchmarkDotNet is a popular open-source library that, as stated in the repo's README.md, helps us to transform methods into benchmarks, track their performance, and share reproducible measurement experiments. Using BenchmarkDotNet feels similar to writing unit tests. It's very important to note that the library only works with console apps. Finally, we can visualize the results in the terminal where the benchmark ran or in user-friendly formats such as markdown, HTML and CSV. We will explore examples of there formats later in the article.

However, obviously this prevents parallelism within the lock, so this only makes sense if you do some other expensive operation in the parallel loop and the string builder is only a small part of it. Performance wise, it may be better to concatenate the results together after the parallel operation, instead of locking inside the loop. You'll have to benchmark it to know for sure.

We’re of course going to be using BenchmarkDotNet for our benchmarks, and you can find all of the code for these over at GitHub. To start, we need an entry point hook for our single Benchmark class that will be defining the permutations of scenarios that we’d like to run. This will be relatively basic as follows:

Full code at GitHub.

Edit: you don't need to determine the type of hand, but you can directly compare the card counts. Second version @GitHub.

New version @GitHub.

So, a new version with a lot less almost-duplicate code @GitHub.

@GitHub

Completed part 2, see GitHub. I couldn't really use the same `DiracDice` class and simply use another `Die`, but had to create a separate `DiracDice2` class.Basically, just keep track of the possible universe state and their counts, and try all possible combinations of die rolls. Keep playing until all universes have a winner.

The rest is the same as my first attempt, but full code at GitHub.

I spent way too much time on this, but I completed my original attempt with the proper object model, see GitHub