Many thanks to all for the replies
From: ChrisK [EMAIL PROTECTED]
Could the interval for element x of List xList overlap with more than
one element of another list? It does not matter too much, but is
something you did not clarify. In general, how may the intervals for
all the lists
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
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 intervals?
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
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 sort of
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 -
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
