for (SymbolEntry e = table[index = (hash = internedName.hashCode()) & (table.length - 1)]; e != null; e = e.next) {
if (internedName == e.name) {
return e.symbol;
}
}
for (SymbolEntry e = (table = symbolTable)[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/RubySymbol.java
|
|
File path: /jruby-1.4.0/src/org/jruby/RubySymbol.java
|
Method name: RubySymbol fastCreateSymbol(String, SymbolEntry[])
|
|
Method name: RubySymbol lookup(String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (SymbolEntry e = table[index = (hash = internedName.hashCode()) & (table.length - 1)]; e != null; e = e.next) {↵ | | 1 | for (SymbolEntry e = (table = symbolTable)[hash & (table.length - 1)]; e != null; e = e.next) {↵
|
2 | if (internedName == e.name) {↵ | | 2 | if (hash == e.hash && name.equals(e.name)) {↵
|
3 | return e.symbol;↵ | | 3 | return e.symbol;↵
|
4 | }↵ | | 4 | ↵
|
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 declared in the same class |
Number of node comparisons | 1 |