{"push_id":875468285,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"0370068a56b0f6d3148bbccf887f7fee0be43210","before":"a7b73b7ba324a274b0a94e0575e3cf0b58c22b2f","commits":[{"sha":"0370068a56b0f6d3148bbccf887f7fee0be43210","author":{"email":"63313199a9d68f217a4cd7139fc82b373194f7a0@jelv.is","name":"Tikhon Jelvis"},"message":"Added a new benchmark that measures inserting a single element into a tree with 10k elements.\n\nThis doesn't hit any corner cases (ie resizing nodes) and performs within ~2x of IntMap. It should be faster, ideally, but it's a far cry from the benchmark creating a 10k tree where ART is ~10x slower than IntMap.","distinct":true,"url":"https://api.github.com/repos/TikhonJelvis/adaptive-radix-trees/commits/0370068a56b0f6d3148bbccf887f7fee0be43210"}]}