File path: /jEdit-4.2/src/org/gjt/sp/util/SegmentBuffer.java | File path: /jEdit-4.2/src/org/gjt/sp/jedit/buffer/ContentManager.java | |||
Method name: void ensureCapacity(int)
|
Method name: void ensureCapacity(int)
|
|||
Number of AST nodes: 3 | Number of AST nodes: 3 | |||
1 | char[] arrayN = new char[capacity * 2];↵ | 1 | char[] textN = new char[capacity * 2];↵ | |
2 | System.arraycopy(array,0,arrayN,0,count);↵ | 2 | System.arraycopy(↵ | |
3 | array = array↵ | 3 | text,0,textN,0,length + (gapEnd - gapStart));↵ | |
4 | N; | 4 | text = textN; | |
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) | 0.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 9 |
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 2 |
ID | Statement | ID | Statement | |||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4 | char[] arrayN = new char[capacity * 2]; |
| 2 | char[] textN = new char[capacity * 2]; | ||||||||||||||||
5 | System.arraycopy(array, 0, arrayN, 0, count); |
| 3 | System.arraycopy(text, 0, textN, 0, length + (gapEnd - gapStart)); | ||||||||||||||||
6 | array = arrayN; |
| 4 | text = textN; |
Row | Violation |
---|