for (int t = 0; t < keys.size(); t++) { String key = (String) keys.elementAt(t); Vector temp = (Vector) data.get(key); for (int j = 0; j < temp.size(); j++) { float f = ((Integer) temp.elementAt(j)).intValue(); maxValue = Math.max(f, maxValue);
for (int t = 0; t < keys.size(); t++) { String key = (String) keys.elementAt(t); Vector temp = (Vector) data.get(key); for (int j = 0; j < temp.size(); j++) { float f = ((Integer) temp.elementAt(j)).intValue(); minValue = Math.min(f, minValue);
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/reporters/FileReporter.java File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/reporters/FileReporter.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for (int t = 0; t < keys.size(); t++) {
1
for (int t = 0; t < keys.size(); t++) {
2
			String key = (String) keys.elementAt(t);
2
			String key = (String) keys.elementAt(t);
3
			Vector temp = (Vector) data.get(key);
3
			Vector temp = (Vector) data.get(key);
4
			for (int j = 0; j < temp.size(); j++) {
4
			for (int j = 0; j < temp.size(); j++) {
5
				float f = ((Integer) temp.elementAt(j)).intValue();
5
				float f = ((Integer) temp.elementAt(j)).intValue();
6
				maxValue = Math.max(f, maxValue);
6
				minValue = Math.min(f, minValue);
7
			
7
			
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.0
Clones location
Number of node comparisons0