File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/RegEx.java | File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/RegEx.java | |||
Method name: int matchCharArray(Context, Op, int, int, int)
|
Method name: int matchCharArray(Context, Op, int, int, int)
|
|||
Number of AST nodes: 2 | Number of AST nodes: 2 | |||
1 | if (!(offset == con.limit↵ | 1 | if (!(offset == con.limit↵ | |
2 | || offset+1 == con.limit && isEOLChar( target [ offset ] )↵ | 2 | || offset+1 == con.limit && isEOLChar( target [ offset ] )↵ | |
3 | || offset+2 == con.limit && target [ offset ] == CARRIAGE_RETURN↵ | 3 | || offset+2 == con.limit && target [ offset ] == CARRIAGE_RETURN↵ | |
4 | && target [ offset+1 ] == LINE_FEED))↵ | 4 | && target [ offset+1 ] == LINE_FEED))↵ | |
5 | return -1; | 5 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 1.0 |
Clones location | Clones are in the same method |
Number of node comparisons | 5 |
Number of mapped statements | 2 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 2.6 |
Clone type | Type 1 |
ID | Statement | ID | Statement | |
---|---|---|---|---|
115 | if (!(offset == con.limit || offset + 1 == con.limit && isEOLChar(target[offset]) || offset + 2 == con.limit && target[offset] == CARRIAGE_RETURN && target[offset + 1] == LINE_FEED)) | 123 | if (!(offset == con.limit || offset + 1 == con.limit && isEOLChar(target[offset]) || offset + 2 == con.limit && target[offset] == CARRIAGE_RETURN && target[offset + 1] == LINE_FEED)) | |
116 | return -1; | 124 | return -1; |
Row | Violation |
---|