How to work with hashmap from memutils properly?

[Sergey]

On Friday, 11 February 2022 at 02:43:24 UTC, Siarhei Siamashka 
wrote:
> On Thursday, 10 February 2022 at 20:39:45 UTC, Sergey wrote:
>
>> Code could be found here: 
>> https://github.com/cyrusmsk/lang_benchmark/tree/main/lru/source/d_comparison/mem
>
> Is this an attempt to implement a high performance solution for 
> the Benchmarks Game's LRU problem in D language?

Yes. There is no D version there. And I'm just curious how fast 
is D in those problems.

> It can be further tuned for better performance if necessary.

Thank you for your version.
It is interesting finding about the size of the LRU. Already seen 
your comment in the benchmark github.

Though version with memutils still not working :)

What is also interesting - it is quite different results based 
not only for size of cache, but also the number of iterations.

P.S. surprised to see you here. I've seen your participation in 
contests at codeforces - there are much smaller D-community)