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

math: rename fast-gcd to simple-gcd.

locals-and-roots
John Benediktsson 2016-03-19 12:19:25 -07:00
parent bce3a88287
commit 6b07e6caf2
4 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
basis/math/functions/functions.factor
View File

@ -106,7 +106,7 @@ PRIVATE>
: nth-root ( n x -- y ) swap recip ^ ; inline : nth-root ( n x -- y ) swap recip ^ ; inline
: lcm ( a b -- c ) : lcm ( a b -- c )
[ * ] 2keep fast-gcd /i ; foldable [ * ] 2keep simple-gcd /i ; foldable
: divisor? ( m n -- ? ) : divisor? ( m n -- ? )
mod 0 = ; inline mod 0 = ; inline

2
basis/math/partial-dispatch/partial-dispatch.factor
View File

@ -216,7 +216,7 @@ SYMBOL: fast-math-ops
\ mod \ fixnum-mod \ bignum-mod define-integer-ops \ mod \ fixnum-mod \ bignum-mod define-integer-ops
\ /i \ fixnum/i \ bignum/i define-integer-ops \ /i \ fixnum/i \ bignum/i define-integer-ops
\ fast-gcd \ simple-gcd \ bignum-gcd define-integer-ops \ simple-gcd \ fixnum-gcd \ bignum-gcd define-integer-ops
\ bitand \ fixnum-bitand \ bignum-bitand define-integer-ops \ bitand \ fixnum-bitand \ bignum-bitand define-integer-ops
\ bitor \ fixnum-bitor \ bignum-bitor define-integer-ops \ bitor \ fixnum-bitor \ bignum-bitor define-integer-ops

10
core/math/math.factor
View File

@ -1,6 +1,6 @@
! Copyright (C) 2003, 2009 Slava Pestov, Joe Groff. ! Copyright (C) 2003, 2009 Slava Pestov, Joe Groff.
! See http://factorcode.org/license.txt for BSD license. ! See http://factorcode.org/license.txt for BSD license.
USING: kernel ; USING: kernel kernel.private ;
IN: math IN: math
BUILTIN: fixnum ; BUILTIN: fixnum ;
@ -202,17 +202,17 @@ PRIVATE>
: gcd ( x y -- a d ) : gcd ( x y -- a d )
[ 0 1 ] 2dip (gcd) dup 0 < [ neg ] when ; inline [ 0 1 ] 2dip (gcd) dup 0 < [ neg ] when ; inline
MATH: fast-gcd ( x y -- d ) foldable MATH: simple-gcd ( x y -- d ) foldable
<PRIVATE <PRIVATE
: simple-gcd ( x y -- d ) gcd nip ; inline : fixnum-gcd ( x y -- d ) { fixnum fixnum } declare gcd nip ;
PRIVATE> PRIVATE>
M: real fast-gcd simple-gcd ; inline M: fixnum simple-gcd fixnum-gcd ; inline
M: bignum fast-gcd bignum-gcd ; inline M: bignum simple-gcd bignum-gcd ; inline
: fp-bitwise= ( x y -- ? ) [ double>bits ] same? ; inline : fp-bitwise= ( x y -- ? ) [ double>bits ] same? ; inline

2
core/math/ratios/ratios.factor
View File

@ -29,7 +29,7 @@ M: integer /
division-by-zero division-by-zero
] [ ] [
dup 0 < [ [ neg ] bi@ ] when dup 0 < [ [ neg ] bi@ ] when
2dup fast-gcd [ /i ] curry bi@ fraction> 2dup simple-gcd [ /i ] curry bi@ fraction>
] if-zero ; ] if-zero ;
M: integer recip M: integer recip