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

PMD: Useless parentheses 

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/lang/trunk@1671658 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Benedikt Ritter 2015-04-06 19:12:23 +00:00
parent c4c03a33c8
commit d3252a5ca5
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -7006,7 +7006,7 @@ distance is O(nm), but a bound of k allows us to reduce it to O(km) time by only
// compute stripe indices, constrain to array size // compute stripe indices, constrain to array size
final int min = Math.max(1, j - threshold); final int min = Math.max(1, j - threshold);
final int max = (j > Integer.MAX_VALUE - threshold) ? n : Math.min(n, j + threshold); final int max = j > Integer.MAX_VALUE - threshold ? n : Math.min(n, j + threshold);
// the stripe may lead off of the table if s and t are of different sizes // the stripe may lead off of the table if s and t are of different sizes
if (min > max) { if (min > max) {
@ -7109,7 +7109,7 @@ private static double score(final CharSequence first, final CharSequence second)
} }
// Calculate the half length() distance of the shorter String. // Calculate the half length() distance of the shorter String.
final int halflength = (shorter.length() / 2) + 1; final int halflength = shorter.length() / 2 + 1;
// Find the set of matching characters between the shorter and longer strings. Note that // Find the set of matching characters between the shorter and longer strings. Note that
// the set of matching characters may be different depending on the order of the strings. // the set of matching characters may be different depending on the order of the strings.