It's funny you say that, because Bloom filters are one of the few non-trivial data structures used in a project I have here with over 3 million lines of code. It's an emulation project with kernel drivers for hardware virtualization and all sorts of exotic functionality. Most needs are covered by arrays and linked lists. Recently we added some AVL trees, and of course hardware data structures (for page tables, etc.) must be implemented as specified.
