As I understand it there's more to it than simply being a hashmap without collision resolution: performance. They mentioned hundreds of thousands of events per

As I understand it there's more to it than simply being a hashmap without collision resolution: performance. They mentioned hundreds of thousands of events per second. At that level typical Java objects and locks simply do not cut it anymore. That is why, for example, LMAX wrote their disruptor pattern using gigantic primitives array and fast CAS, no locking, operations. So here they're using a very fast "hashmap" updated by using CAS operation which do not lock. Why would it be a joke that said!? There are use cases for Bloom Filters, so there probably are for what they created here too no!?