How to write a better bloom filter in C

A C implementation of a bloom filter presented as an improvement over a C++ version. Key advantages include user-supplied hash functions, support for arbitrary data types via void pointers, and direct bit manipulation instead of relying on std::vector<bool>. The post walks through the full header and implementation, covering struct layout, hash function linked list management, bit-level set and test operations, and example usage with djb2 and Jenkins hash functions.