[{"data":1,"prerenderedAt":34},["ShallowReactive",2],{"maker-daniel-cussen":3},[4],{"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":31,"objection":32,"sub":33},1959896,"Trellis","New Lisp data structure",false,"languages",2010,62,45,"curious",-0.17,8,[17,18,19,20,21],"lisp","data structure","cons cells","random access list","functional programming","daniel-cussen","github.com","notable",0,"1000303103011303100000000130303330303303","https:\u002F\u002Fgithub.com\u002Fdaniel-cussen\u002FTrellis",[25,29,25,30],16,6,"Interesting idea and clever structure.","Cons and car\u002Fcdr are O(log n) rather than O(1), so it is not a general list replacement.","lisp data structure",1793991172394]