{"push_id":3120867459,"size":25,"distinct_size":25,"ref":"refs/heads/master","head":"7e14a676677eabb143269e774936e8ca2246f850","before":"7261e2a521d86eeede76bee541082de2d0d0da60","commits":[{"sha":"c6c70c7789bba69bddffb5219c149339094c2ee1","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"Add day 16","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/c6c70c7789bba69bddffb5219c149339094c2ee1"},{"sha":"fbae7050bd3881e954ddfbf83a6850c944ff7347","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 01: Use maybe to remove \"Just\" from output","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/fbae7050bd3881e954ddfbf83a6850c944ff7347"},{"sha":"a1194dd783b1ace415ec4821abe818fdd7f7b7e3","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"Add day 17\n\nI'm amused that even the basic version (no dynamic programming) gets the\nanswers within a tenth of a second. I may not even need to bother doing\nthe dynamic programming.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/a1194dd783b1ace415ec4821abe818fdd7f7b7e3"},{"sha":"1dbe5dae6043d37e57a1e27d6ae099b530b56771","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 17: Use dynamic programming\n\nAs noted in the comments, this is gratuitous. Running in 0.1 seconds was\nplenty fast enough (without dynamic programming). However, this speeds\nit up to less than 0.02 seconds. Given this, I can't not include it.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/1dbe5dae6043d37e57a1e27d6ae099b530b56771"},{"sha":"349c598910f550d67f9bdbca00ee67a08c28946c","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 14: Use read and filter isDigit instead of regex\n\nI didn't feel like unnecessarily using one.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/349c598910f550d67f9bdbca00ee67a08c28946c"},{"sha":"9cb3613b9da825cceeefcd9250f0f92e7cfaf2db","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"Add day 18\n\nThis is the naivest possible approach, taking about 0.75 seconds to run.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/9cb3613b9da825cceeefcd9250f0f92e7cfaf2db"},{"sha":"e2c0fd1f33e0a079a08fbb08599813a9905504fa","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 18: Use activity list implementation\n\nI'm not very satisfied with the result since the code complexity has\nobviously gone up and the benefit is a bit disappointing. The original\nwas about 0.75 seconds and this is about 0.58 seconds.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/e2c0fd1f33e0a079a08fbb08599813a9905504fa"},{"sha":"fe00e23c5cad59ce2b0b930ed8331d80cacaa08b","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 18: Blindly look through all cells rather than activity list\n\nIt appears to be too much of a burden to keep up the activity list, as\nremoving it improves runtime: 0.57 seconds -> 0.38 seconds.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/fe00e23c5cad59ce2b0b930ed8331d80cacaa08b"},{"sha":"a91d2d35fb9b77f76759f7b116a05fc061fb9a84","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"Add day 19","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/a91d2d35fb9b77f76759f7b116a05fc061fb9a84"},{"sha":"f91243315cd8f6bf14bb7e6f1c71b2ec3415e9f3","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"Add day 20\n\nThis is a relatively naive implementation. It does use Robin's\ninequality to find a lower bound, but once it does it justs looks\nthrough all the houses. It's not so bad though, 1.1 seconds.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/f91243315cd8f6bf14bb7e6f1c71b2ec3415e9f3"},{"sha":"0c18ba69e42b2960f520bd5efd5a2e3afd50bca7","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 20: determine upper bound\n\nThis doesn't do anything particularly useful, but does pave the way for\nfuture improvements.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/0c18ba69e42b2960f520bd5efd5a2e3afd50bca7"},{"sha":"1c00ca203425edc279a7b5b431206af8d10ab881","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 20: Store state in array\n\nImproves runtime: 1.1 seconds -> 0.3 seconds\n\nFaster than running through possible factors of each number and seeing\nwhether they're actually factors.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/1c00ca203425edc279a7b5b431206af8d10ab881"},{"sha":"2d524a301bc6d155319d754c5ac510455688e8e9","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 20: Stop on first house to exceed\n\nThe previous commit was actually an attempt to do this, but I believe it\nwas not actually effective; I may need to investigate the behavior of\nforM more but if it always runs the function on the entire list then\nthat would do it.\n\nInstead, I use a custom findM function that I know will stop early\nwithout evaluating the rest of the list.\n\nImproves runtime: 0.3 seconds -> 0.22 seconds","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/2d524a301bc6d155319d754c5ac510455688e8e9"},{"sha":"1a7512ce5e4e18b22440082b5b874fd879178ee5","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"Add day 21","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/1a7512ce5e4e18b22440082b5b874fd879178ee5"},{"sha":"f22ef0554334bd50a4aa330cc0e73796f2473946","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"Add day 22\n\nNotes:\n\nRuntime with both caching paths: 0.02 seconds\nRuntime with only global-best caching: 0.57 seconds\nRuntime with only game state caching: 0.09 seconds\nRuntime with neither caching: Out of memory","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/f22ef0554334bd50a4aa330cc0e73796f2473946"},{"sha":"efc2487c42273836c3467fa0a3f1c14c946f141c","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"Add day 23","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/efc2487c42273836c3467fa0a3f1c14c946f141c"},{"sha":"88af8ad846644a48daa8e6c786ee5a7a2960b2be","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"Add day 24\n\nNote however that this is the broken version that doesn't check the\nremainder groups for partitionability. I will likely come back to it but\nI wanted to get a first working version first.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/88af8ad846644a48daa8e6c786ee5a7a2960b2be"},{"sha":"50531d23de054291a45698379b97d4f594c1c3e7","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"Add day 25","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/50531d23de054291a45698379b97d4f594c1c3e7"},{"sha":"13775136674b890110395472387513b058923f7f","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"README: Add highlights with my general thoughts","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/13775136674b890110395472387513b058923f7f"},{"sha":"9bb5de29f896f46aca40b543685f8e6afeccfcd9","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"cabal: build library with -Wall","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-hs-2015/commits/9bb5de29f896f46aca40b543685f8e6afeccfcd9"}]}
{"actor":{"display_login":"petertseng"}}