author | Claus Gittinger <cg@exept.de> |
Thu, 30 May 2019 11:39:24 +0200 | |
changeset 4974 | 33b7c4e3a597 |
parent 4973 | 084da8f61316 |
child 4975 | dfb8998b95e0 |
BloomFilter.st | file | annotate | diff | comparison | revisions |
--- a/BloomFilter.st Thu May 30 11:36:31 2019 +0200 +++ b/BloomFilter.st Thu May 30 11:39:24 2019 +0200 @@ -40,7 +40,8 @@ documentation " - a BloomFilter is a Set-like data structure which can quickly answer whether + a BloomFilter (see eg. https://de.wikipedia.org/wiki/Bloomfilter) + is a Set-like data structure which can quickly answer whether an element is definitely NOT in the set, but might generate false positives (i.e. it might answer true, although the element is not actually present).