Tom Gilke – Medium

Tom Gilke

Embracing Uncertainty — Bloom Filters

In my last post I explained the store stuff efficiently pattern.

Mar 16, 2023

Summary of a Bloom Filter. Hashes for the term Axolotl are stored in a BitVecor. The presence of Pancake and Flower is checked. Pancake has the same hash values as Axolotl and is therefore falsely identified as present. Flower has a different first hash and is identified as not present.

Mar 16, 2023

The store stuff efficiently pattern — you should ‘step into’ open source software

I use a lot of open source software. If you work in software or program as a hobby, you surely also do.

Mar 8, 2023

Store Stuff Efficiently — Keep Track of IDs by setting corresponding bits in a BitVector to 1. Check the presence of an ID with OR and delete them with the inverse value. Store Flags with a similar pattern, defining a numeric representation for each condition.

Mar 8, 2023

What is 42 << 2 ?

Have you ever read some code, happily clicked “step into” in the debugger of your choice and suddenly encountered expressions like this?

Mar 1, 2023

Bitshifting and Combinations. AND and OR combine two numbers bit by bit, Bitshifting moves a value by a specified amount of bits.

Mar 1, 2023

Tom Gilke

Tom Gilke

Software developer with a big heart for visualization. I love to learn more about everything related to computer science and want to share the fun with others.

Following

Help
Status
About
Careers
Press
Blog
Privacy
Terms
Text to speech
Teams