[PATCH] D27146: Merge strings using a probabilistic algorithm to reduce latency.

[Anton Korobeynikov via Phabricator via llvm-commits]

asl added a comment.

Hi Rui,

Why can't you use two-bit counting Bloom filter to efficiently calculate whether the given string would need to be merged or not? Bloom filter filling could be done in parallel and on the second pass you'd insert the strings in the map only if they are known to have count > 1.

If you need the code for counting BF that could be filled in in parallel - let me know.


https://reviews.llvm.org/D27146