steve
/
factor
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

compiler.tree.propagation: fix unary-op type functions with complex number inputs

db4
Slava Pestov 2009-09-15 14:30:20 -07:00
parent 9382c67437
commit 172219e931
2 changed files with 8 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
basis/compiler/tree/propagation/known-words/known-words.factor
View File

@ -81,7 +81,10 @@ IN: compiler.tree.propagation.known-words
class>> dup null-class? [ drop null ] [ math-closure ] if ;
: unary-op-interval ( info quot -- newinterval )
[ interval>> ] dip call ; inline
[
dup class>> real classes-intersect?
[ interval>> ] [ drop full-interval ] if
] dip call ; inline
: unary-op ( word interval-quot post-proc-quot -- )
'[

4
basis/compiler/tree/propagation/propagation-tests.factor
View File

@ -186,6 +186,10 @@ IN: compiler.tree.propagation.tests
[ t ] [ [ { complex } declare absq ] final-info first interval>> [0,inf] = ] unit-test
[ t ] [ [ { float float } declare rect> C{ 0.0 0.0 } + absq ] final-info first interval>> [0,inf] = ] unit-test
[ V{ float } ] [ [ { float float } declare rect> C{ 0.0 0.0 } + absq ] final-classes ] unit-test
[ t ] [ [ [ - absq ] [ + ] 2map-reduce ] final-info first interval>> [0,inf] = ] unit-test
[ t ] [ [ { double-array double-array } declare [ - absq ] [ + ] 2map-reduce ] final-info first interval>> [0,inf] = ] unit-test