factor/extra/concurrency/combinators/combinators.factor

! Copyright (C) 2008 Slava Pestov.
! See http://factorcode.org/license.txt for BSD license.
USING: concurrency.futures concurrency.count-downs sequences
kernel ;
IN: concurrency.combinators

: parallel-map ( seq quot -- newseq )
    [ curry future ] curry map dup [ ?future ] change-each ;
    inline

: parallel-each ( seq quot -- )
    over length <count-down>
    [ [ >r curry r> spawn-stage ] 2curry each ] keep await ;
    inline

: parallel-filter ( seq quot -- newseq )
    over >r pusher >r each r> r> like ; inline
Updating libraries 2008-02-18 10:08:59 -05:00			`! Copyright (C) 2008 Slava Pestov.`
			`! See http://factorcode.org/license.txt for BSD license.`
			`USING: concurrency.futures concurrency.count-downs sequences`
			`kernel ;`
			`IN: concurrency.combinators`

			`: parallel-map ( seq quot -- newseq )`
			`[ curry future ] curry map dup [ ?future ] change-each ;`
			`inline`

			`: parallel-each ( seq quot -- )`
Tested and documented all new concurrency features 2008-02-18 17:20:18 -05:00			`over length <count-down>`
			`[ [ >r curry r> spawn-stage ] 2curry each ] keep await ;`
			`inline`

extra changes: index* -> index-from last-index* -> last-index-from 1 tail -> rest 1 tail-slice -> rest-slice subset -> filter prepose find* -> find-from find-last* -> find-last-from before, after generic, < for integers make between? work for timestamps 2008-04-26 00:17:08 -04:00			`: parallel-filter ( seq quot -- newseq )`
Tested and documented all new concurrency features 2008-02-18 17:20:18 -05:00			`over >r pusher >r each r> r> like ; inline`