{"push_id":841791687,"size":90,"distinct_size":10,"ref":"refs/heads/master","head":"7fac34b95600562a1272995568fff331eb533894","before":"35687d594b61f698aa78f938f5fabcc933e7ee8f","commits":[{"sha":"c8b4cde7ab3c37a702eab8a6b3771076abcd4292","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Implement Hash for Int","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/c8b4cde7ab3c37a702eab8a6b3771076abcd4292"},{"sha":"d98afccea47ad2b6f58354750289f4d0ff63fb5f","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Implement Shl operation\n\nImplements Shl on `Int` with a usize operand. `x << n` is equal to\n`x * 2^n`\n\nimplementing and testing this uncovered some bugs, mostly in\nmulitplication, so they've been fixed.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/d98afccea47ad2b6f58354750289f4d0ff63fb5f"},{"sha":"7e2569fa3bdb86c350e69a4e19ec19788285c678","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Implement Shr\n\nAlso bumps the version number and adds documentation references to\nCargo.toml and README.md","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/7e2569fa3bdb86c350e69a4e19ec19788285c678"},{"sha":"6e4f7c4d49926faa89f392591d4d1e20e7fb0163","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Enable running the benchmarks in travis","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/6e4f7c4d49926faa89f392591d4d1e20e7fb0163"},{"sha":"fc7ce13ad25438c0b9d63355a2ac460c5416a902","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Add some assembly implementations for the most common routines\n\nThis is somewhat experimental, and only implemented for x86-64 on linux.\nIt's also explictly opt-in, enabled by the `asm` cargo feature.\n\nBenchmarks suggest ~30% performance improvement from these changes.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/fc7ce13ad25438c0b9d63355a2ac460c5416a902"},{"sha":"517370e89f246a8d045fc350dead11a3087fe41b","author":{"email":"19e794c1bad8f0914a9eb04e9876660727aa8f3b@gmail.com","name":"Huon Wilson"},"message":"Test `asm` feature on travis.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/517370e89f246a8d045fc350dead11a3087fe41b"},{"sha":"863ac60ac2beb8cc7675f978f94c0f47ec2b7e0c","author":{"email":"19e794c1bad8f0914a9eb04e9876660727aa8f3b@gmail.com","name":"Huon Wilson"},"message":"Rename .asm files to .s.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/863ac60ac2beb8cc7675f978f94c0f47ec2b7e0c"},{"sha":"657f5bc6682241d2fd746014468fcbb6332125df","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Merge pull request #4 from huonw/test-asm\n\nTest `asm` feature on travis.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/657f5bc6682241d2fd746014468fcbb6332125df"},{"sha":"c75fd2de41cd9c8c4733bce9274d2b0a6fa10884","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Implement low-level bitwise operations and high-level BitAnd\n\nImplements a number of bitwise operations in the low-level module. Uses\nthem to implement `BitAnd` on `Int`.\n\nThe `BitAnd` impl treats negative numbers as if they're represented in\ntwo's complement.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/c75fd2de41cd9c8c4733bce9274d2b0a6fa10884"},{"sha":"9796039fc0a14500e8672210d95fda3e7a6934f2","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Use `.S` extension for the assembly file and use the C preprocessor\n\ngcc will run assembly files with a `.S` extension through the\npreprocessor first, so take advantage of that to improve them somewhat\nby using macros.\n\nAlso combines the `add_n` and `sub_n` asm files and implements\n`submul_1` in asm since it's almost identical to `addmul_1`.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/9796039fc0a14500e8672210d95fda3e7a6934f2"},{"sha":"96fb9217b2f6e536a6b9c0f59c03100d4a8a2033","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Implement BitOr\n\nImplements BitOr and adds some documentation about the semantics of some\nof the operations","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/96fb9217b2f6e536a6b9c0f59c03100d4a8a2033"},{"sha":"86a66353bc33987a4b06cfd08ce1ca34c32b13f9","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Improve base conversion\n\nUse a callback method for generating bytes in to_base and improve the\ncalculation of digit numbers for non-power-of-two bases.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/86a66353bc33987a4b06cfd08ce1ca34c32b13f9"},{"sha":"7d7e1d802c4632be9e03ab71c98ecd098619dd2c","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Bump version","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/7d7e1d802c4632be9e03ab71c98ecd098619dd2c"},{"sha":"caba0cf8be6805322ae1bd393d0b30dfb9109291","author":{"email":"19e794c1bad8f0914a9eb04e9876660727aa8f3b@gmail.com","name":"Huon Wilson"},"message":"Implement the pidigits benchmarks-game task.\n\nRamp is approximately 3 times slower than GMP for this task.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/caba0cf8be6805322ae1bd393d0b30dfb9109291"},{"sha":"86b2d6433e7cce947d4560f589a910917ab6b700","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Merge pull request #5 from huonw/pidigits\n\nImplement the pidigits benchmarks-game task.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/86b2d6433e7cce947d4560f589a910917ab6b700"},{"sha":"92375683969a0e8dd19c435e071b7b09c58c7c19","author":{"email":"4068f0880b399410602d694b3cc711c8a8f4727e@stebalien.com","name":"Steven Allen"},"message":"a - 0 = a, not -a.\n\nfixes #7","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/92375683969a0e8dd19c435e071b7b09c58c7c19"},{"sha":"2cc0217524efa552c7c57d83977cea072b4019f2","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Merge pull request #8 from Stebalien/master\n\na - 0 = a, not -a.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/2cc0217524efa552c7c57d83977cea072b4019f2"},{"sha":"23a92b1028d214c399b90bb1112ae6dd2a2b826e","author":{"email":"80b3364deb09ee4c7f775a999a72ccb433d596c9@elektrisches-blau.com","name":"Adam C. Emerson"},"message":"Write tests for pow, fix problems they find\n\nSpecifically, the tests found problems in both raising things to the 0\npower and in raising negative numbers to powers.\n\nI also changed pow() to borrow rather than take ownership of its\nargument, since having to use foo.clone.pow() seemed really weird to\nme.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/23a92b1028d214c399b90bb1112ae6dd2a2b826e"},{"sha":"2dc636005a82c32a8edf9fe532d29e4cfcb44f44","author":{"email":"80b3364deb09ee4c7f775a999a72ccb433d596c9@elektrisches-blau.com","name":"Adam C. Emerson"},"message":"Minor optimization of Int::pow()\n\nStrip off trailing zeros before we start exponentiation, then shift the\nwhole result left afterward.","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/2dc636005a82c32a8edf9fe532d29e4cfcb44f44"},{"sha":"db8a8980441a9ca398af2fd969d8b38d6f23aa5a","author":{"email":"474ba67bdb289c6263b36dfd8a7bed6c85b04943@aatch.net","name":"James Miller"},"message":"Merge pull request #9 from electric-blue/next\n\nWrite tests for pow, fix problems they find","distinct":false,"url":"https://api.github.com/repos/huonw/ramp/commits/db8a8980441a9ca398af2fd969d8b38d6f23aa5a"}]}