Kevin Downey writes:
Hi Kevin,
>> This is the new version using reducers (:as r). The problem here is
>> that to stop the iteration, one has to reduce the intermediate result
>> in every step and check if new reachable vertices (n) could be found.
>> If so, we need to do another iteration.
>
>
On Fri, Sep 14, 2012 at 4:22 AM, Tassilo Horn wrote:
> Hi all,
>
> I have some code which uses a lot of map/mapcat/filter stuff and is
> totally eager (result is always an ordered set). That looked to me like
> a good candidate for reducers.
>
> Basically, my code enables me to write something li
Hi all,
I have some code which uses a lot of map/mapcat/filter stuff and is
totally eager (result is always an ordered set). That looked to me like
a good candidate for reducers.
Basically, my code enables me to write something like this:
--8<---cut here---start-
