for(int i = offset; i < lineText.count; 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;
}
}
}
for(int i = offset; i >= 0; 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: int findMatchingBracket(Buffer, int, int)
|
|
Method name: int findMatchingBracket(Buffer, int, int)
|
Number of AST nodes: 18
|
|
Number of AST nodes: 18
|
|
1 | for(int i = offset; i < lineText.count; i++)↵ | | 1 | for(int i = offset; i >= 0; i--)↵
|
2 | {↵ | | 2 | {↵
|
3 | char ch = lineText.array[lineText.offset + i];↵ | | 3 | char ch = lineText.array[lineText.offset + i];↵
|
4 | if(ch == c)↵ | | 4 | if(ch == c)↵
|
5 | {↵ | | 5 | {↵
|
6 | if(!haveTokens)↵ | | 6 | if(!haveTokens)↵
|
7 | {↵ | | 7 | {↵
|
8 | tokenHandler.init();↵ | | 8 | tokenHandler.init();↵
|
9 | buffer.markTokens(line,tokenHandler);↵ | | 9 | buffer.markTokens(line,tokenHandler);↵
|
10 | haveTokens = true;↵ | | 10 | haveTokens = true;↵
|
11 | }↵ | | 11 | }↵
|
12 | if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)↵ | | 12 | if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)↵
|
13 | count++;↵ | | 13 | count++;↵
|
14 | }↵ | | 14 | }↵
|
15 | else if(ch == cprime)↵ | | 15 | else if(ch == cprime)↵
|
16 | {↵ | | 16 | {↵
|
17 | if(!haveTokens)↵ | | 17 | if(!haveTokens)↵
|
18 | {↵ | | 18 | {↵
|
19 | tokenHandler.init();↵ | | 19 | tokenHandler.init();↵
|
20 | buffer.markTokens(line,tokenHandler);↵ | | 20 | buffer.markTokens(line,tokenHandler);↵
|
21 | haveTokens = true;↵ | | 21 | haveTokens = true;↵
|
22 | }↵ | | 22 | }↵
|
23 | if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)↵ | | 23 | if(getTokenAtOffset(tokenHandler.getTokens(),i).id == idOfBracket)↵
|
24 | {↵ | | 24 | {↵
|
25 | count--;↵ | | 25 | count--;↵
|
26 | if(count == 0)↵ | | 26 | if(count == 0)↵
|
27 | return buffer.getLineStartOffset(line) + i;↵ | | 27 | return buffer.getLineStartOffset(line) + i;↵
|
28 | }↵ | | 28 | }↵
|
29 | }↵ | | 29 | }↵
|
30 | } | | 30 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 1.5 |
Clones location | Clones are in the same method |
Number of node comparisons | 80 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 17 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 288.5 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
45 | char ch = lineText.array[lineText.offset + i]; | | 71 | char ch = lineText.array[lineText.offset + i]; |
46 | if (ch == c) | | 72 | if (ch == c) |
47 | | | 73 | |
48 | | | 74 | |
49 | buffer.markTokens(line, tokenHandler); | | 75 | buffer.markTokens(line, tokenHandler); |
50 | | | 76 | |
51 | if (getTokenAtOffset(tokenHandler.getTokens(), i).id == idOfBracket) | | 77 | if (getTokenAtOffset(tokenHandler.getTokens(), i).id == idOfBracket) |
52 | | | 78 | |
53 | | | 79 | |
54 | | | 80 | |
55 | | | 81 | |
56 | buffer.markTokens(line, tokenHandler); | | 82 | buffer.markTokens(line, tokenHandler); |
57 | | | 83 | |
58 | if (getTokenAtOffset(tokenHandler.getTokens(), i).id == idOfBracket) | | 84 | if (getTokenAtOffset(tokenHandler.getTokens(), i).id == idOfBracket) |
59 | | | 85 | |
60 | | | 86 | |
61 | return buffer.getLineStartOffset(line) + i; | | 87 | return buffer.getLineStartOffset(line) + i; |
Precondition Violations (1)
Row |
Violation |
1 | Clone fragment #1 returns variables haveTokens, count , while Clone fragment #2 returns variables haveTokens, count |