{"push_id":1362817823,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"ec22865d76bc0a4fee001c7cc4165be3b4ef4353","before":"8437b6eca365e0d0fc92f39caef0fdb22a857977","commits":[{"sha":"b3f0a8d2572e7934640e8a3380e76ed83fab1e62","author":{"name":"Martin Duhem","email":"d9e6e8a0cd37534735555d6ee7e35b6a8a59435a@gmail.com"},"message":"Generate codec for recursive structures\n\n`Dag.topologicalSort` checks for cycles, but certain structures may\ncontain cycles and still be valid. We use `Dag.topologicalSortUnchecked`,\nwhich doesn't checks for cycle (but still works with cyclic structures),\nto order the required formats rather than `Dag.topologicalSort`.\n\nSee the attached scripted test for an example of legitimate cyclic structure.","distinct":true,"url":"https://api.github.com/repos/sbt/sbt-datatype/commits/b3f0a8d2572e7934640e8a3380e76ed83fab1e62"},{"sha":"0d742327c5cc0eb85eb7fb58c164c582eefbf112","author":{"name":"Martin Duhem","email":"d9e6e8a0cd37534735555d6ee7e35b6a8a59435a@gmail.com"},"message":"Notes for #35","distinct":true,"url":"https://api.github.com/repos/sbt/sbt-datatype/commits/0d742327c5cc0eb85eb7fb58c164c582eefbf112"},{"sha":"ec22865d76bc0a4fee001c7cc4165be3b4ef4353","author":{"name":"eugene yokota","email":"07efdd79502b339c1b4b06f319e12a44bf6e1be1@gmail.com"},"message":"Merge pull request #35 from Duhemm/recursive-structures\n\nGenerate codec for recursive structures","distinct":true,"url":"https://api.github.com/repos/sbt/sbt-datatype/commits/ec22865d76bc0a4fee001c7cc4165be3b4ef4353"}]}
{"actor":{"display_login":"eed3si9n"}}