{"push_id":923893294,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2068e4bf875009191f7261c4c12d40c24c498a64","before":"ef21af3f77ddd767c4f9ac46673934b65be78bf4","commits":[{"sha":"2068e4bf875009191f7261c4c12d40c24c498a64","author":{"email":"ce491dbddf53b89d2d2578bf573b1b9b8306d908@google.com","name":"Alex Converse"},"message":"Fix precise probability quantization.\n\nThe key to the heap should be the incremental error for adjusting that\nprobability. cc should track the current quantized error which means\nadding the incremental error to the previous error. The newly calculated\nerror then should then remove the previously accounted for error to get\nthe next incremental error.\n\nfor:\nANS test=init_power(0.11,8);\ntest.quantize_prec(6);\nThe quantization rate loss decreases from 0.201408 to 0.199105.\nThe rate loss for spread_tuned_s() decreases from 0.143563 to 0.139374.","distinct":true,"url":"https://api.github.com/repos/aconverse/AsymmetricNumeralSystemsToolkit/commits/2068e4bf875009191f7261c4c12d40c24c498a64"}]}