{"push_id":1191151724,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"dc7ef885c23a46995fe165436692539d13e66491","before":"9937c8e26650f5068682f011144c3ab0ffd2a1c7","commits":[{"sha":"ade795be3b0cc20a5b481947c0aeb2e6694a18fb","author":{"name":"BabitzdaBrave","email":"0fc67c30bf12ca6315c413626eef5f781cffd095@gmail.com"},"message":"how to do foldtree using postorder traversal?","distinct":true,"url":"https://api.github.com/repos/statisticallyfit/Haskell/commits/ade795be3b0cc20a5b481947c0aeb2e6694a18fb"},{"sha":"b9370e067cc7ef98cd62df3ea3c82268a7002dfa","author":{"name":"BabitzdaBrave","email":"0fc67c30bf12ca6315c413626eef5f781cffd095@gmail.com"},"message":"finished caesar cipher working on vigniere cipher","distinct":true,"url":"https://api.github.com/repos/statisticallyfit/Haskell/commits/b9370e067cc7ef98cd62df3ea3c82268a7002dfa"},{"sha":"dc7ef885c23a46995fe165436692539d13e66491","author":{"name":"BabitzdaBrave","email":"0fc67c30bf12ca6315c413626eef5f781cffd095@gmail.com"},"message":"tested shift switch shift one and no shift","distinct":true,"url":"https://api.github.com/repos/statisticallyfit/Haskell/commits/dc7ef885c23a46995fe165436692539d13e66491"}]}
{"actor":{"display_login":"statisticallyfit"}}