99 lines
2.7 KiB
Factor
99 lines
2.7 KiB
Factor
! :folding=indent:collapseFolds=0:
|
|
|
|
! $Id$
|
|
!
|
|
! Copyright (C) 2004 Slava Pestov.
|
|
!
|
|
! Redistribution and use in source and binary forms, with or without
|
|
! modification, are permitted provided that the following conditions are met:
|
|
!
|
|
! 1. Redistributions of source code must retain the above copyright notice,
|
|
! this list of conditions and the following disclaimer.
|
|
!
|
|
! 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
! this list of conditions and the following disclaimer in the documentation
|
|
! and/or other materials provided with the distribution.
|
|
!
|
|
! THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
|
|
! INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
|
! FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
! DEVELOPERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
! SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
! PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
|
|
! OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
! WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
! OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
! ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
IN: errors
|
|
DEFER: throw
|
|
|
|
IN: math-internals
|
|
USE: generic
|
|
USE: kernel
|
|
USE: math
|
|
|
|
: reduce ( x y -- x' y' )
|
|
dup 0 < [ swap neg swap neg ] when
|
|
2dup gcd tuck /i >r /i r> ; inline
|
|
|
|
: fraction> ( a b -- a/b )
|
|
dup 0 = [
|
|
"Division by zero" throw drop
|
|
] [
|
|
dup 1 = [
|
|
drop
|
|
] [
|
|
(fraction>)
|
|
] ifte
|
|
] ifte ; inline
|
|
|
|
: integer/ ( x y -- x/y )
|
|
reduce fraction> ; inline
|
|
|
|
M: fixnum number= fixnum= ;
|
|
M: fixnum < fixnum< ;
|
|
M: fixnum <= fixnum<= ;
|
|
M: fixnum > fixnum> ;
|
|
M: fixnum >= fixnum>= ;
|
|
|
|
M: fixnum + fixnum+ ;
|
|
M: fixnum - fixnum- ;
|
|
M: fixnum * fixnum* ;
|
|
M: fixnum / integer/ ;
|
|
M: fixnum /i fixnum/i ;
|
|
M: fixnum /f fixnum/f ;
|
|
M: fixnum mod fixnum-mod ;
|
|
|
|
M: fixnum /mod fixnum/mod ;
|
|
|
|
M: fixnum bitand fixnum-bitand ;
|
|
M: fixnum bitor fixnum-bitor ;
|
|
M: fixnum bitxor fixnum-bitxor ;
|
|
M: fixnum shift fixnum-shift ;
|
|
|
|
M: fixnum bitnot fixnum-bitnot ;
|
|
|
|
M: bignum number= bignum= ;
|
|
M: bignum < bignum< ;
|
|
M: bignum <= bignum<= ;
|
|
M: bignum > bignum> ;
|
|
M: bignum >= bignum>= ;
|
|
|
|
M: bignum + bignum+ ;
|
|
M: bignum - bignum- ;
|
|
M: bignum * bignum* ;
|
|
M: bignum / integer/ ;
|
|
M: bignum /i bignum/i ;
|
|
M: bignum /f bignum/f ;
|
|
M: bignum mod bignum-mod ;
|
|
|
|
M: bignum /mod bignum/mod ;
|
|
|
|
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 ;
|