if (markers != null) {
Iterator iterator = markers.iterator();
while (iterator.hasNext()) {
Marker m = (Marker) iterator.next();
m.removeChangeListener(this);
}
markers.clear();
}
if (markers != null) {
Iterator iterator = markers.iterator();
while (iterator.hasNext()) {
Marker m = (Marker) iterator.next();
m.removeChangeListener(this);
}
markers.clear();
}
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:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if (markers != null) {↵ | | 1 | if (markers != null) {↵
|
2 | Iterator iterator = markers.iterator();↵ | | 2 | Iterator iterator = markers.iterator();↵
|
3 | while (iterator.hasNext()) {↵ | | 3 | while (iterator.hasNext()) {↵
|
4 | Marker m = (Marker) iterator.next();↵ | | 4 | Marker m = (Marker) iterator.next();↵
|
5 | m.removeChangeListener(this);↵ | | 5 | m.removeChangeListener(this);↵
|
6 | }↵ | | 6 | }↵
|
7 | markers.clear();↵ | | 7 | markers.clear();↵
|
8 | } | | 8 | }
|
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.0 |
Clones location | |
Number of node comparisons | 0 |