1 USING: kernel math tools.test combinators.short-circuit accessors ;
2 IN: combinators.short-circuit.tests
4 { 3 } [ { [ 1 ] [ 2 ] [ 3 ] } 0&& ] unit-test
5 { 5 } [ 3 { [ 0 > ] [ odd? ] [ 2 + ] } 1&& ] unit-test
6 { 30 } [ 10 20 { [ + 0 > ] [ - even? ] [ + ] } 2&& ] unit-test
8 { f } [ { [ 1 ] [ f ] [ 3 ] } 0&& ] unit-test
9 { f } [ 3 { [ 0 > ] [ even? ] [ 2 + ] } 1&& ] unit-test
10 { f } [ 10 20 { [ + 0 > ] [ - odd? ] [ + ] } 2&& ] unit-test
12 { "factor" } [ { [ 10 0 < ] [ f ] [ "factor" ] } 0|| ] unit-test
13 { 11 } [ 10 { [ odd? ] [ 100 > ] [ 1 + ] } 1|| ] unit-test
14 { 30 } [ 10 20 { [ + odd? ] [ + 100 > ] [ + ] } 2|| ] unit-test
15 { f } [ { [ 10 0 < ] [ f ] [ 0 1 = ] } 0|| ] unit-test
17 : compiled-&& ( a -- ? ) { [ 0 > ] [ even? ] [ 2 + ] } 1&& ;
19 { f } [ 3 compiled-&& ] unit-test
20 { 4 } [ 2 compiled-&& ] unit-test
22 : compiled-|| ( a b -- ? ) { [ + odd? ] [ + 100 > ] [ + ] } 2|| ;
24 { 30 } [ 10 20 compiled-|| ] unit-test
25 { 2 } [ 1 1 compiled-|| ] unit-test
27 ! && and || should be row-polymorphic both when compiled and when interpreted
30 f t { [ drop dup ] } 1&& nip ;
32 { f } [ row-&& ] unit-test
33 { f } [ \ row-&& def>> call ] unit-test
36 f t { [ drop dup ] } 1|| nip ;
38 { f } [ row-|| ] unit-test
39 { f } [ \ row-|| def>> call ] unit-test