{"push_id":639650637,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"ea0994966a22fdeb516a02a3289cd97079fbe788","before":"6b6aaa5040dd5b0cb51905c71ac372510896a30c","commits":[{"sha":"ea0994966a22fdeb516a02a3289cd97079fbe788","author":{"email":"2c4256676acc36e079a3fd9141786c2938cdfa49@cs.nthu.edu.tw","name":"clark tseng"},"message":"Refactor choose() function to deal with large numbers.\n\nThe previous implementation of choose() causes overflow if the result is too\nlarge but still within the 64-bit boundary. It is because we use\nmultiplication. This patch fixes the problem by the equation C(n, k) =\nC(n-1, k) + C(n-1, k-1).\n\n* src/choose.cpp:\n(statistics::_choose):\n(statistics::choose):\n* src/choose_unittest.cpp:\n(TEST):\n\nAffected files:\nM\tsrc/choose.cpp\nM\tsrc/choose_unittest.cpp","distinct":true,"url":"https://api.github.com/repos/chihungtzeng/sigma/commits/ea0994966a22fdeb516a02a3289cd97079fbe788"}]}