File path: /jEdit-4.2/src/org/gjt/sp/jedit/buffer/LineManager.java | File path: /jEdit-4.2/src/bsh/SimpleNode.java | |||
Method name: void contentInserted(int, int, int, int, IntegerArray)
|
Method name: void jjtAddChild(Node, int)
|
|||
Number of AST nodes: 3 | Number of AST nodes: 3 | |||
1 | int[] lineInfoN = new int[(lineCount + 1) * 2];↵ | |||
2 | System.arraycopy(lineInfo,0,lineInfoN,0,↵ | |||
3 | lineInfo.length);↵ | |||
4 | lineInfo = lineInfoN↵ | 1 | Node c[] = new Node[i + 1];↵ | |
2 | System.arraycopy(children, 0, c, 0, children.length);↵ | |||
5 | ; | 3 | children = c; | |
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 | 9 |
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 2 |
Number of unmapped statements in the second code fragment | 2 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 4 | Node c[] = new Node[i + 1]; | ||||||||||||||||
10 | int[] lineInfoN = new int[(lineCount + 1) * 2]; | | ||||||||||||||||
11 | System.arraycopy(lineInfo, 0, lineInfoN, 0, lineInfo.length); |
| 5 | System.arraycopy(children, 0, c, 0, children.length); | ||||||||||||||
| 6 | children = c; | ||||||||||||||||
12 | lineInfo = lineInfoN; | |
Row | Violation |
---|---|
1 | Type int[] of variable lineInfo does not match with type bsh.Node[] of variable children |