[Haskell-cafe] do nmergeIO or mergeIO preserve order?
aeyakovenko at gmail.com
Tue Mar 10 19:31:55 EDT 2009
i think this would still force me to evailuate the whole list, right?
i would want something that pipes the results into a channel that i
can lazyly read as the results are available.
On Tue, Mar 10, 2009 at 2:44 PM, Luke Palmer <lrpalmer at gmail.com> wrote:
> I think nmergeIO . map (:) should do the trick.
> On Tue, Mar 10, 2009 at 3:41 PM, Anatoly Yakovenko <aeyakovenko at gmail.com>
>> 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
More information about the Haskell-Cafe