Well this silly GC torture test:
////
proc mklist()
{
var x = list(1,2,3,4);
j := rand () % 18;
for var i in 0 upto j do
x = x + x;
var y = 99 + x;
y = rev y + x;
var z = map (fun (a:int)=>new (str a)) y;
done
}
for var i in 0 upto 200 do mklist(); println i; done
////
Run like this:
FLX_REPORT_COLLECTIONS=1 FLX_MIN_MEM=50 ./lt
works perfectly. [Well no .. it works correctly, but the GC is using
up an awful lot of CPU]
--
john skaller
skal...@users.sourceforge.net
------------------------------------------------------------------------------
RSA(R) Conference 2012
Save $700 by Nov 18
Register now
http://p.sf.net/sfu/rsa-sfdev2dev1
_______________________________________________
Felix-language mailing list
Felix-language@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/felix-language
