for (int column = 0; column < columnCount; column++) {
if (this.rowRenderingOrder == SortOrder.ASCENDING) {
for (int row = 0; row < rowCount; row++) {
renderer.drawItem(g2, state, dataArea, this,
domainAxis, rangeAxis, currentDataset,
row, column, pass);
}
}
else {
for (int row = rowCount - 1; row >= 0; row--) {
renderer.drawItem(g2, state, dataArea, this,
domainAxis, rangeAxis, currentDataset,
row, column, pass);
}
}
}
for (int column = columnCount - 1; column >= 0; column--) {
if (this.rowRenderingOrder == SortOrder.ASCENDING) {
for (int row = 0; row < rowCount; row++) {
renderer.drawItem(g2, state, dataArea, this,
domainAxis, rangeAxis, currentDataset,
row, column, pass);
}
}
else {
for (int row = rowCount - 1; row >= 0; row--) {
renderer.drawItem(g2, state, dataArea, this,
domainAxis, rangeAxis, currentDataset,
row, column, pass);
}
}
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/CategoryPlot.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/CategoryPlot.java
|
Method name: boolean render(Graphics2D, Rectangle2D, int, PlotRenderingInfo)
|
|
Method name: boolean render(Graphics2D, Rectangle2D, int, PlotRenderingInfo)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | for (int column = 0; column < columnCount; column++) {↵ | | 1 | for (int column = columnCount - 1; column >= 0; column--) {↵
|
2 | if (this.rowRenderingOrder == SortOrder.ASCENDING) {↵ | | 2 | if (this.rowRenderingOrder == SortOrder.ASCENDING) {↵
|
3 | for (int row = 0; row < rowCount; row++) {↵ | | 3 | for (int row = 0; row < rowCount; row++) {↵
|
4 | renderer.drawItem(g2, state, dataArea, this,↵ | | 4 | renderer.drawItem(g2, state, dataArea, this,↵
|
5 | domainAxis, rangeAxis, currentDataset,↵ | | 5 | domainAxis, rangeAxis, currentDataset,↵
|
6 | row, column, pass);↵ | | 6 | row, column, pass);↵
|
7 | }↵ | | 7 | }↵
|
8 | }↵ | | 8 | }↵
|
9 | else {↵ | | 9 | else {↵
|
10 | for (int row = rowCount - 1; row >= 0; row--) {↵ | | 10 | for (int row = rowCount - 1; row >= 0; row--) {↵
|
11 | renderer.drawItem(g2, state, dataArea, this,↵ | | 11 | renderer.drawItem(g2, state, dataArea, this,↵
|
12 | domainAxis, rangeAxis, currentDataset,↵ | | 12 | domainAxis, rangeAxis, currentDataset,↵
|
13 | row, column, pass);↵ | | 13 | row, column, pass);↵
|
14 | }↵ | | 14 | }↵
|
15 | }↵ | | 15 | }↵
|
16 | } | | 16 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.8 |
Clones location | Clones are in the same method |
Number of node comparisons | 26 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 5 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 272.4 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
16 | if (this.rowRenderingOrder == SortOrder.ASCENDING) | | 22 | if (this.rowRenderingOrder == SortOrder.ASCENDING) |
17 | for (int row = 0; row < rowCount; row++) | | 23 | for (int row = 0; row < rowCount; row++) |
18 | renderer.drawItem(g2, state, dataArea, this, domainAxis, rangeAxis, currentDataset, row, column, pass); | | 24 | renderer.drawItem(g2, state, dataArea, this, domainAxis, rangeAxis, currentDataset, row, column, pass); |
| | | | |
19 | for (int row = rowCount - 1; row >= 0; row--) | | 25 | for (int row = rowCount - 1; row >= 0; row--) |
20 | renderer.drawItem(g2, state, dataArea, this, domainAxis, rangeAxis, currentDataset, row, column, pass); | | 26 | renderer.drawItem(g2, state, dataArea, this, domainAxis, rangeAxis, currentDataset, row, column, pass); |
Precondition Violations (0)
Row |
Violation |