Perhaps I am being obtuse, but why would you need to pass a continuation
for each list, rather than just passing the list? If the head does not
encapsultate all relevant infromation about the list, could you not wrap the
list with another datastructure, which you update (pass a derived versi
Rene de Visser wrote:
>> From: ChrisK <[EMAIL PROTECTED]>
>> Rene de Visser wrote:
>> Does a single list have only disjoint intervals?
>
> Yes. The lists are strictly increasing
Could the interval for element x of List xList overlap with more than
one element of another list? It does not matter
Doh! ignore me. apparently I understand the problem, but offer nothing
in the way of solution. :)
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-c
Why not have a merging function which takes all lists and merges them
into a single ordered list marked with which list the events came from
and their timestamps. Then you can just traverse this single, merged
list. if I am understanding the problem properly...
John
--
John Meacham - ⑆r
On Monday 26 September 2005 17:14, Rene de Visser wrote:
> Hello,
>
> I need to zip together multiple lists.
>
> The lists are sorted by date, and each entry in the list represents data
> for a time interval.
> The time intervals between the lists may be missmatched from each other.
Is this the so
From: ChrisK <[EMAIL PROTECTED]>
Rene de Visser wrote:
Does a single list have only disjoint intervals?
Yes. The lists are strictly increasing
Doing this for two lists with a recursive function is easy. There being
an output element whenever the intervals of the two input lists overlap.
Yes, I
Rene de Visser wrote:
> Hello,
>
> I need to zip together multiple lists.
>
> The lists are sorted by date, and each entry in the list represents data
> for a time interval.
> The time intervals between the lists may be missmatched from each other.
>
Does a single list have only disjoint inter
Hello,
I need to zip together multiple lists.
The lists are sorted by date, and each entry in the list represents data for
a time interval.
The time intervals between the lists may be missmatched from each other.
This means that sometimes you don't need to move forward in list, while you
mov
On Sat, 24 Sep 2005, Marcin Tustin wrote:
> For some reason the following code is producing an error message from ghci
> that the the patterns are non-exhaustive. Does anyone have any idea why that
> could be, given that the patterns are, at least in my meaning, provably
> exhaustive?
>
> choo
On Fri, 23 Sep 2005, Marcin Tustin wrote:
> Thanks for this: All I have to do now is fix the fact that my maths is
> stupidly screwed!
'div' is the integer division and rounds down. You should either use
Rational (or Double) everywhere or use % which builds a ratio from two
integers.
__
On Mon, 2005-09-26 at 10:36 +0200, Gracjan Polak wrote:
> Simon Peyton-Jones wrote:
> > Hmm. Q is a monad, so I think
> > fail :: Monad m => String -> m a
> > will do the job.
> >
> > 'recover' should catch the exception, and let you try something else.
>
> So I think I have bug report :)
>
Simon Peyton-Jones wrote:
Hmm. Q is a monad, so I think
fail :: Monad m => String -> m a
will do the job.
'recover' should catch the exception, and let you try something else.
So I think I have bug report :)
Haskell-cafe is probably wrong place for this, where do I go now with my
fa
Hello
With the resent discussion on comonads on #haskell (mostly due to Uustalo's
excellent paper) I am wondering is it possible to model failure with
comonads?
It seems to me that Reader,Writer and State can be implemented with both
monads and comonads. IO can be implemented as a monad but OI w
13 matches
Mail list logo
