factor/basis/compiler/tree/propagation
Daniel Ehrenberg b65b88364c Updating lots of things to use call( -- ) 2009-02-08 22:12:11 -06:00
..
branches renaming: contain? -> any?, deep-contains? -> deep-any?, pad-left -> pad-head, pad-right -> pad-tail, trim-left -> trim-head, trim-right -> trim-tail 2009-01-29 22:19:07 -06:00
constraints Propagation pass now uses a stack of hashtables for predicated constraints instead of cloning a hashtable. New strategy for recursive propagation; now converges with fewer iterations. ~15 sec bootstrap time improvement 2008-11-11 08:49:00 -06:00
copy Update usages of all-equal? now that its in the grouping vocab 2009-01-16 15:14:30 -06:00
info Don't use combinators.short-circuit in compiler 2008-11-21 04:00:37 -06:00
inlining Updating lots of things to use call( -- ) 2009-02-08 22:12:11 -06:00
known-words Faster dynamic variable lookup: 6% speedup in benchmark.fib5 2008-12-17 14:57:24 -06:00
nodes New inlining heuristic: number of usages within this word. Speeds up bootstrap by 10% 2008-12-04 07:05:59 -06:00
recursive New inlining heuristic: number of usages within this word. Speeds up bootstrap by 10% 2008-12-04 07:05:59 -06:00
simple Add toutput ype propagation for #alien-invoke and #alien-indirect nodes 2008-11-29 03:47:38 -06:00
slots Finish up O(1) byte array allocation 2008-12-09 18:17:04 -06:00
authors.txt
propagation-tests.factor Remove >r/r> 2008-12-17 19:17:37 -06:00
propagation.factor New inlining heuristic: number of usages within this word. Speeds up bootstrap by 10% 2008-12-04 07:05:59 -06:00
summary.txt