data structures - Opposite of Bloom filter? - Stack Overflow
Yes, a lossy hash table or a LRUCache is a data structure with fast O(1) lookup that will only give false negatives -- if you ask if "Have I run test X", it will tell you either "Yes, you definitely have", or "I can't remember".
Read full article from data structures - Opposite of Bloom filter? - Stack Overflow
No comments:
Post a Comment