{"push_id":1447704270,"size":2,"distinct_size":2,"ref":"refs/heads/0.6","head":"cacc08cbdb543ecdad6fa49f49a020b5f40594b5","before":"8aafcd961c7d1c5338de424907b769f4453500e6","commits":[{"sha":"f5a84976fdda7618a6728cfa8ebd5b9b19cf4eac","author":{"name":"Nick Wellnhofer","email":"dd1b5e3c66c5554f5f9ef0ba54d9815e6f81fbec@aevum.de"},"message":"Fix IndexManager with many small segments\n\nIxManager_Choose_Sparse would throw when handling more than about 40\nsegments because of the integer overflow test in S_fibonacci.\n\nAlso, the naive recursive implementation of S_fibonacci had abysmal\nperformance. After all, the result was created by adding only 0s and\n1s. The number of calls to S_fibonacci when computing fib(n) was\nfib(n+1), resulting in more than a billion of iterations with n ~ 45.\nOn my (heavily loaded and low-end) test machine, Choose_Sparse could\ntake up to 40 seconds to complete.\n\nOn the positive side, if anyone was hit by this performance problem,\nit's likely they also saw the \"index n too large\" exception and we\nonly had two reports so far.\n\nUse a precomputed lookup table and fix the test for large values of n.\n\nFixes LUCY-318.","distinct":true,"url":"https://api.github.com/repos/nwellnhof/lucy/commits/f5a84976fdda7618a6728cfa8ebd5b9b19cf4eac"},{"sha":"cacc08cbdb543ecdad6fa49f49a020b5f40594b5","author":{"name":"Nick Wellnhofer","email":"dd1b5e3c66c5554f5f9ef0ba54d9815e6f81fbec@aevum.de"},"message":"Updating CHANGES and version number for release 0.6.1","distinct":true,"url":"https://api.github.com/repos/nwellnhof/lucy/commits/cacc08cbdb543ecdad6fa49f49a020b5f40594b5"}]}
{"actor":{"display_login":"nwellnhof"}}