{"push_id":2224931892,"size":7,"distinct_size":1,"ref":"refs/heads/unneeded/knothash_norot","head":"0e3fe53cd7fd8e757ca3e1281af62c5a90c0efbf","before":"431228fe41796dd554d99f127b6d722aa8a2b7d3","commits":[{"sha":"b4b5070ac506648e3b6a9c4b484d25b8377e6702","author":{"name":"Peter Tseng","email":"e33afba9ec74ca35e705f727d0fa612170196f91@cornell.edu"},"message":"Day 24: Optimise out self-loops\n\nRuntime 1.1 seconds -> 0.15 seconds","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2017/commits/b4b5070ac506648e3b6a9c4b484d25b8377e6702"},{"sha":"4cc434511ca4354831d7a7a3ca8c891e11108821","author":{"name":"Peter Tseng","email":"e33afba9ec74ca35e705f727d0fa612170196f91@cornell.edu"},"message":"Day 25","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2017/commits/4cc434511ca4354831d7a7a3ca8c891e11108821"},{"sha":"21dcd58b50f4ff1df904bd7ca22502f0fbe3895d","author":{"name":"Peter Tseng","email":"e33afba9ec74ca35e705f727d0fa612170196f91@cornell.edu"},"message":"Day 25: Use array for FSM not hash\n\nRuntime from 2.3 to 2.1 seconds, in exchange for making slightly more\nassumptions. I think it's fine.\n\nThis brings day 25 from being slightly the slowest to being about tied\nfor the slowest with 22.\n(Assuming that 15 and 5 are going to use their C implementation).","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2017/commits/21dcd58b50f4ff1df904bd7ca22502f0fbe3895d"},{"sha":"4199deb7afbab1e3e0b09f3103ecd4f3766e62c4","author":{"name":"Peter Tseng","email":"e33afba9ec74ca35e705f727d0fa612170196f91@cornell.edu"},"message":"Day 25: Use array for ticker\n\nImproves by about 7%, I guess it's something?","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2017/commits/4199deb7afbab1e3e0b09f3103ecd4f3766e62c4"},{"sha":"23cadbf38163caed0d43c044f8f0aac78cab2ae6","author":{"name":"Peter Tseng","email":"e33afba9ec74ca35e705f727d0fa612170196f91@cornell.edu"},"message":"README: Add highlights","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2017/commits/23cadbf38163caed0d43c044f8f0aac78cab2ae6"},{"sha":"4a5f814b8800cebfaccc0001f9d9e15519adf771","author":{"name":"Peter Tseng","email":"e33afba9ec74ca35e705f727d0fa612170196f91@cornell.edu"},"message":"Add basic block splitter","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2017/commits/4a5f814b8800cebfaccc0001f9d9e15519adf771"},{"sha":"0e3fe53cd7fd8e757ca3e1281af62c5a90c0efbf","author":{"name":"Peter Tseng","email":"e33afba9ec74ca35e705f727d0fa612170196f91@cornell.edu"},"message":"KnotHash::twist: Don't rotate\n\nWell, this actually does improve Day 14: 0.55 -> 0.45 seconds, but I\ndon't like the code nearly as much.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2017/commits/0e3fe53cd7fd8e757ca3e1281af62c5a90c0efbf"}]}
{"actor":{"display_login":"petertseng"}}