if (cacheEntry != null) { if (cacheEntry.token == getCacheToken()) { return cacheEntry; } }
for(Entry e = tab[index]; e != null; e = e.next) { if (e.hash == hash) { return e; } }
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/RubyModule.java File path: /jruby-1.4.0/src/org/jruby/util/collections/IntHashMap.java
Method name: CacheEntry cacheHit(String) Method name: Entry getEntry(int)
Number of AST nodes: 3 Number of AST nodes: 3
1
if (cacheEntry != null) {
2
            if (cacheEntry.token == getCacheToken()
1
for(Entry e = tab[index]; e != null; e = e.next) {
3
) {
2
            if (e.hash == hash) {
4
                return cacheEntry;
3
                return e;
5
            }
4
            }
6
        }
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.2
Clones locationClones are in different classes
Number of node comparisons1