for (Entry e = tab[index]; e != null; e = e.next) {
if (e.hash == hash) {
return true;
}
}
if(thisClass.equals(Character.class)) {
if(Number.class.isAssignableFrom(otherClass)) {
return true;
}
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/util/collections/IntHashMap.java
|
|
File path: /jruby-1.4.0/src/org/jruby/javasupport/JavaClass.java
|
Method name: boolean containsKey(int)
|
|
Method name: boolean assignable(Class>, Class>)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (Entry e = tab[index]; e != null; e = e.next) {↵ | | |
|
2 | if (e.hash == hash↵ | | 1 | if(thisClass.equals(Character.class)) {↵
|
3 | ) {↵ | | 2 | if(Number.class.isAssignableFrom(otherClass)) {↵
|
4 | return true;↵ | | 3 | return true;↵
|
5 | }↵ | | 4 | }↵
|
6 | } | | 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 |