This is an automated email from the ASF dual-hosted git repository.
aherbert pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-codec.git
commit dc2d1d5701f1796c04eee5aa36a3b04b447311d3
Author: Alex Herbert <a.herb...@sussex.ac.uk>
AuthorDate: Sun Jun 12 20:06:50 2022 +0100
Correct empty <p> tags
---
.../org/apache/commons/codec/digest/MurmurHash3.java | 18 +++++++++---------
.../org/apache/commons/codec/language/Soundex.java | 2 +-
2 files changed, 10 insertions(+), 10 deletions(-)
diff --git a/src/main/java/org/apache/commons/codec/digest/MurmurHash3.java
b/src/main/java/org/apache/commons/codec/digest/MurmurHash3.java
index 7c85e848..ec4506a3 100644
--- a/src/main/java/org/apache/commons/codec/digest/MurmurHash3.java
+++ b/src/main/java/org/apache/commons/codec/digest/MurmurHash3.java
@@ -45,7 +45,7 @@ import org.apache.commons.codec.binary.StringUtils;
* Original adaption from Apache Hive. That adaption contains a {@code hash64}
method that is not part of the original
* MurmurHash3 code. It is not recommended to use these methods. They will be
removed in a future release. To obtain a
* 64-bit hash use half of the bits from the {@code hash128x64} methods using
the input data converted to bytes.
- * <p>
+ * </p>
*
* @see <a href="https://en.wikipedia.org/wiki/MurmurHash";>MurmurHash</a>
* @see <a
href="https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp";>
Original MurmurHash3 c++
@@ -215,7 +215,7 @@ public final class MurmurHash3 {
*
* <p>This implementation contains a sign-extension bug in the
finalization step of
* any bytes left over from dividing the length by 4. This manifests if
any of these
- * bytes are negative.<p>
+ * bytes are negative.</p>
*
* @param data The input byte array
* @return The 32-bit hash
@@ -244,7 +244,7 @@ public final class MurmurHash3 {
*
* <p>This implementation contains a sign-extension bug in the
finalization step of
* any bytes left over from dividing the length by 4. This manifests if
any of these
- * bytes are negative.<p>
+ * bytes are negative.</p>
*
* @param data The input string
* @return The 32-bit hash
@@ -270,7 +270,7 @@ public final class MurmurHash3 {
*
* <p>This implementation contains a sign-extension bug in the
finalization step of
* any bytes left over from dividing the length by 4. This manifests if
any of these
- * bytes are negative.<p>
+ * bytes are negative.</p>
*
* @param data The input byte array
* @param length The length of array
@@ -294,7 +294,7 @@ public final class MurmurHash3 {
*
* <p>This implementation contains a sign-extension bug in the
finalization step of
* any bytes left over from dividing the length by 4. This manifests if
any of these
- * bytes are negative.<p>
+ * bytes are negative.</p>
*
* @param data The input byte array
* @param length The length of array
@@ -316,7 +316,7 @@ public final class MurmurHash3 {
*
* <p>This implementation contains a sign-extension bug in the
finalization step of
* any bytes left over from dividing the length by 4. This manifests if
any of these
- * bytes are negative.<p>
+ * bytes are negative.</p>
*
* @param data The input byte array
* @param offset The offset of data
@@ -644,7 +644,7 @@ public final class MurmurHash3 {
* {@link #hash128(byte[], int, int, int)}.</p>
*
* <p>Use of this method is not advised. Use the first long returned from
- * {@link #hash128x64(byte[], int, int, int)}.<p>
+ * {@link #hash128x64(byte[], int, int, int)}.</p>
*
* @param data The input byte array
* @param offset The offset of data
@@ -783,7 +783,7 @@ public final class MurmurHash3 {
* from Austin Applyby's original MurmurHash3 {@code c++} code in
SMHasher.</p>
*
* <p>This implementation contains a sign-extension bug in the seed
initialization.
- * This manifests if the seed is negative.<p>
+ * This manifests if the seed is negative.</p>
*
* @param data The input byte array
* @param offset The first element of array
@@ -1189,7 +1189,7 @@ public final class MurmurHash3 {
*
* <p>This implementation contains a sign-extension bug in the
finalization step of
* any bytes left over from dividing the length by 4. This manifests if
any of these
- * bytes are negative.<p>
+ * bytes are negative.</p>
*
* @deprecated Use IncrementalHash32x86. This corrects the processing of
trailing bytes.
*/
diff --git a/src/main/java/org/apache/commons/codec/language/Soundex.java
b/src/main/java/org/apache/commons/codec/language/Soundex.java
index f5540755..fa128917 100644
--- a/src/main/java/org/apache/commons/codec/language/Soundex.java
+++ b/src/main/java/org/apache/commons/codec/language/Soundex.java
@@ -82,7 +82,7 @@ public class Soundex implements StringEncoder {
* Such letters aren't encoded (after the first), but they do
* act as separators when dropping duplicate codes.
* The mapping is otherwise the same as for {@link #US_ENGLISH}
- * <p>
+ *
* @since 1.11
*/
public static final Soundex US_ENGLISH_SIMPLIFIED = new
Soundex(US_ENGLISH_MAPPING_STRING, false);
