I was just looking around in the code and spotted what looks like some inefficiencies. I've been doing some poker simulations before (not in rust though) and my first impression is that there is a lot of memory wasted with the introduction of the Meta enum, atleast for doing range vs range simulations where you only care about who wins the hand and nothing else. Also to correctly bench the eval function I would prepare a bunch of hands. With only one combination being benched we'll always be in cache and not encounter the reality of the tables being in a hashmap (1 extra indirection vs array).
If there is interest I can put some work in to get it fixed.
I was just looking around in the code and spotted what looks like some inefficiencies. I've been doing some poker simulations before (not in rust though) and my first impression is that there is a lot of memory wasted with the introduction of the Meta enum, atleast for doing range vs range simulations where you only care about who wins the hand and nothing else. Also to correctly bench the eval function I would prepare a bunch of hands. With only one combination being benched we'll always be in cache and not encounter the reality of the tables being in a hashmap (1 extra indirection vs array).
If there is interest I can put some work in to get it fixed.