I think nmergeIO . map (:[]) should do the trick.<br><br>Luke<br><br><div class="gmail_quote">On Tue, Mar 10, 2009 at 3:41 PM, Anatoly Yakovenko <span dir="ltr"><<a href="mailto:aeyakovenko@gmail.com">aeyakovenko@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">Hmm, yea, actually that makes sense. What i am looking for is<br>
something that maps over a list and returns the list in order which<br>
the values are evaluated. looks like i can implement that pretty<br>
easily with unamb.<br>
<div><div></div><div class="h5"><br>
On Tue, Mar 10, 2009 at 2:33 PM, Luke Palmer <<a href="mailto:lrpalmer@gmail.com">lrpalmer@gmail.com</a>> wrote:<br>
> Although it is not formally specified, my intuition for the specification is<br>
> that order is preserved within each of the lists.<br>
><br>
> Luke<br>
><br>
> On Tue, Mar 10, 2009 at 2:50 PM, Anatoly Yakovenko <<a href="mailto:aeyakovenko@gmail.com">aeyakovenko@gmail.com</a>><br>
> wrote:<br>
>><br>
>> do nmergeIO or mergeIO preserve order? or not preserve order?<br>
>> _______________________________________________<br>
>> Haskell-Cafe mailing list<br>
>> <a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>
>> <a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
><br>
><br>
</div></div></blockquote></div><br>