[{"data":1,"prerenderedAt":58},["ShallowReactive",2],{"maker-igushev":3},[4,33],{"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":24,"strip":25,"url":26,"mix":27,"praise":30,"objection":31,"sub":32},20539678,"city_visit_planner","Library for a Travel Service to Optimize Time During Trip to a City",false,"consumer_social",2019,64,14,"mixed",0.21,33,[17,18,19,20],"trip planner","itinerary optimizer","city travel","sightseeing schedule","igushev","github.com","notable",0,"00330005030050","https:\u002F\u002Fgithub.com\u002Figushev\u002Fcity_visit_planner",[28,28,29,24],2,1,"Cool idea and nice work","Real cities have unpredictable factors like traffic and detours that a fixed schedule ignores","travel planning",{"id":34,"name":35,"line":36,"ai":8,"cat":37,"year":10,"points":38,"comments":39,"rec":40,"s":41,"top":42,"kw":43,"maker":21,"domain":22,"tier":48,"attempts":24,"strip":49,"url":50,"mix":51,"praise":55,"objection":56,"sub":57},20872696,"IgushArray","Array with Constant Time Access and Fast Insertion and Deletion","languages",300,103,"curious",-0.25,5,[44,45,46,47],"tiered vector","constant time access","sqrt decomposition","c++ vector","legend","3313333113105533130331051111131300111311","https:\u002F\u002Fgithub.com\u002Figushev\u002FIgushArray",[52,53,52,54],4,30,20,"Clever idea and a neat restructuring of the vector","Insertion cost O(sqrt N) is still much slower than O(log N) trees","data structure library",1794036766736]