1 ! Copyright (C) 2006, 2008 Slava Pestov.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: kernel math namespaces sequences strings words assocs
4 combinators accessors ;
7 TUPLE: effect in out terminated? ;
9 : <effect> ( in out -- effect )
10 dup { "*" } sequence= [ drop { } t ] [ f ] if
13 : effect-height ( effect -- n )
14 [ out>> length ] [ in>> length ] bi - ;
16 : effect<= ( eff1 eff2 -- ? )
18 { [ over terminated?>> ] [ t ] }
19 { [ dup terminated?>> ] [ f ] }
20 { [ 2dup [ in>> length ] bi@ > ] [ f ] }
21 { [ 2dup [ effect-height ] bi@ = not ] [ f ] }
25 GENERIC: (stack-picture) ( obj -- str )
26 M: string (stack-picture) ;
27 M: word (stack-picture) word-name ;
28 M: integer (stack-picture) drop "object" ;
30 : stack-picture ( seq -- string )
31 [ [ (stack-picture) % CHAR: \s , ] each ] "" make ;
33 : effect>string ( effect -- string )
36 [ in>> stack-picture % "-- " % ]
37 [ out>> stack-picture % ]
38 [ terminated?>> [ "* " % ] when ]
43 GENERIC: stack-effect ( word -- effect/f )
45 M: symbol stack-effect drop (( -- symbol )) ;
48 { "declared-effect" "inferred-effect" }
49 swap word-props [ at ] curry map [ ] find nip ;
52 [ in>> clone ] [ out>> clone ] bi <effect> ;
54 : split-shuffle ( stack shuffle -- stack1 stack2 )
57 : load-shuffle ( stack shuffle -- )
60 : shuffled-values ( shuffle -- values )
63 : shuffle* ( stack shuffle -- newstack )
64 [ [ load-shuffle ] keep shuffled-values ] with-scope ;
66 : shuffle ( stack shuffle -- newstack )
67 [ split-shuffle ] keep shuffle* append ;