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()) {
ValueTick tick = (ValueTick) iterator.next();
CategoryItemRenderer renderer1 = getRenderer();
if (renderer1 != null) {
renderer1.drawRangeGridline(g2, this,
getRangeAxis(), dataArea, tick.getValue());
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 | while (iterator.hasNext()) {↵ | | 1 | while (iterator.hasNext()) {↵
|
2 | CategoryDataset d = (CategoryDataset) iterator.next();↵ | | 2 | ValueTick tick = (ValueTick) iterator.next();↵
|
3 | CategoryItemRenderer r = getRendererForDataset(d);↵ | | 3 | CategoryItemRenderer renderer1 = getRenderer↵
|
| | | 4 | ();↵
|
4 | if (r != null) {↵ | | 5 | if (renderer1 != null) {↵
|
5 | result = Range.combine(result, r.findRangeBounds(d↵ | | 6 | renderer1.drawRangeGridline(g2, this,↵
|
6 | ));↵ | | 7 | getRangeAxis(), dataArea, tick.getValue());↵
|
7 | | | 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 |