{"push_id":866022306,"size":7,"distinct_size":7,"ref":"refs/heads/master","head":"fb9ff3e94eeaac35796a75de6609d2c889051ad9","before":"6c32dfa1f45ec7e31dc36db85af8f8e4e7914846","commits":[{"sha":"c68386fa50b27a19d132b45d13d41eab8b29c4d5","author":{"email":"a51dda7c7ff50b61eaea0444371f4a6a9301e501@arbash-meinel.com","name":"John Arbash Meinel"},"message":"Add OctreeNeighbors which helps explore what neighborhoods we will care about.","distinct":true,"url":"https://api.github.com/repos/jameinel/clash/commits/c68386fa50b27a19d132b45d13d41eab8b29c4d5"},{"sha":"3cefa005fda353f252fa24f01b1ec0ac5316272f","author":{"email":"a51dda7c7ff50b61eaea0444371f4a6a9301e501@arbash-meinel.com","name":"John Arbash Meinel"},"message":"Look into tracking the exact values inside the final octree block.","distinct":true,"url":"https://api.github.com/repos/jameinel/clash/commits/3cefa005fda353f252fa24f01b1ec0ac5316272f"},{"sha":"c63352f79e99bb9a9bee8d4e596be1d909e6f352","author":{"email":"a51dda7c7ff50b61eaea0444371f4a6a9301e501@arbash-meinel.com","name":"John Arbash Meinel"},"message":"Look at 'swizeling' the bits instead of doing it slowly.\n\nTurns out this process is called the Morton number, and there are already\nsome nice solutions.","distinct":true,"url":"https://api.github.com/repos/jameinel/clash/commits/c63352f79e99bb9a9bee8d4e596be1d909e6f352"},{"sha":"25a81dad1f7d764ecde591a85242c16310e120e0","author":{"email":"a51dda7c7ff50b61eaea0444371f4a6a9301e501@arbash-meinel.com","name":"John Arbash Meinel"},"message":"Found online some bit interleaving code for 2D Morton numbers\n\ncreated implementations and benchmarks of them. Now to do something similar in 3D","distinct":true,"url":"https://api.github.com/repos/jameinel/clash/commits/25a81dad1f7d764ecde591a85242c16310e120e0"},{"sha":"67cec10b64138efb705e908dabe97ec8120ba5a1","author":{"email":"a51dda7c7ff50b61eaea0444371f4a6a9301e501@arbash-meinel.com","name":"John Arbash Meinel"},"message":"some updates to the 2D and 3D implementations of Morton interleaving.","distinct":true,"url":"https://api.github.com/repos/jameinel/clash/commits/67cec10b64138efb705e908dabe97ec8120ba5a1"},{"sha":"b2d41a6a40526fb1325f967900ceb42b28d78793","author":{"email":"a51dda7c7ff50b61eaea0444371f4a6a9301e501@arbash-meinel.com","name":"John Arbash Meinel"},"message":"Pull the good interleaving code into octree itself and use it instead of doing a slow indexing.","distinct":true,"url":"https://api.github.com/repos/jameinel/clash/commits/b2d41a6a40526fb1325f967900ceb42b28d78793"},{"sha":"fb9ff3e94eeaac35796a75de6609d2c889051ad9","author":{"email":"a51dda7c7ff50b61eaea0444371f4a6a9301e501@arbash-meinel.com","name":"John Arbash Meinel"},"message":"Change the values slice into storing by-reference so that\nwe can update the counts by modifying the iterator.","distinct":true,"url":"https://api.github.com/repos/jameinel/clash/commits/fb9ff3e94eeaac35796a75de6609d2c889051ad9"}]}