for (i = coef.length-1; i >= 0; i--) {
b2 = b1;
b1 = b0;
b0 = twox * b1 - b2 + coef[i];
}
twoAgo = oneAgo;
oneAgo = c;
offset++;
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/RubyMath.java
|
|
File path: /jruby-1.4.0/src/org/jruby/lexer/yacc/InputStreamLexerSource.java
|
Method name: double chebylevSerie(double, double[])
|
|
Method name: void advance(int)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 3
|
|
1 | for (i = coef.length-1; i >= 0; i--) {↵ | | |
|
2 | b2 = b1;↵ | | 1 | twoAgo = oneAgo;↵
|
3 | b1 = b0;↵ | | 2 | oneAgo = c;↵
|
4 | b0 = twox * b1 - b2 + coef[i];↵ | | 3 | ↵
|
5 | } | | 4 | offset++;
|
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.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 9 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 0 |
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) | 0.0 |
Clone type | Unknown type |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
Precondition Violations (0)
Row |
Violation |