if (this.minMiddleIndex >= 0) { long s = getDataItem(this.minMiddleIndex).getPeriod().getStart() .getTime(); long e = getDataItem(this.minMiddleIndex).getPeriod().getEnd() .getTime(); long minMiddle = s + (e - s) / 2; if (middle < minMiddle) { this.minMiddleIndex = index; } } else { this.minMiddleIndex = index; }
if (this.maxMiddleIndex >= 0) { long s = getDataItem(this.maxMiddleIndex).getPeriod().getStart() .getTime(); long e = getDataItem(this.maxMiddleIndex).getPeriod().getEnd() .getTime(); long maxMiddle = s + (e - s) / 2; if (middle > maxMiddle) { this.maxMiddleIndex = index; } } else { this.maxMiddleIndex = index; }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/time/TimePeriodValues.java File path: /jfreechart-1.0.10/src/org/jfree/data/time/TimePeriodValues.java
Method name: void updateBounds(TimePeriod, int) Method name: void updateBounds(TimePeriod, int)
Number of AST nodes: 7 Number of AST nodes: 7
1
if (this.minMiddleIndex >= 0) {
1
if (this.maxMiddleIndex >= 0) {
2
            long s = getDataItem(this.minMiddleIndex).getPeriod().getStart()
2
            long s = getDataItem(this.maxMiddleIndex).getPeriod().getStart()
3
                .getTime();
3
                .getTime();
4
            long e = getDataItem(this.minMiddleIndex).getPeriod().getEnd()
4
            long e = getDataItem(this.maxMiddleIndex).getPeriod().getEnd()
5
                .getTime();
5
                .getTime();
6
            long minMiddle = s + (e - s) / 2;
6
            long maxMiddle = s + (e - s) / 2;
7
            if (middle < minMiddle) {
7
            if (middle > maxMiddle) {
8
                this.minMiddleIndex = index;           
8
                this.maxMiddleIndex = index;           
9
            }
9
            }
10
        }
10
        }
11
        else {
11
        else {
12
            this.minMiddleIndex = index;
12
            this.maxMiddleIndex = index;
13
        }
13
        }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.1
Clones locationClones are in the same method
Number of node comparisons1