File path: /jEdit-4.2/src/org/gjt/sp/jedit/textarea/DisplayManager.java | File path: /jEdit-4.2/src/org/objectweb/asm/ClassWriter.java | |||
Method name: int fvmget(int)
|
Method name: Item get(Item)
|
|||
Number of AST nodes: 2 | Number of AST nodes: 3 | |||
1 | if(lastfvmget == fvmcount - 1↵ | |||
2 | || line < fvm[lastfvmget + 1])↵ | |||
3 | {↵ | |||
4 | return lastfvmget;↵ | |||
5 | ↵ | 1 | for (Item i = tab[index]; i != null; i = i.next) {↵ | |
2 | if (i.hashCode == hashCode && key.isEqualTo(i)) {↵ | |||
3 | return i;↵ | |||
4 | }↵ | |||
6 | } | 5 | } | |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.4 |
Clones location | Clones are in different classes |
Number of node comparisons | 5 |
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 3.8 |
Clone type | Type 2 |
ID | Statement | ID | Statement | ||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
8 | if (lastfvmget == fvmcount - 1 || line < fvm[lastfvmget + 1]) |
| 5 | if (i.hashCode == hashCode && key.isEqualTo(i)) | |||||||||||||||||||
|
| 6 | return i; | ||||||||||||||||||||
9 | return lastfvmget; |
| |
Row | Violation |
---|---|
1 | Unmatched statement return i; cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted |
2 | Unmatched return i; |
3 | Unmatched statement return lastfvmget; cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted |
4 | Unmatched return lastfvmget; |
5 | The refactoring of the clones is infeasible, because the number of macthed statements is equal to zero |