if (wantMedian) { int median = (int) (oneSample.getMedian() * height / graphMax); g.setColor(JMeterColor.purple); g.drawLine(x % width, height - median, x % width, (height - median - 1)); }
if (wantThroughput) { int throughput = (int) (oneSample.getThroughput() * height / throughputMax); g.setColor(JMeterColor.dark_green); g.drawLine(x % width, height - throughput, x % width, (height - throughput - 1)); }
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/visualizers/Graph.java File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/visualizers/Graph.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (wantMedian) {
1
if (wantThroughput) {
2
			int median = (int) (oneSample.getMedian() * height / graphMax);
2
			int throughput = (int) (oneSample.getThroughput() * height / throughputMax);
3
			g.setColor(JMeterColor.purple);
3
			g.setColor(JMeterColor.dark_green);
4
			g.drawLine(x % width, height - median, x % width, (height - median - 1));
4
			g.drawLine(x % width, height - throughput, x % width, (height - throughput - 1));
5
		}
5
		}
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