factor/library/math/integer.factor

106 lines
2.2 KiB
Factor
Raw Normal View History

! Copyright (C) 2004, 2005 Slava Pestov.
! See http://factor.sf.net/license.txt for BSD license.
IN: math
USING: errors generic kernel math sequences sequences-internals ;
UNION: integer fixnum bignum ;
2004-12-24 02:52:02 -05:00
2005-10-08 01:15:14 -04:00
: even? ( n -- ? ) 1 bitand 0 = ;
: odd? ( n -- ? ) 1 bitand 1 = ;
: (gcd) ( b a y x -- a d )
dup 0 number= [
drop nip
] [
tuck /mod >r pick * swap >r swapd - r> r> (gcd)
2005-09-24 15:21:17 -04:00
] if ; inline
: gcd ( x y -- a d )
#! Compute the greatest common divisor d and multiplier a
#! such that a*x=d mod y.
swap 0 1 2swap (gcd) abs ; foldable
2005-10-13 00:30:44 -04:00
: (next-power-of-2) ( i n -- n )
2005-10-20 04:33:22 -04:00
2dup >= [
drop
] [
2005-11-22 23:29:21 -05:00
>r 1 shift r> (next-power-of-2)
2005-10-20 04:33:22 -04:00
] if ;
2005-10-13 00:30:44 -04:00
: next-power-of-2 ( n -- n )
2005-11-22 23:29:21 -05:00
1 swap (next-power-of-2) ;
2005-10-13 00:30:44 -04:00
IN: math-internals
2004-07-16 02:26:21 -04:00
2004-12-24 02:52:02 -05:00
: fraction> ( a b -- a/b )
2005-09-24 15:21:17 -04:00
dup 1 number= [ drop ] [ (fraction>) ] if ; inline
2004-12-24 02:52:02 -05:00
2005-09-17 22:25:18 -04:00
: division-by-zero ( x y -- ) "Division by zero" throw ;
2004-12-30 20:46:20 -05:00
M: integer / ( x y -- x/y )
2004-12-30 02:40:14 -05:00
dup 0 number= [
2004-12-30 20:46:20 -05:00
division-by-zero
2004-12-30 02:40:14 -05:00
] [
dup 0 < [ [ neg ] 2apply ] when
2dup gcd nip tuck /i >r /i r> fraction>
2005-09-24 15:21:17 -04:00
] if ;
2004-07-16 02:26:21 -04:00
M: fixnum number=
#! Fixnums are immediate values, so equality testing is
#! trivial.
eq? ;
M: fixnum < fixnum< ;
M: fixnum <= fixnum<= ;
M: fixnum > fixnum> ;
M: fixnum >= fixnum>= ;
2004-07-16 02:26:21 -04:00
M: fixnum + fixnum+ ;
M: fixnum - fixnum- ;
M: fixnum * fixnum* ;
M: fixnum /i fixnum/i ;
M: fixnum /f fixnum/f ;
M: fixnum mod fixnum-mod ;
2004-07-16 02:26:21 -04:00
M: fixnum /mod fixnum/mod ;
2004-07-16 02:26:21 -04:00
2005-09-16 22:47:28 -04:00
M: fixnum 1+ 1 fixnum+ ;
M: fixnum 1- 1 fixnum- ;
M: fixnum bitand fixnum-bitand ;
M: fixnum bitor fixnum-bitor ;
M: fixnum bitxor fixnum-bitxor ;
M: fixnum shift fixnum-shift ;
2004-07-16 02:26:21 -04:00
M: fixnum bitnot fixnum-bitnot ;
2004-11-08 22:36:51 -05:00
M: bignum number= bignum= ;
M: bignum < bignum< ;
M: bignum <= bignum<= ;
M: bignum > bignum> ;
M: bignum >= bignum>= ;
2004-11-08 22:36:51 -05:00
M: bignum + bignum+ ;
M: bignum - bignum- ;
M: bignum * bignum* ;
M: bignum /i bignum/i ;
M: bignum /f bignum/f ;
M: bignum mod bignum-mod ;
M: bignum /mod bignum/mod ;
2005-09-16 22:47:28 -04:00
M: bignum 1+ 1 >bignum bignum+ ;
M: bignum 1- 1 >bignum bignum- ;
M: bignum bitand bignum-bitand ;
M: bignum bitor bignum-bitor ;
M: bignum bitxor bignum-bitxor ;
M: bignum shift bignum-shift ;
M: bignum bitnot bignum-bitnot ;
M: integer truncate ;
M: integer floor ;
M: integer ceiling ;