{"push_id":623315033,"size":7,"distinct_size":6,"ref":"refs/heads/more-tests","head":"118c4ac5c6b8fae85a59516461a8afc2970c36d2","before":"e0a836394ef56027e77a5ff8d7cf1de81c7b669e","commits":[{"sha":"af896b318ec3db48961a7a764406744cf65198d6","author":{"email":"b03c8700f3e076c039a76e5f1e2b19e36dc32297@gmail.com","name":"Ivan Lazar Miljenovic"},"message":"GHC 7.10.1 has been released, so don't allow failures any more","distinct":false,"url":"https://api.github.com/repos/haskell/fgl/commits/af896b318ec3db48961a7a764406744cf65198d6"},{"sha":"ea8e6757db85744bcbadf6bc9676590e75e86d7b","author":{"email":"b03c8700f3e076c039a76e5f1e2b19e36dc32297@gmail.com","name":"Ivan Lazar Miljenovic"},"message":"Be able to generate Arbitrary node and edge lists","distinct":true,"url":"https://api.github.com/repos/haskell/fgl/commits/ea8e6757db85744bcbadf6bc9676590e75e86d7b"},{"sha":"4f44a96954c462c2255e03999358ee2c2802c811","author":{"email":"b03c8700f3e076c039a76e5f1e2b19e36dc32297@gmail.com","name":"Ivan Lazar Miljenovic"},"message":"Use -fno-warn-orphans explicitly in Arbitrary\n\nRather than stating it in the two .cabal files - where it can also apply\nto other modules - use it specifically in the module where it is\nused (also helps avoid duplication).","distinct":true,"url":"https://api.github.com/repos/haskell/fgl/commits/4f44a96954c462c2255e03999358ee2c2802c811"},{"sha":"b372caabc388026f57181affc34b4ec7d70ce922","author":{"email":"b03c8700f3e076c039a76e5f1e2b19e36dc32297@gmail.com","name":"Ivan Lazar Miljenovic"},"message":"Add toLEdge function\n\nPseudo-inverse to toEdge and edgeLabel.","distinct":true,"url":"https://api.github.com/repos/haskell/fgl/commits/b372caabc388026f57181affc34b4ec7d70ce922"},{"sha":"ba070baf7215135d5d8fdf9026e22a8a5c97862f","author":{"email":"b03c8700f3e076c039a76e5f1e2b19e36dc32297@gmail.com","name":"Ivan Lazar Miljenovic"},"message":"Generate sample data more specifically\n\nThis means that not all properties are just simple Bool-based\nexpressions, but they're also more sensible now by being able to use the\nsmarter generators specifically.\n\nAs part of this, tests should *not* be internally exhaustive (otherwise\nthey become too computationally expensive): instead, generate sample\ndata based upon the actual graph (which is not possible to do with just\nBool-based properties, and is the main reason why Gen-based properties\nare now being used).  For example, see the new definition of\n`valid_match`.","distinct":true,"url":"https://api.github.com/repos/haskell/fgl/commits/ba070baf7215135d5d8fdf9026e22a8a5c97862f"},{"sha":"fc221b0afc396c52a2aa8ad1462e5a3d10520173","author":{"email":"b03c8700f3e076c039a76e5f1e2b19e36dc32297@gmail.com","name":"Ivan Lazar Miljenovic"},"message":"Document graphTests","distinct":true,"url":"https://api.github.com/repos/haskell/fgl/commits/fc221b0afc396c52a2aa8ad1462e5a3d10520173"},{"sha":"118c4ac5c6b8fae85a59516461a8afc2970c36d2","author":{"email":"b03c8700f3e076c039a76e5f1e2b19e36dc32297@gmail.com","name":"Ivan Lazar Miljenovic"},"message":"More Properties to test\n\ncontainers is used for Data.Set for more efficient lookups","distinct":true,"url":"https://api.github.com/repos/haskell/fgl/commits/118c4ac5c6b8fae85a59516461a8afc2970c36d2"}]}