int at = differenceAt(s1, s2); if (at == -1) { return ""; return s2.substring(at);
if (str1 == null || str2 == null) { return 0; int lengthToMatch = Math.min(str1.length(), str2.length()); int diff = 0; for (int i = 0; i < lengthToMatch; i++) { if (str1.charAt(i) == str2.charAt(i)) { diff++; ...
if (str1 == null) { return str2; if (str2 == null) { return str1; int at = indexOfDifference(str1, str2); if (at == -1) { ...
if (str1 == null) { return str2; if (str2 == null) { return str1; int at = indexOfDifference(str1, str2); if (at == -1) { ...
if (str1 == null) { return str2; if (str2 == null) { return str1; int at = indexOfDifference(str1, str2); if (at == INDEX_NOT_FOUND) { ...
Compares two Strings, and returns the portion where they differ.
if (str1 == null) return str2; if (str2 == null) return str1; int at = indexOfDifference(str1, str2); if (at == -1) return EMPTY; return str2.substring(at); ...
boolean res = false; if (string1 != null && string2 == null) { res = true; } else if (string1 == null && string2 != null) { res = true; } else if (string1 != null && string2 != null) { if (!string1.equalsIgnoreCase(string2)) { res = true; ...
String[] paths1 = split(xpath1); String[] paths2 = split(xpath2); int length = Math.min(paths1.length, paths2.length); int index = 0; while (index < length && paths1[index].equals(paths2[index])) { index++; StringBuffer b = new StringBuffer(); ...
int i; for (i = 0; (i < s1.length()) && (i < s2.length()); ++i) { if (s1.charAt(i) != s2.charAt(i)) { break; if ((i < s2.length()) || (i < s1.length())) { return i; ...
if (es1 == null || es2 == null) { return 0; int lengthToMatch = Math.min(es1.length(), es2.length()); int diff = 0; for (int i = 0; i < lengthToMatch; i++) { if (es1.charAt(i) == es2.charAt(i)) { diff++; ...