USING: accessors math math.intervals sequences classes.algebra kernel tools.test compiler.tree.propagation.info arrays ; IN: compiler.tree.propagation.info.tests { f } [ 0.0 -0.0 eql? ] unit-test { t t } [ 0 10 [a,b] 5 20 [a,b] value-info-intersect [ class>> real class= ] [ interval>> 5 10 [a,b] = ] bi ] unit-test { float 10.0 t } [ 10.0 10.0 value-info-intersect [ class>> ] [ >literal< ] bi ] unit-test { null } [ 10 10.0 value-info-intersect class>> ] unit-test { fixnum 10 t } [ 10 10 value-info-union [ class>> ] [ >literal< ] bi ] unit-test { 3.0 t } [ 3 3 [a,b] float value-info-intersect >literal< ] unit-test { 3 t } [ 2 3 (a,b] fixnum value-info-intersect >literal< ] unit-test { T{ value-info-state f null empty-interval f f } } [ fixnum -10 0 [a,b] fixnum 19 29 [a,b] value-info-intersect ] unit-test { 3 t } [ 3 null-info value-info-union >literal< ] unit-test { } [ { } value-infos-union drop ] unit-test TUPLE: test-tuple { x read-only } ; { t } [ f f 3 3array test-tuple dup object-info value-info-intersect = ] unit-test { t } [ null-info 3 value-info<= ] unit-test { t t } [ f fixnum 0 40 [a,b] value-info-union \ f class-not value-info-intersect [ class>> fixnum class= ] [ interval>> 0 40 [a,b] = ] bi ] unit-test