This is an automated email from the ASF dual-hosted git repository.

ggregory pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-text.git


The following commit(s) were added to refs/heads/master by this push:
     new 38f06344 Javadoc
38f06344 is described below

commit 38f06344985d89648ec15ae4cfddc6b426eb73ae
Author: Gary Gregory <[email protected]>
AuthorDate: Sun Feb 1 07:52:00 2026 -0500

    Javadoc
---
 .../java/org/apache/commons/text/ExtendedMessageFormat.java  |  9 +++++++--
 .../commons/text/similarity/LevenshteinDetailedDistance.java | 12 +++++++++---
 .../apache/commons/text/similarity/LevenshteinDistance.java  |  4 +++-
 3 files changed, 19 insertions(+), 6 deletions(-)

diff --git a/src/main/java/org/apache/commons/text/ExtendedMessageFormat.java 
b/src/main/java/org/apache/commons/text/ExtendedMessageFormat.java
index 2baac548..4dcd957f 100644
--- a/src/main/java/org/apache/commons/text/ExtendedMessageFormat.java
+++ b/src/main/java/org/apache/commons/text/ExtendedMessageFormat.java
@@ -33,15 +33,20 @@ import org.apache.commons.text.matcher.StringMatcherFactory;
 
 /**
  * Extends {@link java.text.MessageFormat} to allow pluggable/additional 
formatting
- * options for embedded format elements.  Client code should specify a registry
+ * options for embedded format elements.
+ * <p>
+ * Client code should specify a registry
  * of {@code FormatFactory} instances associated with {@code String}
  * format names.  This registry will be consulted when the format elements are
  * parsed from the message pattern.  In this way custom patterns can be 
specified,
  * and the formats supported by {@link java.text.MessageFormat} can be 
overridden
  * at the format and/or format style level (see MessageFormat).  A "format 
element"
- * embedded in the message pattern is specified (<strong>()?</strong> 
signifies optionality):<br>
+ * embedded in the message pattern is specified (<strong>()?</strong> 
signifies optionality):
+ * </p>
+ * <p>
  * {@code {}<em>argument-number</em><strong>(</strong>{@code 
,}<em>format-name</em><b>
  * (</b>{@code ,}<em>format-style</em><strong>)?)?</strong>{@code }}
+ * </p>
  *
  * <p>
  * <em>format-name</em> and <em>format-style</em> values are trimmed of 
surrounding whitespace
diff --git 
a/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
 
b/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
index ac7b4018..4b4740ea 100644
--- 
a/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
+++ 
b/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
@@ -277,7 +277,9 @@ public class LevenshteinDetailedDistance implements 
EditDistance<LevenshteinResu
      *
      * <p>
      * Chas Emerick has written an implementation in Java, which avoids an 
OutOfMemoryError which can occur when my Java implementation is used with very 
large
-     * strings.<br>
+     * strings.
+     * </p>
+     * <p>
      * This implementation of the Levenshtein distance algorithm is from
      * <a 
href="https://www.merriampark.com/ldjava.htm";>http://www.merriampark.com/ldjava.htm</a>
      * </p>
@@ -420,7 +422,9 @@ public class LevenshteinDetailedDistance implements 
EditDistance<LevenshteinResu
      *
      * <p>
      * Chas Emerick has written an implementation in Java, which avoids an 
OutOfMemoryError which can occur when my Java implementation is used with very 
large
-     * strings.<br>
+     * strings.
+     * </p>
+     * <p>
      * This implementation of the Levenshtein distance algorithm is from
      * <a 
href="https://www.merriampark.com/ldjava.htm";>http://www.merriampark.com/ldjava.htm</a>
      * </p>
@@ -463,7 +467,9 @@ public class LevenshteinDetailedDistance implements 
EditDistance<LevenshteinResu
      *
      * <p>
      * Chas Emerick has written an implementation in Java, which avoids an 
OutOfMemoryError which can occur when my Java implementation is used with very 
large
-     * strings.<br>
+     * strings.
+     * </p>
+     * <p>
      * This implementation of the Levenshtein distance algorithm is from
      * <a 
href="https://www.merriampark.com/ldjava.htm";>http://www.merriampark.com/ldjava.htm</a>
      * </p>
diff --git 
a/src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java 
b/src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java
index 8ab60eee..d8b9e121 100644
--- a/src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java
+++ b/src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java
@@ -326,7 +326,9 @@ public class LevenshteinDistance implements 
EditDistance<Integer> {
      *
      * <p>
      * Chas Emerick has written an implementation in Java, which avoids an 
OutOfMemoryError which can occur when my Java implementation is used with very 
large
-     * strings.<br>
+     * strings.
+     * </p>
+     * <p>
      * This implementation of the Levenshtein distance algorithm is from
      * <a 
href="https://www.merriampark.com/ldjava.htm";>http://www.merriampark.com/ldjava.htm</a>
      * </p>

Reply via email to