2b719f5eec
compiler.tree.propagation: revert cleanup, this was more correct.
2012-10-05 15:00:49 -07:00
6ccd545c92
compiler.tree.propagation: throw the proper error in >fixnum methods.
2012-10-05 09:54:51 -07:00
de166e6f9b
compiler.tree.propagation: cleanup known-words a bit.
2012-10-05 09:47:27 -07:00
2bdb46f063
compiler.tree.propagation: make sure integer>fixnum-strict infers a fixnum.
2012-10-05 04:17:43 -07:00
4fc3b68f85
compiler.tree.propagation: fix >fraction types.
2012-09-11 07:42:39 -07:00
56a010441a
math.ratios: speed up some operations on ratios.
2012-09-10 19:53:25 -07:00
ddc047d161
compiler.tree.cleanup: fix "-1 shift" tests.
2012-09-10 19:24:23 -07:00
9992096028
math: cleaner "2/" speedup by using custom inlining.
2012-09-10 17:59:03 -07:00
ba51919e50
assocs: Add sift-keys and sift-values. Remove three other implementations
...
of sift-values and use the new one.
2012-08-23 22:36:10 -07:00
19d31a6fb0
layouts: defining "fixnum-bits".
2012-08-21 18:05:59 -07:00
d15a2357d1
core: Throw an error when assigning a bignum to a fixnum tuple slot if the bignum doesn't fit. Fixes #594 .
2012-08-03 14:59:59 -07:00
a6c3ddf691
sequences: Fix tests that broke when nth could only be integers. Undo integer>fixnum in iota nth. See bug #582 .
2012-07-25 22:17:24 -07:00
80b7014ae1
modular-arithmetic: Fix unit test. Should expect integer>fixnum, not >fixnum.
2012-07-23 11:51:44 -07:00
c25d044788
compiler: Fix bitand on ratios, floats. Fix shift on ratios, floats. Add integer>fixnum. Fixes #500 .
2012-07-23 09:31:12 -07:00
e654e4afd9
Using "same?" in more places.
2012-07-21 10:22:44 -07:00
bc35335a0c
compiler: Fix /mod simplications in dead-code, add unit tests. Fixes #544
2012-07-21 03:41:42 -07:00
2e43fab284
stack-checker: meta-d was a word and symbol, now meta-d word and (meta-d) symbol
...
issuse #358
2012-07-20 12:30:14 -07:00
06afe04f73
compiler.tree.debugger: Remove make-assoc
2012-07-19 17:48:02 -07:00
9a220ef78c
namespaces: Rename ``bind`` to ``with-variables``. Update a few places that called ``global [ ] with-variables`` to use ``with-global``.
2012-07-19 00:02:47 -07:00
117d57ad92
issue #358 : Rename all of the words depends-on-* to add-depends-on*
2012-06-21 08:35:45 -07:00
1a72249983
math: using if-zero in more places.
2012-06-18 14:32:39 -07:00
cb42258144
classes:
...
- Allow methods to dispatch off union{ } and intersection{ } classes.
- Add not{ } anonymous-complement syntax.
- Define class-name for anonymous-union/intersection/complement and maybes, and clean up pprint.
- Change maybe: foo to maybe{ foo }
- Call sort-classes when making anonymous-union/anonymous-intersection classes so that they are canonicalized.
2012-05-03 19:45:30 -07:00
664239e1ba
generalizations: Refactor stack-checker so that smart combinators can be used with curry and compose.
2011-11-27 20:25:22 -08:00
eee483654a
use radix literals
2011-11-23 19:03:40 -08:00
61c1277864
compiler tests: fix using, add tests to make sure instance? inlines
2011-11-23 01:01:11 -08:00
388e80f770
compiler.tree.propagation.transforms: fix infinite recursion that was breaking prettyprint
2011-11-23 00:48:05 -08:00
3e2fc2f0cb
classes: optimize instance? for classoids
2011-11-22 20:38:07 -08:00
30ade9023c
classes: add syntax for intersection{ and union{ anonymous classes. make classoid a mixin.
2011-11-22 18:49:42 -08:00
d3a4e72f95
classes.maybe: move maybe definition from classes.union to classes.maybe
2011-11-22 02:46:36 -08:00
14dbf929ee
classes.union: Define a maybe: word that makes a tuple that acts as an anonymous union for a type and f. Updated all the places we define UNION: ?foo foo POSTPONE: f ;. Fixes #416 and lots of headaches.
2011-11-22 01:56:13 -08:00
e66fdcaa83
compiler.tree.propagation: missed using
2011-11-13 16:10:25 -08:00
5c0e3946c5
compiler: tighten (simd-select) output class
...
Ints and smaller (or shorts and smaller on 32-bit) can be assumed to be fixnums. Fixes #393
2011-11-13 16:10:23 -08:00
2c4c04f973
compiler: add intrinsic for PMOVMSKB/MOVMSKP[SD]
...
Combined with a fast bit-count this will let us rice byte-counting.
2011-11-13 16:10:20 -08:00
8012fbdf61
Now that #foo and ##foo are symbols we can remove a bunch of \
2011-11-12 22:04:26 -08:00
1a2be52f25
compiler.tree: Renamed high-level IR node constructors to <#foo> from #foo. Moving towards making classes/word names not conflict.
2011-11-06 23:02:45 -08:00
1539682597
compiler.tree.dead-code: Rewrite /mod to /i or mod in the dead-code pass in the high level optimizer. Fixes #279 .
2011-11-06 19:23:26 -08:00
75cba3106a
remove BSD,solaris,etc. misc platform support code
2011-11-02 17:13:51 -07:00
0f5a65ea51
compiler.tree.propagation: more accurate output type for 'tag' primitive
2011-10-29 17:11:04 -07:00
bf533d7d8d
compiler.tree.debugger: disable length limit when printing optimized. quotation
2011-10-29 17:11:03 -07:00
f05e33fa37
Fix all failures in the linux64 build email
2011-10-24 19:33:09 -07:00
96da8df16e
Rename class to class-of
2011-10-24 06:47:42 -05:00
f2741b34a4
Eliminate duplicate syntax for stack effects "(" no longer drops and is identical to the old "((", which is now removed.
2011-10-18 13:19:39 -07:00
a3d9990255
compiler.tree.dead-code: fix test
...
It was using "read" in an optimization test, but since "read" is now inline, it wasn't getting the expected optimized quotation back.
2011-10-17 21:23:10 -07:00
7494418bf8
More lint cleanups.
2011-10-16 19:33:16 -07:00
f419934d6a
Cleanup lint warnings.
2011-10-14 11:47:24 -07:00
1898d0e26e
compiler.tree.identities: the identity on mod was useless too, because we already have a rewrite rule which handles this case in compiler.tree.propagation
2011-10-10 12:34:21 -07:00
91bfed5d1e
compiler.tree.propagation.transforms: fix rem and mod custom inlining
2011-10-10 12:12:53 -07:00
2a6ff945b3
Fix custom-inlining for mod and rem, which was converting these calls to bitand in some cases, even if the input was not known to be an integer. Fixes #243
2011-10-09 13:51:35 -07:00
0d6a0cd3ea
Remove identities on / and rem, which were no-ops because integer-derived-ops would return an empty array
2011-10-09 13:51:03 -07:00
7d8817583a
compiler.tree.modular-arithmetic needs shallow-spread>quot
2011-10-02 22:21:11 -07:00
John Benediktsson
Doug Coleman
Joe Groff
Slava Pestov