if(profile.allowBuiltin(name)) {
loadService.addBuiltinLibrary(name,lib);
}
for (VariableTableEntry e = table[internedName.hashCode() & (table.length - 1)]; e != null; e = e.next) {
if (internedName == e.name) {
return true;
}
}
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/runtime/builtin/InstanceVariableTable.java
|
Method name: void addBuiltinIfAllowed(String, Library)
|
|
Method name: boolean fastHashContains(String)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 3
|
|
1 | if(profile.allowBuiltin(name)) {↵ | | |
|
2 | loadService.addBuiltinLibrary(name,lib);↵ | | 1 | for (VariableTableEntry e = table[internedName.hashCode() & (table.length - 1)]; e != null; e = e.next) {↵
|
| | | 2 | if (internedName == e.name) {↵
|
| | | 3 | return true;↵
|
| | | 4 | }↵
|
3 | } | | 5 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |