52f2ac2bb9
Tests for propagation additions; making fixnum-bit? inline
2010-01-25 20:15:17 -06:00
d3590ea210
Merge branch 'master' of git://factorcode.org/git/factor
...
Conflicts:
basis/compiler/tree/propagation/transforms/transforms.factor
2010-01-20 00:15:55 -06:00
aa1651032d
Adding compiler transforms in propagation
2010-01-20 00:10:49 -06:00
47a5e96547
Rework min and max so that behavior with floats and NaNs is consistent between generic arithmetic and open-coded float intrinsics
2010-01-13 22:20:16 +13:00
d4a207662e
might want to accurately divide large negative fixnums too
2009-10-31 12:10:29 -05:00
a7011fe087
use bignum/f to get accurate division of fixnums >= 2^53 on 64-bit platforms
2009-10-31 12:06:56 -05:00
32b95c2cdf
math: add unordered comparison operators u< u<= u> u>= which behave exactly like < <= > >= except no floating point exceptions are set if one or both inputs are NaNs; also add efficient intrinsic for unordered? predicate, and fix propagation type functions for abs, absq, and bitnot
2009-09-12 22:20:13 -05:00
2bb6293217
compiler: add fixnum-min/max intrinsics; ~10% speedup on benchmark.yuv-to-rgb
2009-08-28 19:02:59 -05:00
030b1b816c
Add inline declarations for various assorted methods
2009-08-17 22:32:21 -05:00
14ef1649d4
add if-zero/when-zero/unless-zero to core/ and update usages
2009-08-11 17:59:40 -05:00
0ad6d1fb7b
add a few usages of iota, remove most 1+ and 1- from core
2009-05-01 19:58:24 -05:00
0ffd43e2e3
1.0/0.0 => 1/0.
2009-04-13 19:48:08 -05:00
25a877e50b
Merge OneEyed's patch
2009-02-28 17:06:55 -06:00
087d931c36
Remove the tail argument from do/until/while
2009-02-18 02:41:14 +01:00
669548e62e
Clean up some usages of tuck, and add Joe's curried cleave/spread/apply combinators to kernel vocabulary
2009-02-02 13:43:54 -06:00
b154b21aaa
Add new until combinator, and a new do word which acts like a modifier: do while, do until for loops which iterate at least once
2008-12-08 23:37:18 -06:00
73b3cd6367
Use eq? instead of number= since we only ever have a fixnum here
2008-12-08 13:59:59 -06:00
e4f8448eb1
Fix some problems with arithmetic type inference, exposed by recent changes to log2 word
...
- declared input type for bignum-shift was stricter than the runtime behavior, leading to bad propagation of type info if shift count was a bignum
- types inferred for type functions which used number-valued/integer-valued/real-valued were not always precise, eg bignum bignum bitxor => integer
- add interval-log2, type function for (log2)
- remove math-class-min, it was useless
2008-12-07 19:44:49 -06:00
8a8f0c925c
Use BSR instruction to implement fixnum-log2 intrinsic
2008-12-06 15:31:17 -06:00
a4d9cdfeb3
Refactor all usages of >r/r> in core to use dip, 2dip, 3dip
...
Non-optimizing compiler now special-cases dip, 2dip, 3dip following a
literal quotation: this allows us to break the dip/slip meta-circle
without explicit calls to >r/r>
2008-11-23 02:44:56 -06:00
c19f2257f4
Fix permission bits
2008-10-02 08:34:49 -05:00
110a5e5162
Change equality semantics
2008-09-02 02:02:05 -05:00
ac2bf0b87d
Adding inline recursive declarations
2008-07-18 19:22:59 -05:00
5901107f66
Bootstrap fix
2008-04-29 01:49:06 -05:00
08af497255
Fix /f for large integers
2008-04-28 21:26:31 -05:00
7ad74eb320
Various fixes
2008-03-08 02:51:26 -06:00
727f91409d
Split off concurrency.mailboxes, add timeout support to promises, locks, mailboxes, semaphores, count-downs
2008-02-21 23:47:06 -06:00
e3416ec170
Faster bit-arrays
2008-01-12 21:37:44 -05:00
e9b42fa635
Move more math stuff to extra/, get compiler to work without ratios/complex numbers
2007-10-14 20:38:23 -04:00
a96457cecc
Initial import
2007-09-20 18:09:08 -04:00
Daniel Ehrenberg
Slava Pestov
Joe Groff
Doug Coleman
Doug Coleman
Slava Pestov
Samuel Tardieu
Slava Pestov
U-SLAVA-FB3999113\Slava