for (int i = 0; i < throwables.length; i++) {
if (checkJavaException(currentThrowable, throwables[0])) {
return context.getRuntime().getTrue();
}
}
for (Entry e = tab[index]; e != null; e = e.next) {
if (e.hash == hash) {
return true;
}
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/javasupport/util/RuntimeHelpers.java
|
|
File path: /jruby-1.4.0/src/org/jruby/util/collections/IntHashMap.java
|
Method name: IRubyObject isJavaExceptionHandled(Throwable, IRubyObject[], ThreadContext)
|
|
Method name: boolean containsKey(int)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < throwables.length; i++) {↵ | | 1 | for (Entry e = tab[index]; e != null; e = e.next) {↵
|
2 | if (checkJavaException(currentThrowable, throwables[0])) {↵ | | 2 | if (e.hash == hash) {↵
|
3 | return context.getRuntime().getTrue();↵ | | 3 | return ↵
|
4 | ↵ | | 4 | true;↵
|
5 | }↵ | | 5 | }↵
|
6 | } | | 6 | }
|
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |