if( m_zptr[ i ] == 0 )
{
m_origPtr = i;
break;
}
if(ring[i] != rem
&& ring[i].hashcode == rem.hashcode
&& ring[i].str.equals(rem.str))
{
// we don't want duplicate
// entries in the kill ring
kill = i;
break;
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/installer/CBZip2OutputStream.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/buffer/KillRing.java
|
Method name: void doReversibleTransformation()
|
|
Method name: void changed(UndoManager.Remove)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | if( m_zptr[ i ] == 0 )↵ | | 1 | if(↵
|
2 | {↵ | | |
|
3 | m_origPtr = i;↵ | | |
|
4 | break;↵ | | |
|
5 | ↵ | | 2 | ring[i] != rem↵
|
| | | 3 | && ring[i].hashcode == rem.hashcode↵
|
| | | 4 | && ring[i].str.equals(rem.str))↵
|
| | | 5 | {↵
|
| | | 6 | // we don't want duplicate↵
|
| | | 7 | // entries in the kill ring↵
|
| | | 8 | kill = i;↵
|
| | | 9 | break;↵
|
6 | } | | 10 | }
|
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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |