[Haskell-cafe] Best bit LIST data structure
kc1956 at gmail.com
Sun Oct 9 18:23:08 CEST 2011
Must it be a list?
What about a Bloom Filter?
On Sun, Oct 9, 2011 at 9:11 AM, Roman Beslik <beroal at ukr.net> wrote:
> Yes, if you do not use high-level concepts and optimize everything by hand,
> it requires a lot of testing. :)
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
More information about the Haskell-Cafe