for (EventHook eventHook : eventHooks) { if (eventHook.isInterestedInEvent(event)) { eventHook.event(context, event, file, line, name, type); } }
for (SymbolEntry e = table[index = (hash = internedName.hashCode()) & (table.length - 1)]; e != null; e = e.next) { if (internedName == e.name) { return e.symbol; } }
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/Ruby.java File path: /jruby-1.4.0/src/org/jruby/RubySymbol.java
Method name: void callEventHooks(ThreadContext, RubyEvent, String, int, String, IRubyObject) Method name: RubySymbol fastCreateSymbol(String, SymbolEntry[])
Number of AST nodes: 3 Number of AST nodes: 3
1
for (EventHook eventHook : eventHooks) {
1
for (
2
SymbolEntry e = table[index = (hash = internedName.hashCode()) & (table.length - 1)]; e != null; e = e.next) {
2
            if (eventHook.isInterestedInEvent(event)) {
3
                    if (
3
                eventHook.event(context, event, file, line, name, type);
4
            }
4
internedName == e.name) {
5
                        return e.symbol;
6
                    }
5
        }
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