{"push_id":1173423970,"size":1,"distinct_size":1,"ref":"refs/heads/v2","head":"51bf65a2d7ef34050e99fd2f64cc9a620897c1b5","before":"d0d600cb685491f1f6d60f967d3043b85ad5f15c","commits":[{"sha":"51bf65a2d7ef34050e99fd2f64cc9a620897c1b5","author":{"name":"Nick Zavaritsky","email":"a44e12bf8b454e07009599342f9a4f7698867068@gmail.com"},"message":"Use linear search with small enums\n\nPhf-s are surprisingly computationally-intense (due-to a rather complex\nhash func used), only 144M invocations/sec.\n\nWith small enums, linear search is faster.","distinct":true,"url":"https://api.github.com/repos/tarantool/tarantool-avro/commits/51bf65a2d7ef34050e99fd2f64cc9a620897c1b5"}]}
{"actor":{"display_login":"mejedi"}}