013160df9a
change some "2drop 2drop" to "4drop".
2012-10-23 12:21:30 -07:00
0359a4e823
math.intervals: using short-circuit logic.
2012-07-17 20:08:12 -07:00
181f11faa8
Make M\ throw an error upon lookup failure. Change method -> ?lookup-method, lookup-method is the throwing version of ?lookup-method. Fixes #229 .
2011-10-03 15:49:49 -07:00
0612bc6177
Factor source files should not be executable
2009-11-21 17:50:43 -06:00
bd13e018dd
memq? -> member-eq?, sorted-memq? -> sorted-member-eq?
2009-10-28 15:02:00 -05:00
2bb6293217
compiler: add fixnum-min/max intrinsics; ~10% speedup on benchmark.yuv-to-rgb
2009-08-28 19:02:59 -05:00
2bc38bf019
math.intervals: tighter interval arithmetic for intervals with infinities
2009-08-19 02:32:18 -05:00
4ecf5a904a
More accurate wrap-interval in compiler.tree.propagation.info fixes test regression; constructing an interval with endpoints at infinity now outputs full-interval
2009-08-12 03:25:53 -05:00
7bfbb0c5ac
math.intervals: fix interval-rem
2009-08-11 16:49:28 -05:00
7e35723db0
compiler.tree.propagation: be more careful with intervals, ensuring that the inferred interval of a value is a subset of the value class's interval. This improves accuracy, for example [ >fixnum 1 + >fixnum most-positive-fixnum <= ] constant-folds to true
2009-08-10 01:16:49 -05:00
1cb0f3370b
math.vectors.specialization: first attempt at some call site splitting for vector ops. Specialized array types generate customized variants of all vector words, if input types are known at compile time, a call to the specialized version is inserted
2009-08-09 03:07:33 -05:00
e400d80d8b
More accurate interval inference for mod, rem, and propagation can now infer intervals in the case where a value might be f. so, [ [ 127 bitand ] [ drop f ] if dup [ 0 >= ] [ not ] if ] now constant-folds down to 't'!
2009-08-08 23:03:45 -05:00
61ea749bb6
More accurate interval-mod and interval-rem
2009-08-08 22:01:12 -05:00
d7b40d72a0
Code cleanups
2009-05-07 12:33:31 -05:00
d168f76ab0
remove 1-, 1+, use iota somewhere
2009-05-05 23:32:23 -05:00
a4e62dfdba
Fix for math.parser syntax change
2009-04-13 14:47:39 -05:00
a5116d0b5d
Remove two swapd usages
2009-02-02 14:26:54 -06:00
3c408342ef
renaming: contain? -> any?, deep-contains? -> deep-any?, pad-left -> pad-head, pad-right -> pad-tail, trim-left -> trim-head, trim-right -> trim-tail
2009-01-29 22:19:07 -06:00
63fda570bf
Fixing assorted compile errors and help lint warnings
2008-12-16 01:12:36 -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
5d8b3c3fb1
Cleanup math.intervals and eliminate >r r> usage
2008-11-17 17:20:56 -05:00
43335d9c36
Intervals now use a special singleton for the full interval to eliminate FP math in the common case; fix a bug in value-info<=
2008-11-11 08:30:14 -06:00
751426f283
Remove dead code from math.intervals; we no longer need the operations to support f anymore
2008-11-06 11:57:31 -06:00
6d8bfa4bf4
remove some dead usings
2008-10-05 15:38:31 -05:00
4e88005bf4
remove random intervals for now
2008-10-05 15:14:18 -05:00
5ca60480c5
put a random method on intervals, works for float and integer intervals
2008-10-04 12:40:58 -05:00
c19f2257f4
Fix permission bits
2008-10-02 08:34:49 -05:00
efb5553950
More efficient interval-contains?
2008-08-26 19:47:55 -05:00
6f4af849e5
Fix problem in interval* and interval/ with zero
2008-08-26 00:19:40 -05:00
d66f887736
Create basis vocab root
2008-07-28 22:03:13 -05:00
John Benediktsson
Doug Coleman
Slava Pestov
Doug Coleman
sheeple
Slava Pestov
Aaron Schaefer