Kenneth Hoste wrote:
Well, I'm using UArray, but I'm willing to consider other suitable
containers...
As long as they are memory efficient. :-)
The typical usage of a UArray will be getting all it's contents,
and converting it to a list to easily manipulate (filter, ...).
So, maybe another data type allows me to store the data in a limited
amount of memory
(which is my main concern now)...
Have you considered using spectral (or counting) bloom filters? I know
there's a non-spectral version available[1], though I haven't looked at
it to see how easily it could be made to count.
[1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bloomfilter
--
Live well,
~wren
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
