char c = lineText.charAt(i);
switch(c)
{
case '(':
parenWeight++;
break;
case ')':
parenWeight--;
break;
default:
}
char c = lineText.charAt(i);
switch(c)
{
case '(':
openParens.push(new Integer(i));
break;
case ')':
if(openParens.size() > 0)
openParens.pop();
break;
default:
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/Buffer.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/Buffer.java
|
Method name: int getLineParenWeight(int)
|
|
Method name: int getOpenParenIndent(int, int)
|
Number of AST nodes: 9
|
|
Number of AST nodes: 10
|
|
1 | char c = lineText.charAt(i);↵ | | 1 | char c = lineText.charAt(i);↵
|
2 | switch(c)↵ | | 2 | switch(c)↵
|
3 | {↵ | | 3 | {↵
|
4 | case '(':↵ | | 4 | case '(':↵
|
5 | parenWeight++;↵ | | 5 | openParens.push(new Integer(i));↵
|
6 | break;↵ | | 6 | break;↵
|
7 | case ')':↵ | | 7 | case ')':↵
|
8 | parenWeight--;↵ | | 8 | ↵
|
| | | 9 | if(openParens.size() > 0)↵
|
| | | 10 | openParens.pop();↵
|
9 | break;↵ | | 11 | break;↵
|
10 | default:↵ | | 12 | default:↵
|
11 | } | | 13 | }
|
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 | Clones are declared in the same class |
Number of node comparisons | 1 |