for (Entry e = tab[i]; e != null; e = e.next) { if (e.value.equals(value)) { 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 contains(Object) Method name: RubySymbol createSymbol(String, ByteList, int, SymbolEntry[])
Number of AST nodes: 3 Number of AST nodes: 3
1
for (Entry e = tab[i]; e != null; e = e.next) {
1
for (SymbolEntry e = table[index = hash & (table.length - 1)]; e != null; e = e.next) {
2
                if (e.value.equals(value)) {
2
                    if (hash == e.hash && name.equals(e.name)) {
3
                    return true;
3
                        return 
4
e.symbol;
4
                }
5
                    }
5
            }
6
                }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.1
Clones locationClones are in different classes
Number of node comparisons1