3 ms·
The other half of it is, your hypothetical set contains over 2^15 individual entries (i.e., it's not sparsely populated). (My use case was tracking allocated b
by loeg 9y ago
The other half of it is, your hypothetical set contains over 2^15 individual entries (i.e., it's not sparsely populated).
(My use case was tracking allocated blocks in a filesystem, in an application where probabilistic results would have been adequate. It is perfectly valid for 100% of blocks to be allocated, so the required vector size for a bloom filter would be longer than the same-size bitvector.)