git-svn-id: https://svn.apache.org/repos/asf/commons/proper/lang/trunk@1136518 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Matthew Jason Benson 2011-06-16 16:12:40 +00:00
parent f1b8ec1888
commit 15f4c21a3b
1 changed files with 1 additions and 1 deletions

View File

@ -6167,7 +6167,7 @@ allows us to retain the previous cost counts as required by the algorithm (takin
* @param s the first String, must not be null
* @param t the second String, must not be null
* @param threshold the target threshold, must not be negative
* @return result distance, or -1 if the distance would be greater than the threshold
* @return result distance, or {@code -1} if the distance would be greater than the threshold
* @throws IllegalArgumentException if either String input {@code null} or negative threshold
*/
public static int getLevenshteinDistance(CharSequence s, CharSequence t, int threshold) {