if (Double.isNaN(value)) { throw recv.getRuntime().newErrnoEDOMError(msg); }
for (Entry e = tab[index]; e != null; e = e.next) { if (e.hash == hash) { return true; } }
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/RubyMath.java File path: /jruby-1.4.0/src/org/jruby/util/collections/IntHashMap.java
Method name: void domainCheck(IRubyObject, double, String) Method name: boolean containsKey(int)
Number of AST nodes: 2 Number of AST nodes: 3
1
if (Double.isNaN(value)) {
2
            throw recv.getRuntime().newErrnoEDOMError(msg);
1
for (Entry e = tab[index]; e != null; e = e.next) {
2
            if (e.hash == hash) {
3
                return true;
4
            }
3
        }
5
        }
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