2009-01-08 19:56:49 -05:00
|
|
|
! Copyright (C) 2009 Doug Coleman.
|
|
|
|
|
! See http://factorcode.org/license.txt for BSD license.
|
|
|
|
|
USING: accessors fry generalizations kernel macros math.order
|
|
|
|
|
stack-checker math ;
|
|
|
|
|
IN: combinators.smart
|
|
|
|
|
|
|
|
|
|
MACRO: output>sequence ( quot exemplar -- newquot )
|
|
|
|
|
[ dup infer out>> ] dip
|
|
|
|
|
'[ @ _ _ nsequence ] ;
|
|
|
|
|
|
|
|
|
|
: output>array ( quot -- newquot )
|
|
|
|
|
{ } output>sequence ; inline
|
|
|
|
|
|
|
|
|
|
MACRO: input<sequence ( quot -- newquot )
|
|
|
|
|
[ infer in>> ] keep
|
|
|
|
|
'[ _ firstn @ ] ;
|
|
|
|
|
|
2009-01-09 16:39:47 -05:00
|
|
|
MACRO: reduce-outputs ( quot operation -- newquot )
|
2009-01-08 19:56:49 -05:00
|
|
|
[ dup infer out>> 1 [-] ] dip n*quot compose ;
|
|
|
|
|
|
|
|
|
|
: sum-outputs ( quot -- n )
|
2009-01-09 16:39:47 -05:00
|
|
|
[ + ] reduce-outputs ; inline
|
