public long skip(long n) { if (position + n <= document.getLength()) { position += n; return n; } else { long oldPos = position; position = document.getLength(); return (document.getLength() - oldPos);
public long skip(long n) { if (position + n <= document.getLength()) { position += n; return n; } else { long oldPos = position; position = document.getLength(); return (document.getLength() - oldPos);
Clone fragments detected by clone detection tool
File path: /sql12/plugins/syntax/src/net/sourceforge/squirrel_sql/plugins/syntax/oster/DocReader.java File path: /sql12/plugins/syntax/src/net/sourceforge/squirrel_sql/plugins/syntax/oster/OsterTextControl.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public long skip(long n)
1
public long skip(long n)
2
	{
2
		{
3
		if (position + n <= document.getLength())
3
			if (position + n <= document.getLength())
4
		{
4
			{
5
			position += n;
5
				position += n;
6
			return n;
6
				return n;
7
		}
7
			}
8
		else
8
			else
9
		{
9
		
10
	{
10
			long oldPos = position;
11
				long oldPos = position;
11
			position = document.getLength();
12
				position = document.getLength();
12
			return (document.getLength() - oldPos);
13
				return (document.getLength() - oldPos);
13
		
14
			
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