180 lines
4.8 KiB
Factor
180 lines
4.8 KiB
Factor
! Copyright (C) 2003, 2009 Slava Pestov, Joe Groff.
|
|
! See http://factorcode.org/license.txt for BSD license.
|
|
USING: kernel ;
|
|
IN: math
|
|
|
|
GENERIC: >fixnum ( x -- n ) foldable
|
|
GENERIC: >bignum ( x -- n ) foldable
|
|
GENERIC: >integer ( x -- n ) foldable
|
|
GENERIC: >float ( x -- y ) foldable
|
|
|
|
GENERIC: numerator ( a/b -- a )
|
|
GENERIC: denominator ( a/b -- b )
|
|
|
|
GENERIC: real-part ( z -- x )
|
|
GENERIC: imaginary-part ( z -- y )
|
|
|
|
MATH: number= ( x y -- ? ) foldable
|
|
|
|
M: object number= 2drop f ;
|
|
|
|
MATH: < ( x y -- ? ) foldable
|
|
MATH: <= ( x y -- ? ) foldable
|
|
MATH: > ( x y -- ? ) foldable
|
|
MATH: >= ( x y -- ? ) foldable
|
|
|
|
MATH: unordered? ( x y -- ? ) foldable
|
|
MATH: u< ( x y -- ? ) foldable
|
|
MATH: u<= ( x y -- ? ) foldable
|
|
MATH: u> ( x y -- ? ) foldable
|
|
MATH: u>= ( x y -- ? ) foldable
|
|
|
|
M: object unordered? 2drop f ;
|
|
|
|
MATH: + ( x y -- z ) foldable
|
|
MATH: - ( x y -- z ) foldable
|
|
MATH: * ( x y -- z ) foldable
|
|
MATH: / ( x y -- z ) foldable
|
|
MATH: /f ( x y -- z ) foldable
|
|
MATH: /i ( x y -- z ) foldable
|
|
MATH: mod ( x y -- z ) foldable
|
|
|
|
MATH: /mod ( x y -- z w ) foldable
|
|
|
|
MATH: bitand ( x y -- z ) foldable
|
|
MATH: bitor ( x y -- z ) foldable
|
|
MATH: bitxor ( x y -- z ) foldable
|
|
GENERIC# shift 1 ( x n -- y ) foldable
|
|
GENERIC: bitnot ( x -- y ) foldable
|
|
GENERIC# bit? 1 ( x n -- ? ) foldable
|
|
|
|
GENERIC: abs ( x -- y ) foldable
|
|
|
|
<PRIVATE
|
|
|
|
GENERIC: (log2) ( x -- n ) foldable
|
|
|
|
PRIVATE>
|
|
|
|
ERROR: log2-expects-positive x ;
|
|
|
|
: log2 ( x -- n )
|
|
dup 0 <= [ log2-expects-positive ] [ (log2) ] if ; inline
|
|
|
|
: zero? ( x -- ? ) 0 number= ; inline
|
|
: 2/ ( x -- y ) -1 shift ; inline
|
|
: sq ( x -- y ) dup * ; inline
|
|
: neg ( x -- -x ) -1 * ; inline
|
|
: recip ( x -- y ) 1 swap / ; inline
|
|
: sgn ( x -- n ) dup 0 < [ drop -1 ] [ 0 > 1 0 ? ] if ; inline
|
|
: ?1+ ( x -- y ) [ 1 + ] [ 0 ] if* ; inline
|
|
: rem ( x y -- z ) abs [ mod ] [ + ] [ mod ] tri ; foldable
|
|
: 2^ ( n -- 2^n ) 1 swap shift ; inline
|
|
: even? ( n -- ? ) 1 bitand zero? ; inline
|
|
: odd? ( n -- ? ) 1 bitand 1 number= ; inline
|
|
|
|
: if-zero ( ..a n quot1: ( ..a -- ..b ) quot2: ( ..a n -- ..b ) -- ..b )
|
|
[ dup zero? ] [ [ drop ] prepose ] [ ] tri* if ; inline
|
|
|
|
: when-zero ( ..a n quot: ( ..a -- ..b ) -- ..b ) [ ] if-zero ; inline
|
|
|
|
: unless-zero ( ..a n quot: ( ..a -- ..b ) -- ..b ) [ ] swap if-zero ; inline
|
|
|
|
UNION: integer fixnum bignum ;
|
|
|
|
TUPLE: ratio { numerator integer read-only } { denominator integer read-only } ;
|
|
|
|
UNION: rational integer ratio ;
|
|
|
|
UNION: real rational float ;
|
|
|
|
TUPLE: complex { real real read-only } { imaginary real read-only } ;
|
|
|
|
UNION: number real complex ;
|
|
|
|
: fp-bitwise= ( x y -- ? ) [ double>bits ] bi@ = ; inline
|
|
|
|
GENERIC: fp-special? ( x -- ? )
|
|
GENERIC: fp-nan? ( x -- ? )
|
|
GENERIC: fp-qnan? ( x -- ? )
|
|
GENERIC: fp-snan? ( x -- ? )
|
|
GENERIC: fp-infinity? ( x -- ? )
|
|
GENERIC: fp-nan-payload ( x -- bits )
|
|
GENERIC: fp-sign ( x -- ? )
|
|
|
|
M: object fp-special? drop f ; inline
|
|
M: object fp-nan? drop f ; inline
|
|
M: object fp-qnan? drop f ; inline
|
|
M: object fp-snan? drop f ; inline
|
|
M: object fp-infinity? drop f ; inline
|
|
|
|
: <fp-nan> ( payload -- nan )
|
|
HEX: 7ff0000000000000 bitor bits>double ; inline
|
|
|
|
GENERIC: next-float ( m -- n )
|
|
GENERIC: prev-float ( m -- n )
|
|
|
|
: next-power-of-2 ( m -- n )
|
|
dup 2 <= [ drop 2 ] [ 1 - log2 1 + 2^ ] if ; inline
|
|
|
|
: power-of-2? ( n -- ? )
|
|
dup 0 <= [ drop f ] [ dup 1 - bitand zero? ] if ; foldable
|
|
|
|
: align ( m w -- n )
|
|
1 - [ + ] keep bitnot bitand ; inline
|
|
|
|
<PRIVATE
|
|
|
|
: iterate-prep ( n quot -- i n quot ) [ 0 ] 2dip ; inline
|
|
|
|
: if-iterate? ( i n true false -- ) [ 2over < ] 2dip if ; inline
|
|
|
|
: iterate-step ( i n quot -- i n quot )
|
|
#! Apply quot to i, keep i and quot, hide n.
|
|
[ nip call ] 3keep ; inline
|
|
|
|
: iterate-next ( i n quot -- i' n quot ) [ 1 + ] 2dip ; inline
|
|
|
|
PRIVATE>
|
|
|
|
: (each-integer) ( ... i n quot: ( ... i -- ... ) -- ... )
|
|
[ iterate-step iterate-next (each-integer) ]
|
|
[ 3drop ] if-iterate? ; inline recursive
|
|
|
|
: (find-integer) ( ... i n quot: ( ... i -- ... ? ) -- ... i )
|
|
[
|
|
iterate-step
|
|
[ [ ] ] 2dip
|
|
[ iterate-next (find-integer) ] 2curry bi-curry if
|
|
] [ 3drop f ] if-iterate? ; inline recursive
|
|
|
|
: (all-integers?) ( ... i n quot: ( ... i -- ... ? ) -- ... ? )
|
|
[
|
|
iterate-step
|
|
[ iterate-next (all-integers?) ] 3curry
|
|
[ f ] if
|
|
] [ 3drop t ] if-iterate? ; inline recursive
|
|
|
|
: each-integer ( ... n quot: ( ... i -- ... ) -- ... )
|
|
iterate-prep (each-integer) ; inline
|
|
|
|
: times ( ... n quot: ( ... -- ... ) -- ... )
|
|
[ drop ] prepose each-integer ; inline
|
|
|
|
: find-integer ( ... n quot: ( ... i -- ... ? ) -- ... i )
|
|
iterate-prep (find-integer) ; inline
|
|
|
|
: all-integers? ( ... n quot: ( ... i -- ... ? ) -- ... ? )
|
|
iterate-prep (all-integers?) ; inline
|
|
|
|
: find-last-integer ( ... n quot: ( ... i -- ... ? ) -- ... i )
|
|
over 0 < [
|
|
2drop f
|
|
] [
|
|
[ call ] 2keep rot [
|
|
drop
|
|
] [
|
|
[ 1 - ] dip find-last-integer
|
|
] if
|
|
] if ; inline recursive
|