[Haskell-cafe] do nmergeIO or mergeIO preserve order?

[Luke Palmer]

I think nmergeIO . map (:[]) should do the trick.

Luke

On Tue, Mar 10, 2009 at 3:41 PM, Anatoly Yakovenko <aeyakovenko at gmail.com>wrote:

> Hmm, yea, actually that makes sense.  What i am looking for is
> something that maps over a list and returns the list in order which
> the values are evaluated.  looks like i can implement that pretty
> easily with unamb.
>
> On Tue, Mar 10, 2009 at 2:33 PM, Luke Palmer <lrpalmer at gmail.com> wrote:
> > Although it is not formally specified, my intuition for the specification
> is
> > that order is preserved within each of the lists.
> >
> > Luke
> >
> > On Tue, Mar 10, 2009 at 2:50 PM, Anatoly Yakovenko <
> aeyakovenko at gmail.com>
> > wrote:
> >>
> >> do nmergeIO or mergeIO preserve order? or not preserve order?
> >> _______________________________________________
> >> Haskell-Cafe mailing list
> >> Haskell-Cafe at haskell.org
> >> http://www.haskell.org/mailman/listinfo/haskell-cafe
> >
> >
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20090310/270d6850/attachment.htm