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

Anton Korobeynikov via Phabricator via llvm-commits llvm-commits at lists.llvm.org
Sun Nov 27 06:19:48 PST 2016


asl added a comment.

Sean, effectively counting bloom filter would give almost exact answer whether the string is a singleton or duplicated. This way no hash table lookups / insertions are even necessary.


https://reviews.llvm.org/D27146





More information about the llvm-commits mailing list