if(!haveTokens) { tokenHandler.init(); buffer.markTokens(line,tokenHandler); haveTokens = true; } if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket) { count--; if(count == 0) return buffer.getLineStartOffset(line) + i; }
if(!haveTokens) { tokenHandler.init(); buffer.markTokens(line,tokenHandler); haveTokens = true; } if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket) { count--; if(count == 0) return buffer.getLineStartOffset(line) + i; }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/TextUtilities.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/TextUtilities.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if(!haveTokens)
1
if(!haveTokens)
2
						{
2
						{
3
							tokenHandler.init();
3
							tokenHandler.init();
4
							buffer.markTokens(line,tokenHandler);
4
							buffer.markTokens(line,tokenHandler);
5
							haveTokens = true;
5
							haveTokens = true;
6
						}
6
						}
7
						if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)
7
						if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)
8
						{
8
						{
9
							count--;
9
							count--;
10
							if(count == 0)
10
							if(count == 0)
11
								return buffer.getLineStartOffset(line) + i;
11
								return buffer.getLineStartOffset(line) + i;
12
						}
12
						}
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