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;
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 | if(ch == c)↵ | | 1 | if(ch == c)↵
|
2 | {↵ | | 2 | {↵
|
3 | if(!haveTokens)↵ | | 3 | if(!haveTokens)↵
|
4 | {↵ | | 4 | {↵
|
5 | tokenHandler.init();↵ | | 5 | tokenHandler.init();↵
|
6 | buffer.markTokens(line,tokenHandler);↵ | | 6 | buffer.markTokens(line,tokenHandler);↵
|
7 | haveTokens = true;↵ | | 7 | haveTokens = true;↵
|
8 | }↵ | | 8 | }↵
|
9 | if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)↵ | | 9 | if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)↵
|
10 | count++;↵ | | 10 | count++;↵
|
11 | }↵ | | 11 | }↵
|
12 | else if(ch == cprime)↵ | | 12 | else if(ch == cprime)↵
|
13 | {↵ | | 13 | {↵
|
14 | if(!haveTokens)↵ | | 14 | if(!haveTokens)↵
|
15 | {↵ | | 15 | {↵
|
16 | tokenHandler.init();↵ | | 16 | tokenHandler.init();↵
|
17 | buffer.markTokens(line,tokenHandler);↵ | | 17 | buffer.markTokens(line,tokenHandler);↵
|
18 | haveTokens = true;↵ | | 18 | haveTokens = true;↵
|
19 | }↵ | | 19 | }↵
|
20 | if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)↵ | | 20 | if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)↵
|
21 | {↵ | | 21 | {↵
|
22 | count--;↵ | | 22 | count--;↵
|
23 | if(count == 0)↵ | | 23 | if(count == 0)↵
|
24 | return buffer.getLineStartOffset(line) + i;↵ | | 24 | return buffer.getLineStartOffset(line) + i;↵
|
25 | | | 25 |
|
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 |