for (Entry e = tab[index]; e != null; e = e.next) {
if (e.hash == hash) {
return true;
}
}
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/util/collections/IntHashMap.java
|
|
File path: /jruby-1.4.0/src/org/jruby/RubySymbol.java
|
Method name: boolean containsKey(int)
|
|
Method name: RubySymbol createSymbol(String, ByteList, int, SymbolEntry[])
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (Entry e = tab[index]; e != null; e = e.next) {↵ | | 1 | for (SymbolEntry e = table[index = hash & (table.length - 1)]; e != null; e = e.next) {↵
|
2 | if (e.hash == hash) {↵ | | 2 | if (hash == e.hash↵
|
| | | 3 | && name.equals(e.name)) {↵
|
3 | return true;↵ | | 4 | return ↵
|
4 | }↵ | | |
|
| | | 5 | e.symbol;↵
|
| | | 6 | }↵
|
5 | } | | 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 |