[erlang-questions] A bug? - bloom filters - and loadable BIFs

[Richard Andrews]

> From: Mikael Pettersson <mikpe@REDACTED>
...
> So creating a series of large binaries in rapid succession without
> intervening GCs is a fairly reliable way of running out of memory.

+1

I haven't tested the program but have recently seen similar pathological cases.

You might mitigate the OoM problem with {fullsweep_after,0} in spawn_opt(). As you said Joe, this won't be fast and using the above fullsweep option will slow it down further.


      Enjoy a better web experience. Upgrade to the new Internet Explorer 8 optimised for Yahoo!7. Get it now.