[{"data":1,"prerenderedAt":59},["ShallowReactive",2],{"maker-e-dant":3},[4,35],{"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":22,"domain":23,"tier":24,"attempts":25,"strip":26,"url":27,"mix":28,"praise":32,"objection":33,"sub":34},33247155,"Watcher","Filesystem Watcher",false,"dev_tools",2022,91,73,"curious",-0.24,26,[17,18,19,20,21],"filesystem watcher","file change events","c++ header only","inotify alternative","kqueue","e-dant","github.com","notable",0,"3003301111031500003300000310330331033110","https:\u002F\u002Fgithub.com\u002Fe-dant\u002Fwatcher",[29,30,29,31],1,20,9,"Useful for fast feedback loops and file watching in general","Efficiency claims are unsubstantiated; the Windows implementation scans directories periodically","file watcher library",{"id":36,"name":37,"line":38,"ai":8,"cat":39,"year":40,"points":41,"comments":42,"rec":13,"s":43,"top":44,"kw":45,"maker":22,"domain":23,"tier":24,"attempts":25,"strip":50,"url":51,"mix":52,"praise":56,"objection":57,"sub":58},42359949,"salmagundi","A portable hash map in C","languages",2024,176,90,-0.22,14,[46,47,48,49],"c hash map","linear probing","portable c library","hash table c","3001133111130353330000300311333333300333","https:\u002F\u002Fgithub.com\u002Fe-dant\u002Fsalmagundi",[53,54,29,55],2,24,10,"Simple and remarkably small implementation","Deletion is broken: deleting a colliding item makes later items unfindable","c hash map library",1794036788730]