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

Binary trees is a classic GC benchmark - ideally a GC'd language should be able to do better than a malloc/free implementation in C (tree.c) since it can release the whole tree in bulk (like what the ptree.c does).

Also note that tree.c speeds up substantially if you link with a better malloc like jemalloc or tcmalloc.



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

Search: