typed-racket/collects/typed-scheme/optimizer
Vincent St-Amour eb60ac080a let bindings of inexact-complex numbers can be replaced by bindings
for each of their components.

This allows unboxing of intermediate results that are bound and only
ever used in positions where they would be unboxed.

original commit: 83987fffac7719ab0c35d3df49ea0a7adf4bc9b6
2010-07-23 18:52:42 -04:00
..
apply.rkt Optimize (apply + (map f l)) to avoid the intermediate list. 2010-07-23 14:11:40 -04:00
box.rkt Added box optimizations. 2010-07-21 21:09:42 -04:00
dead-code.rkt Added dead code elimination. 2010-07-16 12:22:11 -04:00
fixnum.rkt Optimizations on one-argument cases of arithmetic operations. 2010-07-21 21:09:43 -04:00
float.rkt Optimizations on one-argument cases of arithmetic operations. 2010-07-21 21:09:43 -04:00
inexact-complex.rkt let bindings of inexact-complex numbers can be replaced by bindings 2010-07-23 18:52:42 -04:00
number.rkt Optimizations on one-argument cases of arithmetic operations. 2010-07-21 21:09:43 -04:00
optimizer.rkt let bindings of inexact-complex numbers can be replaced by bindings 2010-07-23 18:52:42 -04:00
pair.rkt Added mutable pair optimizations. 2010-07-16 12:22:16 -04:00
sequence.rkt Added optimization for string-length and bytes-length. 2010-07-21 21:09:42 -04:00
string.rkt Added optimization for string-length and bytes-length. 2010-07-21 21:09:42 -04:00
struct.rkt Pushed optimizations to auxiliary syntax classes. 2010-07-08 18:29:15 -04:00
unboxed-let.rkt let bindings of inexact-complex numbers can be replaced by bindings 2010-07-23 18:52:42 -04:00
utils.rkt Optimize (apply + (map f l)) to avoid the intermediate list. 2010-07-23 14:11:40 -04:00
vector.rkt Pushed optimizations to auxiliary syntax classes. 2010-07-08 18:29:15 -04:00