Comparable key = (Comparable) iterator.next();
Number explode = (Number) this.explodePercentages.get(key);
if (explode != null) {
result = Math.max(result, explode.doubleValue());
}
for (Iterator iterator = this.outlierLists.iterator();
iterator.hasNext();) {
OutlierList list = (OutlierList) iterator.next();
if (list.isOverlapped(outlier)) {
updated = updateOutlierList(list, outlier);
}
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/PiePlot.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/OutlierListCollection.java
|
Method name: double getMaximumExplodePercent()
|
|
Method name: boolean add(Outlier)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | Comparable key = (Comparable)↵ | | 1 | for (Iterator iterator = this.outlierLists.iterator(); ↵
|
2 | iterator.next();↵ | | 2 | iterator.hasNext();) {↵
|
3 | Number explode = (Number) this.explodePercentages.get(key);↵ | | 3 | ↵
|
4 | if (explode != null) {↵ | | |
|
5 | result = Math.max(result, explode.doubleValue()); ↵ | | 4 | OutlierList list = (OutlierList) iterator.next();↵
|
| | | 5 | if (list.isOverlapped(outlier)) {↵
|
| | | 6 | updated = updateOutlierList(list, outlier);↵
|
| | | 7 | }↵
|
6 | } | | 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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |