1 ! Copyright (C) 2003, 2009 Slava Pestov, Joe Groff.
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: unordered? ( x y -- ? ) foldable
27 MATH: u< ( x y -- ? ) foldable
28 MATH: u<= ( x y -- ? ) foldable
29 MATH: u> ( x y -- ? ) foldable
30 MATH: u>= ( x y -- ? ) foldable
32 M: object unordered? 2drop f ;
34 MATH: + ( x y -- z ) foldable
35 MATH: - ( x y -- z ) foldable
36 MATH: * ( x y -- z ) foldable
37 MATH: / ( x y -- z ) foldable
38 MATH: /f ( x y -- z ) foldable
39 MATH: /i ( x y -- z ) foldable
40 MATH: mod ( x y -- z ) foldable
42 MATH: /mod ( x y -- z w ) foldable
44 MATH: bitand ( x y -- z ) foldable
45 MATH: bitor ( x y -- z ) foldable
46 MATH: bitxor ( x y -- z ) foldable
47 GENERIC# shift 1 ( x n -- y ) foldable
48 GENERIC: bitnot ( x -- y ) foldable
49 GENERIC# bit? 1 ( x n -- ? ) foldable
51 GENERIC: abs ( x -- y ) foldable
55 GENERIC: (log2) ( x -- n ) foldable
59 ERROR: log2-expects-positive x ;
68 : zero? ( x -- ? ) 0 number= ; inline
69 : 2/ ( x -- y ) -1 shift ; inline
70 : sq ( x -- y ) dup * ; inline
71 : neg ( x -- -x ) -1 * ; inline
72 : recip ( x -- y ) 1 swap / ; inline
73 : sgn ( x -- n ) dup 0 < [ drop -1 ] [ 0 > 1 0 ? ] if ; inline
74 : ?1+ ( x -- y ) [ 1 + ] [ 0 ] if* ; inline
75 : rem ( x y -- z ) abs [ mod ] [ + ] [ mod ] tri ; foldable
76 : 2^ ( n -- 2^n ) 1 swap shift ; inline
77 : even? ( n -- ? ) 1 bitand zero? ;
78 : odd? ( n -- ? ) 1 bitand 1 number= ;
80 : if-zero ( ..a n quot1: ( ..a -- ..b ) quot2: ( ..a n -- ..b ) -- ..b )
81 [ dup zero? ] [ [ drop ] prepose ] [ ] tri* if ; inline
83 : when-zero ( n quot -- ) [ ] if-zero ; inline
85 : unless-zero ( n quot -- ) [ ] swap if-zero ; inline
87 UNION: integer fixnum bignum ;
89 TUPLE: ratio { numerator integer read-only } { denominator integer read-only } ;
91 UNION: rational integer ratio ;
93 UNION: real rational float ;
95 TUPLE: complex { real real read-only } { imaginary real read-only } ;
97 UNION: number real complex ;
99 : fp-bitwise= ( x y -- ? ) [ double>bits ] bi@ = ; inline
101 GENERIC: fp-special? ( x -- ? )
102 GENERIC: fp-nan? ( x -- ? )
103 GENERIC: fp-qnan? ( x -- ? )
104 GENERIC: fp-snan? ( x -- ? )
105 GENERIC: fp-infinity? ( x -- ? )
106 GENERIC: fp-nan-payload ( x -- bits )
107 GENERIC: fp-sign ( x -- ? )
109 M: object fp-special? drop f ; inline
110 M: object fp-nan? drop f ; inline
111 M: object fp-qnan? drop f ; inline
112 M: object fp-snan? drop f ; inline
113 M: object fp-infinity? drop f ; inline
115 : <fp-nan> ( payload -- nan )
116 HEX: 7ff0000000000000 bitor bits>double ; inline
118 GENERIC: next-float ( m -- n )
119 GENERIC: prev-float ( m -- n )
121 : next-power-of-2 ( m -- n )
122 dup 2 <= [ drop 2 ] [ 1 - log2 1 + 2^ ] if ; inline
124 : power-of-2? ( n -- ? )
125 dup 0 <= [ drop f ] [ dup 1 - bitand zero? ] if ; foldable
128 1 - [ + ] keep bitnot bitand ; inline
132 : iterate-prep ( n quot -- i n quot ) [ 0 ] 2dip ; inline
134 : if-iterate? ( i n true false -- ) [ 2over < ] 2dip if ; inline
136 : iterate-step ( i n quot -- i n quot )
137 #! Apply quot to i, keep i and quot, hide n.
138 [ nip call ] 3keep ; inline
140 : iterate-next ( i n quot -- i' n quot ) [ 1 + ] 2dip ; inline
144 : (each-integer) ( ... i n quot: ( ... i -- ... ) -- ... )
145 [ iterate-step iterate-next (each-integer) ]
146 [ 3drop ] if-iterate? ; inline recursive
148 : (find-integer) ( ... i n quot: ( ... i -- ... ? ) -- ... i )
152 [ iterate-next (find-integer) ] 2curry bi-curry if
153 ] [ 3drop f ] if-iterate? ; inline recursive
155 : (all-integers?) ( ... i n quot: ( ... i -- ... ? ) -- ... ? )
158 [ iterate-next (all-integers?) ] 3curry
160 ] [ 3drop t ] if-iterate? ; inline recursive
162 : each-integer ( ... n quot: ( ... i -- ... ) -- ... )
163 iterate-prep (each-integer) ; inline
165 : times ( ... n quot: ( ... -- ... ) -- ... )
166 [ drop ] prepose each-integer ; inline
168 : find-integer ( ... n quot: ( ... i -- ... ? ) -- ... i )
169 iterate-prep (find-integer) ; inline
171 : all-integers? ( ... n quot: ( ... i -- ... ? ) -- ... ? )
172 iterate-prep (all-integers?) ; inline
174 : find-last-integer ( ... n quot: ( ... i -- ... ? ) -- ... i )
181 [ 1 - ] dip find-last-integer
183 ] if ; inline recursive