[{"data":1,"prerenderedAt":52},["ShallowReactive",2],{"maker-mkirchner":3},[4,31],{"id":5,"name":6,"line":7,"ai":8,"cat":9,"year":10,"points":11,"comments":12,"rec":13,"s":14,"top":15,"kw":16,"maker":21,"domain":22,"tier":23,"attempts":14,"strip":24,"url":25,"mix":26,"praise":28,"objection":29,"sub":30},21841368,"gc","A simple garbage collector for C",false,"languages",2019,192,60,"curious",0,10,[17,18,19,20],"garbage collector","c","mark and sweep","memory management","mkirchner","github.com","notable","3330000000030000000000000000000000030030","https:\u002F\u002Fgithub.com\u002Fmkirchner\u002Fgc",[14,27,14,14],8,"Good for learning and a clean implementation of mark-and-sweep.","Conservative stack scanning can keep memory alive by coincidence and is slow.","garbage collector library",{"id":32,"name":33,"line":34,"ai":8,"cat":9,"year":35,"points":36,"comments":37,"rec":13,"s":38,"top":39,"kw":40,"maker":21,"domain":22,"tier":23,"attempts":14,"strip":44,"url":45,"mix":46,"praise":49,"objection":50,"sub":51},36672957,"hamt","A hash array-mapped trie implementation in C",2023,171,56,0.13,12,[33,41,42,43],"persistent data structure","hash array mapped trie","c library","5333000311031313335333303353305151505135","https:\u002F\u002Fgithub.com\u002Fmkirchner\u002Fhamt",[27,47,14,48],26,7,"Clean, readable code and documentation","Allocator API design is debated; commenters prefer a context-carrying or malloc-compatible interface","data structure library",1793991245426]