for (String methodName: methods.keySet()) {
if (!EXCLUDE_METHODS.contains(methodName)) {
names.add(methodName);
methodNames.append(runtime.newString(methodName));
}
}
if (Double.isNaN(value)) {
throw recv.getRuntime().newErrnoEDOMError(msg);
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/javasupport/proxy/JavaProxyClass.java
|
|
File path: /jruby-1.4.0/src/org/jruby/RubyMath.java
|
Method name: RubyObject get_with_class(IRubyObject, IRubyObject)
|
|
Method name: void domainCheck(IRubyObject, double, String)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 2
|
|
1 | for (String methodName: methods.keySet()) {↵ | | |
|
2 | if (!EXCLUDE_METHODS.contains(methodName)) {↵ | | |
|
3 | names.add(methodName);↵ | | |
|
4 | methodNames.append(r↵ | | 1 | if (Double.isNaN(value)) {↵
|
5 | untime.newString(methodName));↵ | | 2 | throw recv.getRuntime().new↵
|
6 | }↵ | | |
|
7 | ↵ | | 3 | ErrnoEDOMError(msg);↵
|
8 | } | | 4 | }
|
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 different classes |
Number of node comparisons | 6 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 2 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 0.6 |
Clone type | Type 3 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
49 | if (!EXCLUDE_METHODS.contains(methodName)) | | 1 | if (Double.isNaN(value)) |
| | | 2 | throw recv.getRuntime().newErrnoEDOMError(msg); |
50 | | | | |
51 | methodNames.append(runtime.newString(methodName)); | | | |
Precondition Violations (1)
Row |
Violation |
1 | Unmatched throw recv.getRuntime().newErrnoEDOMError(msg); |