boolean contentRemoved(Buffer buffer, int startLine, int start, int numLines, int length) { int end = start + length; boolean changed = false; if(this.start > start && this.start <= end) { this.start = start; changed = true; } else if(this.start > end) { this.start -= length; changed = true; } if(this.end > start && this.end <= end) { this.end = start; changed = true; } else if(this.end > end) { this.end -= length; changed = true; } if(changed && numLines != 0) { this.startLine = buffer.getLineOfOffset(this.start); this.endLine = buffer.getLineOfOffset(this.end); } return changed;
boolean contentRemoved(Buffer buffer, int startLine, int start, int numLines, int length) { int end = start + length; boolean changed = false; if(this.start > start && this.start <= end) { this.start = start; changed = true; } else if(this.start > end) { this.start -= length; changed = true; } if(this.end > start && this.end <= end) { this.end = start; changed = true; } else if(this.end > end) { this.end -= length; changed = true; } if(changed && numLines != 0) { this.startLine = buffer.getLineOfOffset(this.start); this.endLine = buffer.getLineOfOffset(this.end); } return changed;
Clone fragments detected by clone detection tool
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: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
boolean contentRemoved(Buffer buffer, int startLine, int start,
1
boolean contentRemoved(Buffer buffer, int startLine, int start,
2
			int numLines, int length)
2
			int numLines, int length)
3
		{
3
		{
4
			int end = start + length;
4
			int end = start + length;
5
			boolean changed = false;
5
			boolean changed = false;
6
			if(this.start > start && this.start <= end)
6
			if(this.start > start && this.start <= end)
7
			{
7
			{
8
				this.start = start;
8
				this.start = start;
9
				changed = true;
9
				changed = true;
10
			}
10
			}
11
			else if(this.start > end)
11
			else if(this.start > end)
12
			{
12
			{
13
				this.start -= length;
13
				this.start -= length;
14
				changed = true;
14
				changed = true;
15
			}
15
			}
16
			if(this.end > start && this.end <= end)
16
			if(this.end > start && this.end <= end)
17
			{
17
			{
18
				this.end = start;
18
				this.end = start;
19
				changed = true;
19
				changed = true;
20
			}
20
			}
21
			else if(this.end > end)
21
			else if(this.end > end)
22
			{
22
			{
23
				this.end -= length;
23
				this.end -= length;
24
				changed = true;
24
				changed = true;
25
			}
25
			}
26
			if(changed && numLines != 0)
26
			if(changed && numLines != 0)
27
			{
27
			{
28
				this.startLine = buffer.getLineOfOffset(this.start);
28
				this.startLine = buffer.getLineOfOffset(this.start);
29
				this.endLine = buffer.getLineOfOffset(this.end);
29
				this.endLine = buffer.getLineOfOffset(this.end);
30
			}
30
			}
31
			return changed;
31
			return changed;
32
		
32
		
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0