{"push_id":3174729575,"size":48,"distinct_size":1,"ref":"refs/heads/fail/day23-flatten","head":"503fc1538d30ba11015d987e773a4d493e652208","before":"f36d7414df1bfe24777b4dd63d15ba6c2c5f2ce8","commits":[{"sha":"773a1af096f891a11debb258936005fd73a9057e","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 02: O(k^2 * n) solution\n\nRuntime: about 270 ms -> 110 ms","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/773a1af096f891a11debb258936005fd73a9057e"},{"sha":"b369d1fbaae624f011886de425b362754fbe5e1b","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 03","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/b369d1fbaae624f011886de425b362754fbe5e1b"},{"sha":"82bcdbb746bac53f57215798745f7625025a2164","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 04","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/82bcdbb746bac53f57215798745f7625025a2164"},{"sha":"8cf99ca5aed58d77ec1cad83263fab33c20e9e6c","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 05","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/8cf99ca5aed58d77ec1cad83263fab33c20e9e6c"},{"sha":"4db0b68d5f5df7395a5be910a568b8597647e1c3","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 05: Take off pairs left-to-right\n\nInstead of having to repeatedly search through the entire string every\ntime, which is quite slow.","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/4db0b68d5f5df7395a5be910a568b8597647e1c3"},{"sha":"a1e51c39c6ac86c507486f04bf45798d278e1105","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 06","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/a1e51c39c6ac86c507486f04bf45798d278e1105"},{"sha":"7fcfdffb8c7611c91534c8638966ce59f873adcf","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 06: Do part 2 while doing part 1\n\nI guess I just thought that this wouldn't get everything, but turns out\nit does. Shame that I didn't figure this out earlier.\n\nBecause I don't trust this at all, I'm going to add something that\nprints out when it might be wrong.","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/7fcfdffb8c7611c91534c8638966ce59f873adcf"},{"sha":"d8c92dd27e2944b7a21fba4359685d1b7815c14d","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 07","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/d8c92dd27e2944b7a21fba4359685d1b7815c14d"},{"sha":"1605e05f524e5c15a298d3d5689d82122cab49f7","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 08","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/1605e05f524e5c15a298d3d5689d82122cab49f7"},{"sha":"4949df503f3fe607512d02cb0544231dacedcf13","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 09","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/4949df503f3fe607512d02cb0544231dacedcf13"},{"sha":"a2d7a2e2e3d99072555d9c2de4bf7c1b5c642bb8","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 09: Simulate a double-ended queue with a fixed-size array\n\nRuntime 3.3 seconds -> 2.1 seconds","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/a2d7a2e2e3d99072555d9c2de4bf7c1b5c642bb8"},{"sha":"80837c76b6d989a810386a27db326e2920f69438","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 09: Use doubly-linked list backed by two fixed-size arrays\n\nValue is implicit in index, so we only need two arrays.\n\nThis is certainly faster than explicitly creating node objects every\ntime.\n\nThis is clearer than having an array of two-element arrays (and perhaps\nfaster as well? unverified).\n\nCreating an array of node objects hasn't been tested.\n\nCompared to the previous approach of backing a double-ended queue with a\nfixed-size array, this is about the same speed, but paves the way for a\nfuture improvement.","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/80837c76b6d989a810386a27db326e2920f69438"},{"sha":"7da390aee380aa3fff6e8e518f63c5381aacca63","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 10","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/7da390aee380aa3fff6e8e518f63c5381aacca63"},{"sha":"30bc7a3e470e3d94d27c99a915bd4dd5d8b40f67","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 09: Remove left pointers (Use singly-linked list)\n\nAvoid the need for left pointers by observing that the marble to the\nright of the marble inserted 5 iterations ago is the one to be removed.\n\nStill using static allocations, since the marble score is implicit (the\narray index) and the right pointers will be stored in the array.\n\nRuntime improves: 2.0 seconds -> 1.6 seconds","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/30bc7a3e470e3d94d27c99a915bd4dd5d8b40f67"},{"sha":"673afed47f347e246ca94734becb1ac911416327","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 11 (with summed-area tables)","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/673afed47f347e246ca94734becb1ac911416327"},{"sha":"f72bef37b73b8fe7bea6288e60f3648c782bd556","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 09: stop adding marbles when list is big enough\n\nAfter any removal, marbles to be removed are at indices 19, 35, 51...\netc right of current. If list already contains enough marbles such that\nwe know what's to be removed in future iterations, stop adding and just\ntake marbles off the list until done.\n\nRuntime improves: 1.5 seconds -> 0.9 seconds","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/f72bef37b73b8fe7bea6288e60f3648c782bd556"},{"sha":"a30b6d54dd30a22d1cd0af13c0787394d4c651f2","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 11: Use tighter bound for odd squares\n\nA square of five can be built from twos and threes:\n\nAABBB\nAABBB\nCCXBB\nCCCDD\nCCCDD\n\nJust subtract an X.\n\nReduces the number of non-doomed sizes from 76 to 57\n\nRuntime improves: 1.3 seconds -> 1.1 seconds","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/a30b6d54dd30a22d1cd0af13c0787394d4c651f2"},{"sha":"aced3ed69d52fb2f61a6eb1f7413dc078bf9152b","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 12","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/aced3ed69d52fb2f61a6eb1f7413dc078bf9152b"},{"sha":"971c8444c33e8571b361e025c73dc2755c0d855b","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 13","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/971c8444c33e8571b361e025c73dc2755c0d855b"},{"sha":"c422080491bb7cdfb1730400d9bb3ca33c6567f7","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 14","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/c422080491bb7cdfb1730400d9bb3ca33c6567f7"}]}
{"actor":{"display_login":"petertseng"}}