>The downside is that accessing elements within the window will take time >O(window size). Are the windows large enough that this is a concern?
Yes windows are quite large and elements need to be accessed very frequently. 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. Can we create something like standard lazy list but with better access time. Thanks, Saswat _______________________________________________ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
