{"push_id":2301104545,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9327b4b47d71e164f935607d727b7962d01bf982","before":"53273ca6a4d085ff2681efee247a1605f289a718","commits":[{"sha":"9327b4b47d71e164f935607d727b7962d01bf982","author":{"name":"ndrshrzg","email":"e67824daf7324b30f83112816ee3d1d2e7e1133e@gmail.com"},"message":"Changes to mlrpq header file:\n- BUGFIX: calculation of Bucket could yield wrong result because the bitmask was calculated incorrectly\n- replaced the top() method with top_const() because top() should not initiate reorganization at all\n- removed some comments\n\nChanges to benchmark header:\n- added benchmark that simulates push() and pop() sequences at random. It generates segments of random length, fills them with random numbers. All elements in segment are pushed to the datastructure. For every segment, a random divisor (1 .. 10) is chosen and (segment.size() / divisor of segment) elements are popped. In the end all remaining elements are popped.\n\nChanges to Unit Tests:\n- removed the unit test specific to top_const() function","distinct":true,"url":"https://api.github.com/repos/ndrshrzg/multilayer-radix-priority-queue/commits/9327b4b47d71e164f935607d727b7962d01bf982"}]}
{"actor":{"display_login":"ndrshrzg"}}