From 15f4c21a3bf337914864b2f7d78cdeb3d9989164 Mon Sep 17 00:00:00 2001 From: Matthew Jason Benson Date: Thu, 16 Jun 2011 16:12:40 +0000 Subject: [PATCH] javadoc git-svn-id: https://svn.apache.org/repos/asf/commons/proper/lang/trunk@1136518 13f79535-47bb-0310-9956-ffa450edef68 --- src/main/java/org/apache/commons/lang3/StringUtils.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/main/java/org/apache/commons/lang3/StringUtils.java b/src/main/java/org/apache/commons/lang3/StringUtils.java index 019b7695a..6b8c2e459 100644 --- a/src/main/java/org/apache/commons/lang3/StringUtils.java +++ b/src/main/java/org/apache/commons/lang3/StringUtils.java @@ -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) {