StringBuffer ret = new StringBuffer(input.length()); int start = 0; int index = -1; final int length = pattern.length(); while ((index = input.indexOf(pattern, start)) >= start) { ret.append(input.substring(start, index)); ret.append(sub); start = index + length; } ret.append(input.substring(start)); return ret.toString();
StringBuffer ret = new StringBuffer(input.length()); int start = 0; int index = -1; final int length = pattern.length(); while ((index = input.indexOf(pattern, start)) >= start) { ret.append(input.substring(start, index)); ret.append(sub); start = index + length; } ret.append(input.substring(start)); return ret.toString();
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/util/StringUtilities.java File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/util/JOrphanUtils.java
Method name: String substitute(String, String, String) Method name: String substitute(String, String, String)
Number of AST nodes: 10 Number of AST nodes: 10
1
StringBuffer ret = new StringBuffer(input.length());
1
StringBuffer ret = new StringBuffer(input.length());
2
		int start = 0;
2
        int start = 0;
3
		int index = -1;
3
        int index = -1;
4
        final int length = pattern.length();
4
        final int length = pattern.length();
5
		while ((index = input.indexOf(pattern, start)) >= start) {
5
        while ((index = input.indexOf(pattern, start)) >= start) {
6
			ret.append(input.substring(start, index));
6
            ret.append(input.substring(start, index));
7
			ret.append(sub);
7
            ret.append(sub);
8
            start = index + length;
8
            start = index + length;
9
		}
10
		
9
        }
11
ret.append(input.substring(start));
10
        ret.append(input.substring(start));
12
		return ret.toString();
11
        return ret.toString();
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.3
Clones locationClones are in different classes
Number of node comparisons36
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements10
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)2.3
    Clone typeType 1
    Mapped Statements
    ID Statement ID Statement
    1
    StringBuffer ret = new StringBuffer(input.length());
    1
    StringBuffer ret = new StringBuffer(input.length());
    2
    int start = 0;
    2
    int start = 0;
    3
    int index = -1;
    3
    int index = -1;
    4
    final int length = pattern.length();
    4
    final int length = pattern.length();
    5
    while ((index = input.indexOf(pattern, start)) >= start)
    5
    while ((index = input.indexOf(pattern, start)) >= start)
    6
    ret.append(input.substring(start, index));
    6
    ret.append(input.substring(start, index));
    7
    ret.append(sub);
    7
    ret.append(sub);
    8
    start = index + length;
    8
    start = index + length;
    9
    ret.append(input.substring(start));
    9
    ret.append(input.substring(start));
    10
    return ret.toString();
    10
    return ret.toString();
    Precondition Violations (0)
    Row Violation