if (!previousPtsAlloc) { // If first dot, just draw the point. g.drawLine(x % width, d.height - data, x % width, d.height - data - 1); } else { // Otherwise, draw from previous point. g.drawLine((previousPts[0].x) % width, previousPts[0].y, x % width, d.height - data); }
if (!previousPtsAlloc) { // If first dot, just draw the point g.drawLine(x % width, d.height - data, x % width, d.height - data - 1); } else { // Otherwise, draw from previous point g.drawLine((previousPts[currPreviousPts].x) % width, previousPts[currPreviousPts].y, x % width, d.height - data); }
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/visualizers/GraphAccum.java File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/visualizers/GraphAccum.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (!previousPtsAlloc) {
1
if (!previousPtsAlloc) {
2
			// If first dot, just draw the point.
2
					// If first dot, just draw the point
3
			g.drawLine(x % width, d.height - data, x % width, d.height - data - 1);
3
					g.drawLine(x % width, d.height - data, x % width, d.height - data - 1);
4
		} else {
4
				} else {
5
			// Otherwise, draw from previous point.
5
					// Otherwise, draw from previous point
6
			g.drawLine((previousPts[0].x) % width, previousPts[0].y, x % width, 
6
					g.drawLine((previousPts[currPreviousPts].x) % width, previousPts[currPreviousPts].y, x % width,
7
d.height - data);
7
							d.height - data);
8
		}
8
				}
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