{"push_id":3003478855,"size":1,"distinct_size":1,"ref":"refs/heads/tdigests","head":"8f8e16b7676f7c481da432d2a86ff7c631cfcc52","before":"68708e8e627163126f18133c504b7e6abb8a14d9","commits":[{"sha":"8f8e16b7676f7c481da432d2a86ff7c631cfcc52","author":{"name":"Kyrylo Silin","email":"f2ad1e56070cf92f0fcca4e24f47190575eb345b@kyrylo.org"},"message":"route_sender: replace min/max with TDigests\n\nhttps://github.com/tdunning/t-digest\n\n> A new data structure for accurate on-line accumulation of rank-based\n> statistics such as quantiles and trimmed means. The t-digest algorithm is also\n> very parallel friendly making it useful in map-reduce and parallel streaming\n> applications.","distinct":true,"url":"https://api.github.com/repos/airbrake/airbrake-ruby/commits/8f8e16b7676f7c481da432d2a86ff7c631cfcc52"}]}
{"actor":{"display_login":"kyrylo"}}