Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Probably just has a conservative Boehm-ish GC. Their website is a bit sparse on the GC details from what I can tell, but anything else would be rather surprising.


A bit more interesting:

"The basic algorithm is Deferred Reference Counting with cycle detection. # This is achieved by combining a Deutsch-Bobrow garbage collector # together with Christoper's partial mark-sweep garbage collector. # # Special care has been taken to avoid recursion as far as possible to avoid # stack overflows when traversing deep datastructures. It is well-suited # for soft real time applications (like games)."


The garbage collector looks to be written in Nim: https://github.com/nim-lang/Nim/blob/devel/lib/system/gc.nim


In fact, there are five (!) different GCs you can try:

--gc:refc|v2|markAndSweep|boehm|go|none




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: