Entities Mentioned

• Bryan O'Sullivan

1. bloomfilter - a fast Bloom filter library for Haskell May 30th, 2008 by Bryan O'Sullivan A Bloom filter is a probabilistic data structure that provides a fast set membership querying capability. It does not give false negatives, but has a tunable false positive rate. (A false positive arises when the filter claims that an element is present, but in fact it is not.) The library is easy to use. As an example, here’s a reimplementation of the Unix “spell” command. import Data.BloomFilter.Easy (easy (Read Full Article)
   
   

   Related Articles

   • Bryan O'Sullivan: Why you should not use pyinotify
   • also published in serpentine.com
   • Xtract: a query language for XML documents
   • also written by liesen
   • Http://Www.Golubovsky.Org:5984/_Utils/Yhcws/Index.Html
   • also written by liesen
   • Using HaXml to clean legacy HTML pages
   • also written by liesen
   • Fast I/O in Haskell
   • also written by liesen

   • Haskell Weekly News: September 23, 2007
   • also mentions Bryan O'Sullivan
   • blog.kfish.org: Review: TagSoup
   • also written by liesen
   • Bryan O'Sullivan: LLVM bindings for Haskell
   • also published in serpentine.com
   • XML Matters: Transcending the limits of Dom, Sax, and XSLT
   • also written by liesen
   • Hxml
   • also written by liesen

Login to comment.