File path: /jEdit-4.2/src/org/gjt/sp/jedit/textarea/Selection.java | File path: /jEdit-4.2/src/org/gjt/sp/jedit/textarea/Selection.java | |||
Method name: boolean contentRemoved(Buffer, int, int, int, int)
|
Method name: boolean contentRemoved(Buffer, int, int, int, int)
|
|||
Number of AST nodes: 18 | Number of AST nodes: 18 | |||
1 | int end = start + length;↵ | 1 | int end = start + length;↵ | |
2 | boolean changed = false;↵ | 2 | boolean changed = false;↵ | |
3 | if(this.start > start && this.start <= end)↵ | 3 | if(this.start > start && this.start <= end)↵ | |
4 | {↵ | 4 | {↵ | |
5 | this.start = start;↵ | 5 | this.start = start;↵ | |
6 | changed = true;↵ | 6 | changed = true;↵ | |
7 | }↵ | 7 | }↵ | |
8 | else if(this.start > end)↵ | 8 | else if(this.start > end)↵ | |
9 | {↵ | 9 | {↵ | |
10 | this.start -= length;↵ | 10 | this.start -= length;↵ | |
11 | changed = true;↵ | 11 | changed = true;↵ | |
12 | }↵ | 12 | }↵ | |
13 | if(this.end > start && this.end <= end)↵ | 13 | if(this.end > start && this.end <= end)↵ | |
14 | {↵ | 14 | {↵ | |
15 | this.end = start;↵ | 15 | this.end = start;↵ | |
16 | changed = true;↵ | 16 | changed = true;↵ | |
17 | }↵ | 17 | }↵ | |
18 | else if(this.end > end)↵ | 18 | else if(this.end > end)↵ | |
19 | {↵ | 19 | {↵ | |
20 | this.end -= length;↵ | 20 | this.end -= length;↵ | |
21 | changed = true;↵ | 21 | changed = true;↵ | |
22 | }↵ | 22 | }↵ | |
23 | if(changed && numLines != 0)↵ | 23 | if(changed && numLines != 0)↵ | |
24 | {↵ | 24 | {↵ | |
25 | this.startLine = buffer.getLineOfOffset(this.start);↵ | 25 | this.startLine = buffer.getLineOfOffset(this.start);↵ | |
26 | this.endLine = buffer.getLineOfOffset(this.end);↵ | 26 | this.endLine = buffer.getLineOfOffset(this.end);↵ | |
27 | }↵ | 27 | }↵ | |
28 | return changed; | 28 |
| |
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) | 2.0 |
Clones location | Clones are in the same java file |
Number of node comparisons | 154 |
Number of mapped statements | 18 |
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) | 4.2 |
Clone type | Type 1 |
ID | Statement | ID | Statement | |
---|---|---|---|---|
1 | int end = start + length; | 1 | int end = start + length; | |
2 | boolean changed = false; | 2 | boolean changed = false; | |
3 | if (this.start > start && this.start <= end) | 3 | if (this.start > start && this.start <= end) | |
4 | this.start = start; | 4 | this.start = start; | |
5 | changed = true; | 5 | changed = true; | |
6 | else if (this.start > end) | 6 | else if (this.start > end) | |
7 | this.start -= length; | 7 | this.start -= length; | |
8 | changed = true; | 8 | changed = true; | |
9 | if (this.end > start && this.end <= end) | 9 | if (this.end > start && this.end <= end) | |
10 | this.end = start; | 10 | this.end = start; | |
11 | changed = true; | 11 | changed = true; | |
12 | else if (this.end > end) | 12 | else if (this.end > end) | |
13 | this.end -= length; | 13 | this.end -= length; | |
14 | changed = true; | 14 | changed = true; | |
15 | if (changed && numLines != 0) | 15 | if (changed && numLines != 0) | |
16 | this.startLine = buffer.getLineOfOffset(this.start); | 16 | this.startLine = buffer.getLineOfOffset(this.start); | |
17 | this.endLine = buffer.getLineOfOffset(this.end); | 17 | this.endLine = buffer.getLineOfOffset(this.end); | |
18 | return changed; | 18 | return changed; |
Row | Violation |
---|