{"push_id":1587664890,"size":1,"distinct_size":1,"ref":"refs/heads/dev/rb/004","head":"dc438842f8a9357045b7fa85ad98e149b068677c","before":"cfd3eb9d63e2be3588c95228c8a69054d8118248","commits":[{"sha":"dc438842f8a9357045b7fa85ad98e149b068677c","author":{"name":"TheCoolRob","email":"91af927c474b1674a0f8705057b86e9f9c454f8c@gmail.com"},"message":"Wrote a recursive function that can tap into a PQ to brute force this problem. The design accommodates windows which we can add next. Whole process runs in a minute which is useful and the recursion has a hit-limit facility which speeds things up.","distinct":true,"url":"https://api.github.com/repos/Pivot-Sciences/CeramicIndustriesR/commits/dc438842f8a9357045b7fa85ad98e149b068677c"}]}
{"actor":{"display_login":"TheCoolRob"}}