Apache
/
commons-lang
mirror of https://github.com/apache/commons-lang.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

LANG-1244: Fix dead links in StringUtils.getLevenshteinDistance() javadoc

This commit is contained in:
pascalschumacher 2016-06-03 17:42:46 +02:00
parent 9010f2ec84
commit 03a2ab275b
2 changed files with 5 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
src/changes/changes.xml
View File

@ -46,6 +46,7 @@ The <action> type attribute can be add,update,fix,remove.
<body> <body>
<release version="3.5" date="tba" description="tba"> <release version="3.5" date="tba" description="tba">
<action issue="LANG-1244" type="fix" dev="pschumacher" due-to="jjbankert">Fix dead links in StringUtils.getLevenshteinDistance() javadoc</action>
<action issue="LANG-1242" type="fix" dev="pschumacher" due-to="Neal Stewart">"\u2284":"&nsub;" mapping missing from EntityArrays#HTML40_EXTENDED_ESCAPE</action> <action issue="LANG-1242" type="fix" dev="pschumacher" due-to="Neal Stewart">"\u2284":"&nsub;" mapping missing from EntityArrays#HTML40_EXTENDED_ESCAPE</action>
<action issue="LANG-1243" type="update" dev="sebb">Simplify ArrayUtils removeElements by using new decrementAndGet() method</action> <action issue="LANG-1243" type="update" dev="sebb">Simplify ArrayUtils removeElements by using new decrementAndGet() method</action>
<action issue="LANG-1189" type="add" dev="sebb" due-to="haiyang li / Matthew Bartenschlag ">Add getAndIncrement/getAndDecrement/getAndAdd/incrementAndGet/decrementAndGet/addAndGet in Mutable* classes</action> <action issue="LANG-1189" type="add" dev="sebb" due-to="haiyang li / Matthew Bartenschlag ">Add getAndIncrement/getAndDecrement/getAndAdd/incrementAndGet/decrementAndGet/addAndGet in Mutable* classes</action>

6
src/main/java/org/apache/commons/lang3/StringUtils.java
View File

@ -7387,12 +7387,14 @@ public static String getCommonPrefix(final String... strs) {
* insertion or substitution).</p> * insertion or substitution).</p>
* *
* <p>The previous implementation of the Levenshtein distance algorithm * <p>The previous implementation of the Levenshtein distance algorithm
* was from <a href="http://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a></p> * was from <a href="https://web.archive.org/web/20120604192456/http://www.merriampark.com/ld.htm">
* https://web.archive.org/web/20120604192456/http://www.merriampark.com/ld.htm</a></p>
* *
* <p>Chas Emerick has written an implementation in Java, which avoids an OutOfMemoryError * <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> * which can occur when my Java implementation is used with very large strings.<br>
* This implementation of the Levenshtein distance algorithm * This implementation of the Levenshtein distance algorithm
* is from <a href="http://www.merriampark.com/ldjava.htm">http://www.merriampark.com/ldjava.htm</a></p> * is from <a href="https://web.archive.org/web/20120526085419/http://www.merriampark.com/ldjava.htm">
* https://web.archive.org/web/20120526085419/http://www.merriampark.com/ldjava.htm</a></p>
* *
* <pre> * <pre>
* StringUtils.getLevenshteinDistance(null, *) = IllegalArgumentException * StringUtils.getLevenshteinDistance(null, *) = IllegalArgumentException