{"push_id":576042287,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"fefa3a4fee398fb905daca08866161ce12257729","before":"c279c25b573f8ee3178ea3f584e6d8f2edb7d7c4","commits":[{"sha":"fefa3a4fee398fb905daca08866161ce12257729","author":{"email":"b3dcaabec97155bf2db344a6c5888a0d03e909fe@hotmail.com","name":"Daniel North"},"message":"Fixed the time complexity by using an O(1) contains function. Added\ncomments to code","distinct":true,"url":"https://api.github.com/repos/dnorth/IntelligentScissors/commits/fefa3a4fee398fb905daca08866161ce12257729"}]}