|  Björn Lindqvist | a36c0cb5ac | compiler.*: moving all words only relevant for testing to compiler.test | 2016-08-12 15:13:51 +02:00 | 
				
					
						|  Björn Lindqvist | e67745aaba | stack-checker.*: removes the in-d and out-d slots from the alien-node-params tuple That data is already on the #alien-node tuple so it doesn't need to be
stored twice. | 2016-08-04 20:30:58 +02:00 | 
				
					
						|  Björn Lindqvist | 0cbd0552b0 | bootstrap.image.primitives: resize-byte-array can also use integer-array-capacity | 2016-05-24 14:20:46 +02:00 | 
				
					
						|  Björn Lindqvist | 3e14ceafe2 | compiler.*: more compiler tests | 2016-04-22 12:44:25 +02:00 | 
				
					
						|  John Benediktsson | 71ef8a22c2 | disambiguate namespaces:set and sets:set. | 2016-03-29 17:14:42 -07:00 | 
				
					
						|  John Benediktsson | e7a42b1dc4 | sets: rename unordered-set back to set. | 2016-03-29 15:46:29 -07:00 | 
				
					
						|  Björn Lindqvist | bce3a88287 | stack-checker.known-words: fix input class declaration for <string> it should be { integer-array-capacity integer } ofcourse | 2016-03-19 18:59:19 +01:00 | 
				
					
						|  Björn Lindqvist | 6f9ff8813e | compiler.*, stack-checker.known-words: adds the integer-array-capacity This commit adds the integer-array-capacity declaration on a few
words. It should make loopy code compile faster and fix #1339 | 2016-03-18 20:46:41 +01:00 | 
				
					
						|  Björn Lindqvist | be4484d708 | compiler.tree.*: fixes the propagation and dead-code removal logic so it becomes aware of integer-array-capacity | 2016-03-18 20:39:28 +01:00 | 
				
					
						|  Björn Lindqvist | a3ce61f8da | compiler.tree.cleanup: more docs and a test | 2016-03-18 19:21:31 +01:00 | 
				
					
						|  Björn Lindqvist | 6576660069 | compiler.tree.dead-code.simple: tests and more docs | 2016-03-18 19:21:31 +01:00 | 
				
					
						|  Björn Lindqvist | 5663d39a76 | compiler.*: more docs | 2016-02-28 01:01:38 +01:00 | 
				
					
						|  Björn Lindqvist | e1b22e0af4 | compiler.tree.dead-code.simple: small refactoring and docs | 2015-11-22 00:37:33 +01:00 | 
				
					
						|  Björn Lindqvist | 097b40ce41 | compiler.tree.propagation.recursive: better counter-class | 2015-11-22 00:37:33 +01:00 | 
				
					
						|  Björn Lindqvist | a3be724f5a | compiler.tree.propagation.info: better code for wrap-interval | 2015-11-16 12:30:24 +01:00 | 
				
					
						|  Björn Lindqvist | 4890239c3c | compiler.tree.propagation.tests: #1370 specific test | 2015-09-22 09:03:16 +02:00 | 
				
					
						|  Björn Lindqvist | 804348287c | Docs: fix a bunch of help-lint warnings | 2015-09-22 08:52:59 +02:00 | 
				
					
						|  Björn Lindqvist | c5b92cedcb | compiler.*: even more compiler docs | 2015-09-22 08:52:59 +02:00 | 
				
					
						|  Björn Lindqvist | 4db173cadb | compiler.*: random doc and tests updates | 2015-09-22 08:52:59 +02:00 | 
				
					
						|  Björn Lindqvist | 3e485652fe | compiler.tree.propagation.slots: looks like you can do without the constructor-output-class word | 2015-09-22 08:52:59 +02:00 | 
				
					
						|  Björn Lindqvist | 09ad5bd617 | compiler.tree.propagation.slots: docs & tests for the vocab | 2015-09-22 08:52:59 +02:00 | 
				
					
						|  Björn Lindqvist | 4ee88bdc3d | compiler.tree.propagation.info: better logic for comparing value-infos Now the slots of the value infos only matter if the class of the first
