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
commit 5fea6e2183e0832ea332a28228bc1fc773b4c647
Author: Gary D. Gregory <garydgreg...@gmail.com>
AuthorDate: Sun Jul 20 10:01:51 2025 -0400
Javadoc
---
.../org/apache/commons/text/similarity/LevenshteinDetailedDistance.java | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
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 78505991..f5f80ad1 100644
---
a/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
+++
b/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
@@ -314,7 +314,7 @@ public class LevenshteinDetailedDistance implements
EditDistance<LevenshteinResu
* p, the second int[]. Doing so allows us to retain the previous cost
counts as required by the algorithm (taking the minimum of the cost count to the
* left, up one, and diagonally up and to the left of the current cost
count being calculated). (Note that the arrays aren't really copied anymore,
just
* switched...this is clearly much better than cloning an array or
doing a System.arraycopy() each time through the outer loop.)
- *
+ *
* Effectively, the difference between the two implementations is this
one does not cause an out of memory condition when calculating the LD over two
* very large strings.
*/
