{"push_id":920137342,"size":6,"distinct_size":6,"ref":"refs/heads/master","head":"2b440258bbfbca16fc518c2f7fdf6404e6fd2612","before":"b170b700f8ffce7fed0a89625d519c804d1754d8","commits":[{"sha":"da5e7d352e9fc5dd59ad81d968794ead0a47d86d","author":{"email":"be9c68790499145e81c8b6c162e8905a95f7aa89@apple.com","name":"Nadav Rotem"},"message":"[Mangler Utils] Don't print the full path in the comments of auto generated files.\n\nDon't print the full path in the comments of auto generated files. We don't want to see full path like \"/Users/myname/strings_from_my_app.txt\" in the comments of the auto generated files, just the filename.","distinct":true,"url":"https://api.github.com/repos/gottesmm/swift/commits/da5e7d352e9fc5dd59ad81d968794ead0a47d86d"},{"sha":"a3fbcfd6ce72a0882d97a330b31eb41b51b79a9a","author":{"email":"be9c68790499145e81c8b6c162e8905a95f7aa89@apple.com","name":"Nadav Rotem"},"message":"[Mangler Utils] Generate a shorter code sequence for the operation of adding numbers to the bitstream.","distinct":true,"url":"https://api.github.com/repos/gottesmm/swift/commits/a3fbcfd6ce72a0882d97a330b31eb41b51b79a9a"},{"sha":"c16173c29f4cb36abe54c8168f7594d701287095","author":{"email":"be9c68790499145e81c8b6c162e8905a95f7aa89@apple.com","name":"Nadav Rotem"},"message":"[Mangler Utils] Don't print the full path in the comments of auto generated files.\n\nDon't print the full path in the comments of auto generated files. We don't want to see full path like \"/Users/myname/strings_from_my_app.txt\" in the comments of the auto generated files, just the filename.","distinct":true,"url":"https://api.github.com/repos/gottesmm/swift/commits/c16173c29f4cb36abe54c8168f7594d701287095"},{"sha":"7eff55dc3c56bfbec53c47f7d2f0c4235750901c","author":{"email":"be9c68790499145e81c8b6c162e8905a95f7aa89@apple.com","name":"Nadav Rotem"},"message":"[Mangler Utils] Fix an off-by-one error in the calculation of the longest huffman encoding for our alphabet.\n\nWe calculate a conservative estimate of how long our bitstream needs to be to\nhold the decoded string.  This commit fixes an off-by-one error in the\ncalculation of the longest possible encoding sequence for our alphabet.  The bug\nwas that we considered both the root of the tree and the leafs of the tree for\nthe distance calculation. However, only edges should be considered for the\nlength calculation because edges represent the one/zero bits.\n\nThis commit can improve the efficiency of our encoding because the APInts we\nneed to work with will be slightly shorter.","distinct":true,"url":"https://api.github.com/repos/gottesmm/swift/commits/7eff55dc3c56bfbec53c47f7d2f0c4235750901c"},{"sha":"8a15c5abde71f6cc29920fca20591b0ca75adc99","author":{"email":"be9c68790499145e81c8b6c162e8905a95f7aa89@apple.com","name":"Nadav Rotem"},"message":"[Docs] Add a section that describes the use of the programs that generate the compression tables.","distinct":true,"url":"https://api.github.com/repos/gottesmm/swift/commits/8a15c5abde71f6cc29920fca20591b0ca75adc99"},{"sha":"2b440258bbfbca16fc518c2f7fdf6404e6fd2612","author":{"email":"be9c68790499145e81c8b6c162e8905a95f7aa89@apple.com","name":"Nadav Rotem"},"message":"[Mangler] Shrink bitwidth after divmod while decoding fixed-width strings.\n\nWe represent strings encoded using fixed-width in alphabet that's not a power of two as:\n\na_0 * C^0 + a_1 * C^1 ... + a_n * C^n, where 'C' is the charset length and 'a'\nis the encoded character..\n\nTo extract a character we need to do a 'modulo C' operation followed by a\n'div C' operation for each character. This commit reduces the bit width of\nthe decoded number with each iteration to accelerate the divmod calculation.\nWith each iteration the APInt becomes shorter and the divmod operation becomes\nfaster.","distinct":true,"url":"https://api.github.com/repos/gottesmm/swift/commits/2b440258bbfbca16fc518c2f7fdf6404e6fd2612"}]}