{"push_id":1000306921,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"31fedb4d252a6911d8b4a38be7eb8222370a162c","before":"8799a151005856e1b2505a9ed2c160b07e366498","commits":[{"sha":"31fedb4d252a6911d8b4a38be7eb8222370a162c","author":{"email":"c8dd4bd6fbe9b8c0283f6127723ba7951821fb7f@gmail.com","name":"Clément Tamines"},"message":"Stopped using computeTest() in InOrderHeuristic (we now use the regular computePositon() method with the fragments)\nAdded getSize() method to BSPNode to compute tree size\nFixed a bug : a positive slope would return wrong position (we now switch returned position if we notice the line has a positive slope)\nAdded tests for the new computePosition(), we are now returning whether a segment is on the right or on the left of a line, regardless of its slope","distinct":true,"url":"https://api.github.com/repos/Skar0/sddII/commits/31fedb4d252a6911d8b4a38be7eb8222370a162c"}]}