for (int i = 0; i < throwables.length; i++) {
if (checkJavaException(currentThrowable, throwables[0])) {
return context.getRuntime().getTrue();
}
}
for (SymbolEntry e = table[index = hash & (table.length - 1)]; e != null; e = e.next) {
if (hash == e.hash && name.equals(e.name)) {
return e.symbol;
}
}
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/RubySymbol.java
|
Method name: IRubyObject isJavaExceptionHandled(Throwable, IRubyObject[], ThreadContext)
|
|
Method name: RubySymbol createSymbol(String, ByteList, int, SymbolEntry[])
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < throwables.length; i++) {↵ | | 1 | for (SymbolEntry e = table[index = hash & (table.length↵
|
2 | if (checkJavaException(currentThrowable, throwables[0]↵ | | 2 | - 1)]; e != null; e = e.next) {↵
|
3 | )) {↵ | | 3 | if (hash == e.hash && name.equals(e.name)) {↵
|
4 | return context.getRuntime().getTrue();↵ | | 4 | return e.symbol;↵
|
5 | }↵ | | 5 | ↵
|
| | | 6 | }↵
|
6 | } | | 7 | }
|
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 |