aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGeorge Gastaldi <gegastaldi@gmail.com>2021-06-26 13:06:37 -0700
committerGoogle Java Core Libraries <java-core-libraries-team+copybara@google.com>2021-06-26 13:08:45 -0700
commit6ad72dd8e97688745267edfa7d0da7a432f57170 (patch)
tree15fe7f13b54d8a40442cbf3041445f26c5b44380
parentac7b30cdaac3ed31ef6b54a2654491ae85477f96 (diff)
downloadguava-6ad72dd8e97688745267edfa7d0da7a432f57170.tar.gz
Fix BloomFilter tutorial URL.
Closes https://github.com/google/guava/pull/5624. RELNOTES=n/a PiperOrigin-RevId: 381661212
-rw-r--r--android/guava/src/com/google/common/hash/BloomFilter.java2
-rw-r--r--guava/src/com/google/common/hash/BloomFilter.java2
2 files changed, 2 insertions, 2 deletions
diff --git a/android/guava/src/com/google/common/hash/BloomFilter.java b/android/guava/src/com/google/common/hash/BloomFilter.java
index 336f47b74..6ffe583f8 100644
--- a/android/guava/src/com/google/common/hash/BloomFilter.java
+++ b/android/guava/src/com/google/common/hash/BloomFilter.java
@@ -42,7 +42,7 @@ import org.checkerframework.checker.nullness.qual.Nullable;
* but if it claims that an element is <i>not</i> contained in it, then this is definitely true.
*
* <p>If you are unfamiliar with Bloom filters, this nice <a
- * href="http://llimllib.github.com/bloomfilter-tutorial/">tutorial</a> may help you understand how
+ * href="http://llimllib.github.io/bloomfilter-tutorial/">tutorial</a> may help you understand how
* they work.
*
* <p>The false positive probability ({@code FPP}) of a Bloom filter is defined as the probability
diff --git a/guava/src/com/google/common/hash/BloomFilter.java b/guava/src/com/google/common/hash/BloomFilter.java
index feb70fb4d..e0affaad4 100644
--- a/guava/src/com/google/common/hash/BloomFilter.java
+++ b/guava/src/com/google/common/hash/BloomFilter.java
@@ -43,7 +43,7 @@ import org.checkerframework.checker.nullness.qual.Nullable;
* but if it claims that an element is <i>not</i> contained in it, then this is definitely true.
*
* <p>If you are unfamiliar with Bloom filters, this nice <a
- * href="http://llimllib.github.com/bloomfilter-tutorial/">tutorial</a> may help you understand how
+ * href="http://llimllib.github.io/bloomfilter-tutorial/">tutorial</a> may help you understand how
* they work.
*
* <p>The false positive probability ({@code FPP}) of a Bloom filter is defined as the probability