for (Entry e = tab[index]; e != null; e = e.next) { if (e.hash == hash) { return true; } }
if ((skey.interestOps() & skey.readyOps() & (SelectionKey.OP_WRITE)) != 0) { if(skey.attachment() == descriptor) { 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/RubyIO.java
Method name: boolean containsKey(int) Method name: boolean waitWritable(ChannelDescriptor)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (Entry e = tab[index]; e != null; e = e.next) {
2
            if (e.hash == hash) {
1
if ((skey.interestOps() & skey.readyOps() & (SelectionKey.OP_WRITE)) != 0) {
2
                        if(skey.attachment() == descriptor) {
3
                return true;
3
                            return true;
4
            }
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.2
Clones locationClones are in different classes
Number of node comparisons1