Re: [Haskell-cafe] Best bit LIST data structure

Must it be a list? What about a Bloom Filter? On Sun, Oct 9, 2011 at 9:11 AM, Roman Beslik 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@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

-- -- Regards, KC