Slava Pestov 3b5f7a9ecf compiler.tree.propagation: ensure that we don't call 'equal?' or 'hashcode' on literals in words being compiled		2010-01-16 20:00:48 +13:00
..
branches	Factor source files should not be executable	2009-11-21 17:50:43 -06:00
call-effect	Removing integers-as-sequences	2010-01-15 07:15:33 +13:00
constraints	compiler.tree.propagation: fix bug in constraints that caused retain stack overflow	2009-11-13 03:22:57 -06:00
copy	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
info	compiler.tree.propagation: ensure that we don't call 'equal?' or 'hashcode' on literals in words being compiled	2010-01-16 20:00:48 +13:00
inlining	Factor source files should not be executable	2009-11-21 17:50:43 -06:00
known-words	Fix input-classes of /i and mod, and add some regression tests with various reductions of the original test-case from the terrain demo	2010-01-14 18:15:51 +13:00
nodes	Cleaning up USING: lists for new strict semantics	2009-05-14 16:54:16 -05:00
recursive	deprimitivize tuck and put it to pasture	2009-11-05 22:47:05 -06:00
simd	simd intrinsic implementation for v*high, v*hs+, vavg, and vsad	2009-12-05 14:52:18 -08:00
simple	Removing integers-as-sequences	2010-01-15 07:15:33 +13:00
slots	memq? -> member-eq?, sorted-memq? -> sorted-member-eq?	2009-10-28 15:02:00 -05:00
transforms	Removing integers-as-sequences	2010-01-15 07:15:33 +13:00
authors.txt	…
propagation-tests.factor	compiler.tree.propagation: ensure that we don't call 'equal?' or 'hashcode' on literals in words being compiled	2010-01-16 20:00:48 +13:00
propagation.factor	compiler.tree.propagation: remove method inlining heuristic	2009-08-17 22:29:05 -05:00
summary.txt	…