[Haskell-cafe] list of range

[PICCA Frederic-Emmanuel]

> Set Int is not lazy. [Int] is lazy, but it is inefficient for eliminating
> duplicates. IntSet is also strict, but internally it is almost a bit
> vector, i.e. storage efficient. If the ranges are really large, then you
> might need data-interval&friends. However, a list of numbers of image
> files might not be that large, and IntSet will probably be a good choice.

We have 100 files with 3000 images.

300000 * 4 bytes = 1.2 M

is it that big ?