for (int i = 0; i < tags.length; i++) { if (tags[i].equals(mode)) { return i; } }
if (!m_isLong) { if (0 == peekAtChar()) { getChar(); } }
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/timers/ConstantThroughputTimerBeanInfo.java File path: /jakarta-jmeter-2.3.2/src/org/apache/commons/cli/avalon/CLArgsParser.java
Method name: int getCalcModeAsInt(String) Method name: void parseArguments()
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < tags.length; i++) {
1
if (!m_isLong) {
2
			if (tags[i].equals(mode)) {
2
					if (
3
			    return i
3
0 == peekAtChar()) {
4
;
4
						getChar();
5
			}
5
					}
6
		}
6
				}
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.1
Clones locationClones are in different classes
Number of node comparisons1