synchronized(classProviders) { if (!classProviders.contains(provider)) { classProviders.add(provider); } }
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/RubyModule.java File path: /jruby-1.4.0/src/org/jruby/util/collections/IntHashMap.java
Method name: void addClassProvider(ClassProvider) Method name: boolean containsKey(int)
Number of AST nodes: 3 Number of AST nodes: 3
1
synchronized(classProviders) {
2
                if (!classProviders.contains(provider)) {
3
                    classProviders.add(provider);
4
    
1
for (Entry e = tab[index]; e != null; e = e.next) {
2
            if (e.hash == hash) {
3
                return true;
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.1
Clones locationClones are in different classes
Number of node comparisons1