{"push_id":2209897780,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7243659b0352c6974c10ed18eaf78fc9821eb839","before":"1a9e49f69c9f8cd2daa659fea386cf6e14b1954a","commits":[{"sha":"7243659b0352c6974c10ed18eaf78fc9821eb839","author":{"name":"Sami Liedes","email":"4a2a7feac54e77f08398398150d905cd37762d0e@iki.fi"},"message":"Obtain a further speedup by replacing CharBag vectors with GMP bignums.\n\nThe idea here is that we map the occurring Unicode character to the\nsmallest prime numbers, starting from the character that occurs the\nmost.\n\nNow, the product of the mapped small primes represents the multiset.\nSubset test is reduced to an integer divisibility test and multiset\nsubtraction is reduced to an integer division.","distinct":true,"url":"https://api.github.com/repos/sliedes/ufag/commits/7243659b0352c6974c10ed18eaf78fc9821eb839"}]}
{"actor":{"display_login":"sliedes"}}