File path: /jEdit-4.2/src/org/gjt/sp/jedit/search/HyperSearchRequest.java | File path: /jEdit-4.2/src/org/gjt/sp/jedit/search/SearchAndReplace.java | |||
Method name: int doHyperSearch(Buffer, int, int, DefaultMutableTreeNode)
|
Method name: int _replace(Buffer, SearchMatcher, int, int, boolean)
|
|||
Number of AST nodes: 3 | Number of AST nodes: 3 | |||
1 | boolean endOfLine = (buffer.getLineEndOffset(↵ | 1 | boolean endOfLine = (buffer.getLineEndOffset(↵ | |
2 | buffer.getLineOfOffset(end)) - 1 == end);↵ | 2 | buffer.getLineOfOffset(end)) - 1 == end);↵ | |
3 | Segment text = new Segment();↵ | 3 | Segment text = new Segment();↵ | |
4 | int offset = start; | 4 | int offset = start; | |
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.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 5 |
Number of mapped statements | 3 |
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) | 0.0 |
Clone type | Type 1 |
ID | Statement | ID | Statement | |
---|---|---|---|---|
4 | boolean endOfLine = (buffer.getLineEndOffset(buffer.getLineOfOffset(end)) - 1 == end); | 2 | boolean endOfLine = (buffer.getLineEndOffset(buffer.getLineOfOffset(end)) - 1 == end); | |
5 | Segment text = new Segment(); | 3 | Segment text = new Segment(); | |
6 | int offset = start; | 4 | int offset = start; |
Row | Violation |
---|---|
1 | Clone fragment #1 returns variables offset, text, endOfLine , while Clone fragment #2 returns variables text, offset, endOfLine |