{"push_id":657275493,"size":18,"distinct_size":18,"ref":"refs/heads/update-fold","head":"5878d9904e11722295a5c627ea1857b120149170","before":"4e321de43109cd991e950c529fdec195f9a3706e","commits":[{"sha":"b8fb64a35a303d718bd10b708f9bbf77eb967247","author":{"email":"5fc431c1e0f17b94f8fc43fe754260d1ed487491@gmail.com","name":"Joseph Crail"},"message":"Fix broken seq tests.","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/b8fb64a35a303d718bd10b708f9bbf77eb967247"},{"sha":"cee1837879f2ef14982a82fd93fb74376a64fc42","author":{"email":"b3a9059f10cf25db073dd931004a53510da7da3a@gmail.com","name":"kwantam"},"message":"slight clarification / refactoring in `unexpand`\n\nThis keeps equivalent functionality but makes the code slightly cleaner.\nAlso added one more test case.","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/cee1837879f2ef14982a82fd93fb74376a64fc42"},{"sha":"06b70877db5d48c919c31d8e4238fe1c64740c26","author":{"email":"25f414cc6a2fa00f85efe681524db5dc1e081d37@gmail.com","name":"Wiktor Kuropatwa"},"message":"factor: Rho-Pollard factorization implementation","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/06b70877db5d48c919c31d8e4238fe1c64740c26"},{"sha":"6c4e967fc666a7b40000c7cb271b5b3b448c3e0c","author":{"email":"b3a9059f10cf25db073dd931004a53510da7da3a@gmail.com","name":"kwantam"},"message":"fix and slight optimization for `factor`\n\nThis commit builds upon @wikol's Pollard rho implementation.\nIt adds the following:\n\n1. A generator for prime inverse tables. With these, we can do\n   very fast divisibility tests (a single multiply and comparison)\n   for small primes (presently, the first 1000 primes are in the\n   table, which means all numbers of ~26 bits or less can be\n   factored very quickly.\n\n2. Always try prime inverse tables before jumping into Pollard's\n   rho method or using trial division.\n\n3. Since we have eliminated all small factors by the time we're\n   done with the table division, only use slow trial division when\n   the number is big enough to cause overflow issues in Pollard's\n   rho, and jump out of trial division and into Pollard's rho as\n   soon as the number is small enough.\n\n4. Updates the Makefile to regenerate the prime table if it's not\n   up-to-date.","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/6c4e967fc666a7b40000c7cb271b5b3b448c3e0c"},{"sha":"1c93a793e95658eab54e1754ce39d9b5d1240519","author":{"email":"b3a9059f10cf25db073dd931004a53510da7da3a@gmail.com","name":"kwantam"},"message":"fix `touch`","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/1c93a793e95658eab54e1754ce39d9b5d1240519"},{"sha":"cab4f8d570741b2985cef07e5acdd58f5efe8f4e","author":{"email":"b3a9059f10cf25db073dd931004a53510da7da3a@gmail.com","name":"kwantam"},"message":"fix `test`","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/cab4f8d570741b2985cef07e5acdd58f5efe8f4e"},{"sha":"9a806346a91535ad52caf66eb65b66b43c23b571","author":{"email":"b3a9059f10cf25db073dd931004a53510da7da3a@gmail.com","name":"kwantam"},"message":"add test for `factor`\n\nAdd a test for `factor`.\n\nThis commit also pulls factor's Sieve implementation into its own module\nso that the factor test can use it.\n\nFinally, slight refactoring for clarity in gen_table.rs.","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/9a806346a91535ad52caf66eb65b66b43c23b571"},{"sha":"4390e4ffa6b2afe382a5dadee6e49612dc206680","author":{"email":"b3a9059f10cf25db073dd931004a53510da7da3a@gmail.com","name":"kwantam"},"message":"fix `tac`","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/4390e4ffa6b2afe382a5dadee6e49612dc206680"},{"sha":"d89fbedf124088b705f86922d51fda0d2f1df4f7","author":{"email":"b3a9059f10cf25db073dd931004a53510da7da3a@gmail.com","name":"kwantam"},"message":"fix `shuf`","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/d89fbedf124088b705f86922d51fda0d2f1df4f7"},{"sha":"d8f58305d63929631109ad325dff7a15522c0f17","author":{"email":"b8e0e73fdf9cf06af331297b8c811600a086bdeb@outlook.com","name":"Camille TJHOA"},"message":"new io cksum (includes BufReader fix)\n\ncloses kwantam/coreutils#1 via cherry-pick","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/d8f58305d63929631109ad325dff7a15522c0f17"},{"sha":"7565c27c00a27d006cdc87d710586117b6ad0b12","author":{"email":"b3a9059f10cf25db073dd931004a53510da7da3a@gmail.com","name":"kwantam"},"message":"fixed `sleep`","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/7565c27c00a27d006cdc87d710586117b6ad0b12"},{"sha":"dfaee63cd3b5c7343897f71719b80ec42116a18f","author":{"email":"5fc431c1e0f17b94f8fc43fe754260d1ed487491@gmail.com","name":"Joseph Crail"},"message":"Remove unused feature from cat.","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/dfaee63cd3b5c7343897f71719b80ec42116a18f"},{"sha":"ff24d48e73ec316182eaf032f8bef08fa36766dc","author":{"email":"b3a9059f10cf25db073dd931004a53510da7da3a@gmail.com","name":"kwantam"},"message":"modify `factor` impl to eliminate overflow issue\n\nThis change does the following:\n\n1. Updates the arithmetic functions in `src/factor/numeric.rs` to\n   correctly handle all cases up to 2^64. When numbers are larger\n   than 2^63, we fall back to slightly slower routines that check\n   for and handle overflow.\n\n2. Since the arithmetic functions will now not overflow, we no longer\n   need the safety net trial division implementation. We now always\n   use Pollard's rho after eliminating small (<=13 bit) primes.\n\n3. Slight tweak in `src/factor/gen_table.rs` to generate the first\n   1027 primes, which means we test every prime of 13 or fewer bits\n   before going into Pollard's rho. Includes corresponding update in\n   `src/factor/prime_table.rs` and the Makefile to reflect this.\n\n4. Add a new test that generates random numbers with exclusively\n   large (14 to 50 bit) prime factors. This exercises the possible\n   overflow paths.\n\n5. Add another new test that checks the `is_prime()` function against\n   a few dozen 64-bit primes. Again this is to exercise possible\n   overflow paths.","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/ff24d48e73ec316182eaf032f8bef08fa36766dc"},{"sha":"a457a870e95e339ae72e7cd4c8a58bc6e9b72d98","author":{"email":"a7c0c13c7074db9d37bd7253c81e330087f255e2@users.noreply.github.com","name":"Heather"},"message":"Merge pull request #558 from kwantam/master\n\nslight refactor in `unexpand` ; fix and optimize `factor` ; fix `touch`, `test`, `tac`, `shuf`, `sleep` ; merge PR from @ctjhoa for `cksum`","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/a457a870e95e339ae72e7cd4c8a58bc6e9b72d98"},{"sha":"4e2cd4dd24835cd3fca1200590064bf43defdf10","author":{"email":"a7c0c13c7074db9d37bd7253c81e330087f255e2@users.noreply.github.com","name":"Heather"},"message":"Merge pull request #580 from jbcrail/remove-unused-feature\n\nRemove unused feature from cat.","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/4e2cd4dd24835cd3fca1200590064bf43defdf10"},{"sha":"b4c106b00455f76beb48ebc61c74d937312c4882","author":{"email":"a7c0c13c7074db9d37bd7253c81e330087f255e2@users.noreply.github.com","name":"Heather"},"message":"Merge pull request #578 from jbcrail/fix-broken-seq-tests\n\nFix broken seq tests.","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/b4c106b00455f76beb48ebc61c74d937312c4882"},{"sha":"dd19bc27c1939a9c47f2e23989b32dad5f5c9265","author":{"email":"5fc431c1e0f17b94f8fc43fe754260d1ed487491@gmail.com","name":"Joseph Crail"},"message":"Update fold to nightly build.","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/dd19bc27c1939a9c47f2e23989b32dad5f5c9265"},{"sha":"5878d9904e11722295a5c627ea1857b120149170","author":{"email":"5fc431c1e0f17b94f8fc43fe754260d1ed487491@gmail.com","name":"Joseph Crail"},"message":"Add tests for fold.","distinct":true,"url":"https://api.github.com/repos/jbcrail/coreutils/commits/5878d9904e11722295a5c627ea1857b120149170"}]}