public float getMax() { float maxValue = 0; 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); } } return (float) (maxValue + maxValue * 0.1);
public float getMin() { float minValue = 9999999; 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); } } return (float) (minValue - minValue * 0.1);
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
public float getMax() {
1
public float getMin() {
2
		float maxValue = 0;
2
		float minValue = 9999999;
3
		for (int t = 0; t < keys.size(); t++) {
3
		for (int t = 0; t < keys.size(); t++) {
4
			String key = (String) keys.elementAt(t);
4
			String key = (String) keys.elementAt(t);
5
			Vector temp = (Vector) data.get(key);
5
			Vector temp = (Vector) data.get(key);
6
			for (int j = 0; j < temp.size(); j++) {
6
			for (int j = 0; j < temp.size(); j++) {
7
				float f = ((Integer) temp.elementAt(j)).intValue();
7
				float f = ((Integer) temp.elementAt(j)).intValue();
8
				maxValue = Math.max(f, maxValue);
8
				minValue = Math.min(f, minValue);
9
			}
9
			}
10
		}
10
		}
11
		return (float) (maxValue + maxValue * 0.1);
11
		return (float) (minValue - minValue * 0.1);
12
	
12
	
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