for (Entry e = tab[i]; e != null; e = e.next) { if (e.value.equals(value)) { return true; } }
for (VariableTableEntry e = table[internedName.hashCode() & (table.length - 1)]; e != null; e = e.next) { if (internedName == e.name) { return true; } }
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/runtime/builtin/InstanceVariableTable.java
Method name: boolean contains(Object) Method name: boolean fastHashContains(String)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (Entry e = tab[i]; e != null; e = e.next) {
1
for (VariableTableEntry e = table[internedName.hashCode() & (table.length - 1)]; e != null; e = e.next) {
2
                if (e.value.equals(value)) {
2
            
3
    
3
if (internedName == e.name) {
4
                return true;
4
                return true;
5
                }
5
            
6
    
6
}
7
        }
7
        }
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