if (this.second != FIRST_SECOND_IN_MINUTE) {
result = new Second(this.second - 1, getMinute());
}
else {
Minute previous = (Minute) getMinute().previous();
if (previous != null) {
result = new Second(LAST_SECOND_IN_MINUTE, previous);
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/Second.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.second != FIRST_SECOND_IN_MINUTE) {↵ | | 1 | if (this.second != LAST_SECOND_IN_MINUTE) {↵
|
2 | result = new Second(this.second - 1, getMinute());↵ | | 2 | result = new Second(this.second + 1, getMinute());↵
|
3 | }↵ | | 3 | }↵
|
4 | else {↵ | | 4 | else {↵
|
5 | Minute previous = (Minute) getMinute().previous();↵ | | 5 | Minute next = (Minute) getMinute().next();↵
|
6 | if (previous != null) {↵ | | 6 | if (next != null) {↵
|
7 | result = new Second(LAST_SECOND_IN_MINUTE, previous);↵ | | 7 | result = new Second(FIRST_SECOND_IN_MINUTE, next);↵
|
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.0 |
Clones location | |
Number of node comparisons | 0 |