if (subplot != null) {
subplot.zoomRangeAxes(lowerPercent, upperPercent, info, source);
}
else {
// if the source point doesn't fall within a subplot, we do the
// zoom on all subplots...
Iterator iterator = getSubplots().iterator();
while (iterator.hasNext()) {
subplot = (XYPlot) iterator.next();
subplot.zoomRangeAxes(lowerPercent, upperPercent, info, source);
if (subplot != null) {
subplot.zoomDomainAxes(lowerPercent, upperPercent, info, source);
}
else {
// if the source point doesn't fall within a subplot, we do the
// zoom on all subplots...
Iterator iterator = getSubplots().iterator();
while (iterator.hasNext()) {
subplot = (XYPlot) iterator.next();
subplot.zoomDomainAxes(lowerPercent, upperPercent, info,
source);
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/CombinedDomainXYPlot.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/CombinedRangeXYPlot.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if (subplot != null) {↵ | | 1 | if (subplot != null) {↵
|
2 | subplot.zoomRangeAxes(lowerPercent, upperPercent, info, source);↵ | | 2 | subplot.zoomDomainAxes(lowerPercent, upperPercent, info, source);↵
|
3 | }↵ | | 3 | }↵
|
4 | else {↵ | | 4 | else {↵
|
5 | // if the source point doesn't fall within a subplot, we do the↵ | | 5 | // if the source point doesn't fall within a subplot, we do the↵
|
6 | // zoom on all subplots...↵ | | 6 | // zoom on all subplots...↵
|
7 | Iterator iterator = getSubplots().iterator();↵ | | 7 | Iterator iterator = getSubplots().iterator();↵
|
8 | while (iterator.hasNext()) {↵ | | 8 | while (iterator.hasNext()) {↵
|
9 | subplot = (XYPlot) iterator.next();↵ | | 9 | subplot = (XYPlot) iterator.next();↵
|
10 | subplot.zoomRangeAxes(lowerPercent, upperPercent, info,↵ | | 10 | subplot.zoomDomainAxes(lowerPercent, upperPercent, info,↵
|
11 | source);↵ | | 11 | source);↵
|
12 | | | 12 |
|
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 |