Michael Schmatz

How to write a Bloom filter in C++

Bloom filters are data structures which can efficiently determine whether an element is possibly a member of a set or definitely not a member of a set. This article will cover a simple implementation of a C++ bloom filter.

How I wrote this blog post

It’s important to ensure that when building things, iteration is fast. I invested some time in making sure that writing posts is as easy as possible. This post will outline how I wrote and deployed it.

Writing the post

I use a great static site generator called Hugo to render this blog.

First, I created a new post using the command

hugo new post/how-i-wrote-this-blog-post.md