math: rename fast-gcd to simple-gcd.

basis/math/functions/functions.factor

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

basis/math/partial-dispatch/partial-dispatch.factor

@@ -216,7 +216,7 @@ SYMBOL: fast-math-ops
         \ mod \ fixnum-mod \ bignum-mod 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
         \ bitor \ fixnum-bitor \ bignum-bitor define-integer-ops

core/math/math.factor

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

core/math/ratios/ratios.factor

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