494 lines
12 KiB
Factor
494 lines
12 KiB
Factor
USING: locals math sequences tools.test hashtables words kernel
|
|
namespaces arrays strings prettyprint io.streams.string parser
|
|
accessors generic eval combinators combinators.short-circuit
|
|
combinators.short-circuit.smart math.order math.functions
|
|
definitions compiler.units fry lexer words.symbol see multiline ;
|
|
IN: locals.tests
|
|
|
|
:: foo ( a b -- a a ) a a ;
|
|
|
|
[ 1 1 ] [ 1 2 foo ] unit-test
|
|
|
|
:: add-test ( a b -- c ) a b + ;
|
|
|
|
[ 3 ] [ 1 2 add-test ] unit-test
|
|
|
|
:: sub-test ( a b -- c ) a b - ;
|
|
|
|
[ -1 ] [ 1 2 sub-test ] unit-test
|
|
|
|
:: map-test ( a b -- seq ) a [ b + ] map ;
|
|
|
|
[ { 5 6 7 } ] [ { 1 2 3 } 4 map-test ] unit-test
|
|
|
|
:: map-test-2 ( seq inc -- seq ) seq [| elt | elt inc + ] map ;
|
|
|
|
[ { 5 6 7 } ] [ { 1 2 3 } 4 map-test-2 ] unit-test
|
|
|
|
:: let-test ( c -- d )
|
|
[let 1 :> a 2 :> b a b + c + ] ;
|
|
|
|
[ 7 ] [ 4 let-test ] unit-test
|
|
|
|
:: let-test-2 ( a -- a )
|
|
a [let :> a [let a :> b a ] ] ;
|
|
|
|
[ 3 ] [ 3 let-test-2 ] unit-test
|
|
|
|
:: let-test-3 ( a -- a )
|
|
a [let :> a [let [ a ] :> b [let 3 :> a b ] ] ] ;
|
|
|
|
:: let-test-4 ( a -- b )
|
|
a [let 1 :> a :> b a b 2array ] ;
|
|
|
|
[ { 1 2 } ] [ 2 let-test-4 ] unit-test
|
|
|
|
:: let-test-5 ( a b -- b )
|
|
a b [let :> a :> b a b 2array ] ;
|
|
|
|
[ { 2 1 } ] [ 1 2 let-test-5 ] unit-test
|
|
|
|
:: let-test-6 ( a -- b )
|
|
a [let :> a 1 :> b a b 2array ] ;
|
|
|
|
[ { 2 1 } ] [ 2 let-test-6 ] unit-test
|
|
|
|
[ -1 ] [ -1 let-test-3 call ] unit-test
|
|
|
|
:: write-test-1 ( n! -- q )
|
|
[| i | n i + dup n! ] ;
|
|
|
|
0 write-test-1 "q" set
|
|
|
|
{ 1 1 } "q" get must-infer-as
|
|
|
|
[ 1 ] [ 1 "q" get call ] unit-test
|
|
|
|
[ 2 ] [ 1 "q" get call ] unit-test
|
|
|
|
[ 3 ] [ 1 "q" get call ] unit-test
|
|
|
|
[ 5 ] [ 2 "q" get call ] unit-test
|
|
|
|
:: write-test-2 ( -- q )
|
|
[let 0 :> n! [| i | n i + dup n! ] ] ;
|
|
|
|
write-test-2 "q" set
|
|
|
|
[ 1 ] [ 1 "q" get call ] unit-test
|
|
|
|
[ 2 ] [ 1 "q" get call ] unit-test
|
|
|
|
[ 3 ] [ 1 "q" get call ] unit-test
|
|
|
|
[ 5 ] [ 2 "q" get call ] unit-test
|
|
|
|
[ 10 20 ]
|
|
[
|
|
20 10 [| a! | [| b! | a b ] ] call call
|
|
] unit-test
|
|
|
|
:: write-test-3 ( a! -- q ) [| b | b a! ] ;
|
|
|
|
[ ] [ 1 2 write-test-3 call ] unit-test
|
|
|
|
:: write-test-4 ( x! -- q ) [ [let 0 :> y! f x! ] ] ;
|
|
|
|
[ ] [ 5 write-test-4 drop ] unit-test
|
|
|
|
:: let-let-test ( n -- n ) [let n 3 + :> n n ] ;
|
|
|
|
[ 13 ] [ 10 let-let-test ] unit-test
|
|
|
|
GENERIC: lambda-generic ( a b -- c )
|
|
|
|
GENERIC# lambda-generic-1 1 ( a b -- c )
|
|
|
|
M:: integer lambda-generic-1 ( a b -- c ) a b * ;
|
|
|
|
M:: string lambda-generic-1 ( a b -- c )
|
|
a b CHAR: x <string> lambda-generic ;
|
|
|
|
M:: integer lambda-generic ( a b -- c ) a b lambda-generic-1 ;
|
|
|
|
GENERIC# lambda-generic-2 1 ( a b -- c )
|
|
|
|
M:: integer lambda-generic-2 ( a b -- c )
|
|
a CHAR: x <string> b lambda-generic ;
|
|
|
|
M:: string lambda-generic-2 ( a b -- c ) a b append ;
|
|
|
|
M:: string lambda-generic ( a b -- c ) a b lambda-generic-2 ;
|
|
|
|
[ 10 ] [ 5 2 lambda-generic ] unit-test
|
|
|
|
[ "abab" ] [ "aba" "b" lambda-generic ] unit-test
|
|
|
|
[ "abaxxx" ] [ "aba" 3 lambda-generic ] unit-test
|
|
|
|
[ "xaba" ] [ 1 "aba" lambda-generic ] unit-test
|
|
|
|
[ ] [ \ lambda-generic-1 see ] unit-test
|
|
|
|
[ ] [ \ lambda-generic-2 see ] unit-test
|
|
|
|
[ ] [ \ lambda-generic see ] unit-test
|
|
|
|
:: unparse-test-1 ( a -- ) [let 3 :> a! 4 :> b ] ;
|
|
|
|
[ "[let 3 :> a! 4 :> b ]" ] [
|
|
\ unparse-test-1 "lambda" word-prop body>> first unparse
|
|
] unit-test
|
|
|
|
:: unparse-test-3 ( -- b ) [| a! | ] ;
|
|
|
|
[ "[| a! | ]" ] [
|
|
\ unparse-test-3 "lambda" word-prop body>> first unparse
|
|
] unit-test
|
|
|
|
DEFER: xyzzy
|
|
|
|
[ ] [
|
|
"IN: locals.tests USE: math GENERIC: xyzzy ( a -- b ) M: integer xyzzy ;"
|
|
<string-reader> "lambda-generic-test" parse-stream drop
|
|
] unit-test
|
|
|
|
[ 10 ] [ 10 xyzzy ] unit-test
|
|
|
|
[ ] [
|
|
"IN: locals.tests USE: math USE: locals GENERIC: xyzzy ( a -- b ) M:: integer xyzzy ( n -- x ) 5 ;"
|
|
<string-reader> "lambda-generic-test" parse-stream drop
|
|
] unit-test
|
|
|
|
[ 5 ] [ 10 xyzzy ] unit-test
|
|
|
|
GENERIC: next-method-test ( a -- b )
|
|
|
|
M: integer next-method-test 3 + ;
|
|
|
|
M:: fixnum next-method-test ( a -- b ) a call-next-method 1 + ;
|
|
|
|
[ 5 ] [ 1 next-method-test ] unit-test
|
|
|
|
: no-with-locals-test ( -- seq ) { 1 2 3 } [| x | x 3 + ] map ;
|
|
|
|
[ { 4 5 6 } ] [ no-with-locals-test ] unit-test
|
|
|
|
{ 3 0 } [| a b c | ] must-infer-as
|
|
|
|
[ ] [ 1 [let :> a ] ] unit-test
|
|
|
|
[ 3 ] [ 1 [let :> a 3 ] ] unit-test
|
|
|
|
[ ] [ 1 2 [let :> a :> b ] ] unit-test
|
|
|
|
:: a-word-with-locals ( a b -- ) ;
|
|
|
|
CONSTANT: new-definition "USING: math ;\nIN: locals.tests\n: a-word-with-locals ( -- x ) 2 3 + ;\n"
|
|
|
|
[ ] [ new-definition eval( -- ) ] unit-test
|
|
|
|
[ t ] [
|
|
[ \ a-word-with-locals see ] with-string-writer
|
|
new-definition =
|
|
] unit-test
|
|
|
|
CONSTANT: method-definition "USING: locals locals.tests sequences ;\nM:: sequence method-with-locals ( a -- y ) a reverse ;\n"
|
|
|
|
GENERIC: method-with-locals ( x -- y )
|
|
|
|
M:: sequence method-with-locals ( a -- y ) a reverse ;
|
|
|
|
[ t ] [
|
|
[ \ sequence \ method-with-locals method see ] with-string-writer
|
|
method-definition =
|
|
] unit-test
|
|
|
|
:: cond-test ( a b -- c )
|
|
{
|
|
{ [ a b < ] [ 3 ] }
|
|
{ [ a b = ] [ 4 ] }
|
|
{ [ a b > ] [ 5 ] }
|
|
} cond ;
|
|
|
|
\ cond-test def>> must-infer
|
|
|
|
[ 3 ] [ 1 2 cond-test ] unit-test
|
|
[ 4 ] [ 2 2 cond-test ] unit-test
|
|
[ 5 ] [ 3 2 cond-test ] unit-test
|
|
|
|
:: 0&&-test ( a -- ? )
|
|
{ [ a integer? ] [ a even? ] [ a 10 > ] } 0&& ;
|
|
|
|
\ 0&&-test def>> must-infer
|
|
|
|
[ f ] [ 1.5 0&&-test ] unit-test
|
|
[ f ] [ 3 0&&-test ] unit-test
|
|
[ f ] [ 8 0&&-test ] unit-test
|
|
[ t ] [ 12 0&&-test ] unit-test
|
|
|
|
:: &&-test ( a -- ? )
|
|
{ [ a integer? ] [ a even? ] [ a 10 > ] } && ;
|
|
|
|
\ &&-test def>> must-infer
|
|
|
|
[ f ] [ 1.5 &&-test ] unit-test
|
|
[ f ] [ 3 &&-test ] unit-test
|
|
[ f ] [ 8 &&-test ] unit-test
|
|
[ t ] [ 12 &&-test ] unit-test
|
|
|
|
:: let-and-cond-test-1 ( -- a )
|
|
[let 10 :> a
|
|
[let 20 :> a
|
|
{
|
|
{ [ t ] [ [let 30 :> c a ] ] }
|
|
} cond
|
|
]
|
|
] ;
|
|
|
|
\ let-and-cond-test-1 def>> must-infer
|
|
|
|
[ 20 ] [ let-and-cond-test-1 ] unit-test
|
|
|
|
:: let-and-cond-test-2 ( -- pair )
|
|
[let 10 :> A
|
|
[let 20 :> B
|
|
{ { [ t ] [ { A B } ] } } cond
|
|
]
|
|
] ;
|
|
|
|
\ let-and-cond-test-2 def>> must-infer
|
|
|
|
[ { 10 20 } ] [ let-and-cond-test-2 ] unit-test
|
|
|
|
[ { 10 } ] [ 10 [| a | { a } ] call ] unit-test
|
|
[ { 10 20 } ] [ 10 20 [| a b | { a b } ] call ] unit-test
|
|
[ { 10 20 30 } ] [ 10 20 30 [| a b c | { a b c } ] call ] unit-test
|
|
|
|
[ { 10 20 30 } ] [ [let 10 :> a 20 :> b 30 :> c { a b c } ] ] unit-test
|
|
|
|
[ V{ 10 20 30 } ] [ 10 20 30 [| a b c | V{ a b c } ] call ] unit-test
|
|
|
|
[ H{ { 10 "a" } { 20 "b" } { 30 "c" } } ]
|
|
[ 10 20 30 [| a b c | H{ { a "a" } { b "b" } { c "c" } } ] call ] unit-test
|
|
|
|
[ T{ slice f 0 3 "abc" } ]
|
|
[ 0 3 "abc" [| from to seq | T{ slice f from to seq } ] call ] unit-test
|
|
|
|
{ 3 1 } [| from to seq | T{ slice f from to seq } ] must-infer-as
|
|
|
|
ERROR: punned-class x ;
|
|
|
|
[ T{ punned-class f 3 } ] [ 3 [| a | T{ punned-class f a } ] call ] unit-test
|
|
|
|
:: literal-identity-test ( -- a b )
|
|
{ 1 } V{ } ;
|
|
|
|
[ t t ] [
|
|
literal-identity-test
|
|
literal-identity-test
|
|
[ eq? ] [ eq? ] bi-curry* bi*
|
|
] unit-test
|
|
|
|
:: mutable-local-in-literal-test ( a! -- b ) a 1 + a! { a } ;
|
|
|
|
[ { 4 } ] [ 3 mutable-local-in-literal-test ] unit-test
|
|
|
|
:: compare-case ( obj1 obj2 lt-quot eq-quot gt-quot -- )
|
|
obj1 obj2 <=> {
|
|
{ +lt+ [ lt-quot call ] }
|
|
{ +eq+ [ eq-quot call ] }
|
|
{ +gt+ [ gt-quot call ] }
|
|
} case ; inline
|
|
|
|
[ [ ] [ ] [ ] compare-case ] must-infer
|
|
|
|
:: big-case-test ( a -- b )
|
|
a {
|
|
{ 0 [ a 1 + ] }
|
|
{ 1 [ a 1 - ] }
|
|
{ 2 [ a 1 swap / ] }
|
|
{ 3 [ a dup * ] }
|
|
{ 4 [ a sqrt ] }
|
|
{ 5 [ a a ^ ] }
|
|
} case ;
|
|
|
|
\ big-case-test def>> must-infer
|
|
|
|
[ 9 ] [ 3 big-case-test ] unit-test
|
|
|
|
! Dan found this problem
|
|
: littledan-case-problem-1 ( a -- b )
|
|
{
|
|
{ t [ 3 ] }
|
|
{ f [ 4 ] }
|
|
[| x | x 12 + { "howdy" } nth ]
|
|
} case ;
|
|
|
|
\ littledan-case-problem-1 def>> must-infer
|
|
|
|
[ "howdy" ] [ -12 \ littledan-case-problem-1 def>> call ] unit-test
|
|
[ "howdy" ] [ -12 littledan-case-problem-1 ] unit-test
|
|
|
|
:: littledan-case-problem-2 ( a -- b )
|
|
a {
|
|
{ t [ a not ] }
|
|
{ f [ 4 ] }
|
|
[| x | x a - { "howdy" } nth ]
|
|
} case ;
|
|
|
|
\ littledan-case-problem-2 def>> must-infer
|
|
|
|
[ "howdy" ] [ -12 \ littledan-case-problem-2 def>> call ] unit-test
|
|
[ "howdy" ] [ -12 littledan-case-problem-2 ] unit-test
|
|
|
|
:: littledan-cond-problem-1 ( a -- b )
|
|
a {
|
|
{ [ dup 0 < ] [ drop a not ] }
|
|
{ [| y | y y 0 > ] [ drop 4 ] }
|
|
[| x | x a - { "howdy" } nth ]
|
|
} cond ;
|
|
|
|
\ littledan-cond-problem-1 def>> must-infer
|
|
|
|
[ f ] [ -12 \ littledan-cond-problem-1 def>> call ] unit-test
|
|
[ 4 ] [ 12 \ littledan-cond-problem-1 def>> call ] unit-test
|
|
[ "howdy" ] [ 0 \ littledan-cond-problem-1 def>> call ] unit-test
|
|
[ f ] [ -12 littledan-cond-problem-1 ] unit-test
|
|
[ 4 ] [ 12 littledan-cond-problem-1 ] unit-test
|
|
[ "howdy" ] [ 0 littledan-cond-problem-1 ] unit-test
|
|
|
|
/*
|
|
:: littledan-case-problem-3 ( a quot -- b )
|
|
a {
|
|
{ t [ a not ] }
|
|
{ f [ 4 ] }
|
|
quot
|
|
} case ; inline
|
|
|
|
[ f ] [ t [ ] littledan-case-problem-3 ] unit-test
|
|
[ 144 ] [ 12 [ sq ] littledan-case-problem-3 ] unit-test
|
|
[| | [| a | a ] littledan-case-problem-3 ] must-infer
|
|
|
|
: littledan-case-problem-4 ( a -- b )
|
|
[ 1 + ] littledan-case-problem-3 ;
|
|
|
|
\ littledan-case-problem-4 def>> must-infer
|
|
*/
|
|
|
|
GENERIC: lambda-method-forget-test ( a -- b )
|
|
|
|
M:: integer lambda-method-forget-test ( a -- b ) a ;
|
|
|
|
[ ] [ [ M\ integer lambda-method-forget-test forget ] with-compilation-unit ] unit-test
|
|
|
|
[ 10 ] [ 10 [| A | { [ A ] } ] call first call ] unit-test
|
|
|
|
[
|
|
"USING: locals fry math ; 1 '[ [let 10 :> A A _ + ] ]"
|
|
eval( -- ) call
|
|
] [ error>> >r/r>-in-fry-error? ] must-fail-with
|
|
|
|
:: (funny-macro-test) ( obj quot -- ? ) obj { [ quot call ] } 1&& ; inline
|
|
: funny-macro-test ( n -- ? ) [ odd? ] (funny-macro-test) ;
|
|
|
|
\ funny-macro-test def>> must-infer
|
|
|
|
[ t ] [ 3 funny-macro-test ] unit-test
|
|
[ f ] [ 2 funny-macro-test ] unit-test
|
|
|
|
[ "USE: locals [let" eval( -- ) ] [ error>> unexpected-eof? ] must-fail-with
|
|
[ "USE: locals [|" eval( -- ) ] [ error>> unexpected-eof? ] must-fail-with
|
|
|
|
[ 25 ] [ 5 [| a | { [ a sq ] } cond ] call ] unit-test
|
|
[ 25 ] [ 5 [| | { [| a | a sq ] } ] call first call ] unit-test
|
|
|
|
:: FAILdog-1 ( -- b ) { [| c | c ] } ;
|
|
|
|
\ FAILdog-1 def>> must-infer
|
|
|
|
:: FAILdog-2 ( a -- b ) a { [| c | c ] } cond ;
|
|
|
|
\ FAILdog-2 def>> must-infer
|
|
|
|
[ 3 ] [ 3 [| a | \ a ] call ] unit-test
|
|
|
|
[ "USE: locals [| | { [let 0 :> a a ] } ]" eval( -- ) ] must-fail
|
|
|
|
[ "USE: locals [| | [let 0 :> a! { a! } ] ]" eval( -- ) ] must-fail
|
|
|
|
[ "USE: locals [| | { :> a } ]" eval( -- ) ] must-fail
|
|
|
|
[ "USE: locals 3 :> a" eval( -- ) ] must-fail
|
|
|
|
[ 3 ] [ 3 [| | :> a a ] call ] unit-test
|
|
|
|
[ 3 ] [ 3 [| | :> a! a ] call ] unit-test
|
|
|
|
[ 3 ] [ 2 [| | :> a! a 1 + a! a ] call ] unit-test
|
|
|
|
: fry-locals-test-1 ( -- n )
|
|
[let 6 '[ [let 4 :> A A _ + ] ] call ] ;
|
|
|
|
\ fry-locals-test-1 def>> must-infer
|
|
[ 10 ] [ fry-locals-test-1 ] unit-test
|
|
|
|
:: fry-locals-test-2 ( -- n )
|
|
[let 6 '[ [let 4 :> A A _ + ] ] call ] ;
|
|
|
|
\ fry-locals-test-2 def>> must-infer
|
|
[ 10 ] [ fry-locals-test-2 ] unit-test
|
|
|
|
[ 1 ] [ 3 4 [| | '[ [ _ swap - ] call ] call ] call ] unit-test
|
|
[ -1 ] [ 3 4 [| | [| a | a - ] call ] call ] unit-test
|
|
[ -1 ] [ 3 4 [| | [| a | a - ] curry call ] call ] unit-test
|
|
[ -1 ] [ 3 4 [| a | a - ] curry call ] unit-test
|
|
[ 1 ] [ 3 4 [| | '[ [| a | _ a - ] call ] call ] call ] unit-test
|
|
[ -1 ] [ 3 4 [| | '[ [| a | a _ - ] call ] call ] call ] unit-test
|
|
|
|
[ { 1 2 3 4 } ] [
|
|
1 3 2 4
|
|
[| | '[ [| a b | a _ b _ 4array ] call ] call ] call
|
|
] unit-test
|
|
|
|
[ 10 ] [
|
|
[| | 0 '[ [let 10 :> A A _ + ] ] call ] call
|
|
] unit-test
|
|
|
|
! littledan found this problem
|
|
[ "bar" ] [ [let [let "bar" :> foo foo ] :> a a ] ] unit-test
|
|
[ 10 ] [ [let 10 :> a [let a :> b b ] ] ] unit-test
|
|
|
|
[ { \ + } ] [ [let \ + :> x { \ x } ] ] unit-test
|
|
|
|
[ { \ + 3 } ] [ [let 3 :> a { \ + a } ] ] unit-test
|
|
|
|
[ 3 ] [ [let \ + :> a 1 2 [ \ a execute ] ] call ] unit-test
|
|
|
|
! erg found this problem
|
|
:: erg's-:>-bug ( n ? -- n ) ? [ n :> n n ] [ n :> b b ] if ;
|
|
|
|
[ 3 ] [ 3 f erg's-:>-bug ] unit-test
|
|
|
|
[ 3 ] [ 3 t erg's-:>-bug ] unit-test
|
|
|
|
:: erg's-:>-bug-2 ( n ? -- n ) ? n '[ _ :> n n ] [ n :> b b ] if ;
|
|
|
|
[ 3 ] [ 3 f erg's-:>-bug-2 ] unit-test
|
|
|
|
[ 3 ] [ 3 t erg's-:>-bug-2 ] unit-test
|
|
|
|
! dharmatech found this problem
|
|
GENERIC: ed's-bug ( a -- b )
|
|
|
|
M: string ed's-bug reverse ;
|
|
M: integer ed's-bug neg ;
|
|
|
|
:: ed's-test-case ( a -- b )
|
|
{ [ a ed's-bug ] } && ;
|
|
|
|
[ t ] [ \ ed's-test-case optimized? ] unit-test
|
|
|
|
! multiple bind
|
|
[ 3 1 2 ] [ [let 1 2 3 :> ( a b c ) c a b ] ] unit-test
|