if (n > nDigits) {
// digits array shifted, update all
nDigits = n;
intDigits = Math.max(0,Math.min(nDigits + exponent,nDigits));
intLength = intDigits + intZeroes;
decDigits = nDigits - intDigits;
decZeroes = Math.max(0,-(decDigits + exponent));
precision = Math.max(0,precision-1);
}
if (n > nDigits) {
// digits arr shifted, update all
nDigits = n;
intDigits = Math.max(0,Math.min(nDigits + exponent,nDigits));
intLength = intDigits + intZeroes;
decDigits = nDigits - intDigits;
decZeroes = Math.max(0,-(decDigits + exponent));
decLength = decZeroes + decDigits;
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/util/Sprintf.java
|
|
File path: /jruby-1.4.0/src/org/jruby/util/Sprintf.java
|
Method name: boolean rubySprintfToBuffer(ByteList, CharSequence, Args, boolean)
|
|
Method name: boolean rubySprintfToBuffer(ByteList, CharSequence, Args, boolean)
|
Number of AST nodes: 7
|
|
Number of AST nodes: 7
|
|
1 | if (n > nDigits) {↵ | | 1 | if (n > nDigits) {↵
|
2 | // digits array shifted, update all↵ | | 2 | // digits arr shifted, update all↵
|
3 | nDigits = n;↵ | | 3 | nDigits = n;↵
|
4 | intDigits = Math.max(0,Math.min(nDigits + exponent,nDigits));↵ | | 4 | intDigits = Math.max(0,Math.min(nDigits + exponent,nDigits));↵
|
5 | intLength = intDigits + intZeroes;↵ | | 5 | intLength = intDigits + intZeroes;↵
|
6 | decDigits = nDigits - intDigits;↵ | | 6 | decDigits = nDigits - intDigits;↵
|
7 | decZeroes = Math.max(0,-(decDigits + exponent));↵ | | 7 | decZeroes = Math.max(0,-(decDigits + exponent));↵
|
8 | precision = Math.max(0,precision-1);↵ | | 8 | decLength = decZeroes + decDigits;↵
|
9 | } | | 9 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in the same method |
Number of node comparisons | 61 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 7 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 10.2 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
552 | if (n > nDigits) | | 611 | if (n > nDigits) |
553 | | | 612 | |
554 | intDigits = Math.max(0, Math.min(nDigits + exponent, nDigits)); | | 613 | intDigits = Math.max(0, Math.min(nDigits + exponent, nDigits)); |
555 | intLength = intDigits + intZeroes; | | 614 | intLength = intDigits + intZeroes; |
556 | decDigits = nDigits - intDigits; | | 615 | decDigits = nDigits - intDigits; |
557 | decZeroes = Math.max(0, -(decDigits + exponent)); | | 616 | decZeroes = Math.max(0, -(decDigits + exponent)); |
558 | precision = Math.max(0, precision - 1); | | 617 | decLength = decZeroes + decDigits; |
Precondition Violations (2)
Row |
Violation |
1 | Expression decZeroes + decDigits cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Clone fragment #1 returns variables precision, decZeroes, intLength, intDigits , while Clone fragment #2 returns variables decZeroes, intLength, intDigits |