for (String methodName: methods.keySet()) {
if (!EXCLUDE_METHODS.contains(methodName)) {
names.add(methodName);
}
}
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/javasupport/proxy/JavaProxyClass.java
|
|
File path: /jruby-1.4.0/src/org/jruby/util/collections/IntHashMap.java
|
Method name: RubyObject get_with_class(IRubyObject, IRubyObject)
|
|
Method name: boolean containsKey(int)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (String methodName: methods.keySet()) {↵ | | 1 | for (↵
|
2 | ↵ | | 2 | Entry e = tab[index]; e != null; e = e.next) {↵
|
3 | if (!EXCLUDE_METHODS.contains(methodName)) {↵ | | 3 | if (↵
|
4 | names.add(methodName);↵ | | |
|
5 | }↵ | | |
|
6 | ↵ | | 4 | e.hash == hash) {↵
|
| | | 5 | return true;↵
|
| | | 6 | }↵
|
7 | } | | 7 | }
|
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 |