Saswat Anand <[EMAIL PROTECTED]> writes: > As regard to Marcin's suggestion of using a list of compact arrays, > although elements can be accessed faster, there will be a lot if > redundancy since windows are overlapping. So consecutive arrays > will contain almost same data.
Hmmm - a circular buffer array, fed from a lazy read? Of course, if this is to be more efficient than a lazy list of arrays, you need to destructively update the buffer. Perhaps this is a too Cistic solution. -kzm -- If I haven't seen further, it is by standing in the footprints of giants _______________________________________________ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
