{"push_id":1183280317,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"dcf85d364471c4bddc2d108d184338851e7f30f6","before":"f8f7a81fc3a0cf3d0e4bc370c1b6f54c5309f735","commits":[{"sha":"dcf85d364471c4bddc2d108d184338851e7f30f6","author":{"name":"Brendan Lau","email":"78f8ca666bf51d16dfed79116960ed95e6504a87@umich.edu"},"message":"-Restructured data containers in an attempt to speed up computation time.\n Instead of using n segments on n GCD queues and writing to 1 global dictionary\n via a dispatch barrier, this implementation uses n segments on n GCD queues,\n writes to n dictionaries (N.B. without having to bottleneck around a dispatch\n barrier), then, upon completion in dispatch notify, merges these n dictionaries\n together to create the final aggregate.\n-This version is producing blank dictionaries before the merge operation, I need\n to debug that.","distinct":true,"url":"https://api.github.com/repos/laus102/algolytics/commits/dcf85d364471c4bddc2d108d184338851e7f30f6"}]}
{"actor":{"display_login":"laus102"}}