steve
/
factor
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

math.primes: use fast-gcd in coprime? and replicate instead of make.

db4
John Benediktsson 2015-05-13 14:47:31 -07:00
parent 10dc967494
commit ab50fc818f
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
basis/math/primes/primes.factor
View File

@ -1,6 +1,6 @@
! Copyright (C) 2007-2009 Samuel Tardieu. ! Copyright (C) 2007-2009 Samuel Tardieu.
! See http://factorcode.org/license.txt for BSD license. ! See http://factorcode.org/license.txt for BSD license.
USING: combinators combinators.short-circuit fry kernel make math USING: combinators combinators.short-circuit fry kernel math
math.bitwise math.functions math.order math.primes.erato math.bitwise math.functions math.order math.primes.erato
math.primes.erato.private math.primes.miller-rabin math.ranges math.primes.erato.private math.primes.miller-rabin math.ranges
literals random sequences sets vectors ; literals random sequences sets vectors ;
@ -67,9 +67,9 @@ PRIVATE>
: primes-upto ( n -- seq ) 2 swap primes-between ; : primes-upto ( n -- seq ) 2 swap primes-between ;
: nprimes ( n -- seq ) [ 2 swap [ dup , next-prime ] times ] { } make nip ; : nprimes ( n -- seq ) 2 swap [ [ next-prime ] keep ] replicate nip ;
: coprime? ( a b -- ? ) gcd nip 1 = ; foldable : coprime? ( a b -- ? ) fast-gcd 1 = ; foldable
: random-prime ( numbits -- p ) : random-prime ( numbits -- p )
[ ] [ 2^ ] [ random-bits* next-prime ] tri [ ] [ 2^ ] [ random-bits* next-prime ] tri