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 ) 0 swap - ; 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 GENERIC: fp-nan? ( x -- ? )
90 double>bits -51 shift HEX: fff [ bitand ] keep = ;
92 GENERIC: fp-infinity? ( x -- ? )
94 M: object fp-infinity?
97 M: float fp-infinity? ( float -- ? )
99 dup -52 shift HEX: 7ff [ bitand ] keep = [
100 HEX: fffffffffffff bitand 0 =
105 : next-power-of-2 ( m -- n )
106 dup 2 <= [ drop 2 ] [ 1 - log2 1 + 2^ ] if ; inline
108 : power-of-2? ( n -- ? )
109 dup 0 <= [ drop f ] [ dup 1 - bitand zero? ] if ; foldable
112 1 - [ + ] keep bitnot bitand ; inline
116 : iterate-prep ( n quot -- i n quot ) [ 0 ] 2dip ; inline
118 : if-iterate? ( i n true false -- ) [ 2over < ] 2dip if ; inline
120 : iterate-step ( i n quot -- i n quot )
121 #! Apply quot to i, keep i and quot, hide n.
122 [ nip call ] 3keep ; inline
124 : iterate-next ( i n quot -- i' n quot ) [ 1 + ] 2dip ; inline
128 : (each-integer) ( i n quot: ( i -- ) -- )
129 [ iterate-step iterate-next (each-integer) ]
130 [ 3drop ] if-iterate? ; inline recursive
132 : (find-integer) ( i n quot: ( i -- ? ) -- i )
135 [ 2drop ] [ iterate-next (find-integer) ] if
136 ] [ 3drop f ] if-iterate? ; inline recursive
138 : (all-integers?) ( i n quot: ( i -- ? ) -- ? )
141 [ iterate-next (all-integers?) ] [ 3drop f ] if
142 ] [ 3drop t ] if-iterate? ; inline recursive
144 : each-integer ( n quot -- )
145 iterate-prep (each-integer) ; inline
147 : times ( n quot -- )
148 [ drop ] prepose each-integer ; inline
150 : find-integer ( n quot -- i )
151 iterate-prep (find-integer) ; inline
153 : all-integers? ( n quot -- ? )
154 iterate-prep (all-integers?) ; inline
156 : find-last-integer ( n quot: ( i -- ? ) -- i )
163 [ 1 - ] dip find-last-integer
165 ] if ; inline recursive