{"push_id":1479711344,"size":2,"distinct_size":2,"ref":"refs/heads/array-based-book-optimize","head":"c77403e840c1db3b623b05d93da547b830c8947f","before":"e6106d35eaa7e5dfa7da17f45ce94d8fe1854435","commits":[{"sha":"03afe61931c0f321604b81b34729daa01dbfd9b8","author":{"name":"Carlos O'Ryan","email":"1e981885614af43f673a374e712cb3970cfca931@users.noreply.github.com"},"message":"The initial simulated book operation was too \"special\".\n\nI was creating N+1 operations because the loop started at 0\nand the first operation needs to be a large order creation.\nIt is trivial to generate exactly N operations by making the\nloop start at 1.","distinct":true,"url":"https://api.github.com/repos/coryan/jaybeams/commits/03afe61931c0f321604b81b34729daa01dbfd9b8"},{"sha":"c77403e840c1db3b623b05d93da547b830c8947f","author":{"name":"Carlos O'Ryan","email":"1e981885614af43f673a374e712cb3970cfca931@users.noreply.github.com"},"message":"Fixed merge problem.","distinct":true,"url":"https://api.github.com/repos/coryan/jaybeams/commits/c77403e840c1db3b623b05d93da547b830c8947f"}]}
{"actor":{"display_login":"coryan"}}