for (int i = 0; i < this.labels.size(); i++) {
PieLabelRecord plr = getPieLabelRecord(i);
if (y > plr.getLowerY()) {
return true;
}
y = plr.getUpperY();
}
for (int c = 0; c < this.data.getColumnCount(); c++) {
Number value = this.data.getValue(r, c);
if (value != null) {
unique.add(value);
}
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/PieLabelDistributor.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/data/general/WaferMapDataset.java
|
Method name: boolean isOverlap()
|
|
Method name: Set getUniqueValues()
|
Number of AST nodes: 5
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < this.labels.size(); i++) {↵ | | 1 | for (int c = 0; c < this.data.getColumnCount(); c++) {↵
|
2 | PieLabelRecord plr = getPieLabelRecord(i);↵ | | 2 | ↵
|
3 | if (y > plr.getLowerY()) {↵ | | |
|
4 | return true;↵ | | |
|
5 | }↵ | | |
|
6 | y = plr.getUpperY(); ↵ | | |
|
| | | 3 | Number value = this.data.getValue(r, c);↵
|
| | | 4 | if (value != null) {↵
|
| | | 5 | unique.add(value);↵
|
| | | 6 | }↵
|
7 | } | | 7 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |