[Bug libstdc++/57925] discrete_distribution can be improved to O(1) per sampling

[t.e.knigge at gmail dot com]

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=57925

Timon Knigge <t.e.knigge at gmail dot com> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
                 CC|                            |t.e.knigge at gmail dot com

--- Comment #8 from Timon Knigge <t.e.knigge at gmail dot com> ---
Hi, is this still open? I implemented aforementioned algorithm recently and
found this bug. Since this is unassigned, I could try implementing said
algorithm in std::discrete_distribution, if only because I think the underlying
algorithm is pretty cool (I assume reducing runtime complexity for sampling
from a discrete distribution isn't at the top of your priorities :-) ).