char ch = lineText.array[lineText.offset + i];
if(ch == c)
{
if(!haveTokens)
{
tokenHandler.init();
buffer.markTokens(line,tokenHandler);
haveTokens = true;
}
if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)
count++;
}
else if(ch == cprime)
{
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;
char ch = lineText.array[lineText.offset + i];
if(ch == c)
{
if(!haveTokens)
{
tokenHandler.init();
buffer.markTokens(line,tokenHandler);
haveTokens = true;
}
if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)
count++;
}
else if(ch == cprime)
{
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 | char ch = lineText.array[lineText.offset + i];↵ | | 1 | char ch = lineText.array[lineText.offset + i];↵
|
2 | if(ch == c)↵ | | 2 | if(ch == c)↵
|
3 | {↵ | | 3 | {↵
|
4 | if(!haveTokens)↵ | | 4 | if(!haveTokens)↵
|
5 | {↵ | | 5 | {↵
|
6 | tokenHandler.init();↵ | | 6 | tokenHandler.init();↵
|
7 | buffer.markTokens(line,tokenHandler);↵ | | 7 | buffer.markTokens(line,tokenHandler);↵
|
8 | haveTokens = true;↵ | | 8 | haveTokens = true;↵
|
9 | }↵ | | 9 | }↵
|
10 | if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)↵ | | 10 | if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)↵
|
11 | count++;↵ | | 11 | count++;↵
|
12 | }↵ | | 12 | }↵
|
13 | else if(ch == cprime)↵ | | 13 | else if(ch == cprime)↵
|
14 | {↵ | | 14 | {↵
|
15 | if(!haveTokens)↵ | | 15 | if(!haveTokens)↵
|
16 | {↵ | | 16 | {↵
|
17 | tokenHandler.init();↵ | | 17 | tokenHandler.init();↵
|
18 | buffer.markTokens(line,tokenHandler);↵ | | 18 | buffer.markTokens(line,tokenHandler);↵
|
19 | haveTokens = true;↵ | | 19 | haveTokens = true;↵
|
20 | }↵ | | 20 | }↵
|
21 | if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)↵ | | 21 | if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)↵
|
22 | {↵ | | 22 | {↵
|
23 | count--;↵ | | 23 | count--;↵
|
24 | if(count == 0)↵ | | 24 | if(count == 0)↵
|
25 | return buffer.getLineStartOffset(line) + i;↵ | | 25 | return buffer.getLineStartOffset(line) + i;↵
|
26 | | | 26 |
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |