Björn Lindqvist 00d4572e6c basis,extra: refactorings to use the ignore-error and ignore-error/f words		2016-11-18 23:41:36 +01:00
..
branches	compiler.tree.propagation.*: better to use 2array than the "cuter" /\ word	2015-09-22 08:51:05 +02:00
call-effect	basis,extra: refactorings to use the ignore-error and ignore-error/f words	2016-11-18 23:41:36 +01:00
constraints	compiler.tree.*: docs	2015-09-22 08:52:36 +02:00
copy	compiler.*: more compiler tests	2016-04-22 12:44:25 +02:00
info	compiler.tree.propagation.info: redoing a3be724f5a (#1513)	2016-10-31 07:29:00 +01:00
inlining	compiler.tree.*: new tests	2015-09-22 08:52:37 +02:00
known-words	compiler.tree.propagation.*: better to use 2array than the "cuter" /\ word	2015-09-22 08:51:05 +02:00
nodes	compiler.tree.*: new tests	2015-09-22 08:52:37 +02:00
recursive	compiler.tree.propagation.recursive: redoing	2016-11-06 19:08:35 +01:00
simd	…
simple	compiler.tree.*: fixes the propagation and dead-code removal logic so it	2016-03-18 20:39:28 +01:00
slots	compiler.tree.propagation.slots: looks like you can do without the	2015-09-22 08:52:59 +02:00
transforms	sets: rename unordered-set back to set.	2016-03-29 15:46:29 -07:00
authors.txt	…
propagation-docs.factor	compiler.*: more compiler docs	2015-06-14 16:44:37 +02:00
propagation-tests.factor	compiler.*: moving all words only relevant for testing to compiler.test	2016-08-12 15:13:51 +02:00
propagation.factor	compiler.*: more compiler docs	2015-06-14 16:44:37 +02:00
summary.txt	…