if (this.millisecond != LAST_MILLISECOND_IN_SECOND) { result = new Millisecond(this.millisecond + 1, getSecond()); } else { Second next = (Second) getSecond().next(); if (next != null) { result = new Millisecond(FIRST_MILLISECOND_IN_SECOND, next);
if (this.second != LAST_SECOND_IN_MINUTE) { result = new Second(this.second + 1, getMinute()); } else { Minute next = (Minute) getMinute().next(); if (next != null) { result = new Second(FIRST_SECOND_IN_MINUTE, next);
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/time/Millisecond.java File path: /jfreechart-1.0.10/src/org/jfree/data/time/Second.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (this.millisecond != LAST_MILLISECOND_IN_SECOND) {
1
if (this.second != LAST_SECOND_IN_MINUTE) {
2
            result = new Millisecond(this.millisecond + 1, getSecond());
2
            result = new Second(this.second + 1, getMinute());
3
        }
3
        }
4
        else {
4
        else {
5
            Second next = (Second) getSecond().next();
5
            Minute next = (Minute) getMinute().next();
6
            if (next != null) {
6
            if (next != null) {
7
                result = new Millisecond(FIRST_MILLISECOND_IN_SECOND, next);
7
                result = new Second(FIRST_SECOND_IN_MINUTE, next);
8
            
8
            
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.0
Clones location
Number of node comparisons0