while (iterator.hasNext()) {
CategoryDataset d = (CategoryDataset) iterator.next();
CategoryItemRenderer r = getRendererForDataset(d);
if (r != null) {
result = Range.combine(result, r.findRangeBounds(d));
}
}
while (iterator.hasNext()) {
Comparable key = (Comparable) iterator.next();
Number explode = (Number) this.explodePercentages.get(key);
if (explode != null) {
result = Math.max(result, explode.doubleValue());
}
}
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/PiePlot.java
|
Method name: Range getDataRange(ValueAxis)
|
|
Method name: double getMaximumExplodePercent()
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | while (iterator.hasNext()) {↵ | | 1 | while (iterator.hasNext()) {↵
|
2 | CategoryDataset d = (CategoryDataset) iterator.next();↵ | | 2 | C↵
|
3 | CategoryItemRenderer r = getRen↵ | | 3 | omparable key = (Comparable) iterator.next();↵
|
4 | dererForDataset(d);↵ | | 4 | Number explode = (Number) this.explodePercentages.get(key);↵
|
5 | if (r != null) {↵ | | 5 | if (explode != null) {↵
|
6 | result = Range.combine(result, r.findRangeBounds(d));↵ | | 6 | result = Math.max(result, explode.doubleValue()); ↵
|
7 | }↵ | | 7 | }↵
|
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.1 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 1 |