1 ! Copyright (C) 2003, 2009 Slava Pestov.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: kernel math.private ;
6 GENERIC: >fixnum ( x -- n ) foldable
7 GENERIC: >bignum ( x -- n ) foldable
8 GENERIC: >integer ( x -- n ) foldable
9 GENERIC: >float ( x -- y ) foldable
11 GENERIC: numerator ( a/b -- a )
12 GENERIC: denominator ( a/b -- b )
14 GENERIC: real-part ( z -- x )
15 GENERIC: imaginary-part ( z -- y )
17 MATH: number= ( x y -- ? ) foldable
19 M: object number= 2drop f ;
21 MATH: < ( x y -- ? ) foldable
22 MATH: <= ( x y -- ? ) foldable
23 MATH: > ( x y -- ? ) foldable
24 MATH: >= ( x y -- ? ) foldable
26 MATH: + ( x y -- z ) foldable
27 MATH: - ( x y -- z ) foldable
28 MATH: * ( x y -- z ) foldable
29 MATH: / ( x y -- z ) foldable
30 MATH: /f ( x y -- z ) foldable
31 MATH: /i ( x y -- z ) foldable
32 MATH: mod ( x y -- z ) foldable
34 MATH: /mod ( x y -- z w ) foldable
36 MATH: bitand ( x y -- z ) foldable
37 MATH: bitor ( x y -- z ) foldable
38 MATH: bitxor ( x y -- z ) foldable
39 GENERIC# shift 1 ( x n -- y ) foldable
40 GENERIC: bitnot ( x -- y ) foldable
41 GENERIC# bit? 1 ( x n -- ? ) foldable
43 GENERIC: abs ( x -- y ) foldable
47 GENERIC: (log2) ( x -- n ) foldable
53 "log2 expects positive inputs" throw
58 : zero? ( x -- ? ) 0 number= ; inline
59 : 1+ ( x -- y ) 1 + ; inline
60 : 1- ( x -- y ) 1 - ; inline
61 : 2/ ( x -- y ) -1 shift ; inline
62 : sq ( x -- y ) dup * ; inline
63 : neg ( x -- -x ) -1 * ; inline
64 : recip ( x -- y ) 1 swap / ; inline
65 : sgn ( x -- n ) dup 0 < [ drop -1 ] [ 0 > 1 0 ? ] if ; inline
66 : ?1+ ( x -- y ) [ 1 + ] [ 0 ] if* ; inline
67 : rem ( x y -- z ) abs [ mod ] [ + ] [ mod ] tri ; foldable
68 : 2^ ( n -- 2^n ) 1 swap shift ; inline
69 : even? ( n -- ? ) 1 bitand zero? ;
70 : odd? ( n -- ? ) 1 bitand 1 number= ;
72 UNION: integer fixnum bignum ;
74 TUPLE: ratio { numerator integer read-only } { denominator integer read-only } ;
76 UNION: rational integer ratio ;
78 UNION: real rational float ;
80 TUPLE: complex { real real read-only } { imaginary real read-only } ;
82 UNION: number real complex ;
84 : fp-bitwise= ( x y -- ? ) [ double>bits ] bi@ = ; inline
86 GENERIC: fp-special? ( x -- ? )
87 GENERIC: fp-nan? ( x -- ? )
88 GENERIC: fp-qnan? ( x -- ? )
89 GENERIC: fp-snan? ( x -- ? )
90 GENERIC: fp-infinity? ( x -- ? )
91 GENERIC: fp-nan-payload ( x -- bits )
101 M: object fp-infinity?
103 M: object fp-nan-payload
107 double>bits -52 shift HEX: 7ff [ bitand ] keep = ;
109 M: float fp-nan-payload
110 double>bits HEX: fffffffffffff bitand ; foldable flushable
113 dup fp-special? [ fp-nan-payload zero? not ] [ drop f ] if ;
116 dup fp-nan? [ fp-nan-payload HEX: 8000000000000 bitand zero? not ] [ drop f ] if ;
119 dup fp-nan? [ fp-nan-payload HEX: 8000000000000 bitand zero? ] [ drop f ] if ;
121 M: float fp-infinity?
122 dup fp-special? [ fp-nan-payload zero? ] [ drop f ] if ;
124 : <fp-nan> ( payload -- nan )
125 HEX: 7ff0000000000000 bitor bits>double ; foldable flushable
127 : next-float ( m -- n )
129 dup -0.0 double>bits > [ 1 - bits>double ] [ ! negative non-zero
130 dup -0.0 double>bits = [ drop 0.0 ] [ ! negative zero
131 1 + bits>double ! positive
133 ] if ; foldable flushable
135 : prev-float ( m -- n )
137 dup -0.0 double>bits >= [ 1 + bits>double ] [ ! negative
138 dup 0.0 double>bits = [ drop -0.0 ] [ ! positive zero
139 1 - bits>double ! positive non-zero
141 ] if ; foldable flushable
143 : next-power-of-2 ( m -- n )
144 dup 2 <= [ drop 2 ] [ 1 - log2 1 + 2^ ] if ; inline
146 : power-of-2? ( n -- ? )
147 dup 0 <= [ drop f ] [ dup 1 - bitand zero? ] if ; foldable
150 1 - [ + ] keep bitnot bitand ; inline
154 : iterate-prep ( n quot -- i n quot ) [ 0 ] 2dip ; inline
156 : if-iterate? ( i n true false -- ) [ 2over < ] 2dip if ; inline
158 : iterate-step ( i n quot -- i n quot )
159 #! Apply quot to i, keep i and quot, hide n.
160 [ nip call ] 3keep ; inline
162 : iterate-next ( i n quot -- i' n quot ) [ 1 + ] 2dip ; inline
166 : (each-integer) ( i n quot: ( i -- ) -- )
167 [ iterate-step iterate-next (each-integer) ]
168 [ 3drop ] if-iterate? ; inline recursive
170 : (find-integer) ( i n quot: ( i -- ? ) -- i )
173 [ 2drop ] [ iterate-next (find-integer) ] if
174 ] [ 3drop f ] if-iterate? ; inline recursive
176 : (all-integers?) ( i n quot: ( i -- ? ) -- ? )
179 [ iterate-next (all-integers?) ] [ 3drop f ] if
180 ] [ 3drop t ] if-iterate? ; inline recursive
182 : each-integer ( n quot -- )
183 iterate-prep (each-integer) ; inline
185 : times ( n quot -- )
186 [ drop ] prepose each-integer ; inline
188 : find-integer ( n quot -- i )
189 iterate-prep (find-integer) ; inline
191 : all-integers? ( n quot -- ? )
192 iterate-prep (all-integers?) ; inline
194 : find-last-integer ( n quot: ( i -- ? ) -- i )
201 [ 1 - ] dip find-last-integer
203 ] if ; inline recursive