|  Doug Coleman | e189954ecc | core: Rename iota to <iota> so we can have TUPLE: iota ... ; instead of TUPLE: iota-tuple ... ; | 2017-06-02 11:57:05 -05:00 | 
				
					
						|  John Benediktsson | 71ef8a22c2 | disambiguate namespaces:set and sets:set. | 2016-03-29 17:14:42 -07:00 | 
				
					
						|  Doug Coleman | e0d1b14e5c | factor: don't need FROM: namespaces => set or namespaces:set anymore | 2015-08-12 11:25:57 -05:00 | 
				
					
						|  Doug Coleman | 330c7ba156 | factor: Removing SLOT: nth/at/global in favor of using change: at for tuple slots named ``at`` and change-at for hashtables. Redo many FROM: and QUALIFIED: and using lists. | 2015-08-12 08:49:02 -05:00 | 
				
					
						|  Doug Coleman | 892c62e1dc | factor: second stab at [ ] [ ] unit-test -> { } [ ] unit-test | 2015-07-03 09:39:59 -07:00 | 
				
					
						|  Doug Coleman | 59f3b1ea57 | Revert "factor: rename [ ] [ ] unit-test -> { } [ ] unit-test using a refactoring tool!" Needs a bit more work.
This reverts commit 7e54cc2824. | 2015-07-02 13:47:06 -07:00 | 
				
					
						|  Doug Coleman | 7e54cc2824 | factor: rename [ ] [ ] unit-test -> { } [ ] unit-test using a refactoring tool! | 2015-07-02 11:36:08 -07:00 | 
				
					
						|  John Benediktsson | c65877104e | compiler: cleanup usings. | 2014-12-13 16:10:21 -08:00 | 
				
					
						|  John Benediktsson | e0801a632e | compiler.tree.modular-arithmetic: make a partial test and add some information to the XXX: comment. | 2014-07-09 09:27:13 -07:00 | 
				
					
						|  John Benediktsson | cc7dfc146b | Revert "compiler.tree.modular-arithmetic: revert strict patch so we can investigate further." This reverts commit ec8377e125. | 2014-07-08 19:18:34 -07:00 | 
				
					
						|  John Benediktsson | ec8377e125 | compiler.tree.modular-arithmetic: revert strict patch so we can investigate further. | 2014-07-08 16:59:58 -07:00 | 
				
					
						|  Doug Coleman | a6ce3e9113 | compiler.tree.modular-arithmetic: Don't require that fixnum+ works on tuple slots marked fixnum. This is probably a speed regression. XXX revisit | 2014-07-03 12:12:46 -07:00 | 
				
					
						|  John Benediktsson | 14f425c57c | compiler.tree.modular-arithmetic: strict versions shouldn't be here. | 2014-06-08 16:16:24 -07:00 | 
				
					
						|  John Benediktsson | b573c40402 | compiler.tree: teaching it bignum>fixnum-strict. | 2014-06-08 13:40:38 -07:00 | 
				
					
						|  Doug Coleman | eb20c5e22e | compiler.tree.modular-arithmetic: Fix test for iota change. | 2013-03-23 17:12:16 -07:00 | 
				
					
						|  John Benediktsson | 2025ffe292 | compiler.tree.modular-arithmetic: more use of hash-sets. | 2013-03-08 15:58:16 -08:00 | 
				
					
						|  Doug Coleman | cd9dd9d752 | 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 | 
				
					
						|  Doug Coleman | c936f9d5e5 | modular-arithmetic: Fix unit test. Should expect integer>fixnum, not >fixnum. | 2012-07-23 11:51:44 -07:00 | 
				
					
						|  Doug Coleman | fb4e3ad9bc | compiler: Fix bitand on ratios, floats. Fix shift on ratios, floats. Add integer>fixnum. Fixes #500. | 2012-07-23 09:31:12 -07:00 | 
				
					
						|  John Benediktsson | 378786599d | Cleanup lint warnings. | 2011-10-14 11:47:24 -07:00 | 
				
					
						|  Slava Pestov | 7bc38641f9 | 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 | 
				
					
						|  Doug Coleman | 44ef1d3698 | compiler.tree.modular-arithmetic needs shallow-spread>quot | 2011-10-02 22:21:11 -07:00 | 
				
					
						|  Joe Groff | 2bd6de9a02 | slots: pre-create the "at", "nth", and "global" slots to make deterministic the currently nondeterministic ambiguity between accessors:change-* and assocs:change-at, sequences:change-nth, and namespaces:change-global | 2011-09-19 10:03:43 -07:00 | 
				
					
						|  Daniel Ehrenberg | 970f96c8b8 | Fixing typo in modular arithmetic unit test (should use iota, not integer sequences, and just happened to work still) | 2010-06-15 16:15:49 -04:00 | 
				
					
						|  Daniel Ehrenberg | 7074979745 | Moving new-sets to sets | 2010-02-26 16:01:01 -05:00 | 
				
					
						|  Slava Pestov | df4fb4a3ee | Removing integers-as-sequences | 2010-01-15 07:15:33 +13:00 | 
				
					
						|  Doug Coleman | bd13e018dd | memq? -> member-eq?, sorted-memq? -> sorted-member-eq? | 2009-10-28 15:02:00 -05:00 | 
				
					
						|  Slava Pestov | 49bd2228ec | compiler.tree.modular-arithmetic: fix regression; set-alien-*-1 was not always open-coded | 2009-08-20 17:56:49 -05:00 | 
				
					
						|  Slava Pestov | 9ef8f6c81d | compiler.tree.modular-arithmetic: eliminate >bignum calls where possible, convert fixnum-shift to fixnum-shift-fast if shift count is positive, don't run if there are no modular values | 2009-08-20 03:47:45 -05:00 | 
				
					
						|  Slava Pestov | bf57d78b09 | compiler.tree.modular-arithmetic: >fixnum elimination and value info annotations were too aggressive | 2009-08-17 01:20:25 -05:00 | 
				
					
						|  Slava Pestov | 5297be3e19 | compiler.tree.modular-arithmetic: stronger optimization handles > 1 usages case as well as values defined and used in loops. Eliminates 5 out of 8 >fixnum calls in benchmark.yuv-to-rgb | 2009-08-15 18:42:41 -05:00 | 
				
					
						|  Doug Coleman | 3f3d57032b | Delete empty unit tests files, remove 1- and 1+, reorder IN: lines in a lot of places, minor refactoring | 2009-08-13 19:21:44 -05:00 | 
				
					
						|  Slava Pestov | 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 | 
				
					
						|  Slava Pestov | e76dce8aff | Overflowing fixnum intrinsics now expand into several CFG nodes. This speeds up the common case since only the uncommon case is now a stack syncpoint | 2009-07-16 18:29:40 -05:00 | 
				
					
						|  Daniel Ehrenberg | 4b29d13fda | Adding authors to compiler.tree.modular-arithmetic | 2009-07-09 23:09:49 -05:00 | 
				
					
						|  Daniel Ehrenberg | cf3038b7d6 | Improving modular arithmetic optimization to be aware of words like set-alien-unsigned-2 | 2009-07-09 23:07:38 -05:00 | 
				
					
						|  Slava Pestov | 75d9946bd7 | compiler.tree.modular-arithmetic: convert >integer >fixnum into >fixnum | 2009-05-07 12:54:23 -05:00 | 
				
					
						|  Slava Pestov | 6b25e99470 | Add summary for heaps more vocabs | 2009-02-16 21:05:13 -06:00 | 
				
					
						|  Slava Pestov | 5fdb474c76 | Fixing various test failures and updating some more vocabs for >r/r> removal | 2008-12-17 22:29:32 -06:00 | 
				
					
						|  Slava Pestov | 34792a9f23 | Remove >r/r> | 2008-12-17 19:17:37 -06:00 | 
				
					
						|  Slava Pestov | 1aefde994f | Cleanup | 2008-11-03 00:03:22 -06:00 | 
				
					
						|  Slava Pestov | 10c68ebb21 | New modular arithmetic optimization pass | 2008-09-12 18:08:38 -05:00 |