info is at least as large as the class of the second info | 2015-09-22 08:52:37 +02:00 | 
				
					
						|  Björn Lindqvist | bc0cdff2c6 | compiler.tree.propagation.info: fixed value-info<= so that it handles slots correctly
if a slot is defined for a value-info, then it can't be <= a value-info
without that slot defined | 2015-09-22 08:52:37 +02:00 | 
				
					
						|  Björn Lindqvist | ea67379751 | compiler.tree.*: new tests | 2015-09-22 08:52:37 +02:00 | 
				
					
						|  Björn Lindqvist | b9ce4910af | compiler.tree.*: docs | 2015-09-22 08:52:36 +02:00 | 
				
					
						|  Björn Lindqvist | a1153e6de1 | compiler.tree.propagation.info: more docs and tests for the vocab | 2015-09-22 08:51:46 +02:00 | 
				
					
						|  Björn Lindqvist | bb8b77419f | compiler.tree.propagation.nodes: the loop-nesting variable appears unused | 2015-09-22 08:51:05 +02:00 | 
				
					
						|  Björn Lindqvist | 44092bf78d | compiler.tree.propagation.*: better to use 2array than the "cuter" /\ word | 2015-09-22 08:51:05 +02:00 | 
				
					
						|  Björn Lindqvist | 9369f8216f | compiler.tree.propagation.constraints: docs for this vocab | 2015-09-22 08:51:04 +02:00 | 
				
					
						|  John Benediktsson | e477f6996f | Fix comments to be ! not #!. | 2015-09-08 16:15:10 -07:00 | 
				
					
						|  John Benediktsson | ceb75057da | change ERROR: words from throw-foo back to foo. | 2015-08-13 16:13:05 -07:00 | 
				
					
						|  Doug Coleman | 62686907fe | compiler: fix rename | 2015-08-13 12:55:28 -07:00 | 
				
					
						|  Doug Coleman | b6be8685c3 | basis: ERROR: changes. | 2015-08-13 03:20:39 -07:00 | 
				
					
						|  Doug Coleman | 225c28f23a | compiler.tree.propagation: Fix build error | 2015-08-13 02:53:03 -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 | 28dcd0667a | factor: rename set to unordered-set. | 2015-08-12 10:54:19 -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 | 00338f62f3 | factor: put inline on same line as ; for experimentation | 2015-08-10 12:55:27 -05:00 | 
				
					
						|  Björn Lindqvist | 5e29aac0a6 | Docs: various more compiler-related docs | 2015-07-28 17:58:28 -07:00 | 
				
					
						|  Björn Lindqvist | 44c9b2c8e8 | compiler.tree.*: new docs | 2015-07-28 17:58:28 -07:00 | 
				
					
						|  Björn Lindqvist | e095b54644 | compiler.tree.escape-analysis.*: new doc files | 2015-07-28 17:58:28 -07:00 | 
				
					
						|  Björn Lindqvist | 06560b24a6 | compiler.tree.escape-analysis.allocations: stub doc file from comments | 2015-07-28 17:58:27 -07:00 | 
				
					
						|  John Benediktsson | 5eec781b40 | use ``if*`` instead of ``dup [ ] [ drop ] if``. | 2015-07-20 22:24:30 -07:00 | 
				
					
						|  Doug Coleman | 2adeed9cb3 | factor: rename classes:members to class-members so it doesn't conflict with sets:members. ugh. | 2015-07-20 00:32:42 -07:00 | 
				
					
						|  Doug Coleman | 2c257f399c | factor: Rename MACRO: and MACRO: to have quot as the output in stack effects. | 2015-07-18 22:16:11 -07:00 | 
				
					
						|  John Benediktsson | 4c2c8f133f | vm: rename some primitives, and some cleanup. * quot-compiled? => quotation-compiled?
* optimized? => word-optimized? | 2015-07-15 11:13:52 -07: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 | 
				
					
						|  Doug Coleman | 999aa7c897 | factor: clean up spaces in -tests files | 2015-07-02 10:34:01 -07:00 |